Nanjing Army Command College

Nanjing, China

Nanjing Army Command College

Nanjing, China
SEARCH FILTERS
Time filter
Source Type

Xu H.,PLA University of Science and Technology | Geng H.,PLA University of Science and Technology | Chen F.,Nanjing Army Command College | Chen X.,PLA University of Science and Technology | Qi L.,PLA University of Science and Technology
Mathematical Problems in Engineering | Year: 2017

To estimate postgrouting rock mass strength growth is important for engineering design. In this paper, using self-developed indoor pressure-grouting devices, 19 groups of test cubic blocks were made of the different water cement ratio grouting into the broken rock of three kinds of particle sizes. The shear strength parameters of each group under different conditions were tested. Then this paper presents a quantitative calculation method for predicting the strength growth of grouted broken rock. Relational equations were developed to investigate the relationship between the growth rates of uniaxial compressive strength (UCS), absolute value of uniaxial tensile strength (AUTS), internal friction angle, and cohesion for post- to pregrouting broken rock based on Mohr-Coulomb strength criterion. From previous test data, the empirical equation between the growth rate of UCS and the ratio of the initial rock mass UCS to the grout concretion UCS has been determined. The equations of the growth rates of the internal friction coefficient and UCS for grouting broken rock with rock mass rating (RMR) and its increment have been established. The calculated results are consistent with the experimental results. These observations are important for engineered design of grouting reinforcement for broken rock mass. © 2017 Hongfa Xu et al.


Li X.,Beijing Institute of Technology | Xu H.,Wuxi Institute of Technology | Lu H.,Nanjing Army Command College
Proceeding - 6th International Conference on Networked Computing and Advanced Information Management, NCM 2010 | Year: 2010

In order to enhance the resources limited wireless sensor network the volume of throughout and the transmission reliability, the paper introduce the multicast routing network code technology to the unicast routing wireless sensor network. In this foundation, the time delay and the energy expenses which will bring to the stochastic linear network code makes the improvement through the node cooperation. The simulation result indicated that, compares with the opportunity route data transmission method, the cooperation network code strategy full use space and time reusability, reduced the data transmission time delay, enhanced the wireless sensor network volume of throughout.


Wang F.,Nanjing Army Command College | Chen L.,PLA Automobile Management Institute
Proceedings of the 2nd International Conference on Intelligent Control and Information Processing, ICICIP 2011 | Year: 2011

Maneuver is one of CGF action. For making CGF successfully maneuver in complex battlefield environment, firstly, the model of battlefield environment was established in the way of the rasterization. Second, the CGF model was established according to the maneuver description, and various CGF' behaviors including planning, movement, dodge, pursuit, escape, target track and so on, were considered as keys to be studied on this base. Third, in order to do with the route planning for CGF maneuver in the battlefield, the fitness function of genetic algorithm was improved. Forth, according to the course of the maneuver, the algorithm process of CGF maneuver planning was designed and explained. On these bases, the way of CGF maneuver planning was verified through an simulation experiment of maneuver based on a scenario. Finally, the research perspective of CGF maneuver planning was directed. © 2011 IEEE.


Zhang G.,NanJing Army Command College | Li C.,NanJing Army Command College
Advances in Intelligent and Soft Computing | Year: 2011

According to the idea of Kauffman's NK model, and considering the meaning of the measurement of complexity that a system possessing, a method of how to measure the complexity of a system was built. Here, a system was divided to three parts: itself, input and output. Each part had its elements, and among all the elements of the three parts there are relations, so the matrixes can be built based on the relations, therefore, with the idea of NK model, the complexity can be calculated through the matrixes. © 2011 Springer-Verlag Berlin Heidelberg.


Zhang G.,NanJing Army Command College | Shen S.,NanJing Army Command College
ICCASM 2010 - 2010 International Conference on Computer Application and System Modeling, Proceedings | Year: 2010

