Дисертації з теми "Structural edit"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-26 дисертацій для дослідження на тему "Structural edit".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
García, Hernández Carlos Jesús. "Structural Pattern Recognition for Chemical-Compound Virtual Screening." Doctoral thesis, Universitat Rovira i Virgili, 2021. http://hdl.handle.net/10803/673441.
Повний текст джерелаLas moléculas tienen la forma natural de redes, lo que las hace ideales para estudiar mediante el empleo de sus representaciones gráficas, donde los nodos representan los átomos y los bordes representan los enlaces químicos. Una alternativa para esta representación sencilla es el gráfico reducido extendido, que resume las estructuras químicas utilizando descripciones de nodos de tipo farmacóforo para codificar las propiedades moleculares relevantes. Una vez que tenemos una forma adecuada de representar moléculas como gráficos, debemos elegir la herramienta adecuada para compararlas y analizarlas. La distancia de edición de gráficos se utiliza para resolver la coincidencia de gráficos tolerante a errores; esta metodología estima una distancia entre dos gráficos determinando el número mínimo de modificaciones necesarias para transformar un gráfico en el otro. Estas modificaciones (conocidas como operaciones de edición) tienen un costo de edición (también conocido como costo de transformación) asociado, que debe determinarse en función del problema. Este estudio investiga la efectividad de una comparación molecular basada solo en gráficos que emplea gráficos reducidos extendidos y distancia de edición de gráficos como una herramienta para aplicaciones de detección virtual basadas en ligandos. Estas aplicaciones estiman la bioactividad de una sustancia química empleando la bioactividad de compuestos similares. Una parte esencial de este estudio se centra en el uso de técnicas de procesamiento de lenguaje natural y aprendizaje automático para optimizar los costos de transformación utilizados en las comparaciones moleculares con la distancia de edición de gráficos.
Molecules are naturally shaped as networks, making them ideal for studying by employing their graph representations, where nodes represent atoms and edges represent the chemical bonds. An alternative for this straightforward representation is the extended reduced graph, which summarizes the chemical structures using pharmacophore-type node descriptions to encode the relevant molecular properties. Once we have a suitable way to represent molecules as graphs, we need to choose the right tool to compare and analyze them. Graph edit distance is used to solve the error-tolerant graph matching; this methodology estimates a distance between two graphs by determining the minimum number of modifications required to transform one graph into the other. These modifications (known as edit operations) have an edit cost (also known as transformation cost) associated, which must be determined depending on the problem. This study investigates the effectiveness of a graph-only driven molecular comparison employing extended reduced graphs and graph edit distance as a tool for ligand-based virtual screening applications. Those applications estimate the bioactivity of a chemical employing the bioactivity of similar compounds. An essential part of this study focuses on using machine learning and natural language processing techniques to optimize the transformation costs used in the molecular comparisons with the graph edit distance. Overall, this work shows a framework that combines graph reduction and comparison with optimization tools and natural language processing to identify bioactivity similarities in a structurally diverse group of molecules. We confirm the efficiency of this framework with several chemoinformatic tests applied to regression and classification problems over different publicly available datasets.
Holmquist, Johan. "Formalisation of edit operations for structure editors." Thesis, Linköping University, Department of Computer and Information Science, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-5946.
Повний текст джерелаAlthough several systems with structure editors have been built, no model exist to formally describe the edit operations used in such editors. This thesis introduces such a model --- a formalism to describe general structure edit operations for text oriented documents. The model allows free bottom-up editing for any tree-based structural document with a textual content. It can also handle attribute and erroneous structures. Some classes of common structures have been identified and structure editor specifications constructed for them, which can be used and combined in the creation of other structure editors.
Darwiche, Mostafa. "When operations research meets structural pattern recognition : on the solution of error-tolerant graph matching problems." Thesis, Tours, 2018. http://www.theses.fr/2018TOUR4022/document.
Повний текст джерелаThis thesis is focused on Graph Matching (GM) problems and in particular the Graph Edit Distance (GED) problems. There is a growing interest in these problems due to their numerous applications in different research domains, e.g. biology, chemistry, computer vision, etc. However, these problems are known to be complex and hard to solve, as the GED is a NP-hard problem. The main objectives sought in this thesis, are to develop methods for solving GED problems to optimality and/or heuristically. Operations Research (OR) field offers a wide range of exact and heuristic algorithms that have accomplished very good results when solving optimization problems. So, basically all the contributions presented in thesis are methods inspired from OR field. The exact methods are designed based on deep analysis and understanding of the problem, and are presented as Mixed Integer Linear Program (MILP) formulations. The proposed heuristic approaches are adapted versions of existing MILP-based heuristics (also known as matheuristics), by considering problem-dependent information to improve their performances and accuracy
Ma, Yanhang. "Structural study of nano-structured materials: electron crystallography approaches." Doctoral thesis, Stockholms universitet, Institutionen för material- och miljökemi (MMK), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-129233.
Повний текст джерелаMamand, Heman. "The assessment of deteriorated concrete structures using extended digital image correlation (EDIC)." Thesis, University of Portsmouth, 2015. https://researchportal.port.ac.uk/portal/en/theses/the-assessment-of-deteriorated-concrete-structures-using-extended-digital-image-correlation-edic(91a6f1a9-6c0b-4b5c-8715-8edb4194ccac).html.
Повний текст джерелаMori, Tomoya. "Methods for Analyzing Tree-Structured Data and their Applications to Computational Biology." 京都大学 (Kyoto University), 2015. http://hdl.handle.net/2433/202741.
Повний текст джерелаStansberry, Tonya Faye. "Imprisoned and Empowered: The Women of Edith Wharton's Supernatural Fiction." [Johnson City, Tenn. : East Tennessee State University], 2003. http://etd-submit.etsu.edu/etd/theses/available/etd-0712103-091758/unrestricted/StansberryT072203f.pdf.
Повний текст джерелаTitle from electronic submission form. ETSU ETD database URN: etd-0712103-091758. Includes bibliographical references. Also available via Internet at the UMI web site.
Cheong, Elizabeth R. "The agricultural co-operative business structure in context a Western Australian study /." Connect to thesis, 2006. http://portal.ecu.edu.au/adt-public/adt-ECU2007.0022.html.
Повний текст джерелаKolli, Lakshmi Priya. "Mining for Frequent Community Structures using Approximate Graph Matching." University of Cincinnati / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1623166375110273.
Повний текст джерелаSwarts, Derek Juan. "Soil community structure and litter decomposition under irrigated Eucalyptus Globulus in South Western Australia." Connect to thesis, 2006. http://portal.ecu.edu.au/adt-public/adt-ECU2006.0051.html.
Повний текст джерелаCohen, Philippe. "Realisation dans le cadre d'une methode de conception orientee edif, d'un systeme de cao pour les vlsi." Paris 6, 1988. http://www.theses.fr/1988PA066156.
Повний текст джерелаChen, Jiehua [Verfasser], Rolf [Akademischer Betreuer] Niedermeier, Rolf [Gutachter] Niedermeier, Jérôme [Gutachter] Lang, and Edith [Gutachter] Elkind. "Exploiting structure in computationally hard voting problems / Jiehua Chen ; Gutachter: Rolf Niedermeier, Jérôme Lang, Edith Elkind ; Betreuer: Rolf Niedermeier." Berlin : Universitätsverlag der TU Berlin, 2016. http://d-nb.info/1156336538/34.
Повний текст джерелаBellet, Aurélien. "Supervised metric learning with generalization guarantees." Phd thesis, Université Jean Monnet - Saint-Etienne, 2012. http://tel.archives-ouvertes.fr/tel-00770627.
Повний текст джерелаMcCaffery, Martin. "The mat sat on the cat : investigating structure in the evaluation of order in machine translation." Thesis, University of St Andrews, 2017. http://hdl.handle.net/10023/12080.
Повний текст джерелаSilva, Junior Paulo Matias da. "Distância de edição para estruturas de dados." reponame:Repositório Institucional da UFABC, 2018.
Знайти повний текст джерелаCoorientador: Prof. Dr. Jerônimo Cordoni Pellegrini
Dissertação (mestrado) - Universidade Federal do ABC, Programa de Pós-Graduação em Ciência da Computação, Santo André, 2018.
O problema de distância de edição geral de árvores consiste na comparação de duas Árvores enraizadas e rotuladas a partir de operações de edição tais como a deleção e a inserção de nós, buscando obter o menor custo necessário para uma sequência de operações que transforme uma árvore em outra. Neste trabalho provamos que encontrar a maior subfloresta comum pela deleção de nós dentre duas árvores dadas, chamada de LCS-floresta, é um caso particular de distância de edição. Para o problema de encontrar a subárvore comum máxima entre duas árvores, existe uma demonstração feita por Valiente[Val02] de que esse problema é um caso particular de distância de edição considerando uma condição que preserva fortemente a ancestralidade entre os pares de nós das árvores comparadas. Realizamos uma demonstração alternativa para esse problema que toma por condição a existência de caminhos entre os pares de nós. Também estabelecemos uma hierarquia que relaciona as distâncias obtidas como solução desses três problemas, mostrando que a distância que se obtém como solução do problema de edição mais geral é limite inferior para a distância encontrada como solução do LCS-floresta, e esta última é limite inferior para a distância obtida com a subárvore comum máxima. Na segunda parte do trabalho, descrevemos as estruturas de dados como árvores enraizadas e rotuladas, assim pudemos aplicar o conceito de distância de edição e, com isso, analisar os custos para comparar uma estrutura de dados consigo mesma após uma sequência de operações. Para tal, modelamos os custos das operações nas árvores das respectivas estruturas considerando informações como o número de nós da árvore e o nível do nó que passou pela operação. Nos modelos de pilha, lista ligada e árvore de busca binária as distâncias de edição foram relacionadas às complexidades de tempo de se operar nessas estruturas. Adaptamos também os custos operacionais para tries e árvores B. Realizamos experimentos para calcular as distâncias de edição de uma estrutura de dados consigo mesma após uma sequência aleatória de operações com o intuito de verificar como essas medidas de distância atuavam sobre cada estrutura. Observamos nesses testes que o tamanho da sequência influencia na distância final. Também verificamos que os custos operacionais que consideram o nível do nó operado obtinham distâncias menores se comparadas com aquelas obtidas pelo custo de tamanho da estrutura.
The general tree edit distance problem consists in the comparison between two rooted labelled trees using operations which change one tree into another. The tree edit distance is defined as the minimum cost sequence of edit operations needed to transform two trees. The edit operations studied are inserting, deleting and replacing nodes. In this work, we prove that find the largest common subforest between trees restricted to node deletion, called LCS-forest, is a particular case of tree edit distance. Valiente [Val02] proved that find the maximum common subtree is a particular case of tree edit distance considering a ancestrality preserving condition, while we present an alternative proof using paths between pair of nodes. These three problems of distance are shown related in a hierarchy, where the general tree edit distance is a lower bound of the distance value obtained from LCS-forest solution. The latter is a lower bound of the distance obtained from maximum common subtree solution. In the second part of this work, we describe data structures as rooted labelled trees. Then it is possible to compare a data structure with itself after a sequence of operations applying the tree edit distance. For this, the model of operational cost of a tree considers information like number of nodes in the tree and level of operated node. The data structures modeled as trees were stack, linked list and binary search tree. The models associate the edit distance with the time complexities of these data structures operations. The operational costs of tries and B-trees also were adaptated for the edit distances. Some experiments to compute the distances are presented. They compare each data structure with itself after random sequences of operations. The results show how each proposed measure operate on the respective structure. The sequence size was an influence factor on distance values. For the operational costs, the cost defined as the level of operated nodes obtain smaller distances compared to the case of cost defined as the structure size.
Lee, Ji-Won. "Polymerisation chimique du 3,4-ethylenedioxythiophene (EDOT) par des tensioactifs oxydants en milieu homogène et en micelles inverses. Approche oligomère, réactivité et structure des polymères (PEDOTs)." Paris 7, 2003. http://www.theses.fr/2003PA077062.
Повний текст джерелаKorger, Edith [Verfasser], Vera [Akademischer Betreuer] Schlindwein, and Katrin [Akademischer Betreuer] Huhn. "Seismicity and structure of a magmatic accretionary centre at an ultraslow spreading ridge: The volcanic centre at 85°E/85°N, Gakkel Ridge / Edith Korger. Gutachter: Vera Schlindwein ; Katrin Huhn. Betreuer: Vera Schlindwein." Bremen : Staats- und Universitätsbibliothek Bremen, 2013. http://d-nb.info/1072156296/34.
Повний текст джерелаOrtega, Pérez Pascual. "La sociedad de las Tierras del Ebre: el señorio templario y hospitalario de Ribera d'Ebre y Terra Alta (1150-1350)." Doctoral thesis, Universitat Rovira i Virgili, 1995. http://hdl.handle.net/10803/671648.
Повний текст джерелаCon el presente trabajo hemos pretendido investigar la estructura y dinámica evolutiva de la parte de la formación social feudal catalanoaragonesa que se desarrolló en las comarcas de Ribera d'Ebre y Terra Alta, situadas en el suroeste de Catalunya, entre los ríos Ebre y Algars, un territorio que perteneció casi en su totalidad a la Orden del Temple y, luego de su abolición, a la del Hospital. Para nosotros tenía un triple interés. Su condición de primera adquisición militar extensa de aquella formación social permitía observar de cerca cómo se habían instaurado aquí las estructuras socioeconómicas dominantes y de qué forma habían evolucionado. El carácter de señorío de Orden religioso-militar abría la posibilidad de profundizar el estudio de la organización de estas milicias y su comportamiento en la faceta de señores de hombres y tierras. Por fin, la permanencia de población musulmana después de la conquista hacía viable el análisis, en su mismo origen, de las condiciones de sumisión de estas comunidades al nuevo poder. Este trabajo está organizado por secciones: La ocupación militar del territorio, la conformación del estado feudal, y la organización social de la tierra gestionada. También la explotación humana y económica del territorio, el dominio feudal sobre los habitantes y el excedente productivo, la estructura de poder de la clase dominante y el desarrollo organizativo de las comunidades de bajo estrato, tanto la Cristiana como la Sarracena. Este trabajo también incluye un epílogo, en el cual aparecen los elementos más importantes de las secciones anteriormente mencionadas por orden cronológico. Finalmente, también contiene un volumen de apéndices y un apéndice documental.
This work studies the dynamic and evolutionary structure of that part of the Catalan-Aragonese feudal formation, which took place in the regions of Ribera d’Ebre and Terra Alta, both of them located in the south-western part of Catalonia, between Tortosa (in the south) and Lérida (in the north) and the Ebro and Algars rivers. This land belonged in its entirity to the Temple Order and after its abolishion and a short period of royal administration, it came to belong to the Hospital Order. From an organizational point of view, it dealt with the Ascó, Horta and Miravet commands. The historical age being analized covers from the acquisition of the land by the Christian feudal organization in 1153 until the beginning of the late Middle Ages crisis, that is, when some of its components had already arisen in spite of not having totally become aparent. This research work was of interest on three points. On account of its status as first military broad adquisition, that social collective allowed the study of how the prevailing socio-economical structures had been established and how they had developed. Since it was a feudal state of religious and military Order, it was possible to study in depth the organisation of these militias and the behaviour of men and lands. Finally, Moslem people’s stay after the conquest made it viable the analysis of the submission conditions of these people under the new rule. This work is organised according to sections: The military ocupation of the land, the shaping of the feudal state, and the social organization of the land which was carried out, are being successively studied. Also the population and economic exploitation of the land, the feudal rule over the inhabitants and the productive surplus, the power structure of the ruling class and the organizational development of the lower communities, both Christian and Sarracen. This work also includes an epilogue, in which the most outstanding facts of the above-mentioned sections are present in a chronological order. Finally, it also contains a volume of appendixes and a documentary appendix.
Conradie, Pieter Wynand. "The use and effectiveness of information system development methodologies in health information systems / Pieter Wynand Conradie." Thesis, North-West University, 2010. http://hdl.handle.net/10394/4277.
Повний текст джерелаThesis (Ph.D. (Computer Science))--North-West University, Potchefstroom Campus, 2010.
Amavi, Joshua. "Comparaison et évolution de schémas XML." Thesis, Orléans, 2014. http://www.theses.fr/2014ORLE2053/document.
Повний текст джерелаXML has become the de facto format for data exchange. We aim at establishing a multi-system environment where some local original systems work in harmony with a global integrated system, which is a conservative evolution of local ones. Data exchange is possible in both directions, allowing activities on both levels. For this purpose, we need schema mapping whose is to ensure schema evolution, and to guide the construction of a document translator, allowing automatic data adaptation wrt type evolution. We propose a set of tools to help dealing with XML database evolution. These tools are used : (i) to compute a mapping capable of obtaining a global schema which is a conservative extension of original local schemas, and to adapt XML documents ; (ii) to compute the set of integrity constraints for the global system on the basis of the local ones ; (iii) to compare XML types of two systems in order to replace a system by another one ; (iv) to correct a new document with respect to an XML schema. Experimental results are discussed, showing the efficiency of our methods in many situations
Ivinza, Lepapa Alphonse C. "Analyse de l'introduction de l'EDI dans les entreprises congolaises: une contribution à l'impact organisationnel des TI." Doctoral thesis, Universite Libre de Bruxelles, 2007. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210598.
Повний текст джерелаLe cadre théorique de la contingence structurelle associe généralement « contexte, structure et performance » (Burns et Stalker, 1961; Woodward, 1965; Lawrence et Lorsch, 1967 ;Mintzberg, 1979).Le besoin de tester cette théorie dans l’environnement d’un pays sous développé (PSD) nous a conduit, dans cette recherche, à l’utilisation d’un cadre réduit basé uniquement sur des liens entre la technologie (remplacée par TI) et la structure (Galbraith, 1972 ;Lacrampe, 1974 ;Leifer, 1988).
Notre cadre théorique s’appuie sur les approches managériales, économiques et organisationnelles des TI et de l’EDI (Leavitt, 1968 ;Scott Morton, 1991). Il utilise la théorie contingente de la gestion comptable (Otley, 1980; Chapman, 1997) et des systèmes d’information comptable AIS (Sutton, 1995; Maudlin et Ruchala, 1999; Baldwin et alii, 2000; Dunk, 2001) comme domaine d’opérationnalisation (système d’information fonctionnel).
\
Doctorat en Sciences économiques et de gestion
info:eu-repo/semantics/nonPublished
Liou, Kuan-hung, and 劉冠宏. "The Study of Applying Edit Distance to Calculate Structural Similarity and Enhance Schema Matching in Data Exchange." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/94197272139667185204.
Повний текст джерела中原大學
工業工程研究所
94
Abstract Data exchange between different information systems in a supply chain system needs to fulfill the requirement of schema integration. Since ERP systems with relational database systems are developed independently, schema conflicts between databases is a common problem for schema integration. The core technique to solve schema conflicts is matching exchanged XML documents with relational database schemas. Linguistic similarity and structural similarity are proposed as two major techniques to develop data matching solutions. Procedures of these two approaches were integrated to find matching candidates between the XML document and the database. Linguistic similarity using the repository of synonyms and common words dictionary as references provided schema mapping suggestions. For cases of one to many or many to one mapping, the multiple mapping suggestions need further analysis to find more accurate results. Structural similarity was calculated with the edit distance method to evaluate multiple mapping suggestions, and some guidelines were applied to check the mapping suggestions. Basically, multiple mapping suggestions in the lower level with same mapping suggestion in the parent’s level are more likely accurate matching candidates. This integrated method would show the matching candidates as the results for users to verify. This method was applied to solve four mapping problems as examples to show the capability and limitation in finding matching candidates.
Stuart, Heather Anne. "Patterns of Being." Thesis, 2014. http://hdl.handle.net/2440/97247.
Повний текст джерелаMajor creative work: 'Patterns of Being' – a verse novel. The major creative work is a narrative in open verse. The fictional narrative was inspired by an interview with Rupert Max Stuart in The Age on August 19, 2002, titled, 'Max Stuart reflects, finds peace'. Rupert Max Stuart is a South Australian Aboriginal man who was imprisoned in the 1950s for the murder and rape of Mary Hattam, a young white girl. The case created controversy around issues of race and capital punishment for many years. 'Patterns of Being' is a fictional narrative about grief and reconciliation. A girl named Dawn is murdered and police accuse a carnival worker named Rufus. The story is told by Annie, who is Dawn's cousin. She recalls her own experiences but also imagines the remembrances of Lilly, Dawn's mother and Aril, a nymph-like girl who moves through dimensions of time and space. The imagery is inspired by the environment of regional South Australia and the narrative shows Annie's psychic evolution. Annie is 'both the agent and the theatre of individuation' (Simondon). 'Patterns of Being' shows how Annie uses the collective voices of her interior to navigate a path through grie
Thesis (Ph.D.) -- University of Adelaide, School of Humanities, 2014
顏志璁. "Structure Theory Model of EDI in Defense Purchasing." Thesis, 1998. http://ndltd.ncl.edu.tw/handle/32210859436176990903.
Повний текст джерела國防管理學院
國防資訊研究所
86
CALS is a business competitive strategy. It integrates a lot of technique and standards by using information technology to provide an integrated operating environment. Since the 1985 the DoD of the U. S. A progress CALS, it produce large benefits in improving operational procedure, saving costs, resource distribution and so on. For its benefits that it can be wildly promoting by enterprisis almost all over the world. EDI is one of the standards within CALS it can provide the enterprises to exchange their business information in each application systems directly by using the standard format through the computer network without human operation. It could make a number of profits by eliminate the burden of paper purchase orders, invoices, shipping forms and other routine documents. This dissertation infer the purchasing model of national defense by structure theory. According to the proposed model, the structure of national defense purchase system must be evolved to EDI communication mechanism. The proposed model can be a valuable reference in improving the procedure and the efficiency of national defense purchase system..
Shen, Zhi-Ming, and 沈志明. "A study on the invariable structure of EDI application system." Thesis, 1994. http://ndltd.ncl.edu.tw/handle/97505647763328035595.
Повний текст джерелаDas, Abhik Kumar. "An information theoretic approach to structured high-dimensional problems." 2013. http://hdl.handle.net/2152/23088.
Повний текст джерелаtext