Relevant bibliographies by topics / Structural edit

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Structural edit'

Author: Grafiati
Published: 10 December 2022
Last updated: 28 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Structural edit.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Structural edit"

1

Garcia-Hernandez, Carlos, Alberto Fernández, and Francesc Serratosa. "Learning the Edit Costs of Graph Edit Distance Applied to Ligand-Based Virtual Screening." Current Topics in Medicinal Chemistry 20, no. 18 (2020): 1582–92. http://dx.doi.org/10.2174/1568026620666200603122000.

Full text
Abstract:
Background: Graph edit distance is a methodology used to solve 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 associated that has to be determined depending on the problem. Objective: This study focuses on the use of optimization techniques in order to learn the edit costs used when comparing graphs by means of the graph edit distance. Methods: Graphs represent reduced structural representations of molecules using pharmacophore-type node descriptions to encode the relevant molecular properties. This reduction technique is known as extended reduced graphs. The screening and statistical tools available on the ligand-based virtual screening benchmarking platform and the RDKit were used. Results: In the experiments, the graph edit distance using learned costs performed better or equally good than using predefined costs. This is exemplified with six publicly available datasets: DUD-E, MUV, GLL&GDD, CAPST, NRLiSt BDB, and ULS-UDS. Conclusion: This study shows that the graph edit distance along with learned edit costs is useful to identify bioactivity similarities in a structurally diverse group of molecules. Furthermore, the target-specific edit costs might provide useful structure-activity information for future drug-design efforts.
APA, Harvard, Vancouver, ISO, and other styles
2

Akande, Olanrewaju, Andrés Barrientos, and Jerome P. Reiter. "Simultaneous Edit and Imputation For Household Data with Structural Zeros." Journal of Survey Statistics and Methodology 7, no. 4 (2018): 498–519. http://dx.doi.org/10.1093/jssam/smy022.

Full text
Abstract:
Abstract Multivariate categorical data nested within households often include reported values that fail edit constraints—for example, a participating household reports a child’s age as older than his biological parent’s age—and have missing values. Generally, agencies prefer datasets to be free from erroneous or missing values before analyzing them or disseminating them to secondary data users. We present a model-based engine for editing and imputation of household data based on a Bayesian hierarchical model that includes (i) a nested data Dirichlet process mixture of products of multinomial distributions as the model for the true latent values of the data, truncated to allow only households that satisfy all edit constraints, (ii) a model for the location of errors, and (iii) a reporting model for the observed responses in error. The approach propagates uncertainty due to unknown locations of errors and missing values, generates plausible datasets that satisfy all edit constraints, and can preserve multivariate relationships within and across individuals in the same household. We illustrate the approach using data from the 2012 American Community Survey.
APA, Harvard, Vancouver, ISO, and other styles
3

Neuhaus, Michel, and Horst Bunke. "Edit distance-based kernel functions for structural pattern classification." Pattern Recognition 39, no. 10 (2006): 1852–63. http://dx.doi.org/10.1016/j.patcog.2006.04.012.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

HIDOVIĆ, DŽENA, and MARCELLO PELILLO. "METRICS FOR ATTRIBUTED GRAPHS BASED ON THE MAXIMAL SIMILARITY COMMON SUBGRAPH." International Journal of Pattern Recognition and Artificial Intelligence 18, no. 03 (2004): 299–313. http://dx.doi.org/10.1142/s0218001404003216.

Full text
Abstract:
Two distance measures for attributed graphs are presented that are based on the maximal similarity common subgraph of two graphs. They are generalizations of two existing distance measures based on the maximal common subgraph. The new measures are superior to the well-known measures based on elementary edit transformations in that no particular edit operations (together with their costs) need to be defined. Moreover, they can deal not only with structural distortions, but also with perturbations of attributes. It is shown that the new distance measures are metrics.
APA, Harvard, Vancouver, ISO, and other styles
5

