In this research, Communicative Accommodation Theory (CAT) is investigated while native speakers address nonnative peers. For the intentions of this research, three native speakers of Canadian English were asked to have conversations with native and nonnative peers. The conversations were in the form of giving directions on the map. Later on, the participants’ formants and vowel durations were measured and used for comparing native-nonnative peer effect(s) on the speakers’ vowel formants and duration. Based on the analyses, it is suggested that accommodation may take place based on providing stereotypical vowel durations and formants, as well as reducing inter-token variations in the nonnative peer context.

Ce manuscrit de thèse rapporte quelques études méthodologiques sur la régionalisation du climat par l’approche dynamique. Le domaine géographique couvre une large zone allant du milieu de l’Atlantique Nord à l’Europe de l’Est, et du Sahel à l’Arctique. La quête à tout prix d’une amélioration du climat régional n’est pas au cœur du manuscrit. Pourtant, l’accent est mis sur trois points clefs, généralement rencontrés par toutes tentatives de régionalisation du climat. Le premier point concerne le schéma d’imbrication : imbrication du sens unidirectionnel du GCM vers le RCM (one-way nesting, OWN) ou bidirectionnelle entre le GCM et le RCM (two-way nesting, TWN). Le deuxième point examine la réalisation technique d’imbrication, qui est généralement une opération de relaxation newtonienne ajoutée aux équations pronostiques du modèle. Le troisième point est sur l’effet du raffinement de maille dans le RCM. L’esprit général du manuscrit consiste à conceptualiser et réaliser des simulations numériques pour traiter ces trois points avec astuces afin de les isoler et quantifier. Le modèle de circulation générale LMDZ est utilisé pour l’ensemble des expériences. Il joue à la fois le rôle du GCM et celui du RCM. Dans les deux cas, il conserve strictement ses paramétrisations physique et sa configuration dynamique, ainsi que tous les forçages ou paramètres externes. La stratégie d’expérimentation, qualifiée comme Master versus Slave, consiste à réaliser des simulations sous deux protocoles reliés l’un et l’autre : « DS-300-to-300 » désigne Downscaling du GCM à 300 km de résolution horizontale au RCM qui est identique au GCM, aussi à 300 km de résolution spatiale ; « DS-300-to-100 » désigne Downscaling de 300 km (GCM) à 100 km (RCM). Il est clair que « DS-300-to-300 » est un cadre idéalisé, particulièrement approprié pour évaluer l’effet de l’opération de relaxation. Le protocole « DS-300-to-100 », soustrait du « DS-300-to-300 », permet d’évaluer très précisément l’effet de la résolution du RCM augmentée. Dans chaque protocole, deux schémas de communication entre le RCM et le GCM ont été implémentés, l’un (OWN) est la méthodologie classique du sens unique qui consiste à piloter le RCM par les sorties du GCM, l’autre (TWN) est d’établir un échange mutuel entre les deux modèles. Le climat régional est sensible au choix des schémas de communication entre le RCM et le GCM, surtout aux moyennes latitudes. TWN apporte une nette amélioration sur la représentation des informations frontalières. Au niveau des modes régionaux de circulation atmosphérique, exprimés en structures d’EOF, OWN et TWN sont tous deux capables de les reproduire, mais avec de légères déformations dans l’espace. La relaxation newtonienne, largement utilisée dans la régionalisation du climat, permet au RCM de bien suivre la trajectoire synoptique du GCM. Pourtant, la concomitance temporelle et la ressemblance spatiale sont dépendantes des variables considérées, des saisons, des régimes de temps, et des échelles spatio-temporelles de circulations atmosphériques. Des cas de dé-corrélation sont remarquables quand la circulation dominante de la région est de petites échelles. Le raffinement de maille augmente la liberté du RCM à développer sa dynamique interne, surtout aux petites échelles, mais aussi à l’ensemble du spectre de la circulation à travers l’interaction des échelles. Ainsi le RCM devient plus indépendant et s’écarte davantage du GCM. Cette thèse, autour des aspects méthodologiques de la régionalisation du climat, aide à avoir une meilleure compréhension sur la pratique. Elle adresse aussi un message de précaution à la communauté RCM et l’invite à bien vérifier leur méthodologie de régionalisation. / The work developed in this thesis explores through methodological modelling studies the current techniques of climate regionalization. In this case, the regionalization focuses on a geographical domain covering from the North Atlantic to Eastern Europe longitudinal wise, and from the Sahel to the Arctic as a latitudinal interval. The aim of this thesis is not the improvement of regional climate modelling per se, but tackling three key questions that are commonly met by all attempts when trying to improve climate regionalization. Firstly, the choice and advantages of the nesting scheme: one-way nesting (OWN) versus two-way nesting (TWN). Secondly, the evaluation of the nesting method, which is generally a Newtonian relaxation operation added to the prognostic equations of the model. And finally, the consequences of the mesh refinement in Regional Circulation Models (RCM). The objective of this manuscript consists in conceptualizing and carrying out numerical simulations to answer these three questions by isolating each individual effect and quantifying the consequences of each of the effects. The general circulation model LMDZ is used for all experiments. It is able to play the role of the General Circulation Model (GCM) and the RCM, keeping the same physical parameterizations and the same dynamical configuration, as well as the same external forcings and model parameters. Our experimental set-up, referred as “Master versus Slave”, consists on two related protocols: “DS-300-to-300” and “DS-300-to-100”. The former implies the downscaling of the GCM at 300 km of horizontal resolution while the RCM has the identical resolution of 300 km. The latter implies the downscaling from 300 km (GCM) to 100 km (RCM). We have assumed the “DS-300-to-300” as an idealized framework, particularly appropriate to evaluate the relaxation operation effect. In parallel, the “DS-300-to-100” protocol, subtracted from the “DS-300-to-300”, allows assessing the effect of the increased resolution for the RCM. In each protocol, two communication schemes between the RCM and the GCM have been implemented. The first one -OWN- is the classic one-way methodology to control the RCM by the outputs of the GCM. The second one -TWN- is used to establish a mutual exchange between the two models (RCM and GCM). This thesis has found that climate regionalization is highly sensitive to the choice of the communication scheme between the RCM and the GCM, especially at mid-latitudes. TWN clearly improves the representation at the boundaries. For the regional atmospheric circulation modes, expressed in EOF structures, both OWN and TWN are able to reproduce them, but with a slight deformation in space. Newtonian relaxation, widely used in climate regionalization, allows the RCM to follow the GCM’s synoptic trajectory. However, temporal concomitance and spatial resemblance of the two depend on the variables considered, on the particular seasons selected, on the weather regimes, and on the spatiotemporal scales of atmospheric circulation. De-correlation cases are remarkable when the dominant circulation on a regional scale is small. Moreover, mesh refinement increases the freedom of the RCM to develop its internal dynamic circulation, especially at small scales, and also across the whole spectrum of circulation regimes through the scales in which the RCM operates. Thus, when resolution increases, the RCM becomes more independent from the GCM behavior and the model results deviate significantly from the GCM. Focused on the methodological aspects of climate regionalization, this thesis helps to gain a better understanding on the regionalization practice. Il also sends a precautionary message to the RCM community, kindly inviting to verify their regionalization strategy.

