Cooperative spectrum sensing algorithm based on limiting eigenvalue distribution by Yin MI, Guang-yue LU

“…A novel maximum-minimum eigenvalue (NMME) cooperative spectrum sensing algorithm and threshold decision rule are proposed via analyzing minimum eigenvalue limiting distribution of the covariance matrix of the received signals from multiple cognitive users (CU) by means of latest random matrix theory (RMT).The proposed scheme could not need the prior knowledge of the signal transmitted from primary user (PU) and could effectively overcome the noise uncertainty.At a given probability of false alarm (P<sub>fa</sub>),simulation results show that the proposed scheme can get lower decision threshold and higher probability of detection (P<sub>d</sub>) compared with the original algorithm,and it can also get better detection performance with fewer CU and smaller sample numbers.…”
Get full text

Algorithms and Methods for Individual Source Camera Identification: A Survey by Jaroslaw Bernacki, Rafal Scherer

“…Particular attention is paid to the effectiveness and robustness of the algorithms to different types of interference and their possible application in practical cases, such as law enforcement investigations. …”
Get full text

Systemizing and Transforming Preterm Oral Feeding Through Innovative Algorithms by Rena Rosenthal, Jean Chow, Erin Sundseth Ross, Rudaina Banihani, Natalie Antonacci, Karli Gavendo, Elizabeth Asztalos

“…To complement and support these algorithms, educational materials and a comprehensive documentation process were also created. …”
Get full text

Analysis of algorithms of interference coding and improving the efficiency in the complex systems by Oleg Pavlovich Malofey, Alexander Olegovych Malofey, Anastasia Evgenievna Shangina

Get full text

Exploring Virtual Machine Scheduling Algorithms: A Meta-Analysis by Salman Mahmood, Nor Adnan Yahaya

Get full text

Fast panoramic image stitching algorithm based on parameter regression by Fan GUO, Xiaohu LI, Wentao LIU, Jin TANG

“…In reality, the field of view of images acquired by cameras was usually limited, and the demand for panoramic images was increasing.Therefore, a fast panoramic image stitching algorithm based on parameter regression was proposed for panoramic image sequences.The traditional image registration task was transformed into deep learning combined with machine learning, a multi-scale deep convolutional neural network (MDCNN) based on Gaussian difference pyramid was designed to extract features of stitching images, and LightGBM regression model was used to predict stitching parameters.The transformation matrix and the focal length of the camera were obtained to align the images, and a hyperbolic image fusion algorithm was designed to eliminate the stitching seam between the images.The experimental results show that the proposed algorithm can quickly mosaic images and obtain clearer and more natural panoramic mosaic effects than the existing representative algorithms.It also has good adaptability for infrared images.…”
Get full text

Development of an Algorithm to Determine the Most Efficient Trajectories in Directional Wells by R.R. Francisco, M. Bertuzzi, G.V.V. Ramlov, L.A. Alves, C.E. Metzler

“…To achieve this, the model is based on fundamental principles of mechanics and takes into account factors such as well geometry and the neutral buckling point to define the drill collar length required to avoid structural failures. This algorithm has potential applications in academic research and industry to improve directional drilling strategies, as it can also be used as an educational tool in engineering and applied physics courses.…”
Get full text

Monte Carlo Simulation on Adiabatic Ensembles and a Genetic Algorithm by Fernando M. S. Silva Fernandes

“…This paper concerns interactive Monte Carlo simulations for adiabatic ensembles and a genetic algorithm to research and educational contexts. In the Introduction, we discuss some concepts of thermodynamics, statistical mechanics and ensembles relevant to molecular simulations. …”
Get full text

Advances in Digital Signature Algorithms: Performance, Security and Future Prospects by Lyu Shuhan

“…Each algorithm offers unique advantages: the Rivest – Shamir – Adleman (RSA) provides security through integer factorization, the Digital Signature Algorithm (DSA) through discrete logarithms, and the Elliptic Curve Digital Signature Algorithm (ECDSA) with the efficient elliptic curve cryptography. …”
Get full text

Improved spectral clustering algorithm and its application in MCI detection by Jie XIANG, Dong-qin ZHAO

“…In order to detect mild cognitive impairment (MCI) using functional magnetic resonance imaging (fMRI)，a method based on fMRI clustering was proposed fMRI data were clustered to obtain the blood oxygen level dependence( BOLD) change model of MCI patients，then abnormal patterns were used to detect disease.The traditional spectral clustering algorithm needs to calculate all of the eigenvalue and eigenvector，so time and space complexity is higher.An improved spectral clustering method was proposed which modified the similar matrix construction method and the setting method of σ and k，and then this method was applied to clustering and detection of MCI patients.To verify the performance of the proposed method，the comparison of the clustering result，classification accuracy using traditional algorithm and Nyström is also done.The comparative experimental results show that the proposed method can get BOLD pattern more accurately，the accuracy of MCI detection is higher than the other two algorithms，and the time and space complexity are less than the traditional algorithm.…”
Get full text

User interest-aware content replica optimized placement algorithm by Xiao-long YANG, Xin-xin WANG, Min ZHANG, Ke-ping LONG, Qiong HUANG

“…A user interest-aware content replica optimized placement algorithm (UIARP) is proposed.Firstly,the interest subjects of the user-collective are extracted from their content access logs by clustering algorithms,and according to the weighting of the individual interest degree,their collective interest degree would be got and updated in real time; then under the nonlinear optimization model,replicas of larger collective interest degree have priority to be placed,with the goal of minimizing the average response time,which achieves the maximum match between placing replicas and users’ content demand.This algorithm not only ensures that users get interested replicas quickly,but also improves the system efficiency.From four aspects including average response time,the matching degree of request response,load balancing and the utilization rate of adjacent replicas,using 1-Greedy-Insert or others as compared algorithms,the simulation re-sults show that each metric improves by 30% on average,which verifies the effectiveness of the proposed algorithm.…”
Get full text

NIR Spectroscopy with Application of Chemometric Algorithms in Forensic Wood Analysis by A. N. Khokh, P. S. Voskanyan, A. A. Petrosyan

Get full text

A Novel Hybrid Self-Organizing Clustering Routing Algorithm by Peng Zhu, Fei Jia

“…The routing discovery and routing maintenance algorithm are also described in this paper. As the emulation experiment result shows, there is no significant difference between the routing protocol and the demand-based routing protocol; however, when there are quite a number of nodes in the network, the performance can be greatly enhanced compared with the demand-based routing protocol. …”
Get full text

Blockchain efficient Byzantine fault tolerance consensus algorithm for IIoT by LI Fengqi, SONG Qingqing, XU Hui, DU Xuefeng, GAO Jialong, TONG Ning, WANG Deguang

“…Nodes with high credit were randomly selected as the master node by the adaptive master node algorithm, ensuring its security. Experimental results show that CD-PBFT not only can maintain the safety and liveness of the consensus algorithm but also can reduce network delay by 34.8% and increase throughput by 25.2% compared with PBFT, which meets the double requirements of efficiency and security fault tolerance.…”
Get full text

Improved spectral clustering algorithm and its application in MCI detection by Jie XIANG, Dong-qin ZHAO

“…In order to detect mild cognitive impairment (MCI) using functional magnetic resonance imaging (fMRI)，a method based on fMRI clustering was proposed fMRI data were clustered to obtain the blood oxygen level dependence( BOLD) change model of MCI patients，then abnormal patterns were used to detect disease.The traditional spectral clustering algorithm needs to calculate all of the eigenvalue and eigenvector，so time and space complexity is higher.An improved spectral clustering method was proposed which modified the similar matrix construction method and the setting method of σ and k，and then this method was applied to clustering and detection of MCI patients.To verify the performance of the proposed method，the comparison of the clustering result，classification accuracy using traditional algorithm and Nyström is also done.The comparative experimental results show that the proposed method can get BOLD pattern more accurately，the accuracy of MCI detection is higher than the other two algorithms，and the time and space complexity are less than the traditional algorithm.…”
Get full text

A survey of sequence-to-graph mapping algorithms in the pangenome era by Yingbo Cui, Chenchen Peng, Zeyu Xia, Canqun Yang, Yifei Guo

“…Here, we provide a review of the advancements in sequence-to-graph mapping algorithms in the pangenome era. We also discuss the challenges and opportunities that arise in the context of pangenome graphs.…”
Get full text

Resource Allocation Algorithm Based on Profit Maximization for Crowd Sensing by Kun Gao, Bin Wang, Xinwu Yu

“…The proposed algorithm not only considers the current profit of crowd sensing service request but also considers the long-term expected profits, so as to ensure long-term maximum profit. …”
Get full text

RANSAC based robust localization algorithm for visual sensor network by Bo ZHANG, Hai-yong LUO, Ji-wei LIU, Fang ZHAO

“…Due to node failures or environmental changes,observed data on the target will be error in visual sensor network,so the least squares based multi-vision localization algorithm won’t be accurate.A centralized RANSAC based robust localization method was proposed,which can remove the error data and improve the positioning accuracy.Furthermore,to address this issue,energy imbalance of network nodes in centralized RANSAC where all computing load is executed in one single node,a robust localization algorithm based on distributed RANSAC was also proposed,which can distribute a large number of iterative calculations into each node averagely to ensure the network balance on calculation and energy without affecting the robustness.Finally,through comparing experiments on no-RANSAC,cen-RANSAC and dis-RANSAC,it’s verified that this algorithm can obtain robust and good positioning results in a predetermined probability,and the time complexity was analyzed via experiment.…”
Get full text

A Source Aware Scheduling Algorithm for Time-Optimal Convergecast by Jing Zhao, Yajuan Qin, Dong Yang, Ying Rao

“…Our algorithm is also scalable for schedules with multiple packets and specific transmission latency of a single packet.…”
Get full text

Application of the Levenberg-Marquardt Scheme to the MUSIC Algorithm for AOA Estimation by Joon-Ho Lee, Sung-Woo Cho, So-Hee Jeong

“…We also compare the performance of the MUSIC algorithm with that of the Capon algorithm both for the standard implementation and for the LM-based implementation.…”
Get full text