Cross-Layer Design and Ant-Colony Optimization Based Routing Algorithm for Low Earth Orbit Satellite Networks

To improve the robustness of the Low Earth Orbit(LEO) satellites networks and realise load balancing, a Cross-layer design and Ant-colony optimization based Load-balancing routing algorithm for LEO Satellite Networks(CAL-LSN) is proposed in this paper. In CALLSN, mobile agents are used to gather routing information actively. CAL-LSN can utilise the information of the physical layer to make routing decision during the route construction phase. In order to achieve load balancing, CALLSN makes use of a multi-objective optimization model. Meanwhile, how to take the value of some key parameters is discussed while designing the algorithm so as to improve the reliability. The performance is measured by the packet delivery rate, the end-to-end delay, the link utilization and delay jitter. Simulation results show that CAL-LSN performs well in balancing traffic load and increasing the packet delivery rate. Meanwhile, the end-to-end delay and delay jitter performance can meet the requirement of video transmission.

Three-Dimensional Planning of Arrival and Departure Route Network Based on Improved Ant-Colony Algorithm

In order to improve safety,economy efficiency and design automation degree of air route in terminal airspace,Three-dimensional(3D)planning of routes network is investigated.A waypoint probability search method is proposed to optimize individual flight path.Through updating horizontal pheromones by negative feedback factors,an antcolony algorithm of path searching in 3Dterminal airspace is implemented.The principle of optimization sequence of arrival and departure routes is analyzed.Each route is optimized successively,and the overall optimization of the whole route network is finally achieved.A case study shows that it takes about 63 sto optimize 8arrival and departure routes,and the operation efficiency can be significantly improved with desirable safety and economy.

Ant-Colony Based Routing Algorithm in Wireless Sensor Networks

In the wireless sensor networks, high efficient data routing for the limited energy resource networks is an important issue. By introducing Antcolony algorithm, this paper proposes the wireless sensor network routing algorithm based on LEACH. During the construction of sensor network clusters, to avoid the node premature death because of the energy consumption, only the nodes whose residual energy is higher than the average energy can be chosen as the cluster heads. The method of repeated division is used to divide the clusters in sensor networks so that the numbers of the nodes in each cluster are balanced. The basic thought of ant-colony algorithm is adopted to realize the data routing between the cluster heads and sink nodes, and the maintenance of routing. The analysis and simulation showed that the proposed routing protocol not only can reduce the energy consumption, balance the energy consumption between nodes, but also prolong the network lifetime.

Ant-Colony Optimization for the System Reliability Problem with Quantity Discounts

This research presents an approach based upon ant-colony optimization to address the system reliability problem. For each component of a system, the number of units in parallel needs to be chosen to maximize the reliability for the entire system. As more parallel units are selected, costs increase in a proportional fashion. For this effort, quantity discounts for additional parallel units are considered, and the budget for purchase of parallel units is limited. Ant colony optimization methodology is employed to find an optimal system reliability that satisfies the budget constraint. The methodology is employed for several test problems, and near-optimal solutions are found.

Low Complexity Detection Algorithms Based on ADMIN for Massive MIMO

This paper proposes the alternating direction method of multipliers-based infinity-norm(ADMIN) with threshold(ADMIN-T) and with percentage(ADMIN-P) detection algorithms,which make full use of the distribution of the signal to interference plus noise ratio(SINR) for an uplink massive MIMO system.The ADMIN-T and ADMIN-P detection algorithms are improved visions of the ADMIN detection algorithm,in which an appropriate SINR threshold in the ADMIN-T detection algorithm and a certain percentage in the ADMIN-P detection algorithm are designed to reduce the overall computational complexity.The detected symbols are divided into two parts by the SINR threshold which is based on the cumulative probability density function(CDF) of SINR and a percentage,respectively.The symbols in higher SINR part are detected by MMSE.The interference of these symbols is then cancelled by successive interference cancellation(SIC).Afterwards the remaining symbols with low SINR are iteratively detected by ADMIN.The simulation results show that the ADMIIN-T and the ADMIN-P detection algorithms provide a significant performance gain compared with some recently proposed detection algorithms.In addition,the computational complexity of ADMIN-T and ADMIN-P are significantly reduced.Furthermore,in the case of same number of transceiver antennas,the proposed algorithms have a higher performance compared with the case of asymmetric transceiver antennas.