This work extends a previously developed finite-volume overset-grid fluid flow solver to enable the characterisation of rigid-body-fluid interaction problems. To this end, several essential components have been developed and blended together. The inherent time-dependent nature of fluid-solid interaction problems is captured through the laminar transient incompressible Navier-Stokes equations for the fluid, and the Euler-Newton equations for rigid-body motion. First and second order accurate time discretisation schemes have been implemented for the former, whereas second and third order accurate time discretisation schemes have been made available for the latter. Without doubt the main advantage the overset-grid method offers regarding moving entities is the avoidance of the time consuming grid regeneration step, and the resulting grid distortion that can often cause numerical stability problems in the solution of the flow equations. Instead, body movement is achieved by the relative motion of a body fitted grid over a suitable background mesh. In this case, the governing equations of fluid flow are formulated using a Lagrangian, Eulerian, or hybrid flow description via the Arbitrary Lagrangian-Eulerian method. This entails the need to guarantee that mesh motion shall not disturb the flow field. With this in mind, the space conservation law has been hard-coded. The compliance of the space conservation law has the added benefit of preventing spurious mass sources from appearing due to mesh deformation. In this work, two-way fluid-solid interaction problems are solved via a partitioned approach. Coupling is achieved by implementing a Picard iteration algorithm. This allows for flexible degree of coupling specificationby the user. Furthermore, if strong coupling is desired, three variants of interface under-relaxation can be chosen to mitigate stability issues and to accelerate convergence. These include fixed, or two variants of Aitken’s adaptive under-relaxation factors. The software also allows to solve for one-way fluid-solid interaction problems in which the motion of the solid is prescribed. Verification of the core individual components of the software is carried out through the powerful method of manufactured solutions (MMS). This purely mathematically based exercise provides a picture of the order of accuracy of the implementation, and serves as a filter for coding errors which can be virtually impossible to detect by other means. Three instances of one-way fluid-solid interaction cases are compared with simulation results either from the literature, or from the OpenFOAM package. These include: flow within a piston cylinder assembly, flow induced by two oscillating cylinders, and flow induced by two rectangular plates exhibiting general planar motion. Three cases pertaining to the class of two-way fluid-interaction problems are presented. The flow generated by the free fall of a cylinder under the action of gravity is computed with the aid of an intermediate ‘motion tracking’ grid. The solution is compared with the one obtained using a vorticity based particle solver for validation purposes. Transverse vortex induced vibrations (VIV) of a circular cylinder immersed in a fluid, and subject to a stream are compared with experimental data. Finally, the fluttering motion of a rectangular plate under different scenarios is analysed.

xvi, 176 p. : ill. (some col.) / The research presented in this dissertation aims to contribute to the field of atom optics via the implementation and demonstration of an all-optical one-way barrier for 87 Rb atoms--a novel tool for controlling atomic motion. This barrier--a type of atomic turnstile--transmits atoms traveling in one direction but hinders their passage in the other direction. We create the barrier with two laser beams, generating its unidirectional behavior by exploiting the two hyperfine ground states of 87 Rb. In particular, we judiciously choose the frequency of one beam to present a potential well to atoms in one ground state (the transmitting state) and a potential barrier to atoms in the other state (the reflecting state). The second beam optically pumps the atoms from the transmitting state to the reflecting state. A significant component of the experimental work presented here involves generating ultra-cold rubidium atoms for demonstrating the one-way barrier. To this end, we have designed and constructed a sophisticated 87 Rb cooling and trapping apparatus. This apparatus comprises an extensive ultra-high vacuum system, four home-built, frequency-stabilized diode laser systems, a high-power Yb:fiber laser, a multitude of supporting optics, and substantial timing and control electronics. This system allows us to cool and trap rubidium atoms at a temperature of about 30 μK. The results presented in this dissertation are summarized as follows. We successfully implemented a one-way barrier for neutral atoms and demonstrated its asymmetric nature. We used this new tool to compress the phase-space volume of an atomic sample and examined its significance as a physical realization of Maxwell's demon. We also demonstrated the robustness of the barrier's functionality to variations in several important experimental parameters. Lastly, we demonstrated the barrier's ability to cool an atomic sample, substantiating its potential application as a new cooling tool. This dissertation includes previously published coauthored material. / Committee in charge: Dr. Hailin Wang, Chair; Dr. Daniel A. Steck, Research Advisor; Dr. Jens U. Nockel; Dr. David M. Strom; Dr. Jeffrey A. Cina

