Network-based structure optimization method of the anti-aircraft system

The anti-aircraft system plays an irreplaceable role in modern combat. An anti-aircraft system consists of various types of functional entities interacting to destroy the hostile aircraft moving in high speed. The connecting structure of combat entities in it is of great importance for supporting the normal process of the system. In this paper, we explore the optimizing strategy of the structure of the anti-aircraft network by establishing extra communication channels between the combat entities.Firstly, the thought of combat network model(CNM) is borrowed to model the anti-aircraft system as a heterogeneous network. Secondly, the optimization objectives are determined as the survivability and the accuracy of the system. To specify these objectives, the information chain and accuracy chain are constructed based on CNM. The causal strength(CAST) logic and influence network(IN) are introduced to illustrate the establishment of the accuracy chain. Thirdly, the optimization constraints are discussed and set in three aspects: time, connection feasibility and budget. The time constraint network(TCN) is introduced to construct the timing chain and help to detect the timing consistency. Then, the process of the multi-objective optimization of the structure of the anti-aircraft system is designed.Finally, a simulation is conducted to prove the effectiveness and feasibility of the proposed method. Non-dominated sorting based genetic algorithm-Ⅱ(NSGA2) is used to solve the multiobjective optimization problem and two other algorithms including non-dominated sorting based genetic algorithm-Ⅲ(NSGA3)and strength Pareto evolutionary algorithm-Ⅱ(SPEA2) are employed as comparisons. The deciders and system builders can make the anti-aircraft system improved in the survivability and accuracy in the combat reality.

AUTOMATIC APPROACH TO PRODUCT CONCEPTUAL DESIGN BASED ON CONSTRAINT NETWORK

Product design is considered as the constraint satisfaction problem (CSP),and a new design approach basedon constraint network is proposed and applied to make designautomatic partially. By means of constraint extraction, constraint network construction andoperation, constraint chains are acquired, and then the conceptual design scheme can be got bydecoding the information stored in the design constraint chains, which provides a novelty method formechanical product design automation. Shearing mechanism of shearing machine has been designed bythis way.

An Intelligent Response Surface Methodology for Modeling of Domain Level Constraints

An effective modeling method of domain level constraints in the constraint network for concurrent engineering (CE) was developed. The domain level constraints were analyzed and the framework of modeling of domain level constraints based on simulation and approximate technology was given. An intelligent response surface methodology (IRSM) was proposed, in which artificial intelligence technologies are introduced into the optimization process. The design of crank and connecting rod in the V6 engine as example was given to show the validity of the modeling method.

V2V Energy Trading Considering User Satisfaction under Low-Carbon Objectives via Bayesian Game

In response to the additional load impact caused by the integration of electric vehicles (EVs) into the grid or microgrids (MGs), as well as the issue of low responsiveness of EV users during vehicle-to-vehicle (V2V) power exchange processes, this paper explores a multi-party energy trading model considering user responsiveness under low carbon goals. The model takes into account the stochastic charging and discharging characteristics of EVs, user satisfaction, and energy exchange costs, and formulates utility functions for participating entities. This transforms the competition in multi-party energy trading into a Bayesian game problem, which is subsequently resolved. Furthermore, this paper primarily employs sensitivity analysis to evaluate the impact of multi-party energy trading on user responsiveness and green energy utilization, with the aim of promoting incentives in the electricity trading market and aligning with low-carbon requirements. Finally, through case simulations, the effectiveness of this model for the considered scenarios is demonstrated.

Research on Key Techniques of Collaborative Design System

The development of product is a complex process. Collaboration is necessary to this process to support multi-function teams’ participation in this process at the same time. Effective task decomposition is the prerequisite of collaborative design and constraint network was used to express the relationship among design participants. In order to make the coupling collaborative design go smoothly, a constraint satisfaction model based on dynamic constraint is put forward. An integrated-based conflict resolution model is advanced to resolve the complex conflict during the process of collaborative design.

PARAMETER COORDINATION AND ROBUST OPTIMIZATION FOR MULTIDISCIPLINARY DESIGN

A new parameter coordination and robust optimization approach for multidisciplinary design is presented. Firstly, the constraints network model is established to support engineering change, coordination and optimization. In this model, interval boxes are adopted to describe the uncertainty of design parameters quantitatively to enhance the design robustness. Secondly, the parameter coordination method is presented to solve the constraints network model, monitor the potential conflicts due to engineering changes, and obtain the consistency solution space corresponding to the given product specifications. Finally, the robust parameter optimization model is established, and genetic arithmetic is used to obtain the robust optimization parameter. An example of bogie design is analyzed to show the scheme to be effective.

Flexibility Analysis of Bacillus thuringiensis Cry1Aa

Objective To investigate the flexibility and mobility of the Bacillus thuringiensis toxin Cry1 Aa. Methods The graph theory-based program Constraint Network Analysis and normal mode-based program NMsim were used to analyze the global and local flexibility indices as well as the fluctuation of individual residues in detail. Results The decrease in Cry1 Aa network rigidity with the increase of temperature was evident. Two phase transition points in which the Cry1 Aa structure lost rigidity during the thermal simulation were identified. Two rigid clusters were found in domains I and II. Weak spots were found in C-terminal domain III. Several flexible regions were found in all three domains; the largest residue fluctuation was present in the apical loop2 of domain II. Conclusion Although several flexible regions could be found in all the three domains, the most flexible regions were in the apical loops of domain II.

Bi-level Optimal Planning of Voltage Regulator in Distribution Systems Considering Maximization of Incentive-based Photovoltaic Energy Integration

This paper focuses on optimal voltage regulator(VR)planning to maximize the photovoltaic(PV)energy integration in distribution grids.To describe the amount of dynamic PV energy that can be integrated into the power system,the concept of PV accommodation capability(PVAC)is introduced and modeled with optimization.Our proposed planning model is formulated as a Benders decomposition based bi-level stochastic optimization problem.In the upper-level problem,VR planning decisions and PVAC are determined via mixed integer linear programming(MILP)before considering uncertainty.Then in the lower-level problem,the feasibility of first-level results is checked by critical network constraints(e.g.voltage magnitude constraints and line capacity constraints)under uncertainties considered by time-varying loads and PV generations.In this paper,these uncertainties are represented in the form of operational scenarios,which are generated by the Gaussian copula theory and reduced by a well-studied backward-reduction algorithm.The modified IEEE 33-node distribution grid is utilized to verify the effectiveness of the proposed model.The results demonstrate that a PV energy integration can be significantly enhanced after optimal voltage regulator planning.

The Interaction between Control and Computing Theories:New Approaches

Day by day, networked control system（NCS） methods have been promoted for distributed closed-loop control systems.Interestingly, the integration of control and computing theories enhanced the development of networked control systems through remote control for wide applications employing the internet. Two further directions to networked control technology are LeaderFollower systems and model predictive control systems. Cloud control system is looked at an extension of networked control systems（NCS） using internet of things（IOT） methodologies. In this paper, a comprehensive literature survey of the new technology of control systems application performed on cloud computing is presented.

On the Arc Consistency Problem

In this paper, we propose a new arc consistency algorithm, AC-8,which requires less computation time and space than AC-6 and AC-7. The main ideaof the optimization is the divide-and-conquer strategy, thereby decomposing an arcconsistency problem into a series of smaller ones and trying to solve them in sequence.In this way, not only the space complexity but also the time complexity can be reduced. The reason for this is that due to the ahead of time performed inconsistencypropagation (in the sense that some of them are executed before the entire inconsis-tency checking has been finished), each constraint subnetwork will be searched with agradually shrunk domain. In addition, the technique of AC-6 can be integrated intoour algorithm, leading to a further decrease in computational complexity.

Exploring the Constrained Maximum Edge-weight Connected Graph Problem

Given an edge weighted graph, the maximum edge-weight connected graph （MECG） is a connected subgraph with a given number of edges and the maximal weight sum. Here we study a special case, i.e. the Constrained Maximum Edge-Weight Connected Graph problem （CMECG）, which is an MECG whose candidate subgraphs must include a given set of k edges, then also called the k-CMECG. We formulate the k-CMECG into an integer linear programming model based on the network flow problem. The k-CMECG is proved to be NP-hard. For the special case 1-CMECG, we propose an exact algorithm and a heuristic algorithm respectively. We also propose a heuristic algorithm for the k-CMECG problem. Some simulations have been done to analyze the quality of these algorithms. Moreover, we show that the algorithm for 1-CMECG problem can lead to the solution of the general MECG problem.