Fast solution to the free return orbit's reachable domain of the manned lunar mission by deep neural network

It is important to calculate the reachable domain(RD)of the manned lunar mission to evaluate whether a lunar landing site could be reached by the spacecraft. In this paper, the RD of free return orbits is quickly evaluated and calculated via the classification and regression neural networks. An efficient databasegeneration method is developed for obtaining eight types of free return orbits and then the RD is defined by the orbit’s inclination and right ascension of ascending node(RAAN) at the perilune. A classify neural network and a regression network are trained respectively. The former is built for classifying the type of the RD, and the latter is built for calculating the inclination and RAAN of the RD. The simulation results show that two neural networks are well trained. The classification model has an accuracy of more than 99% and the mean square error of the regression model is less than 0.01°on the test set. Moreover, a serial strategy is proposed to combine the two surrogate models and a recognition tool is built to evaluate whether a lunar site could be reached. The proposed deep learning method shows the superiority in computation efficiency compared with the traditional double two-body model.

Free running period affected by network structures of suprachiasmatic nucleus neurons exposed to constant light

Exposed to the natural light-dark cycle,24 h rhythms exist in behavioral and physiological processes of living beings.Interestingly,under constant darkness or constant light,living beings can maintain a robust endogenous rhythm with a free running period(FRP)close to 24 h.In mammals,the circadian rhythm is coordinated by a master clock located in the suprachiasmatic nucleus(SCN)of the brain,which is composed of about twenty thousand self-oscillating neurons.These SCN neurons form a heterogenous network to output a robust rhythm.Thus far,the exact network topology of the SCN neurons is unknown.In this article,we examine the effect of the SCN network structure on the FRP when exposed to constant light by a Poincare model.Four typical network structures are considered,including a nearest-neighbor coupled network,a Newman-Watts small world network,an Erd¨os-Renyi random network and a Barabasi-Albert(BA)scale free network.The results show that the FRP is longest in the BA network,because the BA network is characterized by the most heterogeneous structure among these four types of networks.These findings are not affected by the average node degree of the SCN network or the value of relaxation rate of the SCN neuronal oscillators.Our findings contribute to the understanding of how the network structure of the SCN neurons influences the FRP.

The Caching and Pricing Strategy for Information-Centric Networking with Advertisers’Participation

As users’access to the network has evolved into the acquisition of mass contents instead of IP addresses,the IP network architecture based on end-to-end communication cannot meet users’needs.Therefore,the Information-Centric Networking(ICN)came into being.From a technical point of view,ICN is a promising future network architecture.Researching and customizing a reasonable pricing mechanism plays a positive role in promoting the deployment of ICN.The current research on ICN pricing mechanism is focused on paid content.Therefore,we study an ICN pricing model for free content,which uses game theory based on Nash equilibrium to analysis.In this work,advertisers are considered,and an advertiser model is established to describe the economic interaction between advertisers and ICN entities.This solution can formulate the best pricing strategy for all ICN entities and maximize the benefits of each entity.Our extensive analysis and numerical results show that the proposed pricing framework is significantly better than existing solutions when it comes to free content.

Anchor-free目标检测算法综述

目标检测作为计算机视觉领域的基础,其研究价值对于推动人工智能发展具有重要意义。长期以来,许多学者都致力于提升目标检测算法效率及性能的研究,无锚点(anchor-free)的目标检测深度学习算法以尺度灵活、鲁棒性强等优势,开始逐渐广泛应用于目标检测任务。介绍了目标检测领域中卷积神经网络和Transformer两种经典的网络架构;以核心网络架构为分类标准,分别介绍了基于卷积神经网络和基于Transformer的anchor-free目标检测深度学习算法,总结了这些算法的改进点和优缺点,并对该方向的未来发展及应用做出展望。

Prediction of Free Lime Content in Cement Clinker Based on RBF Neural Network

Considering the fact that free calcium oxide content is an important parameter to evaluate the quality of cement clinker, it is very significant to predict the change of free calcium oxide content through adjusting the parameters of processing technique. In fact, the making process of cement clinker is very complex. Therefore, it is very difficult to describe this relationship using the conventional mathematical methods. Using several models, i e, linear regression model, nonlinear regression model, Back Propagation neural network model, and Radial Basis Function （RBF） neural network model, we investigated the possibility to predict the free calcium oxide content according to selected parameters of the production process. The results indicate that RBF neural network model can predict the free lime content with the highest precision （1.3%） among all the models.

An estimation formula for the average path length of scale-free networks

A universal estimation formula for the average path length of scale free networks is given in this paper. Different from other estimation formulas, most of which use the size of network, N, as the only parameter, two parameters including N and a second parameter α are included in our formula. The parameter α is the power-law exponent, which represents the local connectivity property of a network. Because of this, the formula captures an important property that the local connectivity property at a microscopic level can determine the global connectivity of the whole network. The use of this new parameter distinguishes this approach from the other estimation formulas, and makes it a universal estimation formula, which can be applied to all types of scale-free networks. The conclusion is made that the small world feature is a derivative feature of a scale free network. If a network follows the power-law degree distribution, it must be a small world network. The power-law degree distribution property, while making the network economical, preserves the efficiency through this small world property when the network is scaled up. In other words, a real scale-free network is scaled at a relatively small cost and a relatively high efficiency, and that is the desirable result of self-organization optimization.