Based on the complex networks theory and military theory, we analyzed the static and dynamic relations of the command entities and combat entities, and reached the forming mechanism of combat system networks; then we researched the common structure of network of combat system, which consist of reconnaissance forces, command department, attack forces and target connected together by reconnaissance network, command and control network and engagement network; we also discussed the methods of measurement of networked effects. Finally we validated the truth that the networked effects of information age combat systems are bigger than that of traditional combat systems, and gave the analysis of the causes from the structure of network of combat systems with adjacency matrix methods. © 2010 IEEE.


Bai C.-S.,NanJing Army Command College | Zhu J.,NanJing Army Command College
ICCASM 2010 - 2010 International Conference on Computer Application and System Modeling, Proceedings | Year: 2010

As one of the critical technologies of radio frequency identification system, anti-collision technology decides the speed and accuracy of reading tags. Based on analysis of the old binary search algorithm, this paper provides a new binary search algorithm with improved performance. By applying this algorithm, the reader returns to the collision point of the previous record after successfully choosing the proper tag every time, and sends the corresponding sequence number to choose the next tag, thus avoiding the process of sending the maximum sequence number to make selection among the remaining tags. As a result, the times of query needed to make selection could be reduced, and the transmmision and identification efficiency of the system improved. © 2010 IEEE.


Li X.,Nanjing Artillery Academy | Zhan H.,Nanjing Artillery Academy | You K.,Nanjing Artillery Academy | Cheng Y.,Nanjing Army Command College
Proceedings - 2011 International Conference of Information Technology, Computer Engineering and Management Sciences, ICM 2011 | Year: 2011

In order to construct optimal fire assignment mechanism and improve artillery combat ability, artillery fire striking system formation and its fire assignment target model are established and analyzed, using genetic algorithm (GA) to study fire optimal assignment, dynamical arrangement and combination of various cannon, rocket launcher, anti-tank missile and ground to ground campaigmn tactics missile units. By fire assignment GA analysis and a combat test simulation, artillery fire application mode is more accurate and reliable, and its whoe operational efficiency are improved greatly. This research can provide good decision-making for constructing network-centric warfare joint fire striking system design. © 2011 IEEE.


Du Z.,Nanjing Army Command College | Chen C.,National University of Defense Technology | Kong D.,National University of Defense Technology
Military Operations Research | Year: 2014

The development of a course of action (COA) is a key step in military planning. Literature on COA development only presents unilateral actions of friendly forces. Considering the antagonism of war, we propose models that contain actions of both the friendly force and the enemy based on multistage games. The influence net is used to analyze the uncertain relationships between actions and battlefield situations. Models of multistage games with complete and incomplete information are set up separately to handle different conditions. Numerical examples illustrate the models and solutions, which show that the developed COA is suitable for antagonistic situations.


Huang J.-M.,Nanjing Army Command College | Gao D.-P.,Nanjing Army Command College
Xitong Fangzhen Xuebao / Journal of System Simulation | Year: 2012

Battle is taking on typical complicated and nonlinear characteristics with the more and more profound application of information technology in military field. The System Dynamics model of the battle in information age based on OODA loop was brought out according to the theory and method of System Dynamics and the process of the battle was simulated. The model reflects better the nature of battle in information age. Result of the simulation will provide the commander with the quantitative theoretical support and policy orientation needed to organize, command and win the war in information condition.


Ouyang Z.,National University of Defense Technology | Gao Y.,National University of Defense Technology | Zhao Z.,Army Unit 61886 | Wang T.,Nanjing Army Command College
Proceedings - 2011 8th International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2011 | Year: 2011

Data streams mining has become a novel research topic of growing interest in knowledge discovery. Because of the high speed and huge size of data set in data streams, the traditional classification technologies are no longer applicable. In recent years a great deal of research has been done on this problem, most intends to efficiently solve the data streams mining problem with concept drift. This paper presents the state-of-the-art in this field with growing vitality and introduces the methods for detecting concept drift in data stream, then gives a critical summary of existing approaches to the problem, including Stagger, FLORA, MetaL(B), MetaL(IB), CD3, CD4, CD5, OLIN, CVFDT and different ensemble classifiers. At last, this paper explores the challenges and future work in this field. © 2011 IEEE.

Loading Nanjing Army Command College collaborators
Loading Nanjing Army Command College collaborators