1,699 research outputs found
Equidistant cyclic codes over GF(q)
No full textAbstractHere it is proved that a cyclic (n, k) code over GF(q) is equidistant if and only if its parity check polynomial is irreducible and has exponent e = (qk − 1)a where a divides q − 1 and (a, k) = 1. The length n may be any multiple of e. The proof of this theorem also shows that if a cyclic (n,k) code over GF(q) is not a repetition of a shorter code and the average weight of its nonzero code words is integral, then its parity check polynomial is irreducible over GF(q) with exponent n = (qk − 1)a where a divides q − 1
Relaxations of GF(4)-representable matroids
No full textWe consider the GF(4)-representable matroids with a circuit-hyperplane such that the matroid obtained by relaxing the circuit-hyperplane is also GF(4)-representable. We characterize the structure of these matroids as an application of structure theorems for the classes of U2,4-fragile and {U2,5, U3,5}-fragile matroids. In addition, we characterize the forbidden submatrices in GF(4)-representations of these matroids
Implementing an Efficient Elliptic Curve Cryptosystem over on a Smart Card
No full textElliptic curve cryptosystems (ECCs) are becoming more popular because of the reduced number of key bits required in comparison to other cryptosystems (for example, a 160 bit ecc has roughly the same security as 1024 bit RSA). ECCs are especially suited to smart cards because of the limited memory and computational power available on these devices. This paper discusses an optimized implementation of the elliptic curve Digital Signature Algorithm implemented over the field on a Motorola smart card. Algorithms for point addition, point doubling and scalar multiplication are compared according to their timings. The effects of different memory usage, code size and speed tradeoffs which were considered during the implementation are discussed. Also, optimized point addition and doubling algorithms are presented
Fibronectin at Select Sites Binds Multiple Growth Factors and Enhances their Activity: Expansion of the Collaborative ECM-GF Paradigm
No full textIntensive research has demonstrated that extracellular matrix (ECM) molecules and growth factors (GF) collaborate at many different levels. The ability of ECM to modulate GF signals has important implications in tissue formation and homeostasis as well as novel therapies for acute and chronic wounds. Recently, a number of GF-binding sites was identified in fibronectin (FN) and was shown to provide another layer of regulation on GF signaling. Here, we review these new findings on FN interaction with GF in the context of general ways ECM molecules regulate GF signaling
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
- …
