Dissertations / Theses on the topic 'Structural edit'

Les molècules es configuren de manera natural com a xarxes, de manera que són ideals per estudiar utilitzant les seves representacions gràfiques, on els nodes representen àtoms i les vores representen els enllaços químics. Una alternativa per a aquesta representació directa és el gràfic reduït ampliat, que resumeix les estructures químiques mitjançant descripcions de nodes de tipus farmacòfor per codificar les propietats moleculars rellevants. Un cop tenim una manera adequada de representar les molècules com a gràfics, hem de triar l’eina adequada per comparar-les i analitzar-les. La distància d'edició de gràfics s'utilitza per resoldre la concordança de gràfics tolerant als errors; aquesta metodologia calcula la distància entre dos gràfics determinant el nombre mínim de modificacions necessàries per transformar un gràfic en l’altre. Aquestes modificacions (conegudes com a operacions d’edició) tenen associat un cost d’edició (també conegut com a cost de transformació), que s’ha de determinar en funció del problema. Aquest estudi investiga l’eficàcia d’una comparació molecular basada només en gràfics que utilitza gràfics reduïts ampliats i distància d’edició de gràfics com a eina per a aplicacions de cribratge virtual basades en lligands. Aquestes aplicacions estimen la bioactivitat d'una substància química que utilitza la bioactivitat de compostos similars. Una part essencial d’aquest estudi es centra en l’ús d’aprenentatge automàtic i tècniques de processament del llenguatge natural per optimitzar els costos de transformació utilitzats en les comparacions moleculars amb la distància d’edició de gràfics.
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.

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.

Cette thèse se situe à l’intersection de deux domaines de recherche scientifique la Reconnaissance d’Objets Structurels (ROS) et la Recherche Opérationnelle (RO). Le premier consiste à rendre la machine plus intelligente et à reconnaître les objets, en particulier ceux basés sur les graphes. Alors que le second se focalise sur la résolution de problèmes d’optimisation combinatoire difficiles. L’idée principale de cette thèse est de combiner les connaissances de ces deux domaines. Parmi les problèmes difficiles existants en ROS, le problème de la distance d’édition entre graphes (DEG) a été sélectionné comme le cœur de ce travail. Les contributions portent sur la conception de méthodes adoptées du domaine RO pour la résolution du problème de DEG. Explicitement, des nouveaux modèles linéaires en nombre entiers et des matheuristiques ont été développé à cet effet et de très bons résultats ont été obtenus par rapport à des approches existantes
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

The structural analysis serves as a bridge to link the structure of materials to their properties. Revealing the structure details allows a better understanding on the growth mechanisms and properties of materials, and a further designed synthesis of functional materials. The widely used methods based on X-ray diffraction have certain limitations for the structural analysis when crystals are small, poorly crystallized or contain many defects. As electrons interact strongly with matter and can be focused by electromagnetic lenses to form an image, electron crystallography (EC) approaches become prime candidates for the structural analysis of a wide range of materials that cannot be done using X-rays, particularly nanomaterials with poor crystallinity. Three-dimensional electron diffraction tomography (3D EDT) is a recently developed method to automatically collect 3D electron diffraction data. By combining mechanical specimen tilt and electronic e-beam tilt, a large volume of reciprocal space can be swept at a fine step size to ensure the completeness and accuracy of the diffraction data with respect to both position and intensity. Effects of the dynamical scattering are enormously reduced as most of the patterns are collected at conditions off the zone axes. In this thesis, 3D EDT has been used for unit cell determination (COF-505), phase identifications and structure solutions (ZnO, Ba-Ta3N5, Zn-Sc, and V4O9), and the study of layer stacking faults (ETS-10 and SAPO-34 nanosheets). High-resolution transmission electron microscope (HRTEM) imaging shows its particular advantages over diffraction by allowing observations of crystal structure projections and the 3D potential map reconstruction. HRTEM imaging has been used to visualize fine structures of different materials (hierarchical zeolites, ETS-10, and SAPO-34). Reconstructed 3D potential maps have been used to locate the positions of metal ions in a woven framework (COF-505) and elucidate the pore shape and connectivity in a silica mesoporous crystal. The last part of this thesis explores the combination with X-ray crystallography to obtain more structure details.

