Search

Lingual thyroglossal duct cysts (LTGDCs) are clinically rare and easily misdiagnosed as epiglottic cysts. Misdiagnosis leads to mistreatment; thus,simple diagnosis is important. This study aimed to investigate the characteristics of LTGDCs with flexible laryngoscopy and imaging, improve their diagnosis and explore surgical methods for patients undergoing an initial operation and patients with recurrence.In total, 10 patients with LTGDCs were admitted from April 2014 to December 2020.By reviewing the diagnosis and treatment of the first typical case, the characteristics of LTGDC under flexible laryngoscopy were summarized. According to these characteristic manifestations, a clinical diagnosis of LTGDC was made correctly in the other 9 patients. All 10 patients underwent preoperative CT of the neck and sagittal reconstruction and thyroid ultrasound.Of the 10 patients, the first 2 patients had recurrent LTGDCs after several operations and underwent Sistrunk surgery. The remaining 8 patients were newly diagnosed and underwent endoscopic radical resection with low-temperature coblation; of these patients, 7 had no recurrence, and 1 underwent Sistrunk surgery after developing short-term recurrence. All patients were followed up for 5 months to 6 years after the last operation and were without recurrence.LTGDCs are easily misdiagnosed as epiglottic cysts in the clinic. A correct clinical diagnosis can be made based on the characteristics according to flexible laryngoscopy. To determine the relationship between the cyst and hyoid bone, CT was performed. The surgical method was chosen based on the relationship between the cyst and hyoid bone and history of recurrence.

In order to study the effect of vacancy defects in different directions and concentrations on the friction force of single crystal iron, Using the process of sliding friction monocrystallin...

In the random quantum walk, which is a quantum simulation of the classical walk, data points interacted when selecting the appropriate walk strategy by taking advantage of quantum-entanglement features; thus, the results obtained when the quantum walk is used are different from those when the classical walk is adopted. A new quantum walk clustering algorithm based on space is proposed by applying the quantum walk to clustering analysis. In this algorithm, data points are viewed as walking participants, and similar data points are clustered using the walk function in the pay-off matrix according to a certain rule. The walk process is simplified by implementing a space-combining rule. The proposed algorithm is validated by a simulation test and is proved superior to existing clustering algorithms, namely, Kmeans, PCA + Kmeans, and LDA-Km. The effects of some of the parameters in the proposed algorithm on its performance are also analyzed and discussed. Specific suggestions are provided.

Cloud computing and big data have become the developing engine of current information technology (IT) as a result of the rapid development of IT. However, security protection has become increasingly important for cloud computing and big data, and has become a problem that must be solved to develop cloud computing. The theft of identity authentication information remains a serious threat to the security of cloud computing. In this process, attackers intrude into cloud computing services through identity authentication information, thereby threatening the security of data from multiple perspectives. Therefore, this study proposes a model for cloud computing protection and management based on quantum authentication, introduces the principle of quantum authentication, and deduces the quantum authentication process. In theory, quantum authentication technology can be applied in cloud computing for security protection. This technology cannot be cloned; thus, it is more secure and reliable than classical methods.

With the rapid development of information technology (IT), E-mail has become an important communication tool between human beings. Meanwhile, E-mail safety becomes increasingly important because of its universal applications. In order to overcome shortages of classical E-mail encryption, an E-mail encryption protocol based on quantum teleportation was proposed. It makes quantum encryption of E-mails during sending and receiving processes by taking advantages of entanglement and nonclonability of quantum, thus ensuring safety and reliability of E-mail transmission.

A quantum random walk optimization model and algorithm in network cluster server traffic control and task scheduling is proposed. In order to solve the problem of server load balancing, we research and discuss the distribution theory of energy field in quantum mechanics and apply it to data clustering. We introduce the method of random walk and illuminate what the quantum random walk is. Here, we mainly research the standard model of one-dimensional quantum random walk. For the data clustering problem of high dimensional space, we can decompose onem-dimensional quantum random walk intomone-dimensional quantum random walk. In the end of the paper, we compare the quantum random walk optimization method with GA (genetic algorithm), ACO (ant colony optimization), and SAA (simulated annealing algorithm). In the same time, we prove its validity and rationality by the experiment of analog and simulation.

A quantum optimization scheme in network cluster server task scheduling is proposed. We explore and research the distribution theory of energy field in quantum mechanics; specially, we apply it to data clustering. We compare the quantum optimization method with genetic algorithm (GA), ant colony optimization (ACO), simulated annealing algorithm (SAA). At the same time, we prove its validity and rationality by analog simulation and experiment.