In this paper we consider k-meet-semidistributive lattices and we are interested in the computation of the set-colored poset associated to an implicational base. The parameter k is of interest since for any nite lattice L there exists an integer k for which L is k-meetsemidistributive. When k = 1 they are known as meet-semidistributive lattices. We rst give a polynomial time algorithm to comput...

In recent years, inventory management is continuous challenge for all organizations not only due to heavy cost associated with inventory holding, but also it has a great deal to do with the organizations production process. Cement industry is a growing sector of Pakistan's economy which is now facing problems in capacity utilization of their plants. This study attempts to identify the key strat...

In a recent quality assurance project we learned that nearly half of the handovers we examined were characterized as unsatisfactory by our residents, who provided examples in which their anxiety had been piqued and patient care had been affected. These reports substantiated a growing body of literature on the relationship between the quality of handover and the quality of patient care, so we so...

Footnote 4 in the paper presents an equation that indicates that a simple proportional updating rule corresponds to an exponential filtering scheme. In this first section, we present the derivation of this equation. This result is not new: it is widely known in the statistics literature, but is reproduced here for convenience. The proportional update rule asserts that a prototype previously loc...

In this paper, we present a fast algorithm for constructing a concept (Galois) lattice of a binary relation, including computing all concepts and their lattice order. We also present two efficient variants of the algorithm, one for computing all concepts only, and one for constructing a frequent closed itemset lattice. The running time of our algorithms depends on the lattice structure and is f...

With the advance in both hardware and software technologies, automated data generation and storage has become faster than ever. Such data is referred to as data streams. Streaming data is ubiquitous today and it is often a challenging task to store, analyze and visualize such rapid large volumes of data. Most conventional data mining techniques have to be adapted to run in a streaming environme...

Community-based mass prophylaxis is a core public health operational competency, but staffing needs may overwhelm the local trained health workforce. Just-in-time (JIT) training of emergency staff and computer modeling of workforce requirements represent two complementary approaches to address this logistical problem. Multnomah County, Oregon, conducted a high-throughput point of dispensing (PO...

Among the suite of commonly used backbone experiments, HNCACO presents an unresolved sensitivity limitation due to fast 13CO transverse relaxation and passive 13Calpha-13Cbeta coupling. Here, we present a high-sensitivity 'just-in-time' (JIT) HN(CA)CO pulse sequence that uniformly refocuses 13Calpha-13Cbeta coupling while collecting 13CO shifts in real time. Sensitivity comparisons of the 3-D J...

Linial et al. raised the question of how difficult the computation of the Vapnik-Červonenkis dimension of a concept class over a finite universe is. Papadimitriou and Yannakakis obtained a first answer using matrix representations of concept classes. However, this approach does not capture classes having exponential size, like monomials, which are encountered in learning theory. We choose a mor...

In the private matching problem, a client and a server each hold a set of n elements as their input. The client wants to privately compute the intersection of these two sets: the client learns the elements it has in common with server (and nothing more), while the server obtains no information at all. In certain applications it would be useful to have a private matching protocol that reports a ...