The International Arms Control and Disarmament Situation in 2015

In 2015,the situation of the international arms control and disarmament was in the overall stability,the United States and Russia continued to promote the performance process of the Strategic Arms Reduction Treaty(New START),the final agreement on the Iran nuclear issue was signed.But the ninth

Research on Equipment Support Activity Process Simulation Based on Monte Carlo Method

The influencing factors of the equipment support activity process have the characteristics of nonlinearity, high dimension, many constraints, random uncertainty and fuzzy uncertainty. Monte Carlo method can solve the above problems commendably. This paper analyzes the main equipment support activity process and establishes the sampling plan and simulation model of the medium maintenance process based on Monte Carlo method, and the simulation result verifies a fact that the medium maintenance time can be effectively reduced when parallel operation on some procedures is used. It has a practical value and can give good advice to achieve the capability of equipment supportability.

Investigation of Geiger-mode detector in multi-hit model for laser ranging

The performance of detector limits the overall performance of laser ranging system. And the design of multi-hit detector is one of the feasible ways to promote the performance of detector. Currently, the segmentation method or the recursive method is commonly used to analyze the multi-hit detector model. To the best of our knowledge, this paper is the first to propose a combinatorial method to solve the multi-hit detector model from the perspective of discrete time. Then, universal formulas of total signal detection probability and the average count are deduced based on the Poisson distribution signal. Furthermore, analysis is made to figure out how the average count changes with different parameters, such as the dead time, gating time, rate intensity. As a result, for GM-APD, the multi-hit detector model is verified advantageously compared to the single-hit detector model in improving the average count theoretically. Meanwhile, a discrete step feature is presented when average count changes with dead time or the gating time, which is of great significance in gating time optimization.

Algorithms for checking channel passing in web service choreography

Web service choreography describes global mod- els of service interactions among a set of participants. For an interaction to be executed, the participants must know the required channel（s） used in the interaction, otherwise the ex- ecution will get stuck. Since channels are composed dynami- cally, the initial channel set of each participant is often insuf- ficient to meet the requirements. It is the responsibility of the participants to pass required channels owned （known） by one to others. Since service choreography may involve many par- ticipants and complex channel constraints, it is hard for de- signers to specify channel passing in a choreography exactly as required. We address the problem of checking whether a service choreography lacks channels or has redundant chan- nels, and how to automatically generate channel passing based on interaction flows of the service choreography in the case of channel absence. Concretely, we propose a sim- ple language Chorc, a channel interaction sub-language for modeling the channel passing aspect of service choreography. Based on the formal operational semantics of Chore, the algo- rithms for static checking of service choreography and gen- erating channel passing are also studied, and the complexity results of algorithms are discussed. Moreover, some illus- trated service choreography examples are presented to show how to formalize and analyze service choreography with channel passing in Chorc.