A framework of force of information influence and application for C4KISR system

The subversive nature of information war lies not only in the information itself, but also in the circulation and application of information. It has always been a challenge to quantitatively analyze the function and effect of information flow through command, control, communications, computer, kill, intelligence,surveillance, reconnaissance (C4KISR) system. In this work, we propose a framework of force of information influence and the methods for calculating the force of information influence between C4KISR nodes of sensing, intelligence processing,decision making and fire attack. Specifically, the basic concept of force of information influence between nodes in C4KISR system is formally proposed and its mathematical definition is provided. Then, based on the information entropy theory, the model of force of information influence between C4KISR system nodes is constructed. Finally, the simulation experiments have been performed under an air defense and attack scenario. The experimental results show that, with the proposed force of information influence framework, we can effectively evaluate the contribution of information circulation through different C4KISR system nodes to the corresponding tasks. Our framework of force of information influence can also serve as an effective tool for the design and dynamic reconfiguration of C4KISR system architecture.

A Novel High-Efficiency Transaction Verification Scheme for Blockchain Systems

Blockchain can realize the reliable storage of a large amount of data that is chronologically related and verifiable within the system.This technology has been widely used and has developed rapidly in big data systems across various fields.An increasing number of users are participating in application systems that use blockchain as their underlying architecture.As the number of transactions and the capital involved in blockchain grow,ensuring information security becomes imperative.Addressing the verification of transactional information security and privacy has emerged as a critical challenge.Blockchain-based verification methods can effectively eliminate the need for centralized third-party organizations.However,the efficiency of nodes in storing and verifying blockchain data faces unprecedented challenges.To address this issue,this paper introduces an efficient verification scheme for transaction security.Initially,it presents a node evaluation module to estimate the activity level of user nodes participating in transactions,accompanied by a probabilistic analysis for all transactions.Subsequently,this paper optimizes the conventional transaction organization form,introduces a heterogeneous Merkle tree storage structure,and designs algorithms for constructing these heterogeneous trees.Theoretical analyses and simulation experiments conclusively demonstrate the superior performance of this scheme.When verifying the same number of transactions,the heterogeneous Merkle tree transmits less data and is more efficient than traditional methods.The findings indicate that the heterogeneous Merkle tree structure is suitable for various blockchain applications,including the Internet of Things.This scheme can markedly enhance the efficiency of information verification and bolster the security of distributed systems.

Modeling the dynamic alignment of business and information systems via the lens of human-centered architecture evolution

The complexity of business and information systems(IS)alignment is a growing concern for researchers and practitioners alike.The extant research on alignment architecture fails to consider the human viewpoint,which makes it difficult to embrace emergent complexity.This paper contributes to the extant literature in the following ways.First,we combine an enterprise architecture(EA)framework with a human viewpoint to address alignment issues in the architecture design phase;second,we describe a dynamic alignment model by developing a humancentered meta-model that explains first-and second-order changes and their effects on alignment evolution.This paper provides better support for the theoretical research and the practical application of dynamic alignment.

Multi-satellite observation integrated scheduling method oriented to emergency tasks and common tasks

Satellite observation scheduling plays a significant role in improving the efficiency of satellite observation systems.Although many scheduling algorithms have been proposed,emergency tasks,characterized as importance and urgency（e.g.,observation tasks orienting to the earthquake area and military conflict area）,have not been taken into account yet.Therefore,it is crucial to investigate the satellite integrated scheduling methods,which focus on meeting the requirements of emergency tasks while maximizing the profit of common tasks.Firstly,a pretreatment approach is proposed,which eliminates conflicts among emergency tasks and allocates all tasks with a potential time-window to related orbits of satellites.Secondly,a mathematical model and an acyclic directed graph model are constructed.Thirdly,a hybrid ant colony optimization method mixed with iteration local search（ACO-ILS） is established to solve the problem.Moreover,to guarantee all solutions satisfying the emergency task requirement constraints,a constraint repair method is presented.Extensive experimental simulations show that the proposed integrated scheduling method is superior to two-phased scheduling methods,the performance of ACO-ILS is greatly improved in both evolution speed and solution quality by iteration local search,and ACO-ILS outperforms both genetic algorithm and simulated annealing algorithm.

Weapon configuration, allocation and route planning with time windows for multiple unmanned combat air vehicles

Unmanned combat air vehicles(UCAVs) mission planning is a fairly complicated global optimum problem. Military attack missions often employ a fleet of UCAVs equipped with weapons to attack a set of known targets. A UCAV can carry different weapons to accomplish different combat missions. Choice of different weapons will have different effects on the final combat effectiveness. This work presents a mixed integer programming model for simultaneous weapon configuration and route planning of UCAVs, which solves the problem optimally using the IBM ILOG CPLEX optimizer for simple missions. This paper develops a heuristic algorithm to handle the medium-scale and large-scale problems. The experiments demonstrate the performance of the heuristic algorithm in solving the medium scale and large scale problems. Moreover, we give suggestions on how to select the most appropriate algorithm to solve different scale problems.

Modeling and solution based on stochastic games for development of COA under uncertainty

Developing a course of action(COA) is a key step in military planning. In most extant studies on the COA development,only the unilateral actions of friendly forces are considered. Based on stochastic games, we propose models that could deal with the complexities and uncertainties of wars. By analyzing the equilibrium state of both opponent sides, outcomes preferable to one side could be achieved by adopting the methods obtained from the proposed models. This research could help decision makers take the right COA in a state of uncertainty.

Adaptive evolvement of information age C^4ISR structure

Command, control, communication, computing, intel- ligence, surveillance and reconnaissance （C^4ISR） in information age is a complex system whose structure always changes ac- tively or passively during the warfare. Therefore, it is important to optimize the structure, especially in ambiguous and quick-tempo modern warfare. This paper proposes an adaptive evolvement mechanism for the C^4ISR structure to survive the changeable warfare. Firstly, the information age C^4ISR structure is defined and modeled based on the complex network theory. Secondly, taking the observe, orient, decide and act （OODA） model into consideration, four kinds of loops in the C^4ISR structure are pro- posed and their coefficient of networked effects （CNE） is further defined. Then, the adaptive evolvement mechanisms of the four kinds of loops are presented respectively. Finally, taking the joint air-defense C^4ISR as an example, simulation experiments are im- plemented, which validate the evolvement mechanism and show that the information age C41SR structure has some characteristics of small-world network and scale-free network.

Detection of artificial pornographic pictures based on multiple features and tree mode

It is easy for teenagers to view pornographic pictures on social networks. Many researchers have studied the detection of real pornographic pictures, but there are few studies on those that are artificial. In this work, we studied how to detect artificial pornographic pictures, especially when they are on social networks. The whole detection process can be divided into two stages： feature selection and picture detection. In the feature selection stage, seven types of features that favour picture detection were selected. In the picture detection stage, three steps were included. 1） In order to alleviate the imbalance in the number of artificial pornographic pictures and normal ones, the training dataset of artificial pornographic pictures was expanded. Therefore, the features which were extracted from the training dataset can also be expanded too. 2） In order to reduce the time of feature extraction, a fast method which extracted features based on the proportionally scaled picture rather than the original one was proposed. 3） Three tree models were compared and a gradient boost decision tree （GBDT） was selected for the final picture detection. Three sets of experimental results show that the proposed method can achieve better recognition precision and drastically reduce the time cost of the method.

Interactive multigraph visualization and exploration with a two-phase strategy

While it is very reasonable to use a multigraph consisting of multiple edges between vertices to represent various relationships, the multigraph has not drawn much attention in research. To visualize such a multigraph, a clear layout representing a global structure is of great importance, and interactive visual analysis which allows the multiple edges to be adjusted in appropriate ways for detailed presentation is also essential. A novel interactive two-phase approach to visualizing and exploring multigraph is proposed. The approach consists of two phases： the first phase improves the previous popular works on force-directed methods to produce a brief drawing for the aggregation graph of the input multigraph, while the second phase proposes two interactive strategies, the magnifier model and the thematic-oriented subgraph model. The former highlights the internal details of an aggregation edge which is selected interactively by user, and draws the details in a magnifying view by cubic Bezier curves; the latter highlights only the thematic subgraph consisting of the selected multiple edges that the user concerns. The efficiency of the proposed approach is demonstrated with a real-world multigraph dataset and how it is used effectively is discussed for various potential applications.

