Maintaining Views in Object-Relational Databases

View materialization is an important way of improving the performance of query processing. When an update occurs to the source data from which a materialized view is derived, the materialized view has to be updated so that it is consistent with the source data. This update process is called view maintenance. The incremental method of view maintenance, which computes the new view using the old view and the update to the source data, is widely preferred to full view recomputation when the update is small in size. In this paper we investigate how to incrementally maintain views in object-relational (OR) databases. The investigation focuses on maintaining views defined in OR-SQL, a language containing the features of object referencing, inheritance, collection, and aggregate functions including user-defined set aggregate functions. We propose an architecture and algorithms for incremental OR viewmaintenance. We implement all algorithms and analyze the performance of them in comparison with full view recomputation. The analysis shows that the algorithms significantly reduce the cost of updating a vieww hen the size of an update to the source data is relatively small. Received 23 May 2000 / Revised 27 March 2001 / Accepted in revised form 30 April 2001 Correspondence and offprint requests to: Jixue Liu, School of Computer and Information Science, University of South Australia, Mawson Lakes, Adelaide SA5084, Australia. Email: jixue.liu@unisa.edu.auau     

Effects of training and experience on perception of hazard and risk

This study was designed to show how those proficient at a machining task, where proficiency was gained through both training and past experience, influence the perceived hazard and risk when observing Computer Numerical Control (CNC) machining. The study was also designed to determine whether the impact of the visual and auditory cues can be isolated during diagnosis of the hazard. In a study that included 40 participants, results show that trained observers can perceive more correctly a hazardous condition which is different from what one would predict based on psychophysics. The results also show that trained participants relied strongly on the auditory cues to diagnose the potential hazard and risk correctly whereas the untrained participants who had access to both auditory and visual senses perceived the potential hazard more incorrectly than those trained and more similarly to a traditional Stevens' psychophysical curve. Untrained subjects who had only auditory input had the most difficulty in distinguishing differences in the perception of hazard. This is important considering recent dialogue about whether there is a need to train for tasks that will be automated. The idea of training, especially for automated tasks, is important in allowing better recognition of hazard and risk in unusual circumstances. Additional research may help to improve the diagnosis of hazard and risk and may enable generalization of the results to other training scenarios in the manufacturing and services industries.     

A theoretical framework for gain scheduling

The weighted incremental norm approach was originally introduced as a natural framework for extending well‐known H_∞ linear control concepts into the nonlinear context. In this paper, we investigate the numerous links between this new approach and the classical gain‐scheduling technique. Although based on heuristic rules, gain‐scheduled control is probably the most widespread nonlinear technique. In this paper, we point out that the control objectives of the gain‐scheduled controller design can be expressed as the weighted incremental norm minimization of a nonlinear operator. The result interest is twofold: it first provides a rigorous mathematical formulation of the gain‐scheduling problem. Furthermore, existing gain‐scheduling techniques can be interpreted as approximate solutions to the weighted incremental norm minimization of a nonlinear operator. Copyright © 2003 John Wiley & Sons, Ltd.     

Analysis of head pose accuracy in augmented reality

A method is developed to analyze the accuracy of the relative head-to-object position and orientation (pose) in augmented reality systems with head-mounted displays. From probabilistic estimates of the errors in optical tracking sensors, the uncertainty in head-to-object pose can be computed in the form of a covariance matrix. The positional uncertainty can be visualized as a 3D ellipsoid. One useful benefit of having an explicit representation of uncertainty is that we can fuse sensor data from a combination of fixed and head-mounted sensors in order to improve the overall registration accuracy. The method was applied to the analysis of an experimental augmented reality system, incorporating an optical see-through head-mounted display, a head-mounted CCD camera, and a fixed optical tracking sensor. The uncertainty of the pose of a movable object with respect to the head-mounted display was analyzed. By using both fixed and head mounted sensors, we produced a pose estimate that is significantly more accurate than that produced by either sensor acting alone     

