Identification and U-control of a state-space system with time-delay

This article presents a state-space model with time-delay to map the relationship between known input-output data for discrete systems. For the given input-output data, a model identification algorithm combining parameter estimation and state estimation is proposed in line with the causality constraints. Consequently, this article proposes a least squares parameter estimation algorithm, and analyzes its convergence for the studied systems to prove that the parameter estimation errors converge to zero under the persistent excitation conditions. In control system design, the U-model based control is introduced to provide a unilateral platform to improve the design efficiency and generality. A simulation portfolio from modeling to control is provided with computational experiments to validate the derived results.     

Applications of sketches in network traffic measurement: A survey

Accurate and timely network traffic measurement is essential for network status monitoring, network fault analysis, network intrusion detection, and network security management. With the rapid development of the network, massive network traffic brings severe challenges to network traffic measurement. However, existing measurement methods suffer from many limitations for effectively recording and accurately analyzing big-volume traffic. Recently, sketches, a family of probabilistic data structures that employ hashing technology for summarizing traffic data, have been widely used to solve these problems. However, current literature still lacks a thorough review on sketch-based traffic measurement methods to offer a comprehensive insight on how to apply sketches for fulfilling various traffic measurement tasks. In this paper, we provide a detailed and comprehensive review on the applications of sketches in network traffic measurement. To this end, we classify the network traffic measurement tasks into four categories based on the target of traffic measurement, namely cardinality estimation, flow size estimation, change anomaly detection, and persistent spreader identification. First, we briefly introduce these four types of traffic measurement tasks and discuss the advantages of applying sketches. Then, we propose a series of requirements with regard to the applications of sketches in network traffic measurement. After that, we perform a fine-grained classification for each sketch-based measurement category according to the technologies applied on sketches. During the review, we evaluate the performance, advantages and disadvantages of current sketch-based traffic measurement methods based on the proposed requirements. Through the thorough review, we gain a number of valuable implications that can guide us to choose and design proper traffic measurement methods based on sketches. We also review a number of general sketches that are highly expected in modern network systems to simultaneously perform multiple traffic measurement tasks and discuss their performance based on the proposed requirements. Finally, through our serious review, we summarize a number of open issues and identify several promising research directions.     

A review of phosphorescent and fluorescent phosphors for fingerprint detection

Currently, the efficient detection of fingerprints is essential for the crime investigations. Revealing fingerprints is commonly achieved with fluorescent organic compounds but they are not efficient for fingerprint detection on porous or reflective surfaces. In order to solve the problem of collecting fingerprints on porous/reflective surfaces, inorganic phosphors have been employed, since they have characteristics of variable color emission, afterglow, high chemical stability and nano-size, which allow the fingerprint detection on any porous or non-porous surfaces. Due to these last properties, this review presents a summary about the use of phosphorescent and fluorescent phosphors for the detection of latent fingerprints. First, we discussed the main physical and chemical characteristics of the fingerprints which permit their detection and collection from any surface. After this, we presented the main morphological, structural and luminescent properties of the phosphorescent and fluorescent phosphors that allow their use for fingerprint detection. Later, we demonstrated with pictures of fingerprints (with and without light emission from the phosphors deposited on them) that both, phosphorescent and fluorescent phosphors can be used to visualize fingerprints with high resolution and high contrast without interference of the background surface, which is ideal for its collection and registration in the Automated Fingerprint Identification System (AFIS). We believe that this review could be useful to understand how to select an appropriate phosphorescent or fluorescent material for fingerprint detection depending on the type of surface (porous or non-porous, reflective or not reflective) where the fingerprint is deposited.     

爆破工程安全评价初探

开展爆破工程安全评价可有效地减少各种危险和有害因素 ,减少爆破事故的发生 ,大型或特殊爆破工程均应进行安全评价。本文提出了对爆破工程开展安全评价的设想 ,并对爆破工程安全评价的内容和方法进行了探讨。文中指出 :根据爆破工程的特点 ,可采用事故树分析和预先危险性分析等方法进行爆破工程的安全评价     

Structural health monitoring system based on multi-agent coordination and fusion for large structure

In practical applications of structural health monitoring technology, a large number of distributed sensors are usually adopted to monitor the big dimension structures and different kinds of damage. The monitored structures are usually divided into different sub-structures and monitored by different sensor sets. Under this situation, how to manage the distributed sensor set and fuse different methods to obtain a fast and accurate evaluation result is an important problem to be addressed deeply. In the paper, a multi-agent fusion and coordination system is presented to deal with the damage identification for the strain distribution and joint failure in the large structure. Firstly, the monitoring system is adopted to distributedly monitor two kinds of damages, and it self-judges whether the static load happens in the monitored sub-region, and focuses on the static load on the sub-region boundary to obtain the sensor network information with blackboard model. Then, the improved contract net protocol is used to dynamically distribute the damage evaluation module for monitoring two kinds of damage uninterruptedly. Lastly, a reliable assessment for the whole structure is given by combing various heterogeneous classifiers strengths with voting-based fusion. The proposed multi-agent system is illustrated through a large aerospace aluminum plate structure experiment. The result shows that the method can significantly improve the monitoring performance for the large-scale structure.     

Maximum likelihood-based adaptive differential evolution identification algorithm for multivariable systems in the state-space form

Parameter estimation plays an important role in the field of system control. This article is concerned with the parameter estimation methods for multivariable systems in the state-space form. For the sake of solving the identification complexity caused by a large number of parameters in multivariable systems, we decompose the original multivariable system into some subsystems containing fewer parameters and study identification algorithms to estimate the parameters of each subsystem. By taking the maximum likelihood criterion function as the fitness function of the differential evolution algorithm, we present a maximum likelihood-based differential evolution (ML-DE) algorithm for parameter estimation. To improve the parameter estimation accuracy, we introduce the adaptive mutation factor and the adaptive crossover factor into the ML-DE algorithm and propose a maximum likelihood-based adaptive differential evolution algorithm. The simulation study indicates the efficiency of the proposed algorithms.     

A study on the monitoring model development for quality measurement of internet traffic

The recent trend of integration among new network services such as the long-term evolution (LTE) based on internet protocol (IP) needs reputable analyses and prediction information on the internet traffic. The IP along with increased internet traffics due to expanding new service platforms such as smartphones will reflect policies such as network QoS according to new services. The establishment of monitoring methods and analysis plans is thus required for the development of internet traffics that will analyze their status and predict their future. The paper with the speed of Internet traffic model is developed for monitoring the state of the experiment and verified. The problem is that the proposed service Internet service provider (ISP) to resolve the conflict between the occurrences can be considerably Internet traffic and that the state of data may be helpful in understanding. The paper advancement policy to reflect the network traffic volume of Internet services and users irradiation with increased traffic due to the development and management of the analysis was carried out experimental measurements.     

A robust method for axis identification

The present paper proposes a new method for axis identification in discrete axially symmetrical geometric models. This method is based on-a-never-used-before property of the axially symmetrical surfaces for which the symmetry line of any section curve of the surface (or of a portion of it in the case of an incomplete axially symmetrical surface) always intersects the axis of symmetry of the surface. Thus the working principle of the method makes it very robust to local defectiveness, measurement noise and outliers.In order to compare it with the most cited methods presented in literature, several types of tests have been designed and performed. The robustness of those methods, on the one hand, has been evaluated by defining the Statistical Confidence Boundary at 1σ confidence level. The trueness of the method, on the other hand, has been evaluated on geometric models obtained by measuring real objects. The high robustness, which characterizes the proposed method, makes it particularly suitable for product geometric inspection where high accuracy is required.     

Inverse identification of constitutive parameters from heat source fields: A local approach applied to hyperelasticity

In this paper, a new inverse identification method of constitutive parameters is developed from full kinematic and thermal field measurements. It consists in reconstructing the heat source field from two different approaches by using the heat diffusion equation. The first one requires the temperature field measurement and the value of the thermophysical parameters. The second one is based on the kinematic field measurement and the choice of a thermo-hyperelastic model that contains the parameters to be identified. The identification is carried out at the local scale, ie, at any point of the heat source field, without using the boundary conditions. In the present work, the method is applied to the challenging case of hyperelasticity from a heterogeneous test. Due to large deformations undergone by the rubber specimen tested, a motion compensation technique is developed to plot the kinematic and the thermal fields at the same points before reconstructing the heterogeneous heat source field. In the present case, the constitutive parameter of the Neo-Hookean model has been identified, and its distribution has been characterized with respect to the strain state at the surface of a cross-shaped specimen.     

Parallel chaos optimization algorithm with migration and merging operation

Chaos optimization algorithm (COA) utilizes the chaotic maps to generate the pseudo-random sequences mapped as the decision variables for global optimization applications. A kind of parallel chaos optimization algorithm (PCOA) has been proposed in our former studies to improve COA. The salient feature of PCOA lies in its pseudo-parallel mechanism. However, all individuals in the PCOA search independently without utilizing the fitness and diversity information of the population. In view of the limitation of PCOA, a novel PCOA with migration and merging operation (denoted as MMO-PCOA) is proposed in this paper. Specifically, parallel individuals are randomly selected to be conducted migration and merging operation with the so far parallel solutions. Both migration and merging operation exchange information within population and produce new candidate individuals, which are different from those generated by stochastic chaotic sequences. Consequently, a good balance between exploration and exploitation can be achieved in the MMO-PCOA. The impacts of different one-dimensional maps and parallel numbers on the MMO-PCOA are also discussed. Benchmark functions and parameter identification problems are used to test the performance of the MMO-PCOA. Simulation results, compared with other optimization algorithms, show the superiority of the proposed MMO-PCOA algorithm.