On Guaranteed Detectability for Surveillance Sensor Networks by Yanmin Zhu

“…In this paper, we propose a fully distributed algorithm GAP for energy-efficient event detection for surveillance applications. …”
Get full text

Distributed Vector Quantization over Sensor Network by Chunguang Li, Yiliang Luo

“…A vector quantizer is a system for encoding the original data to reduce the bits needed for communication and storage saving while maintaining the necessary fidelity of the data. …”
Get full text

LOGIC SIMULATION OF LIFE SUPPORT SYSTEM COMPONENT IN REAL TIME by A. S. Marchenko, A. B. Sulin

“…A detailed algorithm of the program made on the basis of an Any Logic software package. …”
Get full text

FedGAN: Federated diabetic retinopathy image generation. by Hassan Kamran, Syed Jawad Hussain, Sohaib Latif, Imtiaz Ali Soomro, Mrim M Alnfiai, Nouf Nawar Alotaibi

“…By federating the GAN's discriminator and generator via the Federated Averaging (FedAvg) algorithm, FedGAN generates high-quality synthetic retinal images while complying with HIPAA and GDPR. …”
Get full text

Distributed Constraint Optimization with Flocking Behavior by Zhengquan Yang, Qing Zhang, Zengqiang Chen

“…First, a bounded potential function to construct the controller is given and a distributed optimization algorithm that makes a group of agents avoid collisions during the evolution is presented. …”
Get full text

Probabilistic Cellular Automata Monte Carlo for the Maximum Clique Problem by Alessio Troiani

“…This is an NP-hard problem and no exact algorithm to solve it exactly in polynomial time is known to exist. …”
Get full text

Search of Fuzzy Periods in the Works of Poetry of Different Authors by Artur Nor, Eugene Korotkov

“…We applied a new method for the identification of fuzzy periods and the insertion and deletion of characters were taken into consideration while studying the works of poetry. The technique employs genetic algorithm, dynamic programming, and the Monte Carlo method. …”
Get full text

Message forwarding based on periodically evolving social characteristics in opportunistic mobile networks by Yong-feng HUANG, Yong-qiang DONG, San-feng ZHANG, Guo-xin WU

“…Moreover, a social-aware routing algorithm, PerEvo, was then designed based on them. …”
Get full text

CRASHWORTHINESS DESIGN AND OPTIMIZATION FOR COLLISION POST OF TRAIN by SHI YueQing, QIN RuiXian, CHEN BingZhi

“…Based on the optimal Latin hypercube experimental design method, a polynomial response surface surrogate model of the specific energy absorption and the peak crush force with respect to the wall thickness of the novel multi-cell collision post was established, the multi-objective optimization problem was conducted using the Non-dominated Sorting Genetic Algorithm-Ⅱ and the Pareto front was obtained. The optimization results show that the total energy and specific energy absorption of the novel multi-cell collision post are improved significantly while meeting the structural lightweight requirements compared with the conventional single-cell structure.…”
Get full text

Self-Organized Clustering Architecture for Vehicular Ad Hoc Networks by Cándido Caballero-Gil, Pino Caballero-Gil, Jezabel Molina-Gil

“…This paper proposes a new system based on 1-hop clustering to reduce the number of VANET communications in dense road traffic scenarios while maintaining the security of communications by combining public-key with secret-key cryptography. …”
Get full text

Cross-layer scheduling and dynamic resource allocation for MIMO-OFDMA/SDMA systems with multi-service by ZHONG Chong-xian1, LI Chun-guo1, YANG Lv-xi1

“…Cross-layer scheduling and dynamic resource allocation problems were investigated for downlink MIMO-OFDMA/SDMA systems with multi-service.Firstly,a mathematical formulation of the optimization problem was provided with the objective of maximizing the total system throughput under various constraints.Secondly,a user group-ing scheme was proposed utilizing clustering analysis method based on the type of services and the spatial compatibility of multiple users with multiple receive antennas.Thirdly,a new cross-layer scheduling and dynamic resource allocation algorithm was developed based on the proposed user grouping scheme combined with the priorities of different service,which maximizes the total system throughput by maximizing the throughput of each subcarrier.Simulation results show that compared with the existing schemes,the proposed algorithms obtain reasonable throughput performance while provide better QoS requirement for each user of different services.…”
Get full text

Energy-efficient cooperative sensing and transmission in relay-assisted cognitive radio network by Li FENG, Yu-jun KUANG, Bin-wei WU, Xin-chuan FU

