No description available.

The establishment of dense nesting cover (DNC) for breeding waterfowl is a common management practice on large blocks of former agricultural land. The Delta Waterfowl Foundation's Adopt-A-Pothole (AAP) program establishes DNC adjacent to small wetland complexes to increase waterfowl use and productivity. I evaluated waterfowl use and nesting success on AAP lease sites in southwestern Manitoba in 993- 94 and compared the relative amount and success of overwater and upland nesting by mallards using these sites. Diving duck breeding pair densities were higher on treatment sites in both 1993 and 1994 (P= 0.02 and 0.02, respectively). Dabbling duck breeding pair densities did not differ between sites. Upland nesting success did not differ between control and treatment sites in 1993 (P = 0.16) and was higher on control sites in 1994 (P= 0.02). Overwater nesting success did not differ between treatment and control sites in 1993 or 1994 (P = 0.66 and 0.08, respectively). Brood use was difficult to quantify because of high water levels in both years. Overwater nests comprised 31% (n = 58) of the total mallard (Anas platyrhynchos) nests found in 1993-94. Mallard overwater and upland nest success was not different (P = 0.39). Mallards nested in shallower water than ruddy ducks (Oxyura jamaicensis), canvasback (Aythya valisineria), and redhead (A. americana) (P < 0.0005). Mallards nested closer to shore than redheads (P = 0.02). Ruddy duck and canvasback daily survival rates were highest, followed by redhead and mallard (P = 0.06 to 0.18). Overwater nests located in < 30 cm of water were predated more often than expected (P < 0.0025). Deeper water may provide greater security from predators for overwater nesting ducks than shallower water. The importance of overwater nesting by mallards probably varies regionally and annually. Wetlands, primarily seasonal and semi-permanent, appear to provide attractive mallard nesting habitat. The establishment of DNC adjacent to small wetland complexes located in agriculturally dominated landscapes may provide relatively secure and attractive waterfowl nesting habitat. However, other factors, including the presence and abundance of potential nest predators, may influence the effectiveness of this practice.

In 5G systems, two radio air interfaces, evolved LTE and New Radio (NR), will coexist. By using millimeter waves, NR will provide high throughputs, but the higher frequencies will also lead to increased losses and a worse coverage. Multi-connectivity is therefore envisioned as a way to tackle these effects by connecting to multiple base stations simultaneously, allowing users to benefit from both air interfaces’ advantages. In this thesis, we investigate how multi-connectivity can be used efficiently in ultra-dense networks, a new paradigm in which the number of access nodes exceeds the number of users within the network. A framework for secondary cell association is presented and an energy efficiency’s condition is proposed. Upper and lower bounds of the network’s energy efficiency are analytically expressed. Algorithms for secondary cell selection are designed and evaluated through simulations. Multi-connectivity showed an improvement of up to 50% in reliability and and an increase of up to 20% in energy efficiency.

La formation des étoiles massives reste, à ce jour, encore mal connue à cause de l'extrême quantité d'énergie que ces étoiles dégagent, limitant en conséquence leurs masses théoriques et contredisant les observations de ce type d'étoile. Les observatoires du futur (en particulier l'observatoire spatial Herschel) vont tenter de répondre à cette problématique grâce notamment aux émissions moléculaires de l'eau. L'analyse précise et correcte de ces données, dans l'avenir, nécessite donc dès aujourd'hui un travail associant des observations et des modélisations des objets concernés. C'est dans ce but que cette thèse a consisté en l'élaboration d'une méthode de modélisation dite « globale » d'objets proto-stellaires massifs (proto-amas ou cœurs denses massifs). Celle-ci a permis une description physique et une étude chimique des multiples cœurs denses massifs étudiées, et a ouvert de nombreuses voies vers des aspects évolutifs. Elle a également donné des indices pour affiner le programme d'observation en temps garanti WISH des raies moléculaires de l'eau et confirmé le rôle clef de cette molécule pour la compréhension de la formation des étoiles massives.

