Fast Response Exhaust Gas Temperature Measurement in IC Engines

The harsh environment presented by engines, particularly in the exhaust systems, often necessitates the use of robust and therefore low bandwidth temperature sensors. Consequently, high frequencies are attenuated in the output. One technique for addressing this problem involves measuring the gas temperature using two sensors with different time-constants and mathematically reconstructing the true gas temperature from the resulting signals. Such a technique has been applied in gas turbine, rocket motor and combustion research. A new reconstruction technique based on difference equations has been developed and its effectiveness proven theoretically. The algorithms have been successfully tested and proven on experimental data from a rig that produces cyclic temperature variations. These tests highlighted that the separation of the thermocouple junctions must be very small to ensure that both sensors are subjected to the same gas temperatures. Exhaust gas temperatures were recorded by an array of thermocouples during transient operation of a high performance two-stroke engine. The results show that the increase in bandwidth arising from the dual sensor technique allowed accurate measurement of exhaust gas temperature with relatively robust thermocouples. Finally, an array of very fine thermocouples (12.5 - 50 microns) was used to measure the in-cycle temperature variation in the exhaust.

Análise e implementação de filtros e controladores num sistema de processamento digital de sinal

Dissertação para obtenção do grau de Mestre em Engenharia Electrotécnica Ramo de Automação e Electrónica Industrial

Periodic paths on nonautonomous graphs

We define nonautonomous graphs as a class of dynamic graphs in discrete time whose time-dependence consists in connecting or disconnecting edges. We study periodic paths in these graphs, and the associated zeta functions. Based on the analytic properties of these zeta functions we obtain explicit formulae for the number of n-periodic paths, as the sum of the nth powers of some specific algebraic numbers.

Rhapsody in fractional

This paper studies several topics related with the concept of “fractional” that are not directly related with Fractional Calculus, but can help the reader in pursuit new research directions. We introduce the concept of non-integer positional number systems, fractional sums, fractional powers of a square matrix, tolerant computing and FracSets, negative probabilities, fractional delay discrete-time linear systems, and fractional Fourier transform.

Arc exchange systems and renormalization

We exhibit the construction of stable arc exchange systems from the stable laminations of hyperbolic diffeomorphisms. We prove a one-to-one correspondence between (i) Lipshitz conjugacy classes of C(1+H) stable arc exchange systems that are C(1+H) fixed points of renormalization and (ii) Lipshitz conjugacy classes of C(1+H) diffeomorphisms f with hyperbolic basic sets Lambda that admit an invariant measure absolutely continuous with respect to the Hausdorff measure on Lambda. Let HD(s)(Lambda) and HD(u)(Lambda) be, respectively, the Hausdorff dimension of the stable and unstable leaves intersected with the hyperbolic basic set L. If HD(u)(Lambda) = 1, then the Lipschitz conjugacy is, in fact, a C(1+H) conjugacy in (i) and (ii). We prove that if the stable arc exchange system is a C(1+HDs+alpha) fixed point of renormalization with bounded geometry, then the stable arc exchange system is smooth conjugate to an affine stable arc exchange system.

Two new power indices based on winning coalitions

Deegan and Packel (1979) and Holler (1982) proposed two power indices for simple games: the Deegan–Packel index and the Public Good Index. In the definition of these indices, only minimal winning coalitions are taken into account. Using similar arguments, we define two new power indices. These new indices are defined taking into account only those winning coalitions that do not contain null players. The results obtained with the different power indices are compared by means of two real-world examples taken from the political field.

Problèmes de premier passage et de commande optimale pour des chaînes de Markov à temps discret.

Nous considérons des processus de diffusion, définis par des équations différentielles stochastiques, et puis nous nous intéressons à des problèmes de premier passage pour les chaînes de Markov en temps discret correspon- dant à ces processus de diffusion. Comme il est connu dans la littérature, ces chaînes convergent en loi vers la solution des équations différentielles stochas- tiques considérées. Notre contribution consiste à trouver des formules expli- cites pour la probabilité de premier passage et la durée de la partie pour ces chaînes de Markov à temps discret. Nous montrons aussi que les résultats ob- tenus convergent selon la métrique euclidienne (i.e topologie euclidienne) vers les quantités correspondantes pour les processus de diffusion. En dernier lieu, nous étudions un problème de commande optimale pour des chaînes de Markov en temps discret. L’objectif est de trouver la valeur qui mi- nimise l’espérance mathématique d’une certaine fonction de coût. Contraire- ment au cas continu, il n’existe pas de formule explicite pour cette valeur op- timale dans le cas discret. Ainsi, nous avons étudié dans cette thèse quelques cas particuliers pour lesquels nous avons trouvé cette valeur optimale.

Modélisation mathématique de la propagation de la malaria.

