Scheduling optimization for UAV communication coverage using virtual force-based PSO model

When the ground communication base stations in the target area are severely destroyed,the deployment of Unmanned Aerial Vehicle(UAV)ad hoc networks can provide people with temporary communication services.Therefore,it is necessary to design a multi-UAVs cooperative control strategy to achieve better communication coverage and lower energy consumption.In this paper,we propose a multi-UAVs coverage model based on Adaptive Virtual Force-directed Particle Swarm Optimization(AVF-PSO)strategy.In particular,we first introduce the gravity model into the traditional Particle Swarm Optimization(PSO)algorithm so as to increase the probability of full coverage.Then,the energy consumption is included in the calculation of the fitness function so that maximum coverage and energy consumption can be balanced.Finally,in order to reduce the communication interference between UAVs,we design an adaptive lift control strategy based on the repulsion model to reduce the repeated coverage of multi-UAVs.Experimental results show that the proposed coverage strategy based on gravity model outperforms the existing state-of-the-art approaches.For example,in the target area of any size,the coverage rate and the repeated coverage rate of the proposed multi-UAVs scheduling are improved by 6.9–29.1%,and 2.0–56.1%,respectively.Moreover,the proposed scheduling algorithm is high adaptable to diverse execution environments.©2022 Published by Elsevier Ltd.

Local Trade Networks among Farmers and Traders

Both farmers and traders benefit from trade networking, which is crucial for the local economy. Therefore, it is crucial to understand how these networks operate, and how they can be managed more effectively. Throughout this study, we examine the economic networks formed between farmers and traders through the trade of food products. These networks are analyzed from the perspective of their structure and the factors that influence their development. Using data from 18 farmers and 15 traders, we applied exponential random graph models. The results of our study showed that connectivity, Popularity Spread, activity spread, good transportation systems, and high yields all affected the development of networks. Therefore, farmers’ productivity and high market demand can contribute to local food-crop trade. The network was not affected by reciprocity, open markets, proximity to locations, or trade experience of actors. Policy makers should consider these five factors when formulating policies for local food-crop trade. Additionally, local actors should be encouraged to use these factors to improve their network development. However, it is important to note that these factors alone cannot guarantee success. Policy makers and actors must also consider other factors such as legal frameworks, economic policies, and resource availability. Our approach can be used in future research to determine how traders and farmers can enhance productivity and profit in West Africa. This study addresses a research gap by examining factors influencing local food trade in a developing country.

Epidemic spreading on random surfer networks with infected avoidance strategy

In this paper, we study epidemic spreading on random surfer networks with infected avoidance （IA） strategy. In particular, we consider that susceptible individuals＇ moving direction angles are affected by the current location information received from infected individuals through a directed information network. The model is mainly analyzed by discrete-time numerical simulations. The results indicate that the IA strategy can restrain epidemic spreading effectively. However, when long-distance jumps of individuals exist, the IA strategy＇s effectiveness on restraining epidemic spreading is heavily reduced. Finally, it is found that the influence of the noises from information transferring process on epidemic spreading is indistinctive.

Model for Generating Scale-Free Artificial Social Networks Using Small-World Networks

The Internet of Things(IoT)has the potential to be applied to social networks due to innovative characteristics and sophisticated solutions that challenge traditional uses.Social network analysis(SNA)is a good example that has recently gained a lot of scientific attention.It has its roots in social and economic research,as well as the evaluation of network science,such as graph theory.Scientists in this area have subverted predefined theories,offering revolutionary ones regarding interconnected networks,and they have highlighted the mystery of six degrees of separation with confirmation of the small-world phenomenon.The motivation of this study is to understand and capture the clustering properties of large networks and social networks.We present a network growth model in this paper and build a scale-free artificial social network with controllable clustering coefficients.The random walk technique is paired with a triangle generating scheme in our proposed model.As a result,the clustering controlmechanism and preferential attachment(PA)have been realized.This research builds on the present random walk model.We took numerous measurements for validation,including degree behavior and the measure of clustering decay in terms of node degree,among other things.Finally,we conclude that our suggested random walk model is more efficient and accurate than previous state-of-the-art methods,and hence it could be a viable alternative for societal evolution.