Concrete structures in marine environments frequently experience long-term deterioration due to environmental exposure. This exposure results in surface damage with the subsequent spalling of concrete, which has a significant effect on the long-term durability of the structure. The reinforced concrete jetty investigated in this study suffered similar problems. The concrete jetty is located on the South East England coast. The jetty consists of a deck that is part precast and part in-situ cast, which is supported by steel, concrete and a sheet pile wall. Five decades after its construction, erosion by sea water is the most serious problem facing the jetty structure and has resulted in significant deterioration and surface damage. This project was established to evaluate the damage level of the jetty using an extended non-destructive measurement approach with an FEA simulation. The basic non-destructive measurement technique used in this investigation is a digital image correlation (DIC) optical system. The current DIC technique is limited to detecting macro cracks; thus, this investigation aims to develop an Extended Digital Image Correlation (EDIC) method to extend the capability of the current DIC from measuring the strain field to detecting multiscale cracks and predicting micro crack propagation. There is an industrial necessity to enhance the damage assessment level based on micro-crack detection. The EDIC study was performed empirically and demonstrated an important role in detecting damaged zones and multiscale cracks, including micro- and macro-cracks of the concrete surface. The EDIC can be used for further studies on detailed damage mechanisms in concrete and other engineering materials, such as timber or masonry structures. The assessment provide information on the current structural degradation, load bearing capacity and safety margin of the damaged jetty. To simulate the ageing jetty numerically, a material model of the ageing concrete was created in terms of the tested core samples obtained from the jetty structure, and the model was implemented in an UMAT subroutine in ABAQUS for FEA simulation. The mechanical properties of the ageing jetty obtained from the experimental tests proved to be suitable, with a compressive and tensile strength of approximately 67 MPa and 4.2 MPa, respectively, and the elastic modulus was 38728 MPa. Using the DIC in situ assessment and FEA simulation, the damage evaluation was completed. The results indicated a considerable decrease in the structural stiffness of the damaged jetty of approximately 40%. The load bearing capacity of the damaged jetty reported was approximately 240 tonnes. Despite the significant damage, the safety margin under the current practical loading condition (162 tonnes) is still high, i.e., approximately 1.48. However, due to the severe condition of the damaged jetty located in an aggressive marine environment and the loading impacts, it is highly recommended that the cracks and corrosion be immediately stopped and controlled. Furthermore, for safety reasons, any additional loads in conjunction with the current practical load (162 tonnes) should be avoided.

Thesis (M.A.)--East Tennessee State University, 2003.
Title from electronic submission form. ETSU ETD database URN: etd-0712103-091758. Includes bibliographical references. Also available via Internet at the UMI web site.

Conception assistee par ordinateur dans le domaine des circuits electroniques a haut niveau d'integration en presentant une methode conception de ces circuits integres et la chaine d'outils logiciels adaptes a cette methode

In recent years, the crucial importance of metrics in machine learningalgorithms has led to an increasing interest in optimizing distanceand similarity functions using knowledge from training data to make them suitable for the problem at hand.This area of research is known as metric learning. Existing methods typically aim at optimizing the parameters of a given metric with respect to some local constraints over the training sample. The learned metrics are generally used in nearest-neighbor and clustering algorithms.When data consist of feature vectors, a large body of work has focused on learning a Mahalanobis distance, which is parameterized by a positive semi-definite matrix. Recent methods offer good scalability to large datasets.Less work has been devoted to metric learning from structured objects (such as strings or trees), because it often involves complex procedures. Most of the work has focused on optimizing a notion of edit distance, which measures (in terms of number of operations) the cost of turning an object into another.We identify two important limitations of current supervised metric learning approaches. First, they allow to improve the performance of local algorithms such as k-nearest neighbors, but metric learning for global algorithms (such as linear classifiers) has not really been studied so far. Second, and perhaps more importantly, the question of the generalization ability of metric learning methods has been largely ignored.In this thesis, we propose theoretical and algorithmic contributions that address these limitations. Our first contribution is the derivation of a new kernel function built from learned edit probabilities. Unlike other string kernels, it is guaranteed to be valid and parameter-free. Our second contribution is a novel framework for learning string and tree edit similarities inspired by the recent theory of (epsilon,gamma,tau)-good similarity functions and formulated as a convex optimization problem. Using uniform stability arguments, we establish theoretical guarantees for the learned similarity that give a bound on the generalization error of a linear classifier built from that similarity. In our third contribution, we extend the same ideas to metric learning from feature vectors by proposing a bilinear similarity learning method that efficiently optimizes the (epsilon,gamma,tau)-goodness. The similarity is learned based on global constraints that are more appropriate to linear classification. Generalization guarantees are derived for our approach, highlighting that our method minimizes a tighter bound on the generalization error of the classifier. Our last contribution is a framework for establishing generalization bounds for a large class of existing metric learning algorithms. It is based on a simple adaptation of the notion of algorithmic robustness and allows the derivation of bounds for various loss functions and regularizers.

