Translation Rules Research Articles

Trapped in conformity? Translating reputation management into practice

This study investigates the translation rules used by Norwegian hospitals to adapt reputation management to their context. Drawing on a linguistics-inspired approach to organizational translations ...

Modelling and Refinement in CODA

This paper provides an overview of the CODA framework for modelling and refinement of component-based embedded systems. CODA is an extension of Event-B and UML-B and is supported by a plug-in for the Rodin toolset. CODA augments Event-B with constructs for component-based modelling including components, communications ports, port connectors, timed communications and timing triggers. Component behaviour is specified through a combination of UML-B state machines and Event-B. CODA communications and timing are given an Event-B semantics through translation rules. Refinement is based on Event-B refinement and allows layered construction of CODA models in a consistent way.

Ekwiwalencja intersemiotyczna w przekładzie rysunków budowlanych

This paper focuses on intersemiotic equivalence in the process of translating construction drawings into French. Construction designs are highly codified verbovisual messages characterized by conventionalized graphic and editorial forms. They constitute mainly technical drawings based on standardized semiotic systems that are specific to different areas of the construction industry. Thus translation of construction designs involves the confrontation of two intersemiotic polysystems in accordance with the rules of intersemiotic translation. While observing those rules the translator is obliged to keep the original form of visual elements as well as to provide proper annotations in the target language in accordance with the target language discourse norms. In order to achieve this goal, the translator should exhibit a profound knowledge of both Polish and French semiotic codes pertaining to the area of construction industry.

Ekwiwalencja intersemiotyczna w przekładzie rysunków budowlanych

This paper focuses on intersemiotic equivalence in the process of translating construction drawings into French. Construction designs are highly codified verbovisual messages characterized by conventionalized graphic and editorial forms. They constitute mainly technical drawings based on standardized semiotic systems that are specific to different areas of the construction industry. Thus translation of construction designs involves the confrontation of two intersemiotic polysystems in accordance with the rules of intersemiotic translation. While observing those rules the translator is obliged to keep the original form of visual elements as well as to provide proper annotations in the target language in accordance with the target language discourse norms. In order to achieve this goal, the translator should exhibit a profound knowledge of both Polish and French semiotic codes pertaining to the area of construction industry.

Modelling of Ontology-based Service Compositions using Petri Net

OWL-S, one of the most significant Semantic web service ontologies , provides Web Service providers with a core ontological framework and guidelines for describing the properties and capabilities of their web Services in unambiguous, computer interpretable form. In this work we present a translation-based approach for modelling the semantic Web services described in the OWL-S language. This approach employs Petri net as the fundamental means of modelling and defines a set of translation rules to map OWL-S elements into equivalent Petri net representations. They capture the main aspect of service invocations and the control flow of the service model. A case study based on a real-world OWL-S example is also conducted to examine the effectiveness of the translation-based model. DOI: http://dx.doi.org/10.5755/j01.eee.19.2.3474

휘처 모델의 Z 정형 명세와 검사 기법

The Feature model can not be guaranteed the syntactic accuracy of its model and be difficult the validation using automatic tool for its syntax, because this model is expressed by a graphical and informal structure in itself. Therefore, there is a need to formalize and check for the feature model, to precisely define syntax for construct of the model. This paper presents a Z formal specification and a model checking mechanism of the feature model to guarantee the correctness of the model. It first defines the translation rules between feature model and Z, and then converts the syntax of the feature model into the Z schema specification by applying these rules. Finally, the Z schema specification is checked syntax, type, and domain errors using the Z/Eves validation tool to assure the correctness of its specification, With the use of the proposed method, we may express more precisely the construct of the feature model. Moreover the domain analyst are able to usefully verify the errors of the generated feature model.

From UML to SIMULINK CAAM: Formal Specification and Transformation Analysis

