All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 91 Next

Displaying 1801 – 1820 of 4973

Showing per page

Extending Full Text Search Engine for Mathematical Content

Mišutka, Jozef, Galamboš, Leo (2008)

Towards Digital Mathematics Library. Birmingham, United Kingdom, July 27th, 2008

The WWW became the main resource of mathematical knowledge. Currently available full text search engines can be used on these documents but they are deficient in almost all cases. By applying axioms, equal transformations, and by using different notation each formula can be expressed in numerous ways. Most of these documents do not contain semantic information; therefore, precise mathematical interpretation is impossible. On the other hand, semantic information can help to give more precise information....

Extending regular expressions with homomorphic replacement

Henning Bordihn, Jürgen Dassow, Markus Holzer (2010)

RAIRO - Theoretical Informatics and Applications

We define H- and EH-expressions as extensions of regular expressions by adding homomorphic and iterated homomorphic replacement as new operations, resp. The definition is analogous to the extension given by Gruska in order to characterize context-free languages. We compare the families of languages obtained by these extensions with the families of regular, linear context-free, context-free, and EDT0L languages. Moreover, relations to language families based on patterns, multi-patterns,...

Extending the lambda-calculus with unbind and rebind

Mariangiola Dezani-Ciancaglini, Paola Giannini, Elena Zucca (2011)

RAIRO - Theoretical Informatics and Applications

We extend the simply typed λ-calculus with unbind and rebind primitive constructs. That is, a value can be a fragment of open code, which in order to be used should be explicitly rebound. This mechanism nicely coexists with standard static binding. The motivation is to provide an unifying foundation for mechanisms of dynamic scoping, where the meaning of a name is determined at runtime, rebinding, such as dynamic updating of resources and exchange of mobile code, and delegation, where an alternative...

Extending the lambda-calculus with unbind and rebind

Mariangiola Dezani-Ciancaglini, Paola Giannini, Elena Zucca (2011)

RAIRO - Theoretical Informatics and Applications

We extend the simply typed λ-calculus with unbind and rebind primitive constructs. That is, a value can be a fragment of open code, which in order to be used should be explicitly rebound. This mechanism nicely coexists with standard static binding. The motivation is to provide an unifying foundation for mechanisms of dynamic scoping, where the meaning of a name is determined at runtime, rebinding, such as dynamic updating of resources and exchange of mobile code, and delegation, where an alternative...

Extending the UML for modelling variability for system families

Silva Robak, Bogdan Franczyk, Silva Robak (2002)

International Journal of Applied Mathematics and Computer Science

The process of modelling and developing commonality and variability for system families should be supported by suitable methods and notations. The object-oriented methods and their notations, which are used at present, focus on the development of a single system at a time. In this paper we analyse feature models as a representation of the common parts and variants contained in a system family, and propose using a feature diagram as a basic representation of commonality, variability and dependencies....

Extracting Precise Data on the Mathematical Content of PDF Documents

Baker, Josef B., Sexton, Alan P., Sorge, Volker (2008)

Towards Digital Mathematics Library. Birmingham, United Kingdom, July 27th, 2008

As more and more scientific documents become available in PDF format, their automatic analysis becomes increasingly important. We present a procedure that extracts mathematical symbols from PDF documents by examining both the original PDF file and a rasterized version. This provides more precise information than is available either directly from the PDF file or by traditional character recognition techniques. The data can then be used to improve mathematical parsing methods that transform the mathematics...

Extraction of fuzzy logic rules from data by means of artificial neural networks

Martin Holeňa (2005)

Kybernetika

The extraction of logical rules from data has been, for nearly fifteen years, a key application of artificial neural networks in data mining. Although Boolean rules have been extracted in the majority of cases, also methods for the extraction of fuzzy logic rules have been studied increasingly often. In the paper, those methods are discussed within a five-dimensional classification scheme for neural-networks based rule extraction, and it is pointed out that all of them share the feature of being...

Extraction of fuzzy rules using deterministic annealing integrated with ε-insensitive learning

Robert Czabański (2006)

International Journal of Applied Mathematics and Computer Science

A new method of parameter estimation for an artificial neural network inference system based on a logical interpretation of fuzzy if-then rules (ANBLIR) is presented. The novelty of the learning algorithm consists in the application of a deterministic annealing method integrated with ε-insensitive learning. In order to decrease the computational burden of the learning procedure, a deterministic annealing method with a "freezing" phase and ε-insensitive learning by solving a system of linear inequalities...

Eye localization for face recognition

Paola Campadelli, Raffaella Lanzarotti, Giuseppe Lipori (2006)

RAIRO - Theoretical Informatics and Applications

We present a novel eye localization method which can be used in face recognition applications. It is based on two SVM classifiers which localize the eyes at different resolution levels exploiting the Haar wavelet representation of the images. We present an extensive analysis of its performance on images of very different public databases, showing very good results.

Factor frequencies in generalized Thue-Morse words

Ľubomíra Balková (2012)

Kybernetika

We describe factor frequencies of the generalized Thue-Morse word 𝐭 b , m defined for b ≥ 2 , m ≥ 1 , b , m ∈ ℕ , as the fixed point starting in 0 of the morphism ϕ b , m ( k ) = k ( k + 1 ) ⋯ ( k + b - 1 ) , where k ∈ { 0 , 1 , ⋯ , m - 1 } and where the letters are expressed modulo m . We...

Factoring and testing primes in small space

Viliam Geffert, Dana Pardubská (2013)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We discuss how much space is sufficient to decide whether a unary given number n is a prime. We show that O(log log n) space is sufficient for a deterministic Turing machine, if it is equipped with an additional pebble movable along the input tape, and also for an alternating machine, if the space restriction applies only to its accepting computation subtrees. In other words, the language is a prime is in pebble–DSPACE(log log n) and also in accept–ASPACE(log log n). Moreover, if the given n is...

Currently displaying 1801 – 1820 of 4973