In this paper, k-blocking sets in PG(n, q), being of Rédei type, are investigated. A standard method to construct Rédei type k-blocking sets in PG(n, q) is to construct a cone having as base a Rédei type k′-blocking set in a subspace of PG(n, q). But also other Rédei type k-blocking sets in PG(n, q), which are not cones, exist. We give in this article a condition on the parameters of a Rédei ty...

This paper studies the application of the time segmentation parallel simulation approach to efficient simulation of simple manufacturing queueing systems, namely systems of queues in tandem with manufacturing blocking at each station. We discuss the difficulties in the way of applying the time segmentation method to this class of manufacturing systems and demonstrate that the time segmentation ...

In 1950, C. Jacobaeus of LM Ericsson established a method for computing internal blocking probabilities for a point-to-point selection within an interconnection network. Jacobaeus result showed that a three stage network would be "nearly" free of internal blocking if the number of matrices in the second stage was equal to the number of inlets of a first stage matrix plus the number of outlets o...

Five new mathematical triple fouling models were developed to explore the flux decline behavior during the microfiltration. The first model was developed by the assumption of the successive effects of standard mechanism, intermediate pore blockage and cake formation by using the standard blocking flux expression in the model calculations. The second and third models also obtained by the success...

Necessary and su cient conditions for hybrid automata to be non-blocking and deterministic (local existence and uniqueness of executions, respectively) are developed. The problem of global existence of executions is discussed in the context of Zeno hybrid automata, that is, hybrid automata that can exhibit in nitely many discrete transitions in nite time.

In cellular networks blocking occurs when a base station has no free channel to allocate to a mobile user One distinguishes between two kinds of blocking the rst is called new call blocking and refers to blocking of new calls the second is called hando blocking and refers to blocking of ongoing calls due to the mobility of the users In this paper we rst provide explicit analytic expressions for...

Data streams are modeled as infinite or finite sequences of data elements coming from an arbitrary but fixed universe. The universe can have various built-in functions and predicates. Stream queries are modeled as functions from streams to streams. Both timed and untimed settings are considered. Issues investigated include abstract definitions of computability of stream queries; the connection ...

This paper investigates the time-complexity of the non-blocking atomic commit (NBAC) problem in a synchronous distributed model where t out of n processes may fail by crashing. We exhibit for t ≥ 3 an inherent trade-off between the fast abort property of NBAC, i.e., aborting a transaction as soon as possible if some process votes “no,” and the fast commit property, i.e., committing a transactio...

This paper presents the experimental observation of the degradation in asymmetric sampled grating DFB lasers by the accelerated life tests. Two degradation phenomena related to the electrical characteristics of LDs are observed during the tests. The first degradation phenomenon by increasing the reverse current is considered as a formation of leakage current path enough to prevent lasing operat...