Given a family of graphs F , a graph G is F-saturated if no element of F is a subgraph of G, but for any edge e in G, some element of F is a subgraph of G + e. Let sat(n,F) denote the minimum number of edges in an F-saturated graph of order n, which we refer to as the saturation number or saturation function of F . If F = {F}, then we instead say that G is F -saturated and write sat(n, F ). For...

Finding strongly connected components (SCCs) in the state-space of discrete-state models is a critical task in formal verification of LTL and fair CTL properties, but the potentially huge number of reachable states and SCCs constitutes a formidable challenge. This paper is concerned with computing the sets of states in SCCs or terminal SCCs of asynchronous systems. Because of its advantages in ...

We focus on performance analysis of IEEE 802.11e EDCA in non-saturation condition. There have not been many analytic works in non-saturation condition due to mainly analytic complexity of models. However, non-saturation is valid in most real WLAN network. In this paper, we deal with the non-saturation case that the flow is not generated during which the previous flow is in service and flow size...

PURPOSE The aim of this work is to evaluate results of prostate transperineal saturation biopsy as a guide for focal high-dose-rate brachytherapy in patients with prostate cancer (PCa). MATERIAL AND METHODS Template guided saturation biopsy was performed in 67 primary patients with suspicion for prostate cancer. Biopsy was performed under ultrasonography (US) control with the help of brachyth...

A theoretically derived antenna saturation point is shown to exist for MIMO systems, at which the system suffers a capacity growth decrease from linear to logarithmic with increasing antenna numbers. We show this saturation point increases linearly with the radius of the region containing the receiver antennas and is independent of the number of antennas. Using an alternative formulation of cap...

An atomless probability space (Ω,A, P ) is said to have the saturation property for a probability measure μ on a product of Polish spaces X×Y if for every random element f of X whose law is margX(μ), there is a random element g of Y such that the law of (f, g) is μ. (Ω,A, P ) is said to be saturated if it has the saturation property for every such μ. We show each of a number of desirable proper...

An integer feasibility problem is a fundamental problem in many areas, such as operations research, number theory, and statistics. To study a family of systems with no nonnegative integer solution, we focus on a commutative semigroup generated by a finite set of vectors in Z and its saturation. In this paper we present an algorithm to compute an explicit description for the set of holes which i...

Most results in multifractal analysis are obtained using either a thermodynamic approach based on existence and uniqueness of equilibrium states or a saturation approach based on some version of the specification property. A general framework incorporating the most important multifractal spectra was introduced by Barreira and Saussol, who used the thermodynamic approach to establish the multifr...

IEEE 802.11 standards support multiple data transmission rates with dynamic rate switching capability to improve the performance. With multirate enhancement, data transmission from wireless LAN (WLAN) stations can take place at various rates according to channel conditions. This paper investigates the problem of optimizing aggregate saturation throughput of a multirate WLAN. Analytical expressi...

UNLABELLED Many central glutamatergic synapses contain a single presynaptic active zone and a single postsynaptic density. However, the basic functional properties of such "simple synapses" remain unclear. One important step toward understanding simple synapse function is to analyze the number of synaptic vesicles released in such structures per action potential, but this goal has remained elus...