UML and Simulink are attractive languages for embedded systems design and modeling. An automatic mapping from UML models to Simulink would be an interesting resource in a seamless design flow, allowing designers to use UML as modeling language for the whole system and at same time to use facilities for code generation based on Simulink. In a previous work, the UML to Simulink translation was prototyped using a Java implementation. In this paper, we present the formal definition of this translation using graph grammars, as well as its automation, which is supported by the AGG system. With the formalization of the metamodels and translation rules, we can guarantee the correctness of the translation. We also illustrate the effectiveness of our methodology by means of a case study.

OWL Ontology Extraction from Relational Databases via Database Reverse Engineering

The main purpose of the Semantic Web is driving the evolution of the current Web by enabling users to find, share, and combine information more easily. OWL ontologies play a key role in this effort. It is widely believed that the majority of current Web data sources are powered by relational databases (RDB). Thus developing approaches and tools for extracting OWL ontologies from RDB is helpful in bridging the gap between the existing Web data sources and the Semantic Web. This paper proposes a formal approach to automatic extraction of OWL ontologies from RDB using database reverse engineering (DBRE) technologies. The DBRE-based approach first identifies different relational structures to capture the natural domain semantics hidden in the relational schemas and data. Then it performs an automatic RDB-to-OWL schema translation by following a set of predefined translation rules that are based on the conceptual correspondences between RDB schema and OWL DL ontology. Our prototype implementation and case studies show that the proposed approach is feasible and effective.

Declaration and Translation of Spatial Access Control Policy

Access control service is used to solve the controllability problem of data and service, access control system is finally deployed in the form of policy. The description forms of policy are different in the stage of configuration and deployment. Safety policy translation model is used to realize configuration policy and automatic translation of deployment policy. However, currently it lacks automatic translation model. What’s more, automatic translation models are different according to different access control models. In this paper, a spatial access control model is proposed through the object-oriented idea. In addition, the spatial access control policy elements are declared, and they are translated through compiling principle. Finally, the configuration policy is translated to deployment policy which is described by XACML through the policy translation rules.

Rule-based approach for handling of case markers in English to Urdu/Hindi translation

This paper describes the usage of case markers in Hindi-Urdu grammar and implementation of translation rules for case marking in our English to Hindi/Urdu machine translation system. Case marking is one of the sensitive and important parts in machine translation for grammatical relation and semantic point of view. In this study, we are discussing the case marker, postpositions and their effect on nouns, pronouns and verbs. We have created and implemented translations rules and achieved n-gram BLEU score: 0.6985, METEOR score: 0.8599 and F-measure score: 0.8714 which is an improvement to our system's previous MT evaluation scores.

Petri net-based semantics for verification and validation of workflow patterns

Modelling and performance analysis is one of the most important issues in business processes. Built on top of web protocols and XML language, web services are emerging as a high level framework for business-to-business relationships. UML can be used to model web services interactions and reengineered diagrams using Petri nets like semantics instead of state machines. Unfortunately, the standard has failed to define formal semantics. To address this issue, this paper provides a mapping from activities to Petri net models. Formalisations basing on UML and Petri nets of control-flow patterns for service composition are addressed. We propose a high-level class of Petri nets for describing the behaviour of scenarios of web services composition. Developed models support the strong dynamic and temporal aspects of these scenarios. Translation rules from flow patterns into Petri net models are provided. Finally an illustrative example is given to show the applicability of the proposed approach.

Mitochondrial Genomes and Frameshift Mutations: Hidden Stop Codons, their Functional Consequences and Disease Associations

Reprogramming of mRNA translation by localized alterations in the standard translational rules is termed as recoding. Frameshifting is one class of recoding and defined as protein translations that start not at the first, but either at the second (+1 frameshift) or the third (-1 frameshift) nucleotide of the codon. Apparently, most frameshifts would yield nonfunctional proteins. Therefore frameshifts lead to waste of energy, resources and activity of the biosynthetic machinery. In addition, some peptides synthesized after frameshifts are most likely cytotoxic. Coding sequences lack stop codons, but many stop codons generated due to frameshifted sequences, termed off-frame stops or hidden stop codons. These hidden stops terminate frame-shifted translation, potentially decreasing energy, and resource waste on nonfunctional proteins. Frameshift mutations for the sake of mitochondrial genomes were evaluated and results support this putative ancient adaptive event for the selection of codons that can be part of hidden stop codons. Mitochondrial genomic data analyses support this fact as most of the correlations between hidden stops and various functional and evolutionary parameters were positive. Association of frameshift mutations with many diseases is also being studied to represent the biological significance of this putative event. It is estimated that this kind of study will reveal momentous correlation between frameshift mutations and their biological consequences.

