We consider fully-online construction of indexing data structures for multiple texts. Let T = {T1, . . . , TK} be a collection of texts. By fully-online, we mean that a new character can be appended to any text in T at any time. This is a natural generalization of semi-online construction of indexing data structures for multiple texts in which, after a new character is appended to the kth text ...

Nowadays, bulk of the designers prefer to outsource some parts of their design and fabrication process to the third-part companies due to the reliability problems, manufacturing cost and time-to-market limitations. In this situation, there are a lot of opportunities for malicious alterations by the off-shore companies. In this paper, we proposed a new placement algorithm that hinders the hardwa...

This paper presents an e cient algorithm for bu ered Steiner tree construction with wire sizing. Given a source and n sinks of a signal net, with given positions and a required arrival time associated with each sink, the algorithm nds a Steiner tree with bu er insertion and wire sizing so that the required arrival time (or timing slack) at the source is maximized. The unique contribution of our...

A Steiner quadruple system S(v, 4, 3) of order v is a 3-design T (v, 4, 3, λ) with λ = 1. In the previous paper [1] we classified all such Steiner systems S(16, 4, 3) of order 16 with rank 13 or less over F 2. In particular, we have proved that there is can be obtained by the generalized doubling construction, which we give here. Our main result is that there are exactly 684764 non-isomorphic S...

It has remained an open question whether the twins property for weighted tree automata is decidable. This property is crucial for determinizing such an automaton, and it has been argued that determinization improves the output of parsers and translation systems. We show that the twins property for weighted tree automata over extremal semifields is decidable.

Bayesian networks have gained popularity as a probabilistic tool for reasoning with legal evidence. However, two common difficulties are (1) the construction and (2) the understanding of a network. In previous work, we proposed to use narrative tools and in particular scenario schemes to assist the construction and the understanding of Bayesian networks for legal cases. We proposed a constructi...

this paper presents a prediction model based on a new neuro-fuzzy algorithm for estimating time in construction projects. the output of the proposed prediction model, which is employed based on a locally linear neuro-fuzzy (llnf) model, is useful for assessing a project status at different time horizons. being trained by a locally linear model tree (lolimot) learning algorithm, the model is int...