title stringlengths 4 343 | abstract stringlengths 4 4.48k |
|---|---|
on-line viterbi algorithm and its relationship to random walks | in this paper, we introduce the on-line viterbi algorithm for decoding hidden markov models (hmms) in much smaller than linear space. our analysis on two-state hmms suggests that the expected maximum memory used to decode sequence of length $n$ with $m$-state hmm can be as low as $\theta(m\log n)$, without a significan... |
capacity of a multiple-antenna fading channel with a quantized precoding matrix | given a multiple-input multiple-output (mimo) channel, feedback from the receiver can be used to specify a transmit precoding matrix, which selectively activates the strongest channel modes. here we analyze the performance of random vector quantization (rvq), in which the precoding matrix is selected from a random code... |
refuting the pseudo attack on the reesse1+ cryptosystem | we illustrate through example 1 and 2 that the condition at theorem 1 in [8] dissatisfies necessity, and the converse proposition of fact 1.1 in [8] does not hold, namely the condition z/m - l/ak < 1/(2 ak^2) is not sufficient for f(i) + f(j) = f(k). illuminate through an analysis and ex.3 that there is a logic error d... |
optimal routing for decode-and-forward based cooperation in wireless networks | we investigate cooperative wireless relay networks in which the nodes can help each other in data transmission. we study different coding strategies in the single-source single-destination network with many relay nodes. given the myriad of ways in which nodes can cooperate, there is a natural routing problem, i.e., det... |
on the kolmogorov-chaitin complexity for short sequences | a drawback of kolmogorov-chaitin complexity (k) as a function from s to the shortest program producing s is its noncomputability which limits its range of applicability. moreover, when strings are short, the dependence of k on a particular universal turing machine u can be arbitrary. in practice one can approximate it ... |
optimal routing for the gaussian multiple-relay channel with decode-and-forward | in this paper, we study a routing problem on the gaussian multiple relay channel, in which nodes employ a decode-and-forward coding strategy. we are interested in routes for the information flow through the relays that achieve the highest df rate. we first construct an algorithm that provably finds optimal df routes. a... |
general-purpose computing on a semantic network substrate | this article presents a model of general-purpose computing on a semantic network substrate. the concepts presented are applicable to any semantic network representation. however, due to the standards and technological infrastructure devoted to the semantic web effort, this article is presented from this point of view. ... |
wdm and directed star arboricity | a digraph is $m$-labelled if every arc is labelled by an integer in $\{1, \dots,m\}$. motivated by wavelength assignment for multicasts in optical networks, we introduce and study $n$-fibre colourings of labelled digraphs. these are colourings of the arcs of $d$ such that at each vertex $v$, and for each colour $\alpha... |
soft constraint abstraction based on semiring homomorphism | the semiring-based constraint satisfaction problems (semiring csps), proposed by bistarelli, montanari and rossi \cite{bmr97}, is a very general framework of soft constraints. in this paper we propose an abstraction scheme for soft constraints that uses semiring homomorphism. to find optimal solutions of the concrete p... |
block locally optimal preconditioned eigenvalue xolvers (blopex) in hypre and petsc | we describe our software package block locally optimal preconditioned eigenvalue xolvers (blopex) publicly released recently. blopex is available as a stand-alone serial library, as an external package to petsc (``portable, extensible toolkit for scientific computation'', a general purpose suite of tools for the scalab... |
cryptanalysis of group-based key agreement protocols using subgroup distance functions | we introduce a new approach for cryptanalysis of key agreement protocols based on noncommutative groups. this approach uses functions that estimate the distance of a group element to a given subgroup. we test it against the shpilrain-ushakov protocol, which is based on thompson's group f. |
maximizing maximal angles for plane straight-line graphs | let $g=(s, e)$ be a plane straight-line graph on a finite point set $s\subset\r^2$ in general position. the incident angles of a vertex $p \in s$ of $g$ are the angles between any two edges of $g$ that appear consecutively in the circular order of the edges incident to $p$. a plane straight-line graph is called $\phi... |
mixed membership stochastic blockmodels | observations consisting of measurements on relationships for pairs of objects arise in many settings, such as protein interaction and gene regulatory networks, collections of author-recipient email, and social networks. analyzing such data with probabilisic models can be delicate because the simple exchangeability assu... |
sampling colourings of the triangular lattice | we show that the glauber dynamics on proper 9-colourings of the triangular lattice is rapidly mixing, which allows for efficient sampling. consequently, there is a fully polynomial randomised approximation scheme (fpras) for counting proper 9-colourings of the triangular lattice. proper colourings correspond to configu... |
tropical implicitization and mixed fiber polytopes | the software trim offers implementations of tropical implicitization and tropical elimination, as developed by tevelev and the authors. given a polynomial map with generic coefficients, trim computes the tropical variety of the image. when the image is a hypersurface, the output is the newton polytope of the defining p... |
getting started in probabilistic graphical models | probabilistic graphical models (pgms) have become a popular tool for computational analysis of biological data in a variety of domains. but, what exactly are they and how do they work? how can we use pgms to discover patterns that are biologically relevant? and to what extent can pgms help us formulate new hypotheses t... |
stability of boundary measures | we introduce the boundary measure at scale r of a compact subset of the n-dimensional euclidean space. we show how it can be computed for point clouds and suggest these measures can be used for feature detection. the main contribution of this work is the proof a quantitative stability theorem for boundary measures usin... |
interference and outage in clustered wireless ad hoc networks | in the analysis of large random wireless networks, the underlying node distribution is almost ubiquitously assumed to be the homogeneous poisson point process. in this paper, the node locations are assumed to form a poisson clustered process on the plane. we derive the distributional properties of the interference and ... |
approximations of lovasz extensions and their induced interaction index | the lovasz extension of a pseudo-boolean function $f : \{0,1\}^n \to r$ is defined on each simplex of the standard triangulation of $[0,1]^n$ as the unique affine function $\hat f : [0,1]^n \to r$ that interpolates $f$ at the $n+1$ vertices of the simplex. its degree is that of the unique multilinear polynomial that ex... |
determinacy in a synchronous pi-calculus | the s-pi-calculus is a synchronous pi-calculus which is based on the sl model. the latter is a relaxation of the esterel model where the reaction to the absence of a signal within an instant can only happen at the next instant. in the present work, we present and characterise a compositional semantics of the s-pi-calcu... |
the cyborg astrobiologist: porting from a wearable computer to the astrobiology phone-cam | we have used a simple camera phone to significantly improve an `exploration system' for astrobiology and geology. this camera phone will make it much easier to develop and test computer-vision algorithms for future planetary exploration. we envision that the `astrobiology phone-cam' exploration system can be fruitfully... |
p-adic modelling of the genome and the genetic code | the present paper is devoted to foundations of p-adic modelling in genomics. considering nucleotides, codons, dna and rna sequences, amino acids, and proteins as information systems, we have formulated the corresponding p-adic formalisms for their investigations. each of these systems has its characteristic prime numbe... |
separable and low-rank continuous games | in this paper, we study nonzero-sum separable games, which are continuous games whose payoffs take a sum-of-products form. included in this subclass are all finite games and polynomial games. we investigate the structure of equilibria in separable games. we show that these games admit finitely supported nash equilibria... |
mumford dendrograms | an effective $p$-adic encoding of dendrograms is presented through an explicit embedding into the bruhat-tits tree for a $p$-adic number field. this field depends on the number of children of a vertex and is a finite extension of the field of $p$-adic numbers. it is shown that fixing $p$-adic representatives of the res... |
complexity of propositional proofs under a promise | we study -- within the framework of propositional proof complexity -- the problem of certifying unsatisfiability of cnf formulas under the promise that any satisfiable formula has many satisfying assignments, where ``many'' stands for an explicitly specified function $\lam$ in the number of variables $n$. to this end, ... |
efficient divide-and-conquer implementations of symmetric fsas | a deterministic finite-state automaton (fsa) is an abstract sequential machine that reads the symbols comprising an input word one at a time. an fsa is symmetric if its output is independent of the order in which the input symbols are read, i.e., if the output is invariant under permutations of the input. we show how t... |
on perfect, amicable, and sociable chains | let $x = (x_0,...,x_{n-1})$ be an n-chain, i.e., an n-tuple of non-negative integers $< n$. consider the operator $s: x \mapsto x' = (x'_0,...,x'_{n-1})$, where x'_j represents the number of $j$'s appearing among the components of x. an n-chain x is said to be perfect if $s(x) = x$. for example, (2,1,2,0,0) is a perfec... |
resolution over linear equations and multilinear proofs | we develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead of clauses. we demonstrate polynomial-size refutations for hard tautologies like the pigeonhole principle, tseitin graph tautologies and the... |
optimal causal inference: estimating stored information and approximating causal architecture | we introduce an approach to inferring the causal architecture of stochastic dynamical systems that extends rate distortion theory to use causal shielding---a natural principle of learning. we study two distinct cases of causal inference: optimal causal filtering and optimal causal estimation. filtering corresponds to... |
obstructions to genericity in study of parametric problems in control theory | we investigate systems of equations, involving parameters from the point of view of both control theory and computer algebra. the equations might involve linear operators such as partial (q-)differentiation, (q-)shift, (q-)difference as well as more complicated ones, which act trivially on the parameters. such a system... |
a dichotomy theorem for general minimum cost homomorphism problem | in the constraint satisfaction problem ($csp$), the aim is to find an assignment of values to a set of variables subject to specified constraints. in the minimum cost homomorphism problem ($minhom$), one is additionally given weights $c_{va}$ for every variable $v$ and value $a$, and the aim is to find an assignment $f... |
bounding the betti numbers and computing the euler-poincar\'e characteristic of semi-algebraic sets defined by partly quadratic systems of polynomials | let $\r$ be a real closed field, $ {\mathcal q} \subset \r[y_1,...,y_\ell,x_1,...,x_k], $ with $ \deg_{y}(q) \leq 2, \deg_{x}(q) \leq d, q \in {\mathcal q}, #({\mathcal q})=m,$ and $ {\mathcal p} \subset \r[x_1,...,x_k] $ with $\deg_{x}(p) \leq d, p \in {\mathcal p}, #({\mathcal p})=s$, and $s \subset \r^{\ell+k}$ a se... |
convolutional entanglement distillation | we develop a theory of entanglement distillation that exploits a convolutional coding structure. we provide a method for converting an arbitrary classical binary or quaternary convolutional code into a convolutional entanglement distillation protocol. the imported classical convolutional code does not have to be dual-c... |
conjugates of characteristic sturmian words generated by morphisms | this article is concerned with characteristic sturmian words of slope $\alpha$ and $1-\alpha$ (denoted by $c_\alpha$ and $c_{1-\alpha}$ respectively), where $\alpha \in (0,1)$ is an irrational number such that $\alpha = [0;1+d_1,\bar{d_2,...,d_n}]$ with $d_n \geq d_1 \geq 1$. it is known that both $c_\alpha$ and $c_{1-... |
occurrences of palindromes in characteristic sturmian words | this paper is concerned with palindromes occurring in characteristic sturmian words $c_\alpha$ of slope $\alpha$, where $\alpha \in (0,1)$ is an irrational. as $c_\alpha$ is a uniformly recurrent infinite word, any (palindromic) factor of $c_\alpha$ occurs infinitely many times in $c_\alpha$ with bounded gaps. our aim ... |
powers in a class of a-strict standard episturmian words | this paper concerns a specific class of strict standard episturmian words whose directive words resemble those of characteristic sturmian words. in particular, we explicitly determine all integer powers occurring in such infinite words, extending recent results of damanik and lenz (2003), who studied powers in sturmian... |
a characterization of fine words over a finite alphabet | to any infinite word w over a finite alphabet a we can associate two infinite words min(w) and max(w) such that any prefix of min(w) (resp. max(w)) is the lexicographically smallest (resp. greatest) amongst the factors of w of the same length. we say that an infinite word w over a is "fine" if there exists an infinite ... |
characterizations of finite and infinite episturmian words via lexicographic orderings | in this paper, we characterize by lexicographic order all finite sturmian and episturmian words, i.e., all (finite) factors of such infinite words. consequently, we obtain a characterization of infinite episturmian words in a "wide sense" (episturmian and episkew infinite words). that is, we characterize the set of all... |
a new distributed topology control algorithm for wireless environments with non-uniform path loss and multipath propagation | each node in a wireless multi-hop network can adjust the power level at which it transmits and thus change the topology of the network to save energy by choosing the neighbors with which it directly communicates. many previous algorithms for distributed topology control have assumed an ability at each node to deduce so... |
the graver complexity of integer programming | in this article we establish an exponential lower bound on the graver complexity of integer programs. this provides new type of evidence supporting the presumable intractability of integer programming. specifically, we show that the graver complexity of the incidence matrix of the complete bipartite graph $k_{3,m}$ sat... |
toward psycho-robots | we try to perform geometrization of psychology by representing mental states, <<ideas>>, by points of a metric space, <<mental space>>. evolution of ideas is described by dynamical systems in metric mental space. we apply the mental space approach for modeling of flows of unconscious and conscious information in the hu... |
a complete proof of the graceful tree conjecture using the concept of edge degree | we show the graceful tree conjecture holds. |
h-decompositions | we show that for all graphs h of size n, the complete graph $k_{2n+1}$ has an $h$-decomposition. |
algebraic characterization of logically defined tree languages | we give an algebraic characterization of the tree languages that are defined by logical formulas using certain lindstr\"om quantifiers. an important instance of our result concerns first-order definable tree languages. our characterization relies on the usage of preclones, an algebraic structure introduced by the autho... |
an extension of a result concerning convex geometric graphs | we show a general result known as the erdos_sos conjecture: if $e(g)>{1/2}(k-1)n$ where $g$ has order $n$ then $g$ contains every tree of order $k+1$ as a subgraph. |
the extended edit distance metric | similarity search is an important problem in information retrieval. this similarity is based on a distance. symbolic representation of time series has attracted many researchers recently, since it reduces the dimensionality of these high dimensional data objects. we propose a new distance metric that is applied to symb... |
faster least squares approximation | least squares approximation is a technique to find an approximate solution to a system of linear equations that has no exact solution. in a typical setting, one lets $n$ be the number of constraints and $d$ be the number of variables, with $n \gg d$. then, existing exact methods find a solution vector in $o(nd^2)$ time... |
a polynomial bound for untangling geometric planar graphs | to untangle a geometric graph means to move some of the vertices so that the resulting geometric graph has no crossings. pach and tardos [discrete comput. geom., 2002] asked if every n-vertex geometric planar graph can be untangled while keeping at least n^\epsilon vertices fixed. we answer this question in the affirma... |
on the critical exponent of generalized thue-morse words | for certain generalized thue-morse words t, we compute the "critical exponent", i.e., the supremum of the set of rational numbers that are exponents of powers in t, and determine exactly the occurrences of powers realizing it. |
analyzing covert social network foundation behind terrorism disaster | this paper addresses a method to analyze the covert social network foundation hidden behind the terrorism disaster. it is to solve a node discovery problem, which means to discover a node, which functions relevantly in a social network, but escaped from monitoring on the presence and mutual relationship of nodes. the m... |
a multi-level blocking distinct degree factorization algorithm | we give a new algorithm for performing the distinct-degree factorization of a polynomial p(x) over gf(2), using a multi-level blocking strategy. the coarsest level of blocking replaces gcd computations by multiplications, as suggested by pollard (1975), von zur gathen and shoup (1992), and others. the novelty of our ap... |
a numerical algorithm for zero counting. i: complexity and accuracy | we describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. the algorithm performs o(n d kappa(f)) iterations where n is the number of polynomials (as well as the dimension of the ambient space), d is a bound on the polynomials' degree, and kappa(f) is a condition number for t... |
on compositions of numbers and graphs | the main purpose of this note is to pose a couple of problems which are easily formulated thought some seem to be not yet solved. these problems are of general interest for discrete mathematics including a new twig of a bough of theory of graphs i.e. a given graph compositions. the problems result from and are served i... |
node discovery problem for a social network | methods to solve a node discovery problem for a social network are presented. covert nodes refer to the nodes which are not observable directly. they transmit the influence and affect the resulting collaborative activities among the persons in a social network, but do not appear in the surveillance logs which record th... |
analog chaos-based secure communications and cryptanalysis: a brief survey | a large number of analog chaos-based secure communication systems have been proposed since the early 1990s exploiting the technique of chaos synchronization. a brief survey of these chaos-based cryptosystems and of related cryptanalytic results is given. some recently proposed countermeasures against known attacks are ... |
cryptanalysis of an image encryption scheme based on a new total shuffling algorithm | chaotic systems have been broadly exploited through the last two decades to build encryption methods. recently, two new image encryption schemes have been proposed, where the encryption process involves a permutation operation and an xor-like transformation of the shuffled pixels, which are controlled by three chaotic ... |
cryptanalysis of a computer cryptography scheme based on a filter bank | this paper analyzes the security of a recently-proposed signal encryption scheme based on a filter bank. a very critical weakness of this new signal encryption procedure is exploited in order to successfully recover the associated secret key. |
an interface group for process components | we take a process component as a pair of an interface and a behaviour. we study the composition of interacting process components in the setting of process algebra. we formalize the interfaces of interacting process components by means of an interface group. an interesting feature of the interface group is that it allo... |
on the operating unit size of load/store architectures | we introduce a strict version of the concept of a load/store instruction set architecture in the setting of maurer machines. we take the view that transformations on the states of a maurer machine are achieved by applying threads as considered in thread algebra to the maurer machine. we study how the transformations on... |
a thread calculus with molecular dynamics | we present a theory of threads, interleaving of threads, and interaction between threads and services with features of molecular dynamics, a model of computation that bears on computations in which dynamic data structures are involved. threads can interact with services of which the states consist of structured data ob... |
predicting relevant empty spots in social interaction | an empty spot refers to an empty hard-to-fill space which can be found in the records of the social interaction, and is the clue to the persons in the underlying social network who do not appear in the records. this contribution addresses a problem to predict relevant empty spots in social interaction. homogeneous and ... |
asymptotic capacity of wireless ad hoc networks with realistic links under a honey comb topology | we consider the effects of rayleigh fading and lognormal shadowing in the physical interference model for all the successful transmissions of traffic across the network. new bounds are derived for the capacity of a given random ad hoc wireless network that reflect packet drop or capture probability of the transmission ... |
algorithmic arithmetic fewnomial theory i: one variable | withdrawn by the authors due to an error in the proof of the finite field result (thm. 1.5): the random primes used in the proof need not avoid the exceptional primes from lemma 2.7, thus leaving thm. 1.5 unproved. |
natural realizations of sparsity matroids | a hypergraph g with n vertices and m hyperedges with d endpoints each is (k,l)-sparse if for all sub-hypergraphs g' on n' vertices and m' edges, m'\le kn'-l. for integers k and l satisfying 0\le l\le dk-1, this is known to be a linearly representable matroidal family. motivated by problems in rigidity theory, we give... |
an estimation of distribution algorithm with intelligent local search for rule-based nurse rostering | this paper proposes a new memetic evolutionary algorithm to achieve explicit learning in rule-based nurse rostering, which involves applying a set of heuristic rules for each nurse's assignment. the main framework of the algorithm is an estimation of distribution algorithm, in which an ant-miner methodology improves th... |
instruction sequences with dynamically instantiated instructions | we study sequential programs that are instruction sequences with dynamically instantiated instructions. we define the meaning of such programs in two different ways. in either case, we give a translation by which each program with dynamically instantiated instructions is turned into a program without them that exhibits... |
evolving localizations in reaction-diffusion cellular automata | we consider hexagonal cellular automata with immediate cell neighbourhood and three cell-states. every cell calculates its next state depending on the integral representation of states in its neighbourhood, i.e. how many neighbours are in each one state. we employ evolutionary algorithms to breed local transition funct... |
reconstruction of markov random fields from samples: some easy observations and algorithms | markov random fields are used to model high dimensional distributions in a number of applied areas. much recent interest has been devoted to the reconstruction of the dependency structure from independent samples from the markov random fields. we analyze a simple algorithm for reconstructing the underlying graph defini... |
two-connected graphs with prescribed three-connected components | we adapt the classical 3-decomposition of any 2-connected graph to the case of simple graphs (no loops or multiple edges). by analogy with the block-cutpoint tree of a connected graph, we deduce from this decomposition a bicolored tree tc(g) associated with any 2-connected graph g, whose white vertices are the 3-compon... |
entanglement-assisted quantum convolutional coding | we show how to protect a stream of quantum information from decoherence induced by a noisy quantum communication channel. we exploit preshared entanglement and a convolutional coding structure to develop a theory of entanglement-assisted quantum convolutional coding. our construction produces a calderbank-shor-steane (... |
distinguishing short quantum computations | distinguishing logarithmic depth quantum circuits on mixed states is shown to be complete for qip, the class of problems having quantum interactive proof systems. circuits in this model can represent arbitrary quantum processes, and thus this result has implications for the verification of implementations of quantum al... |
algorithmic permutation of part of the torah | a small part of the torah is arranged into a two dimensional array. the characters are then permuted using a simple recursive deterministic algorithm. the various permutations are then passed through three stochastic filters and one deterministic filter to identify the permutations which most closely approximate readab... |
on the monotonicity of the generalized marcum and nuttall q-functions | monotonicity criteria are established for the generalized marcum q-function, $\emph{q}_{m}$, the standard nuttall q-function, $\emph{q}_{m,n}$, and the normalized nuttall q-function, $\mathcal{q}_{m,n}$, with respect to their real order indices m,n. besides, closed-form expressions are derived for the computation of th... |
on the maximum span of fixed-angle chains | soss proved that it is np-hard to find the maximum 2d span of a fixed-angle polygonal chain: the largest distance achievable between the endpoints in a planar embedding. these fixed-angle chains can serve as models of protein backbones. the corresponding problem in 3d is open. we show that three special cases of partic... |
episturmian words: a survey | in this paper, we survey the rich theory of infinite episturmian words which generalize to any finite alphabet, in a rather resembling way, the well-known family of sturmian words on two letters. after recalling definitions and basic properties, we consider episturmian morphisms that allow for a deeper study of these w... |
palindromic richness | in this paper, we study combinatorial and structural properties of a new class of finite and infinite words that are 'rich' in palindromes in the utmost sense. a characteristic property of so-called "rich words" is that all complete returns to any palindromic factor are themselves palindromes. these words encompass the... |
computational approach to the emergence and evolution of language - evolutionary naming game model | computational modelling with multi-agent systems is becoming an important technique of studying language evolution. we present a brief introduction into this rapidly developing field, as well as our own contributions that include an analysis of the evolutionary naming-game model. in this model communicating agents, tha... |
an algorithm for road coloring | a coloring of edges of a finite directed graph turns the graph into finite-state automaton. the synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. a coloring of edges of a directed graph of uniform outdegree... |
a pyramidal evolutionary algorithm with different inter-agent partnering strategies for scheduling problems | this paper combines the idea of a hierarchical distributed genetic algorithm with different inter-agent partnering strategies. cascading clusters of sub-populations are built from bottom up, with higher-level sub-populations optimising larger parts of the problem. hence higher-level sub-populations search a larger sear... |
on the effects of idiotypic interactions for recommendation communities in artificial immune systems | it has previously been shown that a recommender based on immune system idiotypic principles can out perform one based on correlation alone. this paper reports the results of work in progress, where we undertake some investigations into the nature of this beneficial effect. the initial findings are that the immune syste... |
a recommender system based on the immune network | the immune system is a complex biological system with a highly distributed, adaptive and self-organising nature. this paper presents an artificial immune system (ais) that exploits some of these characteristics and is applied to the task of film recommendation by collaborative filtering (cf). natural evolution and in p... |
the danger theory and its application to artificial immune systems | over the last decade, a new idea challenging the classical self-non-self viewpoint has become popular amongst immunologists. it is called the danger theory. in this conceptual paper, we look at this theory from the perspective of artificial immune system practitioners. an overview of the danger theory is presented with... |
partnering strategies for fitness evaluation in a pyramidal evolutionary algorithm | this paper combines the idea of a hierarchical distributed genetic algorithm with different inter-agent partnering strategies. cascading clusters of sub-populations are built from bottom up, with higher-level sub-populations optimising larger parts of the problem. hence higher-level sub-populations search a larger sear... |
on minimality of convolutional ring encoders | convolutional codes are considered with code sequences modelled as semi-infinite laurent series. it is wellknown that a convolutional code c over a finite group g has a minimal trellis representation that can be derived from code sequences. it is also wellknown that, for the case that g is a finite field, any polynomia... |
a bayesian optimisation algorithm for the nurse scheduling problem | a bayesian optimization algorithm for the nurse scheduling problem is presented, which involves choosing a suitable scheduling rule from a set for each nurses assignment. unlike our previous work that used gas to implement implicit learning, the learning in the proposed algorithm is explicit, ie. eventually, we will be... |
strategic alert throttling for intrusion detection systems | network intrusion detection systems are themselves becoming targets of attackers. alert flood attacks may be used to conceal malicious activity by hiding it among a deluge of false alerts sent by the attacker. although these types of attacks are very hard to stop completely, our aim is to present techniques that improv... |
movie recommendation systems using an artificial immune system | we apply the artificial immune system (ais) technology to the collaborative filtering (cf) technology when we build the movie recommendation system. two different affinity measure algorithms of ais, kendall tau and weighted kappa, are used to calculate the correlation coefficients for this movie recommendation system. ... |
investigating artificial immune systems for job shop rescheduling in changing environments | artificial immune system can be used to generate schedules in changing environments and it has been proven to be more robust than schedules developed using a genetic algorithm. good schedules can be produced especially when the number of the antigens is increased. however, an increase in the range of the antigens had s... |
artificial immune systems (ais) - a new paradigm for heuristic decision making | over the last few years, more and more heuristic decision making techniques have been inspired by nature, e.g. evolutionary algorithms, ant colony optimisation and simulated annealing. more recently, a novel computational intelligence technique inspired by immunology has emerged, called artificial immune systems (ais).... |
on the complexity of finding gapped motifs | this paper has been withdrawn by the corresponding author because the newest version is now published in journal of discrete algorithms. |
mimo networks: the effects of interference | multiple-input/multiple-output (mimo) systems promise enormous capacity increase and are being considered as one of the key technologies for future wireless networks. however, the decrease in capacity due to the presence of interferers in mimo networks is not well understood. in this paper, we develop an analytical fra... |
doubly-generalized ldpc codes: stability bound over the bec | the iterative decoding threshold of low-density parity-check (ldpc) codes over the binary erasure channel (bec) fulfills an upper bound depending only on the variable and check nodes with minimum distance 2. this bound is a consequence of the stability condition, and is here referred to as stability bound. in this pape... |
a connection between palindromic and factor complexity using return words | in this paper we prove that for any infinite word w whose set of factors is closed under reversal, the following conditions are equivalent: (i) all complete returns to palindromes are palindromes; (ii) p(n) + p(n+1) = c(n+1) - c(n) + 2 for all n, where p (resp. c) denotes the palindromic complexity (resp. factor co... |
new type stirling like numbers - an email style letter | the notion of the fibonacci cobweb poset from [1] has been naturally extended to any admissible sequence $f$ in [2] where it was also recognized that the celebrated prefab notion of bender and goldman [3] - (see also [4,5]) - admits such an extension so as to encompass the new type combinatorial objects from [2] as lea... |
exploiting problem structure in a genetic algorithm approach to a nurse rostering problem | there is considerable interest in the use of genetic algorithms to solve problems arising in the areas of scheduling and timetabling. however, the classical genetic algorithm paradigm is not well equipped to handle the conflict between objectives and constraints that typically occurs in such problems. in order to overc... |
well-centered triangulation | meshes composed of well-centered simplices have nice orthogonal dual meshes (the dual voronoi diagram). this is useful for certain numerical algorithms that prefer such primal-dual mesh pairs. we prove that well-centered meshes also have optimality properties and relationships to delaunay and minmax angle triangulation... |
essential variables and positions in terms | the paper deals with $\sigma-$composition of terms, which allows us to extend the derivation rules in formal deduction of identities. the concept of essential variables and essential positions of terms with respect to a set of identities is a key step in the simplification of the process of formal deduction. $\sigma-... |
fixed point and aperiodic tilings | an aperiodic tile set was first constructed by r.berger while proving the undecidability of the domino problem. it turned out that aperiodic tile sets appear in many topics ranging from logic (the entscheidungsproblem) to physics (quasicrystals) we present a new construction of an aperiodic tile set that is based on kl... |
capacity of general discrete noiseless channels | this paper concerns the capacity of the discrete noiseless channel introduced by shannon. a sufficient condition is given for the capacity to be well-defined. for a general discrete noiseless channel allowing non-integer valued symbol weights, it is shown that the capacity--if well-defined--can be determined from the r... |
pure exploration for multi-armed bandit problems | we consider the framework of stochastic multi-armed bandit problems and study the possibilities and limitations of forecasters that perform an on-line exploration of the arms. these forecasters are assessed in terms of their simple regret, a regret notion that captures the fact that exploration is only constrained by t... |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 14