Wi-Fi technology has evolved significantly since its introduction in 1997,advancing to Wi-Fi 6 as the latest standard,with Wi-Fi 7 currently under development.Despite these advancements,integrating machine learning in...Wi-Fi technology has evolved significantly since its introduction in 1997,advancing to Wi-Fi 6 as the latest standard,with Wi-Fi 7 currently under development.Despite these advancements,integrating machine learning into Wi-Fi networks remains challenging,especially in decentralized environments with multiple access points(mAPs).This paper is a short review that summarizes the potential applications of federated reinforcement learning(FRL)across eight key areas of Wi-Fi functionality,including channel access,link adaptation,beamforming,multi-user transmissions,channel bonding,multi-link operation,spatial reuse,and multi-basic servic set(multi-BSS)coordination.FRL is highlighted as a promising framework for enabling decentralized training and decision-making while preserving data privacy.To illustrate its role in practice,we present a case study on link activation in a multi-link operation(MLO)environment with multiple APs.Through theoretical discussion and simulation results,the study demonstrates how FRL can improve performance and reliability,paving the way for more adaptive and collaborative Wi-Fi networks in the era of Wi-Fi 7 and beyond.展开更多
Spectrum-based fault localization (SBFL) generates a ranked list of suspicious elements by using the program execution spectrum, but the excessive number of elements ranked in parallel results in low localization accu...Spectrum-based fault localization (SBFL) generates a ranked list of suspicious elements by using the program execution spectrum, but the excessive number of elements ranked in parallel results in low localization accuracy. Most researchers consider intra-class dependencies to improve localization accuracy. However, some studies show that inter-class method call type faults account for more than 20%, which means such methods still have certain limitations. To solve the above problems, this paper proposes a two-phase software fault localization based on relational graph convolutional neural networks (Two-RGCNFL). Firstly, in Phase 1, the method call dependence graph (MCDG) of the program is constructed, the intra-class and inter-class dependencies in MCDG are extracted by using the relational graph convolutional neural network, and the classifier is used to identify the faulty methods. Then, the GraphSMOTE algorithm is improved to alleviate the impact of class imbalance on classification accuracy. Aiming at the problem of parallel ranking of element suspicious values in traditional SBFL technology, in Phase 2, Doc2Vec is used to learn static features, while spectrum information serves as dynamic features. A RankNet model based on siamese multi-layer perceptron is constructed to score and rank statements in the faulty method. This work conducts experiments on 5 real projects of Defects4J benchmark. Experimental results show that, compared with the traditional SBFL technique and two baseline methods, our approach improves the Top-1 accuracy by 262.86%, 29.59% and 53.01%, respectively, which verifies the effectiveness of Two-RGCNFL. Furthermore, this work verifies the importance of inter-class dependencies through ablation experiments.展开更多
Subcellular location is one of the key biological characteristics of proteins. Position-specific profiles （PSP） have been introduced as important characteristics of proteins in this article. In this study, to obtain...Subcellular location is one of the key biological characteristics of proteins. Position-specific profiles （PSP） have been introduced as important characteristics of proteins in this article. In this study, to obtain position-specific profiles, the Position Specific lterative-Basic Local Alignment Search Tool （PSI-BLAST） has been used to search for protein sequences in a database. Position-specific scoring matrices are extracted from the profiles as one class of characteristics. Four-part amino acid compositions and lst-7th order dipeptide compositions have also been calculated as the other two classes of characteristics. Therefore, twelve characteristic vectors are extracted from each of the protein sequences. Next, the characteristic vectors are weighed by a simple weighing function and inputted into a BP neural network predictor named PSP-Weighted Neural Network （PSP-WNN）. The Levenberg-Marquardt algorithm is employed to adjust the weight matrices and thresholds during the network training instead of the error back propagation algorithm. With a jackknife test on the RH2427 dataset, PSP-WNN has achieved a higher overall prediction accuracy of 88.4% rather than the prediction results by the general BP neural network, Markov model, and fuzzy k-nearest neighbors algorithm on this dataset. In addition, the prediction performance of PSP-WNN has been evaluated with a five-fold cross validation test on the PK7579 dataset and the prediction results have been consistently better than those of the previous method on the basis of several support vector machines, using compositions of both amino acids and amino acid pairs. These results indicate that PSP-WNN is a powerful tool for subcellular localization prediction. At the end of the article, influences on prediction accuracy using different weighting proportions among three characteristic vector categories have been discussed. An appropriate proportion is considered by increasing the prediction accuracy.展开更多
In order to simulate the real growing process, a new type of knowledge network growth mechanism based on local world connectivity is constructed. By the mean-field method, theoretical prediction of the degree distribu...In order to simulate the real growing process, a new type of knowledge network growth mechanism based on local world connectivity is constructed. By the mean-field method, theoretical prediction of the degree distribution of the knowledge network is given, which is verified by Matlab simulations. When the new added node＇s local world size is very small, the degree distribution of the knowledge network approximately has the property of scale-free. When the new added node＇s local world size is not very small, the degree distribution transforms from pure power-law to the power-law with an exponential tailing. And the scale-free index increases as the number of new added edges decreases and the tunable parameters increase. Finally, comparisons of some knowledge indices in knowledge networks generated by the local world mechanism and the global mechanism are given. In the long run, compared with the global mechanism, the local world mechanism leads the average knowledge levels to slower growth and brings homogenous phenomena.展开更多
Indoor Wi-Fi localization of mobile devices plays a more and more important role along with the rapid growth of location-based services and Wi-Fi mobile devices.In this paper,a new method of constructing the channel s...Indoor Wi-Fi localization of mobile devices plays a more and more important role along with the rapid growth of location-based services and Wi-Fi mobile devices.In this paper,a new method of constructing the channel state information(CSI)image is proposed to improve the localization accuracy.Compared with previous methods of constructing the CSI image,the new kind of CSI image proposed is able to contain more channel information such as the angle of arrival(AoA),the time of arrival(TOA)and the amplitude.We construct three gray images by using phase differences of different antennas and amplitudes of different subcarriers of one antenna,and then merge them to form one RGB image.The localization method has off-line stage and on-line stage.In the off-line stage,the composed three-channel RGB images at training locations are used to train a convolutional neural network(CNN)which has been proved to be efficient in image recognition.In the on-line stage,images at test locations are fed to the well-trained CNN model and the localization result is the weighted mean value with highest output values.The performance of the proposed method is verified with extensive experiments in the representative indoor environment.展开更多
Geographic location of nodes is very useful in a sensor network. Previous localization algorithms assume that there exist some anchor nodes in this kind of network, and then other nodes are estimated to create their c...Geographic location of nodes is very useful in a sensor network. Previous localization algorithms assume that there exist some anchor nodes in this kind of network, and then other nodes are estimated to create their coordinates. Once there are not anchors to be deployed, those localization algorithms will be invalidated. Many papers in this field focus on anchor-based solutions. The use of anchors introduces many limitations, since anchors require external equipments such as global position system, cause additional power consumption. A novel positioning algorithm is proposed to use a virtual coordinate system based on a new concept--virtual anchor. It is executed in a distributed fashion according to the connectivity of a node and the measured distances to its neighbors. Both the adjacent member information and the ranging distance result are combined to generate the estimated position of a network, one of which is independently adopted for localization previously. At the position refinement stage the intermediate estimation of a node begins to be evaluated on its reliability for position mutation; thus the positioning optimization process of the whole network is avoided falling into a local optimal solution. Simulation results prove that the algorithm can resolve the distributed localization problem for anchor-free sensor networks, and is superior to previous methods in terms of its positioning capability under a variety of circumstances.展开更多
Localization is one of the key technologies in wireless sensor networks,and the existing PSO-based localization methods are based on standard PSO,which cannot guarantee the global convergence.For the sensor network de...Localization is one of the key technologies in wireless sensor networks,and the existing PSO-based localization methods are based on standard PSO,which cannot guarantee the global convergence.For the sensor network deployed in a three-dimensional region,this paper proposes a localization method using stochastic particle swarm optimization.After measuring the distances between sensor nodes,the sensor nodes estimate their locations using stochastic particle swarm optimization,which guarantees the global convergence of the results.The simulation results show that the localization error of the proposed method is almost 40% of that of multilateration,and it uses about 120 iterations to reach the optimizing value,which is 80 less than the standard particle swarm optimization.展开更多
The interpenetrating network structure provides an interesting avenue to novel materials. Locally resonant phononic crystal （LRPC） exhibits excellent sound attenuation performance based on the periodical arrangement...The interpenetrating network structure provides an interesting avenue to novel materials. Locally resonant phononic crystal （LRPC） exhibits excellent sound attenuation performance based on the periodical arrangement of sound wave scatters. Combining the LRPC concept and interpenetrating network glassy structure, this paper has developed a new material which can achieve a wide band underwater strong acoustic absorption. Underwater absorption coefficients of different samples were measured by the pulse tube. Measurement results show that the new material possesses excellent underwater acoustic effects in a wide frequency range.Moreover, in order to investigate impacts of locally resonant units,some defects are introduced into the sample. The experimental result and the theoretical calculation both show that locally resonant units being connected to a network structure play an important role in achieving a wide band strong acoustic absorption.展开更多
The local-world (LW) evolving network model shows a transition for the degree distribution between the exponential and power-law distributions, depending on the LW size. Cascading failures under intentional attacks in...The local-world (LW) evolving network model shows a transition for the degree distribution between the exponential and power-law distributions, depending on the LW size. Cascading failures under intentional attacks in LW network models with different LW sizes were investigated using the cascading failures load model. We found that the LW size has a significant impact on the network's robustness against deliberate attacks. It is much easier to trigger cascading failures in LW evolving networks with a larger LW size. Therefore, to avoid cascading failures in real networks with local preferential attachment such as the Internet, the World Trade Web and the multi-agent system, the LW size should be as small as possible.展开更多
Due to defects of time-difference of arrival localization,which influences by speed differences of various model waveforms and waveform distortion in transmitting process,a neural network technique is introduced to ca...Due to defects of time-difference of arrival localization,which influences by speed differences of various model waveforms and waveform distortion in transmitting process,a neural network technique is introduced to calculate localization of the acoustic emission source.However,in back propagation（BP） neural network,the BP algorithm is a stochastic gradient algorithm virtually,the network may get into local minimum and the result of network training is dissatisfactory.It is a kind of genetic algorithms with the form of quantum chromosomes,the random observation which simulates the quantum collapse can bring diverse individuals,and the evolutionary operators characterized by a quantum mechanism are introduced to speed up convergence and avoid prematurity.Simulation results show that the modeling of neural network based on quantum genetic algorithm has fast convergent and higher localization accuracy,so it has a good application prospect and is worth researching further more.展开更多
The local slopes contain rich information of the reflection geometry,which can be used to facilitate many subsequent procedures such as seismic velocities picking,normal move out correction,time-domain imaging and str...The local slopes contain rich information of the reflection geometry,which can be used to facilitate many subsequent procedures such as seismic velocities picking,normal move out correction,time-domain imaging and structural interpretation.Generally the slope estimation is achieved by manually picking or scanning the seismic profile along various slopes.We present here a deep learning-based technique to automatically estimate the local slope map from the seismic data.In the presented technique,three convolution layers are used to extract structural features in a local window and three fully connected layers serve as a classifier to predict the slope of the central point of the local window based on the extracted features.The deep learning network is trained using only synthetic seismic data,it can however accurately estimate local slopes within real seismic data.We examine its feasibility using simulated and real-seismic data.The estimated local slope maps demonstrate the succes sful performance of the synthetically-trained network.展开更多
The problem of mobile localization for wireless sensor network has attracted considerable attention in recent years. The localization accuracy will drastically grade in non-line of sight(NLOS) conditions. In this pape...The problem of mobile localization for wireless sensor network has attracted considerable attention in recent years. The localization accuracy will drastically grade in non-line of sight(NLOS) conditions. In this paper, we propose a mobile localization strategy based on Kalman filter. The key technologies for the proposed method are the NLOS identification and mitigation. The proposed method does not need the prior knowledge of the NLOS error and it is independent of the physical measurement ways. Simulation results show that the proposed method owns the higher localization accuracy when compared with other methods.展开更多
By considering the eigenratio of the Laplacian matrix as the synchronizability measure, this paper presents an efficient method to enhance the synchronizability of undirected and unweighted networks via rewiring. The ...By considering the eigenratio of the Laplacian matrix as the synchronizability measure, this paper presents an efficient method to enhance the synchronizability of undirected and unweighted networks via rewiring. The rewiring method combines the use of tabu search and a local greedy algorithm so that an effective search of solutions can be achieved. As demonstrated in the simulation results, the performance of the proposed approach outperforms the existing methods for a large variety of initial networks, both in terms of speed and quality of solutions.展开更多
Location estimation of underwater sensor networks(USNs)has become a critical technology,due to its fundamental role in the sensing,communication and control of ocean volume.However,the asynchronous clock,security atta...Location estimation of underwater sensor networks(USNs)has become a critical technology,due to its fundamental role in the sensing,communication and control of ocean volume.However,the asynchronous clock,security attack and mobility characteristics of underwater environment make localization much more challenging as compared with terrestrial sensor networks.This paper is concerned with a privacy-preserving asynchronous localization issue for USNs.Particularly,a hybrid network architecture that includes surface buoys,anchor nodes,active sensor nodes and ordinary sensor nodes is constructed.Then,an asynchronous localization protocol is provided,through which two privacy-preserving localization algorithms are designed to estimate the locations of active and ordinary sensor nodes.It is worth mentioning that,the proposed localization algorithms reveal disguised positions to the network,while they do not adopt any homomorphic encryption technique.More importantly,they can eliminate the effect of asynchronous clock,i.e.,clock skew and offset.The performance analyses for the privacy-preserving asynchronous localization algorithms are also presented.Finally,simulation and experiment results reveal that the proposed localization approach can avoid the leakage of position information,while the location accuracy can be significantly enhanced as compared with the other works.展开更多
Wireless sensor networks （WSNs） consist of sensor nodes that broadcast a message within a network. Efficient broadcasting is a key requirement in sensor networks and has been a focal point of research over the last ...Wireless sensor networks （WSNs） consist of sensor nodes that broadcast a message within a network. Efficient broadcasting is a key requirement in sensor networks and has been a focal point of research over the last few years. There are many challenging tasks in the network, including redundancy control and sensor node localization that mainly depend on broadcasting. In this paper, we propose a broadcasting algorithm to control redundancy and improve localization （BACRIL） in WSNs. The proposed algorithm incorporates the benefits of the gossip protocol for optimizing message broadcasting within the network. Simulation results show a controlled level of redundancy, which is up to 57.6% if the number of sensor nodes deployed in a 500 m×500 m area are increased from 50 to 500.展开更多
This paper investigates the node localization problem for wireless sensor networks in three-dimension space. A distributed localization algorithm is presented based on the rigid graph. Before location, the communicati...This paper investigates the node localization problem for wireless sensor networks in three-dimension space. A distributed localization algorithm is presented based on the rigid graph. Before location, the communication radius is adaptively increasing to add the localizability. The localization process includes three steps: firstly, divide the whole globally rigid graph into several small rigid blocks; secondly, set up the local coordinate systems and transform them to global coordinate system; finally, use the quadrilateration iteration technology to locate the nodes in the wireless sensor network. This algorithm has the advantages of low energy consumption, low computational complexity as well as high expandability and high localizability. Moreover, it can achieve the unique and accurate localization. Finally, some simulations are provided to demonstrate the effectiveness of the proposed algorithm.展开更多
Eye center localization is one of the most crucial and basic requirements for some human-computer interaction applications such as eye gaze estimation and eye tracking. There is a large body of works on this topic in ...Eye center localization is one of the most crucial and basic requirements for some human-computer interaction applications such as eye gaze estimation and eye tracking. There is a large body of works on this topic in recent years, but the accuracy still needs to be improved due to challenges in appearance such as the high variability of shapes, lighting conditions, viewing angles and possible occlusions. To address these problems and limitations, we propose a novel approach in this paper for the eye center localization with a fully convolutional network(FCN),which is an end-to-end and pixels-to-pixels network and can locate the eye center accurately. The key idea is to apply the FCN from the object semantic segmentation task to the eye center localization task since the problem of eye center localization can be regarded as a special semantic segmentation problem. We adapt contemporary FCN into a shallow structure with a large kernel convolutional block and transfer their performance from semantic segmentation to the eye center localization task by fine-tuning.Extensive experiments show that the proposed method outperforms the state-of-the-art methods in both accuracy and reliability of eye center localization. The proposed method has achieved a large performance improvement on the most challenging database and it thus provides a promising solution to some challenging applications.展开更多
Identifying influential nodes in complex networks is one of the most significant and challenging issues,which may contribute to optimizing the network structure,controlling the process of epidemic spreading and accele...Identifying influential nodes in complex networks is one of the most significant and challenging issues,which may contribute to optimizing the network structure,controlling the process of epidemic spreading and accelerating information diffusion.The node importance ranking measures based on global information are not suitable for large-scale networks due to their high computational complexity.Moreover,they do not take into account the impact of network topology evolution over time,resulting in limitations in some applications.Based on local information of networks,a local clustering H-index(LCH)centrality measure is proposed,which considers neighborhood topology,the quantity and quality of neighbor nodes simultaneously.The proposed measure only needs the information of first-order and second-order neighbor nodes of networks,thus it has nearly linear time complexity and can be applicable to large-scale networks.In order to test the proposed measure,we adopt the susceptible-infected-recovered(SIR)and susceptible-infected(SI)models to simulate the spreading process.A series of experimental results on eight real-world networks illustrate that the proposed LCH can identify and rank influential nodes more accurately than several classical and state-of-the-art measures.展开更多
To mitigate the impacts of non-line-of-sight（NLOS） errors on location accuracy, a non-parametric belief propagation（NBP）-based localization algorithm in the NLOS environment for wireless sensor networks is propose...To mitigate the impacts of non-line-of-sight（NLOS） errors on location accuracy, a non-parametric belief propagation（NBP）-based localization algorithm in the NLOS environment for wireless sensor networks is proposed.According to the amount of prior information known about the probabilities and distribution parameters of the NLOS error distribution, three different cases of the maximum a posterior（MAP） localization problems are introduced. The first case is the idealized case, i. e., the range measurements in the NLOS conditions and the corresponding distribution parameters of the NLOS errors are known. The probability of a communication of a pair of nodes in the NLOS conditions and the corresponding distribution parameters of the NLOS errors are known in the second case. The third case is the worst case, in which only knowledge about noise measurement power is obtained. The proposed algorithm is compared with the maximum likelihood-simulated annealing（ML-SA）-based localization algorithm. Simulation results demonstrate that the proposed algorithm provides good location accuracy and considerably outperforms the ML-SA-based localization algorithm for every case. The root mean square error（RMSE）of the location estimate of the NBP-based localization algorithm is reduced by about 1. 6 m in Case 1, 1. 8 m in Case 2 and 2. 3 m in Case 3 compared with the ML-SA-based localization algorithm. Therefore, in the NLOS environments,the localization algorithms can obtain the location estimates with high accuracy by using the NBP method.展开更多
基金funded by the Deanship of Scientific Research(DSR)at King Abdulaziz University,Jeddah,Saudi Arabia,grant number RG-2-611-42(A.O.A.).
文摘Wi-Fi technology has evolved significantly since its introduction in 1997,advancing to Wi-Fi 6 as the latest standard,with Wi-Fi 7 currently under development.Despite these advancements,integrating machine learning into Wi-Fi networks remains challenging,especially in decentralized environments with multiple access points(mAPs).This paper is a short review that summarizes the potential applications of federated reinforcement learning(FRL)across eight key areas of Wi-Fi functionality,including channel access,link adaptation,beamforming,multi-user transmissions,channel bonding,multi-link operation,spatial reuse,and multi-basic servic set(multi-BSS)coordination.FRL is highlighted as a promising framework for enabling decentralized training and decision-making while preserving data privacy.To illustrate its role in practice,we present a case study on link activation in a multi-link operation(MLO)environment with multiple APs.Through theoretical discussion and simulation results,the study demonstrates how FRL can improve performance and reliability,paving the way for more adaptive and collaborative Wi-Fi networks in the era of Wi-Fi 7 and beyond.
基金funded by the Youth Fund of the National Natural Science Foundation of China(Grant No.42261070).
文摘Spectrum-based fault localization (SBFL) generates a ranked list of suspicious elements by using the program execution spectrum, but the excessive number of elements ranked in parallel results in low localization accuracy. Most researchers consider intra-class dependencies to improve localization accuracy. However, some studies show that inter-class method call type faults account for more than 20%, which means such methods still have certain limitations. To solve the above problems, this paper proposes a two-phase software fault localization based on relational graph convolutional neural networks (Two-RGCNFL). Firstly, in Phase 1, the method call dependence graph (MCDG) of the program is constructed, the intra-class and inter-class dependencies in MCDG are extracted by using the relational graph convolutional neural network, and the classifier is used to identify the faulty methods. Then, the GraphSMOTE algorithm is improved to alleviate the impact of class imbalance on classification accuracy. Aiming at the problem of parallel ranking of element suspicious values in traditional SBFL technology, in Phase 2, Doc2Vec is used to learn static features, while spectrum information serves as dynamic features. A RankNet model based on siamese multi-layer perceptron is constructed to score and rank statements in the faulty method. This work conducts experiments on 5 real projects of Defects4J benchmark. Experimental results show that, compared with the traditional SBFL technique and two baseline methods, our approach improves the Top-1 accuracy by 262.86%, 29.59% and 53.01%, respectively, which verifies the effectiveness of Two-RGCNFL. Furthermore, this work verifies the importance of inter-class dependencies through ablation experiments.
基金the National Natural Science Foundation of China (No. 60471003).
文摘Subcellular location is one of the key biological characteristics of proteins. Position-specific profiles （PSP） have been introduced as important characteristics of proteins in this article. In this study, to obtain position-specific profiles, the Position Specific lterative-Basic Local Alignment Search Tool （PSI-BLAST） has been used to search for protein sequences in a database. Position-specific scoring matrices are extracted from the profiles as one class of characteristics. Four-part amino acid compositions and lst-7th order dipeptide compositions have also been calculated as the other two classes of characteristics. Therefore, twelve characteristic vectors are extracted from each of the protein sequences. Next, the characteristic vectors are weighed by a simple weighing function and inputted into a BP neural network predictor named PSP-Weighted Neural Network （PSP-WNN）. The Levenberg-Marquardt algorithm is employed to adjust the weight matrices and thresholds during the network training instead of the error back propagation algorithm. With a jackknife test on the RH2427 dataset, PSP-WNN has achieved a higher overall prediction accuracy of 88.4% rather than the prediction results by the general BP neural network, Markov model, and fuzzy k-nearest neighbors algorithm on this dataset. In addition, the prediction performance of PSP-WNN has been evaluated with a five-fold cross validation test on the PK7579 dataset and the prediction results have been consistently better than those of the previous method on the basis of several support vector machines, using compositions of both amino acids and amino acid pairs. These results indicate that PSP-WNN is a powerful tool for subcellular localization prediction. At the end of the article, influences on prediction accuracy using different weighting proportions among three characteristic vector categories have been discussed. An appropriate proportion is considered by increasing the prediction accuracy.
基金The National Natural Science Foundation of China(No70571013,70973017)Program for New Century Excellent Talentsin University (NoNCET-06-0471)Human Social Science Fund Project ofMinistry of Education (No09YJA630020)
文摘In order to simulate the real growing process, a new type of knowledge network growth mechanism based on local world connectivity is constructed. By the mean-field method, theoretical prediction of the degree distribution of the knowledge network is given, which is verified by Matlab simulations. When the new added node＇s local world size is very small, the degree distribution of the knowledge network approximately has the property of scale-free. When the new added node＇s local world size is not very small, the degree distribution transforms from pure power-law to the power-law with an exponential tailing. And the scale-free index increases as the number of new added edges decreases and the tunable parameters increase. Finally, comparisons of some knowledge indices in knowledge networks generated by the local world mechanism and the global mechanism are given. In the long run, compared with the global mechanism, the local world mechanism leads the average knowledge levels to slower growth and brings homogenous phenomena.
基金supported by the National Natural Science Foundation of China (No.61631013)National Key Basic Research Program of China (973 Program) (No. 2013CB329002)National Major Project (NO. 2018ZX03001006003)
文摘Indoor Wi-Fi localization of mobile devices plays a more and more important role along with the rapid growth of location-based services and Wi-Fi mobile devices.In this paper,a new method of constructing the channel state information(CSI)image is proposed to improve the localization accuracy.Compared with previous methods of constructing the CSI image,the new kind of CSI image proposed is able to contain more channel information such as the angle of arrival(AoA),the time of arrival(TOA)and the amplitude.We construct three gray images by using phase differences of different antennas and amplitudes of different subcarriers of one antenna,and then merge them to form one RGB image.The localization method has off-line stage and on-line stage.In the off-line stage,the composed three-channel RGB images at training locations are used to train a convolutional neural network(CNN)which has been proved to be efficient in image recognition.In the on-line stage,images at test locations are fed to the well-trained CNN model and the localization result is the weighted mean value with highest output values.The performance of the proposed method is verified with extensive experiments in the representative indoor environment.
基金the National Natural Science Foundation of China (60673054, 60773129)theExcellent Youth Science and Technology Foundation of Anhui Province of China.
文摘Geographic location of nodes is very useful in a sensor network. Previous localization algorithms assume that there exist some anchor nodes in this kind of network, and then other nodes are estimated to create their coordinates. Once there are not anchors to be deployed, those localization algorithms will be invalidated. Many papers in this field focus on anchor-based solutions. The use of anchors introduces many limitations, since anchors require external equipments such as global position system, cause additional power consumption. A novel positioning algorithm is proposed to use a virtual coordinate system based on a new concept--virtual anchor. It is executed in a distributed fashion according to the connectivity of a node and the measured distances to its neighbors. Both the adjacent member information and the ranging distance result are combined to generate the estimated position of a network, one of which is independently adopted for localization previously. At the position refinement stage the intermediate estimation of a node begins to be evaluated on its reliability for position mutation; thus the positioning optimization process of the whole network is avoided falling into a local optimal solution. Simulation results prove that the algorithm can resolve the distributed localization problem for anchor-free sensor networks, and is superior to previous methods in terms of its positioning capability under a variety of circumstances.
基金Supported by the Fujian Province University-Industry Cooperation of Major Science and Technology Project (2011H6008)the Natural Science Foundation of Shandong Province of China (ZR2009GQ002,ZR2010FQ014)
文摘Localization is one of the key technologies in wireless sensor networks,and the existing PSO-based localization methods are based on standard PSO,which cannot guarantee the global convergence.For the sensor network deployed in a three-dimensional region,this paper proposes a localization method using stochastic particle swarm optimization.After measuring the distances between sensor nodes,the sensor nodes estimate their locations using stochastic particle swarm optimization,which guarantees the global convergence of the results.The simulation results show that the localization error of the proposed method is almost 40% of that of multilateration,and it uses about 120 iterations to reach the optimizing value,which is 80 less than the standard particle swarm optimization.
基金supported by the National Natural Science Foundation of China (Grant No. 10832011)the Knowledge Innovation Program of the Chinese Academy of Sciences (Grant No. KJCX2-YW-L08)
文摘The interpenetrating network structure provides an interesting avenue to novel materials. Locally resonant phononic crystal （LRPC） exhibits excellent sound attenuation performance based on the periodical arrangement of sound wave scatters. Combining the LRPC concept and interpenetrating network glassy structure, this paper has developed a new material which can achieve a wide band underwater strong acoustic absorption. Underwater absorption coefficients of different samples were measured by the pulse tube. Measurement results show that the new material possesses excellent underwater acoustic effects in a wide frequency range.Moreover, in order to investigate impacts of locally resonant units,some defects are introduced into the sample. The experimental result and the theoretical calculation both show that locally resonant units being connected to a network structure play an important role in achieving a wide band strong acoustic absorption.
基金the National Basic Research Program (973) of China (No. 2004CB217902)the National Natural Science Foundation of China (Nos. 60421002 and 60804045)the Postdoctoral Science Foundation of China (No. 20070421163)
文摘The local-world (LW) evolving network model shows a transition for the degree distribution between the exponential and power-law distributions, depending on the LW size. Cascading failures under intentional attacks in LW network models with different LW sizes were investigated using the cascading failures load model. We found that the LW size has a significant impact on the network's robustness against deliberate attacks. It is much easier to trigger cascading failures in LW evolving networks with a larger LW size. Therefore, to avoid cascading failures in real networks with local preferential attachment such as the Internet, the World Trade Web and the multi-agent system, the LW size should be as small as possible.
基金supported by the National Natural Science Foundation of China (51075068)the Southeast University Science Foundation Funded Program (KJ2009348)
文摘Due to defects of time-difference of arrival localization,which influences by speed differences of various model waveforms and waveform distortion in transmitting process,a neural network technique is introduced to calculate localization of the acoustic emission source.However,in back propagation（BP） neural network,the BP algorithm is a stochastic gradient algorithm virtually,the network may get into local minimum and the result of network training is dissatisfactory.It is a kind of genetic algorithms with the form of quantum chromosomes,the random observation which simulates the quantum collapse can bring diverse individuals,and the evolutionary operators characterized by a quantum mechanism are introduced to speed up convergence and avoid prematurity.Simulation results show that the modeling of neural network based on quantum genetic algorithm has fast convergent and higher localization accuracy,so it has a good application prospect and is worth researching further more.
基金supported by the Science Foundation of China University of Petroleum,Beijing under Grant No.:2462018YJRC020 and 2462020YXZZ006the National Natural Science Foundation of China under grant no.:41904098+1 种基金the Young Elite Scientists Sponsorship Program by CAST(YESS)under Grant No.:2018QNRC001partly supported by the National Natural Science Foundation of China under Grant No.:41874156 and 42074167。
文摘The local slopes contain rich information of the reflection geometry,which can be used to facilitate many subsequent procedures such as seismic velocities picking,normal move out correction,time-domain imaging and structural interpretation.Generally the slope estimation is achieved by manually picking or scanning the seismic profile along various slopes.We present here a deep learning-based technique to automatically estimate the local slope map from the seismic data.In the presented technique,three convolution layers are used to extract structural features in a local window and three fully connected layers serve as a classifier to predict the slope of the central point of the local window based on the extracted features.The deep learning network is trained using only synthetic seismic data,it can however accurately estimate local slopes within real seismic data.We examine its feasibility using simulated and real-seismic data.The estimated local slope maps demonstrate the succes sful performance of the synthetically-trained network.
基金supported by the National Natural Science Foundation of China under Grant No. 61403068, No. 61232016, No. U1405254 and No. 61501100Fundamental Research Funds for the Central Universities of China under Grant No. N130323002 and No. N130323004+3 种基金Natural Science Foundation of Hebei Province under Grant No. F2015501097 and No. F2016501080Scientific Research Fund of Hebei Provincial Education Department under Grant No. Z2014078the PAPD fundNEUQ internal funding under Grant No. XNB201509 and XNB201510
文摘The problem of mobile localization for wireless sensor network has attracted considerable attention in recent years. The localization accuracy will drastically grade in non-line of sight(NLOS) conditions. In this paper, we propose a mobile localization strategy based on Kalman filter. The key technologies for the proposed method are the NLOS identification and mitigation. The proposed method does not need the prior knowledge of the NLOS error and it is independent of the physical measurement ways. Simulation results show that the proposed method owns the higher localization accuracy when compared with other methods.
基金Project supported by the grant from City University of Hong Kong (Grant No. 7008105)
文摘By considering the eigenratio of the Laplacian matrix as the synchronizability measure, this paper presents an efficient method to enhance the synchronizability of undirected and unweighted networks via rewiring. The rewiring method combines the use of tabu search and a local greedy algorithm so that an effective search of solutions can be achieved. As demonstrated in the simulation results, the performance of the proposed approach outperforms the existing methods for a large variety of initial networks, both in terms of speed and quality of solutions.
基金supported in part by the National Natural Science Foundation of China(61873345,61973263)the Youth Talent Support Program of Hebei(BJ2018050,BJ2020031)+2 种基金the Teturned Overseas Chinese Scholar Foundation of Hebei(C201829)the Natural Science Foundation of Hebei(F2020203002)the Postgraduate Innovation Fund Project of Hebei(CXZZSS2019047)。
文摘Location estimation of underwater sensor networks(USNs)has become a critical technology,due to its fundamental role in the sensing,communication and control of ocean volume.However,the asynchronous clock,security attack and mobility characteristics of underwater environment make localization much more challenging as compared with terrestrial sensor networks.This paper is concerned with a privacy-preserving asynchronous localization issue for USNs.Particularly,a hybrid network architecture that includes surface buoys,anchor nodes,active sensor nodes and ordinary sensor nodes is constructed.Then,an asynchronous localization protocol is provided,through which two privacy-preserving localization algorithms are designed to estimate the locations of active and ordinary sensor nodes.It is worth mentioning that,the proposed localization algorithms reveal disguised positions to the network,while they do not adopt any homomorphic encryption technique.More importantly,they can eliminate the effect of asynchronous clock,i.e.,clock skew and offset.The performance analyses for the privacy-preserving asynchronous localization algorithms are also presented.Finally,simulation and experiment results reveal that the proposed localization approach can avoid the leakage of position information,while the location accuracy can be significantly enhanced as compared with the other works.
文摘Wireless sensor networks （WSNs） consist of sensor nodes that broadcast a message within a network. Efficient broadcasting is a key requirement in sensor networks and has been a focal point of research over the last few years. There are many challenging tasks in the network, including redundancy control and sensor node localization that mainly depend on broadcasting. In this paper, we propose a broadcasting algorithm to control redundancy and improve localization （BACRIL） in WSNs. The proposed algorithm incorporates the benefits of the gossip protocol for optimizing message broadcasting within the network. Simulation results show a controlled level of redundancy, which is up to 57.6% if the number of sensor nodes deployed in a 500 m×500 m area are increased from 50 to 500.
基金supported by the National Natural Science Foundation of China(61375105 61403334)
文摘This paper investigates the node localization problem for wireless sensor networks in three-dimension space. A distributed localization algorithm is presented based on the rigid graph. Before location, the communication radius is adaptively increasing to add the localizability. The localization process includes three steps: firstly, divide the whole globally rigid graph into several small rigid blocks; secondly, set up the local coordinate systems and transform them to global coordinate system; finally, use the quadrilateration iteration technology to locate the nodes in the wireless sensor network. This algorithm has the advantages of low energy consumption, low computational complexity as well as high expandability and high localizability. Moreover, it can achieve the unique and accurate localization. Finally, some simulations are provided to demonstrate the effectiveness of the proposed algorithm.
基金supported by National Natural Science Foundation of China(61533019,U1811463)Open Fund of the State Key Laboratory for Management and Control of Complex Systems,Institute of Automation,Chinese Academy of Sciences(Y6S9011F51)in part by the EPSRC Project(EP/N025849/1)
文摘Eye center localization is one of the most crucial and basic requirements for some human-computer interaction applications such as eye gaze estimation and eye tracking. There is a large body of works on this topic in recent years, but the accuracy still needs to be improved due to challenges in appearance such as the high variability of shapes, lighting conditions, viewing angles and possible occlusions. To address these problems and limitations, we propose a novel approach in this paper for the eye center localization with a fully convolutional network(FCN),which is an end-to-end and pixels-to-pixels network and can locate the eye center accurately. The key idea is to apply the FCN from the object semantic segmentation task to the eye center localization task since the problem of eye center localization can be regarded as a special semantic segmentation problem. We adapt contemporary FCN into a shallow structure with a large kernel convolutional block and transfer their performance from semantic segmentation to the eye center localization task by fine-tuning.Extensive experiments show that the proposed method outperforms the state-of-the-art methods in both accuracy and reliability of eye center localization. The proposed method has achieved a large performance improvement on the most challenging database and it thus provides a promising solution to some challenging applications.
基金Project supported by the National Natural Foundation of China(Grant No.11871328)the Shanghai Science and Technology Development Funds Soft Science Research Project(Grant No.21692109800).
文摘Identifying influential nodes in complex networks is one of the most significant and challenging issues,which may contribute to optimizing the network structure,controlling the process of epidemic spreading and accelerating information diffusion.The node importance ranking measures based on global information are not suitable for large-scale networks due to their high computational complexity.Moreover,they do not take into account the impact of network topology evolution over time,resulting in limitations in some applications.Based on local information of networks,a local clustering H-index(LCH)centrality measure is proposed,which considers neighborhood topology,the quantity and quality of neighbor nodes simultaneously.The proposed measure only needs the information of first-order and second-order neighbor nodes of networks,thus it has nearly linear time complexity and can be applicable to large-scale networks.In order to test the proposed measure,we adopt the susceptible-infected-recovered(SIR)and susceptible-infected(SI)models to simulate the spreading process.A series of experimental results on eight real-world networks illustrate that the proposed LCH can identify and rank influential nodes more accurately than several classical and state-of-the-art measures.
基金The National Natural Science Foundation of China(No.61271207,61372104)
文摘To mitigate the impacts of non-line-of-sight（NLOS） errors on location accuracy, a non-parametric belief propagation（NBP）-based localization algorithm in the NLOS environment for wireless sensor networks is proposed.According to the amount of prior information known about the probabilities and distribution parameters of the NLOS error distribution, three different cases of the maximum a posterior（MAP） localization problems are introduced. The first case is the idealized case, i. e., the range measurements in the NLOS conditions and the corresponding distribution parameters of the NLOS errors are known. The probability of a communication of a pair of nodes in the NLOS conditions and the corresponding distribution parameters of the NLOS errors are known in the second case. The third case is the worst case, in which only knowledge about noise measurement power is obtained. The proposed algorithm is compared with the maximum likelihood-simulated annealing（ML-SA）-based localization algorithm. Simulation results demonstrate that the proposed algorithm provides good location accuracy and considerably outperforms the ML-SA-based localization algorithm for every case. The root mean square error（RMSE）of the location estimate of the NBP-based localization algorithm is reduced by about 1. 6 m in Case 1, 1. 8 m in Case 2 and 2. 3 m in Case 3 compared with the ML-SA-based localization algorithm. Therefore, in the NLOS environments,the localization algorithms can obtain the location estimates with high accuracy by using the NBP method.