Bee Colony Optimization Algorithm for Routing and Wavelength Assignment Based on Directional Guidance in Satellite Optical Networks

With the development of satellite communication,in order to solve the problems of shortage of on-board resources and refinement of delay requirements to improve the communication performance of satellite optical networks,this paper proposes a bee colony optimization algorithm for routing and wavelength assignment based on directional guidance(DBCO-RWA)in satellite optical networks.In D-BCORWA,directional guidance based on relative position and link load is defined,and then the link cost function in the path search stage is established based on the directional guidance factor.Finally,feasible solutions are expanded in the global optimization stage.The wavelength utilization,communication success probability,blocking rate,communication hops and convergence characteristic are simulated.The results show that the performance of the proposed algorithm is improved compared with existing algorithms.

The 3x + 1 Conjecture, a Direct Path

The 3x + 1 problem, is a math problem that has baffled mathematicians for over 50 years. It’s easy to explain: take any positive number, if it’s even, divide it by 2;if it’s odd, multiply it by 3 and add 1. Repeat this process with the resulting number, and the conjecture says that you will eventually reach 1. Despite testing all starting values up to an enormous number, no one has proved the conjecture is true for all possible starting values. The problem’s importance lies in its simplicity and difficulty, inspiring new ideas in mathematics and advancing fields like number theory, dynamical systems, and computer science. Proving or disproving the conjecture would revolutionize our understanding of math. The presence of infinite sequences is a matter of question. To investigate and solve this conjecture, we are utilizing a novel approach involving the fields of number theory and computer science.

A Comparative Analysis of the New -3(-n) - 1 Remer Conjecture and a Proof of the 3n + 1 Collatz Conjecture

This scientific paper is a comparative analysis of two mathematical conjectures. The newly proposed -3(-n) - 1 Remer conjecture and how it is related to and a proof of the more well known 3n + 1 Collatz conjecture. An overview of both conjectures and their respective iterative processes will be presented. Showcasing their unique properties and behavior to each other. Through a detailed comparison, we highlight the similarities and differences between these two conjectures and discuss their significance in the field of mathematics. And how they prove each other to be true.

考虑阀点效应的电力系统经济分配算法

经济分配(ED)对于电力系统的节能至关重要,适当的分配方法可以为电厂节约巨额生产成本,然而阀点效应使得实际ED问题呈现出不光滑和非凸的特性,导致一些经典的优化算法和启发式算法无法在合理时间内发现最优解。提出一种新的改进教与学优化算法来求解计及阀点效应的经济分配问题,并采用一种新的修正策略取代罚函数法来处理约束条件。为了验证新算法的有效性和鲁棒性,选取典型的benchmark函数和ED实例进行仿真计算,结果表明与其他代表性算法相比,该方法求解精度高、收敛速度快,为计及阀点效应的经济分配问题求解提供了一条新途径。

Automatic segmentation of foveal avascular zone based on adaptive watershed algorithm in retinal optical coherence tomography angiography images

The size and shape of the foveal avascular zone(FAZ)have a strong positive correlation with several vision-threatening ret inovascular diseases.The identification,segmentation and analysis of FAZ are of great significance to clinical diagnosis and treatment.We presented an adaptive watershed algorithm to automatically extract F AZ from retinal optical coherence tomography angiography(OCTA)images.For the traditional watershed algorithm,"over-segmentation"is the most common problem.FAZ is often incorrectly divided into multiple regions by redundant"dams".This paper analyzed the relationship between the"dams"length and the maximum inscribed circle radius of FAZ,and proposed an adaptive watershed algorithm to solve the problem of"over-segmentation".Here,132 healthy retinal images and 50 diabetic retinopathy(DR)images were used to verify the accuracy and stability of the algorithm.Three ophthal-mologists were invited to make quan titative and qualitative evaluations on the segmentation results of this algorithm.The quantitative evaluation results show that the correlation coffi-cients between the automatic and manual segmentation results are 0.945(in healthy subjects)and 0.927(in DR patients),respectively.For qualitative evaluation,the percentages of"perfect segmentation"(score of 3)and"good segmentation"(score of 2)are 99.4%(in healthy subjects)and 98.7%(in DR patients),respectively.This work promotes the application of watershed algorithm in FAZ segmentation,making it a useful tool for analyzing and diagnosing eye diseases.