Visual Modeling and Analysis of EMF Model Transformations Based on Triple Graph Grammars

The tool HENSHIN is an Eclipse plug-in supporting visual modeling and execution of rule-based EMF model transformations. This paper describes the re- cent extensions of HENSHIN by a visual editor for triple graph grammars (TGGs). The visual editor (called HENSHINTGG) supports a compact visualization of triple rules in an integrated editor panel. Internally, triple graph rules are represented as HENSHIN rules and can be simulated using the HENSHIN EMF model transforma- tion engine. Our extension supports the automatic generation of forward translation rules for transforming source into target models. A converter from HENSHIN TGG rules to the graph transformation analysis tool AGG allows a systematic check for conflicts of forward translation rules in AGG based on critical pair analysis.

Toward designing intelligent PDEs for computer vision: An optimal control approach

Many computer vision and image processing problems can be posed as solving partial differential equations (PDEs). However, designing a PDE system usually requires high mathematical skills and good insight into the problems. In this paper, we consider designing PDEs for various problems arising in computer vision and image processing in a lazy manner: learning PDEs from training data via an optimal control approach. We first propose a general intelligent PDE system which holds the basic translational and rotational invariance rule for most vision problems. By introducing a PDE-constrained optimal control framework, it is possible to use the training data resulting from multiple ways (ground truth, results from other methods, and manual results from humans) to learn PDEs for different computer vision tasks. The proposed optimal control based training framework aims at learning a PDE-based regressor to approximate the unknown (and usually nonlinear) mapping of different vision tasks. The experimental results show that the learnt PDEs can solve different vision problems reasonably well. In particular, we can obtain PDEs not only for problems that traditional PDEs work well but also for problems that PDE-based methods have never been tried before, due to the difficulty in describing those problems in a mathematical way.

A Neural Network based Approach for English to Hindi Machine Translation

In this paper we are discussing the working of our English to Hindi Machine Translation system. Our system is able to translate English language’s simple sentences into Hindi. This system has been implemented using feed-forward backpropagation artificial neural network. ANN model does the selection of translation rules for grammar structure and Hindi words/tokens (such as verb, noun/pronoun etc.). Neural network is used as the knowledge base and for mapping process from bilingual dictionary and linguistic rules. Bilingual dictionary is implemented using neural network, stores the meaning and linguistic features attached to the word of English and Hindi. The transformation of one natural language grammar to other natural language is the core of the machine translation specifically when the languages have different grammatical class such English and Hindi. Grammatical Structure analysis is done with the help of Stanford Tagger and Stanford Parser. The developed module is able to translate simple sentence of English language. The evaluation score achieved by the system for around 500 test sentences is: n-gram blue score 0.604; METEOR score achieved is 0.830 and F-score of 0.816. General Terms Natural language processing, machine translation

Production and perception rules underlying visual patterns: effects of symmetry and hierarchy

Formal language theory has been extended to two-dimensional patterns, but little is known about two-dimensional pattern perception. We first examined spontaneous two-dimensional visual pattern production by humans, gathered using a novel touch screen approach. Both spontaneous creative production and subsequent aesthetic ratings show that humans prefer ordered, symmetrical patterns over random patterns. We then further explored pattern-parsing abilities in different human groups, and compared them with pigeons. We generated visual plane patterns based on rules varying in complexity. All human groups tested, including children and individuals diagnosed with autism spectrum disorder (ASD), were able to detect violations of all production rules tested. Our ASD participants detected pattern violations with the same speed and accuracy as matched controls. Children's ability to detect violations of a relatively complex rotational rule correlated with age, whereas their ability to detect violations of a simple translational rule did not. By contrast, even with extensive training, pigeons were unable to detect orientation-based structural violations, suggesting that, unlike humans, they did not learn the underlying structural rules. Visual two-dimensional patterns offer a promising new formally-grounded way to investigate pattern production and perception in general, widely applicable across species and age groups.

