DNA algorithm of primeness test based on finite automaton by YANG Xue-qing, LIU Zhong-kan

“…Finite automaton,a computational model of extremely limited computing ability,was proved to have the capa-bility of solving primeness test by construction.Then,a DNA algorithm of the primeness test based on finite automaton was proposed.Furthermore,the method of constructing the finite automaton was presented in detail.The state of the fi-nite automaton was encoded by single-stranded DNA.The input was encoded by double-stranded DNA.The transition rule was represented by a double strand with a ring.The state of transition was realized by enzyme-mediated chemical reactions.The innovation of the algorithm is that it can be applied not only in primeness test but also in prime factoriza-tion and further in attack of RSA cipher.The advantage of this method is that it can be easily implemented.The time re-quired is polynomial in the size of the problem instead of exponential in the size of the problem.…”
Get full text

Virtual machine placement algorithm based on cuckoo search by Donghan JIANG, Haitao LIN

“…A cuckoo search algorithm was introduced for virtual machine placement.Firstly,the virtual machine placement program was mapped to the nest,and according to the level,the fitness would be divided into top and bottom nest.Secondly,the bottom nest and the top nest were disturbed by the disturbance function.Finally,by selecting,iterations got the best placement scheme.The algorithm was used for physical integration of cloud data centers,minimizing the number of physical machines placed.The algorithm is simulated by Cloudsim and the results show that the proposed method not only avoids the local optimum,but also has higher performance advantages than the reordered grouping genetic algorithm,the group genetic algorithm,the improved least load algorithm and the improved first fit decrease algorithm.…”
Get full text

Low complexity uplink multiuser MIMO detecting algorithm by HEI Yong-qiang1, LI Xiao-hui1, YI Ke-chu1, YANG Hong2

“…Aiming at the uplink multiuser MIMO system,a new space-time detecting algorithm was proposed,in which a linear recombination strategy was imposed on the received signal first,and then the matched filter vectors orthogonal to each users’ interference sets were used to eliminate the interference among users.Finally the signal of each user was line-arly space-time decoded by means of the orthogonal equivalent channel.The design of the algorithm under imperfect channel scenario was also provided.Theory analysis and simulation results reveal that the proposed algorithm has the advantages of low complexity and good robustness,and is superior to other detecting algorithms.…”
Get full text

Grey evaluation model and algorithm of network attack effectiveness by WANG Hui-mei, JIANG Liang, XIAN Ming, WANG Guo-yu

“…Network attack effect evaluation is a complex problem especially in the operation of network attack and de-fence, in which the information is incomplete and vague.The grey system theory is a powerful tool to solve the problem which has a little and uncertain information.A grey evaluation system and model, based on the evaluation index system, was proposed and grey evaluation algorithm was introduced.Using rough set theory, the nonlinear combination weight of evaluation indices was established.A simulation example was also given, which showed that the approach was brief and effective.This approach can be used to evaluate the effectiveness of single attack, as well as to compare like kind attack, so that the attack can be sorted based on the effect evaluation.…”
Get full text

Railway track deflection analysis by using evolutionary algorithms by Pavel Kulich, Otto Plášek

“…The results of the analysis are also presented.…”
Get full text

An algorithm for indoor SARS-CoV-2 transmission by Daniel Maxin, Spencer Gannon

“…It is shown via several examples how this algorithmic modeling approach can be used to run various scenarios in order to predict the efficacy of the intervention.…”
Get full text

Wireless indoor localization technology based on fingerprint algorithm by Mengdan ZHANG, Guangyue LU, Honggang WANG, Jiming LIU

“…Then the principle of the existing indoor localization algorithm and its developing condition at present were summarized. …”
Get full text

DNA algorithm of primeness test based on finite automaton by YANG Xue-qing, LIU Zhong-kan

“…Finite automaton,a computational model of extremely limited computing ability,was proved to have the capa-bility of solving primeness test by construction.Then,a DNA algorithm of the primeness test based on finite automaton was proposed.Furthermore,the method of constructing the finite automaton was presented in detail.The state of the fi-nite automaton was encoded by single-stranded DNA.The input was encoded by double-stranded DNA.The transition rule was represented by a double strand with a ring.The state of transition was realized by enzyme-mediated chemical reactions.The innovation of the algorithm is that it can be applied not only in primeness test but also in prime factoriza-tion and further in attack of RSA cipher.The advantage of this method is that it can be easily implemented.The time re-quired is polynomial in the size of the problem instead of exponential in the size of the problem.…”
Get full text

ALGORITHM OF MANAGEMENT OF PATIENTS WITH SUSPECTED BLUNT CARDIAC TRAUMA by S. R. Gilarevsky, D. A. Kosolapov, P. A. Ivanov, I. M. Kuzmina, P. Yu. Lopotovskiy, A. K. Shabanov, O. V. Baturina

“…Abstract. Contemporary algorithm of diagnostic examination of patients with suspected blunt cardiac trauma is presented. …”
Get full text

A Collaborative Recommend Algorithm Based on Bipartite Community by Yuchen Fu, Quan Liu, Zhiming Cui

“…However, existing algorithms mainly focus on the overall topology structure and those local characteristics could also play an important role in collaborative recommend processing. …”
Get full text

Information entropy based match field cutting algorithm by Peng-hao SUN, Ju-long LAN, Shao-jun ZHANG, Jun-fei LI

“…With the increasing diversity of network functions,packet classification had a higher demand on the number of match fields and depth of match table,which placed a severe burden on the storage capacity of hardware.To ensure the efficiency of matching process while at the same time improve the usage of storage devices,an information entropy based cutting algorithm on match fields was proposed.By the analysis on the redundancy of match fields and distribution pattern in a rule set,a match field cutting model was proposed.With the mapping of matching process to the process of entropy reduction,the complexity of optimal match field cutting was reduced from NP-hard to linear complexity.Experiment results show that compared to existing schemes,this scheme can need 40% less TCAM storage space,and on the other side,with the growing of table size,the time complexity of this algorithm is also far less than other algorithms.…”
Get full text

Asymmetric Event-Driven Localization Algorithm in Constrained Space by Ning Wang, Xiaolin Qin, Xingye Xu

“…We finally perform experiments in indoor corridors, and the results show that the proposed algorithm has higher performances not only on localization accuracy and energy consumption but also on anti-interference ability than RSSI and MSP.…”
Get full text

Routing algorithm for MPLS traffic engineering in satellite network by XIAO Fu1, SUN Li-juan1, YE Xiao-guo1, WANG Ru-chuan1

“…With regard to long transmission delay and dynamic topology characters in satellite network,a novel routing algorithm was proposed in multi-protocol label switching satellite network.The algorithm uses the prior knowledge of source-destination pairs,and link propagation delay is also considered.Based on time-varying topology snapshot of satellite network,initial link weight is defined as function of transmission delay and residual bandwidth.Both current request and future requests are in account when calculate critical degree.Thus traffic engineering is realized by link weight dynamic adjustment and critical links extension loaded,which guarantee resource utilized better.Simulation results demonstrate the algorithm performs better in terms of request reject ratio,total available flow,average hop and transmission delay of least interference paths.…”
Get full text

Universal algorithm of processing of requests with use of parallel technology by Timofeeva N.E., Dmitrieva K.A.

“…In this paper we consider modern methods and models of query processing in databases. We offer an algorithm to service the request of users, which involves the use of parallel technologies in the exchange of information with the nodes of a distributed database and a dictionary, and also allows to increase the query execution time, which in turn will increase the speed of the system as a whole. …”
Get full text

Study of a new fast adaptive filtering algorithm by WANG Zhen-li, ZHANG Xiong-wei, YANG Ji-bin, CHEN Gong

“…The proof of the new algorithm was also presented, which showed that its optimal weight vector was the solution of generalized Wiener equation. …”
Get full text

Genetic Algorithm Application for Synthesis and Analysis of Electromechanical Systems by Bohdan Kopchak, Lidiya Kasha

“…The quality function is proposed to be used in the developed algorithms for analysis and synthesis procedures of electromechanical systems. …”
Get full text

TD algorithm based on double-layer fuzzy partitioning by Xiang MU, Quan LIU, Qi-ming FU, Hong-kun SUN, Xin ZHOU

“…When dealing with the continuous space problems,the traditional Q-iteration algorithms based on lookup-table or function approximation converge slowly and are diff lt to get a continuous policy.To overcome the above weak-nesses,an on-policy TD algorithm named DFP-OPTD was proposed based on double-layer fuzzy partitioning and its convergence was proved.The first layer of fuzzy partitioning was applied for state space,the second layer of fuzzy parti-tioning was applied for action space,and Q-value functions were computed by the combination of the two layer fuzzy partitioning.Based on the Q-value function,the consequent parameters of fuzzy rules were updated by gradient descent method.Applying DFP-OPTD on two classical reinforcement learning problems,experimental results show that the algo-rithm not only can be used to get a continuous action policy,but also has a better convergence performance.…”
Get full text

An Improved Exact Algorithm for Least-Squares Unidimensional Scaling by Gintaras Palubeckis

“…An initial lower bound for the algorithm is provided by an iterated tabu search heuristic. …”
Get full text

Compact quantum algorithms for time-dependent differential equations by Sachin S. Bharadwaj, Katepalli R. Sreenivasan

“…The results offer evidence that the proposed algorithm is amenable for use on near-term quantum devices.…”
Get full text

Toeplitz Matrix Reconstruction Algorithm for Rectangular Hollow Array by Zihui Wei, Jingyi Zhou, Chenkai Dai, Lunsha Wang, Xiangjie Kong, Peng Dong

“…An algorithm for reconstructing Toeplitz matrices in two-dimensional uniform planar arrays is also proposed. …”
Get full text