Balanced Environment
نویسندگان
چکیده
منابع مشابه
Balanced Virtual Humans Interacting with their Environment
1. Introduction The animation of human avatars seems very successful; the computer graphics industry shows outstanding results in films everyday, the game industry achieves exploits... Nevertheless, animating, controlling such manikins is very painful. It takes days to a specialist to build such animated sequences, it is not adaptive to any type of modifications. Our main purpose is the virtual...
متن کاملAssessing the Control Environment Using a Balanced Scorecard Approach
Section 404 of the Sarbanes-Oxley Act of 2002 (SOX) requires that companies subject to the Securities and Exchange Act of 1934 include in their annual reports a report of management on the company's internal control over fmancial reporting. This must contain management's assessment and a statement of the effectiveness of the controls. Almost no guidance, however, has been provided on how to eva...
متن کاملQuenched invariance principle for random walks in balanced random environment
We consider random walks in a balanced random environment in Z , d ≥ 2. We first prove an invariance principle (for d ≥ 2) and the transience of the random walks when d ≥ 3 (recurrence when d = 2) in an ergodic environment which is not uniformly elliptic but satisfies certain moment condition. Then, using percolation arguments, we show that under mere ellipticity, the above results hold for ran...
متن کاملRemarks on Distance-Balanced Graphs
Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. In this paper, we study the conditions under which some graph operations produce a distance-balanced graph.
متن کاملBalanced Cayley graphs and balanced planar graphs
A balanced graph is a bipartite graph with no induced circuit of length 2 (mod 4). These graphs arise in linear programming. We focus on graph-algebraic properties of balanced graphs to prove a complete classification of balanced Cayley graphs on abelian groups. Moreover, in Section 5 of this paper, we prove that there is no cubic balanced planar graph. Finally, some remarkable conjectures for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1970
ISSN: 0028-0836,1476-4687
DOI: 10.1038/225389a0