An Algorithm to Determine the Truncated Weibull Parameters for Distribution of Throats and Pores in Random Network Models

In random network models, sizes for pores and throats are distributed according to a truncated Weibull distribution. As a result, parameters defining the shape of the distribution are critical for the characteristic of the network. In this paper, an algorithm to distribute pores and throats in random network was established to more representatively describe the topology of porous media. First, relations between Weibull parameters and the distribution of dimensionless throat sizes were studied and a series of standard curves were obtained. Then, by analyzing the capillary pressure curve of the core sample, frequency distribution histogram of throat sizes was obtained. All the sizes were transformed to dimensionless numbers ranged from 0 to 1. Curves of the core were compared to the standard curves, and truncated Weibull parameters could be determined according an inverse algorithm. Finally, aspect ratio and average length of throats were adjusted to simultaneously fit the porosity and the capillary pressure curves and the whole network was established. The predicted relative permeability curves were in good agreement with the experimental data of cores, indicating the validity of the algorithm.

Research on the Computer Network Protocol Test Model based on Genetic and Random Walk Algorithm

In this paper, we conduct research on the computer network protocol test model based on genetic and random walk algorithm.Network protocol is the abstract concept, is important in the process of the development of network system. Fully understand and grasp of thenetwork protocols for managers is there is a big diffi cult. Network covert channel is the evaluation of intrusion detection system and fi rewallsecurity performance of an important means, the paper will start from the angle of the attacker, the fl aws of the research, and use this kind ofdefect to realize network covert channel, the random walk algorithm will be feasible for dealing with this issue. For achieving this, we integratethe genetic and random walk algorithm for systematic optimization.

基于BERT-BiLSTM-CRF模型的畜禽疫病文本分词研究

针对畜禽疫病文本语料匮乏、文本内包含大量疫病名称及短语等未登录词问题,提出了一种结合词典匹配的BERT-BiLSTM-CRF畜禽疫病文本分词模型。以羊疫病为研究对象,构建了常见疫病文本数据集,将其与通用语料PKU结合,利用BERT(Bidirectional encoder representation from transformers)预训练语言模型进行文本向量化表示;通过双向长短时记忆网络(Bidirectional long short-term memory network,BiLSTM)获取上下文语义特征;由条件随机场(Conditional random field,CRF)输出全局最优标签序列。基于此,在CRF层后加入畜禽疫病领域词典进行分词匹配修正,减少在分词过程中出现的疫病名称及短语等造成的歧义切分,进一步提高了分词准确率。实验结果表明,结合词典匹配的BERT-BiLSTM-CRF模型在羊常见疫病文本数据集上的F1值为96.38%,与jieba分词器、BiLSTM-Softmax模型、BiLSTM-CRF模型、未结合词典匹配的本文模型相比,分别提升11.01、10.62、8.3、0.72个百分点,验证了方法的有效性。与单一语料相比,通用语料PKU和羊常见疫病文本数据集结合的混合语料,能够同时对畜禽疫病专业术语及疫病文本中常用词进行准确切分,在通用语料及疫病文本数据集上F1值都达到95%以上,具有较好的模型泛化能力。该方法可用于畜禽疫病文本分词。

Mathematical Model Validation of Search Protocols in MP2P Networks

Broadcasting is a basic technique in Mobile ad-hoc network(MANET),and it refers to sending a packet from one node to every other node within the transmission range.Flooding is a type of broadcast where the received packet is retransmitted once by every node.The naive flooding technique,floods the network with query messages,while the random walk technique operates by contacting the subsets of every node’s neighbors at each step,thereby restricting the search space.One of the key challenges in an ad-hoc network is the resource or content discovery problem which is about locating the queried resource.Many earlier works have mainly focused on the simulation-based analysis of flooding,and its variants under a wired network.Although,there have been some empirical studies in peer-to-peer(P2P)networks,the analytical results are still lacking,especially in the context of P2P systems running over MANET.In this paper,we describe how P2P resource discovery protocols perform badly over MANETs.To address the limitations,we propose a new protocol named ABRW(Address Broadcast Random Walk),which is a lightweight search approach,designed considering the underlay topology aimed to better suit the unstructured architecture.We provide the mathematical model,measuring the performance of our proposed search scheme with different widely popular benchmarked search techniques.Further,we also derive three relevant search performance metrics,i.e.,mean no.of steps needed to find a resource,the probability of finding a resource,and the mean no.of message overhead.We validated the analytical expressions through simulations.The simulation results closely matched with our analyticalmodel,justifying our findings.Our proposed search algorithm under such highly dynamic self-evolving networks performed better,as it reduced the search latency,decreased the overall message overhead,and still equally had a good success rate.

Analytical Comparison of Resource Search Algorithms in Non-DHT Mobile Peer-to-Peer Networks

One of the key challenges in ad-hoc networks is the resource discovery problem.How efciently&quickly the queried resource/object can be resolved in such a highly dynamic self-evolving network is the underlying question?Broadcasting is a basic technique in the Mobile Ad-hoc Networks(MANETs),and it refers to sending a packet from one node to every other node within the transmission range.Flooding is a type of broadcast where the received packet is retransmitted once by every node.The naive ooding technique oods the network with query messages,while the random walk scheme operates by contacting subsets of each node’s neighbors at every step,thereby restricting the search space.Many earlier works have mainly focused on the simulation-based analysis of ooding technique,and its variants,in a wired network scenario.Although,there have been some empirical studies in peer-to-peer(P2P)networks,the analytical results are still lacking,especially in the context of mobile P2P networks.In this article,we mathematically model different widely used existing search techniques,and compare with the proposed improved random walk method,a simple lightweight approach suitable for the non-DHT architecture.We provide analytical expressions to measure the performance of the different ooding-based search techniques,and our proposed technique.We analytically derive 3 relevant key performance measures,i.e.,the avg.number of steps needed to nd a resource,the probability of locating a resource,and the avg.number of messages generated during the entire search process.

Random walk immunization strategy on scale-free networks

A novel immunization strategy called the random walk immunization strategy on scale-free networks is proposed. Different from other known immunization strategies, this strategy works as follows： a node is randomly chosen from the network. Starting from this node, randomly walk to one of its neighbor node; if the present node is not immunized, then immunize it and continue the random walk; otherwise go back to the previous node and randomly walk again. This process is repeated until a certain fraction of nodes is immunized. By theoretical analysis and numerical simulations, we found that this strategy is very effective in comparison with the other known immunization strategies.

Self-organized Criticality in an Earthquake Model on Random Network

A simplified Olami-Feder-Christensen model on a random network has been studied. We propose a new toppling rule -- when there is an unstable site toppling, the energy of the site is redistributed to its nearest neighbors randomly not averagely. The simulation results indicate that the model displays self-organized criticality when the system is conservative, and the avalanche size probability distribution of the system obeys finite size scaling. When the system is nonconservative, the model does not display scaling behavior. Simulation results of our model with different nearest neighbors q is also compared, which indicates that the spatial topology does not alter the critical behavior of the system.

Random Access Algorithms in Packet Networks—A Review of Three Research Decades

We present a coherent and systematic review of Random Access Algorithms for packet networks, as developed over three and a half decades. We consider the appropriate user models and we classify the algorithms according to the channel sensing constraints imposed. We also present a review of the analytical methodologies required for the performance analysis of these algorithms.

Modeling effects of abiotic factors on the abundances of eight woody species in the Harana forest using artificial networks,random forest,and generalized linear models

Background Abiotic factors exert different impacts on the abundance of individual tree species in the forest but little has been known about the impact of abiotic factors on the individual plant,particularly,in a tropical forest.This study identified the impact of abiotic factors on the abundances of Podocarpus falcatus,Croton macrostachyus,Celtis africana,Syzygium guineense,Olea capensis,Diospyros abyssinica,Feliucium decipenses,and Coffea arabica.A systematic sample design was used in the Harana forest,where 1122 plots were established to collect the abundance of species.Random forest(RF),artificial neural network(ANN),and generalized linear model(GLM)models were used to examine the impacts of topographic,climatic,and edaphic factors on the log abundances of woody species.The RF model was used to predict the spatial distribution maps of the log abundances of each species.Results The RF model achieved a better prediction accuracy with R^(2)=71%and a mean squared error(MSE)of 0.28 for Feliucium decipenses.The RF model differentiated elevation,temperature,precipitation,clay,and potassium were the top variables that influenced the abundance of species.The ANN model showed that elevation induced a nega-tive impact on the log abundances of all woody species.The GLM model reaffirmed the negative impact of elevation on all woody species except the log abundances of Syzygium guineense and Olea capensis.The ANN model indicated that soil organic matter(SOM)could positively affect the log abundances of all woody species.The GLM showed a similar positive impact of SOM,except for a negative impact on the log abundance of Celtis africana at p<0.05.The spatial distributions of the log abundances of Coffee arabica,Filicium decipenses,and Celtis africana were confined to the eastern parts,while the log abundance of Olea capensis was limited to the western parts.Conclusions The impacts of abiotic factors on the abundance of woody species may vary with species.This ecological understanding could guide the restoration activity of individual species.The prediction maps in this study provide spatially explicit information which can enhance the successful implementation of species conservation.

数字政务合作网络形成过程中内生结构因素的传递效应——基于长三角城市群网络的ERGM分析

当前,我国长三角城市群已经形成了联系较为紧密的数字政务合作网络。对此,本文利用社会网络分析和指数随机图模型对收集到的62条长三角城市群数字政务府际合作信息进行实证分析。研究表明,内生结构因素的传递效应可以解释长三角城市群数字政务合作网络的形成过程,即数字政务府际合作伙伴的选择具有传递性,已经建立的合作关系将有助于地方政府达成新的合作关系,降低府际合作达成过程中的交易成本。同时,在数字政府领域的府际合作中,城市的资源基础和条件相近对合作形成的影响不明显。因此,地方政府通过主动寻求府际合作、顺畅府际合作,将更有可能把握数字化的发展机遇,通过不断扩大数字政务合作关系,提升政府为民便民的数字化服务能力。

GIS-based landslide susceptibility modeling:A comparison between fuzzy multi-criteria and machine learning algorithms

Hazards and disasters have always negative impacts on the way of life.Landslide is an overwhelming natural as well as man-made disaster that causes loss of natural resources and human properties throughout theworld.The present study aimed to assess and compare the prediction efficiency of different models in landslide susceptibility in the Kysuca river basin,Slovakia.In this regard,the fuzzy decision-making trial and evaluation laboratory combining with the analytic network process(FDEMATEL-ANP),Naïve Bayes(NB)classifier,and random forest(RF)classifier were considered.Initially,a landslide inventory map was produced with 2000 landslide and nonlandslide points by randomly dividedwith a ratio of 70%:30%for training and testing,respectively.The geospatial database for assessing the landslide susceptibility was generated with the help of 16 landslide conditioning factors by allowing for topographical,hydrological,lithological,and land cover factors.The ReliefF methodwas considered for determining the significance of selected conditioning factors and inclusion in the model building.Consequently,the landslide susceptibility maps(LSMs)were generated using the FDEMATEL-ANP,Naïve Bayes(NB)classifier,and random forest(RF)classifier models.Finally,the area under curve(AUC)and different arithmetic evaluation were used for validating and comparing the results and models.The results revealed that random forest(RF)classifier is a promising and optimum model for landslide susceptibility in the study area with a very high value of area under curve(AUC=0.954),lower value of mean absolute error(MAE=0.1238)and root mean square error(RMSE=0.2555),and higher value of Kappa index(K=0.8435)and overall accuracy(OAC=92.2%).

