998 research outputs found
Language Engineering in Grammatical Framework (GF)
No full textThis thesis describes a number of practical experiments rather than theoreticalinvestigations in the area of natural language processing. The basis forthe work presented is Grammatical Framework (GF). It is a very complexsystem, which comprises among other things a grammar formalism based ontype theory and its implementation written in Haskell. GF is intended forhigh-quality machine translation (of INTERLINGUA type) in the restrictedlanguage domains.The primary concern of this thesis is however limited to the usage of GFas a piece of software. The main results are: Implementing a syntax editor, which provides a graphical user interface(GUI) for the command-line GF core. Writing a part of code for automatic generation of gramletspure Javaprograms with limited (compared to GF) functionality that can be runon PDA (Portable Device Assistants) and as applets in a browser. Writing the Russian resource grammar that takes care of the most basicmorphological and syntactic rules and serves as a standard libraryfor building application grammars (describing restricted language domains)in Russian.These results contribute to language engineering in GF on two differentlevels: Author level (end-user) constructing sentences in natural languages. Grammarian level building a grammar description, which is laterused on the author level.The last part of the thesis deals with a non-linguistic domain. In thatexperiment we try to apply functional parsing technique to the well-knownproblem of protein secondary structure prediction (bioinformatics)
Language Engineering in Grammatical Framework (GF)
No full textThis thesis describes a number of practical experiments rather than theoreticalinvestigations in the area of natural language processing. The basis forthe work presented is Grammatical Framework (GF). It is a very complexsystem, which comprises among other things a grammar formalism based ontype theory and its implementation written in Haskell. GF is intended forhigh-quality machine translation (of INTERLINGUA type) in the restrictedlanguage domains.The primary concern of this thesis is however limited to the usage of GFas a piece of software. The main results are: Implementing a syntax editor, which provides a graphical user interface(GUI) for the command-line GF core. Writing a part of code for automatic generation of gramletspure Javaprograms with limited (compared to GF) functionality that can be runon PDA (Portable Device Assistants) and as applets in a browser. Writing the Russian resource grammar that takes care of the most basicmorphological and syntactic rules and serves as a standard libraryfor building application grammars (describing restricted language domains)in Russian.These results contribute to language engineering in GF on two differentlevels: Author level (end-user) constructing sentences in natural languages. Grammarian level building a grammar description, which is laterused on the author level.The last part of the thesis deals with a non-linguistic domain. In thatexperiment we try to apply functional parsing technique to the well-knownproblem of protein secondary structure prediction (bioinformatics)
Language Engineering in Grammatial Framework (GF)
No full textThe basis for the work presented is Grammatical Framework (GF)a grammar
formalism based on type theory. It is also a powerful language processor
that provides a convenient framework for various multilingual applications.
The primary concern of this thesis is the usage of GF as a piece of software.
The main results are:
Implementing a syntax editor, which provides a graphical user interface
(GUI) for the command-line GF core.
Writing the Russian resource grammar that takes care of the most
basic morphological and syntactic rules and serves as a standard library
for building application grammars (describing sublanguage domains) in
Russian.
These results contribute to language engineering in GF on two different
levels:
Author level (end-user)constructing documents in natural languages.
Grammarian level building a grammar description, which is later
used on the author level. One can also distinguish between application
and resource grammars. An application grammar focuses of a particular
sub-language domain, while resource grammar is a general-purpose
grammar that forms a basis for application grammars
Internship at GoFoton GF Micro Optics Philippines, Inc.
No full textThis paper is a compilation of the internship of the author in the 1st semester of the academic year 2012-2013. It serves as a documentation of the activities that transpired in the internship of the author in GF Micro Optics Philippines, Inc. from May, 1012 until August, 2012.
Included in this paper are the company profile, experiences of the author in the company, and the tasks assigned while taking the training course. Process flow improvement was the main task of the author as his main role under the Industrial Engineering Department of GF Micro Optics Philippines, Inc.
Furthermore, the paper includes problems encountered and lessons learned by the author throughout the training course. These lessons include time management, co-worker management, task management, and enhancement of the authors whole being and skills such as problem solving. All are explained in this manuscript in order to provide self and academic evaluation of the authors training
Linear complexity profile of sequences over the field GF(Q)
No full textSummary form only given. The author extends Reuppel's concept of the linear complexity profile of binary sequences to sequences over an arbitrary finite field and provides formulas for the expected linear complexity and its variance of sequences Sn of length n over GF(q). He shows that the variance approaches 1/q when q approaches ∞. He presents criteria that could be useful when using the linear complexity profile for investigating the randomness of sequences over GF(q). Finally, the author investigates how useful these criteria are by comparing the results with other randomness tests
Linear complexity profile of sequences over the field GF(Q)
No full textSummary form only given. The author extends Reuppel's concept of the linear complexity profile of binary sequences to sequences over an arbitrary finite field and provides formulas for the expected linear complexity and its variance of sequences Sn of length n over GF(q). He shows that the variance approaches 1/q when q approaches ∞. He presents criteria that could be useful when using the linear complexity profile for investigating the randomness of sequences over GF(q). Finally, the author investigates how useful these criteria are by comparing the results with other randomness tests
Thesis for the Degree of Doctor of Philosophy Language Engineering in Grammatical Framework (GF)
No full textThe basis for the work presented is Grammatical Framework (GF) — a grammar formalism based on type theory. It is also a powerful language processor that provides a convenient framework for various multilingual applications. The primary concern of this thesis is the usage of GF as a piece of software. The main results are: • Implementing a syntax editor, which provides a graphical user interface (GUI) for the command-line GF core. • Writing the Russian resource grammar that takes care of the most basic morphological and syntactic rules and serves as a standard library for building application grammars (describing sublanguage domains) in Russian. These results contribute to language engineering in GF on two different levels: • Author level (end-user) — constructing documents in natural languages. • Grammarian level — building a grammar description, which is later used on the author level. One can also distinguish between application and resource grammars. An application grammar focuses of a particular sub-language domain, while resource grammar is a general-purpose grammar that forms a basis for application grammars
A systolic exponentiator for finite fields GF(2m)
No full text[[abstract]]© 1992 Institute of Electrical and Electronics Engineers - The author presents a novel parallel-in-parallel-out bit-level systolic array with unidirectional data flow for computing exponentiation in GF(2m). The array is highly regular and modular, and thus well it is suited to VLSI implementation. In addition, it can provide the maximum throughput in the sense of producing new results at a rate of one per clock cycle. Compared to a previously known systolic (GF2m) exponentiator with the same throughput performance, the proposed system requires much less chip area, has smaller latency, and makes it easier to incorporate fault-tolerant design[[department]]電機工程學
System design as a decisive step in engineering naval capability
No full textBoth costs and capability of naval ships are mainly determined in the early phases of design. The increasing power of computers and sophistication of simulation packages offers the challenge to create more different system designs in an early stage of ship design with a higher level of engineering detail, as well as the challenge to develop advanced tools to simulate actual service conditions to gain better insight in system cost and capability. This paper will introduce a PhD-research project in Model-based Ship Energy System Conceptual Design (MOSES-CD) and will explore the possibilities of the proposed approach by presenting a propulsion study for a future surface combatant of the Royal Netherlands Navy.Accepted Author ManuscriptShip Design, Production and Operation
Rank <i>r</i> Solutions to the Matrix Equation <i>XAX<sup>T</sup></i> = <i>C</i>, <i>A</i> Nonalternate, <i>C</i> Alternate, Over <i>GF</i>(2<sup>y</sup>).
No full textLet GF(q) denote a finite field of order q = py, p a prime. Let A and C be symmetric matrices of order n, rank m and order s, rank k, respectively, over GF(q). Carlitz [6] has determined the number N(A, C, n, s) of solutions X over GF(q), for p an odd prime, to the matrix equation1.1where n = m. Furthermore, Hodges [9] has determined the number N(A, C, n, s, r) of s × n matrices X of rank r over GF(q), p an odd prime, which satisfy (1.1). Perkin [10] has enumerated the s × n matrices of given rank r over GF(q), q = 2y, such that XXT = 0. Finally, the author [3] has determined the number of solutions to (1.1) in case C = 0, where q = 2y.</jats:p
- …
