نتایج جستجو برای: transversal
تعداد نتایج: 12171 فیلتر نتایج به سال:
We use the Fredholm alternative to derive a Mel’nikov vector for perturbations of N-dimensional maps with homoclinic connections. If the unperturbed mapping is integrable, this vector assumes a simple form, which we use to determine conditions for transversal and tangential intersection between the invariant manifolds in a four-dimensional map of the McMillan type. We also discuss conditions fo...
OBJECTIVES To study maxillary arch width in adult patients with bilateral cleft lip and alveolus (BCLA) or with complete bilateral cleft lip and palate (BCLP), who have not had any surgery. SETTING AND SAMPLING POPULATION: Eighteen patients with BCLA, 13 patients with BCLP, and 24 controls from remote areas of Indonesia collected over 10 years. MATERIALS AND METHODS Dental casts were digitize...
A competence may be generically defined as the capacity of doing something and is more than just skills or knowledge. A transversal competence is one which can be re-used when shifting to another context. Our goal is to contribute to improve Computer Science 1 (CS1) course’s results by the systematic incorporation of activities based on transversal competencies. We designed a set of activities ...
The paper considers two decision problems on hypergraphs, hypergraph saturation and recognition of the transversal hypergraph, and discusses their significance for several search problems in applied computer science. Hypergraph saturation, i.e., given a hypergraph H, decide if every subset of vertices is contained in or contains some edge of H, is shown to be co-NP-complete. A certain subproble...
We perform a systematic study in the computational complexity of the connected variant of three related transversal problems: Vertex Cover, Feedback Vertex Set, and Odd Cycle Transversal. Just like their original counterparts, these variants are NP-complete for general graphs. A graph G is H-free for some graph H if G contains no induced subgraph isomorphic to H . It is known that Connected Ver...
Introduction: To evaluate adaptation to strength training in clinical diagnostics and follow-up of Achilles Tendinopathy repeated sonographic measurements of the tendon diameter are regularly performed [1]. However, limited data on validity criteria, especially intra-rater variability of anteroposterior (a.p.) diameter of the Achilles tendon (AT) are available. It is unclear whether longitudina...
Generating minimal transversals of a hypergraph is an important problem which has many applications in Computer Science. In the present paper, we address this problem and its decisional variant, i.e., the recognition of the transversal hypergraph for another hypergraph. We survey some results on problems which are known to be related to computing the transversal hypergraph, where we focus on pr...
A clique-transversal set in a graph is a subset of the vertices that meets all maximal complete subgraphs on at least two vertices. We prove that every connected graph of order n and maximum degree three has a clique-transversal set of size b19n/30 + 2/15c. This bound is tight, since 19n/30− 1/15 is a lower bound for infinitely many values of n. We also prove that the vertex set of any connecte...
The nonlinear coupling of MHD waves in a cold (β = 0) compressible plasma with a smoothly inhomogeneous low-speed steady flow directed along the magnetic field is considered. The effect is similar to Alfvèn wave phase mixing in a static, inhomogeneous medium and leads to the production of steep transversal gradients in the plasma parameters, which increases dissipation. Transversal gradients in...
The topology of generic Hamiltonian dynamical systems given by the real parts of generic holomorphic 1-forms on Riemann surfaces is studied. Our approach is based on the notion of transversal canonical basis of cycles. This approach allows us to present a convenient combinatorial model of the whole topology of the flow, especially effective for g = 2. A maximal abelian covering over the Riemann...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید