We present a new data structure for object space partitioning that can be represented completely implicitly. The bounds of each node in the tree structure are recreated at run-time from the scene objects contained therein. By applying a presorting procedure to the geometry, only a known fraction of the geometry is needed to locate the bounding planes of any node. We evaluate the impact of the i...

The study reported in this paper explores the validity of the hypothesis that Human-Computer interaction displays the same dynamics as HumanHuman interaction. The study also addresses the issue of universality and cultural dependency of social responses in Human-Computer interactions. A series of psychological experiments are conducted both with American and Japanese participants on their socia...

Reliability-based design optimization is concerned with designing a product to optimize an objective function given uncertainties about whether various design constraints will be satisfied. However, the widespread practice of formulating such problems as chance-constrained programs can lead to misleading solutions. While a decision analytic approach would avoid this undesirable result, many eng...

The binomial moments of a linear code are synonymously related to its weight distribution and appear naturally in studies involving the weight distribution of the code. In particular , the binomial moments have been used for establishing bounds on the undetected error probability and, though implicitly, for the study of good and proper codes. In this work we sharpen known bounds on the binomial...