Data warehouses contain historic data providing information for analytical processing, decision making and data mining tools. However, several business intelligence applications nowadays require access to real-time data to make sound decisions. As a consequence, there is a great demand to incorporate new data from sources to the data warehouse as fast as possible. That motivates the constructio...

In this paper, the behavior of scalar multi-agent systems over networks subject to time-driven jumps. Assuming that all agents communicate through distinct communication digraphs at jump and flow times, asymptotic multi-consensus hybrid network is explicitly characterized. The shown be associated with a suitable partition almost equitable for both digraphs. doing so, no assumption on underlying...

We confirm the equitable ∆-coloring conjecture for interval graphs and establish the monotonicity of equitable colorability for them. We further obtain results on equitable colorability about square (or Cartesian) and cross (or direct) products of graphs.

A proper vertex coloring of a graph is equitable if the sizes of its color classes differ by at most one. In this paper, we prove that if G is a graph such that for each edge xy ∈ E(G), the sum d(x)+ d(y) of the degrees of its ends is at most 2r + 1, then G has an equitable coloring with r + 1 colors. This extends the Hajnal–Szemerédi Theorem on graphs with maximum degree r and a recent conject...

For several decades, context effects in picture naming and word reading have been extensively investigated. However, researchers have found no agreement on the explanation of the effects. Whereas it has long been assumed that several types of effect reflect competition in word selection (e.g., Levelt, Roelofs, & Meyer, 1999), recently it has been argued that these effects reflect the exclusion ...

In this paper, we explore a new problem of mining general temporal association rules in publication databases. In essence, a publication database is a set of transactions where each transaction T is a set of items of which each item contains an individual exhibition period. The current model of association rule mining is not able to handle the publication database due to the following fundament...

An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most one. The least positive integer k for which there exists an equitable coloring of a graph G with k colors is said to be the equitable chromatic number of G and is denoted by χ=(G). The least positive integer k such that for any k′ ≥ k there exists an equitable coloring of ...

This paper considers the problem of allocating kidneys to autonomous transplant candidates who may refuse a kidney in anticipation of a superior future kidney. Starting with the first-best case where candidates are non-autonomous, we represent the kidney allocation problem using a sequential stochastic assignment model. In this model, there are n transplant candidates to be allocated n kidneys ...