Rico-Juan, Juan R., Jose J. Valero-Mas, and José M. Iñesta. "Bounding Edit Distance for similarity-based sequence classification on Structural Pattern Recognition." Applied Soft Computing 97 (December 2020): 106778. http://dx.doi.org/10.1016/j.asoc.2020.106778.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Rica, Elena, Susana Álvarez, and Francesc Serratosa. "Ligand-Based Virtual Screening Based on the Graph Edit Distance." International Journal of Molecular Sciences 22, no. 23 (2021): 12751. http://dx.doi.org/10.3390/ijms222312751.

Full text
Abstract:
Chemical compounds can be represented as attributed graphs. An attributed graph is a mathematical model of an object composed of two types of representations: nodes and edges. Nodes are individual components, and edges are relations between these components. In this case, pharmacophore-type node descriptions are represented by nodes and chemical bounds by edges. If we want to obtain the bioactivity dissimilarity between two chemical compounds, a distance between attributed graphs can be used. The Graph Edit Distance allows computing this distance, and it is defined as the cost of transforming one graph into another. Nevertheless, to define this dissimilarity, the transformation cost must be properly tuned. The aim of this paper is to analyse the structural-based screening methods to verify the quality of the Harper transformation costs proposal and to present an algorithm to learn these transformation costs such that the bioactivity dissimilarity is properly defined in a ligand-based virtual screening application. The goodness of the dissimilarity is represented by the classification accuracy. Six publicly available datasets—CAPST, DUD-E, GLL&GDD, NRLiSt-BDB, MUV and ULS-UDS—have been used to validate our methodology and show that with our learned costs, we obtain the highest ratios in identifying the bioactivity similarity in a structurally diverse group of molecules.
APA, Harvard, Vancouver, ISO, and other styles
7

Pinhas, Tamar, Shay Zakov, Dekel Tsur, and Michal Ziv-Ukelson. "Efficient edit distance with duplications and contractions." Algorithms for Molecular Biology 8, no. 1 (2013): 27. http://dx.doi.org/10.1186/1748-7188-8-27.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Riesen, Kaspar, Andreas Fischer, and Horst Bunke. "Estimating Graph Edit Distance Using Lower and Upper Bounds of Bipartite Approximations." International Journal of Pattern Recognition and Artificial Intelligence 29, no. 02 (2015): 1550011. http://dx.doi.org/10.1142/s0218001415500111.

Full text
Abstract:
The concept of graph edit distance (GED) is still one of the most flexible and powerful graph matching approaches available. Yet, exact computation of GED can be solved in exponential time complexity only. A previously introduced approximation framework reduces the computation of GED to an instance of a linear sum assignment problem. Major benefit of this reduction is that an optimal assignment of nodes (including local structures) can be computed in polynomial time. Given this assignment an approximate value of GED can be immediately derived. Yet, this approach considers local — rather than the global — structural properties of the graphs only, and thus GED derived from the optimal node assignment generally overestimates the true edit distance. Recently, it has been shown how the existing approximation framework can be exploited to additionally derive a lower bound of the exact edit distance without any additional computations. In this paper we make use of regression analysis in order to predict the exact GED using these two bounds. In an experimental evaluation on diverse graph data sets we empirically verify the gain of distance accuracy of the estimated GEDs compared to both bounds.
APA, Harvard, Vancouver, ISO, and other styles
9

Strug, Joanna, and Barbara Strug. "Using Structural Similarity to Classify Tests in Mutation Testing." Applied Mechanics and Materials 378 (August 2013): 546–51. http://dx.doi.org/10.4028/www.scientific.net/amm.378.546.

Full text
Abstract:
Mutation testing is an effective technique for assessing quality of tests provided for a system. However it suffers from high computational cost of executing mutants of the system. In this paper a method of classifying such mutants is proposed. This classification is based on using an edit distance kernel and k-NN classifier. Using the results of this classification it is possible to predict whether a mutant would be detected by tests or not. Thus the application of the approach can help to lower the number of mutants that have to be executed and so also to lower the cost of using the mutation testing.
APA, Harvard, Vancouver, ISO, and other styles
10

YAMAMOTO, YOSHIYUKI, KOUICHI HIRATA, and TETSUJI KUBOYAMA. "TRACTABLE AND INTRACTABLE VARIATIONS OF UNORDERED TREE EDIT DISTANCE." International Journal of Foundations of Computer Science 25, no. 03 (2014): 307–29. http://dx.doi.org/10.1142/s0129054114500154.

Full text
Abstract:
In this paper, we investigate the problem of computing structural sensitive variations of an unordered tree edit distance. First, we focus on the variations tractable by the algorithms including the submodule of a network algorithm, either the minimum cost maximum flow algorithm or the maximum weighted bipartite matching algorithm. Then, we show that both network algorithms are replaceable, and hence the time complexity of computing these variations can be reduced to O(nmd) time, where n is the number of nodes in a tree, m is the number of nodes in another tree and d is the minimum degree of given two trees. Next, we show that the problem of computing the bottom-up distance is MAX SNP-hard. Note that the well-known linear-time algorithm for the bottom-up distance designed by Valiente (2001) computes just a bottom-up indel (insertion-deletion) distance allowing no substitutions.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Structural edit"

1

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.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
2

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.

Full text
Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles
3

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.

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
4

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.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
5

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.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
6

Mori, Tomoya. "Methods for Analyzing Tree-Structured Data and their Applications to Computational Biology." 京都大学 (Kyoto University), 2015. http://hdl.handle.net/2433/202741.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

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.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
8

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Structural edit"

1

Riesen, Kaspar. Structural Pattern Recognition with Graph Edit Distance. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-27252-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Felicitous space: The imaginative structures of Edith Wharton and Willa Cather. University of North Carolina Press, 1986.

APA, Harvard, Vancouver, ISO, and other styles
3

Fryer, Judith. Felicitous space: The imaginative structures of Edith Wharton and Willa Cather. University of North Carolina Press, 1986.

APA, Harvard, Vancouver, ISO, and other styles
4

Miccichè, Calogero. Girgenti: Le pietre della meraviglia-- cadute : osservazioni, note autentiche, documenti editi e inediti, per il recupero del centro storico di Agrigento. s. n., 2006.

APA, Harvard, Vancouver, ISO, and other styles
5

Miccichè, Calogero. Girgenti: Le pietre della meraviglia-- cadute : osservazioni, note autentiche, documenti editi e inediti, per il recupero del centro storico di Agrigento. s. n., 2006.

APA, Harvard, Vancouver, ISO, and other styles
6

Polymorphous domesticities: Pets, bodies, and desire in four modern writers. University of California Press, 2012.

APA, Harvard, Vancouver, ISO, and other styles
7

Riesen, Kaspar. Structural Pattern Recognition with Graph Edit Distance: Approximation Algorithms and Applications. Springer International Publishing AG, 2018.

APA, Harvard, Vancouver, ISO, and other styles
8

Riesen, Kaspar. Structural Pattern Recognition with Graph Edit Distance: Approximation Algorithms and Applications. Springer, 2016.

APA, Harvard, Vancouver, ISO, and other styles
9

Riesen, Kaspar. Structural Pattern Recognition with Graph Edit Distance: Approximation Algorithms and Applications. Springer London, Limited, 2016.

APA, Harvard, Vancouver, ISO, and other styles
10

Burns. Design of Prestressed Concrete Structures 4th Edit Ion. John Wiley & Sons Inc, 2005.

APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Structural edit"

1

Riesen, Kaspar. "Graph Edit Distance." In Structural Pattern Recognition with Graph Edit Distance. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-27252-8_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Riesen, Kaspar. "Bipartite Graph Edit Distance." In Structural Pattern Recognition with Graph Edit Distance. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-27252-8_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Riesen, Kaspar. "Learning Exact Graph Edit Distance." In Structural Pattern Recognition with Graph Edit Distance. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-27252-8_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Riesen, Kaspar. "Speeding Up Bipartite Graph Edit Distance." In Structural Pattern Recognition with Graph Edit Distance. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-27252-8_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Riesen, Kaspar. "Introduction and Basic Concepts." In Structural Pattern Recognition with Graph Edit Distance. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-27252-8_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Riesen, Kaspar. "Improving the Distance Accuracy of Bipartite Graph Edit Distance." In Structural Pattern Recognition with Graph Edit Distance. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-27252-8_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Riesen, Kaspar. "Conclusions and Future Work." In Structural Pattern Recognition with Graph Edit Distance. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-27252-8_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Riesen, Kaspar. "Appendix A: Experimental Evaluation of Sorted Beam Search." In Structural Pattern Recognition with Graph Edit Distance. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-27252-8_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Riesen, Kaspar. "Appendix B: Data Sets." In Structural Pattern Recognition with Graph Edit Distance. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-27252-8_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Fischer, Andreas, Seiichi Uchida, Volkmar Frinken, Kaspar Riesen, and Horst Bunke. "Improving Hausdorff Edit Distance Using Structural Node Context." In Graph-Based Representations in Pattern Recognition. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-18224-7_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Structural edit"

1

Maergner, Paul, Kaspar Riesen, Rolf Ingold, and Andreas Fischer. "A Structural Approach to Offline Signature Verification Using Graph Edit Distance." In 2017 14th IAPR International Conference on Document Analysis and Recognition (ICDAR). IEEE, 2017. http://dx.doi.org/10.1109/icdar.2017.201.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Munawaroh, Hidayatul, Daniel Oranova Siahaan, Reza Fauzan, and Evi Triandini. "Structural Similarity Measurement using Graph Edit Distance-Greedy on State chart Diagrams." In 2020 2nd International Conference on Cybernetics and Intelligent System (ICORIS). IEEE, 2020. http://dx.doi.org/10.1109/icoris50180.2020.9320764.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Maergner, Paul, Nicholas Howe, Kaspar Riesen, Rolf Ingold, and Andreas Fischer. "Offline Signature Verification Via Structural Methods: Graph Edit Distance and Inkball Models." In 2018 16th International Conference on Frontiers in Handwriting Recognition (ICFHR). IEEE, 2018. http://dx.doi.org/10.1109/icfhr-2018.2018.00037.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ray, Valery, Josef V. Oboňa, Sharang Sharang, Lolita Rotkina, Eddie Chang, and Kevin Tolua. "Optimizing Gas-Assisted Processes for Ga and Xe FIB Circuit Edit Application." In ISTFA 2016. ASM International, 2016. http://dx.doi.org/10.31399/asm.cp.istfa2016p0397.

Full text
Abstract:
Abstract Despite commercial availability of a number of gas-enhanced chemical etches for faster removal of the material, there is still lack of understanding about how to take into account ion implantation and the structural damage by the primary ion beam during focused ion beam gas-assisted etching (FIB GAE). This paper describes the attempt to apply simplified beam reconstruction technique to characterize FIB GAE within single beam width and to evaluate the parameters critical for editing features with the dimensions close to the effective ion beam diameter. The approach is based on reverse-simulation methodology of ion beam current profile reconstruction. Enhancement of silicon dioxide etching with xenon difluoride precursor in xenon FIB with inductively coupled plasma ion source appears to be high and relatively uniform over the cross-section of the xenon beam, making xenon FIB potentially suitable platform for selective removal of materials in circuit edit application.
APA, Harvard, Vancouver, ISO, and other styles
5

Santoso, Gagok-Imam, Jean-Michel Denichou, Wael Al-Alqum, Motaz Zeidan, and Mohammed Satti. "Collaborative Web Based Platform for 3D Reservoir Characterization and Geosteering Planning on the Cloud." In International Petroleum Technology Conference. IPTC, 2022. http://dx.doi.org/10.2523/iptc-22203-ea.

