Adaptive, Decentralized, And Real-Time Sampling Strategies For Resource Constrained Hydraulic And Hydrologic Sensor Networks

We discuss the development and performance of a low-power sensor node (hardware, software and algorithms) that autonomously controls the sampling interval of a suite of sensors based on local state estimates and future predictions of water flow. The problem is motivated by the need to accurately reconstruct abrupt state changes in urban watersheds and stormwater systems. Presently, the detection of these events is limited by the temporal resolution of sensor data. It is often infeasible, however, to increase measurement frequency due to energy and sampling constraints. This is particularly true for real-time water quality measurements, where sampling frequency is limited by reagent availability, sensor power consumption, and, in the case of automated samplers, the number of available sample containers. These constraints pose a significant barrier to the ubiquitous and cost effective instrumentation of large hydraulic and hydrologic systems. Each of our sensor nodes is equipped with a low-power microcontroller and a wireless module to take advantage of urban cellular coverage. The node persistently updates a local, embedded model of flow conditions while IP-connectivity permits each node to continually query public weather servers for hourly precipitation forecasts. The sampling frequency is then adjusted to increase the likelihood of capturing abrupt changes in a sensor signal, such as the rise in the hydrograph – an event that is often difficult to capture through traditional sampling techniques. Our architecture forms an embedded processing chain, leveraging local computational resources to assess uncertainty by analyzing data as it is collected. A network is presently being deployed in an urban watershed in Michigan and initial results indicate that the system accurately reconstructs signals of interest while significantly reducing energy consumption and the use of sampling resources. We also expand our analysis by discussing the role of this approach for the efficient real-time measurement of stormwater systems.

Estimação da razão ótima de hedge para dólar futuro usando um modelo M-GARCH-BEKK-Diagonal

o presente trabalho versa, fundamentalmente, sobre o entendimento da volatilidade, sua modelagem e estimação. Como objeto mais específico, tem-se a comparação de dois métodos de estimação da razão de hedge para uma carteira com dois ativos: dólar spot e dólar futuro. Usando dados para dois períodos - abril de 1995 a março de 2004 e janeiro de 1999 a 30 de março de 2004 -, a análise pelo método MGARCH-BEKK-Diagonal se mostrou superior ao MQO, no sentido de que, com o primeiro, conseguiu-se uma variação percentual negativa da variância da carteira em relação à carteira sem hedge - resultado oposto ao obtido, usando-se a outra abordagem. Sugere-se aqui que a explicação do sucesso de um modelo multivariado - extensão do modelo ARCH inicialmente proposto por Engle (1982) - deve-se a sua melhor adequação a um fato estilizado em Finanças: a concentração de volatilidade durante certos períodos, bem como ao uso de uma covariância em cuja estrutura se consideram seu caráter autoregressivo e o efeito de choques passados. A redução percentual da variância obtida indica ainda a importância do mercado futuro de dólar para a atividade de hedge e para a diminuição da incerteza.

Operações booleanas entre objetos delimitados por surfels usando constrained BSP-trees

As áreas de visualização e modelagem baseados em pontos têm sido pesquisadas ativamente na computação gráfica. Pontos com atributos (por exemplo, normais) são geralmente chamados de surfels e existem vários algoritmos para a manipulação e visualização eficiente deles. Um ponto chave para a eficiência de muitos métodos é o uso de estruturas de particionamento do espaço. Geralmente octrees e KD-trees, por utilizarem cortes alinhados com os eixos são preferidas em vez das BSP-trees, mais genéricas. Neste trabalho, apresenta-se uma estrutura chamada Constrained BSP-tree (CBSP-tree), que pode ser vista como uma estrutura intermediárias entre KD-trees e BSP-trees. A CBSP-tree se caracteriza por permitir cortes arbitrários desde que seja satisfeito um critério de validade dos cortes. Esse critério pode ser redefinido de acordo com a aplicação. Isso permite uma aproximação melhor de regões curvas. Apresentam-se algoritmos para construir CBSP-trees, valendo-se da flexibilidade que a estrutura oferece, e para realizar operações booleanas usando uma nova classificação de interior/exterior.

