Search results for "Abstract data type"

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

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

1990

A Loopless Generation of Bitstrings without p Consecutive Ones

2001

Let F n (p) be the set of all n-length bitstrings such that there are no p consecutive ls. F n (p) is counted with the pth order Fibonacci numbers and it may be regarded as the subsets of {1, 2,…, n} without p consecutive elements and bitstrings in F n (p) code a particular class of trees or compositions of an integer. In this paper we give a Gray code for F n (p) which can be implemented in a recursive generating algorithm, and finally in a loopless generating algorithm.

Orientation matters

2008

The optimal communication spanning tree (OCST) problem is a well known $\mathcal{NP}$-hard combinatorial optimization problem which seeks a spanning tree that satisfies all given communication requirements for minimal total costs. It has been shown that optimal solutions of OCST problems are biased towards the much simpler minimum spanning tree (MST) problem. Therefore, problem-specific representations for EAs like heuristic variants of edge-sets that are biased towards MSTs show high performance.In this paper, additional properties of optimal solutions for Euclidean variants of OCST problems are studied. Experimental results show that not only edges in optimal trees are biased towards low-…

Quantum Query Complexity for Some Graph Problems

2004

The paper [4] by H. Buhrman and R. de Wolf contains an impressive survey of solved and open problems in quantum query complexity, including many graph problems. We use recent results by A.Ambainis [1] to prove higher lower bounds for some of these problems. Some of our new lower bounds do not close the gap between the best upper and lower bounds. We prove in these cases that it is impossible to provide a better application of Ambainis’ technique for these problems.

Structured Frequency Algorithms

2015

B.A. Trakhtenbrot proved that in frequency computability (introduced by G. Rose) it is crucially important whether the frequency exceeds \(\frac{1}{2}\). If it does then only recursive sets are frequency-computable. If the frequency does not exceed \(\frac{1}{2}\) then a continuum of sets is frequency-computable. Similar results for finite automata were proved by E.B. Kinber and H. Austinat et al. We generalize the notion of frequency computability demanding a specific structure for the correct answers. We show that if this structure is described in terms of finite projective planes then even a frequency \(O(\frac{\sqrt{n}}{n})\) ensures recursivity of the computable set. We also show that …

CHARACTERS INDUCED FROM FULLY RAMIFIED SUBGROUPS

2001

Suppose that G is a finite π-separable group, let cf(G) be the space of complex class functions of G and let Irr(G) be the set of the irreducible complex characters of G. Let K be an arbitrary Hall...