Дисертації з теми "Featue location"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Featue location".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Schulte, Lukas. "Investigating topic modeling techniques for historical feature location." Thesis, Karlstads universitet, Institutionen för matematik och datavetenskap (from 2013), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-85379.
Повний текст джерелаFarag, Emad William. "Online multi-person tracking using feature-less location measurements." Thesis, Massachusetts Institute of Technology, 2016. http://hdl.handle.net/1721.1/112867.
Повний текст джерелаCataloged from PDF version of thesis.
Includes bibliographical references (pages 65-67).
This thesis presents a scalable real-time multi-object tracking system based on feature-less location measurements. The thesis introduces a two-stage object tracking algorithm along with a server infrastructure that allows users to view the tracking results live, replay old frames, or compute long-term analytics based on the tracking results. In the first tracking stage, consecutive measurements are connected to form short tracklets using an algorithm based on MHT. In the second stage, the tracklets are connected to form longer tracks in an algorithm that reduces the tracking problem to a minimum-cost flow problem. The system infrastructure allows for a large number of connected devices or sensors while reducing the possible points of failure. The tracking algorithms are evaluated in a controlled environment and in a daylong experiment in a real setting. In the latter, the number of people detected by the tracking algorithms was correct 83% of the time when tracking was done using noisy motion-based measurements.
by Emad William Farag.
M. Eng.
Oleg, Kravchenko, and Кравченко Олег Вадимович. "Features of location under airports technogenic landscapes." Thesis, НАУ, 2016. http://er.nau.edu.ua/handle/NAU/24677.
Повний текст джерелаOtterson, Scott. "Use of speaker location features in meeting diarization /." Thesis, Connect to this title online; UW restricted, 2008. http://hdl.handle.net/1773/15463.
Повний текст джерелаJedari, Fathi Elnaz. "NOISE IMPACT REDUCTION IN CLASSIFICATION APPROACH PREDICTING SOCIAL NETWORKS CHECK-IN LOCATIONS." OpenSIUC, 2017. https://opensiuc.lib.siu.edu/theses/2110.
Повний текст джерелаDebenham, Robert Michael. "Studies in learning and feature location with an artificial neural network." Thesis, University of Cambridge, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.334159.
Повний текст джерелаDeLozier, Gregory Steven. "Feature Location using Unit Test Coverage in an Agile Development Environment." Kent State University / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=kent1406157529.
Повний текст джерелаRiggins, Jamie N. "Location Estimation of Obstacles for an Autonomous Surface Vehicle." Thesis, Virginia Tech, 2006. http://hdl.handle.net/10919/33227.
Повний текст джерелаMaster of Science
Buthker, Gregory S. "Automated Vehicle Electronic Control Unit (ECU) Sensor Location Using Feature-Vector Based Comparisons." Wright State University / OhioLINK, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=wright1558613387729083.
Повний текст джерелаLi, Qi. "Interactions between Visual Attention and Visual Working Memory." Kyoto University, 2015. http://hdl.handle.net/2433/199403.
Повний текст джерела0048
新制・課程博士
博士(人間・環境学)
甲第19079号
人博第732号
新制||人||176(附属図書館)
26||人博||732(吉田南総合図書館)
32030
京都大学大学院人間・環境学研究科共生人間学専攻
(主査)教授 齋木 潤, 教授 船橋 新太郎, 准教授 月浦 崇
学位規則第4条第1項該当
Milborrow, Stephen. "Locating facial features with active shape models." Master's thesis, University of Cape Town, 2007. http://hdl.handle.net/11427/5161.
Повний текст джерелаThis dissertation focuses on the problem of locating features in frontal views of upright human faces. The dissertation starts with the Active Shape Model of Cootes et al. [19] and extends it with the following techniques: 1. Selectively using two-instead of one-dimensional landmark profiles. 2. Stacking two Active Shape Models in series. 3. Extending the set of landmarks. 4. Trimming covariance matrices by setting most entries to zero. 5. Using other modifications such as adding noise to the training set. The resulting feature locater is shown to compare favorably with previously published methods.
NolÃto, Carleandro de Oliveira. "An authoring tool for location-based mobile games with augmented reality features." Universidade Federal do CearÃ, 2015. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=17053.
Повний текст джерелаLocation-based mobile games are a special type of game where location technologies are employed to track players and to alter the rules of the games. Such games are a subclass of pervasive games whose playability advances according to the location of players. This work proposes an authoring tool to develop location-based mobile games enhances with augmented reality features. This tool was conceived from research studies on authoring tools and pervasive games. By analysing the related works, we have compiled the most common features of location-based mobile games and the main aspects presented in authoring tools for developing these games. Moreover, we have used focus groups to both enhance the creation of new scenarios for location-based mobile games and improve the usage of augmented reality in such games. Ultimately, we have compiled a set of requirements to design a software architecture for the development of an authoring tool. The designed architecture is composed of a server to manage running games, a web based system for developing these games, and a mobile application in which the games are executed. The main goal of this work is to provide a software solution that allows non-programmers to design, build and execute location-based mobile games. To assess the proposed work, we have designed and implemented a game called "Battle for Fortaleza" using the authoring tool. Besides, we have conducted interviews with users to validate the utility and the easiness of the tool to develop location-based mobile games.
Jogos mÃveis baseados em localizaÃÃo sÃo aqueles que fazem uso de tecnologias de localizaÃÃo e que agregam a posiÃÃo de seus jogadores nas regras do jogo. Estes jogos sÃo uma subclasse de jogos pervasivos em que a jogabilidade progride de acordo com a localizaÃÃo do jogador. Neste trabalho à proposta uma ferramenta de autoria para a criaÃÃo de jogos mÃveis baseados em localizaÃÃo, acrescidos com recursos de realidade aumentada. A concepÃÃo desta ferramenta foi feita com base em uma revisÃo da literatura sobre ferramentas de autoria e jogos pervasivos. A partir de trabalhos relacionados, buscou-se recolher as caracterÃsticas comuns de jogos mÃveis baseados em localizaÃÃo e caracterÃsticas de ferramentas de autoria para estes jogos. AlÃm disso, utilizou-se grupos focais para refinar os novos cenÃrios para jogos mÃveis baseados em localizaÃÃo, em particular a respeito de como a realidade aumentada pode ser utilizada nestes jogos. Com o estudo de ambos, na revisÃo da literatura e nos grupos focais foi produzido um conjunto de requisitos para projetar uma arquitetura de software para o desenvolvimento de uma ferramenta de criaÃÃo. Esta arquitetura à composta de um servidor para gerenciar os jogos em execuÃÃo, uma aplicaÃÃo baseada na web que permite a autoria dos jogos e um aplicativo para dispositivos mÃveis onde sÃo executados os jogos desenvolvidos. Nosso principal objetivo à fornecer uma soluÃÃo de software para permitir que usuÃrios nÃo-programadores possam projetar, construir e executar jogos mÃveis baseados em localizaÃÃo. A fim de avaliar a nossa ferramenta, foi projetado e implementado um jogo chamado âBatalha por Fortalezaâ, em que as funcionalidades da ferramentas sÃo demonstradas. AlÃm disso, buscou-se validar, com usuÃrios, se a ferramenta proposta consegue auxiliar na criaÃÃo de jogos de maneira fÃcil e intuitiva.
Nelson, Jonas. "Methods for Locating Distinct Features in Fingerprint Images." Thesis, Linköping University, Department of Science and Technology, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-1147.
Повний текст джерелаWith the advance of the modern information society, the importance of reliable identity authentication has increased dramatically. Using biometrics as a means for verifying the identity of a person increases both the security and the convenience of the systems. By using yourself to verify your identity such risks as lost keys and misplaced passwords are removed and by virtue of this, convenience is also increased. The most mature and well-developed biometric technique is fingerprint recognition. Fingerprints are unique for each individual and they do not change over time, which is very desirable in this application. There are multitudes of approaches to fingerprint recognition, most of which work by identifying so called minutiae and match fingerprints based on these.
In this diploma work, two alternative methods for locating distinct features in fingerprint images have been evaluated. The Template Correlation Method is based on the correlation between the image and templates created to approximate the homogenous ridge/valley areas in the fingerprint. The high-dimension of the feature vectors from correlation is reduced through principal component analysis. By visualising the dimension reduced data by ordinary plotting and observing the result classification is performed by locating anomalies in feature space, where distinct features are located away from the non-distinct.
The Circular Sampling Method works by sampling in concentric circles around selected points in the image and evaluating the frequency content of the resulting functions. Each images used here contains 30400 pixels which leads to sampling in many points that are of no interest. By selecting the sampling points this number can be reduced. Two approaches to sampling points selection has been evaluated. The first restricts sampling to occur only along valley bottoms of the image, whereas the second uses orientation histograms to select regions where there is no single dominant direction as sampling positions. For each sampling position an intensity function is achieved by circular sampling and a frequency spectrum of this function is achieved through the Fast Fourier Transform. Applying criteria to the relationships of the frequency components classifies each sampling location as either distinct or non-distinct.
Using a cyclic approach to evaluate the methods and their potential makes selection at various stages possible. Only the Circular Sampling Method survived the first cycle, and therefore all tests from that point on are performed on thismethod alone. Two main errors arise from the tests, where the most prominent being the number of spurious points located by the method. The second, which is equally serious but not as common, is when the method misclassifies visually distinct features as non-distinct. Regardless of the problems, these tests indicate that the method holds potential but that it needs to be subject to further testing and optimisation. These tests should focus on the three main properties of the method: noise sensitivity, radial dependency and translation sensitivity.
Andrade, Mariana de Carvalho Cardoso Gonçalves. "The influence of landscape and seascape features in the location of underwater recreation sites." Master's thesis, ISA/UL, 2015. http://hdl.handle.net/10400.5/11216.
Повний текст джерелаThis study aims to use the SCUBA diving activity as a mean to analyse the different components of the coastal and underwater landscape, since this recreational activity is intimately related to the processes that occur in these environments. With this approach, it is expected to enlarge the scope of landscape architecture to the underwater scenery. It intends to analyse the characteristics of each dive site individually, in relation to their neighbourhood and also the whole study area, looking to detect associations between these characteristics and their presence. Several dive centres were contacted in order to obtain data. The data gathered corresponds to the dive sites’ location as well as the frequency of visits in 2011, 2012 and 2013. The method used was based on the application of metrics used in other research contexts (e.g.: landscape ecology; urban planning). On a second phase, using an adequate regression equation applied through the “Stepwise” technique, a few variables were statistically classified as relevant for the occurrence of dive sites. The result is one model that allows us to interpret the reasons that could justify the dive sites observed and to define a probability of their future existence in the remaining seascape
Vitas, Marko. "Designing mobile ambient applications." Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-14191.
Повний текст джерела(UPC), Universidad Peruana de Ciencias Aplicadas, and Pohl Milon. "SmartPhones feat SmartMolecules: eBioPhy brings rapid diagnosis to remote locations." Universidad Peruana de Ciencias Aplicadas (UPC), 2015. http://hdl.handle.net/10757/344615.
Повний текст джерелаProyecto financiado por el FINCyT y el Gobierno de Canadá (Grand Challenges Canada, Bold Idea with Bog impact). Se inicia inica en Octubre 2014 y finaliza en Abril 2016. La instituciones particpantes son Universidad Peruana de Ciencias Aplicadas - UPC y el Instituto de Investigación Nutricional - IIN. Lima, Perú
Braun, Edna. "Reverse Engineering Behavioural Models by Filtering out Utilities from Execution Traces." Thèse, Université d'Ottawa / University of Ottawa, 2013. http://hdl.handle.net/10393/26093.
Повний текст джерелаIeva, Carlo. "Révéler le contenu latent du code source : à la découverte des topoi de programme." Thesis, Montpellier, 2018. http://www.theses.fr/2018MONTS024/document.
Повний текст джерелаDuring the development of long lifespan software systems, specification documents can become outdated or can even disappear due to the turnover of software developers. Implementing new software releases or checking whether some user requirements are still valid thus becomes challenging. The only reliable development artifact in this context is source code but understanding source code of large projects is a time- and effort- consuming activity. This challenging problem can be addressed by extracting high-level (observable) capabilities of software systems. By automatically mining the source code and the available source-level documentation, it becomes possible to provide a significant help to the software developer in his/her program understanding task.This thesis proposes a new method and a tool, called FEAT (FEature As Topoi), to address this problem. Our approach automatically extracts program topoi from source code analysis by using a three steps process: First, FEAT creates a model of a software system capturing both structural and semantic elements of the source code, augmented with code-level comments; Second, it creates groups of closely related functions through hierarchical agglomerative clustering; Third, within the context of every cluster, functions are ranked and selected, according to some structural properties, in order to form program topoi.The contributions of the thesis is three-fold:1) The notion of program topoi is introduced and discussed from a theoretical standpoint with respect to other notions used in program understanding ;2) At the core of the clustering method used in FEAT, we propose a new hybrid distance combining both semantic and structural elements automatically extracted from source code and comments. This distance is parametrized and the impact of the parameter is strongly assessed through a deep experimental evaluation ;3) Our tool FEAT has been assessed in collaboration with Software Heritage (SH), a large-scale ambitious initiative whose aim is to collect, preserve and, share all publicly available source code on earth. We performed a large experimental evaluation of FEAT on 600 open source projects of SH, coming from various domains and amounting to more than 25 MLOC (million lines of code).Our results show that FEAT can handle projects of size up to 4,000 functions and several hundreds of files, which opens the door for its large-scale adoption for program understanding
Lewis, Alice. "CASE STUDY FOR A LIGHTWEIGHT IMPACT ANALYSIS TOOL." Kent State University / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=kent1240179121.
Повний текст джерелаAlhindawi, Nouh Talal. "Supporting Source Code Comprehension During Software Evolution and Maintenance." Kent State University / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=kent1374790792.
Повний текст джерелаDvořák, Pavel. "Popis objektů v obraze." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2011. http://www.nusl.cz/ntk/nusl-218957.
Повний текст джерелаAl-Msie', Deen Ra'Fat. "Construction de lignes de produits logiciels par rétro-ingénierie de modèles de caractéristiques à partir de variantes de logiciels : l'approche REVPLINE." Thesis, Montpellier 2, 2014. http://www.theses.fr/2014MON20024/document.
Повний текст джерелаThe idea of Software Product Line (SPL) approach is to manage a family of similar software products in a reuse-based way. Reuse avoids repetitions, which helps reduce development/maintenance effort, shorten time-to-market and improve overall quality of software. To migrate from existing software product variants into SPL, one has to understand how they are similar and how they differ one from another. Companies often develop a set of software variants that share some features and differ in other ones to meet specific requirements. To exploit existing software variants and build a software product line, a feature model must be built as a first step. To do so, it is necessary to extract mandatory and optional features in addition to associate each feature with its name. Then, it is important to organize the mined and documented features into a feature model. In this context, our thesis proposes three contributions.Thus, we propose, in this dissertation as a first contribution a new approach to mine features from the object-oriented source code of a set of software variants based on Formal Concept Analysis, code dependency and Latent Semantic Indexing. The novelty of our approach is that it exploits commonality and variability across software variants, at source code level, to run Information Retrieval methods in an efficient way. The second contribution consists in documenting the mined feature implementations based on Formal Concept Analysis, Latent Semantic Indexing and Relational Concept Analysis. We propose a complementary approach, which aims to document the mined feature implementations by giving names and descriptions, based on the feature implementations and use-case diagrams of software variants. The novelty of our approach is that it exploits commonality and variability across software variants, at feature implementations and use-cases levels, to run Information Retrieval methods in an efficient way. In the third contribution, we propose an automatic approach to organize the mined documented features into a feature model. Features are organized in a tree which highlights mandatory features, optional features and feature groups (and, or, xor groups). The feature model is completed with requirement and mutual exclusion constraints. We rely on Formal Concept Analysis and software configurations to mine a unique and consistent feature model. To validate our approach, we applied it on three case studies: ArgoUML-SPL, Health complaint-SPL, Mobile media software product variants. The results of this evaluation validate the relevance and the performance of our proposal as most of the features and its constraints were correctly identified
Zhang, Zai Yong. "Simultaneous fault diagnosis of automotive engine ignition systems using pairwise coupled relevance vector machine, extracted pattern features and decision threshold optimization." Thesis, University of Macau, 2011. http://umaclib3.umac.mo/record=b2493967.
Повний текст джерелаCatling, Aaron. "The Ending Needs Work AKA the Good, the Bad and the Ugly of being an independent filmmaker in Australia." Thesis, Queensland University of Technology, 2005. https://eprints.qut.edu.au/16091/1/Aaron_Catling_Thesis.pdf.
Повний текст джерелаCatling, Aaron. "The Ending Needs Work AKA the Good, the Bad and the Ugly of being an independent filmmaker in Australia." Queensland University of Technology, 2005. http://eprints.qut.edu.au/16091/.
Повний текст джерелаSchunnesson, Håkan. "Drill process monitoring in percussive drilling for location of structural features, lithological boundaries and rock properties, and for drill productivity evaluation." Doctoral thesis, Luleå tekniska universitet, Institutionen för samhällsbyggnad och naturresurser, 1997. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-26697.
Повний текст джерелаGodkänd; 1997; 20061128 (haneit)
Lomax, Jamie R., John P. Wisniewski, Carol A. Grady, Michael W. McElwain, Jun Hashimoto, Tomoyuki Kudo, Nobuhiko Kusakabe, et al. "CONSTRAINING THE MOVEMENT OF THE SPIRAL FEATURES AND THE LOCATIONS OF PLANETARY BODIES WITHIN THE AB AUR SYSTEM." IOP PUBLISHING LTD, 2016. http://hdl.handle.net/10150/622048.
Повний текст джерелаStoppel, Christian Michael [Verfasser], and Mircea Ariel [Akademischer Betreuer] Schönfeld. "Neural mechanisms of attentional selection in vision : locations, features, and objects / Christian Michael Stoppel. Betreuer: Mircea Ariel Schönfeld." Magdeburg : Universitätsbibliothek, 2011. http://d-nb.info/105144554X/34.
Повний текст джерелаBallarin, Naya Manuel. "Definition of Descriptive and Diagnostic Measurements for Model Fragment Retrieval." Doctoral thesis, Universitat Politècnica de València, 2021. http://hdl.handle.net/10251/171604.
Повний текст джерела[ES] Hoy en día, el software existe en casi todo. Las empresas a menudo desarrollan y mantienen colecciones de sistemas de software personalizados que comparten algunas características entre ellos, pero que también tienen otras características particulares. Conforme el número de características y el número de variantes de un producto crece, el mantenimiento del software se vuelve cada vez más complejo. Para hacer frente a esta situación la Comunidad de Ingeniería del Software basada en Modelos está abordando una actividad clave: la Localización de Fragmentos de Modelo. Esta actividad consiste en la identificación de elementos del modelo que son relevantes para un requisito, una característica o un bug. Durante los últimos años se han propuesto muchos enfoques para abordar la identificación de los elementos del modelo que corresponden a una funcionalidad en particular. Sin embargo, existe una carencia a la hora de cómo se reportan las medidas del espacio de búsqueda, así como las medidas de la solución a encontrar. El objetivo de nuestra tesis radica en proporcionar a la comunidad dedicada a la actividad de localización de fragmentos de modelo una serie de medidas (tamaño, volumen, densidad, multiplicidad y dispersión) para reportar los problemas de localización de fragmentos de modelo. El uso de estas novedosas medidas ayuda a los investigadores durante la creación de nuevos enfoques, así como la mejora de aquellos enfoques ya existentes. Mediante el uso de dos casos de estudio reales e industriales, esta tesis pone en valor la importancia de estas medidas para comparar resultados de diferentes enfoques de una manera precisa. Los resultados de este trabajo han sido redactados y publicados en foros, conferencias y revistas especializadas en los temas y contexto de la investigación. Esta tesis se presenta como un compendio de artículos acorde a la regulación de la Universitat Politècnica de València. Este documento de tesis presenta los temas, el contexto y los objetivos de la investigación. Presenta las publicaciones académicas que se han publicado como resultado del trabajo y luego analiza los resultados de la investigación.
[CA] Hui en dia, el programari existix en quasi tot. Les empreses sovint desenrotllen i mantenen col·leccions de sistemes de programari personalitzats que compartixen algunes característiques entre ells, però que també tenen altres característiques particulars. Conforme el nombre de característiques i el nombre de variants d'un producte creix, el manteniment del programari es torna cada vegada més complex. Per a fer front a esta situació la Comunitat d'Enginyeria del Programari basada en Models està abordant una activitat clau: la Localització de Fragments de Model. Esta activitat consistix en la identificació d'elements del model que són rellevants per a un requisit, una característica o un bug. Durant els últims anys s'han proposat molts enfocaments per a abordar la identificació dels elements del model que corresponen a una funcionalitat en particular. No obstant això, hi ha una carència a l'hora de com es reporten les mesures de l'espai de busca, així com les mesures de la solució a trobar. L'objectiu de la nostra tesi radica a proporcionar a la comunitat dedicada a l'activitat de localització de fragments de model una sèrie de mesures (grandària, volum, densitat, multiplicitat i dispersió) per a reportar els problemes de localització de fragments de model. L'ús d'estes noves mesures ajuda als investigadors durant la creació de nous enfocaments, així com la millora d'aquells enfocaments ja existents. Per mitjà de l'ús de dos casos d'estudi reals i industrials, esta tesi posa en valor la importància d'estes mesures per a comparar resultats de diferents enfocaments d'una manera precisa. Els resultats d'este treball han sigut redactats i publicats en fòrums, conferències i revistes especialitzades en els temes i context de la investigació. Esta tesi es presenta com un compendi d'articles d'acord amb la regulació de la Universitat Politècnica de València. Este document de tesi presenta els temes, el context i els objectius de la investigació. Presenta les publicacions acadèmiques que s'han publicat com resultat del treball i després analitza els resultats de la investigació.
[EN] Nowadays, software exists in almost everything. Companies often develop and maintain a collection of custom-tailored software systems that share some common features but also support customer-specific ones. As the number of features and the number of product variants grows, software maintenance is becoming more and more complex. To keep pace with this situation, Model-Based Software Engineering Community is addressing a key-activity: Model Fragment Location (MFL). MFL aims at identifying model elements that are relevant to a requirement, feature, or bug. Many MFL approaches have been introduced in the last few years to address the identification of the model elements that correspond to a specific functionality. However, there is a lack of detail when the measurements about the search space (models) and the measurements about the solution to be found (model fragment) are reported. The goal of this thesis is to provide insights to MFL Research Community of how to improve the report of location problems. We propose using five measurements (size, volume, density, multiplicity, and dispersion) to report the location problems during MFL. The usage of these novel measurements support researchers during the creation of new MFL approaches and during the improvement of those existing ones. Using two different case studies, both real and industrial, we emphasize the importance of these measurements in order to compare results in a deeply way. The results of the research have been redacted and published in forums, conferences, and journals specialized in the topics and context of the research. This thesis is presented as compendium of articles according the regulations in Universitat Politècnica de València. This thesis document introduces the topics, context, and objectives of the research, presents the academic publications that have been published as a result of the work, and then discusses the outcomes of the investigation.
Ballarin Naya, M. (2021). Definition of Descriptive and Diagnostic Measurements for Model Fragment Retrieval [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/171604
TESIS
Compendio
McLoughlin, Aaron. "Gravy." Thesis, Queensland University of Technology, 2012. https://eprints.qut.edu.au/50947/1/Aaron_McLoughlin_Thesis.pdf.
Повний текст джерелаGhabach, Eddy. "Prise en charge du « copie et appropriation » dans les lignes de produits logiciels." Thesis, Université Côte d'Azur (ComUE), 2018. http://www.theses.fr/2018AZUR4056/document.
Повний текст джерелаA Software Product Line (SPL) manages commonalities and variability of a related software products family. This approach is characterized by a systematic reuse that reduces development cost and time to market and increases software quality. However, building an SPL requires an initial expensive investment. Therefore, organizations that are not able to deal with such an up-front investment, tend to develop a family of software products using simple and intuitive practices. Clone-and-own (C&O) is an approach adopted widely by software developers to construct new product variants from existing ones. However, the efficiency of this practice degrades proportionally to the growth of the family of products in concern, that becomes difficult to manage. In this dissertation, we propose a hybrid approach that utilizes both SPL and C&O to develop and evolve a family of software products. An automatic mechanism of identification of the correspondences between the features of the products and the software artifacts, allows the migration of the product variants developed in C&O in an SPL The originality of this work is then to help the derivation of new products by proposing different scenarios of C&O operations to be performed to derive a new product from the required features. The developer can then reduce these possibilities by expressing her preferences (e.g. products, artifacts) and using the proposed cost estimations on the operations. We realized our approach by developing SUCCEED, a framework for SUpporting Clone-and-own with Cost-EstimatEd Derivation. We validate our works on a case study of families of web portals
Drochytka, Jan. "Vliv specifické lokality na cenu rezidenčního objektu na Brněnsku." Master's thesis, Vysoké učení technické v Brně. Ústav soudního inženýrství, 2020. http://www.nusl.cz/ntk/nusl-413826.
Повний текст джерелаHung, Kun-Ting, and 洪昆鼎. "A Real-time Face and Feature Location System." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/83697093429475909812.
Повний текст джерела國立中興大學
資訊科學系所
94
Face detection and feature location are the pre-processing of many facial researches having the condition of limit face size and the environment to detect the faces. Our proposed method is able to detect face in a complex environment and light conditions, even if the resolution of the image is low. For the part of face detection, we use rectangle features and integral image to instead of using traditional pixel based methods. In this method, we use Adaboost algorithm to obtain rectangle features for different face. A different weight can be updated automatically to classify the feature of face by using this algorithm. In order to keep the face-like region, we apply the method of cascade in which the background region can be discarded more quickly to separate with the face-like region. In the part of feature detection, we identify the region of face by using previous steps and locate the organs of face via the relative position. Then, we can get the exact point of feature based on the color and edge information. To reduce the error rate of identification, the character of moving image can be used here as a reference in which the continuous frame having the feature of slight change within 5fps in general. Thus, we can discard the diverse frame and replace it with the previous five frames.
Huang, Yi-Yun, and 黃怡昀. "A study of point location of Fingerprint feature." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/d3zb73.
Повний текст джерела中原大學
應用數學研究所
107
The unique nature of fingerprints can be used to identify identity. Access control and criminal investigation are two major fields that take advantages of the unique nature of fingerprints. In the process of fingerprint analysis, fingerprint comparison through the position of singular points to confirm whether there are the same fingerprint. Therefore, the positioning accuracy of singular point is very important. The definition of the position of singular points in Henry and FBI are very hard to implement by computer programs. They must rely on human experts to locate, and the positioning method is more subjective than computational definitions. Liu uses a deep neural network to propose a the method of computational definition of singular point. The proposed method defines singular point at the pixel level and efficiently define singular point. in a very small circle In this paper, the experiment verify correctness of the algorithm for defining the position of the singular point according to the method of "Fingerprint Analysis and Singular Point Definition by Deep Neural Network" published by Liu in 2018 , and determine if it can be located at the actual location of singular point . The results suggested that the algorithm is prone to the problem of positioning offset on the fingerprint of loop type. In addition, the idea of correcting offset positioning has also been proposed in this paper.
Rohatgi, Abhishek. "An approach towards feature location based on impact analysis." Thesis, 2008. http://spectrum.library.concordia.ca/975920/1/MR45500.pdf.
Повний текст джерелаHoseini, Salman. "Software Feature Location in Practice: Debugging Aircraft Simulation Systems." Thesis, 2013. http://spectrum.library.concordia.ca/978135/1/Hoseini_MASc_S2014.pdf.
Повний текст джерелаLee, Jhe-An, and 李哲安. "License Plate Location based on Multi-Resolution Fractal Feature Vector." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/85869734328053350490.
Повний текст джерела銘傳大學
資訊工程學系碩士班
103
Due to the rapid growth of developing countries, the demand of vehicles increased astonishingly. In dealing with the complexity of transportation management, license plate recognition has become an important topic, in which many researches were involved particularly in the field of computer vision. In the process of license plate recognition, the most critical and difficult operation is locating the positioning of a license plate. Not only interfered by external environmental factors, the difference in license plate design of the various countries and regions accumulates the challenges. Many proposed methods have preset restrictions. When encountering relatively poor external environment, some recognition systems could not cope condition effectively. In this study, an efficient pre-processing algorithms is introduced in order to reduce the external interference on the image quality of license plates. Meanwhile candidate-positions of license plate is generated. Thereafter, a multi-resolution analyze is activated and fractal feature vector will be extracted to train classifier. That simply allows the system to adapt to all changes. The present study shows, under different angles, different formats and different lighting conditions, the proposed method is able to identify license plate location errorless, and reject non-license plate image nearly perfect.
WANG, PAO HSIANG, and 王保翔. "Location-based Feature Extraction and Associative Classification for Quality Prediction." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/x5kutd.
Повний текст джерела中原大學
資訊工程研究所
106
This thesis aims at finding spatial relationships between target objects and surrounding objects of various types. We consider hotels as target objects. The types of other objects surrounding the hotels and their quantities may have impacts on the ratings of hotels. We propose an approach to extract environmental features based on different distances. In our approach, within a certain distance the number of objects surrounding each hotel is computed to form its environmental features. After that, for each type of surrounding objects, only a portion of features are chosen to discover association rules with respect to hotel rating. A classifier can be built after these rules are sorted and pruned. Experimental data are the ratings of legal hotels announced by the Tourism Bureau in Taiwan and the objects of 50 types on Google map together with their distance information. According to different distances, or various degrees of correlation with hotel ratings, we respectively extract features and then generate association rules and the corresponding classifier. In this way, we can observe the influence of the distance or correlation degree on the classification accuracy. The best set of features can achieve an average precision of 93%. In order to verify whether the discovered association rules are in line with people’s general cognition of the factors affecting hotel quality, we label the association rules in the classifier by manual inspection. The results produced by the best set of features show that 85% of the association rules in the classifier are considered reasonable.
Chou, Yi-chin, and 周逸秦. "License plate location based on Haar-like features." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/07582850215571991891.
Повний текст джерела國立屏東教育大學
資訊科學系
98
In the traditional way, license plate location and normalization are very important stages in license plate recognition for automated transport system. In the literature, the processing of Automatic license plate recognition system includes two parts: (1) To extract the license plate region from an image. (2) To recognize character from license plate region. In the processing, the situation and enviroment of shooting always affect the result of license plate recoginition. Therefore, we are devote to improving the detection rate of license plate location for improving the recongition rate of license plate recongition. In this research, we introduce the digital image processing techniques, and rapid object detection based-on the Haar-like features. First, we train samples of characters to generate feature files, and then to detect the license plate region with features in image.In the experiment, we use two ways to test the license plate location in the 0°, 10° and 15° image. Finally, the results of experiment show that successful detection rate of license plate location is very well.
Al-Dahoud, A., and Hassan Ugail. "A method for location based search for enhancing facial feature design." 2016. http://hdl.handle.net/10454/9482.
Повний текст джерелаIn this paper we present a new method for accurate real-time facial feature detection. Our method is based on local feature detection and enhancement. Previous work in this area, such as that of Viola and Jones, require looking at the face as a whole. Consequently, such approaches have increased chances of reporting negative hits. Furthermore, such algorithms require greater processing power and hence they are especially not attractive for real-time applications. Through our recent work, we have devised a method to identify the face from real-time images and divide it into regions of interest (ROI). Firstly, based on a face detection algorithm, we identify the face and divide it into four main regions. Then, we undertake a local search within those ROI, looking for specific facial features. This enables us to locate the desired facial features more efficiently and accurately. We have tested our approach using the Cohn-Kanade’s Extended Facial Expression (CK+) database. The results show that applying the ROI has a relatively low false positive rate as well as provides a marked gain in the overall computational efficiency. In particular, we show that our method has a 4-fold increase in accuracy when compared to existing algorithms for facial feature detection.
ZHENG, KAI-YUAN, and 鄭開元. "Feature Selection Method Based On Term Frequency, Location And Category Relations." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/n7n4j2.
Повний текст джерела銘傳大學
資訊管理學系碩士班
106
With the advent of the age of big data, how to analyze and mine data has become an important topic today. Text mining is an important part of data analysis that focuses on the analysis of text data. It can help people get the information in the text more quickly and effectively. As an important branch of text mining, text classification is mainly the process of assigning texts to a specific category by using an algorithm in a given classification system. It is widely used in the application of rapid classification of press and publication products, web page classification, personalized news wisdom recommendation, spam filtering, user analysis, etc. The general Chinese text classification will be divided into several steps such as text preprocessing, feature selection and building a word vector matrix, constructing the classifier and testing, and classifier performance evaluation. Faced with the feature word set after the text is preprocessed, we often need to use feature selection to reduce the dimension of the feature word set to avoid problems such as inefficiency and ‘dimensional disaster’. And a good feature selection method will affect the subsequent classification effect directly. Therefore, the improvement of existing feature selection methods deserves further study and discussion. For this reason, this paper focuses on the shortcomings of feature selection by introducing the importance of term location, the term frequency of inter-category relationship, the term frequency of intra-class relationship, the degree of inter-class concentration, and the degree of intra-class dispersion. The Chi-square and the cross-entropy are improved, and a Chinese text classification algorithm based on multiple factors is proposed. The improved method of the present study is better than other methods in comparing F1 values of category items. It is more stable than other methods in classifying unbalanced documents. Whether it is a balanced document dataset or an unbalanced document dataset, our feature selection method proposed in this study does have a significant improvement over traditional methods and other methods.
Bo-HengChen and 陳泊亨. "Temporal Recommendation with Event Features in Location-aware Databases." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/ey8d8s.
Повний текст джерела國立成功大學
多媒體系統與智慧型運算工程博士學位學程
107
With the advance in mobile devices and various sensors, many events can be noted as spatio-temporal records such as crime data, traffic data, and check-in data, and so on. Spatio-temporal mining has become the emerging research fields that attract a lot of attention. How to extract and analyze in location-aware databases for mining patterns and recommending friends or point-of-interest has become an attractive and challenging issue over the past few years. In this dissertation, we develop a series of novel and effective data mining frameworks for mining spaito-temporal chaining patterns, actively inferring acquaintance and recommending shielding check-in. Mining Spatio-Temporal Chaining Patterns with Non-identity Event in Location-aware Databases: Spatio-temporal pattern mining attempts to discover unknown, potentially interesting and useful event sequences in which events occur within a specific time interval and spatial region. In the literature, mining of spatio-temporal sequential patterns generally relies on the existence of identity information for the accumulation of pattern appearances. For the recent trend of open data, which are mostly released without the specific identity information due to privacy concern, previous work will encounter the challenging difficulty to properly transform such extit{non-identity data into the mining process. In this work, we propose a practical approach, called emph{Top K Spatio-Temporal Chaining Patterns Discovery (abbreviated as emph{TKSTP), to discover frequent spatio-temporal chaining patterns. The emph{TKSTP framework is applied on two real criminal datasets which are released without the identity information. Our experimental studies show that the proposed framework effectively discovers high-quality spatio-temporal chaining patterns. In addition, case studies of crime pattern analysis also demonstrate their applicability and reveal several interestingly hidden phenomenons. Active Learning-based Approach for Acquaintance Inference with Check-in Event Features in Location-aware Databases: With the popularity of mobile devices and various sensors, the local geographical activities of human beings can be easily accessed than ever. Yet due to the privacy concern, it is difficult to acquire the social connections among people possessed by services providers, which can benefit applications such as identifying terrorists and recommender systems. In this work, we propose the extit{Location-aware Acquaintance Inference (LAI) problem, which aims at finding the acquaintances for any given query individual based on extit{solely people's extit{local geographical activities, such as geo-tagged posts in Instagram and meeting events in Meetup, within a targeted geo-spatial area. We propose to leverage the concept of extit{active learning to tackle the LAI problem. We develop a novel semi-supervised model, extit{Active Learning-enhanced Random Walk (ARW), which imposes the idea of active learning into the technique of Random Walk with Restart (RWR) in an extit{activity graph. Specifically, we devise a series of extit{Candidate Selection strategies to select unlabeled individuals for labeling, and perform the different extit{Graph Refinement mechanisms that reflect the labeling feedback to guide the RWR random surfer. Experiments conducted on Instagram and Meetup datasets exhibit the promising performance, compared with a set of state-of-the-art methods. With a series of empirical settings, ARW is demonstrated to derive satisfying results of acquaintance inference in different real scenarios. Shielding Check-in Recommendation against Acquaintance Inference with Check-in Event Features in Location-aware Databases: Location-based social services such as Foursquare and Facebook Place allow users to perform check-ins at places and interact with each other in geography (e.g. check-in together). While existing studies have exhibited that the adversary can accurately infer social ties based on check-in data, the traditional check-in mechanism cannot protect the acquaintance privacy of users. Therefore, we propose a novel extit{shielding check-in system, whose goal is to guide users to check-in at secure places. We accordingly propose a novel research problem, extit{Check-in Shielding against Acquaintance Inference (CSAI), which aims at recommending a list of secure places when users intend to check-ins so that the potential that the adversary correctly identifies the friends of users can be significantly reduced. We develop the extit{Check-in Shielding Scheme (CSS) framework to solve the CSAI problem. CSS consists of two steps, namely estimating the social strength between users and generating a list of secure places. Experiments conducted on Foursquare and Gowalla check-in datasets show that CSS is able to not only outperform several competing methods under various scenario settings, but also lead to the check-in distance preserving and ensure the usability of the new check-in data in Point-of-Interest (POI) recommendation.
Lin, Szu-Hung, and 林思宏. "The Role of Non-Spatial Features in Location Negative Priming." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/02060328088874431277.
Повний текст джерела臺灣大學
心理學研究所
96
Using static displays, we investigated the role of non-spatial features in the location negative priming effect. Participants responded to the location of a pre-defined color while ignoring a distractor on screen. Identity was irrelevant to the task. A small set of stimuli was presented repetitively in Experiment 1 so that the activation of each stimulus identity was high and competition from the distractor was strong. Location positive and negative priming effects were observed. A large set of non-repeated stimuli was used in Experiment 2 to reduce the competition imposed by the distractor. Location negative priming was not found, although positive priming was still observed. Experiment 3 used a small set of repeated stimuli, but the target and the distractor colors were randomly defined in each trial while the stimulus colors in the probe trials were unrelated to those of the prime stimuli. Negative location effects were observed, but identity priming effects were not observed. The results showed that identity and location are processed independently. Strong competition based on the whole object including the task-irrelevant identity feature is important to activate the inhibitory mechanisms. Once instigated, inhibition operated selectively on the goal-relevant feature of location. Color, the task-defining feature for selection, influences how location is processed but is inessential in triggering the retrieval of location information.
Gao, Di. "Identification and location derivation of grapevine features through point clouds." Thesis, 2014. http://hdl.handle.net/2440/99572.
Повний текст джерелаThesis (M.Eng.Sc.) -- University of Adelaide, School of Mechanical Engineering, 2014.
Yusuff, Adedayo Ademola. "Ultra fast fault feature extraction and diagnosos in power transmission lines." 2012. http://encore.tut.ac.za/iii/cpro/DigitalItemViewPage.external?sp=1000498.
Повний текст джерелаDiscusses how to mitigate unnecessary and expensive damage to a power transmission grid, the purpose of this work are therefore: to identify the unique signature of various types of short circuit faults on electric power transmission lines. To formulate mathematical techniques for the characterisation of faults on the electric power transmission grid.To evaluate algorithms that can classify various types of short circuit faults on electric power transmission lines. To develop an ultra fast fault diagnosis system. In addition, this work would make a contribution in the following areas: filtering of decaying DC offset in post fault measurement, formulation of a features extraction algorithm for all short circuit faults on electric transmission lines, evaluation of efficient classiers and regression algorithms, and formulation of faults diagnostic scheme for electric power transmission lines.
Lin, Jau-You, and 林昭佑. "A Study of Face Replacement Based on Facial Feature Location and Skin Color Consistence." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/39351018123058923077.
Повний текст джерела國立交通大學
電機與控制工程系所
93
Face replacement system plays an important role in the entertainment industries. Recently, however, most of these are assisted by hand and specific tools. Therefore, there are not many papers in this field. In this thesis, we describe a new face replacement system for automatically replacing a face with image processing. In the system, we segment the facial region by skin color analysis and morphology. Feature detection and connectivity analysis are applied to find candidates of facial feature. Then we combine mouth color analysis to obtaining features of the mouth. The eyes are located by geometric relation with mouth and projection function. We obtain features of the chin by information of gradient and entropy. Then we use the least square method to construct the chin line. We can wrap and locate the target face by feature matching. We extract skin color pixels on face region. We make the skin color of the original face similar to that of the original face by histogram matching. Image blending and smoothing is used to eliminate the seam. As can be seen, the experimental results show that this face replacement system has good performance if both original and target faces are front-facing as long as there are no large variations in illumination and skin tones.
Heffernan, Kevin Michael. "Locating the height features : evidence from Japanese." Thesis, 2002. http://hdl.handle.net/2429/13744.
Повний текст джерелаLam, Yin. "Comparing Naïve Bayes Classifiers with Support Vector Machines for Predicting Protein Subcellular Location Using Text Features." Thesis, 2010. http://hdl.handle.net/1974/5920.
Повний текст джерелаThesis (Master, Computing) -- Queen's University, 2010-07-06 11:06:47.613
Alharbi, Basma Mohammed. "Latent Feature Models for Uncovering Human Mobility Patterns from Anonymized User Location Traces with Metadata." Diss., 2017. http://hdl.handle.net/10754/623122.
Повний текст джерелаEvans, Hsiao-Chueh. "The flexibility of attentional control in selecting features and locations." 2010. https://scholarworks.umass.edu/dissertations/AAI3397698.
Повний текст джерела