A novel approach for solving constrained nonlinear optimization problems using neurofuzzy systems

A neural network model for solving constrained nonlinear optimization problems with bounded variables is presented in this paper. More specifically, a modified Hopfield network is developed and its internal parameters are completed using the valid-subspace technique. These parameters guarantee the convergence of the network to the equilibrium points. The network is shown to be completely stable and globally convergent to the solutions of constrained nonlinear optimization problems. A fuzzy logic controller is incorporated in the network to minimize convergence time. Simulation results are presented to validate the proposed approach.

A neural system to robust Nonlinear optimization subject to disjoint and constrained sets

The ability of neural networks to realize some complex nonlinear function makes them attractive for system identification. This paper describes a novel method using artificial neural networks to solve robust parameter estimation problems for nonlinear models with unknown-but-bounded errors and uncertainties. More specifically, a modified Hopfield network is developed and its internal parameters are computed using the valid-subspace technique. These parameters guarantee the network convergence to the equilibrium points. A solution for the robust estimation problem with unknown-but-bounded error corresponds to an equilibrium point of the network. Simulation results are presented as an illustration of the proposed approach.

Security constrained optimal active power flow via network model and interior point method

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Associação entre doença arterial coronariana e as pregas lobular diagonal e anterotragal em homens

FUNDAMENTOS: Diversas alterações dermatológicas foram associadas à doença arterial coronariana, representando achados de fácil constatação que podem contribuir na estratificação não invasiva do risco cardíaco. OBJETIVOS: Avaliar comparativamente a prevalência de certos achados dermatológicos em pacientes com ou sem doença arterial coronariana. MÉTODOS: Estudo caso/controle envolvendo pacientes do sexo masculino submetidos à cineangiocoronariografia. Foram considerados aqueles casos com obstrução de mais de 50% em pelo menos uma coronária. Avaliou-se a presença da prega lobular diagonal, prega anterotragal, alopecia e presença de pêlos no tórax nos dois grupos. Os resultados foram ajustados para os fatores de risco: tabagismo, hipertensão, diabetes, idade, dislipidemia e índice de massa corporal. RESULTADOS: Analisaram-se 110 pacientes (80 casos e 30 controles). A prevalência da prega lobular diagonal nos casos (60,0%) foi maior do que no grupo controle (30,0%) (p<0,05). Alopecia androgenética e distribuição de pêlos no tórax não demonstraram associação positiva com coronariopatia neste estudo. O Odds Ratio (IC 95%), da prega lobular diagonal foi de 3,1 (1,2-8,3) e para prega anterotragal foi de 5,5 (1,9-16,3). A verificação simultânea da prega lobular diagonal e prega anterotragal representou valor preditivo positivo de 90%. CONCLUSÕES: Detectou-se associação positiva entre a presença da prega lobular diagonal bilateral e prega anterotragal bilateral com doença arterial coronariana, sendo que a presença simultânea das duas pregas apresenta alta preditividade para doença arterial coronariana.

Solitons from dressing in an algebraic approach to the constrained KP hierarchy

The algebraic matrix hierarchy approach based on affine Lie sl(n) algebras leads to a variety of 1 + 1 soliton equations. By varying the rank of the underlying sl(n) algebra as well as its gradation in the affine setting, one encompasses the set of the soliton equations of the constrained KP hierarchy.The soliton solutions are then obtained as elements of the orbits of the dressing transformations constructed in terms of representations of the vertex operators of the affine sl(n) algebras realized in the unconventional gradations. Such soliton solutions exhibit non-trivial dependence on the KdV (odd) time flows and KP (odd and even) time Bows which distinguishes them From the conventional structure of the Darboux-Backlund-Wronskian solutions of the constrained KP hierarchy.