We present a multifaceted investigation into the relevance of word order in machine translation. We introduce two tools, DTED and DERP, each using dependency structure to detect differences between the structures of machine-produced translations and human-produced references. DTED applies the principle of Tree Edit Distance to calculate edit operations required to convert one structure into another. Four variants of DTED have been produced, differing in the importance they place on words which match between the two sentences. DERP represents a more detailed procedure, making use of the dependency relations between words when evaluating the disparities between paths connecting matching nodes. In order to empirically evaluate DTED and DERP, and as a standalone contribution, we have produced WOJ-DB, a database of human judgments. Containing scores relating to translation adequacy and more specifically to word order quality, this is intended to support investigations into a wide range of translation phenomena. We report an internal evaluation of the information in WOJ-DB, then use it to evaluate variants of DTED and DERP, both to determine their relative merit and their strength relative to third-party baselines. We present our conclusions about the importance of structure to the tools and their relevance to word order specifically, then propose further related avenues of research suggested or enabled by our work.

Orientador: Prof. Dr. Rodrigo de Alencar Hausen
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.

En el següent treball hem pretès investigar l’estructura i dinàmica evolutiva de la part de la formació social feudal catalanoaragonesa que es va desenvolupar en les comarques de Ribera d’Ebre i Terra Alta, situades en el sud-est de Catalunya, entre els rius Ebre i Algars, un territori que va pertànyer casi en la seva totalitat a l’Ordre del Temple i, desprès de la seva abolició, a la del Hospital. Per a nosaltres hi tenia un triple interès. La seva condició com a primera adquisició militar extensa d’aquella formació social permetia observar de a prop com s’havien instaurat aquí les estructures socioeconòmiques dominants i de quina forma havien evolucionat. El caràcter de senyoriu d’Ordre religiós-militar obria la possibilitat d’aprofundir en l’estudi de l’organització d’aquestes milícies i el seu comportament en la faceta de senyors de persones i terres. Per fi, la permanència de població musulmana després de la conquista feia viable l’anàlisi, en el mateix origen, de les condicions de submissió d’aquestes comunitats al nou poder. Aquest treball està organitzat per seccions: L’ocupació militar del territori, la conformació de l’estat feudal, i l’organització feudal de la terra gestionada. També l’explotació humana i econòmica del territori, el domini feudal sobre els habitants i l’excedent productiu, l’estructura de poder de la classe dominant i el desenvolupament organitzatiu de les comunitats de baix estrat, tant la Cristiana com la Sarraïna. Aquest treball també inclou un epíleg, en el qual apareixen els elements més rellevants de les seccions anteriorment citades per ordre cronològic. Finalment, també trobem un volum d’apèndixs i un apèndix documental.
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.

Abstract The main focus of this study is the identification of factors influencing the use and effectiveness of information system development methodologies (Le., systems development methodologies) in health information systems. In essence, it can be viewed as exploratory research, utilizing a conceptual research model to investigate the relationships among the hypothesised factors. More specifically, classified as behavioural science, it combines two theoretical models, namely the Unified Theory of Acceptance and Use of Technology and the Expectancy Disconfirmation Theory. The main aim of behavioural science in information systems is to assist practitioners (Le., social actors) in improving business processes and competitiveness, thus the effective use of information systems. A wider view of behavioural science incorporates other social actors (e.g., end users) and organisational actors (e.g., executives). In health information systems, the effective use of information systems is especially relevant Health information systems are vital in the area of health care, since only by having access to pertinent health information, can the correct decisions relating to diagnostics and curative procedures be made. The use of systems development methodologies in health information systems development is therefore crucial, since they can make the development process more effective, while improving software quality. By empirically evaluating the conceptual research model, utilizing a survey as the main research method and structural equation modelling as the main statistical technique, meaningful results were obtained. Focussing on the factors influencing the individual's behavioural intent, it was found that the compatibility of systems development methodologies to the developer's pre-existing software development style is vital. Furthermore, performance expectancy, self-efficacy, organisational culture, policies, customer influence, voluntariness and facilitating conditions, all directly influenced the use of systems development methodologies, with policies and customer influence playing a significant role, especially in relation to health information systems. No significant direct effects or indirect effects could be established for the factors effort expectancy, personal innovativeness and social influence. It appears that individuals working in the health care software development discipline are more autonomous, less influenced by others. Also, the lack of support for the factor effort expectancy may indicate that systems development methodologies have entered a mature state, with less concern on the effort required for use. Furthermore, with regard to effectiveness and the continued use of information systems methodologies, satisfaction had a significant direct effect, with confirmation having a significant indirect effect. Keywords: behavioural science; conceptual research model; direct effect; exploratory research; Expectancy Disconfirmation Theory; indirect effect; Unified Theory of Acceptance and Use of Technology; structural equation modelling; survey; systems development methodologies.
Thesis (Ph.D. (Computer Science))--North-West University, Potchefstroom Campus, 2010.

XML est devenu le format standard d’échange de données. Nous souhaitons construire un environnement multi-système où des systèmes locaux travaillent en harmonie avec un système global, qui est une évolution conservatrice des systèmes locaux. Dans cet environnement, l’échange de données se fait dans les deux sens. Pour y parvenir nous avons besoin d’un mapping entre les schémas des systèmes. Le but du mapping est d’assurer l’évolution des schémas et de guider l’adaptation des documents entre les schémas concernés. Nous proposons des outils pour faciliter l’évolution de base de données XML. Ces outils permettent de : (i) calculer un mapping entre le schéma global et les schémas locaux, et d’adapter les documents ; (ii) calculer les contraintes d’intégrité du système global à partir de celles des systèmes locaux ; (iii) comparer les schémas de deux systèmes pour pouvoir remplacer un système par celui qui le contient ; (iv) corriger un nouveau document qui est invalide par rapport au schéma d’un système, afin de l’ajouter au système. Des expériences ont été menées sur des données synthétiques et réelles pour montrer l’efficacité de nos méthodes
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

Résumé

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

碩士
中原大學
工業工程研究所
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.

Author also known as Heather Sladdin
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

碩士
國防管理學院
國防資訊研究所
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..

A majority of the data transmitted and processed today has an inherent structured high-dimensional nature, either because of the process of encoding using high-dimensional codebooks for providing a systematic structure, or dependency of the data on a large number of agents or variables. As a result, many problem setups associated with transmission and processing of data have a structured high-dimensional aspect to them. This dissertation takes a look at two such problems, namely, communication over networks using network coding, and learning the structure of graphical representations like Markov networks using observed data, from an information-theoretic perspective. Such an approach yields intuition about good coding architectures as well as the limitations imposed by the high-dimensional framework. Th e dissertation studies the problem of network coding for networks having multiple transmission sessions, i.e., multiple users communicating with each other at the same time. The connection between such networks and the information-theoretic interference channel is examined, and the concept of interference alignment, derived from interference channel literature, is coupled with linear network coding to develop novel coding schemes off ering good guarantees on achievable throughput. In particular, two setups are analyzed – the first where each user requires data from only one user (multiple unicasts), and the second where each user requires data from potentially multiple users (multiple multicasts). It is demonstrated that one can achieve a rate equalling a signi ficant fraction of the maximal rate for each transmission session, provided certain constraints on the network topology are satisfi ed. Th e dissertation also analyzes the problem of learning the structure of Markov networks from observed samples – the learning problem is interpreted as a channel coding problem and its achievability and converse aspects are examined. A rate-distortion theoretic approach is taken for the converse aspect, and information-theoretic lower bounds on the number of samples, required for any algorithm to learn the Markov graph up to a pre-speci fied edit distance, are derived for ensembles of discrete and Gaussian Markov networks based on degree-bounded graphs. The problem of accurately learning the structure of discrete Markov networks, based on power-law graphs generated from the con figuration model, is also studied. The eff ect of power-law exponent value on the hardness of the learning problem is deduced from the converse aspect – it is shown that discrete Markov networks on power-law graphs with smaller exponent values require more number of samples to ensure accurate recovery of their underlying graphs for any learning algorithm. For the achievability aspect, an effi cient learning algorithm is designed for accurately reconstructing the structure of Ising model based on power-law graphs from the con figuration model; it is demonstrated that optimal number of samples su ffices for recovering the exact graph under certain constraints on the Ising model potential values.
text