3D Hair sketching for real-time dynamic & key frame animations

Physically based simulation of human hair is a well studied and well known problem. But the “pure” physically based representation of hair (and other animation elements) is not the only concern of the animators, who want to “control” the creation and animation phases of the content. This paper describes a sketch-based tool, with which a user can both create hair models with different styling parameters and produce animations of these created hair models using physically and key frame-based techniques. The model creation and animation production tasks are all performed with direct manipulation techniques in real-time.     

CFAR processing with switching exponential smoothers for nonhomogeneous environments

Conventional constant false alarm rate (CFAR) methods use a fixed number of cells to estimate the background variance. For homogeneous environments, it is desirable to increase the number of cells, at the cost of increased computation and memory requirements, in order to improve the estimation performance. For nonhomogeneous environments, it is desirable to use less number of cells in order to reduce the number of false alarms around the clutter edges. In this work, we present a solution with two exponential smoothers (first order IIR filters) having different time-constants to leverage the conflicting requirements of homogeneous and nonhomogeneous environments. The system is designed to use the filter having the large time-constant in homogeneous environments and to promptly switch to the filter having the small time constant once a clutter edge is encountered. The main advantages of proposed Switching IIR CFAR method are computational simplicity, small memory requirement (in comparison to windowing based methods) and its good performance in homogeneous environments (due to the large time-constant smoother) and rapid adaptation to clutter edges (due to the small time-constant smoother).     

Enhanced user performance in an image gallery application with a mobile autostereoscopic touch display

In this study, we explored how stereoscopic depth affects performance and user experience in a mobile device with an autostereoscopic touch display. Participants conducted a visual search task with an image gallery application on three layouts with different depth ranges. The task completion times were recorded, and the participants were asked to rate their experiences. The results revealed that the image search times were facilitated by a mild depth effect and that too great a depth slowed search times and decreased user-experience ratings.     

Fuzzy multiattribute evaluation of R&D projects using a real options valuation model

R&D project selection decision is very important in two ways. First, in many organizations, R&D budget represents huge investment. Project selection decisions could be thought with the strategic objectives and plans of the firm. Second, R&D projects' organizational returns are multidimensional in nature and risky in terms of projected outcome. Real options approach helps to calculate this risky side of the selection process. This paper considers that multidimensional side of the R&D project selection process. Another consideration is the vagueness in the evaluation process. The fuzzy analytic hierarchy process, which takes monetary (fuzzy real option value) and nonmonetary (capability, success probability, trends, etc.) criteria into account, is used to make this selection among alternative R&D projects. A real case study is given to illustrate the application of the proposed approach. © 2008 Wiley Periodicals, Inc.     

A color-based face tracking algorithm for enhancing interaction with mobile devices

A color-based face tracking algorithm is proposed to be used as a human-computer interaction tool on mobile devices. The solution provides a natural means of interaction enabling a motion parallax effect in applications. The algorithm considers the characteristics of mobile use-constrained computational resources and varying environmental conditions. The solution is based on color comparisons and works on images gathered from the front camera of a device. In addition to color comparisons, the coherency of the facial pixels is considered in the algorithm. Several applications are also demonstrated in this work, which use the face position to determine the viewpoint in a virtual scene, or for browsing large images. The accuracy of the system is tested under different environmental conditions such as lighting and background, and the performance of the system is measured in different types of mobile devices. According to these measurements the system allows for accurate (7% RMS error) face tracking in real time (20–100 fps).     

Affiliated marketing

In information-intensive environments some firms may be sending their customers to other firms’ or affiliates’ websites in order to generate additional sales for their affiliates. Although this may provide a choice for the customers, from a firm’s point of view such strategies have the potential to cannibalize own sales. Hence, when customers purchase from other firms’ websites, the firm may loose its own customers. This study analyzes the optimality of such strategies using an analytical framework. The findings show that a firm may increase its prices and profit when its own customers purchase from other firm websites. An analysis of customer surplus and total welfare show that such strategies may have adverse effects. The results show that customer surplus and total welfare may decrease as a result of affiliations.     

Thread vulnerability in parallel applications

Continuously reducing transistor sizes and aggressive low power operating modes employed by modern architectures tend to increase transient error rates. Concurrently, multicore machines are dominating the architectural spectrum today in various application domains. These two trends require a fresh look at resiliency of multithreaded applications against transient errors from a software perspective. In this paper, we propose and evaluate a new metric called the Thread Vulnerability Factor (TVF$TVF$). A distinguishing characteristic of TVF$TVF$ is that its calculation for a given thread (which is typically one of the threads of a multithreaded application) does not depend on its code alone, but also on the codes of the threads that share resources and data with that thread. As a result, we decompose TVF$TVF$ of a thread into two complementary parts: local and remote. While the former captures the TVF$TVF$ induced by the code of the target thread, the latter represents the vulnerability impact of the threads that interact with the target thread. We quantify the local and remote TVF$TVF$ values for three architectural components (register file, ALUs, and caches) using a set of ten multithreaded applications from the Parsec and Splash-2 benchmark suites. Our experimental evaluation shows that TVF$TVF$ values tend to increase as the number of cores increases, which means the system becomes more vulnerable as the core count rises. We further discuss how TVF$TVF$ metric can be employed to explore performance–reliability tradeoffs in multicores. Reliability-based analysis of compiler optimizations and redundancy-based fault tolerance are also mentioned as potential usages of our TVF$TVF$ metric.