An analysis of programs by algebraic means
An analysis of selection sort using recurrence relations.
This paper presents a method for obtaining the expected number of data movements executed by the well-known Selection sort algorithm along with its corresponding variance. The approach presented here requires hardly any specific mathematical background. In particular, the average-case cost and variance are represented using recurrence relations whose solutions lead to the desired results. Even though this method is not applicable in general, it serves to conveniently present average-case algorithm...
An analytical iterative statistical algorithm for image reconstruction from projections
The main purpose of the paper is to present a statistical model-based iterative approach to the problem of image reconstruction from projections. This originally formulated reconstruction algorithm is based on a maximum likelihood method with an objective adjusted to the probability distribution of measured signals obtained from an x-ray computed tomograph with parallel beam geometry. Various forms of objectives are tested. Experimental results show that an objective that is exactly tailored statistically...
An angent based approach to modeling the secure electronic transaction protocol.
An answer to a question by J. Milnor.
An aperiodicity problem for multiwords
Multiwords are words in which a single symbol can be replaced by a nonempty set of symbols. They extend the notion of partial words. A word w is certain in a multiword M if it occurs in every word that can be obtained by selecting one single symbol among the symbols provided in each position of M. Motivated by a problem on incomplete databases, we investigate a variant of the pattern matching problem which is to decide whether a word w is certain in a multiword M. We study the language CERTAIN(w)...
An aperiodicity problem for multiwords
Multiwords are words in which a single symbol can be replaced by a nonempty set of symbols. They extend the notion of partial words. A word w is certain in a multiword M if it occurs in every word that can be obtained by selecting one single symbol among the symbols provided in each position of M. Motivated by a problem on incomplete databases, we investigate a variant of the pattern matching problem which is to decide whether a word w is certain in a multiword M. We study the language CERTAIN(w)...
An application framework to systematically develop complex learning resources based on collaborative knowledge engineering
This contribution proposes software infrastructure to support new types of learning methodologies and resources based on collaborative knowledge engineering by means of an innovative application framework called the virtualized collaborative sessions framework (VCSF). The VCSF helps meet challenging collaborative knowledge engineering requirements in online learning, such as increasing group members' learning performance during the on-line collaborative learning process. In turn, systematic application...
An application of algebraic geometry to encryption: tame transformation method.
An Application of Discriminant Analysis and Artificial Neural Networks to Classification Problems
An application of logical-probabilistic expressions to the realization of stochastic automata
An application of -ary trees to the design of data structures for geometric searching problems
An application of results by Hardy, Ramanujan and Karamata to Ackermannian functions.
An application of the Ehrenfeucht-Fraisse game in formal language theory
An application of the theory of intuitionistic fuzzy multigraphs.
In a recent paper by one of the authors it has been shown that there is a relationship between algebraic structures and labeled transition systems. Indeed, it has been shown that an algebraic structures can be viewed as labeled transition systems, which can also be viewed as multigraphs. In this paper, we extend this work by providing an estimation of the transition possibilities between vertices that are connected with multiarcs.
An approach based on the use of the ant system to design combinational logic circuits.
In this paper we report the first attempt to design combinational logic circuits using the ant system. In order to design circuits, a measure of quality improvement in partially built circuits is introduced and a cost metric (based on the number of gates) is adopted in order to optimize the feasible circuits generated. The approach is compared to a genetic algorithm and to a human designer using several examples and the sensitivity of the algorithm to its parameters is studied using analysis of...
An Approach for Selecting Appropriate Methods for Treating Uncertainty in Knowledge Based Systems
An approach of the Naive Bayes classifier for the document classification.
An approach to parallel algorithm design
An approximate difference algorithm for massive data streams.