COMPUTER ALGORITHMS FOR EVALUATION OF SPARKING INDICATED BY OPTOELECTRONIC SPARKING ANALYZER by W. Zelinski

“…Optoelectronic sparking analyzer provides the possibility to realize a number of algorithms that permit to convert indicated light signals containing information on number of sparkings in the measuring cycle and their intensity divided in ten classes. …”
Get full text

Research on parallel partheno genetic algorithm based on the immune programming by XING Xiao-shuai, HUO Bing-peng

“…A novel algorithm parallel partheno genetic algorithm based on the immune programming（IPPPGA） was proposed,the algorithm analogies to the concept and theory of immunity in biotic science and unifies the parallel compu-tation thought,after analyzing the advantages and disadvantages of the partheno genetic algorithm.The theory analysis and experimental results show that the algorithm not only effectively keeps population diversity,but also alleviates the undulate phenomenon in evolutionary latter stages,meanwhile increases the convergent speed and computational effi-ciency greatly.…”
Get full text

Combined approximation algorithms for interactive design of road routes in CAD by D. A. Karpov, V. I. Struchenkov

“…Such a combination of elements provides continuity not only for the curve and its tangent, but also for the curvature. Since the number of spline elements is not known in advance, and their parameters are subject to restrictions, there is no mathematically consistent algorithm for this problem. …”
Get full text

Research and application of traffic engineering algorithm based on deep learning by Daoyun HU, Jin QI, Qianchun LU, Feng LI, Hongqiang FANG

“…With the development and application of 5G network, the amount of traffic in network increased rapidly, which caused the lack of bandwidth resource.In order to improve the utilization of network resource and satisfy the critical user requirement for QoS (quality of service), a novel traffic engineering algorithm based on deep learning in SDN was proposed.At last, simulation results show that the proposed algorithm not only can calculate an efficient path for service in real time, but also can improve the QoS and the utilization of network resource, as well as reduce network congestion.…”
Get full text

Textual and chemical information processing: different domains but similar algorithms by Peter Willett

“…This paper discusses the extent to which algorithms developed for the processing of textual databases are also applicable to the processing of chemical structure databases, and <I>vice</i> <i>versa</i>. …”
Get full text

Research on architecture and algorithm for code resolution system in the internet of things by Hai-ning YU, Hong-li ZHANG, Bin-xing FANG, Xiang-zhan YU

Get full text

Quantum simulation of Pauli channels and dynamical maps: Algorithm and implementation. by Tomás Basile, Carlos Pineda

“…We propose a quantum algorithm for simulating Pauli channels and extend it to encompass Pauli dynamical maps (parametrized Pauli channels). …”
Get full text

Research on Semantic Based NGN Converged Service Composition Algorithm by Rongqun Peng, Lianjun Zhang, Zhengkun Mi

“…Also, a distinct virtue in less time cost and higher composition success rate of the proposed algorithm than that of these existing related algorithms was proved by discussing its performance in detail. …”
Get full text

Channel width adaptation algorithm in multi-channel vehicular networks by PENG Xin, LI Ren-fa, LIU Liang-jiao

“…Aiming at the low utilization of spectrum resource in vehicular networks,an algorithm base on semidefinite programming was presented,which could be utilized to channel width adaptation of multi-channel vehicular networks.Firstly,the algorithm need to measure the distance with the surrounding vehicles to compute conflict graph.And then the semidefinite programming relaxation was employed to coordinate the competition of spectrum resource.Finally,the ultimate channel width adaptation was computed based on the initial channel assignment and compression process.Simulation results demonstrated that the new algorithm not only can promote network throughput,but also perform well on extremely dynamic topology.…”
Get full text

Fleet management algorithm for enhancing environmental friendliness of maritime delivery by Андрій Романов

“…In addition, the results will be validated and the efficiency of the developed algorithm will be compared with a standard genetic algorithm without a speed optimization step. …”
Get full text

Round reduction-based fault attack on SM4 algorithm by Min WANG, Zhen WU, Jin-tao RAO, Hang LING

