The importance of each node in a structure of links: Google-PageRank.
The independence of certain operations on semiAFLs
The Influence of Look-Ahead on the Error Rate of Transcription
In this paper we study the error rate of RNA synthesis in the look-ahead model for the random walk of RNA polymerase along DNA during transcription. The model’s central assumption is the existence of a window of activity in which ribonucleoside triphosphates (rNTPs) bind reversibly to the template DNA strand before being hydrolyzed and linked covalently to the nascent RNA chain. An unknown, but important, integer parameter of this model is the window...
The influence of random number generators on graph partitioning algorithms.
The insertion encoding of permutations.
The intersection problem for alphabetic vector monoids
The intrinsic complexity of parametric elimination methods.
The inverse maximum flow problem considering l∞ norm
The problem is to modify the capacities of the arcs from a network so that a given feasible flow becomes a maximum flow and the maximum change of the capacities on arcs is minimum. A very fast O(m⋅log(n)) time complexity algorithm for solving this problem is presented, where m is the number of arcs and n is the number of nodes of the network. The case when both, lower and upper bounds of the flow can be modified so that the given feasible flow becomes a maximum flow is also discussed. The algorithm...
The inverse semigroup of a sumordered semiring.
The irrelevant information principle for collective probabilistic reasoning
Within the framework of discrete probabilistic uncertain reasoning a large literature exists justifying the maximum entropy inference process, , as being optimal in the context of a single agent whose subjective probabilistic knowledge base is consistent. In particular Paris and Vencovská completely characterised the inference process by means of an attractive set of axioms which an inference process should satisfy. More recently the second author extended the Paris-Vencovská axiomatic approach...
The Ising transducer
The laterality problem for non-erasing Turing machines on is completely solved
The lattice of subautomata of an automaton: A survey.
The lattice of varieties of fibered automata
The class of all fibered automata is a variety of two-sorted algebras. This paper provides a full description of the lattice of varieties of fibred automata.
The limiting common distribution of two leaf heights in a random binary tree
The linear complexity of a graph.
The local catenativity of DOL-sequences in free commutative monoids is decidable in the binary case
The logic of neural networks.
This paper establishes the equivalence between multilayer feedforward networks and linear combinations of Lukasiewicz propositions. In this sense, multilayer forward networks have a logic interpretation, which should permit to apply logical techniques in the neural networks framework.
The Maslov dequantization, idempotent and tropical mathematics: a brief introduction.
The maximum number of edges in a three-dimensional grid-drawing.