Non-involutive constrained systems and Hamilton-Jacobi formalism

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Constrained BV description of string field theory

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Constrained optimization model for the design of an adaptive (X)over-bar chart

An economic-statistical model is developed for variable parameters (VP) (X) over bar charts in which all design parameters vary adaptively, that is, each of the design parameters (sample size, sampling interval and control-limit width) vary as a function of the most recent process information. The cost function due to controlling the process quality through a VP (X) over bar chart is derived. During the optimization of the cost function, constraints are imposed on the expected times to signal when the process is in and out of control. In this way, required statistical properties can be assured. Through a numerical example, the proposed economic-statistical design approach for VP (X) over bar charts is compared to the economic design for VP (X) over bar charts and to the economic-statistical and economic designs for fixed parameters (FP) (X) over bar charts in terms of the operating cost and the expected times to signal. From this example, it is possible to assess the benefits provided by the proposed model. Varying some input parameters, their effect on the optimal cost and on the optimal values of the design parameters was analysed.

A stochastic shift model for economically designed charts constrained by the process stage configuration

An economic model including the labor resource and the process stage configuration is proposed to design g charts allowing for all the design parameters to be varied in an adaptive way. A random shift size is considered during the economic design selection. The results obtained for a benchmark of 64 process stage scenarios show that the activities configuration and some process operating parameters influence the selection of the best control chart strategy: to model the random shift size, its exact distribution can be approximately fitted by a discrete distribution obtained from a relatively small sample of historical data. However, an accurate estimation of the inspection costs associated to the SPC activities is far from being achieved. An illustrative example shows the implementation of the proposed economic model in a real industrial case. (C) 2011 Elsevier B.V. All rights reserved.

Two-matrix string model as constrained (2+1)-dimensional integrable system

We show that the 2-matrix string model corresponds to a coupled system of 2 + 1-dimensional KP and modified KP ((m)KP2+1) integrable equations subject to a specific symmetry constraint. The latter together with the Miura-Konopelchenko map for (m)KP2+1 are the continuum incarnation of the matrix string equation. The (m)KP2+1 Miura and Backhand transformations are natural consequences of the underlying lattice structure. The constrained (m)KP2+1 system is equivalent to a 1 + 1-dimensional generalized KP-KdV hierarchy related to graded SL(3,1). We provide an explicit representation of this hierarchy, including the associated W(2,1)-algebra of the second Hamiltonian structure, in terms of free currents.

Affine Lie algebraic origin of constrained KP hierarchies

An affine sl(n + 1) algebraic construction of the basic constrained KP hierarchy is presented. This hierarchy is analyzed using two approaches, namely linear matrix eigenvalue problem on hermitian symmetric space and constrained KP Lax formulation and it is shown that these approaches are equivalent. The model is recognized to be the generalized non-linear Schrödinger (GNLS) hierarchy and it is used as a building block for a new class of constrained KP hierarchies. These constrained KP hierarchies are connected via similarity-Bäcklund transformations and interpolate between GNLS and multi-boson KP-Toda hierarchies. Our construction uncovers the origin of the Toda lattice structure behind the latter hierarchy. © 1995 American Institute of Physics.

Constrained KP models as integrable matrix hierarchies

We formulate the constrained KP hierarchy (denoted by cKP K+1,M) as an affine sl(M + K+ 1) matrix integrable hierarchy generalizing the Drinfeld-Sokolov hierarchy. Using an algebraic approach, including the graded structure of the generalized Drinfeld-Sokolov hierarchy, we are able to find several new universal results valid for the cKP hierarchy. In particular, our method yields a closed expression for the second bracket obtained through Dirac reduction of any untwisted affine Kac-Moody current algebra. An explicit example is given for the case sl(M + K + 1), for which a closed expression for the general recursion operator is also obtained. We show how isospectral flows are characterized and grouped according to the semisimple non-regular element E of sl(M + K+ 1) and the content of the center of the kernel of E. © 1997 American Institute of Physics.