A survey of free space optical networks

Free Space Optical （FSO） networks, also known as optical wireless networks, have emerged as viable candidates for broadband wireless communications in the near future. The range of the potential application of FSO networks is extensive, from home to satellite. However, FSO networks have not been popularized because of insufficient availability and reliability. Researchers have focused on the problems in the physical layer in order to exploit the properties of wireless optical channels. However, recent technological developments with successful results make it practical to explore the advantages of the high bandwidth. Some researchers have begun to focus on the problems of network and upper layers in FSO networks. In this survey, we classify prospective global FSO networks into three subnetworks and give an account of them. We also present state-of- the-art research and discuss what kinds of challenges exist.

Distributed localization for anchor-free sensor networks

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.

基于双生成器网络的Data-Free知识蒸馏

知识蒸馏(knowledge distillation,KD)通过最大化近似输出分布使“教师网络”指导“学生网络”充分训练,成为大规模深度网络近端迁移、部署及应用的重要技术.然而,隐私保护意识增强与传输问题加剧使网络训练数据难以获取.如何在Data-Free的自由环境下,保证压缩网络准确率成为重要的研究方向.Data-Free学生网络学习(data-free learning of student networks,DAFL)模型,建立“教师”端生成器获得与预训练网络分布近似的伪数据集,通过知识蒸馏训练“学生网络”.然而,该框架中生成器构建及优化仍存在2个问题:1)过度信任“教师网络”对缺失真实标签伪样本的判别结果,同时,“教师网络”与“学生网络”优化目标不同,使“学生网络”难以获得准确、一致的优化信息;2)仅依赖于“教师网络”训练损失,导致数据特征多样性缺失,降低“学生网络”泛化性.针对这2个问题,提出双生成器网络架构DG-DAFL(double generators-DAFL),分别建立“教师”与“学生”端生成器并同时优化,实现网络任务与优化目标一致,提升“学生网络”判别性能.进一步,增加双生成器样本分布差异损失,利用“教师网络”潜在分布先验信息优化生成器,保证“学生网络”识别准确率并提升泛化性.实验结果表明,该方法在Data-Free环境中获得了更为有效且更鲁棒的知识蒸馏效果.DG-DAFL方法代码及模型已开源:https://github.com/LNNU-computer-research-526/DG-DAFL.git.

Immunization for scale-free networks by random walker

Based on the random walk and the intentional random walk, we propose two types of immunization strategies which require only local connectivity information. On several typical scale-free networks, we demonstrate that these strategies can lead to the eradication of the epidemic by immunizing a small fraction of the nodes in the networks. Particularly, the immunization strategy based on the intentional random walk is extremely efficient for the assortatively mixed networks.

Cascading failure in the wireless sensor scale-free networks

In the practical wireless sensor networks （WSNs）, the cascading failure caused by a failure node has serious impact on the network performance. In this paper, we deeply research the cascading failure of scale-free topology in WSNs. Firstly, a cascading failure model for scale-free topology in WSNs is studied. Through analyzing the influence of the node load on cascading failure, the critical load triggering large-scale cascading failure is obtained. Then based on the critical load, a control method for cascading failure is presented. In addition, the simulation experiments are performed to validate the effectiveness of the control method. The results show that the control method can effectively prevent cascading failure.

Malicious Code Modeling and Analysis in Weighted Scale-Free Networks

We study the detailed malicious code propagating process in scale-free networks with link weights that denotes traffic between two nodes. It is found that the propagating velocity reaches a peak rapidly then decays in a power-law form, which is different from the well-known result in unweighted network case. Simulation results show that the nodes with larger strength are preferential to be infected, but the hierarchical dynamics are not clearly found. The simulation results also show that larger dispersion of weight of networks leads to slower propagating, which indicates that malicious code propagates more quickly in unweighted scale-free networks than in weighted scale-free networks under the same condition. These results show that not only the topology of networks but also the link weights affect the malicious propagating process.

Enhancement of scale-free network attack tolerance

Despite the large size of most communication and transportation systems, there are short paths between nodes in these networks which guarantee the efficient information, data and passenger delivery; furthermore these networks have a surprising tolerance under random errors thanks to their inherent scale-free topology. However, their scale-free topology also makes them fragile under intentional attacks, leaving us a challenge on how to improve the network robustness against intentional attacks without losing their strong tolerance under random errors and high message and passenger delivering capacity. Here We propose two methods （SL method and SH method） to enhance scale-free network＇s tolerance under attack in different conditions.

Epidemic spreading on a scale-free network with awareness

