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

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

2008
John H. Smith

Motion tracking and object recognition often use cameras that are mounted in motion platforms like pan-tilt units, linear tables and even robots. Tracking can be automated by visually servoing the platform’s degrees-of-freedom (DOF) thus keeping the camera’s point-of-view directed at the target. Tracking quick moving targets often demands faster bandwidth platforms. However biology suggests a r...

2013
Carole L. Yue Elizabeth Ligon Bjork Robert A. Bjork

Previous research on the redundancy principle in multimedia learning has shown that although exact correspondence between on-screen text and narration generally impairs learning, brief labels within an animation can improve learning. To clarify and extend the theoretical and practical implications of these results, the authors of the present research examined the extent to which varying degrees...

2016
Guido M. Kuersteiner

This paper considers functional central limit theorems for stationary absolutely regular mixing processes. Bounds for the entropy with bracketing are derived using recent results in Nickl and Pötscher (2007). More specifically, their bracketing metric entropy bounds are extended to a norm defined in Doukhan, Massart and Rio (1995, henceforth DMR) that depends both on the marginal distribution o...

Journal: :IJITEE (International Journal of Information Technology and Electrical Engineering) 2019

Journal: :Chinese Journal of Mechanical Engineering 2022

Abstract The kinematic redundancy is considered as a way to improve the performance of parallel mechanism. In this paper, kinematics three degree-of-freedom mechanism with (3-DOF PM-KR) and influence redundant parts on PM-KR are analyzed. Firstly, model established. inverse solutions, Jacobian matrix, workspace solved. Secondly, Since there exists redundancy, possesses fault-tolerant performanc...

Journal: :Queueing Syst. 2016
Kristen Gardner Samuel Zbarsky Sherwin Doroudi Mor Harchol-Balter Esa Hyytiä Alan Scheller-Wolf

Recent computer systems research has proposed using redundant requests to reduce latency. The idea is to run a request on multiple servers and wait for the first completion (discarding all remaining copies of the request). However, there is no exact analysis of systems with redundancy. This paper presents the first exact analysis of systems with redundancy. We allow for any number of classes of...

2002
Jie Han Pieter Jonker

In order to make systems based on nanometerscale devices reliable, the design of fault-tolerant architectures will be necessary. This paper presents a novel fault-tolerant technique for future nanocomputers, NAND multiplexing. Initiated by von Neumann, the NAND multiplexing technique, based on a massive duplication of imperfect devices and randomized imperfect interconnect, had been studied wit...

Journal: :MONET 2005
Kui Wu Yong Gao Fulu Li Yang Xiao

Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain long network lifetime as well as sufficient sensing areas. To achieve this goal, a broadly-used method is to turn off redundant sensors. In this paper, the problem of estimating redundant sensing areas among neighbourin...

1997
Kihong Park

This paper presents an adaptive protocol for packet-level forward error-correction in dynamic networks. The objective is to facilitate besl-eITort real-time applications whose timing constraints rule out the usc of retransmission-based ARQ schemes. The degree of redundancy is adjusted as a function of network stale, decreasing when the network is well-behaved and increasing when it is nolo The ...

Journal: :J. Comput. Syst. Sci. 1981
Michael L. Fredman Dennis J. Volper

Let A(l),A(2),...,A(n) be an array which stores values in a commutative semi-group S. We are concerned with the design of data structures for representing the array A(i) which facilitate implementation of the range queries Retrieve(j, k) defined as follows. Retrieve(j, k) (l<j<k&n) Return i A(i). i=j An obvious data structure would be the array A(j) itself. This approach has the disadvantage th...

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

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