Pragmatical generalized synchronization of chaotic systems with uncertain parameters by adaptive control

A new kind of generalized synchronization of two chaotic systems with uncertain parameters is proposed. Based on a pragmatical asymptotical stability theorem and an assumption of equal probability for ergodic initial conditions, an adaptive control law is derived so that it can be proved strictly that the common null solution of error dynamics and of parameter dynamics is actually asymptotically stable, i.e. these two identical systems are in generalized synchronization and the estimated parameters approach the uncertain values. It is called pragmatical generalized synchronization. Finally, two numerical examples are studied for two Quantum-CNN oscillator chaotic systems to show the effectiveness of the proposed generalized synchronization strategy with a double Duffing chaotic system as a goal system.     

Defect identification in rods subject to forced vibrations using the spatial wavelet transform

Use of the wavelet transform (WT) to study the forced vibrations in a rod in order to detect the presence of a defect is proposed. The axial vibrations in an inhomogeneous rod, produced by the application of different forces, are simulated by the Network Simulation Method and the obtained response is analyzed with the WT. An analysis of the detection and location of defects for several applied forces and defects generated by locally changing density or stiffness of the rod is presented. A noise test was carried out to check the robustness of the technique in real situations.     

开源教学平台的可用性研究——以Sakai为例

越来越多的国内外高校开始考虑使用基于开源软件的网络教学平台,在投入使用之前,开源教学平台一般需要进行二次开发过程,其中需要重点解决平台的可用性问题,因为网络教学平台的可用性是影响学习效果的重要因素.发现并解决网络教学环境中的可用性问题,是促进人机交互、提高学习效率的重要途径.开源教学平台的可用性指的是系统的有效性、效率和满意度,分析了网络教学平台的可用性诉求,并以浙江大学Sakai开放学习平台为例,进行个案研究.使用了ThinkAloud、观察法和访谈法等可用性测试方法,研究结果发现,浙江大学Sakai开放学习平台主要功能人机交互设计合理,但是由于文化差异和用户使用习惯问题,部分功能存在一定的可用性问题,值得学习平台设计者借鉴.     

Finding a feasible flow in a strongly connected network

We give a linear-time algorithm to find a feasible flow in a strongly connected network with fixed supplies and demands, each summing to a common value that is at most the minimum arc capacity. This algorithm speeds up the Goldberg-Rao maximum flow method by a constant factor.     

Combined neural network and reduced FRF techniques for slight damage detection using measured response data

Summary  This paper deals with structural damage detection using measured frequency response functions (FRF) as input data to artificial neural networks (ANN). A major obstacle, the impracticality of using full-size FRF data with ANNs, was circumvented by applying a data-reduction technique based on principal component analysis (PCA). The compressed FRFs, represented by their projection onto the most significant principal components, were used as the ANN input variables instead of the raw FRF data. The output is a prediction of the actual state of the specimen, i.e. healthy or damaged. A further advantage of this particular approach is its ability to deal with relatively high measurement noise, which is a common occurrence when dealing with industrial structures. The methodology was applied to detect three different states of a space antenna: reference, slight mass damage and slight stiffness damage. About 600 FRF measurements, each with 1024 spectral points, were included in the analysis. Six 2-hidden layer networks, each with an individually-optimised architecture for a specific FRF reduction level, were used for damage detection. The results showed that it was possible to distinguish between the three states of the antenna with good accuracy, subject to using an adequate number of principal components together with a suitable neural network configuration. It was also found that the quality of the raw FRF data remained a major consideration, though the method was able to filter out some of the measurement noise. The convergence and detection properties of the networks were improved significantly by removing those FRFs associated with measurement errors. Received 9 March 2000; accepted for publication 12 December 2000     

Opinion dynamics in networked command and control organizations

An opinion dynamics model for a Command and Control (C2) organization is essential for simulating combat system effectiveness. However, few studies have addressed opinion evolution in C2 simulation. With the goal of overcoming this research gap, this paper proposes an opinion exchange model, which is illustrated through a practical example of an Armored Division network. The model is divided into homogeneous and heterogeneous aspects: the former is mainly characterized by communication rules and types, while the latter is extended with the influence of multi-level opinion leaders. After carrying out the simulation of the two main models, the results show that the opinion evolution of the hierarchical leveled C2 organization with descending influence is much more complex and unpredictable than that of social networks.     

Aircraft and crew scheduling for fractional ownership programs

Fractional aircraft ownership programs, where individuals or corporations own a fraction of an aircraft, have revolutionized the corporate aviation industry. Fractional management companies (FMC) manage all aspects of aircraft operations enabling the owners to enjoy the benefits of private aviation without the associated responsibilities. We describe here the development of a scheduling decision support tool for a leading FMC. We present mathematical models, exact and heuristic solution methods. Our computational results using real and randomly generated data indicate that these models are quite effective in finding optimal or near-optimal solutions. The first phase of the implementation of one of these models at the FMC led to a significant improvement in effective utilization of the aircraft, reduction of costs due to reduced empty moves, and hence increased profits.     

A preferential attachment model with Poisson growth for scale-free networks

We propose a scale-free network model with a tunable power-law exponent. The Poisson growth model, as we call it, is an offshoot of the celebrated model of Barabási and Albert where a network is generated iteratively from a small seed network; at each step a node is added together with a number of incident edges preferentially attached to nodes already in the network. A key feature of our model is that the number of edges added at each step is a random variable with Poisson distribution, and, unlike the Barabási–Albert model where this quantity is fixed, it can generate any network. Our model is motivated by an application in Bayesian inference implemented as Markov chain Monte Carlo to estimate a network; for this purpose, we also give a formula for the probability of a network under our model.     

An algorithmic study of the Maximum Flow problem: A comparative statistical analysis

In this paper, we show the results of an experimental study about the most important algorithms proposed to solve the Maximum Flow problem. The appropriate statistical analysis not only allows us to justify comparisons between the different procedures but also to obtain classifications of their practical efficiency. Furthermore, an empirical experiment allows us to identify the influence of several parameters that are not included in a theoretical study.     

Redundant paths and reliability bounds in gamma networks

Multistage Interconnection Networks (MINs) are network systems providing fast and efficient communications at a reasonable cost. A gamma network is a specific class of MINs, which provides redundant paths in the system. In a gamma network, information from source nodes is transmitted through a specific set of routes to destination nodes. Reliability of an MIN is used as a measure of system’s ability to transform information from input to output devices. Due to the complexity of network configuration and availability of redundant paths, reliability bounds to estimate the exact reliability of a gamma network is proposed. A numerical example of an 8 × 8 gamma network is presented to demonstrate the accuracy of the reliability bounds. When the lower bound reliability provides sufficient assurance that the system will be operational at some specified time and closely approximates the exact reliability, then no further effort for obtaining the exact reliability expression is necessary.