A Model of Hierarchical Key Assignment Scheme

A model of the hierarchical key assignment scheme is approached in this paper, which can be used with any cryptography algorithm. Besides, the optimal dynamic control property of a hierarchical key assignment scheme will be defined in this paper. Also, our scheme model will meet this property.

UAVs cooperative task assignment and trajectory optimization with safety and time constraints

This paper proposes new methods and strategies for Multi-UAVs cooperative attacks with safety and time constraints in a complex environment.Delaunay triangle is designed to construct a map of the complex flight environment for aerial vehicles.Delaunay-Map,Safe Flight Corridor(SFC),and Relative Safe Flight Corridor(RSFC)are applied to ensure each UAV flight trajectory's safety.By using such techniques,it is possible to avoid the collision with obstacles and collision between UAVs.Bezier-curve is further developed to ensure that multi-UAVs can simultaneously reach the target at the specified time,and the trajectory is within the flight corridor.The trajectory tracking controller is also designed based on model predictive control to track the planned trajectory accurately.The simulation and experiment results are presented to verifying developed strategies of Multi-UAV cooperative attacks.

Storage Assignment Optimization in a Multi-tier Shuttle Warehousing System

The current mathematical models for the storage assignment problem are generally established based on the traveling salesman problem（TSP）,which has been widely applied in the conventional automated storage and retrieval system（AS/RS）.However,the previous mathematical models in conventional AS/RS do not match multi-tier shuttle warehousing systems（MSWS） because the characteristics of parallel retrieval in multiple tiers and progressive vertical movement destroy the foundation of TSP.In this study,a two-stage open queuing network model in which shuttles and a lift are regarded as servers at different stages is proposed to analyze system performance in the terms of shuttle waiting period（SWP） and lift idle period（LIP） during transaction cycle time.A mean arrival time difference matrix for pairwise stock keeping units（SKUs） is presented to determine the mean waiting time and queue length to optimize the storage assignment problem on the basis of SKU correlation.The decomposition method is applied to analyze the interactions among outbound task time,SWP,and LIP.The ant colony clustering algorithm is designed to determine storage partitions using clustering items.In addition,goods are assigned for storage according to the rearranging permutation and the combination of storage partitions in a 2D plane.This combination is derived based on the analysis results of the queuing network model and on three basic principles.The storage assignment method and its entire optimization algorithm method as applied in a MSWS are verified through a practical engineering project conducted in the tobacco industry.The applying results show that the total SWP and LIP can be reduced effectively to improve the utilization rates of all devices and to increase the throughput of the distribution center.

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.

A Probing Model of Secret Key Generation Based on Channel Autocorrelation Function

Secret key generation(SKG)is a promising solution to the problem of wireless communications security.As the first step of SKG,channel probing affects it significantly.Although there have been some probing schemes,there is a lack of research on the optimization of the probing process.This study investigates how to optimize correlated parameters to maximize the SKG rate(SKGR)in the time-division duplex(TDD)mode.First,we build a probing model which includes the effects of transmitting power,the probing period,and the dimension of sample vectors.Based on the model,the analytical expression of the SKGR is given.Next,we formulate an optimization problem for maximizing the SKGR and give an algorithm to solve it.We conclude the SKGR monotonically increases as the transmitting power increases.Relevant mathematical proofs are given in this study.From the simulation results,increasing appropriately the probing period and the dimension of the sample vector could increase the SKGR dramatically compared to a yardstick,which indicates the importance of optimizing the parameters related to the channel probing phase.

Reinforcement Learning Based Quantization Strategy Optimal Assignment Algorithm for Mixed Precision

