Theory and techniques of data mining in CGF behavior modeling

For the large quantity of data,rules and models generated in the course of computer generated forces (CGFs) behavior modeling,the common analytical methods are statistical methods based on the tactical rules,tactical doctrine and empirical knowledge.However,from the viewpoint of data mining,we can find many of these analytical methods are also each-and-every different data mining methods.In this paper,we survey the data mining theory and techniques that have appeared in the course of CGF behavior modeling f...     

校园网网络事件源定位技术研究

为了解决在校园网内部分网络安全事件和故障事件中只能确认攻击和事故的发生,而无法确定攻击和事故的源头这一问题.文章提出一种三步骤的校园网内网网络事件源定位模型.该模型将神经网络和证据理论相结合应用于攻击源定位.提高了校园网内网攻击定位的效率和准确性.     

Measuring universal intelligence: Towards an anytime intelligence test

In this paper, we develop the idea of a universal anytime intelligence test. The meaning of the terms “universal” and “anytime” is manifold here: the test should be able to measure the intelligence of any biological or artificial system that exists at this time or in the future. It should also be able to evaluate both inept and brilliant systems (any intelligence level) as well as very slow to very fast systems (any time scale). Also, the test may be interrupted at any time, producing an approximation to the intelligence score, in such a way that the more time is left for the test, the better the assessment will be. In order to do this, our test proposal is based on previous works on the measurement of machine intelligence based on Kolmogorov complexity and universal distributions, which were developed in the late 1990s (C-tests and compression-enhanced Turing tests). It is also based on the more recent idea of measuring intelligence through dynamic/interactive tests held against a universal distribution of environments. We discuss some of these tests and highlight their limitations since we want to construct a test that is both general and practical. Consequently, we introduce many new ideas that develop early “compression tests” and the more recent definition of “universal intelligence” in order to design new “universal intelligence tests”, where a feasible implementation has been a design requirement. One of these tests is the “anytime intelligence test”, which adapts to the examinee's level of intelligence in order to obtain an intelligence score within a limited time.     

Robust solutions to Stackelberg games: Addressing bounded rationality and limited observations in human cognition

How do we build algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human interaction, such as oligopolistic markets and security domains. In Stackelberg games, one player, the leader, commits to a strategy and the follower makes her decision with knowledge of the leader's commitment. Existing algorithms for Stackelberg games efficiently find optimal solutions (leader strategy), but they critically assume that the follower plays optimally. Unfortunately, in many applications, agents face human followers (adversaries) who — because of their bounded rationality and limited observation of the leader strategy — may deviate from their expected optimal response. In other words, human adversaries' decisions are biased due to their bounded rationality and limited observations. Not taking into account these likely deviations when dealing with human adversaries may cause an unacceptable degradation in the leader's reward, particularly in security applications where these algorithms have seen deployment. The objective of this paper therefore is to investigate how to build algorithms for agent interactions with human adversaries.To address this crucial problem, this paper introduces a new mixed-integer linear program (MILP) for Stackelberg games to consider human adversaries, incorporating: (i) novel anchoring theories on human perception of probability distributions and (ii) robustness approaches for MILPs to address human imprecision. Since this new approach considers human adversaries, traditional proofs of correctness or optimality are insufficient; instead, it is necessary to rely on empirical validation. To that end, this paper considers four settings based on real deployed security systems at Los Angeles International Airport (Pita et al., 2008 [35]), and compares 6 different approaches (three based on our new approach and three previous approaches), in 4 different observability conditions, involving 218 human subjects playing 2960 games in total. The final conclusion is that a model which incorporates both the ideas of robustness and anchoring achieves statistically significant higher rewards and also maintains equivalent or faster solution speeds compared to existing approaches.     

Stability analysis for multi-agent systems using the incidence matrix: Quantized communication and formation control

The spectral properties of the incidence matrix of the communication graph are exploited to provide solutions to two multi-agent control problems. In particular, we consider the problem of state agreement with quantized communication and the problem of distance-based formation control. In both cases, stabilizing control laws are provided when the communication graph is a tree. It is shown how the relation between tree graphs and the null space of the corresponding incidence matrix encode fundamental properties for these two multi-agent control problems.     

Forced consensus in networks of double integrator systems with delayed input

This communique presents forced second-order consensus protocols with communication time-delays for the network of agents with double integrator dynamics and gives a measure of the robustness of the protocols to the communication time-delays. By employing a frequency domain method, it is proven that the forced consensus is achieved asymptotically for appropriate time-delay if the network is connected. Particularly, the maximum fixed time-delay that can be tolerated by the network is found. The forced consensus protocols are distributed in the sense that each agent only needs information from its neighboring agents, which reduces the complexity of connections between agents significantly. Numerical simulation results are provided to demonstrate the effectiveness and the sharpness of the theoretical results.     

Mass function derivation and combination in multivariate data spaces

In this paper, we consider the problem of how to derive mass functions systematically from data samples. We also consider the ensuing problem of how to combine different mass functions derived in this way. We show that a mass function can be efficiently and systematically derived from multivariate data. We also demonstrate that combining mass functions obtained in this manner can be done easily. The way of deriving and combining mass functions is illustrated with a simple example.     

D-S算法在粮情监控信息融合系统中的应用

本文通过多传感器对影响储藏粮食因子的检测,利用D-S融合算法,得到较为科学、合理的储藏粮食影响因素的判断,为在储藏粮食过程中采取适当的措施提供了强有力的依据,为进一步评估储粮品质打下基础。     

基于OSPF协议测试方法研究与应用

该论文介绍了OSPF协议的背景;对软件测试理论和软件测试方法进行研究;将两者相结合得出常见的测试方法,并且在此基础上总结了自己的一套测试方法。这些测试方法可以对支持OSPF协议的不同厂商的路由器进行针对性测试,从而判断路由器的OSPF协议是否正确。最后举例说明校园网OSPF协议的应用。     

Organizational Norm Congruency and Interpersonal Familiarity in E‐Mail: Examining Messages From Two Different Status Perspectives

Relying on SIDE theory, this 2 × 2 experimental design tested the effects of adherence to organizational norms and interpersonal familiarity in e‐mail messages from both superior and subordinate perspectives. Results reveal that using norm‐congruent e‐mail messages account for over 50% of the variance in both superior and subordinate attitudes toward the message and between 30% and 56% of the variance in perceptions of source credibility. Data from the superiors indicate that norm congruent e‐mail messages account for 14.4% of the variance in message compliance. Results from subordinates reveal an interaction effect that is consistent with SIDE‐based predictions. Subordinates believe superiors are most likely to comply with e‐mail requests from unfamiliar subordinates that are crafted in a manner congruent with organizational norms.