Flight testing has been the historical standard for determining aircraft airworthiness - however, increases in the cost of flight testing and the accuracy of inexpensive CFD promote certification by analysis to reduce or replace flight testing. A framework is introduced to predict the performance in the special case of a modification to an existing, previously certified aircraft. This framework uses a combination of existing flight test or high fidelity data of the original aircraft as well as lower fidelity data of the original and modified configurations. Two methods are presented which estimate the model form uncertainty of the modified configuration, which is then used to conduct non-deterministic simulations. The framework is applied to an example aircraft system with simulated flight test data to demonstrate the ability to predict the performance and associated uncertainty of modified aircraft configurations. However, it is important that the models and methods used are applicable and accurate throughout the intended use domain. The factors and limitations of the framework are explored to determine the range of applicability of the framework. The effects of these factors on the performance and uncertainty results are demonstrated using the example aircraft system. The framework is then applied to NASA's X-57 Maxwell and each of its modifications. The estimated performance and associated uncertainties are then compared to the airworthiness criteria to evaluate the potential of the framework as a component to the certification by analysis process. / Doctor of Philosophy / Aircraft are required to undergo an airworthiness certification process to demonstrate the capability for safe and controlled flight. This has historically been satisfied by flight testing, but there is a desire to use computational analysis and simulations to reduce the cost and time required. For aircraft which are based on an aircraft which has already been certified, but contain minor changes, computational tools have the potential to provide a large benefit. This research proposes a framework to estimate the flight performance of these modified aircraft using inexpensive computational or ground based methods and without requiring expensive flight testing. The framework is then evaluated to ensure that it provides accurate results and is suitable for use as a supplement to the airworthiness certification process.

ITC/USA 2007 Conference Proceedings / The Forty-Third Annual International Telemetering Conference and Technical Exhibition / October 22-25, 2007 / Riviera Hotel & Convention Center, Las Vegas, Nevada / We discuss how aspects of telemetry can be effectively incorporated and modeled as a component within network-centric operations and warfare paradigms. Telemetry is particularly vital in Air Force Flight Test and Evaluation. As such, this paper has a specific emphasis and provides discussion within this domain. We also present how an existing framework for networkcentric operations and warfare can be particularly beneficial to telemetry modeling, and discuss the potential insights and utility within this context.

The powertrain design and control strategies for three representative hybrid and plug-in hybrid electric vehicles (HEV/PHEVs), a plug-in hybrid passenger car, a plug-in hybrid race car, and a hybrid electric mining truck, have been investigated through the system modeling, simulation and design optimization. First, the pre-transmission gen-set couple Plug-in Series-Parallel Multi-Regime (SPMR) powertrain architecture was selected for PHEV passenger car. Rule-based load following control schemes based on engine optimal control strategy and Equivalent Consumption Minimization Strategy (ECMS) were used for the operation control of the passenger car PHEV powertrain. Secondly, the rear wheel drive (RWD) post-transmission parallel through road powertrain architecture was selected for race car PHEV. A high level supervisory control system and ECMS control strategy have been developed and implemented through the race car’s on-board embedded controller using dSPACE MicroAutobox II. In addition, longitudinal adaptive traction control has been added to the vehicle controller for improved drivability and acceleration performance. At last, the feasibility and benefits of powertrain hybridization for heavy-duty mining truck have been investigated, and three hybrid powertrain architectures, series, parallel and diesel-electric, with weight adjusting propulsion system have been modeled and studied. The research explored the common and distinct characteristics of hybrid electric propulsion system technology for different vehicular applications, and formed the foundation for further research and development. / Graduate / 0540 / ruicheng@uvic.ca

International Telemetering Conference Proceedings / October 20-23, 2003 / Riviera Hotel and Convention Center, Las Vegas, Nevada / An integrated design, Test and Evaluation (T&E) system for GPS receiver is proposed in the paper, which can perform T&E early in R&D cycle, and combine new designs into a conceptual GPS receiver directly. The flowchart of its development mode is given. The architectures of the system, especially of the signal-computing software are described with frame diagrams. The mathematical models of three reference points are derived, with the impact of oscillator errors modeled. Future plans and further developments are also discussed.

A partir de la définition d'un paradigme espaces - processus énonçant que tout système peut se définir comme une combinaison espaces - processus, les espaces contenant toutes les conditions et moyens nécessaires à l'achèvement du processus, le travail proposé définit une approche modélisatrice permettant de conserver une démarche purement systémique depuis l'identification des concepts du système jusqu'au modèle de représentation. Ce paradigme exprimant simplement qu'un système peut être vu à travers le comportement des différentes propriétés des entités intervenantes, le mémoire va proposer une représentation unifiée de la propriété permettant la manipulation conceptuelle et sémantique. Une forme de représentation des comportements des propriétés sera ensuite proposée. Cette représentation sera définie à partir de l'expression d'un comportement sous forme d'expressions rationnelles; ces expressions étant elles-mêmes des suites de symboles représentatives des propriétés du système observé. Le mémoire montrera comment la forme de représentation proposée permet de retranscrire et d'exploiter simplement les comportements observés ou observables. Le mémoire montrera comment manipuler ces éléments et quelles propriétés s'en dégagent. En particulier, le premier objectif de ce travail est une application à la maîtrise des risques systèmes, on exploitera donc le modèle dans la recherche et l'identification de situations dangereuses mais aussi pour la capacité d'évaluation des critères d'occurrence par un transfert de l'espace de propriétés vers un espace de probabilités.

The pi-calculus [61] is one the most influential formalisms for modelling and analyzing the behaviour of concurrent systems. This calculus provides a language in which the structure of terms represents the structure of processes together with an operational semantics to represent computational steps. For example, the parallel composition term P | Q, which is built from the terms P and Q, represents the process that results from the parallel execution of the processes P and Q. Similarly, the restriction (v x)P represents a process P with local resource x. The replication !P can be thought of as abbreviating the parallel composition P | P | . . . of an unbounded number of P processes. As for other language-based formalisms (e.g., logic, formal grammars and the pi-calculus) a fundamental part of the research in process calculi involves the study of the expressiveness of fragments or variants of a given process calculus. In this dissertation we shall study the expressiveness of some variants of the pi-calculus focusing on the role of the terms used to represent local and infinite behaviour, namely restriction and replication. The first part of this dissertation is devoted to the expressiveness of the zero-adic variant of the (polyadic) pi-calculus, i.e., CCS with replication (CCS!) [21]. Busi et al [22] show that CCS! is Turing powerful [22]. The result is obtained by encoding Random Access Machines (RAMs) in CCS!. The encoding is said to be non-faithful because it may move from a state which can lead to termination into a divergent one which do not correspond to any configuration of the encoded RAM. I.e., the encoding is not termination preserving. In this dissertation we shall study the existence of faithful encodings into CCS! of models of computability strictly less expressive than Turing Machines. Namely, grammars of Types 1 (Context Sensitive Languages), 2 (Context Free Languages) and 3 (Regular Languages) in the Chomsky Hierarchy. We provide faithful encodings of Type 3 grammars. We show that it is impossible to provide a faithful encoding of Type 2 grammars and that termination-preserving CCS! processes can generate languages which are not Type 2. We finally conjecture that the languages generated by termination-preserving CCS! processes are Type 1 . We also observe that the encoding of RAMs [22] and several encoding of Turing-powerful formalisms in pi-calculus variants may generate an unbounded number of restrictions during the simulation of a given machine. This unboundedness arises from having restrictions under the scope of replication (or recursion) as in e.g., !(v x)P or μX.(v x)(P | X). This suggests that such an interplay between these operators is fundamental for Turing completeness. We shall also study the expressive power of restriction and its interplay with replication. We do this by considering several syntactic variants of CCS! which differ from each other in the use of restriction with respect to replication. We consider three syntactic variations of CCS! which do not allow the generation of unbounded number of restrictions: C2 is the fragment of CCS! not allowing restrictions under the scope of a replication, C3 is the restriction-free fragment of CCS!. The third variant is C4 which extends C2 with Phillips' priority guards [76]. We shall show that the use of an unboundedly many restrictions in CCS! is necessary for obtaining Turing expressiveness in the sense of Busi et al [22]. We do this by showing that there is no encoding of RAMs into C2 which preserves and reflects convergence. We also prove that up to failures equivalence, there is no encoding from CCS! into C2 nor from C2 into C3. Thus up to failures equivalence, we cannot encode a process with an unbounded number of restrictions into one with a bounded number of restrictions, nor one with a bounded number of restrictions into a restriction-free process. As lemmata for the above results we prove that convergence is decidable for C2 and that language equivalence is decidable for C3 but undecidable for C2. As corollary it follows that convergence is decidable for restriction-free CCS. Finally, we show the expressive power of priorities by providing a faithful encoding of RAMs in C4 thus bearing witness to the expressive power of Phillips' priority guards [76]. The second part of this dissertation is devoted to expressiveness of the asynchronous monadic pi-calculus, A [15, 47]. In [70] the authors studied the expressivenessn of persistence in Api [15, 47] wrt weak barbed congruence. The study is incomplete because it ignores divergence. We shall present an expressiveness study of persistence in Api wrt De Nicola and Hennessy's testing scenario which is sensitive to divergence. Following [70],,we consider Api and three sub-languages of it, each capturing one source of persistence: the persistent-input Api-calculus (PIA), the persistent-output Api-calculus (POA) and the persistent Api-calculus (PA). In [70] the authors showed encodings from Api into the semi-persistent calculi (i.e., POA and PIA) correct wrt weak barbed congruence. We show that, under some general conditions related to compositionality of the encoding and preservation of the infinite behaviour, there cannot be an encoding from Api into a (semi)-persistent calculus preserving the must testing semantics. We also prove that convergence and divergence are decidable for POA (and PA). As a consequence there is no encoding preserving and reflecting divergence or convergence from Api into POA (and PA). This study fills a gap on the expressiveness study of persistence in A in [70].

