A mathematical model to determine the optimal production lot size for a deteriorating production system under an extended product inspection policy is developed. The last-K product inspection policy is considered so that the nonconforming items can be reduced, under which the last K products in a production lot are inspected and the nonconforming items from those inspected are reworked. Consider that the products produced towards the end of a production lot are more likely to be nonconforming, is proposed an extended product inspection policy for a deteriorating production system. That is, in a production lot, product inspections are performed among the middle K1 items and after inspections, all of the last K2 products are directly reworked without inspections. Our objective here is the joint optimization of the production lot size and the corresponding extended inspection policy such that the expected total cost per unit time is minimized. Since there is no closed form expression for our optimal policy, the existence for the optimal production inspection policy and an upper bound for the optimal lot size are obtained. Furthermore, an efficient solution procedure is provided to search for the optimal policy. Finally, numerical examples are given to illustrate the proposed model and indicate that the expected total cost per unit time of our product inspection model is less than that of the last-K inspection policy.
In the design problem of low earth orbit (LEO) reconnaissance satellite constellation, optimization of coverage performance is the design goal in most current methods. However, in the using process, the user only concerns with the detection capabilities rather than coverage performance. To establish the relationship between these two aspects, the reconnaissance processes of normal stochastic targets are considered and the mathematic models of detection processes are built. The indicators of coverage performance are used to evaluate the detection probability and expectation of detection time delay, which are important factors in reconnaissance constellation estimation viewed from military intelligence discipline. The conclusions confirmed by the final simulation will be useful in LEO reconnaissance constellation design, optimization and evaluation.
The problem of scheduling radar dwells in multifunction phased array radar systems is addressed. A novel dwell scheduling algorithm is proposed. The whole scheduling process is based on an online pulse interleaving technique. It takes the system timing and energy constraints into account. In order to adapt the dynamic task load, the algorithm considers both the priorities and deadlines of tasks. The simulation results demonstrate that compared with the conventional adaptive dwell scheduling algorithm, the proposed one can improve the task drop rate and system resource utility effectively.
In a cloud-native era, the Kubernetes-based workflow engine enables workflow containerized execution through the inherent abilities of Kubernetes. However, when encountering continuous workflow requests and unexpected resource request spikes, the engine is limited to the current workflow load information for resource allocation, which lacks the agility and predictability of resource allocation, resulting in over and under-provisioning resources. This mechanism seriously hinders workflow execution efficiency and leads to high resource waste. To overcome these drawbacks, we propose an adaptive resource allocation scheme named adaptive resource allocation scheme (ARAS) for the Kubernetes-based workflow engines. Considering potential future workflow task requests within the current task pod’s lifecycle, the ARAS uses a resource scaling strategy to allocate resources in response to high-concurrency workflow scenarios. The ARAS offers resource discovery, resource evaluation, and allocation functionalities and serves as a key component for our tailored workflow engine (KubeAdaptor). By integrating the ARAS into KubeAdaptor for workflow containerized execution, we demonstrate the practical abilities of KubeAdaptor and the advantages of our ARAS. Compared with the baseline algorithm, experimental evaluation under three distinct workflow arrival patterns shows that ARAS gains time-saving of 9.8% to 40.92% in the average total duration of all workflows, time-saving of 26.4% to 79.86% in the average duration of individual workflow, and an increase of 1% to 16% in centrol processing unit (CPU) and memory resource usage rate.
Intelligent wars can take place not only in the physical domain and information domain but also in the cognitive domain. The cognitive domain will become the key domain to win in the future intelligent war. A Lanchester equation considering cognitive domain is proposed to fit the development tendency intelligent wars in this paper. One party is considered to obtain the exponential enhancement advantage on combat forces in combat if it can gain an advantage in the cognitive domain over the other party according to the systemic advantage function. The operational effectiveness of the cognitive domain in war is considered to consist of a series of indicators. Hesitant fuzzy sets and linguistic term sets are powerful tools when evaluating indicators, hence the indicators are scored by experts using hesitant fuzzy linguistic terms sets here. A unique hesitant fuzzy hybrid arithmetical averaging operator is used to aggregate the evaluation.
By deploying the ubiquitous and reliable coverage of low Earth orbit (LEO) satellite networks using optical inter satellite link (OISL), computation offloading services can be provided for any users without proximal servers, while the resource limitation of both computation and storage on satellites is the important factor affecting the maximum task completion time. In this paper, we study a delay-optimal multi-satellite collaborative computation offloading scheme that allows satellites to actively migrate tasks among themselves by employing the high-speed OISLs, such that tasks with long queuing delay will be served as quickly as possible by utilizing idle computation resources in the neighborhood. To satisfy the delay requirement of delay-sensitive task, we first propose a deadline-aware task scheduling scheme in which a priority model is constructed to sort the order of tasks being served based on its deadline, and then a delay-optimal collaborative offloading scheme is derived such that the tasks which cannot be completed locally can be migrated to other idle satellites. Simulation results demonstrate the effectiveness of our multi-satellite collaborative computation offloading strategy in reducing task complement time and improving resource utilization of the LEO satellite network.
Code acquisition is the kernel operation for signal synchronization in the spread-spectrum receiver. To reduce the computational complexity and latency of code acquisition, this paper proposes an efficient scheme employing sparse Fourier transform (SFT) and the relevant hardware architecture for field programmable gate array (FPGA) and application-specific integrated circuit (ASIC) implementation. Efforts are made at both the algorithmic level and the implementation level to enable merged searching of code phase and Doppler frequency without incurring massive hardware expenditure. Compared with the existing code acquisition approaches, it is shown from theoretical analysis and experimental results that the proposed design can shorten processing latency and reduce hardware complexity without degrading the acquisition probability.
In the process of performing a task, autonomous unmanned systems face the problem of scene changing, which requires the ability of real-time decision-making under dynamically changing scenes. Therefore, taking the unmanned system coordinative region control operation as an example, this paper combines knowledge representation with probabilistic decision-making and proposes a role-based Bayesian decision model for autonomous unmanned systems that integrates scene cognition and individual preferences. Firstly, according to utility value decision theory, the role-based utility value decision model is proposed to realize task coordination according to the preference of the role that individual is assigned. Then, multi-entity Bayesian network is introduced for situation assessment, by which scenes and their uncertainty related to the operation are semantically described, so that the unmanned systems can conduct situation awareness in a set of scenes with uncertainty. Finally, the effectiveness of the proposed method is verified in a virtual task scenario. This research has important reference value for realizing scene cognition, improving cooperative decision-making ability under dynamic scenes, and achieving swarm level autonomy of unmanned systems.
Rotating machinery is widely used in the industry. They are vulnerable to many kinds of damages especially for those working under tough and time-varying operation conditions. Early detection of these damages is important, otherwise, they may lead to large economic loss even a catastrophe. Many signal processing methods have been developed for fault diagnosis of the rotating machinery. Local mean decomposition (LMD) is an adaptive mode decomposition method that can decompose a complicated signal into a series of mono-components, namely product functions (PFs). In recent years, many researchers have adopted LMD in fault detection and diagnosis of rotating machines. We give a comprehensive review of LMD in fault detection and diagnosis of rotating machines. First, the LMD is described. The advantages, disadvantages and some improved LMD methods are presented. Then, a comprehensive review on applications of LMD in fault diagnosis of the rotating machinery is given. The review is divided into four parts:fault diagnosis of gears, fault diagnosis of rotors, fault diagnosis of bearings, and other LMD applications. In each of these four parts, a review is given to applications applying the LMD, improved LMD, and LMD-based combination methods, respectively. We give a summary of this review and some future potential topics at the end.
Traditional multi-band frequency selective surface (FSS) approaches are hard to achieve a perfect resonance response in a wide band due to the limit of the onset grating lobe frequency determined by the array. To solve this problem, an approach of combining elements in different period to build a hybrid array is presented. The results of series of numerical simulation show that multi-periodicity combined element FSS, which are designed using this approach, usually have much weaker grating lobes than the traditional FSS. Furthermore, their frequency response can be well predicted through the properties of their member element FSS. A prediction method for estimating the degree of expected grating lobe energy loss in designing multi-band FSS using this approach is provided.
Deep neural networks (DNNs) have achieved great success in many data processing applications. However, high computational complexity and storage cost make deep learning difficult to be used on resource-constrained devices, and it is not environmental-friendly with much power cost. In this paper, we focus on low-rank optimization for efficient deep learning techniques. In the space domain, DNNs are compressed by low rank approximation of the network parameters, which directly reduces the storage requirement with a smaller number of network parameters. In the time domain, the network parameters can be trained in a few subspaces, which enables efficient training for fast convergence. The model compression in the spatial domain is summarized into three categories as pre-train, pre-set, and compression-aware methods, respectively. With a series of integrable techniques discussed, such as sparse pruning, quantization, and entropy coding, we can ensemble them in an integration framework with lower computational complexity and storage. In addition to summary of recent technical advances, we have two findings for motivating future works. One is that the effective rank, derived from the Shannon entropy of the normalized singular values, outperforms other conventional sparse measures such as the $ \ell_1 $ norm for network compression. The other is a spatial and temporal balance for tensorized neural networks. For accelerating the training of tensorized neural networks, it is crucial to leverage redundancy for both model compression and subspace training.
Beam-hopping technology has become one of the major research hotspots for satellite communication in order to enhance their communication capacity and flexibility. However, beam hopping causes the traditional continuous time-division multiplexing signal in the forward downlink to become a burst signal, satellite terminal receivers need to solve multiple key issues such as burst signal rapid synchronization and high-performance reception. Firstly, this paper analyzes the key issues of burst communication for traffic signals in beam hopping systems, and then compares and studies typical carrier synchronization algorithms for burst signals. Secondly, combining the requirements of beam-hopping communication systems for efficient burst and low signal-to-noise ratio reception of downlink signals in forward links, a decoding assisted bidirectional variable parameter iterative carrier synchronization technique is proposed, which introduces the idea of iterative processing into carrier synchronization. Aiming at the technical characteristics of communication signal carrier synchronization, a new technical approach of bidirectional variable parameter iteration is adopted, breaking through the traditional understanding that loop structures cannot adapt to low signal-to-noise ratio burst demodulation. Finally, combining the DVB-S2X standard physical layer frame format used in high throughput satellite communication systems, the research and performance simulation are conducted. The results show that the new technology proposed in this paper can significantly shorten the carrier synchronization time of burst signals, achieve fast synchronization of low signal-to-noise ratio burst signals, and have the unique advantage of flexible and adjustable parameters.
The perception module of advanced driver assistance systems plays a vital role. Perception schemes often use a single sensor for data processing and environmental perception or adopt the information processing results of various sensors for the fusion of the detection layer. This paper proposes a multi-scale and multi-sensor data fusion strategy in the front end of perception and accomplishes a multi-sensor function disparity map generation scheme. A binocular stereo vision sensor composed of two cameras and a light deterction and ranging (LiDAR) sensor is used to jointly perceive the environment, and a multi-scale fusion scheme is employed to improve the accuracy of the disparity map. This solution not only has the advantages of dense perception of binocular stereo vision sensors but also considers the perception accuracy of LiDAR sensors. Experiments demonstrate that the multi-scale multi-sensor scheme proposed in this paper significantly improves disparity map estimation.
In real-time strategy (RTS) games, the ability of recognizing other players’ goals is important for creating artifical intelligence (AI) players. However, most current goal recognition methods do not take the player ’s deceptive behavior into account which often occurs in RTS game scenarios, resulting in poor recognition results. In order to solve this problem, this paper proposes goal recognition for deceptive agent, which is an extended goal recognition method applying the deductive reason method (from general to special) to model the deceptive agent’s behavioral strategy. First of all, the general deceptive behavior model is proposed to abstract features of deception, and then these features are applied to construct a behavior strategy that best matches the deceiver’s historical behavior data by the inverse reinforcement learning (IRL) method. Final, to interfere with the deceptive behavior implementation, we construct a game model to describe the confrontation scenario and the most effective interference measures.
Deep learning has achieved excellent results in various tasks in the field of computer vision, especially in fine-grained visual categorization. It aims to distinguish the subordinate categories of the label-level categories. Due to high intra-class variances and high inter-class similarity, the fine-grained visual categorization is extremely challenging. This paper first briefly introduces and analyzes the related public datasets. After that, some of the latest methods are reviewed. Based on the feature types, the feature processing methods, and the overall structure used in the model, we divide them into three types of methods: methods based on general convolutional neural network (CNN) and strong supervision of parts, methods based on single feature processing, and methods based on multiple feature processing. Most methods of the first type have a relatively simple structure, which is the result of the initial research. The methods of the other two types include models that have special structures and training processes, which are helpful to obtain discriminative features. We conduct a specific analysis on several methods with high accuracy on public datasets. In addition, we support that the focus of the future research is to solve the demand of existing methods for the large amount of the data and the computing power. In terms of technology, the extraction of the subtle feature information with the burgeoning vision transformer (ViT) network is also an important research direction.
This paper presents a path planning approach for rotary unmanned aerial vehicles (R-UAVs) in a known static rough terrain environment. This approach aims to find collision-free and feasible paths with minimum altitude, length and angle variable rate. First, a three-dimensional (3D) modeling method is proposed to reduce the computation burden of the dynamic models of R-UAVs. Considering the length, height and tuning angle of a path, the path planning of R-UAVs is described as a tri-objective optimization problem. Then, an improved multi-objective particle swarm optimization algorithm is developed. To render the algorithm more effective in dealing with this problem, a vibration function is introduced into the collided solutions to improve the algorithm efficiency. Meanwhile, the selection of the global best position is taken into account by the reference point method. Finally, the experimental environment is built with the help of the Google map and the 3D terrain generator World Machine. Experimental results under two different rough terrains from Guilin and Lanzhou of China demonstrate the capabilities of the proposed algorithm in finding Pareto optimal paths.
The measurement of the rolling angle of the projectile is one of the key technologies for the terminal correction projectile. To improve the resolution accuracy of the rolling angle in the laser seeker weapon system, the imaging model of the detector, calculation model of the position and the signal-to-noise ratio (SNR) model of the circuit are built to derive both the correlation between the resolution error of the rolling angle and the spot position, and the relation between the position resolution error and the SNR. Then the influence of each parameter on the SNR is analyzed at large, and the parameters of the circuit are determined. Meanwhile, the SNR and noise voltage of the circuit are calculated according to the SNR model and the decay model of the laser energy. Finally, the actual photoelectric detection circuit is built, whose SNR is measured to be up to 53 dB. It can fully meet the requirement of 0.5° for the resolution error of the rolling angle, thereby realizing the analysis of critical technology for photoelectric detection of laser seeker signals.
Combining beamlet transform with steerable filters, a new edge detection method based on line gradient is proposed. Compared with operators based on point local properties, the edge-detection results with this method achieve higher SNR and position accuracy, and are quite helpful for image registration, object identification, etc. Some edge-detection experiments on optical and SAR images that demonstrate the significant improvement over classical edge operators are also presented. Moreover, the template matching result based on edge information of optical reference image and SAR image also proves the validity of this method.
The realization of the parameter estimation of chirp signals using the fractional Fourier transform (FRFT) is based on the assumption that the sampling duration of practical observed signals would be equal to the time duration of chirp signals contained in the former. However, in many actual circumstances, this assumption seems unreasonable. On the basis of analyzing the practical signal form, this paper derives the estimation error of the existing parameter estimation method and then proposes a novel and universal parameter estimation algorithm. Furthermore, the proposed algorithm is developed which allows the estimation of the practical observed Gaussian windowed chirp signal. Simulation results show that the new algorithm works well.
Detecting the forgery parts from a double compressed image is very important and urgent work for blind authentication. A very simple and efficient method for accomplishing the task is proposed. Firstly, the probabilistic model with periodic effects in double quantization is analyzed, and the probability of quantized DCT coefficients in each block is calculated over the entire image. Secondly, the posteriori probability of each block is computed according to Bayesian theory and the results mentioned in first part. Then the mean and variance of the posteriori probability are to be used for judging whether the target block is tampered. Finally, the mathematical morphology operations are performed to reduce the false alarm probability. Experimental results show that the method can exactly locate the doctored part, and through the experiment it is also found that for detecting the tampered regions, the higher the second compression quality is, the more exact the detection efficiency is.
To address the shortcomings of single-step decision making in the existing deep reinforcement learning based unmanned aerial vehicle (UAV) real-time path planning problem, a real-time UAV path planning algorithm based on long short-term memory (RPP-LSTM) network is proposed, which combines the memory characteristics of recurrent neural network (RNN) and the deep reinforcement learning algorithm. LSTM networks are used in this algorithm as Q-value networks for the deep Q network (DQN) algorithm, which makes the decision of the Q-value network has some memory. Thanks to LSTM network, the Q-value network can use the previous environmental information and action information which effectively avoids the problem of single-step decision considering only the current environment. Besides, the algorithm proposes a hierarchical reward and punishment function for the specific problem of UAV real-time path planning, so that the UAV can more reasonably perform path planning. Simulation verification shows that compared with the traditional feed-forward neural network (FNN) based UAV autonomous path planning algorithm, the RPP-LSTM proposed in this paper can adapt to more complex environments and has significantly improved robustness and accuracy when performing UAV real-time path planning.
With the development of global position system (GPS), wireless technology and location aware services, it is possible to collect a large quantity of trajectory data. In the field of data mining for moving objects, the problem of anomaly detection is a hot topic. Based on the development of anomalous trajectory detection of moving objects, this paper introduces the classical trajectory outlier detection (TRAOD) algorithm, and then proposes a density-based trajectory outlier detection (DBTOD) algorithm, which compensates the disadvantages of the TRAOD algorithm that it is unable to detect anomalous defects when the trajectory is local and dense. The results of employing the proposed algorithm to Elk1993 and Deer1995 datasets are also presented, which show the effectiveness of the algorithm.
The unmanned aerial vehicle (UAV) swarm technology is one of the research hotspots in recent years. With the continuous improvement of autonomous intelligence of UAV, the swarm technology of UAV will become one of the main trends of UAV development in the future. This paper studies the behavior decision-making process of UAV swarm rendezvous task based on the double deep Q network (DDQN) algorithm. We design a guided reward function to effectively solve the problem of algorithm convergence caused by the sparse return problem in deep reinforcement learning (DRL) for the long period task. We also propose the concept of temporary storage area, optimizing the memory playback unit of the traditional DDQN algorithm, improving the convergence speed of the algorithm, and speeding up the training process of the algorithm. Different from traditional task environment, this paper establishes a continuous state-space task environment model to improve the authentication process of UAV task environment. Based on the DDQN algorithm, the collaborative tasks of UAV swarm in different task scenarios are trained. The experimental results validate that the DDQN algorithm is efficient in terms of training UAV swarm to complete the given collaborative tasks while meeting the requirements of UAV swarm for centralization and autonomy, and improving the intelligence of UAV swarm collaborative task execution. The simulation results show that after training, the proposed UAV swarm can carry out the rendezvous task well, and the success rate of the mission reaches 90%.
Anti-jamming solutions based on antenna arrays enhance the anti-jamming ability and the robustness of global navigation satellite system (GNSS) receiver remarkably. However, the performance of the receiver will deteriorate significantly in the overloaded interferences scenario. We define the overloaded interferences scenario as where the number of interferences is more than or equal to the number of antenna arrays elements. In this paper, the effect mechanism of interferences with different incident directions is found by studying the anti-jamming performance of the adaptive space filter. The theoretical analysis and conclusions, which are first validated through numerical examples, reveal the relationships between the optimal weight vector and the eigenvectors of the input signal autocorrelation matrix, the relationships between the interference cancellation ratio (ICR), the signal to interference and noise power ratio (SINR) of the adaptive space filter output and the number of interferences, the eigenvalues of the input signal autocorrelation matrix. In addition, two simulation experiments are utilized to further corroborate the theoretical findings through soft anti-jamming receiver. The simulation results match well with the theoretical analysis results, thus validating the effect mechanism of overloaded interferences. The simulation results show that, for a four elements circular array, the performance difference is up to 19 dB with different incident directions of interferences. Anti-jamming performance evaluation and jamming deployment optimization can obtain more accurate and efficient results by using the conclusions.
In the applications of joint control and robot movement, the joint torque estimation has been treated as an effective technique and widely used. Researches are made to analyze the kinematic and compliance model of the robot joint with harmonic drive to acquire high precision torque output. Through analyzing the structures of the harmonic drive and experiment apparatus, a scheme of the proposed joint torque estimation method based on both the dynamic characteristics and unscented Kalman filter (UKF) is designed and built. Based on research and scheme, torque estimation methods in view of only harmonic drive compliance model and compliance model with the Kalman filter are simulated as guidance and reference to promote the research on the torque estimation technique. Finally, a promoted torque estimation method depending on both harmonic drive compliance model and UKF is designed, and simulation results compared with the measurements of a commercial torque sensor, have verified the effectiveness of the proposed method.
A low-Earth-orbit (LEO) satellite network can provide full-coverage access services worldwide and is an essential candidate for future 6G networking. However, the large variability of the geographic distribution of the Earth’s population leads to an uneven service volume distribution of access service. Moreover, the limitations on the resources of satellites are far from being able to serve the traffic in hotspot areas. To enhance the forwarding capability of satellite networks, we first assess how hotspot areas under different load cases and spatial scales significantly affect the network throughput of an LEO satellite network overall. Then, we propose a multi-region cooperative traffic scheduling algorithm. The algorithm migrates low-grade traffic from hotspot areas to coldspot areas for forwarding, significantly increasing the overall throughput of the satellite network while sacrificing some latency of end-to-end forwarding. This algorithm can utilize all the global satellite resources and improve the utilization of network resources. We model the cooperative multi-region scheduling of large-scale LEO satellites. Based on the model, we build a system testbed using OMNET++ to compare the proposed method with existing techniques. The simulations show that our proposed method can reduce the packet loss probability by 30% and improve the resource utilization ratio by 3.69%.
The concept of unmanned weapon system-of-systems (UWSoS) involves a collection of various unmanned systems to achieve or accomplish a specific goal or mission. The mission reliability of UWSoS is represented by its ability to finish a required mission above the baselines of a given mission. However, issues with heterogeneity, cooperation between systems, and the emergence of UWSoS cannot be effectively solved by traditional system reliability methods. This study proposes an effective operation-loop-based mission reliability evaluation method for UWSoS by analyzing dynamic reconfiguration. First, we present a new connotation of an effective operation loop by considering the allocation of operational entities and physical resource constraints. Then, we propose an effective operation-loop-based mission reliability model for a heterogeneous UWSoS according to the mission baseline. Moreover, a mission reliability evaluation algorithm is proposed under random external shocks and topology reconfiguration, revealing the evolution law of the effective operation loop and mission reliability. Finally, a typical 60-unmanned-aerial-vehicle-swarm is taken as an example to demonstrate the proposed models and methods. The mission reliability is achieved by considering external shocks, which can serve as a reference for evaluating and improving the effectiveness of UWSoS.
With the passage of time, it has become important to investigate new methods for updating data to better fit the trends of the grey prediction model. The traditional GM(1,1) usually sets the grey action quantity as a constant. Therefore, it cannot effectively fit the dynamic characteristics of the sequence, which results in the grey model having a low precision. The linear grey action quantity model cannot represent the index change law. This paper presents a grey action quantity model, the exponential optimization grey model (EOGM(1,1)), based on the exponential type of grey action quantity; it is constructed based on the exponential characteristics of the grey prediction model. The model can fully reflect the exponential characteristics of the simulation series with time. The exponential sequence has a higher fitting accuracy. The optimized result is verified using a numerical example for the fluctuating sequence and a case study for the index of the tertiary industry’s GDP. The results show that the model improves the precision of the grey forecasting model and reduces the prediction error.
In this paper, the formation control problem of second-order nonholonomic mobile robot systems is investigated in a dynamic event-triggered scheme. Event-triggered control protocols combined with persistent excitation (PE) conditions are presented. In event-detecting processes, an inactive time is introduced after each sampling instant, which can ensure a positive minimum sampling interval. To increase the flexibility of the event-triggered scheme, internal dynamic variables are included in event-triggering conditions. Moreover, the dynamic event-triggered scheme plays an important role in increasing the lengths of time intervals between any two consecutive events. In addition, event-triggered control protocols without forward and angular velocities are also presented based on approximate-differentiation (low-pass) filters. The asymptotic convergence results are given based on a nested Matrosov theorem and artificial sampling methods.
In this paper, an optimization model is proposed to simulate and predict the current situation of smog. The model takes the interval grey number sequence with the known possibility function as the original data, and constructs a time-delay nonlinear multivariable grey model MGM $(1,m|\tau ,\gamma )$ based on the new kernel and degree of greyness sequences considering its time-delay and nonlinearity. The time-delay parameter is determined by the maximum value of the grey time-delay absolute correlation degree, and the nonlinear parameter is determined by the minimum value of average relative error. In order to verify the feasibility of the model, this paper uses the smog related data of Nanjing city for simulation and prediction. Compared with the other four models, the new model has higher simulation and prediction accuracy.
Complex systems widely exist in nature and human society. There are complex interactions between system elements in a complex system, and systems show complex features at the macro level, such as emergence, self-organization, uncertainty, and dynamics. These complex features make it difficult to understand the internal operation mechanism of complex systems. Networked modeling of complex systems is a favorable means of understanding complex systems. It not only represents complex interactions but also reflects essential attributes of complex systems. This paper summarizes the research progress of complex systems modeling and analysis from the perspective of network science, including networked modeling, vital node analysis, network invulnerability analysis, network disintegration analysis, resilience analysis, complex network link prediction, and the attacker-defender game in complex networks. In addition, this paper presents some points of view on the trend and focus of future research on network analysis of complex systems.
An efficient and real-time simulation method is proposed for the dynamic electromagnetic characteristics of cluster targets to meet the requirements of engineering practical applications. First, the coordinate transformation method is used to establish a geometric model of the observation scene, which is described by the azimuth angles and elevation angles of the radar in the target reference frame and the attitude angles of the target in the radar reference frame. Then, an approach for dynamic electromagnetic scattering simulation is proposed. Finally, a fast-computing method based on sparsity in the time domain, space domain, and frequency domain is proposed. The method analyzes the sparsity-based dynamic scattering characteristic of the typical cluster targets. The error between the sparsity-based method and the benchmark is small, proving the effectiveness of the proposed method.
A proper weapon system is very important for a national defense system. Generally, it means selecting the optimal weapon system among many alternatives, which is a multipleattribute decision making (MADM) problem. This paper proposes a new mathematical model based on the response surface method (RSM) and the grey relational analysis (GRA). RSM is used to obtain the experimental points and analyze the factors that have a significant impact on the selection results. GRA is used to analyze the trend relationship between alternatives and reference series. And then an RSM model is obtained, which can be used to calculate all alternatives and obtain ranking results. A real world application is introduced to illustrate the utilization of the model for the weapon selection problem. The results show that this model can be used to help decision-makers to make a quick comparison of alternatives and select a proper weapon system from multiple alternatives, which is an effective and adaptable method for solving the weapon system selection problem.
