Let Sn and Bn denote the respective sets of ordinary and bigrassmannian (BG) permutations of order n, and let (Sn,≤) denote the Bruhat ordering permutation poset. We study the restricted poset (Bn,≤), first providing a simple criterion for comparability. This criterion is used to show that that the poset is connected, to enumerate the saturated chains between elements, and to enumerate the numb...

Cross-Language Information Retrieval (CLIR) and machine translation (MT) resources, such as dictionaries and parallel corpora, are scarce and hard to come by for special domains. Besides, these resources are just limited to a few languages, such as English, French, and Spanish and so on. So, obtaining comparable corpora automatically for such domains could be an answer to this problem effective...

LEVEL: INTERMEDIATE C hallenges and approaches in demonstrating comparability of a well-characterized biotechnology product after manufacturing changes can be as varied and complex as the products themselves. Participants at the January 2005 CMC Strategy Forum sought to discuss and agree on common implementation strategies for different manufacturing change scenarios. Development of flexible, c...

A set of vertices in a graph is c-colorable if the subgraph induced by the set has a proper c-coloring. In this paper, we study the problem of finding a step-by-step transformation (reconfiguration) between two c-colorable sets in the same graph. This problem generalizes the well-studied Independent Set Reconfiguration problem. As the first step toward a systematic understanding of the complexi...

Characterisations of interval graphs, comparability graphs, co-comparability graphs, permutation graphs, and split graphs in terms of linear orderings of the vertex set are presented. As an application, it is proved that interval graphs, cocomparability graphs, AT-free graphs, and split graphs have bandwidth bounded by their maximum degree.

In this study, the reliability of NDIR-based sensors was explored by evaluatingthe comparability between measurement systems in the near real-time analysis of CO₂. Forthis purpose, replicate analyses were performed using sensors of two different model types(H-550 and B-530, ELT Company, Korea). Three replicate data of each sensor typecollected continuously by side-by-side analysis in three seco...

BACKGROUND Presently, there is no consensus on how to define multimorbidity. In this paper we investigate the connection between prevalence estimates for two or more and three or more chronic conditions to improve comparability of multimorbidity studies with different cut-offs. METHODS In a systematic review of the literature published between January, 1990 and December, 2011, we found 52 sui...

Purpose To assess the comparability and repeatability of keratometric and astigmatism values measured by four techniques: Orbscan IIz® (Bausch and Lomb), Lenstar LS 900® (Haag-Streit), Cassini® (i-Optics), and Total Cassini (anterior + posterior surface), in healthy volunteers. Patients and methods Fifteen healthy volunteers (30 eyes) were assessed by the four techniques. In each eye, three c...

We give sufficient conditions for comparability of the fundamental solution of the Schrödinger equation ∂t = ∆ + V with the Gauss-Weierstrass kernel. We show that L integrability of V is not necessary for the comparability, which answers a question of V. Liskevich and Y. Semenov.

A graph is a P4-comparability graph if it admits an acyclic orientation of its edges which is transitive on every chordless path on four vertices. We give a characterization of P4-comparability graphs in terms of an auxiliary graph being bipartite. © 2006 Elsevier B.V. All rights reserved.