The quantization algorithm compresses the original network by reducing the numerical bit width of the model,which improves the computation speed. Because different layers have different redundancy and sensitivity to databit width. Reducing the data bit width will result in a loss of accuracy. Therefore, it is difficult to determinethe optimal bit width for different parts of the network with guaranteed accuracy. Mixed precision quantizationcan effectively reduce the amount of computation while keeping the model accuracy basically unchanged. In thispaper, a hardware-aware mixed precision quantization strategy optimal assignment algorithm adapted to low bitwidth is proposed, and reinforcement learning is used to automatically predict the mixed precision that meets theconstraints of hardware resources. In the state-space design, the standard deviation of weights is used to measurethe distribution difference of data, the execution speed feedback of simulated neural network accelerator inferenceis used as the environment to limit the action space of the agent, and the accuracy of the quantization model afterretraining is used as the reward function to guide the agent to carry out deep reinforcement learning training. Theexperimental results show that the proposed method obtains a suitable model layer-by-layer quantization strategyunder the condition that the computational resources are satisfied, and themodel accuracy is effectively improved.The proposed method has strong intelligence and certain universality and has strong application potential in thefield of mixed precision quantization and embedded neural network model deployment.

An Efficient Key Assignment Scheme Based on One—Way Hash Function in a User Hierarchy

In order to solve the problems resulted from dynamic access control in a userhierarchy, a cryptographic key assignment scheme is proposed by Prof. Lin to promote the performingability and to simplify the procedure. However, it may cause the security in danger as the userchanges his secret key; besides, some secret keys may be disclosed due to the unsuitable selectionof the security classes' identities. Through setting up a one-way hash function onto Lin's scheme,the proposed modification can greatly improve the security of Lin's scheme.

Improved Hungarian algorithm for assignment problems of serial-parallel systems

In order to overcome the shortcoming of the classical Hungarian algorithm that it can only solve the problems where the total cost is the sum of that of each job, an improved Hungarian algorithm is proposed and used to solve the assignment problem of serial-parallel systems. First of all, by replacing parallel jobs with virtual jobs, the proposed algorithm converts the serial-parallel system into a pure serial system, where the classical Hungarian algorithm can be used to generate a temporal assignment plan via optimization. Afterwards, the assignment plan is validated by checking whether the virtual jobs can be realized by real jobs through local searching. If the assignment plan is not valid, the converted system will be adapted by adjusting the parameters of virtual jobs, and then be optimized again. Through iterative searching, the valid optimal assignment plan can eventually be obtained.To evaluate the proposed algorithm, the valid optimal assignment plan is applied to labor allocation of a manufacturing system which is a typical serial-parallel system.

Optimization of Load Assignment to Boilers in Industrial Boiler Plants

Along with the increasing importance of sustainable energy, the optimization of load assignment to boilers in an industrial boiler plant becomes one of the major projects for the optimal operation of boiler plants. Optimal load assignment for power systems has been a long-lasting subject, while it is quite new for industrial boiler plants. The existing methods of optimal load assignment for boiler plants are explained and analyzed briefly in the paper. They all need the fuel cost curves of boilers. Thanks to some special features of the curves for industrial boilers, a new model referred to as minimized departure model (MDM) of optimization of load assignment for boiler plants is developed and proposed in the paper. It merely relies upon the accessible data of two typical working conditions to build the model, viz. the working conditions with the highest efficiency of a boiler and with no-load. Explanation of the algorithm of computer program is given, and effort is made so as to determine in advance how many and which boilers are going to work. Comparison between the results using MDM and the results reported in references is carried out, which proves that MDM is preferable and practicable.

A multi-objective train-scheduling optimization model considering locomotive assignment and segment emission constraints for energy saving

Energy saving and emission reduction for railway systems should not only be studied from a technical perspective but should also be focused on management and economics. On the basis of relevant trainscheduling models for train operation management, in this paper we introduce an extended multi-objective trainscheduling optimization model considering locomotive assignment and segment emission constraints for energy saving. The objective of setting up this model is to reduce the energy and emission cost as well as total passenger- time. The decision variables include continuous variables such as train arrival and departure time, and binary vari- ables such as locomotive assignment and segment occu- pancy. The constraints are concerned with train movement, trip time, headway, and segment emission, etc. To obtain a non-dominated satisfactory solution on these objectives, a fuzzy multi-objective optimization algorithm is employed to solve the model. Finally, a numerical example is performed and used to compare the proposed model with the existing model. The results show that the proposed model can reduce the energy consumption, meet exhausts emission demands effectively by optimal locomotive assignment, and its solution methodology is effective.

