An Efficient Cluster Head Selection Approach for Collaborative Data Processing in Wireless Sensor Networks by Yan Qiang, Bo Pei, Wei Wei, Yue Li

“…This paper proposes an efficient cluster head selection approach for collaborative data processing in WSNs. The proposed algorithm designs an effective energy-efficient model to select the optimal cluster heads among all nodes fairly, which helps to reduce the impact of the monitoring scheme on the lifetime of network. …”
Get full text

A GenEO Domain Decomposition method for Saddle Point problems by Nataf, Frédéric, Tournier, Pierre-Henri

“…We introduce an adaptive element-based domain decomposition (DD) method for solving saddle point problems defined as a block two by two matrix. The algorithm does not require any knowledge of the constrained space. …”
Get full text

Multi-sensor image fusion based on contrast and directional features optimization by Haiyan Jin, Meng Zhang, Zhaolin Xiao, Yaning Li

“…Then, we compute the decomposition coefficients of visible and infrared images using a low-pass filter on the decomposed data; and finally, we introduce the whale optimization algorithm to search optimal coefficients to reconstruct the final fusion image. …”
Get full text

Mining behavior pattern of mobile malware with convolutional neural network by Xin ZHANG, Weizhong QIANG, Yueming WU, Deqing ZOU, Hai JIN

“…The features extracted by existing malicious Android application detection methods are redundant and too abstract to reflect the behavior patterns of malicious applications in high-level semantics.In order to solve this problem,an interpretable detection method was proposed.Suspicious system call combinations clustering by social network analysis was converted to a single channel image.Convolution neural network was applied to classify Android application.The model trained was used to find the most suspicious system call combinations by convolution layer gradient weight classification activation mapping algorithm,thus mining and understanding malicious application behavior.The experimental results show that the method can correctly discover the behavior patterns of malicious applications on the basis of efficient detection.…”
Get full text

Disturbance Observer-Based Adaptive Neural Network Control of Marine Vessel Systems with Time-Varying Output Constraints by Wei Zhao, Li Tang, Yan-Jun Liu

“…This article investigates an adaptive neural network (NN) control algorithm for marine surface vessels with time-varying output constraints and unknown external disturbances. …”
Get full text

BI-DIRECTIONAL EVOLUTIONARY STRUCTURAL OPTIMIZATION USING ADAPTIVE P-VERSION FINITE ELEMENT METHOD by XU JiaoE, YAO Song, LIU Rong

“…According to the error control parameter setting,the element order is improved adaptively through the element energy error analysis,which effectively improves the finite element calculation accuracy,and the sensitivity filtering algorithm and the stabilization strategy are adopted to mitigate the checkerboard and iterative oscillation phenomenon. …”
Get full text

Comparison of Gaussian Elimination and Cholesky Decomposition Solving A Linear System Of Equation. by Nzabonimpa, Godfrey

“…It is found out that Gaussian elimination is an algorithm in linear algebra for solving a system of linear equations and can also be used to find the rank of a matrix, to calculate the determinant of a matrix, and to calculate the inverse of an invertible square matrix Whereas Cho!…”
Get full text

A Comparison of Gaussian Elimination and Cholesky Decomposition Methods in Solving a System of Linear Equations. by Niringiye, Richard

“…It is found out that Gaussian elimination is an algorithm in linear algebra for solving a system of linear equations and can also be used to find the rank of a matrix, to calculate the determinant of a matrix, and to calculate the inverse of an invertible square matrix Whereas Cholesky decomposition is a decomposition of a Hermitian, positive-definite matrix into the product of a lower triangular matrix and its conjugate transpose, which is useful for efficient numerical solutions.…”
Get full text

Fréchet Random Noise for k-Regime-Switching Mixture Autoregressive Model by Rasaki, Olawale Olanrewaju, Anthony, Gichuhi Waititu, Nafiu, Lukman Abiodun

“…Fréchet Mixture Autoregressive (FMAR) model of k-regime-switching, denoted by FMAR(k; p1, p2 ,, pk ) was developed and Expectation-Maximization (EM) algorithm was used as a method of parameter estimation for the embedded coefficients of AR of k-mixing weights and lag pk. …”
Get full text

Validation of formaldehyde products from three satellite retrievals (OMI SAO, OMPS-NPP SAO, and OMI BIRA) in the marine atmosphere with four seasons of Atmospheric Tomography Missi... by J. Liao, J. Liao, G. M. Wolfe, A. E. Kotsakis, A. E. Kotsakis, A. E. Kotsakis, J. M. Nicely, J. M. Nicely, J. M. St. Clair, J. M. St. Clair, T. F. Hanisco, G. González Abad, C. R. Nowlan, Z. Ayazpour, Z. Ayazpour, I. De Smedt, E. C. Apel, R. S. Hornbrook

“…Here we intercompare three satellite retrievals of total HCHO columns from the Ozone Monitoring Instrument Smithsonian Astrophysical Observatory (OMI SAO (v004)) algorithm, Ozone Mapping and Profiler Suite on Suomi National Polar-orbiting Partnership Smithsonian Astrophysical Observatory (OMPS-NPP SAO) algorithm, and Ozone Monitoring Instrument Belgian Institute for Space Aeronomy (OMI BIRA) algorithm and validate them against in situ observations from the NASA Atmospheric Tomography Mission (ATom) mission. …”
Get full text

