What energy level is required to avoid nutrient depletion after surgery in oropharyngeal cancer?

The rate of energy expenditure was repeatedly measured by indirect calorimetry both in the basal state (BMR) and in the resting fed state (RMR) in 8 middle-aged male patients operated for oropharyngeal cancer. In the postsurgical phase, two sequential energy levels were administered by nasogastric tube: (1) a 'maintenance' level (days 3-5) at 1.4 X measured presurgery BMR; (2) a 'supramaintenance' level (days 6-9) at 1.7 X measured BMR on day 6. Before surgery the patients had a BMR averaging (23.7 +/- 1.0 kcal/kg.day). After surgery BMR increased to 27.6 +/- 2.7 kcal/kg.day (day 6), then it decreased to 24.4 +/- 1.4 kcal/kg.day (day 10). The difference between RMR and BMR yielded a nutrient-induced thermogenesis averaging 5 +/- 1 and 8.5 +/- 2% (p less than 0.05) on levels 1 and 2, respectively. It is concluded that an energy level corresponding to 1.4 X presurgery BMR is sufficient to maintain energy and substrate equilibrium in nondepleted patients, whereas 1.7 X BMR induces positive protein and fat balances concomitant to a decrease efficiency of energy utilization.

Multi-level modeling of aspects associated with poor mental health in a sample of prehospital emergency professionals.

BACKGROUND: The goal of this paper is to investigate the respective influence of work characteristics, the effort-reward ratio, and overcommitment on the poor mental health of out-of-hospital care providers. METHODS: 333 out-of-hospital care providers answered a questionnaire that included queries on mental health (GHQ-12), demographics, health-related information and work characteristics, questions from the Effort-Reward Imbalance Questionnaire, and items about overcommitment. A two-level multiple regression was performed between mental health (the dependent variable) and the effort-reward ratio, the overcommitment score, weekly number of interventions, percentage of non-prehospital transport of patients out of total missions, gender, and age. Participants were first-level units, and ambulance services were second-level units. We also shadowed ambulance personnel for a total of 416 hr. RESULTS: With cutoff points of 2/3 and 3/4 positive answers on the GHQ-12, the percentages of potential cases with poor mental health were 20% and 15%, respectively. The effort-reward ratio was associated with poor mental health (P < 0.001), irrespective of age or gender. Overcommitment was associated with poor mental health; this association was stronger in women (β = 0.054) than in men (β = 0.020). The percentage of prehospital missions out of total missions was only associated with poor mental health at the individual level. CONCLUSIONS: Emergency medical services should pay attention to the way employees perceive their efforts and the rewarding aspects of their work: an imbalance of those aspects is associated with poor mental health. Low perceived esteem appeared particularly associated with poor mental health. This suggests that supervisors of emergency medical services should enhance the value of their employees' work. Employees with overcommitment should also receive appropriate consideration. Preventive measures should target individual perceptions of effort and reward in order to improve mental health in prehospital care providers.

Fluctuations in domain growth: Ginzburg-Landau equations with multiplicative noise

Ginzburg-Landau equations with multiplicative noise are considered, to study the effects of fluctuations in domain growth. The equations are derived from a coarse-grained methodology and expressions for the resulting concentration-dependent diffusion coefficients are proposed. The multiplicative noise gives contributions to the Cahn-Hilliard linear-stability analysis. In particular, it introduces a delay in the domain-growth dynamics.

Numerical algorithm for Ginzburg-Landau equations with multiplicative noise: Application to domain growth

We consider stochastic partial differential equations with multiplicative noise. We derive an algorithm for the computer simulation of these equations. The algorithm is applied to study domain growth of a model with a conserved order parameter. The numerical results corroborate previous analytical predictions obtained by linear analysis.

System-level Support for Mobile Ad hoc Communications: an Algorithmic & Practical Approach