Modeling and Algorithm Application of Weapon Assignment System

In order to improve weapon assignment(WA)accuracy in real scenario,an artificial neural network(ANN)model is built to calculate real-time weapon kill probabilities.Considering the WA characteristic,each input representing one assessment index should be normalized properly.Therefore,the modified WA model is oriented from constant value to dynamic computation.Then an improved invasive weed optimization algorithm is applied to solve the WA problem.During search process,local search is used to improve the initial population,and seed reproduction is redefined to guarantee the mutation from multipoint to single point.In addition,the idea of vaccination and immune selection in biology is added into optimization process.Finally,simulation results verify the model′s rationality and effectiveness of the proposed algorithm.

Distributed Frequency Assignment Using Hierarchical Cooperative Multi-Agent System

Recent demand for wireless communication continues to grow rapidly as a result of the increasing number of users, the emergence of new user requirements, and the trend to new access technologies. At the same time, the electromagnetic spectrum or frequencies allocated for this purpose are still limited. This makes solving the frequency assignment problem more and more critical. In this paper, a new approach is proposed using self-organizing multi-agent systems to solve distributed dynamic channel-assignment;it concerns distribution among agents which task is to assign personal station to frequencies with respect to well known constraints. Agents only know their variables and the constraints affecting them, and have to negotiate to find a collective solution. The approach is based on a macro-level management taking the form of a hierarchical group of distributed agents in the network and handling all RANs (Regional Radio Access Network) in a localized region regardless of the operating band. The approach defines cooperative self-organization as the process leading the collective to the solution: agents can change the organization by their own decision to improve the state of the system. Our approach has been tested on PHEADEPHIA benchmarks of frequency assignment Problem. The results obtained are equivalent to those of current existing methods with the benefits that our approach shows more efficiency in terms of flexibility and autonomy.

Integrating Tabu Search in Particle Swarm Optimization for the Frequency Assignment Problem

In this paper, we address one of the issues in the frequency assignment problem for cellular mobile networks in which we intend to minimize the interference levels when assigning frequencies from a limited frequency spectrum. In order to satisfy the increasing demand in such cellular mobile networks, we use a hybrid approach consisting of a Particle Swarm Optimization(PSO) combined with a Tabu Search(TS) algorithm. This approach takes both advantages of PSO efficiency in global optimization and TS in avoiding the premature convergence that would lead PSO to stagnate in a local minimum. Moreover, we propose a new efficient, simple, and inexpensive model for storing and evaluating solution's assignment. The purpose of this model reduces the solution's storage volume as well as the computations required to evaluate thesesolutions in comparison with the classical model. Our simulation results on the most known benchmarking instances prove the effectiveness of our proposed algorithm in comparison with previous related works in terms of convergence rate, the number of iterations, the solution storage volume and the running time required to converge to the optimal solution.

Task assignment in ground-to-air confrontation based on multiagent deep reinforcement learning

The scale of ground-to-air confrontation task assignments is large and needs to deal with many concurrent task assignments and random events.Aiming at the problems where existing task assignment methods are applied to ground-to-air confrontation,there is low efficiency in dealing with complex tasks,and there are interactive conflicts in multiagent systems.This study proposes a multiagent architecture based on a one-general agent with multiple narrow agents(OGMN)to reduce task assignment conflicts.Considering the slow speed of traditional dynamic task assignment algorithms,this paper proposes the proximal policy optimization for task assignment of general and narrow agents(PPOTAGNA)algorithm.The algorithm based on the idea of the optimal assignment strategy algorithm and combined with the training framework of deep reinforcement learning(DRL)adds a multihead attention mechanism and a stage reward mechanism to the bilateral band clipping PPO algorithm to solve the problem of low training efficiency.Finally,simulation experiments are carried out in the digital battlefield.The multiagent architecture based on OGMN combined with the PPO-TAGNA algorithm can obtain higher rewards faster and has a higher win ratio.By analyzing agent behavior,the efficiency,superiority and rationality of resource utilization of this method are verified.

Feeder assignment optimization algorithm for multi-head mounter

This paper analyzes optimization algorithms of assembly time for a multi-head mounter. The algorithm in this paper is composed of four steps. First, it assigns the components to feeders based on the ＂one-to-many mapping＂. Secondly, it assigns nozzles to heads by making full use of the ＂on-the-fly nozzle change＂ heads. Thirdly, it Qrganizes the feeder groups so that the heads can pick and place components group by group. Finally, it assigns feeder groups to slots. The result demonstrates that the algorithm has good performance in practice.

Optimization of the Open Degree of Key Valves Based on Relative Entropy and Pipeline Leakage

Based on information entropy theory, the definition of relative entropy, and the relative entropy minimum principle, this study establishes a multi-objective optimization model for a key valve opening of an urban water distribution network(WDN). Each node pressure is taken as the main research object to reduce pipeline leakage. Moreover, genetic algorithm is applied in the proposed model to solve the key valve opening of the actual WDN in a city in southern China. Using the proposed model, the relevant decision variables of a WDN can be optimized to provide a new manner of network dispatching.

Enhancing Task Assignment in Crowdsensing Systems Based on Sensing Intervals and Location

The popularity of mobile devices with sensors is captivating the attention of researchers to modern techniques,such as the internet of things(IoT)and mobile crowdsensing(MCS).The core concept behind MCS is to use the power of mobile sensors to accomplish a difficult task collaboratively,with each mobile user completing much simpler micro-tasks.This paper discusses the task assignment problem in mobile crowdsensing,which is dependent on sensing time and path planning with the constraints of participant travel distance budgets and sensing time intervals.The goal is to minimize aggregate sensing time for mobile users,which reduces energy consumption to encourage more participants to engage in sensing activities and maximize total task quality.This paper introduces a two-phase task assignment framework called location time-based algorithm(LTBA).LTBA is a framework that enhances task assignment in MCS,whereas assigning tasks requires overlapping time intervals between tasks and mobile users’tasks and the location of tasks and mobile users’paths.The process of assigning the nearest task to the mobile user’s current path depends on the ant colony optimization algorithm(ACO)and Euclidean distance.LTBA combines two algorithms:(1)greedy online allocation algorithm and(2)bio-inspired traveldistance-balance-based algorithm(B-DBA).The greedy algorithm was sensing time interval-based and worked on reducing the overall sensing time of the mobile user.B-DBA was location-based and worked on maximizing total task quality.The results demonstrate that the average task quality is 0.8158,0.7093,and 0.7733 for LTBA,B-DBA,and greedy,respectively.The sensing time was reduced to 644,1782,and 685 time units for LTBA,B-DBA,and greedy,respectively.Combining the algorithms improves task assignment in MCS for both total task quality and sensing time.The results demonstrate that combining the two algorithms in LTBA is the best performance for total task quality and total sensing time,and the greedy algorithm follows it then B-DBA.

Improved Multileader Optimization with Shadow Encryption for Medical Images in IoT Environment