This thesis presents an accurate study about the fluid-dynamics of dense gases and their potential application as working fluids in Organic Rankine Cycles (ORCs). The ORCs are similar to a steam Rankine Cycle where an organic fluid is used instead of steam, which ensures better efficiency for low-temperature sources. Specific interest is developed into a particular class of dense gases, the Bethe-Zel'dovich-Thompson (BZT) fluids, which exhibit negative values of the Fundamental Derivative of Gasdynamics G in the vapor phase , for a range of temperatures and pressures of the order of magnitude of those of the liquid/vapor critical point, just above the upper coexistence curve. Transonic and supersonic flows in a region of negative G are characterized by nonclassical gasdynamic behaviors, such as the disintegration of compression shocks. Owing to this effect, the use of BZT gases as working fluids in ORCs is particularly attractive, since it may reduce losses due to wave drag and shock/boundary layer interactions. This advantage can be further improved by a proper design of the turbine blade. The present work is devoted to improve the understanding of the peculiar fluid-dynamic behavior of dense gases with respect perfect ones and to the research of suitable aerodynamic shapes. To this purpose, a dense-gas Navier-Stokes (NS) numerical solver is coupled with a multi-objective genetic algorithm. The Navier-Stokes solver employs equations of state of high accuracy within the thermodynamic region of interest and suitable thermophysical models for the fluid viscosity and thermal conductivity. Different computations are performed for transonic flows over isolated airfoils and through turbine cascades to evaluate the influence of the upstream kinematic and thermodynamic conditions on the flow patterns and the system efficiency, and possible advantages deriving from the use of a non-conventional working fluid are pointed out. Then, high performance airfoils and turbine blade shapes for transonic flows of BZT fluids are constructed using the CFD solver coupled with a multi-objective genetic algorithm. Shape optimization allows to strongly increase flow critical Mach Number, delaying the appearance of shock waves, while ensuring high lift (for an airfoil) and efficiency. A careful analysis of the convergence behavior of Genetic Algorithms has also been undertaken by means of statistical tools. Genetic Algorithm exhibit a marked sensitivity to the shape of the response surface and to its numerical representation. Some strategies are proposed to systematically evaluate GAs convergence capabilities for a given problem and to enhance their convergence properties for dense gas optimization problems.

Cette thèse se place dans un cadre de reconstruction urbaine et propose un corpus algorithmique pour extraire des formes simples sur les Modèles Numériques d'Elévation. Ce type de données décrit le relief d'une zone urbaine par une grille régulière de points à chacun desquels est associée une information de hauteur. Les modèles utilisés reposent sur l'utilisation de processus ponctuels marqués. Il s'agit de variables aléatoires dont les réalisations sont des configurations d'objets géométriques. Ces modèles permettent d'introduire des contraintes sur la forme des objets recherchés dans une image ainsi qu'un terme de régularisation modélisé par des interactions entre les objets. Une énergie peut être associée aux configurations d'objets et la configuration minimisant cette énergie trouvée au moyen d'un recuit-simulé couplé à un échantillonneur de type Monte Carlo par Chaîne de Markov à sauts réversibles (RJMCMC). Nous proposons quatre modèles pour extraire des caricatures de bâtiments à partir de descriptions altimétriques de zones urbaines denses. Chaque modèle est constitué par une forme d'objet, une énergie d'attache aux données et une énergie de régularisation. Les deux premiers modèles permettent d'extraire des formes simples (rectangles) en utilisant une contrainte d'homogénéité pour l'un et une détection des discontinuités pour l'autre. Le troisième modèle modélise les bâtiments par une forme polyhédrique. Le dernier modèle s'intéresse à l'apport d'une coopération entre des objets simples. Les algorithmes obtenus, automatiques, sont évalués sur des données réelles fournies par l'IGN (MNE Laser et optiques de différentes qualités).

<p>Recent algorithms for video coding achieve a high-quality transmission at moderate bit rates. On the other hand, those coders are very sensitive to transmission errors. Many research projects focus on methods to conceal such errors in the decoded video sequence. </p><p>Motion compensated prediction is commonly used in video coding to achieve a high compression ratio. This thesis proposes an algorithm which uses the motion compensated prediction of a given video coder to predict a sequence of several complete frames, based on the last correctly decoded images, during a transmission interruption. The proposed algorithm is evaluated on a video coder which uses a dense motion field for motion compensation. </p><p>A drawback of predicting lost fields is the perceived discontinuity when the decoder switches back from the prediction to a normal mode of operation. Various approaches to reduce this discontinuity are investigated.</p>

Radon-222 gas has unique properties allowing it to be used as an indicator for the presence of organic phase liquids in the saturated zone. It naturally occurs in soils. It is radioactive, making quantitative detection straight forward. A noble gas, it is chemically inert and does not react with aquifer media. Finally, radon has an affinity to concentrate in nonaqueous phase liquids. A proposed linear equilibrium partitioning model was tested by batch equilibration with the pore fluid to establish the deficit in aqueous radon concentrations that results from its partitioning into the residual saturation of the organic phase (Soltrol-220). Five sets of experiments were run on columns with 0.0, 1.0, 2.5, 5.0, and 8.0 percent residual soltrol fractions. The model was found to accurately represent the partitioning process. A one-dimensional physical model was run to see if the data from the partitioning experiments could be successfully applied to predict the aqueous radon concentrations in a more complex situation. The results indicate that radon-222 has great potential to be used as a means of detecting and quantifying the presence of residual organic phase liquids in the saturated zone. / Graduation date: 1995