Constructive model-based analysis for safety assessment

The aerospace industry still uses fault trees to perform reliability analysis. This is because fault-tree modeling and analysis (FTA) seems easier to practical engineers when compared with Markov models, even though FTA provides a weaker form of analysis. In this paper, we propose an automatic strategy for generating Markov-based models and corresponding analysis formulations, according to ARP 4761, directly from Simulink diagrams annotated with failure information. The generated Markov-based models are expressed in the formal language PRISM, and the analysis is carried out by the PRISM model checker. The strategy is compositional and based on a comprehensive set of translation rules from Simulink to PRISM. We briefly address soundness and completeness of the rules and, to illustrate the application of the strategy, we apply it to a classical avionics case study: an actuator control system.

Formal Modeling and Verification of Security Property in Handel C Program

Multi-million gate system-on-chip (SoC) designs easily fit into today’s Field Programmable Gate Arrays (FPGAs). As FPGAs become more common in safety-critical and mission-critical systems, researchers and designers require information flow guarantees for the FPGAs. Tools for designing a secure system of chips (SOCs) using FPGAs and new techniques to manage and analyze the security properties precisely are desirable. In this work we propose a formal approach to model, analyze and verify a typical set of security properties – noninterference – of Handel C programs using Petri Nets and model checking. This paper presents a method to model Handel C programs using Predicate Transition Nets, a type of Petri Net, and define security properties on the model, plus a verification approach where security properties are checked. Three steps are used. First, a formal specification on the Handel C description using Petri Nets is extracted. Second, the dynamic noninterference properties with respect to the Handel C program statements are defined on the model. To assist in verification, a translation rule from the Petri Nets specification to the Maude programming language is also defined. Thus, the formal specification can be verified against the system properties using model checking. A case study of the pipeline multiplier is discussed to illustrate the concept and validate the approach.

JPSearch: New international standard providing interoperable framework for image search and sharing

For the last 15 years, there have been various research and great advances in the field of content-based search and retrieval of images. In this paper, we present an overview of the JPSearch Standard, which is a recently published set of international standards providing interoperable framework for image search and sharing. The JPSearch standard is composed of six parts, which are Part 1: System framework and components, Part 2: Registration, identification and management of schema and ontology, Part 3: Query format, Part 4: File format for metadata embedded in image data (JPEG and JPEG 2000), Part 5: Data interchange format between image repositories, Part 6: Reference software. The Part 1 provides motivation and overview of the JPSearch framework. The Part 2 supports interoperability among various metadata specifications and social tagging using the specification of core metadata and translation rule description language. The Part 3 provides powerful image query language for interoperability among multiple image databases. The Part 4 specifies a file format based on JPEG and JPEG 2000 file format in which arbitrary number of metadata description of a image can be embedded. The Part 5 supports interoperability in interchanging images with metadata between image repositories. Finally, the Part 6 provides reference and utility softwares based on which the JPSearch compliant systems can be easily developed. In this paper, summaries and usage examples for each part of the JPSearch standard are presented.

XML 기반 EDI 문서 처리 시스템

This paper is about the system to process XML-based EDI e-document. This system does not use the script file when translating EDI e-document into the XML-based EDI-document. We design and implement the scanner and mapper which are the e-document processors with binary format used when reading and writing the documents. Also, we design and implement the mapping tools that graphically define the translation rules among e-documents. Therefore, the proposed XML-based EDI e-document processing system has characteristics advantages of XML and more benefits than the previous EDI e-document processing system such as faster speed, convenience, and better adaptability. Due to these advantages, this system will be widely used as the B2B gateway system.