Cette thèse a eu pour objectif d'étudier des questions naturelles de définissabilité autour des transducteurs bidirectionnels.Il est bien connu que les transducteurs bidirectionnels définissent une plus grande classe de transductions que celles des transducteurs unidirectionnels. La première question que nous avons étudiée est donc de décider si un transducteur bidirectionnel est définissable par un transducteur unidirectionnel. Il a été montré en 2013 que cette question est décidable pour des transducteurs fonctionnels (nous montrons aussi en paralèlle que cette question devient indécidable si les transducteurs ne sont plus fonctionnels) mais la complexité de la procédure de décision était non-élémentaire.Nous proposons une caractérisation de la "définissabilité par transducteur unidirectionnel" décidable en espace doublement exponentiel. Cette caractérisation est effective en ce sens qu'elle produit en temps triplement exponentiel le transducteur équivalent. De plus, nous avons étudié ce problème aussi pour les transducteurs "sweeping", pour lesquels la procédure de décision et la construction du transducteur équivalent requièrent une exponentielle de moins. Comme nous avons par ailleurs montré qu'il existe des familles de fonctions réalisables de façon unidirectionnelle avec au minimum deux sauts exponentiels, notre procédure est optimale dans le cas "sweeping".Le fait d'avoir particulièrement étudié les transducteurs"sweeping" nous a poussé à étudier d'autres questions dedéfinissabilité~: est-ce qu'un transducteur donné estréalisable par un transducteur sweeping ? Et par un transducteursweeping réalisant au maximum k passages ? Nous montrons que cesquestions sont décidables avec les mêmes complexitésobtenues précédemment. Comme nous avons montré qu'ilexiste une borne sur le nombre de passages nécéssaires pourréaliser avec un transducteur sweeping une transductiondonnée, cela nous permet aussi de minimiser le nombre de passages d'untransducteur sweeping.Enfin nous avons cherché à caractériser la classe destransductions sweeping dans d'autres modèles de transductions,les Streaming String Transducers (SST) et lestransductions MSO. Cela a en autres permis, en établissant unecorrespondance entre le nombre de passages des transducteurssweeping et le nombre de registres d'une sous-classe de SST, deminimiser le nombre de registres pour une classe intéressantede SST. Dans l'ensemble, notre travail a permis de couvrir l'ensembledes relations entre ces modèles, et les questions dedéfinissabilité qui se posent naturellement. / The goal of this thesis was to study definability questionsabout finite-state transducers and in particular two-waytransducers. It is known that two-way transducers cover a larger classof transductions than one-way transducers. Then the first question wetackled is the one-way definability problem: is it possible torealize a given two-way transduction by a one-way transducer? Thisproblem was shown to be decidable for functionaltransducers (we also show as a side result that one-way definability becomes undecidable for non-functional transducers) but the decision procedure had non-elementary complexity.We proposed a characterization of one-way definability thatallows us to decide it in double-exponential space, and provide anequivalent one-way transducer of triple-exponential size. We firststudied this question for a restricted class, namely sweepingtransducers, for which the decision procedure and the construction ofthe one-way transducer take one less exponential. For suchtransducers, our procedure is optimal in the sense that we have shownthat there exists a family of functions that are one-way definable andfor which an equivalent one-way transducer requires doubly exponentialsize.The study of sweeping transducers raised other definability questions: Is a given transducer equivalent to some sweeping transducer? And to some sweeping transducer that performs at most k passes? We showed that those questions are decidable and the decision procedure, as well as the equivalent transducer, have the same complexity as in the one-way case. Moreover, as we have shown that there exists a bound on the number of passes required to realize a transduction by a sweeping transducer, we managed to obtain a procedure to minimize the number of passes of a sweeping transducer.Finally we tried to characterize sweeping transducers in other models for regular transductions such as Streaming String transducers (SST) and MSO transductions. As we obtained an equivalence between the number of passes of a sweeping transducer and the number of registers of the equivalent SST we provided a minimization procedure for the number of registers of a large class of SST's. To conclude, our work allowed us to provide a good overall understanding of the definability questions between the models for regular transductions and in particular regarding the resources, whether it is the number of passes (and of course one-way definability is crucial in that aspect) or the number of registers.

This work deals with the structural solution of reinforced concrete floor slab, deep beam and its support of multipurpose building. The structure is designed and assessed in according to valid standards. The continuous one-way slab is analyzed by Finite Element Method, deep beam is solved by Strut-and-Tie model.

Members of the Instructional Teleconference Consortium (ITC) were mailed a survey instrument. A total list of 375 teleconference coordinators generated 137 usable responses. The purposes of this study of faculty and staff development presentations by teleconferencing were to determine the amount of usage; which subject areas are utilized; what delivery methods (live, interactive, prerecorded, multimedia, etc.) are utilized; barriers (size or location of college, size of teleconference or travel budget, etc.) to implementing teleconferences; and the sources of presentations utilized in teleconferences. Larger community colleges are the greater users of teleconferencing and even produce some for distribution to other community colleges, whereas smaller community colleges have just begun to receive equipment that enables them to receive telecasts for this purpose. No clear subject area has yet been defined that dominates these teleconferences, and the trend is toward two-way audio and one-way video as the delivery media as communication costs decline. Barriers of money for staff, equipment, and programming appear to be the principal objections to the use of teleconferencing for faculty and staff development presentations. There appear to be few sources of presentations except for the Public Broadcasting System (PBS).

