The paper explains the main idea of how the Estelle semantics may be reinterpreted within the queuing network model making possible a translation of Estelle into the algorithmic language of the Queuing Network Analysis Package (QNAP2). Such a translation gives access to all utilities of the package and enables the performance analysis to be integrated into the design process of Estelle specific...

In this paper we discuss how any recursively enumerable language can be generated using a distributed splicing system with a xed number of nine test tubes. This number has been recently reduced by other authors, and in this work we try to give an insightful algorithmic description of this kind of systems.

It is shown that for a large class of non-holonomic quantum mechanical systems one can make the computation of BRST charge fully algorithmic. Two computer algebra programs written in the language of REDUCE are described. They are able to realize the complex calculations needed to determine the charge for general nonlinear algebras. Some interesting specific solutions are discussed.

We discuss the frequent pattern mining problem in a general setting. From an analysis of abstract representations, summarization and frequent pattern mining, we arrive at a generalization of the problem. Then, we show how the problem can be cast into the powerful language of algorithmic information theory. This allows us to formulate a simple algorithm to mine for all frequent patterns. 1

We present the algorithmic core of a full text data base that allows fast Boolean queries, phrase queries, and document reporting using less space than the input text. The system uses a carefully choreographed combination of classical data compression techniques and inverted index based search data structures. It outperforms suffix array based techniques for all the above operations for real wo...

This chapter gives a brief introduction into basic data structures and algorithms, together with references to tutorials available in the literature. We first introduce fundamental notation and algorithmic concepts. We then explain several sorting algorithms and give small examples. As fundamental data structures, we introduce linked lists, trees and graphs. Implementations are given in the pro...

In this paper, we present a theoretical effort to connect the theory of program size to psychology by implementing a concrete language of thought with Turing-computable Kolmogorov complexity (LTC) satisfying the following requirements: 1) to be simple enough so that the complexity of any given finite binary sequence can be computed, 2) to be based on tangible operations of human reasoning (prin...

nowadays, software cost estimation (sce) with machine learning techniques are more performance than other traditional techniques which were based on algorithmic techniques. in this paper, we present a new hybrid model of multi-layer perceptron (mlp) artificial neural network (ann) and ant colony optimization (aco) algorithm for high accuracy in sce called multilayer perceptron ant colony optimi...