Asymptotic Optimality and Rates of Convergence of Quantized Stationary Policies in Continuous-Time Markov Decision Processes by Xiao Wu, Yanqiu Tang

“…Also, we give an iteration algorithm on the approximate optimal policies. Finally, we give an example to illustrate the asymptotic optimality.…”
Get full text

Proactive migration model of SWIM service based on situation awareness by Zhijun WU, Shengyan ZHOU, Jin LEI

“…To solve the problem that in the system wide information management (SWIM) network,the SWIM service provider suffers from SWIM service interruption,service delay increase or service quality degradation due to malicious attack or self-failure.Therefore,a proactive migration model of SWIM service was proposed on the basis of situation awareness,which used the random forest algorithm to timely judge the SWIM service provider security situation.SWIM service authority was actively migrated according to security situation,and the emergencies impact on SWIM services were reduces.Experimental results show that the proposed model can guarantee services continuity in an emergency event,which has higher reliability and stability than SWIM network in which the service migration model is not deployed.…”
Get full text

Anti-packet-loss joint encoding for voice-over-IP steganography by Zhan-zhan GAO, Guang-ming TANG, Wei-wei ZHANG

“…Furthermore, the influences of key parameters on the performance of joint coding were studied. The selection algorithm for optimal parameters was also given. Experimental results show that the proposed joint coding can effectively improve steganographic resistance to packet loss, and decrease the number of modifications to the voice stream.…”
Get full text

Link duration probability based cross-layer routing protocol for epoch-based movement by SUN Jie, GUO Wei

“…The end to end transmission performance is very poor because of routing failure caused by node movement in MANET.To solve this problem,an algorithm for the link duration probability of epoch-based movement was proposed,and based on which a link duration probability based cross-layer routing protocol for epoch-based movement（LPCP） was proposed.LPCP cross-layer interacts with transport layer,and considered both the maximum path availability and the minimum hops of an end to end connection.Three complementary mechanisms:routing switch,save then forward,ack reconfirm were proposed to prevent routing failure and the transmission efficiency reduction.It is shown by computer simulation that LPCP results in a significant improvement of the packet loss caused by routing failure,and increase the throughput much more.…”
Get full text

Research on Parking Service Optimization Based on Permit Reservation and Allocation by Duo Xu, Huijun Sun

“…It first analyzes the characteristics and costs of “arrival priority” and “reservation priority” modes, and then, it proposes the parking permit reservation and allocation mode based on “service order optimization” and designs an “ant colony-genetic” algorithm to solve the optimal service order. The numerical example shows that the measures of quantity control and matching optimization are effective in parking management. …”
Get full text

Communication-efficient distributed precoding design for Massive MIMO by Mian LI, Yang LI, Zonghui ZHANG, Qingjiang SHI

“…A communication-efficient distributed precoding scheme was proposed for multi-baseband processing unit (BBU) baseband processing architecture, aiming to reduce fronthaul data exchange and computational complexity between BBUs.Firstly, a distributed framework based on R-WMMSE algorithm was proposed, which utilized the subspace property of the optimal solution to compress the interactive data losslessly, thereby reducing data exchange.Furthermore, two learnable compression modules based on matrix multiplication were designed, using optimized computing structures and matrix parameters to reduce the parameters and computations while maintaining function expressiveness.Finally, the learnable modules and the distributed precoding framework were jointly optimized with achievable rate as the optimization objective to obtain the final model.The proposed scheme can achieve guaranteed precoding performance under lower requirements on data interaction and computational complexity…”
Get full text

Fast TDOA and FDOA Estimation for Coherent Pulse Signals by Yan Liu, Fucheng Guo

“…The estimates are then refined with the cross-ambiguity function (CAF) algorithm within a small TDOA and FDOA neighborhood. …”
Get full text

Approximate Method to Evaluate Reliability of Complex Networks by Petru Caşcaval

“…The method requires an algorithm for transforming the set of minimal paths into a sum of disjoint products (SDP). …”
Get full text

Research of vehicular cloud storage resource management based on trust mechanism by Jin Wang, Miao Zhang, Xiang Gu, Tiequan Wang, Jie Wang, Liang Chen

“…The model can reasonably arrange the suitable scheduling algorithm according to the attribute characteristics of different kind of service requirements. …”
Get full text

Video description method based on multidimensional and multimodal information by Enjie DING, Zhongyu LIU, Yafeng LIU, Wanli YU

“…In order to solve the problem of complex information representation in automatic video description tasks,a multi-dimensional and multi-modal visual feature extraction and fusion method was proposed.Firstly,multi-dimensional features such as static and dynamic attributes of the video sequence were extracted by transfer learning,and the image description algorithm was also used to extract the semantic information of the key frames in the video.By doing this,the video features extraction was carried out.Then,multi-layer long and short memory networks were used to fuse multi-dimensional and multi-modal information,and finally generated a language description of the video content.Compared with the existing methods,experimental simulations results show that the proposed method achieves better results in the video automatic description task.…”
Get full text