Metrics for shot boundary detection in digital video sequences

The detection of shot boundaries in video sequences is an important task for generating indexed video databases. This paper provides a comprehensive quantitative comparison of the metrics that have been applied to shot boundary detection. In addition, several standardized statistical tests that have not been applied to this problem, as well as three new metrics, are considered. A mathematical framework for quantitatively comparing metrics is supplied. Experimental results based on a video database containing 39,000 frames are included.     

Towards the development of a virtual environment-based training system for mechanical assembly operations

In this paper, we discuss the development of Virtual Training Studio (VTS), a virtual environment-based training system that allows training supervisors to create training instructions and allows trainees to learn assembly operations in a virtual environment. Our system is mainly focused on the cognitive side of training so that trainees can learn to recognize parts, remember assembly sequences, and correctly orient the parts during assembly operations. Our system enables users to train using the following three training modes: (1) Interactive Simulation, (2) 3D Animation, and (3) Video. Implementing these training modes required us to develop several new system features. This paper presents an overview of the VTS system and describes a few main features of the system. We also report user test results that show how people train using our system. The user test results indicate that the system is able to support a wide variety of training preferences and works well to support training for assembly operations.

---

Fast and effective feature-preserving mesh denoising

We present a simple and fast mesh denoising method, which can remove noise effectively, while preserving mesh features such as sharp edges and corners. The method consists of two stages. Firstly, noisy face normals are filtered iteratively by weighted averaging of neighboring face normals. Secondly, vertex positions are iteratively updated to agree with the denoised face normals. The weight function used during normal filtering is much simpler than that used in previous similar approaches, being simply a trimmed quadratic. This makes the algorithm both fast and simple to implement. Vertex position updating is based on the integration of surface normals using a least-squares error criterion. Like previous algorithms, we solve the least-squares problem by gradient descent, but whereas previous methods needed user input to determine the iteration step size, we determine it automatically. In addition, we prove the convergence of the vertex position updating approach. Analysis and experiments show the advantages of our proposed method over various earlier surface denoising methods.     

Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees

We prove convergence in distribution for the profile (the number of nodes at each level), normalized by its mean, of random recursive trees when the limit ratio α of the level and the logarithm of tree size lies in [0,e). Convergence of all moments is shown to hold only for α ∈ [0,1] (with only convergence of finite moments when α ∈ (1,e)). When the limit ratio is 0 or 1 for which the limit laws are both constant, we prove asymptotic normality for α = 0 and a "quicksort type" limit law for α = 1, the latter case having additionally a small range where there is no fixed limit law. Our tools are based on the contraction method and method of moments. Similar phenomena also hold for other classes of trees; we apply our tools to binary search trees and give a complete characterization of the profile. The profiles of these random trees represent concrete examples for which the range of convergence in distribution differs from that of convergence of all moments.     

A structured marketplace for arbitrary services

Creating simple marketplaces with common rules, that enable the dynamic selection and consumption of functionality, is the missing link to allow small businesses to enter the cloud, not only as consumers, but also as vendors. In this paper, we present the concepts behind a hybrid service and process repository that can act as the foundation for such a marketplace, as well as a prototype that allowed us to test various real-world scenarios. The advantage of a hybrid service and process repository is that, it not only holds a flat list of services, but also exposes a generic set of use cases, that it obtains information on how specific services can be used to implement the use cases as well as information to select services at run-time according to customer’s goal functions.     

3D characterization of hot metallic shells during industrial forging

During industrial forging of hot metallic shells, it is necessary to regularly measure the dimensions of the parts, especially the inner and outer diameters and the thickness of the walls. A forging sequence lasts 2 h or more during which the diameter of the shell is regularly measured in order to decide when to stop the forging process. For better working conditions, for the safety of the blacksmiths, and for a faster and more accurate measurement, we have developed a novel system based on two commercially available time of flight laser scanners for the measurement of the diameters of hot cylindrical metallic shells during the forging process. The advantages of using laser scanners are that they can be placed very far from the hot shell, more than 15 m, while at the same time giving an accurate point cloud from which three-dimensional views of the shell can be reconstructed and diameter measurements done. Moreover, more accurate measurement is achieved in less time with the laser system than with the conventional method using a large ruler. The system has been successfully used to measure the diameters of hot cylindrical metallic shells.     

The smooth (tractor) operator: insights of knowledge engineering

The design of and training for complex systems requires in-depth understanding of task demands imposed on users. In this project, we used the knowledge engineering approach (Bowles et al., 2004) to assess the task of mowing in a citrus grove. Knowledge engineering is divided into four phases: (1) Establish goals. We defined specific goals based on the stakeholders involved. The main goal was to identify operator demands to support improvement of the system. (2) Create a working model of the system. We reviewed product literature, analyzed the system, and conducted expert interviews. (3) Extract knowledge. We interviewed tractor operators to understand their knowledge base. (4) Structure knowledge. We analyzed and organized operator knowledge to inform project goals. We categorized the information and developed diagrams to display the knowledge effectively. This project illustrates the benefits of knowledge engineering as a qualitative research method to inform technology design and training.     

An Extended Comparator Hypothesis Account of Superconditioning.

Three conditioned taste aversion experiments with rats investigated superconditioning. In each experiment, alternate exposures of 2 flavor compounds with a common element (i.e., AB/AS) were administered to establish an inhibitory relationship between the 2 unique elements, B and S, and prior to testing, S was paired with lithium chloride (LiCl). In Experiment 1, pairings of a neutral cue (X) with S in compound with B after the AB/AS exposures resulted in superconditioning between X and S. Extinction of the common element (A) just before the S-LiCl pairing attenuated both the inhibitory relationship between B and S (Experiment 2) and superconditioning between X and S (Experiment 3). These observations suggest that superconditioning consists of enhanced performance rather than enhanced associative acquisition. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Refinement of fair action systems

An action system is a framework for describing parallel or distributed systems, for which the refinement calculus offers a formalisation of the stepwise development method. Fairness is an important notion in modelling parallel or distributed systems, and this paper investigates a calculus for refinement of fair action systems. Simulations, which are proof techniques for refinement, are extended to verify fair action systems. Our work differs from others' in that the additional condition concerning fairness is expressed through termination of related iteration statements. For this purpose, existing proof rules for termination are extended. In the tradition of the refinement calculus, our approach to fairness is based on techniques developed mainly for sequential programming. Received: 16 March 1995 / 16 April 1997     

Hitting the wall: errors in developing and code inspecting a `simple' spreadsheet model

Field audits and experiments have found substantial error rates when students and professionals have built spreadsheet models. In this study, 102 undergraduate MIS majors and 50 MBA students developed a model from a word problem that was relatively simple and free of domain knowledge. Even so, 35% of their 152 models were incorrect. There was no significant difference in errors per model between undergraduates and MBAs. Even among the 17 MBAs with 250 h or more of experience, 24% of the models contained errors. The cell error rate (CER)—the percentage of cells with errors—was 2.0%. When 23 undergraduates attempted to audit their models through code inspection, only three with incorrect spreadsheets (15%) produced clean spreadsheets when they finished the audit.