Functionality evaluation of system of systems architecture based on extended influence diagrams

System of systems architecture（SoSA） has received increasing emphasis by scholars since Zachman ignited its flame in 1987. Given its complexity and abstractness, it is critical to validate and evaluate SoSA to ensure requirements have been met.Multiple qualities are discussed in the literature of SoSA evaluation, while research on functionality is scarce. In order to assess SoSA functionality, an extended influence diagram（EID） is developed in this paper. Meanwhile, a simulation method is proposed to elicit the conditional probabilities in EID through designing and executing SoSA. An illustrative anti-missile architecture case is introduced for EID development, architecture design, and simulation.

Dynamic Evaluation Strategies for Multiple Aircrafts Formation Using Collision and Matching Probabilities

Configuration evaluation is a key technology to be considered in the design of multiple aircrafts formation(MAF)configurations with high dynamic properties in engineering applications.This paper deduces the relationship between relative velocity,dynamic safety distance and dynamic adjacent distance of formation members,then divides the formation states into collision-state and matching-state.Meanwhile,probability models are constructed based on the binary normal distribution of relative distance and relative velocity.Moreover,configuration evaluation strategies are studied by quantitatively analyzing the denseness and the basic capabilities according to the MAF collision-state probability and the MAF matching-state probability,respectively.The scale of MAF is grouped into 5 levels,and previous lattice-type structures are extended into four degrees by taking the relative velocities into account to instruct the configuration design under complex task conditions.Finally,hardware-in-loop(HIL)simulation and outfield flight test results are presented to verify the feasibility of these evaluation strategies.

A Green Paradigm for Internet of Things: Ambient Backscatter Communications

Internet of Things (IoT) has attracted extensive interest from both academia and industries, and is recognized as an ultimate infrastructure to connect everything at anytime and anywhere. The implementation of IoT generally faces the challenges from energy constraint and implementation cost. In this paper, we will introduce a new green communication paradigm, the ambient backscatter (AmBC), that could utilize the environmental wireless signals for both powering a tiny-cost device and backscattering the information symbols. Specifically, we will present the basic principles of AmBC, analyze its features and advantages, suggest its open problems, and predict its potential applications for our future IoT.

Identifying Influence of Nodes in Complex Networks with Coreness Centrality:Decreasing the Impact of Densely Local Connection

Ranking nodes by their spreading ability has been a fundamental issue related to many real applications, such as information and disease control. In the well-known coreness centrality measure, nodes＇ influence is ranked only by summing all neighbors＇ k-shell values while the effect of the topological connections among them on the nodes＇ spreading ability are ignored. In this work, we propose an improved coreness measure by decreasing the impact of densely local connections. Comparing the results from a series of susceptible-infected-recovered simulations on real networks, we show that our improved method can rank the nodes＇ spreading ability more accurately than other ranking measures such as k-shell, distance based method, mixed degree decomposition and coreness centrality method.

Cooperative transmission in delay tolerant network

The delay tolerant network(DTN) is an emerging concept, which is used to describe the network, where the communication link may disrupt frequently. To cope with this problem, the DTN uses the store-carry-forward(SCF) transmission mode. With this policy, the messages in the DTN are transmitted based on the nodes' cooperation. However, the nodes may be selfish, so the source has to pay certain rewards for others to get their help. This paper studies the optimal incentive policy to maximize the source's final utility. First, it models the message spreading process as several ordinary differential equations(ODEs) based on the meanfield approximation. Then, it mathematically gets the optimal policy and explores the structure of the policy. Finally, it checks the accuracy of the ODEs model and shows the advantages of the optimal policy through simulation and theoretical results respectively.

Route strategy of satellite network in GNSS based on topology evolution law