“…An innovative EE-oriented cooperative sensing and transmission scheme in relay-assisted cognitive radio networks,called energy-efficient best-relay cooperative transmission (BCT) was proposed.Based on the BCT scheme,mean energy efficiency (MEE) maximization problem with sensing duration and transmitting power as optimization variables was modeled for fading channels under constraint of minimal secondary outage probability.By virtue of Jensen’s inequality,the original optimization problem was decomposed into two relatively independent subproblems which solved sensing duration and power allocation respectively.And for the two subproblems,an efficient cross iteration based algorithm was proposed to obtain the suboptimal solutions.Both analytical and simulation results demonstrate that the proposals can achieve significantly higher EE while enhancing reliability of secondary transmission remarkably compared to non-cooperation single cognitive transmission schemesin high QoS requirement.…”
Get full text

Differential privacy protection scheme based on edge betweenness model by Haiping HUANG, Kai WANG, Xiong TANG, Dongjun ZHANG

“…With the continuous development of social network application,user’s personal social data is so sensitive that the problem of privacy protection needs to be solved urgently.In order to reduce the network data sensitivity,a differential privacy protection scheme BCPA based on edge betweenness model was proposed.The 2K sequence corresponding to the graph structure based on the dK model was captured,and 2K sequences based on the edge betweenness centrality were reordered.According to the result of reordering,the 2K sequence was grouped into several sub-sequences,and each sub-sequence was respectively added with noise by a dK perturbation algorithm.Finally,a social network graph satisfying differential privacy was generated according to the new 2K sequences after integration.Based on the real datasets,the scheme was compared with the classical schemes through simulation experiments.The results demonstrate that it improves the accuracy and usability of data while ensuring desired privacy protection level.…”
Get full text

Antioptimisation of Trusses Using Two-Level Population-Based Incremental Learning by Phinit Tontragunrat, Sujin Bureerat

“…The task is to find the optimum solution of common design variables while simultaneously searching for the worst case scenario of those parameters with uncertainties. …”
Get full text

Performance analysis of secrecy rate for SWIPT in massive antenna by Hui BAO, Minmin ZHANG, Yaqing YAO, Hui WANG

“…In the multi-drop broadcast system,the existing research is to optimize the single-user security rate in the complete channel state information.In fact,it’s impossible that there exists only one user in the system.The base station often receives incomplete channel state information.Aiming at this problem,a robust beamforming scheme was proposed.In the multi-user case,considering the influence of channel estimation error on the system security rate,the particle swarm optimization algorithm was used to optimize the emission beamforming vector,artificial noise covariance and power split ratio to ensure that the user collects a certain energy while maximizing the safe transmission rate.The simulation results show that the proposed scheme is slightly lower than the security rate in the ideal case,but it is meaningful to the actual system,taking into account the existence of eavesdropping users and the estimation error.…”
Get full text

Guaranteed convergence control for consensus of mobile sensor networks with dynamical topologies by Xiangshun Li, Cheng Lei, Lijing Dong, Sing-Kiong Nguang

“…The topology graphs over the mobile sensors are unconnected, directed, dynamical and switched periodically at any moment, while the joint graphs of dynamical topologies are connected in a bounded time period. …”
Get full text

Backdoor defense method in federated learning based on contrastive training by Jiale ZHANG, Chengcheng ZHU, Xiang CHENG, Xiaobing SUN, Bing CHEN

“…In response to the inadequacy of existing defense methods for backdoor attacks in federated learning to effectively remove embedded backdoor features from models, while simultaneously reducing the accuracy of the primary task, a federated learning backdoor defense method called ContraFL was proposed, which utilized contrastive training to disrupt the clustering process of backdoor samples in the feature space, thereby rendering the global model classifications in federated learning independent of the backdoor trigger features.Specifically, on the server side, a trigger generation algorithm was developed to construct a generator pool to restore potential backdoor triggers in the training samples of the global model.Consequently, the trigger generator pool was distributed to the participants by the server, where each participant added the generated backdoor triggers to their local samples to achieve backdoor data augmentation.Experimental results demonstrate that ContraFL effectively defends against various backdoor attacks in federated learning, outperforming existing defense methods.…”
Get full text

Multifactor Stock Selection Strategy Based on Machine Learning: Evidence from China by Jieying Gao, Huan Guo, Xin Xu

“…The main findings are as follows: the support vector regression has the most stable successful rate for predicting, while ridge regression and linear regression have the most unstable successful rate with more extreme cases; algorithm of support vector regression fitting higher-degree polynomials in Chinese A-share market is optimized, compared with the traditional linear regression both in terms of stock return and retracement control; the results of support vector regression significantly outperforming the CSI 500 index prove further.…”
Get full text

Low-Complexity Relay Selection for Full-Duplex Random Relay Networks by Jonghyun Bang, Taehyoung Kim

“…In addition, we propose a low-complexity relay selection algorithm that constructs the candidate relay set while considering the selection diversity gain. …”
Get full text

Enhancing Cost and Security of Arabic SMS Messages over Mobile Phone Network by Abdullah Abdullah

“…This paper investigates a novel algorithm for compressing and encrypting Arabic short text messages (SMS messages). …”
Get full text