26 resultados para Paris (France) -- Population
Resumo:
A technique is proposed for classifying respiratory volume waveforms(RVW) into normal and abnormal categories of respiratory pathways. The proposed method transforms the temporal sequence into frequency domain by using an orthogonal transform, namely discrete cosine transform (DCT) and the transformed signal is pole-zero modelled. A Bayes classifier using model pole angles as the feature vector performed satisfactorily when a limited number of RVWs recorded under deep and rapid (DR) manoeuvre are classified.
Resumo:
This paper presents a novel algorithm for compression of single lead Electrocardiogram (ECG) signals. The method is based on Pole-Zero modelling of the Discrete Cosine Transformed (DCT) signal. An extension is proposed to the well known Steiglitz-Hcbride algorithm, to model the higher frequency components of the input signal more accurately. This is achieved by weighting the error function minimized by the algorithm to estimate the model parameters. The data compression achieved by the parametric model is further enhanced by Differential Pulse Code Modulation (DPCM) of the model parameters. The method accomplishes a compression ratio in the range of 1:20 to 1:40, which far exceeds those achieved by most of the current methods.
Resumo:
He propose a new time domain method for efficient representation of the KCG and delineation of its component waves. The method is based on the multipulse Linear prediction (LP) coding which is being widely used in speech processing. The excitation to the LP synthesis filter consists of a few pulses defined by their locations and amplitudes. Based on the amplitudes and their distribution, the pulses are suitably combined to delineate the component waves. Beat to beat correlation in the ECG signal is used in QRS periodicity prediction. The method entails a data compression of 1 in 6. The method reconstructs the signal with an NMSE of less than 5%.
Resumo:
In this paper, we propose a cooperative particle swarm optimization (CPSO) based channel estimation/equalization scheme for multiple-input multiple-output zero-padded single-carrier (MIMO-ZPSC) systems with large dimensions in frequency selective channels. We estimate the channel state information at the receiver in time domain using a PSO based algorithm during training phase. Using the estimated channel, we perform information symbol detection in the frequency domain using FFT based processing. For this detection, we use a low complexity OLA (OverLap Add) likelihood ascent search equalizer which uses minimum mean square (MMSE) equalizer solution as the initial solution. Multiple iterations between channel estimation and data detection are carried out which significantly improves the mean square error and bit error rate performance of the receiver.
Resumo:
We consider the problem of joint routing, scheduling and power control in a multihop wireless network when the nodes have multiple antennas. We focus on exploiting the multiple degrees-of-freedom available at each transmitter and receiver due to multiple antennas. Specifically we use multiple antennas at each node to form multiple access and broadcast links in the network rather than just point to point links. We show that such a generic transmission model improves the system performance significantly. Since the complexity of the resulting optimization problem is very high, we also develop efficient suboptimal solutions for joint routing, scheduling and power control in this setup.
Resumo:
The present study experimentally evaluates the performance of control (standard cylinder specimen), damaged (mechanical loading after thermal exposure) and repaired / retrofitted normal plain concrete cylinders using different repair schemes such as on use of FRP wraps, Geo-polymers, etc., to restore the capacity of damaged structural concrete elements. The control-companion specimen in the series provides the reference frame against which both, specimen damage levels were quantified and the benefits of a specimen repaired subsequent to damage were assessed.
Resumo:
Climate change is most likely to introduce an additional stress to already stressed water systems in developing countries. Climate change is inherently linked with the hydrological cycle and is expected to cause significant alterations in regional water resources systems necessitating measures for adaptation and mitigation. Increasing temperatures, for example, are likely to change precipitation patterns resulting in alterations of regional water availability, evapotranspirative water demand of crops and vegetation, extremes of floods and droughts, and water quality. A comprehensive assessment of regional hydrological impacts of climate change is thus necessary. Global climate model simulations provide future projections of the climate system taking into consideration changes in external forcings, such as atmospheric carbon-dioxide and aerosols, especially those resulting from anthropogenic emissions. However, such simulations are typically run at a coarse scale, and are not equipped to reproduce regional hydrological processes. This paper summarizes recent research on the assessment of climate change impacts on regional hydrology, addressing the scale and physical processes mismatch issues. Particular attention is given to changes in water availability, irrigation demands and water quality. This paper also includes description of the methodologies developed to address uncertainties in the projections resulting from incomplete knowledge about future evolution of the human-induced emissions and from using multiple climate models. Approaches for investigating possible causes of historically observed changes in regional hydrological variables are also discussed. Illustrations of all the above-mentioned methods are provided for Indian regions with a view to specifically aiding water management in India.
Resumo:
The 3-Hitting Set problem involves a family of subsets F of size at most three over an universe U. The goal is to find a subset of U of the smallest possible size that intersects every set in F. The version of the problem with parity constraints asks for a subset S of size at most k that, in addition to being a hitting set, also satisfies certain parity constraints on the sizes of the intersections of S with each set in the family F. In particular, an odd (even) set is a hitting set that hits every set at either one or three (two) elements, and a perfect code is a hitting set that intersects every set at exactly one element. These questions are of fundamental interest in many contexts for general set systems. Just as for Hitting Set, we find these questions to be interesting for the case of families consisting of sets of size at most three. In this work, we initiate an algorithmic study of these problems in this special case, focusing on a parameterized analysis. We show, for each problem, efficient fixed-parameter tractable algorithms using search trees that are tailor-made to the constraints in question, and also polynomial kernels using sunflower-like arguments in a manner that accounts for equivalence under the additional parity constraints.