基于TERGM的跨区域技术协同创新网络演化动力研究

以长三角城市群41座城市2004~2020年的城际联合申请专利为数据基础,构建跨区域技术协同创新网络,采用时序指数随机图模型(TERGM)实证分析促进跨区域技术协同创新网络演化的动力因素。研究表明:城市间技术协同创新关系的演化是内外生因素共同作用的结果;城市间技术创新合作更倾向于嵌入三角结构而非星型结构,具有突出的“小世界”“高集聚”特征;网络演化过程既有稳定性又有变异性;网络中经济发展、产业结构高级化和对外开放水平越高的城市,与其他城市形成创新合作关系的概率越高;人力资本水平接近的城市更倾向于建立新的合作关系;地理、制度及组织邻近性均对城市间技术创新合作产生积极作用。从截面扩展至纵向维度并引入时间依赖项进行跨区域技术协同创新网络演化动力分析,研究结论为区域一体化创新发展提供了路径参考,同时为网络经济时代社会科学研究范式提供了新的视角。

Forecasting Alzheimer’s Disease Using Combination Model Based on Machine Learning

As the acceleration of aged population tendency, building models to forecast Alzheimer’s Disease (AD) is essential. In this article, we surveyed 1157 interviewees. By analyzing the results using three machine learning methods—BP neural network, SVM and random forest, we can derive the accuracy of them in forecasting AD, so that we can compare the methods in solving AD prediction. Among them, random forest is the most accurate method. Moreover, to combine the advantages of the methods, we build a new combination forecasting model based on the three machine learning models, which is proved more accurate than the models singly. At last, we give the conclusion of the connection between life style and AD, and provide several suggestions for elderly people to help them prevent AD.

Influence of Inhomogeneity on Critical Behavior of Earthquake Model on Random Graph

We consider the earthquake model on a random graph. A detailed analysis of the probability distribution of the size of the avalanches will be given. The model with different inhomogeneities is studied in order to compare the critical behavior of different systems. The results indicate that with the increase of the inhomogeneities, the avalanche exponents reduce, i.e., the different numbers of defects cause different critical behaviors of the system. This is virtually ascribed to the dynamical perturbation.

An Image Segmentation Algorithm Based on a Local Region Conditional Random Field Model

To reduce the computation cost of a combined probabilistic graphical model and a deep neural network in semantic segmentation, the local region condition random field (LRCRF) model is investigated which selectively applies the condition random field (CRF) to the most active region in the image. The full convolutional network structure is optimized with the ResNet-18 structure and dilated convolution to expand the receptive field. The tracking networks are also improved based on SiameseFC by considering the frame relations in consecutive-frame traffic scene maps. Moreover, the segmentation results of the greyscale input data sets are more stable and effective than using the RGB images for deep neural network feature extraction. The experimental results show that the proposed method takes advantage of the image features directly and achieves good real-time performance and high segmentation accuracy.

Optimization Processes of Tangible and Intangible Networks through the Laplace Problems for Regular Lattices with Multiple Obstacles along the Way

A systematic approach is proposed to the theme of safety,reliability and global quality of complex networks(material and immaterial)by means of special mathematical tools that allow an adequate geometric characterization and study of the operation,even in the presence of multiple obstacles along the path.To that end,applying the theory of graphs to the problem under study and using a special mathematical model based on stochastic geometry,in this article we consider some regular lattices in which it is possible to schematize the elements of the network,with the fundamental cell with six,eight or 2(n+2)obstacles,calculating the probability of Laplace.In this way it is possible to measure the“degree of impedance”exerted by the anomalies along the network by the obstacles examined.The method can be extended to other regular and/or irregular geometric figures,whose union together constitutes the examined network,allowing to optimize the functioning of the complex system considered.