A mobile ad hoc network (MANET) is a decentralized and infrastructure-less network. This thesis aims to provide support at the system-level for developers of applications or protocols in such networks. To do this, we propose contributions in both the algorithmic realm and in the practical realm. In the algorithmic realm, we contribute to the field by proposing different context-aware broadcast and multicast algorithms in MANETs, namely six-shot broadcast, six-shot multicast, PLAN-B and ageneric algorithmic approach to optimize the power consumption of existing algorithms. For each algorithm we propose, we compare it to existing algorithms that are either probabilistic or context-aware, and then we evaluate their performance based on simulations. We demonstrate that in some cases, context-aware information, such as location or signal-strength, can improve the effciency. In the practical realm, we propose a testbed framework, namely ManetLab, to implement and to deploy MANET-specific protocols, and to evaluate their performance. This testbed framework aims to increase the accuracy of performance evaluation compared to simulations, while keeping the ease of use offered by the simulators to reproduce a performance evaluation. By evaluating the performance of different probabilistic algorithms with ManetLab, we observe that both simulations and testbeds should be used in a complementary way. In addition to the above original contributions, we also provide two surveys about system-level support for ad hoc communications in order to establish a state of the art. The first is about existing broadcast algorithms and the second is about existing middleware solutions and the way they deal with privacy and especially with location privacy. - Un réseau mobile ad hoc (MANET) est un réseau avec une architecture décentralisée et sans infrastructure. Cette thèse vise à fournir un support adéquat, au niveau système, aux développeurs d'applications ou de protocoles dans de tels réseaux. Dans ce but, nous proposons des contributions à la fois dans le domaine de l'algorithmique et dans celui de la pratique. Nous contribuons au domaine algorithmique en proposant différents algorithmes de diffusion dans les MANETs, algorithmes qui sont sensibles au contexte, à savoir six-shot broadcast,six-shot multicast, PLAN-B ainsi qu'une approche générique permettant d'optimiser la consommation d'énergie de ces algorithmes. Pour chaque algorithme que nous proposons, nous le comparons à des algorithmes existants qui sont soit probabilistes, soit sensibles au contexte, puis nous évaluons leurs performances sur la base de simulations. Nous montrons que, dans certains cas, des informations liées au contexte, telles que la localisation ou l'intensité du signal, peuvent améliorer l'efficience de ces algorithmes. Sur le plan pratique, nous proposons une plateforme logicielle pour la création de bancs d'essai, intitulé ManetLab, permettant d'implémenter, et de déployer des protocoles spécifiques aux MANETs, de sorte à évaluer leur performance. Cet outil logiciel vise à accroître la précision desévaluations de performance comparativement à celles fournies par des simulations, tout en conservant la facilité d'utilisation offerte par les simulateurs pour reproduire uneévaluation de performance. En évaluant les performances de différents algorithmes probabilistes avec ManetLab, nous observons que simulateurs et bancs d'essai doivent être utilisés de manière complémentaire. En plus de ces contributions principales, nous fournissons également deux états de l'art au sujet du support nécessaire pour les communications ad hoc. Le premier porte sur les algorithmes de diffusion existants et le second sur les solutions de type middleware existantes et la façon dont elles traitent de la confidentialité, en particulier celle de la localisation.

Quantum nonlocality in two three-level systems

Recently a new Bell inequality has been introduced by Collins et al. [Phys. Rev. Lett. 88, 040404 (2002)], which is strongly resistant to noise for maximally entangled states of two d-dimensional quantum systems. We prove that a larger violation, or equivalently a stronger resistance to noise, is found for a nonmaximally entangled state. It is shown that the resistance to noise is not a good measure of nonlocality and we introduce some other possible measures. The nonmaximally entangled state turns out to be more robust also for these alternative measures. From these results it follows that two von Neumann measurements per party may be not optimal for detecting nonlocality. For d=3,4, we point out some connections between this inequality and distillability. Indeed, we demonstrate that any state violating it, with the optimal von Neumann settings, is distillable.

Temperature-induced resonances and Landau damping of collective modes in Bose-Einstein condensed gases in spherical traps

Interaction between collective monopole oscillations of a trapped Bose-Einstein condensate and thermal excitations is investigated by means of perturbation theory. We assume spherical symmetry to calculate the matrix elements by solving the linearized Gross-Pitaevskii equations. We use them to study the resonances of the condensate induced by temperature when an external perturbation of the trapping frequency is applied and to calculate the Landau damping of the oscillations.

Landau damping of transverse quadrupole oscillations of an elongated Bose-Einstein condensate

We have studied the interaction between the low-lying transverse collective oscillations and the thermal excitations of an elongated Bose-Einstein condensate by means of perturbation theory. We consider a cylindrical trapped condensate and calculate the transverse elementary excitations at zero temperature by solving the linearized Gross-Pitaevskii equations in two dimensions (2D). We use them to calculate the matrix elements between the thermal excited states and the quasi-2D collective modes. The Landau damping of transverse collective modes is studied as a function of temperature. At low temperatures, the corresponding damping rate is in agreement with the experimental data for the decay of the transverse quadrupole mode, but it is too small to explain the observed slow decay of the transverse breathing mode. The reason for this discrepancy is discussed.

Reentrant transition induced by multiplictative noise in the Time Dependent Ginzburg-Landau model

An effect of multiplicative noise in the time-dependent Ginzburg-Landau model is reported, namely, that noise at a relatively low intensity induces a phase transition towards an ordered state, whereas strong noise plays a destructive role, driving the system back to its disordered state through a reentrant phase transition. The phase diagram is calculated analytically using a mean-field theory and a more sophisticated approach and is compared with the results from extensive numerical simulations.

Improving telecommunication security level by integrating quantum key distribution in communication protocols

Résumé La cryptographie classique est basée sur des concepts mathématiques dont la sécurité dépend de la complexité du calcul de l'inverse des fonctions. Ce type de chiffrement est à la merci de la puissance de calcul des ordinateurs ainsi que la découverte d'algorithme permettant le calcul des inverses de certaines fonctions mathématiques en un temps «raisonnable ». L'utilisation d'un procédé dont la sécurité est scientifiquement prouvée s'avère donc indispensable surtout les échanges critiques (systèmes bancaires, gouvernements,...). La cryptographie quantique répond à ce besoin. En effet, sa sécurité est basée sur des lois de la physique quantique lui assurant un fonctionnement inconditionnellement sécurisé. Toutefois, l'application et l'intégration de la cryptographie quantique sont un souci pour les développeurs de ce type de solution. Cette thèse justifie la nécessité de l'utilisation de la cryptographie quantique. Elle montre que le coût engendré par le déploiement de cette solution est justifié. Elle propose un mécanisme simple et réalisable d'intégration de la cryptographie quantique dans des protocoles de communication largement utilisés comme les protocoles PPP, IPSec et le protocole 802.1li. Des scénarios d'application illustrent la faisabilité de ces solutions. Une méthodologie d'évaluation, selon les critères communs, des solutions basées sur la cryptographie quantique est également proposée dans ce document. Abstract Classical cryptography is based on mathematical functions. The robustness of a cryptosystem essentially depends on the difficulty of computing the inverse of its one-way function. There is no mathematical proof that establishes whether it is impossible to find the inverse of a given one-way function. Therefore, it is mandatory to use a cryptosystem whose security is scientifically proven (especially for banking, governments, etc.). On the other hand, the security of quantum cryptography can be formally demonstrated. In fact, its security is based on the laws of physics that assure the unconditional security. How is it possible to use and integrate quantum cryptography into existing solutions? This thesis proposes a method to integrate quantum cryptography into existing communication protocols like PPP, IPSec and the 802.l1i protocol. It sketches out some possible scenarios in order to prove the feasibility and to estimate the cost of such scenarios. Directives and checkpoints are given to help in certifying quantum cryptography solutions according to Common Criteria.

On-axis joint transform correlation based on a four-level power spectrum

We propose a method to obtain a single centered correlation with use of a joint transform correlator. We analyze the required setup to carry out the whole process optically, and we also present experimental results.

Effects of thresholding level variation in fringe binarization of multiobject joint transform correlation

It is possible to improve the fringe binarization method of joint transform correlation by choosing a suitable threshold level.