Thomas J. Fessenden. / Issued also as a thesis, M.I.T. Dept. of Electrical Engineering, April 29, 1961." "August 29, 1961." / Bibliography: p. 50-51. / Army Signal Corps Contract DA36-039-sc-78108. Dept. of the Army Task 3-99-20-001 and Project 3-99-00-000.

We present a set of approximation results for several covering problems in dense graphs. These results show that for several problems, classical algorithms with constant approximation ratios can be analyzed in a finer way, and provide better constant approximation ratios under some density constraints. In particular, we show that the maximal matching heuristic approximates VERTEX COVER (VC) and MINIMUM MAXIMAL MATCHING (MMM) with a constant ratio strictly smaller than 2 when the proportion of edges present in the graph (weak density) is at least 3/4, or when the normalized minimum degree (strong density) is at least 1/2. We also show that this result can be improved by a greedy algorithm which provides a constant ratio smaller than 2 when the weak density is at least 1/2. We also provide tight families of graphs for all these approximation ratios. We then looked at several algorithms from the literature for VC and SET COVER (SC). We present a unified and critical approach to the Karpinski/Zelikovsky, Imamura/Iwama and Bar-Yehuda/Kehat algorithms, identifying the general the general scheme underlying these algorithms. Finally, we look at the CONNECTED VERTEX COVER (CVC) problem,for which we proposed new approximation results in dense graphs. We first analyze Carla Savage's algorithm, then a new variant of the Karpinski-Zelikovsky algorithm. Our results show that these algorithms provide the same approximation ratios for CVC as the maximal matching heuristic and the Karpinski-Zelikovsky algorithm did for VC. We provide tight examples for the ratios guaranteed by both algorithms. We also introduce a new invariant, the "price of connectivity of VC", defined as the ratio between the optimal solutions of CVC and VC, and showed a nearly tight upper bound on its value as a function of the weak density. Our last chapter discusses software aspects, and presents the use of the GRAPHEDRON software in the framework of approximation algorithms, as well as our contributions to the development of this system. / Nous présentons un ensemble de résultats d'approximation pour plusieurs problèmes de couverture dans les graphes denses. Ces résultats montrent que pour plusieurs problèmes, des algorithmes classiques à facteur d'approximation constant peuvent être analysés de manière plus fine, et garantissent de meilleurs facteurs d'aproximation constants sous certaines contraintes de densité. Nous montrons en particulier que l'heuristique du matching maximal approxime les problèmes VERTEX COVER (VC) et MINIMUM MAXIMAL MATCHING (MMM) avec un facteur constant inférieur à 2 quand la proportion d'arêtes présentes dans le graphe (densité faible) est supérieure à 3/4 ou quand le degré minimum normalisé (densité forte) est supérieur à 1/2. Nous montrons également que ce résultat peut être amélioré par un algorithme de type GREEDY, qui fournit un facteur constant inférieur à 2 pour des densités faibles supérieures à 1/2. Nous donnons également des familles de graphes extrémaux pour nos facteurs d'approximation. Nous nous somme ensuite intéressés à plusieurs algorithmes de la littérature pour les problèmes VC et SET COVER (SC). Nous avons présenté une approche unifiée et critique des algorithmes de Karpinski-Zelikovsky, Imamura-Iwama, et Bar-Yehuda-Kehat, identifiant un schéma général dans lequel s'intègrent ces algorithmes. Nous nous sommes finalement intéressés au problème CONNECTED VERTEX COVER (CVC), pour lequel nous avons proposé de nouveaux résultats d'approximation dans les graphes denses, au travers de l'algorithme de Carla Savage d'une part, et d'une nouvelle variante de l'algorithme de Karpinski-Zelikovsky d'autre part. Ces résultats montrent que nous pouvons obtenir pour CVC les mêmes facteurs d'approximation que ceux obtenus pour VC à l'aide de l'heuristique du matching maximal et de l'algorithme de Karpinski-Zelikovsky. Nous montrons également des familles de graphes extrémaux pour les ratios garantis par ces deux algorithmes. Nous avons également étudié un nouvel invariant, le coût de connectivité de VC, défini comme le rapport entre les solutions optimales de CVC et de VC, et montré une borne supérieure sur sa valeur en fonction de la densité faible. Notre dernier chapitre discute d'aspects logiciels, et présente l'utilisation du logiciel GRAPHEDRON dans le cadre des algorithmes d'approximation, ainsi que nos contributions au développement du logiciel.