Full text
Abstract:
Abstract New developments in Machine Learning and Artificial Intelligence-based interpretations are bringing a step change in the integration of multi-physic evaluations and management of reservoirs in real time. But it also requires game-changing digital developments to deliver the larger computing power required and to facilitate their access to multi-disciplinary (and sometime not co-located) team of experts and decision makers. This communication is sharing our experience of a web-based collaborative platform integrating operator's application used to produce realistic geological models and a service company's advance multi-dimension modeling and inversion supporting latest Logging While Drilling formation evaluation workflows. The system is now routinely used in case studies, allowing users to perform pre-job well placement feasibility analysis and post-job model refinement. The technology behind is a modular Web platform that hides all the complexity of the modeling and inversions algorithms. Users can; Upload their data to the application's virtual file system. Visualize 2D and 3D models, Launch modeling jobs for Ultra-Deep Azimuthal Resistivity (UDAR) and conventional formation evaluation measurements and finally monitor the inverted images unfold as the job progresses, all in the web browser. The system enables multiple users to view and edit the shared models and observe and control the same job in a collaborative way. The simulation codes are run on the remote clusters or on the cloud. We will present the application of platform and models for 3D characterization in Norwegian continental shelf wells. The examples illustrate mapping of 2D and 3D structural complexity and how the system is used to update reservoir geomodels. The platform is also used to identify optimal well position; define geosteering strategies in the pre-job planning phase, as well as to evaluate sensitivities, depth of investigation in specific scenarios and to analyze how the structural model uncertainties may be affecting the interpretation. Modeling and inversion are used to assess how structural complexities, lithological changes, oil-water contacts and saturation could be encounter in simulating future production. It is a key for quantitative robust interpretation and geomodels update. The platform allows fast deployment of latest research modeling and inversion prototypes. We finally present the latest results of full 3D modeling and various flavors of 2D imaging inversion results from multiple wells, visualized in the browser using a 3D viewer. The new digital solution improves understanding of 3D reservoir structure and fluid distribution around the wellbore.
APA, Harvard, Vancouver, ISO, and other styles
6

Herschbein, Steven B., Kyle M. Winter, Carmelo F. Scrudato, Brian L. Yates, Edward S. Hermann, and John Carulli. "FinFET Transistor Output Drive Performance Modification by Focused Ion Beam (FIB) Chip Circuit Editing." In ISTFA 2020. ASM International, 2020. http://dx.doi.org/10.31399/asm.cp.istfa2020p0122.

Full text
Abstract:
Abstract Focused Ion Beam (FIB) chip circuit editing is a well-established highly specialized laboratory technique for making direct changes to the functionality of integrated circuits. A precisely tuned and placed ion beam in conjunction with process gases selectively uncovers internal circuitry, create functional changes in devices or the copper wiring pattern, and reseals the chip surface. When executed within reasonable limits, the revised circuit logic functions essentially the same as if the changes were instead made to the photomasks used to fabricate the chip. The results of the intended revision, however, can be obtained weeks or months earlier than by a full fabrication run. Evaluating proposed changes through FIB modification rather than proceeding immediately to mask changes has become an integral part of the process for bringing advanced designs to market at many companies. The end product of the FIB process is the very essence of handcrafted prototyping. The efficacy of the FIB technique faces new challenges with every generation of fabrication process node advancement. Ever shrinking geometries and new material sets have always been a given as transistor size decreases and overall packing density increases. The biggest fundamental change in recent years was the introduction of the FinFET as a replacement for the venerable planar transistor. Point to point wiring change methodology has generally followed process scaling, but transistor deletions or modifications with the change to Fins require a somewhat different approach and much more careful control due to the drastic change in height and shape. We also had to take into consideration the importance of the 4th terminal, the body-tie, that is often lost in backside editing. Some designs and FET technology can function acceptably well when individual devices are no longer connected to the bulk substrate or well, while others can suffer from profound shifts in performance. All this presents a challenge given that the primary beam technology improvements of the fully configured chip edit FIB has only evolved incrementally during the same time period. The gallium column system appears to be reaching its maximum potential. Further, as gallium is a p-type metal dopant, there are limitations to its use in close proximity to certain active semiconductor devices. Amorphous material formation and other damage mechanisms that extend beyond what can be seen visually when endpointing must also be taken into account [1]. Device switching performance and even transmission line characteristics of nearby wiring levels can be impacted by material structural changes from implantation cascades. Last year our lab participated in a design validation exercise in which we were asked to modify the drive of a multi-finger FinFET device structure to reduce its switching speed impact on a circuit. The original sized device pulled the next node in the chain too fast, resulting in a timing upset. Deleting whole structures and bridging over/around them is commonly done, but modifications to the physical size of an FET device is a rare request and generally not attempted. It requires a level of precision in beam control and post-edit treatment that can be difficult to execute cleanly. Once again during a complex edit task we considered the use of an alternate ion beam species such as neon, or reducing the beam energy (low kV) on the gallium tool. Unfortunately, we don’t yet have easy access to a versatile viable replacement column technology grafted to a fully configured edit station. And while there should be significantly reduced implant damage and transistor functional change when a gallium column FIB is operated at lower accelerating potential [2], the further loss of visual acuity due to the reduced secondary emission, especially when combined with ultra-low beam currents, made fast and accurate navigation near impossible. We instead chose the somewhat unconventional approach of using an ultra-low voltage electron beam to do much of the navigation and surface marking prior to making the final edits with the gallium ion beam in a dual-beam FIB tool. Once we had resolved how to accurately navigate to the transistors in question and expose half of the structure without disturbing the body-tie, we were able to execute the required cut to trim away 50% of the structure and reduce the effective drive. Several of the FIB modified units functioned per the design parameters of a smaller sized device, giving confidence to proceed with the revised mask set. To our surprise, the gallium beam performed commendably well in this most difficult task. While we still believe that an inert beam of similar characteristics would be preferable, this work indicates that gallium columns are still viable at the 14 nm FinFET node for even the most rigorous of editing requirements. It also showed that careful application of e-beam imaging on the exposed underside of FinFET devices could be performed without degrading or destroying them.
APA, Harvard, Vancouver, ISO, and other styles
7

Sevini, F., L. Debarberis, R. Gerard, and M. Brumovsky. "The European Network AMES for Reactor Component Ageing in the 6th EURATOM Framework Programme." In ASME 2003 Pressure Vessels and Piping Conference. ASMEDC, 2003. http://dx.doi.org/10.1115/pvp2003-2158.

Full text
Abstract:
The AMES (Ageing Materials European Strategy) European network started its activity in 1993 with the aim of studying ageing mechanisms and remedial procedures for structural materials used for nuclear reactor components. Operated by JRC-IE, it has been supporting the co-ordination of the project cluster throughout the 4th and 5th EURATOM Framework Programs, carrying out projects on with plant life management implications. A short summary is given of the main outcome. Main frame of the network in the 5th Framework Programme is the ATHENA project, which is aimed at summarizing the obtained achievements and edit guidelines on important issues like the Master Curve, Effect of chemical composition on embritllement rate in RPV steels, Re-embrittlement models validation after VVER-440 annealing and open issues in embrittlement of VVER type reactors. The enforcement of the ERA (European Research Area) concept arisen with start of the 6th EURATOM Framework in 2003 will produce some changes and reorganisation. The network will be part of a broader initiative on PLIM including in a more integrated way NESC, ENIQ, NET and AMALIA networks. The paper shows an overview of the concluded projects, achievements of the running ones and open issues tackled in the 6th EURATOM FWP and a summary of the plans for a new broader network on NPP Plant Life management (SAFELIFE).
APA, Harvard, Vancouver, ISO, and other styles
8

Libovický, Jindřich, and Alexander Fraser. "Neural String Edit Distance." In Proceedings of the Sixth Workshop on Structured Prediction for NLP. Association for Computational Linguistics, 2022. http://dx.doi.org/10.18653/v1/2022.spnlp-1.6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Lin, Guo-Hui, Bin Ma, and Kaizhong Zhang. "Edit distance between two RNA structures." In the fifth annual international conference. ACM Press, 2001. http://dx.doi.org/10.1145/369133.369214.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Tinati, Ramine, Markus Luczak-Roesch, and Wendy Hall. "Finding Structure in Wikipedia Edit Activity." In the 25th International Conference Companion. ACM Press, 2016. http://dx.doi.org/10.1145/2872518.2891110.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography