Pour voir les autres types de publications sur ce sujet consultez le lien suivant : DES identification.
Thèses sur le sujet « DES identification »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les 50 meilleures thèses pour votre recherche sur le sujet « DES identification ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Parcourez les thèses sur diverses disciplines et organisez correctement votre bibliographie.
1
Pryke, Sean Patrick. « Multiple independent identification decisions, a method of calibrating eyewitness identifications ». Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp05/NQ63445.pdf.
Texte intégral
2
Balaniuk, Remis. « Identification structurelle ». Phd thesis, Grenoble INPG, 1996. http://tel.archives-ouvertes.fr/tel-00004974.
Texte intégralRésumé :
De nombreuses techniques mathématiques utilisées en robotique reposent sur l'identification de paramètres ou sur la construction d'un modèle de type boîte noire (réseaux de neurones par exemple). Dans le premier cas on se donne une équation de mesure dont on ignore certains paramètres, mais pour laquelle on dispose de mesures experimentales du phénomène qu'on cherche à modéliser. Le problème revient alors à trouver les valeurs numériques des paramètres inconnus de l'équation pour obtenir un modèle du système. Cela revient en général à conduire un certain nombre d'expériences puis à faire de la minimisation au sens des moindres carrés pour trouver les paramètres qui expliquent au mieux les mesures obtenues. Dans le deuxième cas on utilise une technique d'approximation universelle permettant de modéliser la réponse du système. Pour cela on corrige l'ensemble des paramètres de l'approximateur à l'aide d'un algorithme adaptatif et d'un ensemble d'exemples. On dispose donc actuellement de deux grandes classes de méthodes : l'une faisant appel à de fortes connaissances préalables (la connaissance de l'équation de mesure) et l'autre ne faisant appel à aucune connaissance préalable. L'objet de cette thèse est de proposer une méthode intermédiaire: l'identification structurelle. Dans ce cadre on ne connaît plus la forme paramétrique de l'équation de mesure mais des informations a-priori sur sa forme générale. Par exemple, on sait que l'équation de mesure est formée d'un polynôme de fonctions quelconques d'une seule variable. Nous montrons qu'il est possible d'inférer cette équation de mesure dès lors que l'on choisit un protocole expérimental approprié et que l'on dispose d'un approximateur universel pour les fonctions d'une seule variable. L'ensemble des polynômes de fonctions trigonométiques multi-variables rentre dans le cadre juste évoqué. On peut donc appliquer cette méthode à de nombreux problèmes trouvés en robotique. On peut par exemple identifier le modèle géométrique d'un bras manipulateur ou trouver l'expression de la jacobienne reliant les mouvements d'un bras aux mouvements d'indices visuels dans une image vidéo. Le modèle fonctionnel obtenu peut être utilisé pour commander le système. C'est ainsi que nous avons réalisé un asservissement visuel avec cette méthode.
3
Wood, Nathan D. « Mystic Identifications : Reading Kenneth Burke and “Non-identification” through Asian American Rhetoric ». BYU ScholarsArchive, 2020. https://scholarsarchive.byu.edu/etd/8482.
Texte intégralRésumé :
Krista Ratcliffe’s term “non-identification” offers a version of identification that assumes identity is not always identifiable. As an attitude that fosters cross-cultural listening, non-identification asks us to listen to others from a place of “neutrality,” with “hesitancy,” “humility,” and “pause” in order to consider identity’s fluid nature (73). This thesis first argues that this term might also describe speaking strategies premised on non-identifiability. As I’ll show, an inventive non-identification would articulate some rhetorical strategies that neither “identification” nor “disidentification” currently articulate. However, rhetorical scholars need more theoretical and practical guidance for what this kind of speech looks like. So, this thesis also argues why, despite criticism to the contrary, the writing of Kenneth Burke offers an ideal account for inventive non-identification. Burke’s descriptions of the terms “synecdoche function,” the “mystic” and “poetic language” achieve the same effects as Ratcliffe’s non-identification, yet Burke describes these same effects from the perspective of the speaker. Following my re-reading of Burke, I ground the theory of inventive non-identification in a brief rhetorical analysis of Yan Phou Lee’s 1887 autobiography When I Was a Boy in China. By showing how this theory applies to Asian American rhetoric, I conclude that inventive non-identification has utility for the field of rhetoric more broadly.
4
Brunot, Mathieu. « Identification of rigid industrial robots - A system identification perspective ». Phd thesis, Toulouse, INPT, 2017. http://oatao.univ-toulouse.fr/20776/1/BRUNOT_Mathieu_20776.pdf.
Texte intégralRésumé :
In modern manufacturing, industrial robots are essential components that allow saving cost, increase quality and productivity for instance. To achieve such goals, high accuracy and speed are simultaneously required. The design of control laws compliant with such requirements demands high-fidelity mathematical models of those robots. For this purpose, dynamic models are built from experimental data. The main objective of this thesis is thus to provide robotic engineers with automatic tools for identifying dynamic models of industrial robot arms. To achieve this aim, a comparative analysis of the existing methods dealing with robot identification is made. That allows discerning the advantages and the limitations of each method. From those observations, contributions are presented on three axes. First, the study focuses on the estimation of the joint velocities and accelerations from the measured position, which is required for the model construction. The usual method is based on a home-made prefiltering process that needs a reliable knowledge of the system’s bandwidths, whereas the system is still unknown. To overcome this dilemma, we propose a method able to estimate the joint derivatives automatically, without any setting from the user. The second axis is dedicated to the identification of the controller. For the vast majority of the method its knowledge is indeed required. Unfortunately, for copyright reasons, that is not always available to the user. To deal with this issue, two methods are suggested. Their basic philosophy is to identify the control law in a first step before identifying the dynamic model of the robot in a second one. The first method consists in identifying the control law in a parametric way, whereas the second one relies on a non-parametric identification. Finally, the third axis deals with the home-made setting of the decimate filter. The identification of the noise filter is introduced similarly to methods developed in the system identification community. This allows estimating automatically the dynamic parameters with low covariance and it brings some information about the noise circulation through the closed-loop system. All the proposed methodologies are validated on an industrial robot with 6 degrees of freedom. Perspectives are outlined for future developments on robotic systems identification and other complex problems.
5
Avanzi, Lorenzo <1975>. « Dual Identification : When Identification in Organizational Contexts Can Harm ». Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2009. http://amsdottorato.unibo.it/1575/1/TESI_DOTTORATO_ULTIMA_CON_INDICEok.pdf.
Texte intégral
6
Avanzi, Lorenzo <1975>. « Dual Identification : When Identification in Organizational Contexts Can Harm ». Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2009. http://amsdottorato.unibo.it/1575/.
Texte intégral
7
Coymak, Ahmet. « Associations Of Religious Identification, Secular Identification, Perceived Discrimination, And Political Trust With Ethnic And Societal (national) Identification ». Master's thesis, METU, 2009. http://etd.lib.metu.edu.tr/upload/12610734/index.pdf.
Texte intégralRésumé :
The current thesis extends research in the area of multiple social identities and identity conflict by focusing on both intergroup and intraindividual process underlying structures of identities, namely, religious, ethnic, and societal (national)
identifications. In addition, it examined the influence of political trust, and perceived discrimination the relationship between ethnic and societal identification for disadvantaged ethnic groups in Turkey. Two studies were conducted to evaluate the process of identity organization both inter group and in group. While, the first study addresses intergroup differentiations of these identities, second study focused on intraindividual process of these identities'structure. Supporting hypothesis stemming from Social Identity Theory and Optimal Distinctiveness Theory, political trust and perceived discrimination have roles of mediation in the relationship ethnic and societal identification, by contrast with secular and religious identities in the relationship. Results were discussed for their implications to politic context of the Turkey.
8
Pozzulo, Joanna D. « Increasing the identification accuracy of child eyewitnesses with identification procedures ». Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape15/PQDD_0004/NQ27850.pdf.
Texte intégral
9
Pourmohammad-Namvar, Mehrzad. « Interaction entre identification et commande : identification pour la commande robuste ». Grenoble INPG, 2001. http://www.theses.fr/2001INPG0004.
Texte intégralRésumé :
Cette these presente les differents algorithmes optimaux qui identifient un modele nominal et quantifient l'erreur de modelisation dans les differentes topologies de systemes. Plus particulierement nous considerons la topologie de graphe, h , et 11. Notre approche est plutot dans le contexte de set-membership ou nous considerons les modeles rationnels et non-affines en les parametres. Ceci nous donne la possibilite d'identifier des modeles avec un ordre fixe et faible. Nous considerons surtout le cas ou le vrai systeme n'appartient pas a l'ensemble des modeles. Notre demarche est alors de trouver le meilleur modele ayant une distance minimale du vrai systeme et de trouver les bornes pire-de-cas pour l'erreur de modelisation. Ces distances sont exprimees dans les topologies de graphe, h et 11. Les algorithmes d'identifications sont bases sur la resolution des problemes d'optimisation convexes de type programmation lineaire (lp) ou inegalite matricielle lineaire (lmi). Nous adoptons deux strategies generales pour resoudre le probleme d'identification pour la commande. Dans la premiere strategie que nous appelons la methode simultanee, l'identification des parametres du modele et la quantification de l'incertitude sont realisees dans une seule etape, tandis que dans la deuxieme strategie (non-simultanee) l'identification du modele et la quantification de l'incertitude sont realisees dans deux etapes differentes. On demontre aussi que ces strategies sont applicables pour l'identification en boucle fermee ou l'objectif est de minimiser la distance (h ou 11) entre les fonctions de sensibilites nominale et reelle.
10
Xing, Shutao. « Structural Identification and Damage Identification using Output-Only Vibration Measurements ». DigitalCommons@USU, 2011. https://digitalcommons.usu.edu/etd/1067.
Texte intégralRésumé :
This dissertation studied the structural identification and damage detection of civil engineering structures. Several issues regarding structural health monitoring were addressed.
The data-driven subspace identification algorithm was investigated for modal identification of bridges using output-only data. This algorithm was tested through a numerical truss bridge with abrupt damage as well as a real concrete highway bridge with actual measurements. Stabilization diagrams were used to analyze the identified results and determine the modal characteristics. The identification results showed that this identification method is quite effective and accurate.
The influence of temperature fluctuation on the frequencies of a highway concrete bridge was investigated using ambient vibration data over a one-year period of a highway bridge under health monitoring. The data were fitted by nonlinear and linear regression models, which were then analyzed.
The substructure identification by using an adaptive Kalman filter was investigated by applying numerical studies of a shear building, a frame structure, and a truss structure. The stiffness and damping were identified successfully from limited acceleration responses, while the abrupt damages were identified as well. Wavelet analysis was also proposed for damage detection of substructures, and was shown to be able to approximately locate such damages.
Delamination detection of concrete slabs by modal identification from the output-only data was proposed and carried out through numerical studies and experimental modal testing. It was concluded that the changes in modal characteristics can indicate the presence and severity of delamination. Finite element models of concrete decks with different delamination sizes and locations were established and proven to be reasonable.
Pounding identification can provide useful early warning information regarding the potential damage of structures. This thesis proposed to use wavelet scalograms of dynamic response to identify the occurrence of pounding. Its applications in a numerical example as well as shaking table tests of a bridge showed that the scalograms can detect the occurrence of pounding very well.
These studies are very useful for vibration-based structural health monitoring.
11
Prandina, Marco. « Spatial damping identification ». Thesis, University of Liverpool, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.533930.
Texte intégral
12
Zai, Salar. « Identification of micrococci ». Thesis, University of Bradford, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.292645.
Texte intégral
13
Nguyên, Thiên-Lôc 1978. « National identification systems ». Thesis, Massachusetts Institute of Technology, 2003. http://hdl.handle.net/1721.1/87367.
Texte intégral
14
Hlushchenko, V. O., I. I. Kolodochka et A. O. Miroshnychenko. « Identification of motion ». Thesis, Сумський державний університет, 2012. http://essuir.sumdu.edu.ua/handle/123456789/28692.
Texte intégral
15
Hlushchenko, V. O., I. I. Kolodochka et A. O. Miroshnychenko. « Identification of motion ». Thesis, Видавництво СумДУ, 2012. http://essuir.sumdu.edu.ua/handle/123456789/26037.
Texte intégral
16
Sinyanska, A., et A. Klushnik. « Presenting for identification ». Thesis, Видавництво СумДУ, 2012. http://essuir.sumdu.edu.ua/handle/123456789/26092.
Texte intégralRésumé :
When it is necessary to present a person for identification by a witness, victim, accused, or suspect, investigator first questions them about appearance and characteristic signs of such person and about circumstances under which the identifying person saw the person concerned, and then draws up a record of interrogation. If a witness or victim identifies the person, the former is admonished of criminal liability for knowingly misleading testimonies while the witness is also warned about criminal liability for refusal to testify.
When you are citing the document, use the following link http://essuir.sumdu.edu.ua/handle/123456789/26092
17
Ziegler, Edward H. « Nonlinear system identification / ». Online version of thesis, 1994. http://hdl.handle.net/1850/11583.
Texte intégral
18
Dwyer, Edward J. « Word Identification Strategies ». Digital Commons @ East Tennessee State University, 2018. https://dc.etsu.edu/etsu-works/3417.
Texte intégral
19
Dwyer, Edward J. « Word Identification Strategies ». Digital Commons @ East Tennessee State University, 2016. https://dc.etsu.edu/etsu-works/3419.
Texte intégral
20
Moody, Sarah Jean. « Automated Data Type Identification And Localization Using Statistical Analysis Data Identification ». DigitalCommons@USU, 2008. https://digitalcommons.usu.edu/etd/9.
Texte intégralRésumé :
This research presents a new and unique technique called SÁDI, statistical analysis data identification, for identifying the type of data on a digital device and its storage format based on data type, specifically the values of the bytes representing the data being examined. This research incorporates the automation required for specialized data identification tools to be useful and applicable in real-world applications. The SÁDI technique utilizes the byte values of the data stored on a digital storage device in such a way that the accuracy of the technique does not rely solely on the potentially misleading metadata information but rather on the values of the data itself. SÁDI provides the capability to identify what digitally stored data actually represents. The identification of the relevancy of data is often dependent upon the identification of the type of data being examined. Typical file type identification is based upon file extensions or magic keys. These typical techniques fail in many typical forensic analysis scenarios, such as needing to deal with embedded data, as in the case of Microsoft Word files or file fragments. These typical techniques for file identification can also be easily circumvented, and individuals with nefarious purposes often do so.
21
Toner-MacLean, Sally. « Emotional ramifications of adoption reunion : is there a predictable pattern of response ? » Thesis, McGill University, 2002. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=78193.
Texte intégralRésumé :
This study examines the emotional responses of adoption reunion participants over time by a cross-sectional survey. A questionnaire was modeled after an existing reunion guideline, "Relationship Stages in Reunion". Ontario adoption reunion counselors in the public and private sectors use this guideline. This questionnaire was circulated by a Parent Finder's organization (22 respondents), and a provincial government organization (27 respondents). The hypothesis that there is a predictable pattern of emotional response in reunion was not supported. No significant differences were found between those that experienced reunion via either organization. There were some differences in the demographics. Both groups noted a high level of satisfaction with their reunion. This research would have been better tracked by a longitudinal study.
22
何耀祥 et Yiu-cheung Timothy Ho. « Biotyping in Penicillium marneffei ». Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2000. http://hub.hku.hk/bib/B31969732.
Texte intégral
23
Smith, Shelley Elizabeth. « How Does Sport Team Identification Compare to Identification with Other Social Institutions ? » TopSCHOLAR®, 2009. http://digitalcommons.wku.edu/theses/122.
Texte intégralRésumé :
As social beings, people naturally form identifications with various social groups within their environment. Individuals gain benefits by forming identifications with groups, such as increased self-esteem and psychological support. Past research has examined the identification people form with various social groups, but no research has examined with which of these social groups people form the strongest identification. This study examines the strength of identification with various social groups within one’s life. It is predicted that individuals will indicate a stronger identification with a sport team than with any other social group. Secondly, it is predicted that identification with a sport team will provide better psychological benefits than identification with another social group. The analysis of 226 participants’ responses indicated that individuals form a stronger identification with a sport team than with a religious group, a school activity, or with a form of community involvement. A similar level of identification was found between identification with a sport team and a social activity as well as one’s occupation. The study’s results also indicated that identification with a sport team contributed slightly more to one’s social psychological health than identification with another form of social group.
24
Choi, Eric M. « The modeling and system identification of the Dynamics Identification and Control Experiment ». Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp04/mq29363.pdf.
Texte intégral
25
Campos, Maria João Magalhães Pereira. « Identity in eHealth - from the reality of physical identification to digital identification ». Master's thesis, Faculdade de Medicina da Universidade do Porto, 2010. http://hdl.handle.net/10216/62148.
Texte intégral
26
Mustard, H. L. « Identification with stigmatised groups : does group identification lead to poor self-esteem ? » Thesis, University College London (University of London), 2013. http://discovery.ucl.ac.uk/1407498/.
Texte intégralRésumé :
Aims: If an individual receives a diagnosis, this can identify them as a member of a stigmatised group. The aim of this paper is to review the relevant literature in order to address three main questions about group identification. 1) When an individual is identified by others as being a member of a stigmatised group, do they tend to identify themselves as a member of that group? 2) What is the relationship between identification with a stigmatised group and self-evaluation? 3) Is this relationship different for mental health and learning disabilities diagnoses? Method: The academic literature was searched using PsycINFO, Web of Science, Embase, Medline and Google Scholar to identify peer-reviewed articles that explore the relationship between group identification, self-stigma and self-evaluation in the two diagnosed groups: mental health problems and learning disabilities. Results: Sixty-eight studies were identified by systematic search, 13 met criteria for this review. Eight papers focused on mental health and five focused on learning disabilities. Conclusions: There was variation in quality of methodology used, so conclusions are tentative. People tended to identify with their group but variation in level of group identification was found. Identification with the mental health problems group seemed to impact negatively on self-evaluation when the group had little value to the group member and group membership did not aid coping with stigma; if the group was valued and coping resources increased, self-evaluation could be protected. Ingroup, downward comparison to protect self-evaluation was present in both groups, but was more of a focus in the learning disabilities literature; there were no reports of the learning disabilities group being valued by its members. Implications for future research are discussed, including the study of other diagnoses such as Autism Spectrum Condition.
27
Campos, Maria João Magalhães Pereira. « Identity in eHealth - from the reality of physical identification to digital identification ». Dissertação, Faculdade de Medicina da Universidade do Porto, 2010. http://hdl.handle.net/10216/62148.
Texte intégral
28
Little, Jane Kathryn. « The acquisition of gender stereotype component links ». Thesis, University of British Columbia, 1988. http://hdl.handle.net/2429/28105.
Texte intégralRésumé :
Deaux and Lewis (1984) have proposed that stereotypes be viewed as linked components, each encompassing specific content domains (such as beliefs about appearance, preferences, occupations and traits). Each component has a masculine and a feminine version. Adults are able to use the stereotyped associative links between items in the same component and those between items in different components to make judgments about individuals' behaviors and characteristics based on minimal information. The present study examined the acquisition of these associative connections in the gender stereotypes of 6 to 10 year olds. Seventy-six children (38 boys, 38 girls), aged 6, 8 and 10 years, were asked to make a number of judgments about an individual's clothing, occupational aspirations, toy preferences, and personality traits based on a single piece of cue information (a masculine or feminine item from a component). The types of associative links that children could use in making of interpersonal judgments changed with age. The 6-year-old children were able to make stereotyped judgments about both masculine and feminine items within the same component but were only able to make between-component stereotyped judgments when items of their own-sex typing (i.e. masculine items for boys, feminine items for girls) were presented as cues. The older children were be able to make within- and between-component stereotypic judgments about both masculine and feminine items. The results supported the propositions of schematic-processing theory (Martin & Halverson, 1981) and demonstrated the value of the Deaux and Lewis (1984) component-link model as a heuristic for the study of complex cognitive structures.Education, Faculty of
Educational and Counselling Psychology, and Special Education (ECPS), Department of
Graduate
29
Estrada, Luis M. « Party identification in Mexico / ». Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC IP addresses, 2005. http://wwwlib.umi.com/cr/ucsd/fullcit?p3185927.
Texte intégral
30
Helt, Michael F. « Vegetation identification with Lidar ». Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2005. http://library.nps.navy.mil/uhtbin/hyperion/05Sep%5FHelt.pdf.
Texte intégral
31
Johnson, Richard. « Frequency domain structural identification ». Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1996. http://handle.dtic.mil/100.2/ADA312408.
Texte intégral
32
Bäumer, Lars. « Identification in prediction theory ». [S.l. : s.n.], 2000. http://deposit.ddb.de/cgi-bin/dokserv?idn=959725504.
Texte intégral
33
Ellmauthaler, Andreas, et Eric Wernsperger. « Biometric Identification of Mice ». Thesis, Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE), 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-1135.
Texte intégralRésumé :
The identification of laboratory mice has been an important issue in pharmaceutical applications ever since tests have been performed on animals. As biometric identification has become an increasingly important issue over the past decade, attempts are underway to replace traditional identification methods, which are mostly invasive and limited in code space. This thesis discusses a project that aims at identifying mice by biometrically examining the blood vessel patterns in their ears.
In the proposed algorithm, firstly, the blood vessel structure within the obtained images got enhanced before segmenting the image in blood vessel and non-blood vessel portions. In the next step a sufficient amount of unique feature points got extracted from the segmented image. The obtained feature points were afterwards used for the actual identification procedure.
Out of 20 mice, 18 could be identified successfully using the proposed algorithm.
34
Brusewitz, Oskar. « Identification : Problem or opportunity ? » Thesis, Högskolan i Halmstad, Sektionen för lärarutbildning (LUT), 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-19905.
Texte intégral
35
Zhao, Hongdu. « Identification of redundant faults ». Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape16/PQDD_0012/MQ28468.pdf.
Texte intégral
36
Mao, Qian. « Clusters Identification : Asymmetrical Case ». Thesis, Uppsala universitet, Informationssystem, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-208328.
Texte intégralRésumé :
Cluster analysis is one of the typical tasks in Data Mining, and it groups data objects based only on information found in the data that describes the objects and their relationships. The purpose of this thesis is to verify a modified K-means algorithm in asymmetrical cases, which can be regarded as an extension to the research of Vladislav Valkovsky and Mikael Karlsson in Department of Informatics and Media. In this thesis an experiment is designed and implemented to identify clusters with the modified algorithm in asymmetrical cases. In the experiment the developed Java application is based on knowledge established from previous research. The development procedures are also described and input parameters are mentioned along with the analysis. This experiment consists of several test suites, each of which simulates the situation existing in real world, and test results are displayed graphically. The findings mainly emphasize the limitations of the algorithm, and future work for digging more essences of the algorithm is also suggested.
37
Wangpattanasirikul, Suthipong. « Port-based system identification ». Thesis, Massachusetts Institute of Technology, 1996. http://hdl.handle.net/1721.1/39769.
Texte intégral
38
Kim, Brian A. (Brian Andrew) 1979. « Multi-source human identification ». Thesis, Massachusetts Institute of Technology, 2003. http://hdl.handle.net/1721.1/29662.
Texte intégralRésumé :
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2003.Includes bibliographical references (p. 59-60).
In this thesis, a multi-source system for human identification is developed. The system uses three sources: face classifier, height classifier, and color classifier. In the process of developing this system, classifier combination and the integration of classifer outputs over sequences of data points were studied in detail. The method of classifier combination used relies on weighing classifiers based on the Maximum Likelihood estimation of class probabilities. The integration of classifer outputs, which is termed "temporal integration" in this thesis, has been developed to take advantage of the information implicitly contained in data correlated through time. In all experiments performed, temporal integration has improved classification, up to 40% in some cases. Meanwhile, the method of temporally integrating the outputs of multiple classifiers fused using our classifier weighting method outperforms all individual classifiers in the system.
by Brian A. Kim.
M.Eng.
39
Chen, Chun-Cheng Richard 1977. « Automated cardiovascular system identification ». Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/81537.
Texte intégralRésumé :
Thesis (S.B. and M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000.Includes bibliographical references (p. 64-65).
by Chun-Cheng Chen.
S.B.and M.Eng.
40
Andrews, Isaiah Smith. « Essays in weak identification ». Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/90118.
Texte intégralRésumé :
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Economics, 2014.Cataloged from PDF version of thesis.
Includes bibliographical references (pages 219-228).
Economic researchers and policymakers need reliable tools both to estimate economic relationships and to measure the uncertainty surrounding their estimates. Unfortunately, economic data sometimes contains limited information useful for estimating relationships of interest. In such cases, the statistical techniques commonly used in applied economics can break down and fail to accurately reflect the level of uncertainty present in the data. If they rely on such tools, researchers and policymakers may come away with serious misconceptions about the precision and reliability of their estimates. Econometricians refer to models where the lack of information in the data causes common statistical techniques to break down as weakly identified. In this thesis, I examine several questions relating to weak identification. In the first chapter, I introduce the class of conditional linear combination tests. These tests control size under weak identification and have a number of optimality properties in a conditional problem. I suggest using minimax regret conditional linear combination tests and propose a computationally tractable class of tests that plug in an estimator for a nuisance parameter. In the second chapter, I consider the problem of detecting weak identification. When weak identification is a concern researchers frequently calculate confidence sets in two steps, first assessing the strength of identification and then deciding whether to use an identification-robust confidence set. Two-step procedures of this sort may generate highly misleading confidence sets, and I demonstrate that two-step confidence sets based on the first stage F-statistic can have extremely poor coverage in linear instrumental variables models with heteroskedastic errors. I introduce a simple approach to detecting weak identification and constructing two-step confidence sets which controls coverage distortions. In the third chapter, joint with Anna Mikusheva, we consider minimum distance statistics and show that in a broad class of models the problem of testing under weak identification is closely related to the problem of testing a "curved null" in a finite-sample Gaussian model. Using the curvature of the model, we develop new finite-sample bounds on the distribution of minimum-distance statistics, which we show can be used to detect weak identification and to construct tests robust to weak identification.
by Isaiah Smith Andrews.
Ph. D.
41
Fei, Ran. « Pedestrian detection and identification ». Thesis, Imperial College London, 2014. http://hdl.handle.net/10044/1/24902.
Texte intégralRésumé :
People are the centre of technologies. Understanding, monitoring and tracking the behaviour of people will benefit in various areas including driving assistance, surveillance for safety and caring purposes and applications for machine-people interaction. Particularly, pedestrians attract more attention for two reasons: they restrict the behaviours of people to standing and moving upright; and applications for pedestrian detection and monitoring have positively impact on the quality of life. Pedestrian detection and identification, aims at recognising pedestrians fromstill images and video frames. Together with pedestrian recognition and tracking, this topic attempts to train computers to recognise a pedestrian. The problem is challenging. Though frameworks were designed, various algorithms were proposed in recent years, further efforts are needed to improve the accuracy and reliability of the performance. In this thesis, proposing a modifiable framework for pedestrian identification and improving the performances of current pedestrian detection techniques are particularly focused. Based on appearance based pedestrian identification, a modifiable framework is a novel philosophy of developing frameworks which can be easily improved. For pedestrian identification, a novel protocol where layers of algorithms are hierarchically applied to solve the problem. To compare the detected pedestrians, appearance based features are selected, the "bag-of-features" framework is employed to compare the histogram descriptions of pedestrians. To improve the performances of HOG pedestrian detector, the presence of head-shoulder structure is selected as the evidence of the presence of pedestrian. A novel appearance based framework is developed to detect the head-shoulder structure from the detection results of HOG detector. Furthermore, in order to separate multiple pedestrians detected in one bounding box, a novel algorithm is proposed to detect the approximated symmetry axes of pedestrians.
42
Bennia, Abdelhak. « Mimo systems parameters identification ». Thesis, Virginia Tech, 1986. http://hdl.handle.net/10919/41579.
Texte intégralRésumé :
In this thesis, a presentation of a new canonical representation of multi-input multioutput systems is given. The new characterization covers the full range of practical situations in linear systems according to the structural properties and model of the perturbations which are known. Its direct link to ARMA processes as well as to classical state space representation ls also given.
The importance of the new representation lies in the fact that all unknown parameters and state variables appear linearly multlplied by either external variables (inputs and outputs) that appear in the data record, or by matrices that are only composed of ieroes and ones. This property enables us to perform a joint state and parameters estimation. Moreover, if the noises are gaussian and their statistics are known, an on-line algorithm that involves a standard dlscrete-time time-varying Kalman filter is proposed and used successfully in the estimation of unknown parameters for simulated examples.
Master of Science
43
Berdai͏̈, Abdellatif. « Identification de mélanges gaussiens ». Toulouse 3, 1994. http://www.theses.fr/1994TOU30190.
Texte intégralRésumé :
Dans ce travail, nous etudions les performances d'un test d'homogeneite contre une hypothese de melange gaussien dont les deux composants ont la meme variance. La theorie classique du test du rapport de vraisemblance n'est pas applicable car les conditions de regularite habituelles ne sont pas verifiees. Ce travail consiste, d'une part, a generaliser au cas ou l'ecart-type commun aux deux composants est inconnu l'approche developpee par ghosh et sen (1985) pour le calcul de la statistique du test et de sa loi asymptotique, d'autre part, a construire une tabulation approchee en se basant sur une borne suggeree par davies (1977). La puissance de ce test est etudiee par simulations. Elle augmente sensiblement avec la bonne estimation de parametres inconnus sous l'hypothese d'homogeneite et avec une meilleure information a priori sur la distance de mahalanobis entre les deux composants
44
Proschailo, A., et S. Poltavets. « Personal identification. Fingerprint recognition ». Thesis, Видавництво СумДУ, 2012. http://essuir.sumdu.edu.ua/handle/123456789/26024.
Texte intégral
45
Brandt, Hjertstedt Eleonor. « Cybercrime Using Electronical Identification ». Thesis, Malmö universitet, Fakulteten för hälsa och samhälle (HS), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-26561.
Texte intégralRésumé :
Detta examensarbete undersöker riskerna med elektronisk identifiering, mer specifikt säkerhetsrisker kring enheten BankID i Sverige. Idag används BankID i stor utsträckning, men elektronisk identifiering kommer också med vissa risker när det gäller identitetsrelaterade brott. I Sverige var brottstypen som ökade mest det senaste året mätt i anmälda brott, bedrägerier som huvudsakligen begåtts genom informationsteknik. Arbetet syftar därför till att undersöka vilka säkerhetsrisker som finns med den elektroniska identifieringen BankID, och hur Polismyndigheten och Ekobrottsmyndigheten bekämpar brott på detta område. Resultatet visar att den största säkerhetsrisken med BankID är användare/kunder som kan luras. Gärningsmän använder olika metoder för att få tillgång till andra personer BankID. Vad gäller hur Polismyndigheten och Ekobrottsmyndigheten bekämpar brott riktade mot elektronisk identifiering är resultatet delvis bristfälligt på grund av att Ekobrottsmyndigheten inte är representerade. Utifrån polisens perspektiv så undersöker de bedrägeri avseende BankID så som de gör med alla andra brott, men brottet har generellt en lägre prioritet inom myndigheten. Polisen samarbetar med olika aktörer samt bidrar båda till att utveckla produktens säkerhet och informera kunderna om säkerhet och risker avseende BankID.This thesis investigates the threats against electronical identification, more specifically the danger that comes with the device BankID in Sweden. Today BankID is widely used but electronical identification also comes with certain security risks regarding identity related crimes. In Sweden, the crime type which increased the most last year 2018 measured in reported crimes was fraud mainly committed through information technology. This thesis therefore aim to investigate what the safety risks are using electronical identification, such as BankID and how the police force and Swedish Economic Crime Authority combat cybercrimes in this area. The result show that the main security risk with BankID is the customers that can be deceived. Perpetrators use different methods to get access to another individuals BankID. Regarding how the police force and Swedish Economic Crime Authority combat crimes against electronical identification, the result is partly defective due to that the Swedish Economic Crime Authority not being represented in this thesis. However, from the police perspective, they investigate fraud regarding BankID as all other crimes but it has in general a lower priority within the authority. The police cooperate with different actors and help both with development of the product security and inform customers about safety and risks regarding BankID.
46
Jaber, Mohamad. « Internet traffic profiling identification ». Nice, 2011. http://www.theses.fr/2011NICE4085.
Texte intégralRésumé :
L’évolution de l’Internet dans les dernières années a été caractérisée par des changement dramatiques dans la manière dont les utilisateurs se comportent, interagissent et utilisent le réseau. Ceci a été particulièrement accompagné par l’introduction de nouvelles classes d’applications telles que les jeux en ligne et les réseaux pair-à-pair. L’un des défis les plus importants pour les administrateurs réseau et les ISPs est alors devenu l’identification du trafic Internet afin de pouvoir protéger leurs ressources contre le trafic indésirable et de prioriser certaines applications majeures. Les méthodes statistiques sont préférées à celles basées sur le numéro de port et l’inspection approfondie des paquets, car elles sont robustes au changement malveillant du numéro de port et fonctionnent avec le trafic crypté. Ces méthodes combinent l’analyse des paramètres statistiques des flux de paquets, tels que la taille des paquets et le temps les séparant, avec des techniques issues de la théorie d’apprentissage (machine learning). La majorité des méthodes statistiques ne peuvent pas identifier les flux applicatifs en temps réel et elles ont besoin d’atteindre la fin des flux avant de prendre une décision sur leur nature. Ceci est considéré comme trop long pour la plupart des administrateurs réseau, puisqu’il ne permet pas de bloquer un flux Internet indésirable à son début ni de lui donner en amont une qualité particulière de service. Un autre défi important pour les administrateurs réseau est de détecter et diagnostiquer tout changement dans le réseau comme une congestion à long terme, un changement dans le routage, une défaillance d’une liaison ou tout autre événement entraînant un changement dans les délais réseau. Dans la littérature, il y a un grand nombre de méthodes pour détecter des anomalies dans le réseau, mais la plupart de ces méthodes ont besoin de générer un volume considérable de trafic destiné) la métrologie du réseau. La réduction de la charge des mesures est un besoin vital pour les administrateurs réseaux. Dans cette thèse, nous décrivons les travaux que nous avons menés sur l’identification du trafic Internet et sur la détection des anomalies dans les réseaux. Dans la première partie, nous présentons nos trois méthodes que nous avons développées au cours de cette thèse, et qui permettent d’identifier avec précision et à la volée le trafic Internet. La première méthode, par sa nature itérative et probabiliste, identifie les applications rapidement et avec une grande précision en utilisant uniquement la taille des N premiers paquets. La deuxième méthode enrichit la première avec les temps entre paquets, pour cela nous avons eu besoin d’introduire un modèle pour filtrer le bruit dû aux conditions du réseau et d’extraire des mesures le temps d’attente due aux applications. Notre troisième méthode pour la classification du trafic en ligne combine les approches statistiques à des informations sur le comportement des machines hôtes afin de rendre l’identification du trafic Internet encore plus précis tout en profilant les activités réseaux des hôtes. Pour notre troisième méthode, nous utilisons la taille des paquets comme paramètre principal et nous exploitons les informations sur l’interaction des machines pour mieux affecter un flux à une application. Dans la deuxième partie de cette thèse, nous abordons le problème de détection des anomalies dans les réseaux. Nous commençons par une étude sur la stabilité des systèmes de coordonnées Internet (particulier Vivaldi). Dans une première étape, nous confirmons le fait que les coordonnées de Vivaldi oscillent au fil du temps en raison de la nature adaptative du système. Toutefois, les variations de ces coordonnées sont dans la plupart des temps en corrélation les unes avec les autres, pointant par conséquent vers un cluster de nœuds stables vu de l’intérieur du réseau. Dans un deuxième temps, nous présentons un nouvel algorithme de cloustering basé sur des méthodes de groupement hiérarchique afin d’identifier ce cluster de nœuds stables. Enfin, nous soulignons l’utilité d’une telle constatation avec une application qui permet de détecter les changements dans le réseau. En changeant artificiellement les délais du réseau dans différents scénarios, nous montrons que ces changements sont reflétés par ce corps de nœuds stables, permettant ainsi d’obtenir une image globale de la stabilité du réseau sans avoir besoin de mesures exhaustives des délaisThe evolution of the Internet in the last few year has been characterized by dramatic changes in the way users behave, interact and utilize the network. This was accompanied by the introduction of new categories of applications such as network games and peer-to-peer services. One of the most important challenges for network administrators and ISPs is then becoming the identification of Internet traffic applications in order to protect their resources from unwanted traffic and to prioritize some major applications. Statistical methods are preferred to port-based ones and deep packet inspection since they donât rely on the port number and they also work for encrypted traffic. Theses methods combine the statistical analysis of the application packet flow parameters, such as packet size and inter-packet time, with machine learning techniques. However, the majority of these statistical methods cannot identify flows early and require reaching the end of flows before taking any decision which is considered as too late for network administrators ; indeed they do not provide means to stop an Internet flow or to give it a special quality of service early in its lifetime. Another important challenge for network administrators is to detect and diagnose key network changes as a long-term congestion, a rerouting, a link failure or any other even causing a shift in network delays. In the literature there is a huge amount of anomaly detection methods but most of them require exhaustive measurements to function properly. Reducing the load of network-wide monitoring is always a vital need for network administrators. In this thesis we present several contributions around Internet traffic identification and network-wide anomaly detection. In the first part we present three methods we have developed in order to identify accurately and on the fly the Internet traffic. The first method is a new online iterative probabilistic method that identifies applications quickly and accurately by only using the size of the first N packets. The second method enhances the first one with the inter-packet time in order to identify Internet traffic, this has required the introduction of a model to isolate the noise due to network conditions and to extract the time generated by the applications themselves. Our third method is a new online method for traffic classification that combines the statistical and host-based approaches in order to construct a robust and precise method for early Internet traffic identification. We use the packet size as the main feature for the classification and we benefit from the traffic profile of the host (i. E. Which application and how much) to decide in favour of this or that application. In the second part of this thesis, we aboard the problem of network-wide anomaly detection. We start by making a study about the stability of Internet coordinate systems (especially Vivaldi). In a first stage we confirm the fact that Vivaldi coordinates are most of the time correlated with each other pointing to a stable cluster of nodes seen from inside the network. In a second stage, we present a new clustering algorithm based on the data mining Hierarchical Grouping method to identify this cluster of stable nodes. Finally, we highlight the utility of such finding with and application that tracks changes in network delays. By changing artificially the network delays in different scenarios, we show that these changes are easily reflected by this body of stable nodes, hence allowing to obtain a global picture about the stability of the underlying network without the need for exhaustive delay measurements
47
Argoul, Pierre. « Identification des structures vibrantes ». Marne-la-vallée, ENPC, 1990. https://hal-enpc.archives-ouvertes.fr/tel-04010926.
Texte intégralRésumé :
L’étude de l’identification des structures mécaniques vibrantes induit une double démarche : la recherche de modèles mécaniques représentatifs des phénomènes observés, et conjointement la recherche de techniques d’identification de ces modèles à partir d’essais vibratoires appropriés. La première partie de ce travail définit donc les deux formes externe et interne de la représentation du comportement des structures. Si la représentation externe repose sur des théorèmes mathématiques généraux précisant la forme de l’opérateur de comportement, la représentation interne se rattache aux lois de la dynamique des milieux continus, rappelées sous forme continue, puis discrétisée dans le cadre d’une formulation variationnelle. La modélisation des effets dissipatifs est ensuite étudiée sous forme de viscoélasticité linéaire. On retiendra que le modèle associé au facteur de qualité constant et le modèle hystérétique peuvent être définis à l’aide de l’élément de base des modèles utilisant les dérivées fractionnaires. La deuxième partie présente une vision d’ensemble des procédures d’identification. Elles sont classées suivant les propriétés des modèles et la distinction entre paramétrique et non-paramétrique. On met l’accent sur la causalité des systèmes identifiés, et sur le risque de relier la perte de causalité d’un système mécanique à la présence éventuelle d’une non-linéarité. Deux méthodes nouvelles d’identification sont exposées et testées sur des exemples numériques. La première, adaptée au cas de systèmes linéaires fortement amortis, s’appuie sur la propriété d’amplification d’une transformation intégrale pondérée. Son calcul permet d’estimer les pôles et les zéros d’une fonction de transfert sans nécessiter d’hypothèse sur le modèle d’amortissement de la structure. La deuxième méthode recherche la meilleure approximation des forces internes comme somme double de polynômes de Chebyshev. Cette technique ne fait pas d’hypothèse à priori sur le comportement de la structure. Les améliorations proposées des procédés de lissage des forces internes dans l’espace d’état fournissent de bons résultats lorsque l’expression de ces forces contient des termes de couplage vitesse-déplacement ou modalThe study of the identification of mechanical structures under vibration involves a double approach : the search for mechanical models representative of the observed phenomena and the search for identification techniques for these models from adapted vibratory tests. The first part of this work gives the definition of the external and internal representations of the behaviour of structures. If the external representation is based on basic mathematical theorems, which precise the form of the operator of the behaviour, the internal representation is linked to the rules of the continuum media dynamics which are recalled in a continuous form and then discretized within the frame of a variational formulation. The modelization of the linear dissipative effects is then studied using linear viscoelasticity theory. We note that the model with constant quality factor and the hysteretic one can be defined with the basic element of models using fractionnal derivatives. The second part gives an overview of some identification procedures which are classified according to the properties of the model and particularly the distinction made between parametric and non-parametric. The causality of identified systems and the risk of linking the loss of causality for a mechanical system to the possible presence of a non-linearity are amphasized. Two new identification methods are presented and tested on numerical example. The first, suitable for linear strongly damped systems, is based on the property of dynamic ampliciation of a weighted integral transform. Its computation allows an estimation of the poles and zeros of a transfer function without making any assumption on the type of real damping. The second one seeks for the best approximation of the restoring forces as a double sum of Chebyshev polynomials. This technique doesn’t make any « a priori » assumption on the structural behaviour. The proposed improvements of the interpolation and extrapolation procedures in the space yield good results when the expression of the restoring forces contains displacements-velocity or modal coupling terms
Das Studium der vibrierenden mechanischen Strukturen beinhaltet zwei Forschungsrichtungen : Die Suche nachden die beobachteten Phänomene repräsentierenden mechanischen Modellen, und die Suche nach Identifikationstechniken dieser Modelle ausgehend von experimentellen Tests. Im ersten Teil dieser Arbeit werden die externen un internen Repräsentationsformen des Strukturverhaltens definiers. Die externe Darstellung basiers auf mathematischen Grundsätzen, die die Form der Verhaltensfunktion bestimmen : wohingegen sich die interne Darstellund durch die Gesetze der Dynamik kontinuierlicher Système ausdrückt, die im Rahmen der Variationstheorie in diskretisierter Form angewendet werden. Dis Modellisierung der Streuungseffekte wird in der Form von linear Viskoelastizität studiert. Es wird gezeigt, daß hysteretische Modelle und Modelle, die konstante Qualitätsfaktoren benutzen, auf der Basis von Modellen definiert werder können, die gebrochenrationale Ableitungsfunktionen benutzen. Der zweite Teil bietet einen Überblick über die Menge der Identifikationsprozeduren. Die Klassifizierung wird gemäß der Eigenschaften der Modelle und der Unterscheidung zwischen parametrisierten und nicht parametrisierten Modellen vorgenommen. Der Schwerpunkt liegt auf den kausalen Zusammenhängen der identifizierten Systeme und auf dem Risiko der Verbindung eines Kausalitätsverlustes mit einer evtl. Vorhandenen Nichtlinearität. Zwei neue Identifikationsmethoden werden vorgestellt und an numerischen Beispielen getestet. Das erste Beispiel, der Fall eines stark gedämpften linearen Systems, basiert auf der Verstärkungseigenschaft einer integralen gewichteten Transformation. Seine Berechnung ermöglicht die Abschätzung der Pole und Nullstellen einer Übertragungsfunktion, ohne daß eine Hypothese des Dämpfungsmodells der Struktur benötiget wird. Die zweite Methode sucht nach der besten zweidimensionalen Approximation der inneren Kräfte durch Tchebyscheff Polynome. Diese Technik macht keine a priori Annahme über das Verhalten der Struktur. Die vorgeschlagenen Verbesserungen des Glättungsprozesses der inneren Kräfte im Zustandsraum ergeben gute Resultate, wenn die Beschreibung dieser Kräfte Terme enthält, die Geschwindigkeit une Deplazierung verbinden
48
Oliveira, Marco Alexandre Rodrigues. « Object identification within images ». Master's thesis, Universidade de Aveiro, 2009. http://hdl.handle.net/10773/2142.
Texte intégralRésumé :
Mestrado em Engenharia de Computadores e TelemáticaO aumento de conteúdo digital armazenado em bases de dados é acompanhado por uma elevada importância atribuída à disponibilização de métodos eficientes para a sua pesquisa. No caso da pesquisa de imagens, esta é, normalmente, realizada através de “keywords”, o que, nem sempre garante resultados satisfatórios, uma vez que as “imagens estão para além das palavras”. Para melhorar este tema é necessário avaliar o conteúdo de cada imagem. Este trabalho propõem-se a divulgar um sistema que, inicialmente, de todas as imagens presentes numa base de dados, obtenha um conjunto de elevada qualidade para posterior processamento. Este método baseia-se na analise do histograma de cada imagem e respectiva distribuição dos contornos de cada objecto presente na mesma. A este conjunto de imagens obtido, para cada instância, são extraídas características que a identifiquem. Este passo, baseia-se na segmentação de imagens e classificação de características através de uma rede neuronal. Para testar a eficiência do método apresentado nesta tese, é feita a comparação entre as características de cada imagem com as restantes, e respectiva devolução de uma lista de imagens, ordenada por ordem decrescente de semelhança. Os nossos resultados provam que o nosso sistema pode produzir melhores resultados do que alguns sistemas existentes. ABSTRACT: The rise of digital content stored in large databases increased the importance of efficient algorithms for information retrieval. These algorithms are, usually, based on keywords which, for image retrieval, do not work properly, since “images are beyond words”. In order to improve image retrieval it is necessary to analyze the contents of each image. This work proposes a system that, firstly, will get a subset of high quality images from the entire database, which will help in further processing. This first method is based in the histogram and edge analysis. In a next method, for each element of the image set obtained, features are extracted. These features will identify each image in the database. In this step, an image segmentation technique and a classification with a neural network are used. This feature extraction process is tested doing comparison between each image features and all the target ones. Each image is associated with a list of images ordered by a similarity level, which allows us to conclude that our system produces better results than some other systems available.
49
Johansson, Jonathan, et Daniel Wikdahl. « Human identification with radar ». Thesis, Högskolan i Halmstad, Akademin för informationsteknologi, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-34619.
Texte intégral
50
Armstrong, Kathryn A. « Identification : a way in / ». Thesis, This resource online, 1992. http://scholar.lib.vt.edu/theses/available/etd-11102009-020041/.
Texte intégral