905,852 research outputs found

    Distributed filtering of networked dynamic systems with non-gaussian noises over sensor networks: A survey

    Get PDF
    summary:Sensor networks are regarded as a promising technology in the field of information perception and processing owing to the ease of deployment, cost-effectiveness, flexibility, as well as reliability. The information exchange among sensors inevitably suffers from various network-induced phenomena caused by the limited resource utilization and complex application scenarios, and thus is required to be governed by suitable resource-saving communication mechanisms. It is also noteworthy that noises in system dynamics and sensor measurements are ubiquitous and in general unknown but can be bounded, rather than follow specific Gaussian distributions as assumed in Kalman-type filtering. Particular attention of this paper is paid to a survey of recent advances in distributed filtering of networked dynamic systems with non-Gaussian noises over sensor networks. First, two types of widely employed structures of distributed filters are reviewed, the corresponding analysis is systematically addressed, and some interesting results are provided. The inherent purpose of adding consensus terms into the distributed filters is profoundly disclosed. Then, some representative models characterizing various network-induced phenomena are reviewed and their corresponding analytical strategies are exhibited in detail. Furthermore, recent results on distributed filtering with non-Gaussian noises are sorted out in accordance with different network-induced phenomena and system models. Another emphasis is laid on recent developments of distributed filtering with various communication scheduling, which are summarized based on the inherent characteristics of their dynamic behavior associated with mathematical models. Finally, the state-of-the-art of distributed filtering and challenging issues, ranging from scalability, security to applications, are raised to guide possible future research

    Modeling biophysical and neural circuit bases for core cognitive abilities evident in neuroimaging patterns: hippocampal mismatch, mismatch negativity, repetition positivity, and alpha suppression of distractors

    Get PDF
    This dissertation develops computational models to address outstanding problems in the domain of expectation-related cognitive processes and their neuroimaging markers in functional MRI or EEG. The new models reveal a way to unite diverse phenomena within a common framework focused on dynamic neural encoding shifts, which can arise from robust interactive effects of M-currents and chloride currents in pyramidal neurons. By specifying efficient, biologically realistic circuits that achieve predictive coding (e.g., Friston, 2005), these models bridge among neuronal biophysics, systems neuroscience, and theories of cognition. Chapter one surveys data types and neural processes to be examined, and outlines the Dynamically Labeled Predictive Coding (DLPC) framework developed during the research. Chapter two models hippocampal prediction and mismatch, using the DLPC framework. Chapter three presents extensions to the model that allow its application for modeling neocortical EEG genesis. Simulations of this extended model illustrate how dynamic encoding shifts can produce Mismatch Negativity (MMN) phenomena, including pharmacological effects on MMN reported for humans or animals. Chapters four and five describe new modeling studies of possible neural bases for alpha-induced information suppression, a phenomenon associated with active ignoring of stimuli. Two models explore the hypothesis that in simple rate-based circuits, information suppression might be a robust effect of neural saturation states arising near peaks of resonant alpha oscillations. A new proposal is also introduced for how the basal ganglia may control onset and offset of alpha-induced information suppression. Although these rate models could reproduce many experimental findings, they fell short of reproducing a key electrophysiological finding: phase-dependent reduction in spiking activity correlated with power in the alpha frequency band. Therefore, chapter five also specifies how a DLPC model, adapted from the neocortical model developed in chapter three, can provide an expectation-based model of alpha-induced information suppression that exhibits phase-dependent spike reduction during alpha-band oscillations. The model thus can explain experimental findings that were not reproduced by the rate models. The final chapter summarizes main theses, results, and basic research implications, then suggests future directions, including expanded models of neocortical mismatch, applications to artificial neural networks, and the introduction of reward circuitry

    Stochastic methods for measurement-based network control

    Get PDF
    The main task of network administrators is to ensure that their network functions properly. Whether they manage a telecommunication or a road network, they generally base their decisions on the analysis of measurement data. Inspired by such network control applications, this dissertation investigates several stochastic modelling techniques for data analysis. The focus is on two areas within the field of stochastic processes: change point detection and queueing theory. Part I deals with statistical methods for the automatic detection of change points, being changes in the probability distribution underlying a data sequence. This part starts with a review of existing change point detection methods for data sequences consisting of independent observations. The main contribution of this part is the generalisation of the classic cusum method to account for dependence within data sequences. We analyse the false alarm probability of the resulting methods using a large deviations approach. The part also discusses numerical tests of the new methods and a cyber attack detection application, in which we investigate how to detect dns tunnels. The main contribution of Part II is the application of queueing models (probabilistic models for waiting lines) to situations in which the system to be controlled can only be observed partially. We consider two types of partial information. Firstly, we develop a procedure to get insight into the performance of queueing systems between consecutive system-state measurements and apply it in a numerical study, which was motivated by capacity management in cable access networks. Secondly, inspired by dynamic road control applications, we study routing policies in a queueing system for which just part of the jobs are observable and controllable

    The spectral conforming model and its applications

    Get PDF
    It has been observed that finite element or finite difference model of order can approximate with fair accuracy less than one-third of the eigenvalues of the underlying continuous system corresponding to the low spectrum. The new discrete model, namely the spectral conforming model, is developed to predict the eigenvalues of continuous systems in both the low and high spectra. The spectral conforming models are developed using an inverse vibration method. The classical vibration problem is the direct method. In the direct approach, the characteristic behaviors of the system, i.e. frequency response, natural frequency, and steady state response are analyzed and predicted from known physical parameters such as the geometry information and material properties. In a special case of simple geometry and constant material properties of the continuous system, the exact solution can be obtained analytically. In the inverse problem, the systems are reconstructed formulating the stiffness and mass matrices from known behaviors of vibration. In this dissertation, two types of the spectral conforming models are developed using an inverse method that fits the frequency responses of the discrete system to those of the continuous system. Since the eigenvalues alone cannot determine the discrete system uniquely, the necessary requirements divide the models into two categories. The spectral conforming model in chapter 3 adopts the fundamental inverse eigenvalue problems for reconstructing the chain of a mass-spring system with a prescribed spectra based on the element of a fixed-free uniform rod. Another spectral conforming model named the persymmetric model is developed in chapter 4. In the development of the persymmetric model, the parametric stiffness and mass matrices are formulated with prescribed spectra based on a free-free uniform rod. Asymptotic analysis and other useful methods for describing the behaviors of the continuous system are employed for the development of the persymmetric models. Several applications are examined showing the advantages of the newly developed discrete models. From the speculation of the applications and their results, we may conclude that the use of the spectral conforming model is very practical in most dynamic problems such as the simulation and control of a continuous system. If the problems involve high frequency excitation, it is highly recommended to use the spectral conforming model

    Proceedings of International Workshop "Global Computing: Programming Environments, Languages, Security and Analysis of Systems"

    Get PDF
    According to the IST/ FET proactive initiative on GLOBAL COMPUTING, the goal is to obtain techniques (models, frameworks, methods, algorithms) for constructing systems that are flexible, dependable, secure, robust and efficient. The dominant concerns are not those of representing and manipulating data efficiently but rather those of handling the co-ordination and interaction, security, reliability, robustness, failure modes, and control of risk of the entities in the system and the overall design, description and performance of the system itself. Completely different paradigms of computer science may have to be developed to tackle these issues effectively. The research should concentrate on systems having the following characteristics: • The systems are composed of autonomous computational entities where activity is not centrally controlled, either because global control is impossible or impractical, or because the entities are created or controlled by different owners. • The computational entities are mobile, due to the movement of the physical platforms or by movement of the entity from one platform to another. • The configuration varies over time. For instance, the system is open to the introduction of new computational entities and likewise their deletion. The behaviour of the entities may vary over time. • The systems operate with incomplete information about the environment. For instance, information becomes rapidly out of date and mobility requires information about the environment to be discovered. The ultimate goal of the research action is to provide a solid scientific foundation for the design of such systems, and to lay the groundwork for achieving effective principles for building and analysing such systems. This workshop covers the aspects related to languages and programming environments as well as analysis of systems and resources involving 9 projects (AGILE , DART, DEGAS , MIKADO, MRG, MYTHS, PEPITO, PROFUNDIS, SECURE) out of the 13 founded under the initiative. After an year from the start of the projects, the goal of the workshop is to fix the state of the art on the topics covered by the two clusters related to programming environments and analysis of systems as well as to devise strategies and new ideas to profitably continue the research effort towards the overall objective of the initiative. We acknowledge the Dipartimento di Informatica and Tlc of the University of Trento, the Comune di Rovereto, the project DEGAS for partially funding the event and the Events and Meetings Office of the University of Trento for the valuable collaboration

    Combining behavioural types with security analysis

    Get PDF
    Today's software systems are highly distributed and interconnected, and they increasingly rely on communication to achieve their goals; due to their societal importance, security and trustworthiness are crucial aspects for the correctness of these systems. Behavioural types, which extend data types by describing also the structured behaviour of programs, are a widely studied approach to the enforcement of correctness properties in communicating systems. This paper offers a unified overview of proposals based on behavioural types which are aimed at the analysis of security properties
    corecore