999 resultados para Sewer network
Resumo:
In this paper we consider the problem of state estimation over a communication network. Using estimation quality as a metric, two communication schemes are studied and compared. In scheme one, each sensor node communicates its measurement data to the remote estimator, while in scheme two, each sensor node communicates its local state estimate to the remote estimator. We show that with perfect communication link, if the sensor has unlimited computation capability, the two schemes produce the same estimate at the estimator, and if the sensor has limited computation capability, scheme one is always better than scheme two. On the other hand, when data packet drops occur over the communication link, we show that if the sensor has unlimited computation capability, scheme two always outperforms scheme one, and if the sensor has limited computation capability, we show that in general there exists a critical packet arrival rate, above which scheme one outperforms scheme two. Simulations are provided to demonstrate the two schemes under various circumstances. © South China University of Technology and Academy of Mathematics and Systems Science, CAS and Springer-Verlag Berlin Heidelberg 2010.
Resumo:
In this paper we consider a network that is trying to reach consensus over the occurrence of an event while communicating over Additive White Gaussian Noise (AWGN) channels. We characterize the impact of different link qualities and network connectivity on consensus performance by analyzing both the asymptotic and transient behaviors. More specifically, we derive a tight approximation for the second largest eigenvalue of the probability transition matrix. We furthermore characterize the dynamics of each individual node. © 2009 AACC.
Resumo:
The study of exchange markets dates back to LeonWalras's general equilibrium theory. Since then the economic market has been studied for its' equilibrium properties, fairness of allocations of private and public goods, and even the psychological incentives of participants. This paper studies the dynamics of an exchange economy built on a network of markets where consumers trade with suppliers to optimize utility. Viewing the market in as a decentralized network we study the system from the usual control theory point of view, evaluating the system's dynamic performance, stability and robustness. It is shown that certain consumer demand dynamics can lead to oscillations while others can converge to optimal allocations. © 2011 IFAC.
Resumo:
This paper presents an efficient algorithm for robust network reconstruction of Linear Time-Invariant (LTI) systems in the presence of noise, estimation errors and unmodelled nonlinearities. The method here builds on previous work [1] on robust reconstruction to provide a practical implementation with polynomial computational complexity. Following the same experimental protocol, the algorithm obtains a set of structurally-related candidate solutions spanning every level of sparsity. We prove the existence of a magnitude bound on the noise, which if satisfied, guarantees that one of these structures is the correct solution. A problem-specific model-selection procedure then selects a single solution from this set and provides a measure of confidence in that solution. Extensive simulations quantify the expected performance for different levels of noise and show that significantly more noise can be tolerated in comparison to the original method. © 2012 IEEE.
Resumo:
Many manufacturing firms have developed a service dimension to their product portfolio. In response to this growing trend of servitisation, organisations, often involved in complex, long-lifecycle product-service system (PSS) provision, need to reconfigure their global engineering networks to support integrated PSS offerings. Drawing on parallel concepts in 'production' networks, the idea of 'location role' now becomes increasingly complex, in terms of service delivery. As new markets develop, locations in a specific region may need to grow/adapt engineering service 'competencies' along the value chain, from design and build to support and service, in order to serve future location-specific requirements and, potentially, those requirements of the overall network. The purpose of this paper is to advance understanding of how best to design complex multi-organisational engineering service networks, through extension of the 'production' network location role concept to a PSS context, capturing both traditional engineering 'design and build' and engineering 'service' requirements. Copyright © 2012 Inderscience Enterprises Ltd.
Resumo:
The fundamental aim of clustering algorithms is to partition data points. We consider tasks where the discovered partition is allowed to vary with some covariate such as space or time. One approach would be to use fragmentation-coagulation processes, but these, being Markov processes, are restricted to linear or tree structured covariate spaces. We define a partition-valued process on an arbitrary covariate space using Gaussian processes. We use the process to construct a multitask clustering model which partitions datapoints in a similar way across multiple data sources, and a time series model of network data which allows cluster assignments to vary over time. We describe sampling algorithms for inference and apply our method to defining cancer subtypes based on different types of cellular characteristics, finding regulatory modules from gene expression data from multiple human populations, and discovering time varying community structure in a social network.
Resumo:
In fear extinction, an animal learns that a conditioned stimulus (CS) no longer predicts a noxious stimulus [unconditioned stimulus (UCS)] to which it had previously been associated, leading to inhibition of the conditioned response (CR). Extinction creates a new CS-noUCS memory trace, competing with the initial fear (CS-UCS) memory. Recall of extinction memory and, hence, CR inhibition at later CS encounters is facilitated by contextual stimuli present during extinction training. In line with theoretical predictions derived from animal studies, we show that, after extinction, a CS-evoked engagement of human ventromedial prefrontal cortex (VMPFC) and hippocampus is context dependent, being expressed in an extinction, but not a conditioning, context. Likewise, a positive correlation between VMPFC and hippocampal activity is extinction context dependent. Thus, a VMPFC-hippocampal network provides for context-dependent recall of human extinction memory, consistent with a view that hippocampus confers context dependence on VMPFC.
Resumo:
An optical and irreversible temperature sensor (e.g., a time-temperature integrator) is reported based on a mechanically embossed chiral-nematic polymer network. The polymer consists of a chemical and a physical (hydrogen-bonded) network and has a reflection band in the visible wavelength range. The sensors are produced by mechanical embossing at elevated temperatures. A relative large compressive deformation (up to 10%) is obtained inducing a shift to shorter wavelength of the reflection band (>30 nm). After embossing, a temperature sensor is obtained that exhibits an irreversible optical response. A permanent color shift to longer wavelengths (red) is observed upon heating of the polymer material to temperatures above the glass transition temperature. It is illustrated that the observed permanent color shift is related to shape memory in the polymer material. The films can be printed on a foil, thus showing that these sensors are potentially interesting as time-temperature integrators for applications in food and pharmaceutical products. Copyright © 2013 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
Resumo:
While the plasticity of excitatory synaptic connections in the brain has been widely studied, the plasticity of inhibitory connections is much less understood. Here, we present recent experimental and theoretical □ndings concerning the rules of spike timing-dependent inhibitory plasticity and their putative network function. This is a summary of a workshop at the COSYNE conference 2012.
Resumo:
Linear techniques can predict whether the non-oscillating (steady) state of a thermoacoustic system is stable or unstable. With a sufficiently large impulse, however, a thermoacoustic system can reach a stable oscillating state even when the steady state is also stable. A nonlinear analysis is required to predict the existence of this oscillating state. Continuation methods are often used for this but they are computationally expensive. In this paper, an acoustic network code called LOTAN is used to obtain the steady and the oscillating solutions for a horizontal Rijke tube. The heat release is modelled as a nonlinear function of the mass flow rate. Several test cases from the literature are analysed in order to investigate the effect of various nonlinear terms in the flame model. The results agree well with the literature, showing that LOTAN can be used to map the steady and oscillating solutions as a function of the control parameters. Furthermore, the nature of the bifurcation between steady and oscillating states can be predicted directly from the nonlinear terms inside the flame model. Copyright © 2012 by ASME.
Resumo:
In natural languages multiple word sequences can represent the same underlying meaning. Only modelling the observed surface word sequence can result in poor context coverage, for example, when using n-gram language models (LM). To handle this issue, paraphrastic LMs were proposed in previous research and successfully applied to a US English conversational telephone speech transcription task. In order to exploit the complementary characteristics of paraphrastic LMs and neural network LMs (NNLM), the combination between the two is investigated in this paper. To investigate paraphrastic LMs' generalization ability to other languages, experiments are conducted on a Mandarin Chinese broadcast speech transcription task. Using a paraphrastic multi-level LM modelling both word and phrase sequences, significant error rate reductions of 0.9% absolute (9% relative) and 0.5% absolute (5% relative) were obtained over the baseline n-gram and NNLM systems respectively, after a combination with word and phrase level NNLMs. © 2013 IEEE.