Par conscience environnementale ou à cause des coûts de l'énergie, de plus en plus de personnes utilisent les transports en commun ou les transports doux. Cependant, un seul mode de transport ne peut pas couvrir tous les besoins. De ce fait, la combinaison de différents modes de transport est une solution très intéressante. Trouver le meilleur chemin multimodal pour une personne donnée est une tâche difficile. Chaque personne a des préférences différentes concernant la durée, le coût, la pollution, les changements, etc. De plus, le choix d'un même usager dépendent des circonstances. S'il pleut, il ne prendra pas le vélo et s'il a des bagages encombrants, il évitera les changements. L'optimisation multiobjectif permet de proposer plusieurs solutions dites équivalentes. Ainsi l'utilisateur choisira l'itinéraire qui lui convient en fonction de ses préférences à un moment donné. Le problème principal à résoudre est donc celui du plus court chemin multiobjectif de point à point dépendant du temps. L'enjeu est d'être capable d'avoir des résultats de l'ordre de la seconde pour une grande ville pour envisager une application réelle. Une attention particulière a été portée sur la simplicité et la généricité des approches proposées. Nous ne nous restreignons pas à un nombre prédéfini de modes de transport ou d'objectifs. Plusieurs algorithmes réputés pour leurs performances théoriques ou expérimentales ont été adaptés au cas multiobjectif ou à la dépendance du temps. Nous avons également proposé des heuristiques permettant de garder le temps de calcul de l'ordre de la seconde.

.

.

Dans la première partie de ce travail, nous avons étudié les structures gaussiennes linéaires quelconques qui sont à la base de l'analyse multivariate. De plus, nous avons calculé la densité des lois gamma matricielles décentrées et non singulières, par l'utilisation de la fonction génératrice de la mesure de Haar sur le groupe des matrices orthogonales. Cette idée nous fut suggérée par une propriété analogue satisfaite par la densité de la loi de Wishart matricielle décentrée que James A.T. a établie.<br /> La deuxième partie de ce travail concerne l'étude statistique d'un problème de glaciologie, proposé par L. Lliboutry. Nous avons examiné différentes structures statistiques et nous nous sommes intéressé aux applications pratiques de la théorie pour ce problème.