background polycystic ovarian syndrome (pcos) is the most common hormonal disorder in reproductive-age women. this syndrome is associated with many complications, so treatment of the disorder is usually warranted. objectives to evaluate the effects of a combined low-dose oral contraceptive (ld) and vitex agnus on the improvement of clinical and paraclinical parameters of pcos. methods this trip...

For physicists and engineers involved in the design and analysis of beamlines (transfer lines or insertions) the lattice function matching problem is central and can be timeconsuming because it involves constrained nonlinear optimization. For such problems convergence can be difficult to obtain in general without expert human intervention. Over the years, powerful codes have been developed to a...

E-matching is the most commonly used technique to handle quantifiers in SMT solvers. It works by identifying characteristic subexpressions of quantified formulae, named triggers, which are matched during proof search on ground terms to discover relevant instantiations of the quantified formula. E-matching has proven to be an efficient and practical approach to handle quantifiers, in particular ...

We explore the regular-expression matching problem with respect to prefix-freeness of the pattern. We show that the prefix-free regular expression gives only linear number of matching substrings in the size of a given text. Based on this observation, we propose an efficient algorithm for the prefix-free regular-expression matching problem. Furthermore, we suggest an algorithm to determine wheth...

The dynamic instruction scheduling logic (the issue queue and the associated control logic) forms the core of an out-of-order microprocessor. Traditional scheduling mechanisms, based on tag broadcasts and associative tag matching logic within the issue queue are limited by high power consumption, large access delay and poor scalability. To address these inefficiencies, researchers have proposed...

It is proved that a bipartite 2-connected plane graph in which the common boundary of adjacent faces is a simple curve is 1-cycle resonant if and only if the outer face of G is alternating and each inner vertex has degree two. This extends a result from [X. Guo, F. Zhang, k-cycle resonant graphs, Discrete Math. 135 (1994) 113-120] that a hexagonal system is 1-cycle resonant if and only if it is...

An induced matching in a graph is a set of edges such that no two edges in the set are joined by any third edge of the graph. An induced matching is maximum (MIM) if the number of edges in it is the largest among all possible induced matchings. It is known that finding the size of a MIM in a graph is NP-hard even if the graph is bipartite. It is also known that the size of a MIM in a chordal gr...

Let G be a graph with a perfect matching M . In this paper, we prove two theorems to characterize the graph G in which there is no M -alternating path between two vertices x and y in G. c © 2003 Elsevier B.V. All rights reserved.

We consider multi-dimensional assignment problems in a probabilistic setting. Our main results are: (i) A new efficient algorithm for the 3-dimensional planar problem, based on enumerating and selecting from a set of “alternating-path trees”; (ii) A new efficient matching-based algorithm for the 3-dimensional axial problem.

In this paper, we show a necessary and sufficient condition which characterizes all factor critical graphs. Using this necessary and sufficient condition, we develop a linear time algorithm to determine whether a graph is factor critical if one of its maximum matchings is given. 1 Terminology and introduction All graphs considered in this paper are undirected, finite and simple. In general, we ...