Search results for "abstract"

David Marr: A Theory for Cerebral Neocortex

1986

This paper is an important contribution to the understanding of the visual system, it contains a part of those ideas which have become the commonly accepted basis of current research. Although some of these principles already had a history in 1970, Marr clearly deserves the credit for their sharp formulation and for a series of attempts leading to a formalization of the problems. His way of dividing the approach into the levels of computational theory, of the algorithm and of the implementation clarified the problems. His creed that human visual processing is modular, and that different types of information, which are encoded in the image can be decoded independently by modules, has been ge…

How to engineer biologically inspired cognitive architectures

2013

Biologically inspired cognitive architectures are complex systems where different modules of cognition interact in order to reach the global goals of the system in a changing environment. Engineering and modeling this kind of systems is a hard task due to the lack of techniques for developing and implementing features like learning, knowledge, experience, memory, adaptivity in an inter-modular fashion. We propose a new concept of intelligent agent as abstraction for developing biologically cognitive architectures. © 2013 Springer-Verlag.

Modelling swarm-intelligent systems for medical applications

2017

Modeling swarm intelligent systems has attracted attention of researchers over the last decade, as the attributes such as self-organization, self-regulation or collective behavior exhibited by the system entities while following a certain set of rules, can be implemented with the aim at investigating complexity of the problems that an individual would be unable to tackle in real world. In this keynote paper, meta-heuristics and paradigms of modeling swarm-intelligent systems will be discussed with respect to their application areas for medical purposes.

Construction and stability of a close-packed structure observed in thin colloidal crystals

2007

We have characterized a close-packed structure of confined charged colloidal spheres, which has been recently discovered. Using different microscopy experiments, the vertically arranged hexagonal planes of n - hcp perpendicular are found to continuously evolve from the horizontally oriented stacks of n hexagonal planes (nDelta) following the maximum packing criterion, but discontinuously transform to a stack of n+1 square planes [(n+1)[SHAPE OF A SQUARE]]. Large mechanically stable domains with threefold twin structures are regularly observed in the suspended state at packing fractions between 0.4 and 0.58.

Languages with mismatches

2007

AbstractIn this paper we study some combinatorial properties of a class of languages that represent sets of words occurring in a text S up to some errors. More precisely, we consider sets of words that occur in a text S with k mismatches in any window of size r. The study of this class of languages mainly focuses both on a parameter, called repetition index, and on the set of the minimal forbidden words of the language of factors of S with errors. The repetition index of a string S is defined as the smallest integer such that all strings of this length occur at most in a unique position of the text S up to errors. We prove that there is a strong relation between the repetition index of S an…

General Set-Up

2017

Nonlocal Quantum XOR Games for Large Number of Players

2010

Nonlocal games are used to display differences between classical and quantum world In this paper, we study nonlocal games with a large number of players We give simple methods for calculating the classical and the quantum values for symmetric XOR games with one-bit input per player, a subclass of nonlocal games We illustrate those methods on the example of the N-player game (due to Ardehali [Ard92]) that provides the maximum quantum-over-classical advantage.

Co-learnability and FIN-identifiability of enumerable classes of total recursive functions

1994

Co-learnability is an inference process where instead of producing the final result, the strategy produces all the natural numbers but one, and the omitted number is an encoding of the correct result. It has been proved in [1] that co-learnability of Goedel numbers is equivalent to EX-identifiability. We consider co-learnability of indices in recursively enumerable (r.e.) numberings. The power of co-learnability depends on the numberings used. Every r.e. class of total recursive functions is co-learnable in some r.e. numbering. FIN-identifiable classes are co-learnable in all r.e. numberings, and classes containing a function being accumulation point are not co-learnable in some r.e. number…

An algorithm to find all paths between two nodes in a graph

1990

Improved Constructions of Quantum Automata

2008

We present a simple construction of quantum automata which achieve an exponential advantage over classical finite automata. Our automata use $\frac{4}{\epsilon} \log 2p + O(1)$ states to recognize a language that requires p states classically. The construction is both substantially simpler and achieves a better constant in the front of logp than the previously known construction of [2]. Similarly to [2], our construction is by a probabilistic argument. We consider the possibility to derandomize it and present some preliminary results in this direction.