“…A novel method of fault attack based on round reduction against SM4 algorithm was proposed.Faults were in-jected into the last four rounds of the SM4 encryption algorithm,so that the number of the algorithm's rounds can be re-duced.In known-ciphertext scenario,four traces are enough to recover the total 128 bit master key by screening these faults easily.The proposed attack is made to an unprotected SM4 smart card.Experiment shows that this attack method is efficient,and which not only simplifies the existing differential fault attack,but also improves the feasibility of the attack.…”
Get full text

Assessing the feasibility of quantum learning algorithms for noisy linear problems by Minkyu Kim, Panjin Kim

“…On the other hand, this paper also shows there exist efficient classical algorithms for short integer solution and size-reduced learning with errors problems if the quantum samples used by the previous studies are given.…”
Get full text

Multi-keyword partial matching algorithm based on text fragments by LIAO Wei-qi, ZOU Wei

“…A novel multi-keyword partial matching algorithm was also de- signed and realized which could detect the fraction of keywords in data block without re-flow or re-file. …”
Get full text

Application of genetic algorithms to the evaluation of the fundamental frequency of stiffened plates by M. IWANIEC

“…This paper also aims the study of the influence of geometrical and material parameters of the stiffeners as well as the plate proportions on the fundamental frequency.…”
Get full text

An algorithm for equilibrium problems with mixed-type fixed point constraints. by Lifang Guo, Imo Kalu Agwu, Umar Ishtiaq, Khalid A Alnowibet

Get full text

Realization and discussion of selected artificial intelligence algorithms in computer games by Yurii Tyshchenko

“… The study explores the usage of reinforcement learning algorithms in computer card games, such as Proximal Policy Optimization and Monte Carlo Tree Search. …”
Get full text

RSU deployment planning based on approximation algorithm in urban VANET by Junyu ZHU, Chuanhe HUANG, Xiying FAN, Kuangyu QIN, Bin FU

“…To minimize the number of RSU deployed to cover a specific area,a c street model transforming the area covering problem to streets covering problem was designed,and a greedy-based polynomial (GBP) time approximation algorithm was developed to obtain the optimal RSU deployment for area coverage.For complex urban environments,a Cue model (complex urban environments model) was proposed.In this model,the target area was divided into different partitions.Then,based on shifting strategy,a polynomial time approximation scheme was designed.Theoretical analysis that include the approximation ratio and time complexity of the proposed algorithm were also presented.Simulation results show that GBP can efficiently solve the coverage problem in urban VANET.…”
Get full text

Computation task offloading algorithm and system level simulation for vehicles by Qicheng ZENG, Yuxuan SUN, Sheng ZHOU

“…With the development of autonomous driving and vehicular network,more and more vehicles will have powerful computing capabilities and connection with each other via wireless network.These computing resources can not only be applied to automatic driving,but also provide a wide range of edge computing services.Aiming at the task offloading among vehicles,a distributed task offloading algorithm based on online learning was proposed to minimize the average offloading delay.Furthermore,a system-level simulation platform was built to evaluate the impact of vehicle density and number of tasks on the average offloading delay in both highway and urban scenarios.The results provide a reference for the resource allocation and deployment of task offloading in different traffic situations.…”
Get full text

Graph partition based mapping algorithm on multiprocessors for streaming applications by Qi TANG, Shang-feng WU, Jun-wu SHI, Ji-bo WEI

“…To take advantage of multiprocessor platform,it is a necessity to map tasks of the application properly onto different processors to exploit the concurrency in the application and thus meet the stringent timing requirements.Parallelism graph was proposed to quantify and model the concurrency among tasks of the application.An algorithm was also proposed to construct the parallelism graph based on the self-timed schedule and transform the mapping problem to a graph partitioning problem.The graph partitioning problem as a pure 0-1 integer linear programming model was further formulated and the ILP solver to find the optimal result.A lot of randomly generated synchronous dataflow graphs and a set of practical applications were used to evaluate the performance of the proposed method.The experimental results demonstrate that the proposed method outperforms available algorithms.…”
Get full text

Optimization of Teaching Management System Based on Association Rules Algorithm by Qing Niu

“…Through experiments, the optimized algorithm has greatly improved selection mining and computing time than traditional algorithms.…”
Get full text