A GA approach to vehicle routing problem with time windows considering loading constraints

As a new variant of vehicle routing problem( VRP),a finished vehicle routing problem with time windows in finished vehicle logistics( FVRPTW) is modeled and solved. An optimization model for FVRPTW is presented with the objective of scheduling multiple transport routes considering loading constraints along with time penalty function to minimize the total cost. Then a genetic algorithm( GA) is developed. The specific encoding and genetic operators for FVRPTW are devised.Especially,in order to accelerate its convergence,an improved termination condition is given. Finally,a case study is used to evaluate the effectiveness of the proposed algorithm and a series of experiments are conducted over a set of finished vehicle routing problems. The results demonstrate that the proposed approach has superior performance and satisfies users in practice. Contributions of the study are the modeling and solving of a complex FVRPTW in logistics industry.

Design of wideband graded-index antireflection coatings at oblique light incidence

We suggest a design method of graded-refractive-index （GRIN） antireflection （AR） coating for s-polarized or p- polarized light at off-normal incidence. The spectrum characteristic of the designed antireflection coating with a quintic effective refractive-index profile for a given state of polarization has been discussed. In addition, the genetic algorithm was used to optimize the refractive index profile of the GRIN antireflection for reducing the mean reflectance of s- and p-polarizations. The average reflectance loss was reduced to only 0.04% by applying optimized GRIN AR coatings onto BK7 glass over the wavelength range from 400 to 800 nm at the incident angle of θo = 70°.

Joint power and spectrum allocation algorithm in cognitive radio networks

The spectrum sharing problem between primary and cognitive users is mainly investigated. Since the interference for primary users and the total power for cognitive users are constrained, based on the well-known water-filling theorem, a novel one-user water-filling algorithm is proposed, and then the corresponding simulation results are given to analyze the feasibility and validity. After that this algorithm is used to solve the communication utility optimization problem subject to the power constraints in cognitive radio network. First, through the gain to noise ratio for cognitive users, a subcarrier and power allocation algorithm based on the optimal frequency partition is proposed for two cognitive users. Then the spectrum sharing algorithm is extended to multiuser conditions such that the greedy and parallel algorithms are proposed for spectrum sharing. Theory and simulation analysis show that the subcarrier and power allocation algorithms can not only protect the primary users but also effectively solve the spectrum and power allocation problem for cognitive users.

Investigation of the optimum differential gear ratio for real driving cycles by experiment design and genetic algorithm

Experiment statistical method and genetic algorithms based optimization method are used to obtain the optimum differential gear ratio for heavy truck that provides best fuel consumption when changing the working condition that affects its torque and speed range. The aim of the study is to obtain the optimum differential gear ratio with fast and accurate optimization calculation without affecting drivability characteristics of the vehicle according to certain driving cycles that represent the new working conditions of the truck. The study is carried on a mining dump truck YT3621 with 9 for- ward shift manual transmission. Two loading conditions, no load and 40 t, and four on road real driving cycles have been discussed. The truck powertrain is modeled using GT-drive, and DOE -post processing tool of the GT-suite is used for DOE analysis and genetic algorithm optimization.

Parallel Test Tasks Scheduling and Resources Configuration Based on GA-ACA

