نتایج جستجو برای: Rigid

تعداد نتایج: 41768  

2009
Naoki Katoh Shin-ichi Tanigawa

A bar-slider framework is a bar-joint framework a part of whose joints are constrained by using line-sliders. Such joints are allowed to move only along the sliders. Streinu and Theran proposed a combinatorial characterization of the infinitesimal rigidity of generic bar-slider frameworks in two dimensional space. In this paper we propose a generalization of their result. In particular, we prov...

2005
BinYong Hsie ZhiBin Liang

This paper gives a method to construct rigid spaces, which is similar to the method used to construct toric schemes.

Journal: :Discrete Applied Mathematics 2013
Bill Jackson Tibor Jordán Csaba Király

Tensegrity frameworks are defined on a set of points in Rd and consist of bars, cables, and struts, which provide upper and/or lower bounds for the distance between their endpoints. The graph of the framework, in which edges are labeled as bars, cables, and struts, is called a tensegrity graph. It is said to be strongly rigid in Rd if every generic realization in Rd as a tensegrity framework is...

Journal: :Discrete & Computational Geometry 2011
Bill Jackson Peter Keevash

A direction-length framework is a pair (G, p), where G = (V ;D,L) is a ‘mixed’ graph whose edges are labeled as ‘direction’ or ‘length’ edges, and p is a map from V to R for some d. The label of an edge uv represents a direction or length constraint between p(u) and p(v). Let G be obtained from G by adding, for each length edge e of G, a direction edge with the same end vertices as e. We show t...

2016
P V

An ideal I on a cardinal κ is called rigid if all automorphisms of P (κ)/I are trivial. An ideal is called μ-minimal if whenever G ⊆ P (κ)/I is generic and X ∈ P (μ)V [G] \ V , it follows that V [X] = V [G]. We prove that the existence of a rigid saturated μ-minimal ideal on μ+, where μ is a regular cardinal, is consistent relative to the existence of large cardinals. The existence of such an i...

Journal: :Scanning 2002
D Karadaglić R Juskaitis T Wilson

We describe a simple modification to a rigid endoscope so as to provide both high-quality conventional and confocal images of reasonably accessible regions of the body. This versatile system uses a structured illumination approach together with a conventional incoherent illumination source. Images taken in fluorescence are presented using this combined conventional and confocal endoscope.

Journal: :Discrete Mathematics 2009
Jean-Marc Schlenker

Weakly convex polyhedra which are star-shaped with respect to one of their vertices are infinitesimally rigid. This is a partial answer to the question whether every decomposable weakly convex polyhedron is infinitesimally rigid. The proof uses a recent result of Izmestiev on the geometry of convex caps.

Journal: :journal of dentistry, tehran university of medical sciences 0
sara koosha assisstant professor, department of prosthodontics, islamic azad university of medical science, branch of dentistry, tehran, iran. fatemeh sadat mirhashemi

tooth/implant supported fixed prostheses may present biomechanical design problems, as the implant is rigidly anchored within the alveolus, whereas the tooth is attached by the periodontal ligament to the bone allowing movement. many clinicians prefer tooth/implant supported fixed prosthesis designs with rigid connectors. however, there are some doubts about the effect of attachment placement i...

2017
Vânia Maria Ponte Vidal Narciso Arruda Matheus Cruz Marco A. Casanova Valéria Magalhães Pequeno Ticianne Darin

This Demo presents a framework for the live synchronization of an RDF view defined on top of relational database. In the proposed framework, rules are responsible for computing and publishing the changeset required for the RDB-RDF view to stay synchronized with the relational database. The computed changesets are then used for the incremental maintenance of the RDB_RDF views as well as applicat...

2011
Vahid Jalali Mo Zhou Yuqing Wu

RDF has gained great interest in both academia and industry as an important language to describe graph data. Several approaches have been proposed for storing and querying RDF data efficiently; each works best under certain circumstances, e.g. certain types of data and/or queries. However, there was lack of a thorough understanding of exactly what these circumstances are, as different data-sets...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید