MIP Models and Hybrid Algorithms for Simultaneous Job Splitting and Scheduling on Unrelated Parallel Machines by Duygu Yilmaz Eroglu, H. Cenk Ozmutlu

“…We developed algorithms that satisfy the adaptation of results of local search into the genetic algorithms with minimum relocation operation of genes’ random key numbers. …”
Get full text

Estimation of Gait Parameters for Transfemoral Amputees Using Lower Limb Kinematics and Deterministic Algorithms by Zohaib Aftab, Gulraiz Ahmed, Asad Ali, Nazia Gillani

“…However, both these algorithms produced inferior accuracy for the TO event with consistent early prediction. …”
Get full text

The Application of Multiobjective Genetic Algorithm to the Parameter Optimization of Single-Well Potential Stochastic Resonance Algorithm Aimed at Simultaneous Determination of Multiple Weak Chromatographic Peaks by Haishan Deng, Shaofei Xie, Bingren Xiang, Ying Zhan, Wei Li, Xiaohua Li, Caiyun Jiang, Xiaohong Wu, Dan Liu

“…Simultaneous determination of multiple weak chromatographic peaks via stochastic resonance algorithm attracts much attention in recent years. …”
Get full text

Enhancing feature selection for multi-pose facial expression recognition using a hybrid of quantum inspired firefly algorithm and artificial bee colony algorithm by Mu Panliang, Sanjay Madaan, Siddiq Ahmed Babikir Ali, Gowrishankar J., Ali Khatibi, Anas Ratib Alsoud, Vikas Mittal, Lalit Kumar, A. Johnson Santhosh

Subjects: Get full text

An optimized deep-forest algorithm using a modified differential evolution optimization algorithm: A case of host-pathogen protein-protein interaction prediction by Jerry Emmanuel, Itunuoluwa Isewon, Jelili Oyelade

“…The results were compared with standard optimization methods such as traditional Bayesian optimization, genetic algorithms, evolutionary strategies, and other machine learning models. …”
Get full text

Genetic Algorithms in Antennas and Smart Antennas Design Overview: Two Novel Antenna Systems for Triband GNSS Applications and a Circular Switched Parasitic Array for WiMax Applications Developments with the Use of Genetic Algorithms by Stylianos C. Panagiotou, Stelios C. A. Thomopoulos, Christos N. Capsalis

“…Genetic algorithms belong to a stochastic class of evolutionary techniques, whose robustness and global search of the solutions space have made them extremely popular among researchers. …”
Get full text

A Relationships-based Algorithm for Detecting the Communities in Social Networks by Sevda Fotovvat, Habib Izadkhah, Javad Hajipour

“…Communities are detected through clustering algorithms. In this paper, we proposed a new clustering algorithm that takes into account the extent of relationships among people. …”
Get full text

Algorithm for scenario benefit route planning based on user’s requests by Nan WANG, Honglei ZHOU, Jinbao LI, Lingli LI

“…Most of the existing research for point of interest route planning only consider the static properties of POI,however,the congestion of the hot spots and users’ discontent may greatly reduce the travel quality.In order to increase the tourists’ satisfaction,the dynamic attributes of POI was considered and a route planning algorithm based on user’s requests was proposed.Firstly,Markov-GM(1,1) forecasting algorithm was designed to predict the number of people in each scenic spot.Markov-GM(1,1) could make the average predication error 12.2% lower than the GM(1,1) algorithm by introducing the predication residual.And then,the forward refinement (FR) algorithm was designed which could avoid visiting the unnecessary place and satisfy user’s requests as well.The average solving time of forward refinement algorithm was 9.4% lower than TMT algorithm under the same amount of user’s requests.Finally,based on the factors such as spot popularity,KL divergence of time,visiting order and distance et al,the scenic route profit planning algorithm which could make the number of Rank 1-5 spots 34.8% higher than Time_Based algorithm and 47.3% higher than Rand_GA algorithm.…”
Get full text

WH-EA: An Evolutionary Algorithm for Wiener-Hammerstein System Identification by J. Zambrano, J. Sanchis, J. M. Herrero, M. Martínez

“…This approach is based on a customized evolutionary algorithm (WH-EA) able to look for the best BLA split, capturing at the same time the process static nonlinearity with high precision. …”
Get full text

Adaptive iterative bit allocation algorithm for MIMO-OFDM system by FAN Ling-yan1, HE Chen2, FENG Guo-rui3

Get full text

Multifeature Fusion Vehicle Detection Algorithm Based on Choquet Integral by Wenhui Li, Peixun Liu, Ying Wang, Hongyin Ni

“…To improve the accuracy of vehicle detection algorithm, we propose a multifeature fusion vehicle detection algorithm based on Choquet integral. …”
Get full text

Optimization of reconfigurable SM2 algorithm over prime filed by Bin LI, Qinglei ZHOU, Xiaojie CHEN, Feng FENG

“…Aiming at the problems of inefficient of software, low utilization of hardware resources and poor scalability of SM2 algorithm, a reconfigurable optimization method of SM2 algorithm over prime filed was proposed.Through in-depth analysis of the SM2 algorithm, starting from different computation stages and characteristics, respectively using KOA fast multiplication, fast modular reduction and Barrett algorithm to achieve recommended or arbitrary parameters of the modular multiplication operation, and the radix-4 extended Euclidean algorithm was optimized and improved to accelerate the modular inverse operation.Then, in the standard projective coordinate system, the Montgomery method was used to improve the efficiency of point multiplication, and the data flow of point addition and double point was optimized to shorten the operation cycle to 12 clocks.At the same time, fast coordinate system conversion was realized inside the FPGA.Finally, the parallel scheduling management of multi-SM2 was designed and implemented to meet the computational requirements of multiple applications.The experimental results show that the optimized SM2 makes full use of FPGA resources and shortens the cycle of point multiplication.The maximum number of calculations per second is 352.48 times higher than the CPU (Intel i5-8300), which improves the performance and scalability.…”
Get full text

Network Optimization Algorithm Based on Power Control and Channel Assignment by Yue Liu, Xiaolei Guo, Xun Zhang

Subjects: Get full text

Target Image Matching Algorithm Based on Binocular CCD Ranging by Dongming Li, Wei Su, Jinhua Yang, Lijuan Zhang

“…Secondly, we deduced the algorithm which was named improved cross-correlation matching algorithm and cubic surface fitting algorithm for target images matched, and it could achieve a subpixel level matching for binocular CCD ranging images. …”
Get full text

Efficient routing algorithm for opportunistic networks based on network coding by Zhi REN, Zhi-hu LIU, Yu-kun YAO, Qian-bin CHEN

Subjects: Get full text

Negative feedback scheduling algorithm based on historical information in SDN by Yingying LYU, Yunfei GUO, Zhenpeng WANG, Guozhen CHENG, Yawen WANG

“…In the current SDN architecture,the controllers suffer from lots of potential attacks.For example,malicious flow rule attacks may introduce fake flow rules to confuse the host.A negative feedback scheduling algorithm based on historical information was proposed,in which hypothesis testing was used to judge the behavior of the attacker and the result will be used as a basis for scheduling.Simulation results and analysis show that,compared with the traditional scheduling methods,the proposed algorithm can increase the attacker’s time cost to a certain extent,so as to effectively defend the attacker’s probe attack.In addition,the more types of controllers,the more difficult it is to break the system.…”
Get full text

Nonparametric Bayesian dictionary learning algorithm based on structural similarity by Daoguang DONG, Guosheng RUI, Wenbiao TIAN, Jian KANG, Ge LIU

“…Though nonparametric Bayesian methods possesses significant superiority with respect to traditional comprehensive dictionary learning methods,there is room for improvement of this method as it needs more consideration over the structural similarity and variability of images.To solve this problem,a nonparametric Bayesian dictionary learning algorithm based on structural similarity was proposed.The algorithm improved the structural representing ability of dictionaries by clustering images according to their non-local structural similarity and introducing block structure into sparse representing of images.Denoising and compressed sensing experiments showed that the proposed algorithm performs better than several current popular unsupervised dictionary learning algorithms.…”
Get full text

Improvement of identity adaptive recognition algorithm in visual sensor network by Na LI, Xiaoning ZHANG, Fang’e ZHU

“…When recognizing the identity in visual sensor network，it’s easily to be interfered with facial expression，illumination condition and shelter，so as to reduce the recognition accuracy.An identity adaptive recognition algorithm based on the improved minimum gray difference tree in visual sensor network was put forward.After gray processing，the minimum gray difference was used to enhance the quality of the image；cost function based on gray level was defined，the match price of each corresponding pair of gray of the image to be recognized and the specified face image were achieved，minimum gray difference tree model was set up，after two image similarity were calculated，the nearest neighbor matching algorithm was directly applied to obtain the image identity corresponding to minimum matching cost in the visual sensor network registration gallery，it was viewed as the identity to be recognized，the adaptive identity recognition was achieved in visual sensor network.Simulation results show that the proposed algorithm has high identification accuracy.…”
Get full text

A TSN traffic scheduling algorithm combined with enqueue shaping by Wenxuan HAN, Hailong ZHU, Xinxin HE, Yanjue LI, Changchuan YIN

“…Most of the existing studies on the scheduling of mixed traffic in time-sensitive network (TSN) focus on how to ensure low-latency of stream reservation (SR) traffic.However, SR traffic blocks best-effort (BE) traffic for a long time will lead to excessive delay in BE traffic, which is not conducive to the state maintenance of network and the management of system.In order to reduce the maximum end-to-end delay of BE messages, a traffic scheduling algorithm which combines with enqueue shaping was proposed.It reduced the blocking of BE traffic by reducing the reserved bandwidth of SR traffic.The algorithm first added enqueue buffers in front of SR queues.Then, the reserved bandwidth ratio among the same priority traffic was adjusted by setting the number of frames in each enqueue buffer entering the SR queue during enqueue shaping.Finally, it jointed egress shaping to reserve bandwidth resources for each SR flow to match its latency requirement.Simulation results showed that combining enqueue shaping can reduce the maximum end-to-end delay of BE messages by 9.66%～75.76%.…”
Get full text

Neutrosophic Clustering Algorithm Based on Sparse Regular Term Constraint by Dan Zhang, Yingcang Ma, Hu Zhao, Xiaofei Yang

“…Clustering algorithm is one of the important research topics in the field of machine learning. …”
Get full text