نتایج جستجو برای: related disa bility

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

1999
Ron M Roth Paul H Siegel Jack K Wolf

The hard square model consists of all binary arrays in which the s are isolated both hor izontally and vertically Based on a certain proba bility measure de ned on those arrays an e cient variable to xed rate encoder scheme is obtained that maps unconstrained binary words into arrays that sat isfy the hard square model For su ciently large ar rays the average rate of the encoder approaches a va...

Journal: :Cancer research 1956
P ERMALA L R HOLSTI

Experimental studies in which tobacco tar has produced malignant tumors on the skin of the mouse seem to imply that a chemical carcinogen is formed by the combustion of tobacco leaf. Among the most important factors affecting the chemical structure of the smoke is the burning temperature. Not only does knowledge of this factor become essential for a study of the possi bility that carcinogenic a...

1999
Chandana Gamage Jussipekka Leiwo Yuliang Zheng

The design rationale for many key distribution schemes for multicast networks are based on heuristic arguments on e ciency exi bility and scalability In most instances the choice of key server placement in a multicast network architecture is based on intuitive cryptographic considerations We use an analytical model of multicast group formation and network growth to look at the selection of a ke...

2013
Norihiko Terahara Kenjiro Toki Toshio Honda

Cinerarin, the anthocyanin isolated from the blue flowers of garden cineraria, S. cruentus by Yoshitama et al. [1, 2], was identified as dicaffeylated delphinidin 3,7,3'-triglucoside on the basis of the chemical evidences and its extraordinary sta­ bility in a neutral aqueous solution was also point­ ed out. Goto et al. [3] established its complete structure as malonyltricaffeyl delphinidin-tet...

1993
Simon Parsons Ebrahim H. Mamdani

In this paper some initial work towards a new approach to qualitative reasoning under un­ certainty is presented. This method is not only applicable to qualitative probabilistic reasoning, as is the case with other methods, but also allows the qualitative propagation within networks of values based upon possi­ bility theory and Dempster-Shafer evidence theory. The method is applied to two simpl...

2001
M Rio N Pezzi

In recent years the eld of Active or Programmable net works has received much attention from the networking community The goal is to achieve exible programma bility in routers and switches This will be particularly useful in the context of di erentiated services where di erent functionalities may or may not be present This document describes a novel active router archi tecture that provides pol...

2007
Robert B. Gorbet

This paper presents a novel method to compensate the eeects of exi-bility in belt-driven drive trains. Such drives are found in robot manipulators, for example, where drive exibility is undesirable. Unfortunately, the eeects of exibility can be diicult to compensate using the primary actuator, due to bandwidth limitations. By introducing a second actuator, which applies a force to the belt at a...

1991
José E. Cano Serafín Moral Juan F. Verdegay-López

In this paper, we consider several types of in­ formation and methods of combination asso­ ciated with incomplete probabilistic systems. \Ve discriminate between 'a priori' and evi­ dential information. The former one is a de­ scription of the whole population, the latest is a restriction based on observations for a particular case. Then, we proposse different combination methods for each one o...

1995
A Schramm

Parallel computers with distributed memory are gaining popularity on account of their optimal scala-bility. However, their eecient use requires a locality-preserving mapping of the application's underlying logical graph structure onto the physical topology of the target platform. There are several possible ways to achieve this. PROMOTER is a parallel programming model which attempts this by mak...

1996
Jonathan M. Nash Peter M. Dew John R. Davy Martin E. Dyer

Modern parallel processing machines are becoming more scalable through advances in network technology. It is now important to have a scalable computational model to support the design and analysis of algorithms. This paper describes a practical implementation of the WPRAM model, which has been used at Leeds for a number of years. The distinctive features of the WPRAM are the use of a weakly coh...

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

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