Segui questo link per vedere altri tipi di pubblicazioni sul tema: Programming language translation.
Articoli di riviste sul tema "Programming language translation"
Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili
Vedi i top-50 articoli di riviste per l'attività di ricerca sul tema "Programming language translation".
Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.
Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.
Vedi gli articoli di riviste di molte aree scientifiche e compila una bibliografia corretta.
1
Darvas, Dániel, István Majzik e Enrique Blanco Viñuela. "PLC Program Translation for Verification Purposes". Periodica Polytechnica Electrical Engineering and Computer Science 61, n. 2 (23 maggio 2017): 151. http://dx.doi.org/10.3311/ppee.9743.
Testo completoAbstract (sommario):
Programmable logic controllers are typically programmed in one of the five languages defined in the IEC 61131 standard. While the ability to choose the appropriate language for each program unit may be an advantage for the developers, it poses a serious challenge to verification methods. In this paper we analyse and compare these languages to show that the ST programming language can efficiently and conveniently represent all PLC languages for formal verification purposes. Furthermore, we provide a translation method from IL to ST programming languages (for the Siemens implementation), together with a sketch of proof for its correctness. This allows the usage of the ST-based PLCverif model checking method for safety PLC programs.
2
Reznikova, Sofia, Victor Rivera, Joo Young Lee e Manuel Mazzara. "Translation from Event-B into Eiffel". Modeling and Analysis of Information Systems 25, n. 6 (19 dicembre 2018): 623–36. http://dx.doi.org/10.18255/1818-1015-2018-6-623-636.
Testo completoAbstract (sommario):
Formal modelling languages play a key role in the development of software: they enable users to specify functional requirements that serve as documentation as well; they enable users to prove the correctness of system properties, especially for critical systems. However, there is still an open question on how to map formal models to a specific programming language. In order to propose a solution, this paper presents a source-to-source mapping between Event-B models, a formal modelling language for reactive systems, and Eiffel programs, an Object Oriented (O-O) programming language. The mapping not only generates an actual Eiffel code of the Event-B model, but also translates model properties as contracts. The contracts follow the Design by Contract principle and are natively supported by the programming language. The mapping is implemented in the freely available Rodin plug-in EB2Eiffel. Thus, users can develop systems (i) starting with the modelling of functional requirements (properties) in Event-B, then (ii) formally proving the correctness of such properties in Rodin and finally (iii) by using EB2Eiffel to translate the model into Eiffel. In Eiffel, users can extend/customise the implementation of the model and formally prove it against the initial model. This paper also presents different Event-B models from the literature to test EB2Eiffel and its limitations. The article is published in the authors’ wording.
3
Ling, Wang, Luís Marujo, Chris Dyer, Alan W. Black e Isabel Trancoso. "Mining Parallel Corpora from Sina Weibo and Twitter". Computational Linguistics 42, n. 2 (giugno 2016): 307–43. http://dx.doi.org/10.1162/coli_a_00249.
Testo completoAbstract (sommario):
Microblogs such as Twitter, Facebook, and Sina Weibo (China's equivalent of Twitter) are a remarkable linguistic resource. In contrast to content from edited genres such as newswire, microblogs contain discussions of virtually every topic by numerous individuals in different languages and dialects and in different styles. In this work, we show that some microblog users post “self-translated” messages targeting audiences who speak different languages, either by writing the same message in multiple languages or by retweeting translations of their original posts in a second language. We introduce a method for finding and extracting this naturally occurring parallel data. Identifying the parallel content requires solving an alignment problem, and we give an optimally efficient dynamic programming algorithm for this. Using our method, we extract nearly 3M Chinese–English parallel segments from Sina Weibo using a targeted crawl of Weibo users who post in multiple languages. Additionally, from a random sample of Twitter, we obtain substantial amounts of parallel data in multiple language pairs. Evaluation is performed by assessing the accuracy of our extraction approach relative to a manual annotation as well as in terms of utility as training data for a Chinese–English machine translation system. Relative to traditional parallel data resources, the automatically extracted parallel data yield substantial translation quality improvements in translating microblog text and modest improvements in translating edited news content.
4
Et. al., Syed Abdul Basit Andrabi,. "A Review of Machine Translation for South Asian Low Resource Languages". Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, n. 5 (10 aprile 2021): 1134–47. http://dx.doi.org/10.17762/turcomat.v12i5.1777.
Testo completoAbstract (sommario):
Machine translation is an application of natural language processing. Humans use native languages to communicate with one another, whereas programming languages communicate between humans and computers. NLP is the field that involves a broad set of techniques for analysis, manipulation and automatic generation of human languages or natural languages with the help of computers. It is essential to provide access to information to people for their development in the present information age. It is necessary to put equal emphasis on removing the barrier of language between different divisions of society. The area of NLP strives to fill this gap of the language barrier by applying machine translation. One natural language is transformed into another natural language with the aid of computers. The first few years of this area were dedicated to the development of rule-based systems. Still, later on, due to the increase in computational power, there was a transition towards statistical machine translation. The motive of machine translation is that the meaning of the translated text should be preserved during translation. This research paper aims to analyse the machine translation approaches used for resource-poor languages and determine the needs and challenges the researchers face. This paper also reviews the machine translation systems that are available for poor research languages.
5
Chiba, Masaki, Toshiyuki Katayama e Hajime Tanaka. "A database translator of nuclear reaction data for international data exchange". Journal of Information Science 12, n. 4 (giugno 1986): 153–65. http://dx.doi.org/10.1177/016555158601200402.
Testo completoAbstract (sommario):
A practical experience in the development of a database translator is reported for use with nuclear reaction databases. The database translator provides for the exchange of nuclear reaction data between a national centre and an international centre with nuclear reaction databases. It is composed of three levels: block level, section level and code level. The translation technique adapted is one usual in programming language translation having very hospitable rules. Some difficulties similar to natural language translation are discussed, since these two databases have different schema of data compilation. The significance of the database translator is that it enables the data, which is compiled for the specific interest of a given community, to circulate internationally. The success of devel oping the database translator has identified, in practice, a new method of international cooperation, especially in a research oriented field.
6
Gunarto, Hary. "Apps-based Machine Translation on Smart Media Devices - A Review". IJCCS (Indonesian Journal of Computing and Cybernetics Systems) 13, n. 1 (31 gennaio 2019): 95. http://dx.doi.org/10.22146/ijccs.43066.
Testo completoAbstract (sommario):
Machine Translation Systems are part of Natural Language Processing (NLP) that makes communication possible among people using their own native language through computer and smart media devices. This paper describes recent progress in language dictionaries and machine translation commonly used for communications and social interaction among people or Internet users worldwide who speak different languages. Problems of accuracy and quality related to computer translation systems encountered in web & Apps-based translation are described and discussed. Possible programming solutions to the problems are also put forward to create software tools that are able to analyze and synthesize language intelligently based on semantic representation of sentences and phrases. Challenges and problems on Apps-based machine translation on smart devices towards AI, NLP, smart learning and understanding still remain until now, and need to be addressed and solved through collaboration between computational linguists and computer scientists.
7
Anjani, Artica Rizza, Sisca Wulansari Saputri e Aa Qona’atun. "A TRANSLATION EQUIVALENCE ANALYSIS OF ABSTRACT TRANSLATION IN FACULTY OF COMPUTER SCIENCE UNIVERSITY OF BANTEN JAYA 2019". Journal of English Language Teaching and Literature (JELTL) 4, n. 1 (28 febbraio 2021): 1–15. http://dx.doi.org/10.47080/jeltl.v4i1.1224.
Testo completoAbstract (sommario):
The research is content analysis which explores the using of translation equivalences applied in Faculty of Computer Science. Considering that the Faculty of Computer Science indirectly and unconsciously often carry out the process of translation in daily activities in the programming language used. The research thus aims to provide how is translation equivalence and what is the dominant translation equivalence used in translation of abstract internship report in Faculty of Computer Science 7th semester in Banten Jaya University 2019. The data conducted from 3 sections of collecting data which taken randomly from 20 abstract translations of internship report, divided into 10 abstracts from Information System Program and 10 abstracts from Information Engineering Program. The Mona Baker’s theories applied in the order to identified and classify the translation equivalences. Furthermore, Miles and Huberman method also used to analyzed the abstract of internship report to find out the first question. In the other hand a formula by Butler used to find out the second question. As the result of this research, the most dominant translation equivalence used is Above Word Level Equivalence with 35 cases (28.69%), which followed by Pragmatic Equivalence with 30 cases (24.59%), Word Level Equivalence with 26 cases (21.31%), Grammatical Equivalence with 16 cases (13.11%), and Textual Equivalence with 15 cases (12.30%).The research concludes that the translation equivalence in translations process depend on the translator point of view.
8
LEE, JOOHYUNG, NIKHIL LONEY e YUNSONG MENG. "Representing hybrid automata by action language modulo theories". Theory and Practice of Logic Programming 17, n. 5-6 (23 agosto 2017): 924–41. http://dx.doi.org/10.1017/s1471068417000412.
Testo completoAbstract (sommario):
AbstractBoth hybrid automata and action languages are formalisms for describing the evolution of dynamic systems. This paper establishes a formal relationship between them. We show how to succinctly represent hybrid automata in an action language which in turn is defined as a high-level notation for answer set programming modulo theories—an extension of answer set programs to the first-order level similar to the way satisfiability modulo theories (SMT) extends propositional satisfiability (SAT). We first show how to represent linear hybrid automata with convex invariants by an action language modulo theories. A further translation into SMT allows for computing them using SMT solvers that support arithmetic over reals. Next, we extend the representation to the general class of non-linear hybrid automata allowing even non-convex invariants. We represent them by an action language modulo ordinary differential equations, which can be compiled into satisfiability modulo ordinary differential equations. We present a prototype systemcplus2aspmtbased on these translations, which allows for a succinct representation of hybrid transition systems that can be computed effectively by the state-of-the-art SMT solverdReal.
9
Lucatero, Alejandra, J. Raymundo Marcial-Romero e J. A. Hernández. "A Scientific Calculator for Exact Real Number Computation Based on LRT, GMP and FC++". Acta Universitaria 22 (1 marzo 2012): 35–41. http://dx.doi.org/10.15174/au.2012.339.
Testo completoAbstract (sommario):
Language for Redundant Test (LRT) is a programming language for exact real number computation. Its lazy evaluation mechanism (also called call-by-need) and its infinite list requirement, make the language appropriate to be implemented in a functional programming language such as Haskell. However, a direction translation of the operational semantics of LRT into Haskell as well as the algorithms to implement basic operations (addition subtraction, multiplication, division) and trigonometric functions (sin, cosine, tangent, etc.) makes the resulting scientific calculator time consuming and so inefficient. In this paper, we present an alternative implementation of the scientific calculator using FC++ and GMP. FC++ is a functional C++ library while GMP is a GNU multiple presicion library. We show that a direct translation of LRT in FC++ results in a faster scientific calculator than the one presented in Haskell.
10
Gupta, Rahul, Aditya Kanade e Shirish Shevade. "Deep Reinforcement Learning for Syntactic Error Repair in Student Programs". Proceedings of the AAAI Conference on Artificial Intelligence 33 (17 luglio 2019): 930–37. http://dx.doi.org/10.1609/aaai.v33i01.3301930.
Testo completoAbstract (sommario):
Novice programmers often struggle with the formal syntax of programming languages. In the traditional classroom setting, they can make progress with the help of real time feedback from their instructors which is often impossible to get in the massive open online course (MOOC) setting. Syntactic error repair techniques have huge potential to assist them at scale. Towards this, we design a novel programming language correction framework amenable to reinforcement learning. The framework allows an agent to mimic human actions for text navigation and editing. We demonstrate that the agent can be trained through self-exploration directly from the raw input, that is, program text itself, without either supervision or any prior knowledge of the formal syntax of the programming language. We evaluate our technique on a publicly available dataset containing 6975 erroneous C programs with typographic errors, written by students during an introductory programming course. Our technique fixes 1699 (24.4%) programs completely and 1310 (18.8%) program partially, outperforming DeepFix, a state-of-the-art syntactic error repair technique, which uses a fully supervised neural machine translation approach.
11
Kostyuk, Yu L. "EFFECTIVE TRANSLATION FOR LL(1)-GRAMMAR IN THE EXAMPLE OF A PROGRAMMING LANGUAGE". Prikladnaya diskretnaya matematika, n. 37 (1 settembre 2017): 90–99. http://dx.doi.org/10.17223/20710410/37/7.
Testo completo
12
Huong, Giang Nguyen Thi. "GCC2Verilog Compiler Toolset for Complete Translation of C Programming Language into Verilog HDL". ETRI Journal 33, n. 5 (4 ottobre 2011): 731–40. http://dx.doi.org/10.4218/etrij.11.0110.0654.
Testo completo
13
Chang, Yin-Wen, e Michael Collins. "A Polynomial-Time Dynamic Programming Algorithm for Phrase-Based Decoding with a Fixed Distortion Limit". Transactions of the Association for Computational Linguistics 5 (dicembre 2017): 59–71. http://dx.doi.org/10.1162/tacl_a_00046.
Testo completoAbstract (sommario):
Decoding of phrase-based translation models in the general case is known to be NP-complete, by a reduction from the traveling salesman problem (Knight, 1999). In practice, phrase-based systems often impose a hard distortion limit that limits the movement of phrases during translation. However, the impact on complexity after imposing such a constraint is not well studied. In this paper, we describe a dynamic programming algorithm for phrase-based decoding with a fixed distortion limit. The runtime of the algorithm is O( nd! lh d+1) where n is the sentence length, d is the distortion limit, l is a bound on the number of phrases starting at any position in the sentence, and h is related to the maximum number of target language translations for any source word. The algorithm makes use of a novel representation that gives a new perspective on decoding of phrase-based models.
14
Trubnikov, S. V., e O. R. Denysiuk. "Implementation of a helper program for comics creation using text processing methods". Computer Modeling: Analysis, Control, Optimization 7, n. 1 (2020): 64–69. http://dx.doi.org/10.32434/2521-6406-2020-1-7-64-69.
Testo completoAbstract (sommario):
The paper discusses the development of a helper program "TypesetHelper", designed to facilitate the process of creating and translating comics. An analysis of functions of translation in modern society shows that translation, currently, is primarily a means of enabling communication between people who speak different languages. This applies, among other things, to such a specific niche as the translation of graphic novels, comics and manga. In the modern world, comics have become an integral part of popular culture, but in Ukraine, the culture of reading and translating comics is only at the stage of active formation. The purpose of this work is to create software that would facilitate the process of work with the inclusion of translated text in corresponding cleared illustrations. It is demonstrated that the existing software, including both general-purpose graphic editors like Adobe Photoshop and specialized programs for automatic recognition and translation of comics and manga, has disadvantages with respect to the problem being solved and can not be considered as a complete analogue of the software being developed. The functions that the program should perform include opening an image file, placing a text in a selected area, centering a text relative to a cloud, creating text layout, creating correct word division using automatic hyphenation methods, saving the image to a file. An analysis of possible methods of text layout when filling text clouds of various forms is given. The paper consider software design using the Unified Modeling Language (Use Case diagram, State Diagram, User Activity diagram) and its development using the C# programming language. Illustrations of the program operation process are given, which demonstrate its interface and examples of text division and layout using the selected methods. The developed helper program has practical value and can be used in comics and manga publishing houses, or for amateur translation. Keywords: text processing, comics, text layout, UML, C#.
15
Merigoux, Denis, Nicolas Chataing e Jonathan Protzenko. "Catala: a programming language for the law". Proceedings of the ACM on Programming Languages 5, ICFP (22 agosto 2021): 1–29. http://dx.doi.org/10.1145/3473582.
Testo completoAbstract (sommario):
Law at large underpins modern society, codifying and governing many aspects of citizens' daily lives. Oftentimes, law is subject to interpretation, debate and challenges throughout various courts and jurisdictions. But in some other areas, law leaves little room for interpretation, and essentially aims to rigorously describe a computation, a decision procedure or, simply said, an algorithm. Unfortunately, prose remains a woefully inadequate tool for the job. The lack of formalism leaves room for ambiguities; the structure of legal statutes, with many paragraphs and sub-sections spread across multiple pages, makes it hard to compute the intended outcome of the algorithm underlying a given text; and, as with any other piece of poorly-specified critical software, the use of informal, natural language leaves corner cases unaddressed. We introduce Catala, a new programming language that we specifically designed to allow a straightforward and systematic translation of statutory law into an executable implementation. Notably, Catala makes it natural and easy to express the general case / exceptions logic that permeates statutory law. Catala aims to bring together lawyers and programmers through a shared medium, which together they can understand, edit and evolve, bridging a gap that too often results in dramatically incorrect implementations of the law. We have implemented a compiler for Catala, and have proven the correctness of its core compilation steps using the F* proof assistant. We evaluate Catala on several legal texts that are algorithms in disguise, notably section 121 of the US federal income tax and the byzantine French family benefits; in doing so, we uncover a bug in the official implementation of the French benefits. We observe as a consequence of the formalization process that using Catala enables rich interactions between lawyers and programmers, leading to a greater understanding of the original legislative intent, while producing a correct-by-construction executable specification reusable by the greater software ecosystem. Doing so, Catala increases trust in legal institutions, and mitigates the risk of societal damage due to incorrect implementations of the law.
16
Tillmann, Christoph, e Hermann Ney. "Word Reordering and a Dynamic Programming Beam Search Algorithm for Statistical Machine Translation". Computational Linguistics 29, n. 1 (marzo 2003): 97–133. http://dx.doi.org/10.1162/089120103321337458.
Testo completoAbstract (sommario):
In this article, we describe an efficient beam search algorithm for statistical machine translation based on dynamic programming (DP). The search algorithm uses the translation model presented in Brown et al. (1993). Starting from a DP-based solution to the traveling-salesman problem, we present a novel technique to restrict the possible word reorderings between source and target language in order to achieve an efficient search algorithm. Word reordering restrictions especially useful for the translation direction German to English are presented. The restrictions are generalized, and a set of four parameters to control the word reordering is introduced, which then can easily be adopted to new translation directions. The beam search procedure has been successfully tested on the Verbmobil task (German to English, 8,000-word vocabulary) and on the Canadian Hansards task (French to English, 100,000-word vocabulary). For the medium-sized Verbmobil task, a sentence can be translated in a few seconds, only a small number of search errors occur, and there is no performance degradation as measured by the word error criterion used in this article.
17
Anwar, Muh, Nurming Saleh, Wahyu Kurniati Asri, Ambo Dalle e Hasmawati Hasmawati. "Qualitative Analysis of Problems Faced by Indonesian Students in Translation Subject". Eralingua: Jurnal Pendidikan Bahasa Asing dan Sastra 4, n. 2 (27 luglio 2020): 270. http://dx.doi.org/10.26858/eralingua.v4i2.13800.
Testo completoAbstract (sommario):
The purpose of this study was to investigate problems faced by Indonesian students in learning German translation subject. This study uses a qualitative approach with the aim of discovering the problems experienced by students in-depth during the translation course. Data collection techniques used were interviews and observation. The research respondents were students majoring in German language education who were programming courses in translation. After the data is collected, the data is analyzed descriptively qualitatively. Data that has been analyzed are then verified again by conducting Focus Group Discussion (FGD) to several students. The purpose of this FGD is to check the data collected. Finding shows that there are several difficulties or problems faced by students during their translation courses, both related to the lack of vocabulary, the lack of mastery of source language culture, and the low understanding of translation material. However, the most fundamental problem is the lack of mastery of the source language culture
18
INCLEZAN, DANIELA. "CoreALMlib: An library translated from the Component Library". Theory and Practice of Logic Programming 16, n. 5-6 (settembre 2016): 800–816. http://dx.doi.org/10.1017/s1471068416000363.
Testo completoAbstract (sommario):
AbstractThis paper presents CoreALMlib, an $\mathscr{ALM}$ library of commonsense knowledge about dynamic domains. The library was obtained by translating part of the Component Library (CLib) into the modular action language $\mathscr{ALM}$. CLib consists of general reusable and composable commonsense concepts, selected based on a thorough study of ontological and lexical resources. Our translation targets CLibstates (i.e., fluents) and actions. The resulting $\mathscr{ALM}$ library contains the descriptions of 123 action classes grouped into 43 reusable modules that are organized into a hierarchy. It is made available online and of interest to researchers in the action language, answer-set programming, and natural language understanding communities. We believe that our translation has two main advantages over its CLib counterpart: (i) it specifies axioms about actions in a more elaboration tolerant and readable way, and (ii) it can be seamlessly integrated with ASP reasoning algorithms (e.g., for planning and postdiction). In contrast, axioms are described in CLib using STRIPS-like operators, and CLib's inference engine cannot handle planning nor postdiction.
19
BANYASAD, OMID, e PHILIP T. COX. "DESIGN AND IMPLEMENTATION OF AN EDITOR/INTERPRETER FOR A VISUAL LOGIC PROGRAMMING LANGUAGE". International Journal of Software Engineering and Knowledge Engineering 23, n. 06 (agosto 2013): 801–38. http://dx.doi.org/10.1142/s0218194013500216.
Testo completoAbstract (sommario):
The design and implementation of a programming environment including an editor, a debugger and an interpreter engine for Lograph, a general-purpose visual logic programming language, is discussed. The rationale for user-interface design decisions is presented, the goal of which is to increase cognitive support for the creation, exploration and debugging of Lograph programs. The design of the interpreter engine allows for animation of execution in the debugger. The engine takes full advantage of an efficient implementation of Prolog, and operates on a Prolog translation of Lograph programs and queries. The translated Lograph programs are probed with instrumentation code at appropriate places so that applications of Lograph rules are reported to the visual interface of the Lograph debugger as a side effect of the execution of a program.
20
MYREEN, MAGNUS O., e SCOTT OWENS. "Proof-producing translation of higher-order logic into pure and stateful ML". Journal of Functional Programming 24, n. 2-3 (20 gennaio 2014): 284–315. http://dx.doi.org/10.1017/s0956796813000282.
Testo completoAbstract (sommario):
AbstractThe higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of functional programs. However, to efficiently run these programs, they must be converted (or ‘extracted’) to functional programs in a programming language such as ML or Haskell. With current techniques, this step, which must be trusted, relates similar looking objects that have very different semantic definitions, such as the set-theoretic model of a logic and the operational semantics of a programming language. In this paper, we show how to increase the trustworthiness of this step with an automated technique. Given a functional program expressed in higher-order logic, our technique provides the corresponding program for a functional language defined with an operational semantics, and it provides a mechanically checked theorem relating the two. This theorem can then be used to transfer verified properties of the logical function to the program. We have implemented our technique in the HOL4 theorem prover, translating functions to a subset of Standard ML, and have applied the implementation to examples including functional data structures, a parser generator, cryptographic algorithms, a garbage collector and the 500-line kernel of the HOL light theorem prover. This paper extends our previous conference publication with new material that shows how functions defined in terms of a state-and-exception monad can be translated, with proofs, into stateful ML code. The HOL light example is also new.
21
Arabas, Sylwester, Dorota Jarecka, Anna Jaruga e Maciej Fijałkowski. "Formula Translation in Blitz++, NumPy and Modern Fortran: A Case Study of the Language Choice Tradeoffs". Scientific Programming 22, n. 3 (2014): 201–22. http://dx.doi.org/10.1155/2014/870146.
Testo completoAbstract (sommario):
Three object-oriented implementations of a prototype solver of the advection equation are introduced. The presented programs are based on Blitz++ (C++), NumPy (Python) and Fortran's built-in array containers. The solvers constitute implementations of the Multidimensional Positive-Definite Advective Transport Algorithm (MPDATA). The introduced codes serve as examples for how the application of object-oriented programming (OOP) techniques and new language constructs from C++11 and Fortran 2008 allow to reproduce the mathematical notation used in the literature within the program code. A discussion on the tradeoffs of the programming language choice is presented. The main angles of comparison are code brevity and syntax clarity (and hence maintainability and auditability) as well as performance. All performance tests are carried out using free and open-source compilers. In the case of Python, a significant performance gain is observed when switching from the standard interpreter (CPython) to the PyPy implementation of Python. Entire source code of all three implementations is embedded in the text and is licensed under the terms of the GNU GPL license.
22
Sammons, Susan. "Challenges in Minority Langage programming in Canada's Eastern Arctic: The Training of Aboriginal Language Interpretor-Translators". section I 38, n. 1 (30 settembre 2002): 45–50. http://dx.doi.org/10.7202/004023ar.
Testo completoAbstract (sommario):
Abstract This article explains the reasons which led to the creation of Arctic College and presents its external and internal structure and more specifically, the programmes of interpretation and translation (eligibility, course contents, etc.). It gives an account of the first two years of its functioning.
23
Cornejo, M. Eugenia, David Lobo e Jesús Medina. "Relating Multi-Adjoint Normal Logic Programs to Core Fuzzy Answer Set Programs from a Semantical Approach". Mathematics 8, n. 6 (1 giugno 2020): 881. http://dx.doi.org/10.3390/math8060881.
Testo completoAbstract (sommario):
This paper relates two interesting paradigms in fuzzy logic programming from a semantical approach: core fuzzy answer set programming and multi-adjoint normal logic programming. Specifically, it is shown how core fuzzy answer set programs can be translated into multi-adjoint normal logic programs and vice versa, preserving the semantics of the starting program. This translation allows us to combine the expressiveness of multi-adjoint normal logic programming with the compactness and simplicity of the core fuzzy answer set programming language. As a consequence, theoretical properties and results which relate the answer sets to the stable models of the respective logic programming frameworks are obtained. Among others, this study enables the application of the existence theorem of stable models developed for multi-adjoint normal logic programs to ensure the existence of answer sets in core fuzzy answer set programs.
24
GIORDANO, LAURA, ALBERTO MARTELLI e DANIELE THESEIDER DUPRÉ. "Reasoning about actions with Temporal Answer Sets". Theory and Practice of Logic Programming 13, n. 2 (25 gennaio 2012): 201–25. http://dx.doi.org/10.1017/s1471068411000639.
Testo completoAbstract (sommario):
AbstractIn this paper, we combine Answer Set Programming (ASP) with Dynamic Linear Time Temporal Logic (DLTL) to define a temporal logic programming language for reasoning about complex actions and infinite computations. DLTL extends propositional temporal logic of linear time with regular programs of propositional dynamic logic, which are used for indexing temporal modalities. The action language allows general DLTL formulas to be included in domain descriptions to constrain the space of possible extensions. We introduce a notion of Temporal Answer Set for domain descriptions, based on the usual notion of Answer Set. Also, we provide a translation of domain descriptions into standard ASP and use Bounded Model Checking (BMC) techniques for the verification of DLTL constraints.
25
Potts, Christopher, Joe Pater, Karen Jesney, Rajesh Bhatt e Michael Becker. "Harmonic Grammar with linear programming: from linear systems to linguistic typology". Phonology 27, n. 1 (16 aprile 2010): 77–117. http://dx.doi.org/10.1017/s0952675710000047.
Testo completoAbstract (sommario):
AbstractHarmonic Grammar is a model of linguistic constraint interaction in which well-formedness is calculated in terms of the sum of weighted constraint violations. We show how linear programming algorithms can be used to determine whether there is a weighting for a set of constraints that fits a set of linguistic data. The associated software package OT-Help provides a practical tool for studying large and complex linguistic systems in the Harmonic Grammar framework and comparing the results with those of OT. We first describe the translation from harmonic grammars to systems solvable by linear programming algorithms. We then develop a Harmonic Grammar analysis of ATR harmony in Lango that is, we argue, superior to the existing OT and rule-based treatments. We further highlight the usefulness of OT-Help, and the analytic power of Harmonic Grammar, with a set of studies of the predictions Harmonic Grammar makes for phonological typology.
26
Abbas, Ali, e Summaira Sarfraz. "Developing a Prototype to Translate Text and Speech to Pakistan Sign Language With Bilingual Subtitles: A Framework". Journal of Educational Technology Systems 47, n. 2 (3 settembre 2018): 248–66. http://dx.doi.org/10.1177/0047239518794168.
Testo completoAbstract (sommario):
The purpose of the study is to provide a literature review of the work done on sign language (SL) around the world and in Pakistan and to develop a translation tool of speech and text to Pakistan Sign Language (PSL) with bilingual subtitles. Information and communication technology and tools development for teaching and learning purposes improve the learning process and facilitate both teachers and students. In Pakistan, unimpaired people face a lot of problems to communicate with deaf people due to the lack of SL understanding, learning resources, and interpreters. This problem is faced by the teachers who communicate with deaf students in the classrooms. The communication gap is filled with the development of a translation tool as Haseeb and Illyas concluded in their study that using this kind of tool, deaf people will have more opportunities to communicate with other members of society at every level. Different components of technology such as Python programming language, Natural Language Tool Kit, prerecorded PSL videos, Linux-based server, and databases are used to develop the prototype of PSL translation tool. This study provides a literature review to highlight the existing technological work done around the world and in Pakistan and also provides an architectural framework of the PSL translation tool which is developed by the researchers to facilitate the people who face difficulty to communicate with deaf people.
27
Febriansyah, Febi Eka, Ardiansyah Ardiansyah e Afan Darmaji. "CAWA LAMPUNG : KAMUS BAHASA INDONESIA-LAMPUNG DIALEK A BERBASIS ANDROID". KLIK - KUMPULAN JURNAL ILMU KOMPUTER 7, n. 3 (31 ottobre 2020): 331. http://dx.doi.org/10.20527/klik.v7i3.352.
Testo completoAbstract (sommario):
<p><em>Indonesia is country rich in cultural diversity, one of which is regional languages. In the Law of the Republic of Indonesia Number 24 of 2009 article 1 paragraph 6, what is meant by regional languages is the language used for generations by Indonesian citizens in regional areas in the territory of the Unitary State of the Republic of Indonesia. There are many regional languages in Indonesia, one of which is Lampung. however, the reduction in Lampung language speakers can cause the Lampung language to disappear. With the help of technology, especially Android, it can help to increase interest in Lampung language, especially in Lampung adolescents. this research will develop an Indonesian translator application to the Lampung dialect A on the Android Platform. The application is named Cawa Lampung. the translation process is carried out by the system with word translation. Every word is carried out the stemming process using the Nazief Adriani stemming method. The system development method used is eXtreme Programming. From the functional test results, all functions went well, and from the nonfunctional results it has a value of 85.57% which means "very good".</em></p><p><strong><em>Keywords</em></strong><em>: Android, T</em><em>ranslate</em><em>, Lampung</em><em> language</em><em>, Stemming Nazief Adriani</em><em> </em><em>Algorit</em><em>h</em><em>m</em></p><p><em>Indonesia adalah negara yang kaya akan keragaman budaya, salah satunya adalah bahasa daerah. Dalam Undang-Undang Republik Indonesia Nomor 24 tahun 2009 pasal 1 ayat ke 6, yang dimaksud bahasa daerah adalah bahasa yang digunakan secara turun-temurun oleh warga negara Indonesia di daerah daerah di wilayah Negara Kesatuan Republik Indonesia. Ada banyak bahasa daerah di Indonesia, salah satunya adalah bahasa lampung. namun berkurangnya penutur bahasa lampung dapat mengakibatkan bahasa daerah lampung akan hilang. Dengan bantuan teknologi terutama Android, dapat membantu meningkatkan lagi minat berbahasa lampung terutama pada remaja lampung. penelitian ini akan mengembangkan aplikasi translator bahasa Indonesia ke Bahasa Lampung dialek A pada Platform Android. Aplikasi diberi nama Cawa Lampung. proses terjemahan dilakukan oleh sistem dengan terjemahan kata perkata. Setiap kata dilakukan proses stemming dengan mengunakan metode stemming Nazief Adriani. Metode pengembangan sistem yang digunakan yaitu eXtreme Programming. Dari hasil pengujian fungsional semua fungsi berjalan dengan baik, dan dari hasil non fungsional memiliki nilai 85.57 % yang memiliki makna “sangat baik”..</em></p><p><strong><em>Kata kunci</em></strong><em>: Android, Terjemahan, Bahasa Lampung, Algoritma Stemming Nazief Adriani</em></p>
28
HERRMANN, CHRISTOPH A., e CHRISTIAN LENGAUER. "USING METAPROGRAMMING TO PARALLELIZE FUNCTIONAL SPECIFICATIONS". Parallel Processing Letters 12, n. 02 (giugno 2002): 193–210. http://dx.doi.org/10.1142/s0129626402000926.
Testo completoAbstract (sommario):
Metaprogramming is a paradigm for enhancing a general-purpose programming language with features catering for a special-purpose application domain, without a need for a reimplementation of the language. In a staged compilation, the special-purpose features are translated and optimised by a domain-specific preprocessor, which hands over to the general-purpose compiler for translation of the domain-independent part of the program. The domain we work in is high-performance parallel computing. We use metaprogramming to enhance the functional language Haskell with features for the efficient, parallel implementation of certain computational patterns, called skeletons.
29
Eleftherios, Avramidis, Poustka Lukas e Schmeier Sven. "Qualitative: Open Source Python Tool for Quality Estimation over Multiple Machine Translation Outputs". Prague Bulletin of Mathematical Linguistics 102, n. 1 (11 settembre 2014): 5–16. http://dx.doi.org/10.2478/pralin-2014-0009.
Testo completoAbstract (sommario):
Abstract “Qualitative” is a python toolkit for ranking and selection of sentence-level output by different MT systems using Quality Estimation. The toolkit implements a basic pipeline for annotating the given sentences with black-box features. Consequently, it applies a machine learning mechanism in order to rank data based on models pre-trained on human preferences. The preprocessing pipeline includes support for language models, PCFG parsing, language checking tools and various other pre-processors and feature generators. The code follows the principles of object-oriented programming to allow modularity and extensibility. The tool can operate by processing both batch-files and single sentences. An XML-RPC interface is provided for hooking up with web-services and a graphical animated web-based interface demonstrates its potential on-line use.
30
Budimlić, Zoran, Ken Kennedy e Jeff Piper. "The Cost of being Object-Oriented: A Preliminary Study". Scientific Programming 7, n. 2 (1999): 87–95. http://dx.doi.org/10.1155/1999/464598.
Testo completoAbstract (sommario):
Since the introduction of the Java programming language, there has been widespread interest in the use Java for the high performance scientific computing. One major impediment to such use is the performance penalty paid relative to Fortran. To support our research on overcoming this penalty through compiler technology, we have developed a benchmark suite, called OwlPack, which is based on the popular LINPACK library. Although there are existing implementations of LINPACK in Java, most of these are produced by direct translation from Fortran. As such they do not reflect the style of programming that a good object‐oriented programmer would use in Java. Our goal is to investigate how to make object‐oriented scientific programming practical. Therefore we developed two object‐oriented versions of LINPACK in Java, a true polymorphic version and a “Lite” version designed for higher performance. We used these libraries to perform a detailed performance analysis using several leading Java compilers and virtual machines, comparing the performance of the object‐oriented versions of the benchmark with a version produced by direct translation from Fortran. Although Java implementations have been made great strides, they still fall short on programs that use the full power of Java’s object‐oriented features. Our ultimate goal is to drive research on compiler technology that will reward, rather than penalize good object‐oriented programming practice.
31
Cristiá, Maximiliano, Diego A. Hollmann e Claudia Frydman. "A multi-target compiler for CML-DEVS". SIMULATION 95, n. 1 (13 aprile 2018): 11–29. http://dx.doi.org/10.1177/0037549718765080.
Testo completoAbstract (sommario):
Discrete Event System Specification (DEVS) is a modular and hierarchical formalism for system modeling and simulation. DEVS models can be mathematically described; simulation is performed by tools called concrete simulators. Concerning atomic DEVS models, each concrete simulator has its own input language which is, essentially, a general-purpose programming language (such as Java or C++). Hence, once engineers have written the mathematical model, they need to manually translate it into the input language of the concrete simulator of their choice. In this paper we present a multi-target compiler for atomic DEVS models written in CML-DEVS, a mathematics-based DEVS modeling language. This multi-target compiler is able to compile a CML-DEVS model to the input languages of the PowerDEVS and DEVS-Suite concrete simulators. In this way, the CML-DEVS compiler frees engineers from the manual translation of their mathematical models. In fact, the same mathematical model can be simulated on both simulators by simply recompiling the model. The CML-DEVS multi-target compiler can be easily extended to produce code for other concrete simulators.
32
Zasiekin, Serhii. "Approaches to Translation in the Context of Theory of Speech Activity". PSYCHOLINGUISTICS 24, n. 2 (3 ottobre 2018): 63–77. http://dx.doi.org/10.31470/2309-1797-2018-24-2-63-77.
Testo completoAbstract (sommario):
Over the past decades there has been a significant increase in the studies exploring cognitive foundations of translation reflected in a considerable amount of literature published on the topic. However, it is important to bear in mind that many of the ideas in the cognitive literature are mainly rooted in the psycholinguistic approaches to translation. For instance, a lot of scholarly works on translation in the former Soviet Union published in 1960-1970s emphasise the role of translator’s thinking and speech processes. The emergence of ‘theory of speech activity’, Soviet version of Western psycholinguistics, stimulated interest of linguists and psychologists who considered translation and interpreting, their procedural aspects worthy of scholarly attention. A. Leontyev (1969), one of the founders of the above mentioned ‘theory’, paid special attention to translator’s mental operations and probabilistic programming of the target language utterance(s). Thus far, a number of recent cognitive translation studies have confirmed the effectiveness of previous psycholinguistic models of translation designed within the framework of theory of speech activity. The goal of the study is a theoretical review of psycholinguistic approaches to interpreting and translation discussed in the works of scholars who were part of the Soviet theory of speech activity. The main objective is to reveal the translator’s status, his/her thinking and speech operations as psycholinguistic units in the approaches under review. Together, the psycholinguistic studies reviewed in the paper support the notion that the translator relies both on his/her algorithmic actions and heuristic solutions with the latter based on his/her background guided by probability thinking mechanism. This integrated approach proves useful in expanding our better and deeper understanding of translator’s activity.
33
DENG, YONGGANG, SHANKAR KUMAR e WILLIAM BYRNE. "Segmentation and alignment of parallel text for statistical machine translation". Natural Language Engineering 13, n. 3 (6 luglio 2006): 235–60. http://dx.doi.org/10.1017/s1351324906004293.
Testo completoAbstract (sommario):
We address the problem of extracting bilingual chunk pairs from parallel text to create training sets for statistical machine translation. We formulate the problem in terms of a stochastic generative process over text translation pairs, and derive two different alignment procedures based on the underlying alignment model. The first procedure is a now-standard dynamic programming alignment model which we use to generate an initial coarse alignment of the parallel text. The second procedure is a divisive clustering parallel text alignment procedure which we use to refine the first-pass alignments. This latter procedure is novel in that it permits the segmentation of the parallel text into sub-sentence units which are allowed to be reordered to improve the chunk alignment. The quality of chunk pairs are measured by the performance of machine translation systems trained from them. We show practical benefits of divisive clustering as well as how system performance can be improved by exploiting portions of the parallel text that otherwise would have to be discarded. We also show that chunk alignment as a first step in word alignment can significantly reduce word alignment error rate.
34
Alshawi, Hiyan, Srinivas Bangalore e Shona Douglas. "Learning Dependency Translation Models as Collections of Finite-State Head Transducers". Computational Linguistics 26, n. 1 (marzo 2000): 45–60. http://dx.doi.org/10.1162/089120100561629.
Testo completoAbstract (sommario):
The paper defines weighted head transducers, finite-state machines that perform middle-out string transduction. These transducers are strictly more expressive than the special case of standard left-to-right finite-state transducers. Dependency transduction models are then defined as collections of weighted head transducers that are applied hierarchically. A dynamic programming search algorithm is described for finding the optimal transduction of an input string with respect to a dependency transduction model. A method for automatically training a dependency transduction model from a set of input-output example strings is presented. The method first searches for hierarchical alignments of the training examples guided by correlation statistics, and then constructs the transitions of head transducers that are consistent with these alignments. Experimental results are given for applying the training method to translation from English to Spanish and Japanese.
35
Imam, Ayad Tareq, e Ayman Jameel Alnsour. "The Use of Natural Language Processing Approach for Converting Pseudo Code to C# Code". Journal of Intelligent Systems 29, n. 1 (16 aprile 2019): 1388–407. http://dx.doi.org/10.1515/jisys-2018-0291.
Testo completoAbstract (sommario):
Abstract Although current computer-aided software engineering tools support developers in composing a program, there is no doubt that more flexible supportive tools are needed to address the increases in the complexity of programs. This need can be met by automating the intellectual activities that are carried out by humans when composing a program. This paper aims to automate the composition of a programming language code from pseudocode, which is viewed here as a translation process for a natural language text, as pseudocode is a formatted text in natural English language. Based on this view, a new automatic code generator is developed that can convert pseudocode to C# programming language code. This new automatic code generator (ACG), which is called CodeComposer, uses natural language processing (NLP) techniques such as verb classification, thematic roles, and semantic role labeling (SRL) to analyze the pseudocode. The resulting analysis of linguistic information from these techniques is used by a semantic rule-based mapping machine to perform the composition process. CodeComposer can be viewed as an intelligent computer-aided software engineering (I_CASE) tool. An evaluation of the accuracy of CodeComposer using a binomial technique shows that it has a precision of 88%, a recall of 91%, and an F-measure of 89%.
36
Sklyarova, Elena, e Galina Kharlamova. "Digitalization of education and the problem of continuity". E3S Web of Conferences 273 (2021): 12096. http://dx.doi.org/10.1051/e3sconf/202127312096.
Testo completoAbstract (sommario):
The trends in the modern educational process related to digitalization, the spread of information and communication technologies, the translation of information into the language of computer programming, the use of graphic visualization techniques, computer graphics are considered. There is a tendency to increase the methodological developments prepared by the pedagogical community, dedicated to techniques, optimization of the translation of a large amount of information. The formation of an open digital educational environment is characterized as a factor of external management of the formation of learning youth. It is emphasized that this trend only partially solves the problem of professional development of young people. It is proved that continuity is possible if translation and inheritance are considered as complementary types of human activity. Inheritance, however, is a multi-level process of human interaction with the surrounding world, affecting the structures of the unconscious, and is meaningful in connection with the implementation of external activities by a person according to the norms and standards set by culture. Such a specific nature of the language makes us doubt the universal possibilities of digitizing the knowledge to be assimilated.
37
Milewicz, Reed, Marjan Mernik e Peter Pirkelbauer. "SimpleConcepts: A lightweight extension to C++ to support constraints on generic types". Computer Science and Information Systems 11, n. 4 (2014): 1361–79. http://dx.doi.org/10.2298/csis131209053m.
Testo completoAbstract (sommario):
Generic programming plays an essential role in C++ software through the use of templates. However, both the creation and use of template libraries is hindered by the fact that the language does not allow programmers to specify constraints on generic types. To date, no proposal to update the language to provide concepts has survived the committee process. Until that time comes, as a form of early support, this paper introduces SimpleConcepts, an extension to C++11 that provides support for concepts, sets of constraints on generic types. SimpleConcepts features are parsed according to an island grammar and source-to-source translation is used to lower concepts to pure C++11 code.
38
Lee, J., e R. Palla. "Reformulating the Situation Calculus and the Event Calculus in the General Theory of Stable Models and in Answer Set Programming". Journal of Artificial Intelligence Research 43 (24 aprile 2012): 571–620. http://dx.doi.org/10.1613/jair.3489.
Testo completoAbstract (sommario):
Circumscription and logic programs under the stable model semantics are two well-known nonmonotonic formalisms. The former has served as a basis of classical logic based action formalisms, such as the situation calculus, the event calculus and temporal action logics; the latter has served as a basis of a family of action languages, such as language A and several of its descendants. Based on the discovery that circumscription and the stable model semantics coincide on a class of canonical formulas, we reformulate the situation calculus and the event calculus in the general theory of stable models. We also present a translation that turns the reformulations further into answer set programs, so that efficient answer set solvers can be applied to compute the situation calculus and the event calculus.
39
Ruiz, Patricia, e Bernabé Dorronsoro. "A Novel CAD Tool for Electric Educational Diagrams". Applied Sciences 9, n. 4 (25 febbraio 2019): 810. http://dx.doi.org/10.3390/app9040810.
Testo completoAbstract (sommario):
Computer-aided design (CAD) is a technological revolution, very powerful and with large applicability to problem solving. It is essential in many different disciplines ranging from architecture to education, medicine, physics, or gaming. In this work, we propose a novel CAD tool, called CADDi, to assist in the design of electric diagrams in the educational context. We are applying the theory of formal languages to create WDLang, an easy-to-use, highly expressive, unequivocal, and correct programming language for designing electric circuits. This programming language is the cornerstone of CADDi, which automatically generates the equivalent ladder diagram (explains the circuit operation) to the programmed circuit, offering additional features that allow analysis of its functionality in an interactive way. It also offers a graphical interface to directly design ladder diagrams, or to modify the automatically generated ones. The existing electrical CAD tools are either very simple, e.g., for creating good-looking diagrams with no functionality, or too complex, for professional systems design. CADDi is extremely useful for learning purposes. It assists users on how to generate ladder diagrams, and on understanding the behavior of electrical circuits. Additionally, it serves as an assessment tool for self-evaluation in the translation from wiring diagrams to ladder ones. In order to make CADDi highly accessible, it was implemented as a web page.
40
KODAMA, KOICHI, KOHEI SUENAGA e NAOKI KOBAYASHI. "Translation of tree-processing programs into stream-processing programs based on ordered linear type". Journal of Functional Programming 18, n. 3 (maggio 2008): 333–71. http://dx.doi.org/10.1017/s0956796807006570.
Testo completoAbstract (sommario):
AbstractThere are two ways to write a program for manipulating tree-structured data such as XML documents: One is to write a tree-processing program focusing on the logical structure of the data and the other is to write a stream-processing program focusing on the physical structure. While tree-processing programs are easier to write than stream-processing programs, tree-processing programs are less efficient in memory usage since they use trees as intermediate data. Our aim is to establish a method for automatically translating a tree-processing program to a stream-processing one in order to take the best of both worlds. We first define a programming language for processing binary trees and a type system based on ordered linear type, and show that every well-typed program can be translated to an equivalent stream-processing program. We then extend the language and the type system to deal with XML documents. We have implemented an XML stream processor generator based on our algorithm, and obtained promising experimental results.
41
Foit, Krzysztof. "Controlling the Movement of the Robot's Effector on the Plane Using the SVG Markup Language". Advanced Materials Research 837 (novembre 2013): 577–81. http://dx.doi.org/10.4028/www.scientific.net/amr.837.577.
Testo completoAbstract (sommario):
In certain situations the robots effector must be moved strictly according to some path. The example of such case could be painting, cutting, milling, welding, glue applying etc. The common feature of the mentioned operations is that in the most of cases, the movement of the tool is realized on the plane. The advantage of use of a tool operated by a robot is that the work area could be placed anywhere in the manipulators workspace and can be set at almost any angle relative to ground. By specifying a local coordinate system, the operator can define the path of the tool. Referring to the earlier studies of the author, this paper continues the discussion of the possibility of using the markup languages in the field of robotics. The further part describes a proposal for the application of SVG markup language to describe the objects forming the path of a tool. Just like XML, the SVG code can be processed in many ways, giving the possibility of translation to the particular robots programming language. The described method has also some disadvantages arising from the purposes of the SVG standard, like the 2D nature of a path.
42
S D, Kulik, Belov A N e Matveeva K I. "Development of generation special short articles for the given topic". International Journal of Engineering & Technology 7, n. 2.23 (20 aprile 2018): 171. http://dx.doi.org/10.14419/ijet.v7i2.23.11909.
Testo completoAbstract (sommario):
The subject area and reviewed various sources of information relevant to a given topic will be considered. For implementation of algorithm of generation of the texts was chosen the C# language, as it has a large number of advantages compared to other programming languages, and it also has many libraries which it would be convenient to use in solving a given task. The text presents the structure of the generated article and the scheme of the developed algorithm for the application. Also it describes the structures that are used to implement such applications. The implementation of algorithm of generation of short articles on a given topic in English was discussed. Familiarization with the application was conducted and the results of generation were shown. It was shown that the generated articles have a good percentage of the plagiarism by experimental studies. It was shown that the articles would not be repeated even more than 50 generations, as a result of tests. Also was shown the implementation of the program on C# language, it’s interface, design generation and design of the English translation.
43
Tedjosurya, Dian Puspita, e Suharjito Suharjito. "MODEL OF MOBILE TRANSLATOR APPLICATION OF ENGLISH TO BAHASA INDONESIA WITH RULE-BASED AND J2ME". CommIT (Communication and Information Technology) Journal 8, n. 1 (30 maggio 2014): 28. http://dx.doi.org/10.21512/commit.v8i1.593.
Testo completoAbstract (sommario):
Along with the development of information technology in recent era, a number of new applications emerge, especially on mobile phones. The use of mobile phones, besides as communication media, is also as media of learning, such as translator application. Translator application can be a tool to learn a language, such as English to Bahasa Indonesia translator application. The purpose of this research is to allow user to be able to translate English to Bahasa Indonesia on mobile phone easily. Translator application on this research was developed using Java programming language (especially J2ME) because of its advantage that can run on various operating systems and its open source that can be easily developed and distributed. In this research, data collection was done through literature study, observation, and browsing similar application. Development of the system used object-oriented analysis and design that can be described by using case diagrams, class diagrams, sequence diagrams, and activity diagrams. The translation process used rule-based method. Result of this research is the application of Java-based translator which can translate English sentence into Indonesian sentence. The application can be accessed using a mobile phone with Internet connection. The application has spelling check feature that is able to check the wrong word and provide alternative word that approaches the word input. Conclusion of this research is the application can translate sentence in daily conversation quite well with the sentence structure corresponds and is close to its original meaning.
44
Grando, María Adela. "Owicki-Gries Theory: A Possible Way of Relating Grammar Systems to Concurrent Programs". Triangle, n. 8 (29 giugno 2018): 19. http://dx.doi.org/10.17345/triangle8.19-41.
Testo completoAbstract (sommario):
The aim of this paper is to show how grammar systems and concurrent programs might be viewed as related models for distributed and cooperating computation. We argue that it is possible to translate a grammar system into a concurrent program, where the Owicki-Gries theory and other tools available in the programming framework can be used. The converse translation is also possible and this turns out to be useful when we are looking for a grammar system that can generate a given language. In order to show this we use tools from concurrent programming theory to prove that Lcd = {anbmcndm | n,m ≥ 1} can be generated by a non-returning Parallel Communicating grammar system with three regular components. We show that this strategy can be helpful in the construction of grammar systems that generate strings in less time and more eciently. We also discuss the absence of strategies in the concurrent programming theory to prove that Lcd can be generated by any Parallel Communicating grammar system with two regular components.
45
Avramidis, Eleftherios. "QE::GUI – A Graphical User Interface for Quality Estimation". Prague Bulletin of Mathematical Linguistics 109, n. 1 (1 ottobre 2017): 51–60. http://dx.doi.org/10.1515/pralin-2017-0038.
Testo completoAbstract (sommario):
Abstract Despite its wide applicability, Quality Estimation (QE) of Machine Translation (MT) poses a difficult entry barrier since there are no open source tools with a graphical user interface (GUI). Here we present a tool in this direction by connecting the back-end of the QE decision-making mechanism with a web-based GUI. The interface allows the user to post requests to the QE engine and get a visual response with the results. Additionally we provide pre-trained QE models for easier launching of the app. The tool is written in Python so that it can leverage the rich natural language processing capabilities of the popular dynamic programming language, which is at the same time supported by top web-server environments.
46
FAXÉN, KARL-FILIP. "A static semantics for Haskell". Journal of Functional Programming 12, n. 4-5 (luglio 2002): 295–357. http://dx.doi.org/10.1017/s0956796802004380.
Testo completoAbstract (sommario):
This paper gives a static semantics for Haskell 98, a non-strict purely functional programming language. The semantics formally specifies nearly all the details of the Haskell 98 type system, including the resolution of overloading, kind inference (including defaulting) and polymorphic recursion, the only major omission being a proper treatment of ambiguous overloading and its resolution. Overloading is translated into explicit dictionary passing, as in all current implementations of Haskell. The target language of this translation is a variant of the Girard–Reynolds polymorphic lambda calculus featuring higher order polymorphism and explicit type abstraction and application in the term language. Translated programs can thus still be type checked, although the implicit version of this system is impredicative. A surprising result of this formalization effort is that the monomorphism restriction, when rendered in a system of inference rules, compromises the principal type property.
47
Sussman, Steve. "International Translation of Project EX: A Teen Tobacco Use Cessation Program". SUCHT 58, n. 5 (gennaio 2012): 317–25. http://dx.doi.org/10.1024/0939-5911.a000205.
Testo completoAbstract (sommario):
Aims: There are relatively few documented teen tobacco use cessation efforts outside the United States (U. S.). Project EX is an evidence-based program that consists of eight sessions, as a school-based clinic tobacco cessation-only version and a classroom-based prevention and cessation version. This paper provides a ‘snapshot’ of progress on international translation of Project EX pilot study work in eight countries that have been approached thus far. The program was implemented in Wuhan, China; Israel and partners; Bashkortostan, Russia; and Elche, Spain. Implementation is planned for Vienna, Austria; Mumbai, India; and Bangkok, Thailand. This work will lead eventually to a greater understanding regarding preference for type of programming (e. g., clinic versus classroom modality), challenges in recruitment and retention, program receptivity, and short-term (approximately 3-month post-program) quit rates. Protocol and Interim Results of International Translation of Project EX: Convenience samples are being recruited based on previous contacts with each location. A protocol was sent to each location, proposing a controlled design, in which subjects enter cessation groups or become a wait-list control, with an immediate pretest, posttest, and 3-month follow-up. Language translation of program materials was completed in seven of the eight locations. Several variations in design and implementation were demanded though. For example, youth fear of reporting tobacco publicly mandated to researchers that the prevention/cessation classroom version be implemented in some locations (Israel and partners, and India). Program effects are suggested across countries. Conclusions: Ongoing partnerships with parties actively involved in tobacco control facilitate pilot testing of teen tobacco use cessation programming. The Project EX curriculum appears quite translatable, though having flexibility in implementation modality eased being able to pilot test the program. Research on this cognitive-behavioral, motivation enhancement approach continues.
48
Lin, Xiaoqing, Fu Zhang, Danling Wang e Jingwei Cheng. "RDF keyword search using multiple indexes". Filomat 32, n. 5 (2018): 1861–73. http://dx.doi.org/10.2298/fil1805861l.
Testo completoAbstract (sommario):
Since SPARQL has been the standard language for querying RDF data, keyword search based on keywords-to-SPARQL translation attracts more intention. However, existing keyword search based on keywords-to-SPARQL translation have limitations that the schema used for keyword-to-SPARQL translation is incomplete so that wrong or incomplete answers are returned and advantages of indexes are not fully taken. To address the issues, an inter-entity relationship summary (ER-summary) is constructed by distilling all the inter-entity relationships of RDF data graph. On ER-summary, we draw circles around each vertex with a given radius r and in the circles we build the shortest property path index (SP-index), the shortest distance index (SD-index) and the r-neighborhoods index by using dynamic programming algorithm. Rather than searching for top-k subgraphs connecting all the keywords centered directly as most existing methods do, we use these indexes to translate keyword queries into SPARQL queries to realize exchanging space for time. Extensive experiments show that our approach is efficient and effective.
49
Feinerer, Ingo. "Efficient large-scale configuration via integer linear programming". Artificial Intelligence for Engineering Design, Analysis and Manufacturing 27, n. 1 (15 gennaio 2013): 37–49. http://dx.doi.org/10.1017/s0890060412000376.
Testo completoAbstract (sommario):
AbstractConfiguration of large-scale applications in an engineering context requires a modeling environment that allows the design engineer to draft the configuration problem in a natural way and efficient methods that can process the modeled setting and scale with the number of components. Existing configuration methods in artificial intelligence typically perform quite well in certain subareas but are hard to use for general-purpose modeling without mathematical or logics background (the so-called knowledge acquisition bottleneck) and/or have scalability issues. As a remedy to this important issue both in theory and in practical applications, we use a standard modeling environment like the Unified Modeling Language that has been proposed by the configuration community as a suitable object-oriented formalism for configuration problems. We provide a translation of key concepts of class diagrams to inequalities and identify relevant configuration aspects and show how they are treated as an integer linear program. Solving an integer linear program can be done efficiently, and integer linear programming scales well to large configurations consisting of several thousands components and interactions. We conduct an empirical study in the context of package management for operating systems and for the Linux kernel configuration. We evaluate our methodology by a benchmark and obtain convincing results in support for using integer linear programming for configuration applications of realistic size and complexity.
50
MANZONETTO, GIULIO. "What is a categorical model of the differential and the resource λ-calculi?" Mathematical Structures in Computer Science 22, n. 3 (27 febbraio 2012): 451–520. http://dx.doi.org/10.1017/s0960129511000594.
Testo completoAbstract (sommario):
The differential λ-calculus is a paradigmatic functional programming language endowed with a syntactical differentiation operator that allows the application of a program to an argument in a linear way. One of the main features of this language is that it is resource conscious and gives the programmer suitable primitives to handle explicitly the resources used by a program during its execution. The differential operator also allows us to write the full Taylor expansion of a program. Through this expansion, every program can be decomposed into an infinite sum (representing non-deterministic choice) of ‘simpler’ programs that are strictly linear.The aim of this paper is to develop an abstract ‘model theory’ for the untyped differential λ-calculus. In particular, we investigate what form a general categorical definition of a denotational model for this calculus should take. Starting from the work of Blute, Cockett and Seely on differential categories, we develop the notion of a Cartesian closed differential category and prove that linear reflexive objects living in such categories constitute sound and complete models of the untyped differential λ-calculus. We also give sufficient conditions for Cartesian closed differential categories to model the Taylor expansion. This requires that every model living in such categories equates all programs having the same full Taylor expansion.We then provide a concrete example of a Cartesian closed differential category modelling the Taylor expansion, namely the category MRel of sets and relations from finite multisets to sets. We prove that the extensional model of λ-calculus we have recently built in MRel is linear, and is thus also an extensional model of the untyped differential λ-calculus. In the same category, we build a non-extensional model and prove that it is, nevertheless, extensional on its differential part.Finally, we study the relationship between the differential λ-calculus and the resource calculus, which is a functional programming language combining the ideas behind the differential λ-calculus with those behind Boudol's λ-calculus with multiplicities. We define two translation maps between these two calculi and study the properties of these translations. In particular, this analysis shows that the two calculi share the same notion of a model, and thus that the resource calculus can be interpreted by translation into every linear reflexive object living in a Cartesian closed differential category.