This paper presents a modified susceptible-infected-recovered（SIR） model with the effects of awareness and vaccination to study the epidemic spreading on scale-free networks based on the mean-field theory.In this model,when susceptible individuals receive awareness from their infected neighbor nodes,they will take vaccination measures.The theoretical analysis and the numerical simulations show that the existence of awareness and vaccination can significantly improve the epidemic threshold and reduce the risk of virus outbreaks.In addition,regardless of the existence of vaccination,the awareness can increase the spreading threshold and slow the spreading speed effectively.For a given awareness and a certain spreading rate,the total number of infections reduces with the increasing vaccination rate.

Gas Permeability and Free Volume Hole Properties of Interpenetrating Polymer Network Studied by Positrons

A series of polyurethane/epoxy resin interpenetrating polymer networks （PU/ER IPN） were studied by positron annihilation lifetime spectroscopy （PALS）. The effects of epoxy resin type and content on the free volume properties in IPN were investigated. We found that in PU/ER IPN, the free volume hole size and fractional free volume showed a negative deviation due to closer segmental chain packing through some chemical bonding between PU and epoxy resin. Direct relationship between the gas permeability and the free volume has been established based on the free volume theory. Experimental results revealed that the free volume plays an important role in determining the gas diffusion and permeability.

Epidemic spreading in scale-free networks including the effect of individual vigilance

In this paper, we study the epidemic spreading in scale-flee networks and propose a new susceptible-infected- recovered （SIR） model that includes the effect of individual vigilance. In our model, the effective spreading rate is dynamically adjusted with the time evolution at the vigilance period. Using the mean-field theory, an analytical result is derived. It shows that individual vigilance has no effect on the epidemic threshold. The numerical simulations agree well with the analytical result. Purthermore, we investigate the effect of individual vigilance on the epidemic spreading speed. It is shown that individual vigilance can slow the epidemic spreading speed effectively and delay the arrival of peak epidemic infection.

Degree distribution and robustness of cooperative communication network with scale-free model

With the requirements of users enhanced for wireless communication, the cooperative communication will become a development trend in future. In this paper, a model based on complex networks with both preferential attachment is researched to solve an actual network CCN （Cooperative Communication Network）. Firstly, the evolution of CCN is given by four steps with different probabilities. At the same time, the rate equations of nodes degree are presented to analyze the evolution of CCN. Secondly, the degree distribution is analyzed by calculating the rate equation and numerical simulation. Finally, the robustness of CCN is studied by numerical simulation with random attack and intentional attack to analyze the effects of degree distribution and average path length. The results of this paper are more significant for building CCN to programme the resource of communication.

Generalized minimum information path routing strategy on scale-free networks

This paper presents a new routing strategy by introducing a tunable parameter into the minimum information path routing strategy we proposed previously. It is found that network transmission capacity can be considerably enhanced by adjusting the parameter with various allocations of node capability for packet delivery. Moreover, the proposed routing strategy provides a traffic load distribution which can better match the allocation of node capability than that of traditional efficient routing strategies, leading to a network with improved transmission performance. This routing strategy, without deviating from the shortest-path routing strategy in the length of paths too much, produces improved performance indexes such as critical generating rate, average length of paths and average search information.

Adaptive local routing strategy on a scale-free network

Due to the heterogeneity of the structure on a scale-free network, making the betweennesses of all nodes become homogeneous by reassigning the weights of nodes or edges is very difficult. In order to take advantage of the important effect of high degree nodes on the shortest path communication and preferentially deliver packets by them to increase the probability to destination, an adaptive local routing strategy on a scale-free network is proposed, in which the node adjusts the forwarding probability with the dynamical traffic load （packet queue length） and the degree distribution of neighbouring nodes. The critical queue length of a node is set to be proportional to its degree, and the node with high degree has a larger critical queue length to store and forward more packets. When the queue length of a high degree node is shorter than its critical queue length, it has a higher probability to forward packets. After higher degree nodes are saturated （whose queue lengths are longer than their critical queue lengths）, more packets will be delivered by the lower degree nodes around them. The adaptive local routing strategy increases the probability of a packet finding its destination quickly, and improves the transmission capacity on the scale-free network by reducing routing hops. The simulation results show that the transmission capacity of the adaptive local routing strategy is larger than that of three previous local routing strategies.

Effects of channel noise on synchronization transitions in delayed scale-free network of stochastic Hodgkin–Huxley neurons

We numerically study the effect of the channel noise on the spiking synchronization of a scale-free Hodgkin-Huxley neuron network with time delays. It is found that the time delay can induce synchronization transitions at an intermediate and proper channel noise intensity, and the synchronization transitions become strongest when the channel noise intensity is optimal. The neurons can also exhibit synchronization transitions as the channel noise intensity is varied, and this phenomenon is enhanced at around the time delays that can induce the synchronization transitions. It is also found that the synchronization transitions induced by the channel noise are dependent on the coupling strength and the network average degree, and there is an optimal coupling strength or network average degree with which the synchronization transitions become strongest. These results show that by inducing synchronization transitions, the channel noise has a big regulation effect on the synchronization of the neuronal network. These findings could find potential implications for the information transmission in neural systems.