Toward a hybrid model for usability resource allocation in industrial software product development

The organizational aspects of user‐centered software development in a financial services company are presented. The financial services industry sector is one of the industrial sectors to embark on the development of computer software as a consumer product. The nature of business in the service sector predisposes it to encounter difficulties in developing software aimed at meeting customer demands. Lack of familiarity and experience with the product design and implementation processes, as well as reliance on usability for acceptance, are major obstacles encountered. Difficulties, insights, and lessons learned regarding organizational ergonomics issues faced by a user‐centered design group are provided, and a hybrid resource distribution model is proposed to guide other service sector companies in their future software development efforts. © 2007 Wiley Periodicals, Inc. Hum Factors Man 17: 245–262, 2007.     

Snap-stabilization and PIF in tree networks

The contribution of this paper is threefold. First, we present the paradigm of snap-stabilization. A snap- stabilizing protocol guarantees that, starting from an arbitrary system configuration, the protocol always behaves according to its specification. So, a snap-stabilizing protocol is a time optimal self-stabilizing protocol (because it stabilizes in 0 rounds). Second, we propose a new Propagation of Information with Feedback (PIF) cycle, called Propagation of Information with Feedback and Cleaning (). We show three different implementations of this new PIF. The first one is a basic cycle which is inherently snap-stabilizing. However, the first PIF cycle can be delayed O(h ²) rounds (where h is the height of the tree) due to some undesirable local states. The second algorithm improves the worst delay of the basic algorithm from O(h ²) to 1 round. The state requirement for the above two algorithms is 3 states per processor, except for the root and leaf processors that use only 2 states. Also, they work on oriented trees. We then propose a third snap-stabilizing PIF algorithm on un-oriented tree networks. The state requirement of the third algorithm depends on the degree of the processors, and the delay is at most h rounds. Next, we analyze the maximum waiting time before a PIF cycle can be initiated whether the PIF cycle is infinitely and sequentially repeated or launch as an isolated PIF cycle. The analysis is made for both oriented and un-oriented trees. We show or conjecture that the two best of the above algorithms produce optimal waiting time. Finally, we compute the minimal number of states the processors require to implement a single PIF cycle, and show that both algorithms for oriented trees are also (in addition to being time optimal) optimal in terms of the number of states. WARNING: The concept of snap-stabilization was first introduced in [12]. The concept evolved over the last eight years. We take this evolution in consideration in this paper, which includes the early results published in [10] and [12]. In particular, infinite repetition of computation cycles is a requirement of self-stabilizing systems. This is not required in snap-stabilization because snap-stabilization ensures that the first completed computation cycle is executed according to the specification of the problem. The correctness proofs conform to this basic property.     

Fast computation of minimal elementary decompositions of metabolic flux vectors

The concept of elementary flux vector is valuable in a number of applications of metabolic engineering. For instance, in metabolic flux analysis, each admissible flux vector can be expressed as a non-negative linear combination of a small number of elementary flux vectors. However a critical issue concerns the total number of elementary flux vectors which may be huge because it combinatorially increases with the size of the metabolic network. In this paper we present a fast algorithm that randomly computes a decomposition of admissible flux vectors in a minimal number of elementary flux vectors without explicitly enumerating all of them.     

Patients' anxiety as a function of expectation and degree of initial interview ambiguity.

Each of 9 psychiatric residents administered 5 structured and 5 unstructured initial interviews to patients of an adult outpatient clinic. Patients' expectations about psychotherapy were obtained before the interviews. As predicted, when patients experienced interviews compatible with their expectations, they tended to rate their anxiety significantly lower than did patients experiencing interviews incompatible with their expectations. The kind of interview alone did not make a significant difference. Residents rated those interviews incompatible with the patients' expectations as most difficult. The implications for psychotherapy of these and related findings are discussed. (18 ref.) (PsycINFO Database Record (c) 2010 APA, all rights reserved)