Industrial implementation of controller performance analysis technology

In this paper, a controller performance monitoring technology is introduced with a focus on its industrial implementation and applications. The technology to be introduced in this paper is known as Performance Analysis Toolbox and Solutions (PATS). The main components are discussed, which include data collection, closed-loop systems identification, control valve stiction monitoring, univariate control performance monitoring, multivariate control performance monitoring, model predictive control performance monitoring, etc. It is shown, through a thorough industry case study with various components of PATS, that the integration of the technology provides more convincing diagnosis results and facilitates identification of control improvement opportunities. Some components of the developed technology can be downloaded from the website http://www.ualberta.ca/～bhuang/research/research.htm.     

Exploiting Ontology for Software License Agreements

Software end-users need to sign licenses to seal an agreement with the product providers. Habitually, users agree with the license (i.e. terms and conditions) without fully understanding the agreement. To address this issue, an ontological model is developed to formulate the user requirements and license agreements formally. This paper, introduces ontological model that includes the abstract license ontology of common features found in di?erent license agreements. The abstract license ontology is then extended to a few real world license agreements. The resulting model can be used for di?erent purposes such as querying the appropriate licenses for a speciˉc requirement or checking the license terms and conditions with user requirements.     

Tensor Clustering for Rendering Many‐Light Animations

Rendering animations of scenes with deformable objects, camera motion, and complex illumination, including indirect lighting and arbitrary shading, is a long‐standing challenge. Prior work has shown that complex lighting can be accurately approximated by a large collection of point lights. In this formulation, rendering of animation sequences becomes the problem of efficiently shading many surface samples from many lights across several frames. This paper presents a tensor formulation of the animated many‐light problem, where each element of the tensor expresses the contribution of one light to one pixel in one frame. We sparsely sample rows and columns of the tensor, and introduce a clustering algorithm to select a small number of representative lights to efficiently approximate the animation. Our algorithm achieves efficiency by reusing representatives across frames, while minimizing temporal flicker. We demonstrate our algorithm in a variety of scenes that include deformable objects, complex illumination and arbitrary shading and show that a surprisingly small number of representative lights is sufficient for high quality rendering. We believe out algorithm will find practical use in applications that require fast previews of complex animation.     

Bias detection and estimation in dynamic data reconciliation

A method for detection and estimation of measurement bias in nonlinear dynamic processes is presented. It employs model-based data reconciliation and requires the examination of the resulting difference between the measured and reconciled values. Since bias is commonly present in process measurements, this technique is an important step toward the ultimate goal of reconciling ‘raw’ process data that may contain bias and gross errors in addition to small random errors. A CSTR example shows that this method does allow for the detection of a single bias in a nonlinear dynamic process whether or not the exact model equations are known.     

Dynamic Allocation of Ragged Arrays Using C++: Potentiality for Finite-Element Method Software

A ragged array is an irregularly shaped data structure that is an extremely convenient and natural means of implementing storage schemes that exploit the symmetry and sparsity of the different stiffness matrices involved in the finite-element method. Ragged arrays have the potential for improving the programmer’s productivity as well as enhancing code maintainability. Additionally, no performance degradation was detected when ragged arrays were used; the performance of the Gauss elimination procedure, implemented in C++ using ragged arrays, was comparable to the performance of the same procedure implemented in FORTRAN using traditional data structures.     

On the influence of residual stresses on the fracture behavior of a structural steel in the KIc temperature range

The increase with increasing temperature of K_Ic, measured with 2CT and 1'CT specimens, from about 10³N mm at 77 K to about 2.10³ N mm at about 170 K is attributed to the increasing proportion of dimple to cleavage fracture as revealed by scanning electron microscope investigation.

The specimens were prestrained to different partial scale yielding states by the same kind of loading, performed at 298 K, as in the later K_Ictests, performed at 77 K. After pretension K_Ic = K^*_Ic is increased by a maximum amount of about half of the value K⁰_Icof nonprestrained specimens, after precompression it is reduced by the same amount if this value is evaluated from the load at which a pop-in occurs. The value K_Ic = K^**_Ic for the final fracture lies between K^*_Ic and K⁰_Ic. These results are interpretated in terms of the residual stress states due to prestraining.     

Real structured singular value conditions for the strong D-stability

Recently, Chen et al. (Systems Control Lett. 24 (1995) 19) proposed conditions for D-stability and strong D-stability in terms of structured singular values. In this paper, simpler conditions for the strong D-stability are derived.     

Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching

Pivot-based algorithms are effective tools for proximity searching in metric spaces. They allow trading space overhead for number of distance evaluations performed at query time. With additional search structures (that pose extra space overhead) they can also reduce the amount of side computations. We introduce a new data structure, the Fixed Queries Array (FQA), whose novelties are (1) it permits sublinear extra CPU time without any extra data structure; (2) it permits trading number of pivots for their precision so as to make better use of the available memory. We show experimentally that the FQA is an efficient tool to search in metric spaces and that it compares favorably against other state of the art approaches. Its simplicity converts it into a simple yet effective tool for practitioners seeking for a black-box method to plug in their applications.     

Rectangular polyomino set weak (1, 2)-achievement games

In a polyomino set (1, 2)-achievement game the maker and the breaker alternately mark one and two previously unmarked cells respectively. The maker’s goal is to mark a set of cells congruent to one of a given set of polyominoes. The breaker tries to prevent the maker from achieving his goal. The teams of polyominoes for which the maker has a winning strategy is determined up to size 4. In set achievement games, it is natural to study infinitely large polyominoes. This enables the construction of super winners that characterize all winning teams up to a certain size.     

On thermal and vibrational properties of LaGaO3 single crystals

The thermal expansion and vibrational properties of [1 0 0] and [0 0 1] LaGaO₃ single crystals have been studied by thermal mechanical analysis and micro-Raman spectroscopy. A first-order orthorhombic to rhombohedral phase transition has been confirmed by both techniques, as well as by in situ heating using optical microscopy. The appearance of a metastable intermediate phase, tentatively assigned as monoclinic, has been detected both by optical microscopy and Raman spectroscopy upon heating of the [1 0 0] and [0 0 1] LaGaO₃ single crystals. Not only temperature, but the stress-induced orthorhombic to rhombohedral phase transition has also been detected by Raman mapping of the residual impression made by Vickers indentation. The position map of bands belonging to the lower-temperature/pressure orthorhombic and the higher-temperature/pressure rhombohedral phase show that the rhombohedral phase is located inside the impression, where the applied indentation stresses are the highest, whereas no rhombohedral phase is detected outside the impression, where the surface has not been altered by contact stresses.