Cette thèse s'intéresse à la conception optimale d'un système d'autopartage de type one-way avec stations. Les problèmes abordés traitent de deux aspects structurels importants : le dimensionnement optimal du système (nombre de places de parking, de véhicules, de relocalisation de véhicules, etc.) et la localisation adéquate des stations. Bien que le management ou pilotage en temps réel du service ne soit pas l'objet de cette étude, certains aspects pertinents (relocalisation de véhicules, nombre de jockeys) ont toutefois été intégrés aux modèles. L'approche mathématique utilise des objets de la théorie des graphes pour représenter les systèmes dans le temps et les problèmes sont résolus grâce à la programmation linéaire en nombre entiers. L'objectif est d'identifier la structure du service permettant de capturer le plus de demandes possibles. L'introduction de véhicules électriques et de la puissance de charge en station sont étudiés dans un modèle dédié. Les expérimentations s'appuient sur des données réalistes, générées aléatoirement. Nous nous intéressons particulièrement aux pistes d'amélioration des temps de calculs et de réduction des graphes. Une heuristique gloutonne permettant d'identifier rapidement une solution réalisable est en particulier proposée. Enfin, une étude de dimensionnement des batteries confirme que des capacités deux fois inférieures à celles actuellement sur le marché sont viable dans le contexte urbain actuel. / This thesis focuses on the optimal design of one-way station-based carsharing systems. We consider the system design through two structural aspects: the optimal system dimensioning (number of parking places, vehicles, battery capacities, etc.) and the identification of appropriate stations’ locations. Although the addressed problems do not directly concern the system management, some relevant aspects (like vehicle relocation operations) are nonetheless part of the models. The modelling approach uses graph theory to represent the system dynamics over time and various optimization models (ILPs and MILPs) are proposed. The objective is to deduce an optimal shape of the whole system (number of vehicles, parking places, jockeys, stations’ locations, etc.) allowing to capture the maximum number of estimated time-dependent requests. Electric vehicles and power supply are also included in an enhanced model version and context related constraints ensure the integrity of the whole model. The optimization allows to study the impact of different power supply technologies and settle the minimal autonomy a shared vehicle necessitate in this environment. Models are applied to realistic case studies, using both random generated data and real estimated outputs of simulation tools. Strategies including vehicle relocation operations managed by jockeys (employees of the carsharing operator) are considered. We propose some graph simplifications reducing the problem size and leading to greatly improve solver capabilities as well as computation times. A greedy heuristic helping to quickly find feasible solutions and initialize the solver is also proposed and illustrated.

No description available.

In this dissertation, new approaches that utilize the one-way cryptographic hash functions in designing improved network security protocols are investigated. The proposed approaches are designed to be scalable and easy to implement in modern technology. The first contribution explores session cookies with emphasis on the threat of session hijacking attacks resulting from session cookie theft or sniffing. In the proposed scheme, these cookies are replaced by easily computed authentication credentials using Lamport's well-known one-time passwords. The basic idea in this scheme revolves around utilizing sparse caching units, where authentication credentials pertaining to cookies are stored and fetched once needed, thereby, mitigating computational overhead generally associated with one-way hash constructions. The second and third proposed schemes rely on dividing the one-way hash construction into a hierarchical two-tier construction. Each tier component is responsible for some aspect of authentication generated by using two different hash functions. By utilizing different cryptographic hash functions arranged in two tiers, the hierarchical two-tier protocol (our second contribution) gives significant performance improvement over previously proposed solutions for securing Internet cookies. Through indexing authentication credentials by their position within the hash chain in a multi-dimensional chain, the third contribution achieves improved performance. In the fourth proposed scheme, an attempt is made to apply the one-way hash construction to achieve user and broadcast authentication in wireless sensor networks. Due to known energy and memory constraints, the one-way hash scheme is modified to mitigate computational overhead so it can be easily applied in this particular setting. The fifth scheme tries to reap the benefits of the sparse cache-supported scheme and the hierarchical scheme. The resulting hybrid approach achieves efficient performance at the lowest cost of caching possible. In the sixth proposal, an authentication scheme tailored for the multi-server single sign-on (SSO) environment is presented. The scheme utilizes the one-way hash construction in a Merkle Hash Tree and a hash calendar to avoid impersonation and session hijacking attacks. The scheme also explores the optimal configuration of the one-way hash chain in this particular environment. All the proposed protocols are validated by extensive experimental analyses. These analyses are obtained by running simulations depicting the many scenarios envisioned. Additionally, these simulations are supported by relevant analytical models derived by mathematical formulas taking into consideration the environment under investigation.