We design fast dynamic algorithms for proper vertex and edge colorings in a graph undergoing edge insertions and deletions. In the static setting, there are simple linear time algorithms for (∆ + 1)vertex coloring and (2∆ − 1)-edge coloring in a graph with maximum degree ∆. It is natural to ask if we can efficiently maintain such colorings in the dynamic setting as well. We get the following th...

In this paper we study the problem of incremental fault diagnosis and repair of mechatronic systems where the task is to choose actions such that the expected cost of repair is minimal. This is done by interleaving acting with the generation of partial conditional plans used to decide the next action. A diagnostic model based on Bayesian Networks is used to update the current belief state after...

A digital search tree (DST) is a fundamental data structure on words that finds various applications from the popular Lempel-Ziv’78 data compression scheme to distributed hash tables. The profile of a DST measures the number of nodes at the same distance from the root; it depends on the number of stored strings and the distance from the root. Most parameters of DST (e.g., depth, height, fillup)...

In this paper, we update the peak theory for estimation of primordial black hole (PBH) abundance, particularly by implementing critical behavior in PBH mass and employing averaged compaction function formation criterion to relax profile dependence. We apply our a specific non-Gaussian feature called exponential tail, which is characteristic ultra slow-roll models inflation. With type non-Gaussi...

We consider the problem of implementing a space-efficient dynamic trie, with an emphasis on good practical performance. For a trie with n nodes with an alphabet of size σ, the informationtheoretic lower bound is n logσ + O(n) bits. The Bonsai data structure is a compact trie proposed by Darragh et al. (Softw., Pract. Exper. 23(3), 1993, pp. 277–291). Its disadvantages include the user having to...

We introduce a model of preference diffusion in which agents in a social network update their preferences based on those of their influencers in the network, and we study the dynamics of this model. Preferences are modelled as ordinal rankings over a finite set of alternatives. At each time step, some of the agents update the relative ordering of two alternatives adjacent in their current ranki...

Consider the problem of maintaining a family F of dynamic sets subject to insertions, deletions, and set-intersection reporting queries: given S, S′ ∈ F , report every member of S ∩S′ in any order. We show that in the word RAM model, where w is the word size, given a cap d on the maximum size of any set, we can support set intersection queries in O( d w/ log2 w ) expected time, and updates in O...

6 Comparison 30 7 K-means 35 A Defaults File Format 40 B Using STEM for Standard Gene Ontology Enrichment Analysis 42 C Gene Annotation Sources 43 ii 1 Introduction Welcome to STEM! STEM is an acronym for the Short Time-series Expression Miner, a software program designed for clustering, comparing, and visualizing gene expression data from short time series microarray experiments (∼8 time point...