Un modèle mathématique de la propagation de la malaria en temps discret est élaboré en vue de déterminer l'influence qu'un déplacement des populations des zones rurales vers les zones urbaines aurait sur la persistance ou la diminution de l'incidence de la malaria. Ce modèle, sous la forme d'un système de quatorze équations aux différences finies, est ensuite comparé à un modèle analogue mais en temps continu, qui prend la forme d'équations différentielles ordinaires. Une étude comparative avec la littérature récente permet de déterminer les forces et les faiblesses de notre modèle.

Characterization theorem for classical orthogonal polynomials on non-uniform lattices: The functional approach

Using the functional approach, we state and prove a characterization theorem for classical orthogonal polynomials on non-uniform lattices (quadratic lattices of a discrete or a q-discrete variable) including the Askey-Wilson polynomials. This theorem proves the equivalence between seven characterization properties, namely the Pearson equation for the linear functional, the second-order divided-difference equation, the orthogonality of the derivatives, the Rodrigues formula, two types of structure relations,and the Riccati equation for the formal Stieltjes function.

Exercise sheet 2 pdf

Exercises and solutions in PDF

Exercise sheet 2

Exercises and solutions in LaTex

The state estimation of flow demands in gas networks from sparse pressure telemetry

This paper presents novel observer-based techniques for the estimation of flow demands in gas networks, from sparse pressure telemetry. A completely observable model is explored, constructed by incorporating difference equations that assume the flow demands are steady. Since the flow demands usually vary slowly with time, this is a reasonable approximation. Two techniques for constructing robust observers are employed: robust eigenstructure assignment and singular value assignment. These techniques help to reduce the effects of the system approximation. Modelling error may be further reduced by making use of known profiles for the flow demands. The theory is extended to deal successfully with the problem of measurement bias. The pressure measurements available are subject to constant biases which degrade the flow demand estimates, and such biases need to be estimated. This is achieved by constructing a further model variation that incorporates the biases into an augmented state vector, but now includes information about the flow demand profiles in a new form.

Problems in four-dimensional data assimilation

With the introduction of new observing systems based on asynoptic observations, the analysis problem has changed in character. In the near future we may expect that a considerable part of meteorological observations will be unevenly distributed in four dimensions, i.e. three dimensions in space and one in time. The term analysis, or objective analysis in meteorology, means the process of interpolating observed meteorological observations from unevenly distributed locations to a network of regularly spaced grid points. Necessitated by the requirement of numerical weather prediction models to solve the governing finite difference equations on such a grid lattice, the objective analysis is a three-dimensional (or mostly two-dimensional) interpolation technique. As a consequence of the structure of the conventional synoptic network with separated data-sparse and data-dense areas, four-dimensional analysis has in fact been intensively used for many years. Weather services have thus based their analysis not only on synoptic data at the time of the analysis and climatology, but also on the fields predicted from the previous observation hour and valid at the time of the analysis. The inclusion of the time dimension in objective analysis will be called four-dimensional data assimilation. From one point of view it seems possible to apply the conventional technique on the new data sources by simply reducing the time interval in the analysis-forecasting cycle. This could in fact be justified also for the conventional observations. We have a fairly good coverage of surface observations 8 times a day and several upper air stations are making radiosonde and radiowind observations 4 times a day. If we have a 3-hour step in the analysis-forecasting cycle instead of 12 hours, which is applied most often, we may without any difficulties treat all observations as synoptic. No observation would thus be more than 90 minutes off time and the observations even during strong transient motion would fall within a horizontal mesh of 500 km * 500 km.

Pulsating equilibria: stability through migration

This paper is to present a model of spatial equilibrium using a nonlinear generalization of Markov-chain type model, and to show the dynamic stability of a unique equilibrium. Even at an equilibrium, people continue to migrate among regions as well as among agent-types, and yet their overall distribution remain unchanged. The model is also adapted to suggest a theory of traffic distribution in a city.

Dynamical trust and reputation computation model for B2C E-Commerce

Trust is one of the most important factors that influence the successful application of network service environments, such as e-commerce, wireless sensor networks, and online social networks. Computation models associated with trust and reputation have been paid special attention in both computer societies and service science in recent years. In this paper, a dynamical computation model of reputation for B2C e-commerce is proposed. Firstly, conceptions associated with trust and reputation are introduced, and the mathematical formula of trust for B2C e-commerce is given. Then a dynamical computation model of reputation is further proposed based on the conception of trust and the relationship between trust and reputation. In the proposed model, classical varying processes of reputation of B2C e-commerce are discussed. Furthermore, the iterative trust and reputation computation models are formulated via a set of difference equations based on the closed-loop feedback mechanism. Finally, a group of numerical simulation experiments are performed to illustrate the proposed model of trust and reputation. Experimental results show that the proposed model is effective in simulating the dynamical processes of trust and reputation for B2C e-commerce.