Multiple mode cooperation based software engineering talents training

The main problems of the traditional software talent training are that the knowledge learned is out of touch of the industry,weak ability to solve complex engineering problems and the comprehensive quality cannot meet the requirements of enterprises.Taking the course of digital image processing as an example,this paper analyzes the key steps in the training process in details,and proposes a multiple mode collaborative based software engineering talent training mechanism,which brings the key subjects of teaching materials,teachers,students,enterprises,subjects into a unified training mechanism,so as to provide a new ideas for software talent teaching.

OPTIMAL DYNAMIC LOAD DISTRIBUTION OF MULTIPLE COOPERATING ROBOT MANIPULATORS

For the situation of multiple cooperating manipulators handling a single object,an equilibrium equation is presented in which the manipulator dynamics and control forces/torques are taken into account,and a expression is derived to allow the optimal dynamic load distribution of the combined system can be made.

HEURISTIC PARTICLE SWARM OPTIMIZATION ALGORITHM FOR AIR COMBAT DECISION-MAKING ON CMTA

Combining the heuristic algorithm （HA） developed based on the specific knowledge of the cooperative multiple target attack （CMTA） tactics and the particle swarm optimization （PSO）, a heuristic particle swarm optimization （HPSO） algorithm is proposed to solve the decision-making （DM） problem. HA facilitates to search the local optimum in the neighborhood of a solution, while the PSO algorithm tends to explore the search space for possible solutions. Combining the advantages of HA and PSO, HPSO algorithms can find out the global optimum quickly and efficiently. It obtains the DM solution by seeking for the optimal assignment of missiles of friendly fighter aircrafts （FAs） to hostile FAs. Simulation results show that the proposed algorithm is superior to the general PSO algorithm and two GA based algorithms in searching for the best solution to the DM problem.

Role of NGOs in the National Significant Seismic Monitoring and Protection Regions

In this paper,we analyzed the One Foundations relief and reconstruction activities after the Yaan earthquake.The analysis shows that the participation of NGOs in disaster relief activities has undergone different stages.In the Jiujiang earthquake,NGOs participation was in the rudimentary stage.In the Wenchuan earthquake,they became one of the active participants.In the Yaan earthquake,they played an active role through a cooperation mechanism.That means NGOs have had the capability of resource mobilization and cooperation with them will improve disaster management capacities,especially in the national significant seismic monitoring and protection regions.

Network coding with diversity and outdated channel state information

Physical-layer network coding （PNC） has the potential to significantly improve the throughput of wireless networks where the channels can be modeled as additive white Gaussian noise （AWGN） channel. As extending to mul- tiple channels, this technique requires both amplitude and phase compensation at each transmitter and will lead to inef- ficient systems yielding no diversity even with perfect channel state information （CSI）. In order to avoid these limita- tions, we apply network coding with diversity （NCD） to achieve a form of selection diversity and extend NCD to coop- erative multiple access channels in this paper. However, in practical wireless communication systems, the CSI could become outdated due to the difference between the CSI used in the relay selection and data transmission phases. Hence, the selected relay may not be the best one during data transmission phase due to the dynamic change in the wireless channels. Therefore, we first explore the relation between the present and past CSIs. Exploiting this relationship, the NCD scheme with outdated CSI is investigated based on the past CSI. To evaluate the performance of this scheme, an information-theoretic metric, namely the outage capacity, is studied under this condition.

Distributed cooperative guidance for multiple missiles with fixed and switching communication topologies

This study investigates cooperative guidance problems for multiple missiles with fixed and switching directed communication topologies. A two-step guidance strategy is proposed to realize the simultaneous attack. In the first step, a distributed cooperative guidance law is designed using local neighboring information for multiple missiles to achieve consensus on range-to-go and leading angle. The second step begins when the consensus of multiple missiles is realized. During the second step, multiple missiles disconnect from each other and hit the target using the proportional navigation guidance law. First, based on the local neighboring communications, a sufficient condition for multiple missiles to realize simultaneous attack with a fixed communication topology is presented, where the topology is only required to have a directed spanning tree. Then,the results are extended to the case of switching communication topologies. Finally, numerical simulations are provided to validate the theoretical results.

HEURISTIC QUANTUM GENETIC ALGORITHM FOR AIR COMBAT DECISION MAKING ON COOPERATIVE MULTIPLE TARGET ATTACK

In order to achieve the optimal attack outcome in the air combat under the beyond visual range(BVR)condition,the decision-making(DM)problem which is to set a proper assignment for the friendly fighters on the hostile fighters is the most crucial task for cooperative multiple target attack(CMTA).In this paper,a heuristic quantum genetic algorithm(HQGA)is proposed to solve the DM problem.The originality of our work can be supported in the following aspects:(1)the HQGA assigns all hostile fighters to every missile rather than fighters so that the HQGA can encode chromosomes with quantum bits(Q-bits);(2)the relative successful sequence probability(RSSP)is defined,based on which the priority attack vector is constructed;(3)the HQGA can heuristically modify quantum chromosomes according to modification technique proposed in this paper;(4)last but not the least,in some special conditions,the HQGA gets rid of the constraint described by other algorithms that to obtain a better result.In the end of this paper,two examples are illustrated to show that the HQGA has its own advantage over other algorithms when dealing with the DM problem in the context of CMTA.