André Simon (2009)
Zpravodaj Československého sdružení uživatelů TeXu
Similarity:
The article presents features and options of the Highlight programme which is capable of highlighting source codes of different programming languages. The experimental approach of nested syntax configuration is tested on files with HTML+CSS+PHP+JavaScript, Perl+TeX, LaTeX+Sweave+R and Lua+TeX.
Uwe Naumann, Jan Riehme (2007)
Computer Science and Information Systems
Similarity:
Ruhui Ma, Haibing Guan, Erzhou Zhu, Yongqiang Gao, Alei Liang (2011)
Computer Science and Information Systems
Similarity:
Frédéric Feyel (2010)
ESAIM: Mathematical Modelling and Numerical Analysis
Similarity:
A finite element code, called ZéBuLoN was parallelised some years ago. This code is entirely written using an object oriented framework (C++ is the support language). The aim of this paper is to present some problems which arose during the parallelization, and some innovative solutions. Especially, a new concept of message passing is presented which allows to take into account SMP machines while still using the parallel virtual machine abstraction.
Bouyukliev, Iliya, Bouyuklieva, Stefka, Dzhumalieva-Stoeva, Maria, Monev, Venelin (2016)
Serdica Journal of Computing
Similarity:
This paper presents developed software in the area of Coding Theory. Using it, all binary self-dual codes with given properties can be classified. The programs have consequent and parallel implementations. ACM Computing Classification System (1998): G.4, E.4.
Wojciech Jaśkowski, Krzysztof Krawiec, Bartosz Wieloch (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
We propose a method that enables effective code reuse between evolutionary runs that solve a set of related visual learning tasks. We start with introducing a visual learning approach that uses genetic programming individuals to recognize objects. The process of recognition is generative, i.e., requires the learner to restore the shape of the processed object. This method is extended with a code reuse mechanism by introducing a crossbreeding operator that allows importing the genetic...
Herbert Voss (2010)
Zpravodaj Československého sdružení uživatelů TeXu
Similarity:
PSTricks is an abbreviation for PostScript Tricks and uses the enormous graphical capabilities of the old programming language PostScript. It is a so-called page code language (PCL) which is distributed since 1984 by Adobe Systems. PostScript is fully Turing compatible and a stack-oriented programming language, like Assembler, Forth, Hewlett Packard pocket calculators, et al. PDF is derived from PostScript, with some important extensions but without the possibility of mathematical calculations. ...
Landjev, Ivan, Haralambiev, Kristiyan (2007)
Serdica Journal of Computing
Similarity:
In 1965 Levenshtein introduced the deletion correcting codes and found an asymptotically optimal family of 1-deletion correcting codes. During the years there has been a little or no research on t-deletion correcting codes for larger values of t. In this paper, we consider the problem of finding the maximal cardinality L2(n;t) of a binary t-deletion correcting code of length n. We construct an infinite family of binary t-deletion correcting codes. By computer search, we construct t-deletion...
Alderson, T.L., Bruen, A.A. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ward, Harold (2001)
Serdica Mathematical Journal
Similarity:
This paper surveys parts of the study of divisibility properties of codes. The survey begins with the motivating background involving polynomials over finite fields. Then it presents recent results on bounds and applications to optimal codes.
Manev, Mladen (2009)
Serdica Journal of Computing
Similarity:
Partially supported by the Technical University of Gabrovo under Grant C-801/2008 One of the main problems in the theory of superimposed codes is to find the minimum length N for which an (N, T,w, r) superimposed code exists for given values of T , w and r. Let N(T,w, r) be the minimum length N for which an (N, T,w, r) superimposed code exists. The (N, T,w, r) superimposed code is called optimal when N = N(T,w, r). The values of N(T, 1, 2) are known for T ≤ 12 and the values...
Eugeniusz Kuriata (2008)
International Journal of Applied Mathematics and Computer Science
Similarity:
This article presents problems of unequal information importance. The paper discusses constructive methods of code generation, and a constructive method of generating asymptotic UEP codes is built. An analog model of Hamming's upper bound and Hilbert's lower bound for asymptotic UEP codes is determined.
Hans Hagen (2017)
Zpravodaj Československého sdružení uživatelů TeXu
Similarity:
In LuaTeX, it is now possible to run snippets of Lua code from within MetaPost. The article describes the mechanism, the low-level interface available in LuaTeX, as well as the high-level interface available in ConTeXt through example.
Jiang Jiang (2010)
Zpravodaj Československého sdružení uživatelů TeXu
Similarity:
The article introduces and overviews Chinese TeX typesetting from its early beginnings to the present day.
D. Long (1992)
Semigroup forum
Similarity: