نتایج جستجو برای: redundancy degree

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

2004
Gregory S. Chirikjian Joel W. Burdick

“Hyper-redundant” robots have a very large or infinite degree of kinematic redundancy. This paper develops new methods for determining “optimal” hyper-redundant manipulator configurations based on a continuum formulation of kinematics. This formulation uses a backbone curve model to capture the robot’s essential macroscopic geometric features. The calculus of variations is used to develop diffe...

2002
Thierry Blu Herbert Bay Michael Unser

We show the feasibility and the potential of a new signal processing algorithm for the high-resolution deconvolution of OCT signals. Our technique relies on the description of the measures in a parametric form, each set of four parameters describing the optical characteristics of a physical interface (e.g., complex refractive index, depth). Under the hypothesis of a Gaussian source light, we sh...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه شیراز - دانشکده آموزشهای الکترونیکی 1391

بطور معمول، یک شبکه حسگر بیسیم برای مانیتورینگ خط لوله آب، نفت، و گاز بکار می رود. هنگامی که یک گره حسگر شرایطی مانند فشار، دما، و نشتی در نقطه ای از خطوط لوله را اندازه گیری کند، باید این داده را به صورت تعدادی بسته به ایستگاه مرکزی بفرستد. بسته هایی که از گره ها به یک ایستگاه فرستاده می شوند، می توانند در بین راه درنتیجه خرابی های خط لوله و یا رخدادهای طبیعی از بین بروند. رساندن درست این بسته...

Journal: :JORS 2015
Jorge Miguel Peralta Siopa José Eugénio Semedo Garção Júlio Montalvão e Silva

This work presents a methodology to assess maintenance teams in the determination of the degree of redundancy that an active component must have in order to minimize its system life-cycle cost and in the definition of the corresponding maintenance plan schedule. The minimal required data are three average costs and one reliability function. It is useful in a system’s design phase, since in this...

2002
Yuanying Mo Tok Wang Ling

We propose to use object-relational database management systems to store and manage semi-structured data. ORA-SS (Object-Relationship-Attribute model for Semi-Structured data) [9] is used as the data model. It not only reflects the nested structure of semi-structured data, but also distinguishes between object classes and relationship types, and between attributes of object classes and attribut...

Journal: :EURASIP J. Emb. Sys. 2016
Yong Jin Huan Dai Canghai Sui Anqi Liu Ping Xu

The opportunistic cooperative platform and adaptive cooperative control scheme were proposed based on the redundancy degree and priority of cooperative data packet, as well as selective characteristics of time domain and frequency domain. First, opportunistic cooperative platform was defined according to the cooperative data stream scale, mapping algorithm, and priority and redundancy of cooper...

2008
Viswanathan Subramanian Naga D. Avirneni Arun K. Somani

Reliability has become a serious concern as systems embrace nanometer technologies. Current reliability enhancement techniques cause slowdown in processor operation. In this work, we propose a novel approach that organizes redundancy in a special way to provide high degree of fault tolerance. Our approach improves performance by reliably adapting the system clock frequency during run time, base...

Journal: :CoRR 2012
Ricky J. Sethi Lorenzo A. Rossi Yolanda Gil

In this paper, we present a set of measures to quantify certain properties of threaded discussions, which are ubiquitous in online learning platforms. In particular, we address how to measure the redundancy of posts, the compactness of topics, and the degree of hierarchy in sub-threads. This preliminary work would very much benefit from discussion and serves as a starting point for ultimately c...

2006
Alexander Koller Stefan Thater

We present an efficient algorithm for the redundancy elimination problem: Given an underspecified semantic representation (USR) of a scope ambiguity, compute an USR with fewer mutually equivalent readings. The algorithm operates on underspecified chart representations which are derived from dominance graphs; it can be applied to the USRs computed by largescale grammars. We evaluate the algorith...

2007
B. K. Sawhill

Randomly connected networks of Boolean logic functions of fixed in-degree (" Kauffman Nets ") are analyzed using an annealed approximation. While these nets originated as models of genetic regulatory networks, the conclusions and observations obtained by treating them as a complex type of spin system are relevant beyond the purview of genetics and have applications in the construction and contr...

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

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