Nowadays,security plays an important role in Internet of Things(IoT)environment especially in medical services’domains like disease prediction and medical data storage.In healthcare sector,huge volumes of data are generated on a daily basis,owing to the involvement of advanced health care devices.In general terms,health care images are highly sensitive to alterations due to which any modifications in its content can result in faulty diagnosis.At the same time,it is also significant to maintain the delicate contents of health care images during reconstruction stage.Therefore,an encryption system is required in order to raise the privacy and security of healthcare data by not leaking any sensitive data.The current study introduces Improved Multileader Optimization with Shadow Image Encryption for Medical Image Security(IMLOSIE-MIS)technique for IoT environment.The aim of the proposed IMLOSIE-MIS model is to accomplish security by generating shadows and encrypting them effectively.To do so,the presented IMLOSIE-MIS model initially generates a set of shadows for every input medical image.Besides,shadow image encryption process takes place with the help of Multileader Optimization(MLO)withHomomorphic Encryption(IMLO-HE)technique,where the optimal keys are generated with the help of MLO algorithm.On the receiver side,decryption process is initially carried out and shadow image reconstruction process is conducted.The experimentation analysis was carried out on medical images and the results inferred that the proposed IMLOSIE-MIS model is an excellent performer compared to other models.The comparison study outcomes demonstrate that IMLOSIE-MIS model is robust and offers high security in IoT-enabled healthcare environment.

Remote Sensing Image Encryption Using Optimal Key Generation-Based Chaotic Encryption

The Internet of Things(IoT)offers a new era of connectivity,which goes beyond laptops and smart connected devices for connected vehicles,smart homes,smart cities,and connected healthcare.The massive quantity of data gathered from numerous IoT devices poses security and privacy concerns for users.With the increasing use of multimedia in communications,the content security of remote-sensing images attracted much attention in academia and industry.Image encryption is important for securing remote sensing images in the IoT environment.Recently,researchers have introduced plenty of algorithms for encrypting images.This study introduces an Improved Sine Cosine Algorithm with Chaotic Encryption based Remote Sensing Image Encryption(ISCACE-RSI)technique in IoT Environment.The proposed model follows a three-stage process,namely pre-processing,encryption,and optimal key generation.The remote sensing images were preprocessed at the initial stage to enhance the image quality.Next,the ISCACERSI technique exploits the double-layer remote sensing image encryption(DLRSIE)algorithm for encrypting the images.The DLRSIE methodology incorporates the design of Chaotic Maps and deoxyribonucleic acid(DNA)Strand Displacement(DNASD)approach.The chaotic map is employed for generating pseudorandom sequences and implementing routine scrambling and diffusion processes on the plaintext images.Then,the study presents three DNASD-related encryption rules based on the variety of DNASD,and those rules are applied for encrypting the images at the DNA sequence level.For an optimal key generation of the DLRSIE technique,the ISCA is applied with an objective function of the maximization of peak signal to noise ratio(PSNR).To examine the performance of the ISCACE-RSI model,a detailed set of simulations were conducted.The comparative study reported the better performance of the ISCACE-RSI model over other existing approaches.

Numerical Study on Hydraulic Characteristics and Discharge Capacity of Modified Piano Key Weir with Various Inlet/Outlet Width Ratio

A modified piano key weir with a rounded nose and a parapet wall (MPKW) can improve the discharge capacity significantly compared to a standard piano key weir. However, the optimum of the inlet/outlet width ratio (Wi/Wo) on the discharge efficiency of MPKW is still not investigated numerically. The present work utilized the numerical modeling to investigate and analyze the effects of the inlet/outlet key width ratios on the hydraulic characteristics and discharge capacity of the MPKW. To validate the numerical model with the experimental data, the results indicate that the average relative error is 2.96%, which confirms that the numerical model is fairly well to predictthe specifications of flow over on the MPKW. Numerical simulation results indicated that the discharge capacity of the MPKW can be improved up to 8.5% by optimizing the Wi/Wo ratio ranging from 1.53 to 1.67 even if the other parameters of the MPKW keep unchanged. A big Wi/Wo ratio generally leads to an increase in discharge capacity at low heads and a little effect on the discharge efficiency at high heads. The discharge efficiency of the inlet and outlet crests increases up to 9.6% for high heads, while discharge efficiency of the lateral crest decreases up to 23.5% compared with the reference model. The findings of the study revealed that the intrinsic influencing mechanism of the Wi/Wo ratio on the discharge performance of MPKWs.