A Genetic Algorithm-Ant Colony Algorithm(GA-ACA),which can be used to optimize multi-Unit Under Test(UUT)parallel test tasks sequences and resources configuration quickly and accurately,is proposed in the paper.With the establishment of the mathematic model of multi-UUT parallel test tasks and resources,the condition of multi-UUT resources mergence is analyzed to obtain minimum resource requirement under minimum test time.The definition of cost efficiency is put forward,followed by the design of gene coding and path selection project,which can satisfy multi-UUT parallel test tasks scheduling.At the threshold of the algorithm,GA is adopted to provide initial pheromone for ACA,and then dual-convergence pheromone feedback mode is applied in ACA to avoid local optimization and parameters dependence.The practical application proves that the algorithm has a remarkable effect on solving the problems of multi-UUT parallel test tasks scheduling and resources configuration.

Research of improving the dynamic scheduling algorithm in the CAN bus control networks

Currently, the article analyzes the CAN bus＇s rule of priority＇s arbitration bit by bit without destroy. It elicits the conclusion that if static priority based on the affirmatory system model is used, the lower priority＇s messages will be delayed considerably more, even some data will be lost when the bus＇s bandwidth is widely used. The scheduling cannot be modified neither during the system when static priority is used. The dynamic priority promoting method and the math model of SQSA and SQMA are presented; it analyzes the model＇s rate of taking in and sending out in large quantities, the largest delay, the problems and solutions when using SQMA. In the end, it is confirmed that the method of improving dynamic priority has good performances on the network rate of taking in and sending out in large quantities, the average delay, and the rate of network usage by emulational experiments.

Other Mountain Stones Can Attack Jade: The 5-Steps Rule

Since the 5-steps rule was proposed in 2011, it has been widely used in many areas of molecular biology, both theoretical and experimental. It can be even used to deal with the commercial problems and bank systems, as well as material science systems. Just like the machine-learning algorithms, it is the jade for nearly all the statistical systems.

Novel approach for identifying Z-axis drift of RLG based on GA-SVR model

This paper describes a novel approach for identifying the Z-axis drift of the ring laser gyroscope （RLG） based on ge-netic algorithm （GA） and support vector regression （SVR） in the single-axis rotation inertial navigation system （SRINS）. GA is used for selecting the optimal parameters of SVR. The latitude error and the temperature variation during the identification stage are adopted as inputs of GA-SVR. The navigation results show that the proposed GA-SVR model can reach an identification accuracy of 0.000 2 （？）/h for the Z-axis drift of RLG. Compared with the ra-dial basis function-neural network （RBF-NN） model, the GA-SVR model is more effective in identification of the Z-axis drift of RLG.

A varying time-step explicit numerical inte-gration algorithm for solving motion equa-tion

If a traditional explicit numerical integration algorithm is used to solve motion equation in the finite element simulation of wave motion, the time-step used by numerical integration is the smallest time-step restricted by the stability criterion in computational region. However, the excessively small time-step is usually unnecessary for a large portion of computational region. In this paper, a varying time-step explicit numerical integration algorithm is introduced, and its basic idea is to use different time-step restricted by the stability criterion in different computational region. Finally, the feasibility of the algorithm and its effect on calculating precision are verified by numerical test.

Obstacle avoidance technology of bionic quadruped robot based on multi-sensor information fusion

In order to improve the ability of a bionic quadruped robot to percept the location of obstacles in a complex and dynamic environment, the information fusion between an ultrasonic sensor and a binocular sensor was studied under the condition that the robot moves in the Walk gait on a structured road. Firstly, the distance information of obstacles from these two sensors was separately processed by the Kalman filter algorithm, which largely reduced the noise interference. After that, we obtained two groups of estimated distance values from the robot to the obstacle and a variance of the estimation value. Additionally, a fusion of the estimation values and the variances was achieved based on the STF fusion algorithm. Finally, a simulation was performed to show that the curve of a real value was tracked well by that of the estimation value, which attributes to the effectiveness of the Kalman filter algorithm. In contrast to statistics before fusion, the fusion variance of the estimation value was sharply decreased. The precision of the position information is 4. 6 cm, which meets the application requirements of the robot.