As each type of satellite network has different link features, its data transmission must be designed based on its link features to improve the efficiency of data transferring. The transmission of navigation integrated services information （NISI） in a global navigation satellite system （GNSS） with inter-satellite links （ISLs） is studied by taking the real situation of inter-satellite communication links into account. An on-demand computing and buffering centralized route strategy is proposed based on dynamic grouping and the topology evolution law of the GNSS network within which the satellite nodes are operated in the manner of dynamic grouping. Dynamic grouping is based on satellites spatial relationships and the group role of the satellite node changes by turns due to its spatial relationships. The route strategy provides significant advantages of high efficiency, low complexity, and flexi- ble configuration, by which the established GNSS can possess the features and capabilities of feasible deployment, efficient transmission, convenient management, structural invulnerability and flexible expansion.

Resource allocation approach to associate business-IT alignment to enterprise architecture design

Enterprise architecture(EA) development is always a superior way to address business-IT alignment(BITA) issue.However, most EA design frameworks are inadequate to allocate IT resources, which is an important metric of BITA maturity. Under this situation, the idea of IT resource allocation is combined with the EA design process, in order to extend prior EA research on BITA and to demonstrate EA's capability of implementing IT governance. As an effective resource allocation method, portfolio decision analysis(PDA) is used to align business functions of business architecture and applications of system architecture. Furthermore, this paper exhibits an illustrative case with the proposed framework.

Trajectory shaping guidance law based on virtual angle with terminal constraints

A trajectory shaping guidance law based on virtua angle （TSGLBVA） is proposed for a re-entry vehicle with the constraints of terminal impact angles and their time derivatives. In the view of differential properties of the maneuvering trajectory, a virtual angle and a virtual radius are defined. Also, the shaping trajectory of the vehicle is established by the polynomials of the virtual angle. Then, four optimized parameters are selected according to the theorem of parameters transformation presented in this paper. Finally, a convergent variant of the Nelder-Mead algorithm is adopted to obtain the reference trajectory, and a trajectory feedback tracking guidance law is designed. The simulation results demonstrate that the TSGLBVA ensures the re-entry vehicle to impact a target precisely from a specified direction with smal terminal load factor command, as well as to obtain a maximum or constrained terminal velocity according to various requirements.

Task scheduling for multi-electro-magnetic detection satellite with a combined algorithm

Task scheduling for electro-magnetic detection satellite is a typical combinatorial optimization problem. The count of constraints that need to be taken into account is of large scale. An algorithm combined integer programming with constraint programming is presented. This algorithm is deployed in this problem through two steps. The first step is to decompose the original problem into master and sub-problem using the logic-based Benders decomposition; then a circus combines master and sub-problem solving process together, and the connection between them is general Benders cut. This hybrid algorithm is tested by a set of derived experiments. The result is compared with corresponding outcomes generated by the strength Pareto evolutionary algorithm and the pure constraint programming solver GECODE, which is an open source software. These tests and comparisons yield promising effect.

A coevolutionary framework of business-IT alignment via the lens of enterprise architecture

Due to the turbulent external business environment, the complexity of internal relations of the organization and the emergence of subversive IT roles, the business-IT alignment(BITA)has become increasingly difficult. The unsuccessful realization of BITA will lead to the waste of organizational resources, the reduction of return on investment and eventually the loss of competitive advantage. In recent years, coevolution has received widespread attention due to its ability to describe the dynamic relationship between IT and business. Multiple principles such as quickening learning action loops and adopt suitable organizing principles for achieving business and IT coevolution(BITC) are obtained. However, the continuous BITC is still hard to be achieved because of the lack of complete BITC management. This paper focuses on the management process of the BITC and how to perform it gradually. A coevolution framework combines the enterprise architecture(EA) approach with the coevolution analysis is proposed, which contains the design of EA, the sensing and governance of the misalignment and the procedure of the EA misalignment prevention.The steps for the governance and prevention of misalignment are discussed in particular. Through comparison with the principles,characteristics and methods of coevolution in the literature, the proposed framework is evaluated. The results show that the proposed framework is effective for BITC implementation.

A Satellite Communication System Transmission Scheme Based on Probabilistic Shaping

In this paper, A transmission scheme based on probabilistic shaping applied to satellite communication systems is proposed. 16QAM is taken as an example to establish a 1GBaud ROF experimental system working in Ka-band. The experiment results show that the PS-16QAM signal has better performance in terms of bit error rate than the uniform 16QAM, and its performance is close to the uniform 8QAM scheme.