Estimation in X-bar control charts: effects and corrections

This paper presents an approach for improving the control limits of $ \overline{X} $ control charts when the parameters of the process are estimated and the control chart is in operation. In these conditions, the observed average run length (ARL) may be very different from the planned ARL since the parameter estimates may have a larger error. To minimize this problem, the data collected in effective control (phase 2) will be used to re-estimate the parameters with a precision greater than that obtained in phase 1. Thus, we defined a minimum sample size of observations of phase 2, which is constituted of a mixture of two normal distributions that should be used to re-estimate the process parameters. The proposal is illustrated with numerical example.     

ASCE Journal of Management in Engineering: Review of the years 1985–2002

This study considers the content of the papers published by ASCE’s Journal of Management in Engineering, which has witnessed a growth in number of papers and breadth of participation, particularly of international origin, during the 1985–2002 period. The content is analyzed in two main dimensions: the type of subject and its composing topics, and the type of contributors to the journal. The analysis shows the evolution of the engineering management discipline as represented in the journal. Over the years the discipline has been enriched by an increasing number of contributions on corporate strategies and programs, organizational change, and cultures issues, as well as a growing interest in project management topics, such as quality planning and evaluation of alternative project delivery systems. The number of papers by practitioners, initially the largest contributing group to the journal, has declined significantly over the years.     

Introducing QoS awareness in distributed programming: QTcl

A number of distributed applications require communication services with quality of service (QoS) guarantees. Building global‐scale distributed systems with predictable properties is one of the great challenges for computer systems engineering in the new century. Work undertaken within the Internet Engineering Task Force has led to the definition of novel architectural models for the Internet with QoS support. According to these models, the network has to be appropriately configured in order to provide applications with the required performance guarantees. In next‐generation networks, enabling applications to interact with the underlying QoS services is of primary importance. Hence, several special‐purpose application programming interfaces (APIs) have been defined to let applications negotiate QoS parameters across QoS‐capable networks. However, so far, none of these APIs are available in different operating environments. We believe that such features should be embedded in programming environments for distributed applications. In this work we present how we included QoS control features in Tcl, a programming language that has been widely adopted for the development of distributed multimedia applications. Our work has led to the implementation of QTcl, an extended Tcl interpreter that provides programmers with a new set of primitives, in full compliance with the standard SCRAPI programming interface for the RSVP protocol. QTcl in highly portable, in that it enables standard QoS negotiation to be performed in a seamless fashion on the most common operating systems. Copyright © 2003 John Wiley & Sons, Ltd.     

On the Symbolic Reduction of Processes with Cryptographic Functions

We study the reachability problem for cryptographic protocols represented as processes relying on perfect cryptographic functions. We introduce a symbolic reduction system that can handle hashing functions, symmetric keys, and public keys. Desirable properties such as secrecy or authenticity are specified by inserting logical assertions in the processes.We show that the symbolic reduction system provides a flexible decision procedure for finite processes and a reference for sound implementations. The symbolic reduction system can be regarded as a variant of syntactic unification which is compatible with certain set-membership constraints. For a significant fragment of our formalism, we argue that a dag implementation of the symbolic reduction system leads to an algorithm running in nptime thus matching the lower bound of the problem.In the case of iterated or finite control processes, we show that the problem is undecidable in general and in ptime for a subclass of iterated processes that do not rely on pairing. Our technique is based on rational transductions of regular languages and it applies to a class of processes containing the ping-pong protocols studied in 1982 by Dolev, Even and Karp.     

Optimal errors-in-variables filtering

This paper deals with optimal (minimal variance) filtering in an errors-in-variables framework. Differently from many other contexts, errors-in-variables models treat all variables in a symmetric way (no partition of the variables into inputs and outputs is required) and assume additive noise on all the variables. The filtering technique described in this paper can be easily implemented in a recursive way and does not require the use of a Riccati equation at every update. The results of Monte Carlo simulations have shown the effectiveness and consistency of the approach.     

Design and Calibration of an Opto-mechanical Appliance for 3D Non-contact Orthopedic Measurements Part II: Calibration Methodology and Experimental Results

A multistep iterative calibration methodology for the opto-mechanical system introduced in Part I is proposed. The methodology makes use of a monoview coplanar set of control points, whose number has been determined on the basis of both geometrical considerations and the results of a statistical analysis aiming at assessing the procedure stability in the case of noisy image data. The calibration procedure is carried out comparing the theoretical and observed images of the calibration pattern. Both synthetic and real data have been employed to test the calibration procedure, which proved to be accurate and efficient. The experimental results achieved by the calibrated system are satisfactory in terms of measurement precision.     

Finite-tree analysis for constraint logic-based languages

Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occurs-check) and increased expressivity (cyclic terms can provide very efficient representations of grammars and other useful objects). Unfortunately, the use of infinite rational trees has problems. For instance, many of the built-in and library predicates are ill-defined for such trees and need to be supplemented by run-time checks whose cost may be significant. Moreover, some widely used program analysis and manipulation techniques are correct only for those parts of programs working over finite trees. It is thus important to obtain, automatically, a knowledge of the program variables (the finite variables) that, at the program points of interest, will always be bound to finite terms. For these reasons, we propose here a new data-flow analysis, based on abstract interpretation, that captures such information. We present a parametric domain where a simple component for recording finite variables is coupled, in the style of the open product construction of Cortesi et al., with a generic domain (the parameter of the construction) providing sharing information. The sharing domain is abstractly specified so as to guarantee the correctness of the combined domain and the generality of the approach. This finite-tree analysis domain is further enhanced by coupling it with a domain of Boolean functions, called finite-tree dependencies, that precisely captures how the finiteness of some variables influences the finiteness of other variables. We also summarize our experimental results showing how finite-tree analysis, enhanced with finite-tree dependencies, is a practical means of obtaining precise finiteness information.     

Experimental and Numerical Analysis of Soil–Pipe Interaction

Cases of pipeline damage caused by landslides are common in coastal or mountainous regions, where a continuous monitoring/repair activity is planned in order to maintain their serviceability. The analysis of the soil–structure interaction phenomenon can be invoked to improve the planning and design of buried pipelines, to guide monitoring, and to reduce the risk of damage or failure. Two different approaches are considered in this paper: small scale laboratory tests and numerical simulations using the distinct element method (DEM). The experimental setup consists of a box filled with sand and water. Several experiments were performed, in which the diameter and the depth of the tube varied. The numerical simulations are divided in two separate series: in the first, the numerical model is calibrated and its reliability in reproducing the experimental tests is checked; in the second series, the direction of the relative displacement between the tube and the surrounding “numerical soil” varies over the range ±90° with respect to the horizontal. In the latter, both vertical and horizontal components of the drag force are measured and the corresponding interaction diagrams are constructed. The DEM simulations provide useful information about the shape of the failure mechanisms and the force transfer within the soil.     

Flow,Thermal and Microstructural Analysis during Cast Rolling of Steel in In‐line Strip Production Process

A mathematical model was developed to describe the in‐line hot rolling deformation and recrystallization behaviour of austenite after the solidification on a thin slab casting plant. The most significant features of the cast rolling process were taken into consideration: through‐thickness thermal gradients, inhomogeneous stress and strain, temperature discontinuity between the strip and the rolls. A HSLA (High Strength Low Alloy) steel has been chosen to perform the experiments of cast rolling. The characteristic constants ruling the microstructural evolution of that steel were computed and integrated into the computational module which manages the structural stress‐strain and strain rate computation. The developed approach is based on the Navier‐Stokes’ equations which were used to compute the speed field in the strip during the deformation. Then a model providing a proper constitutive equation was structured on the basis of the Yada's model based on evolution of the dislocation populations. The use of the Navier‐Stokes’ formalism allows to reach the resolution of the structural problem from the data measured easily during the industrial practice (i.e. speed of the rolled product at the entry and at the exit of a stand, the temperature of the rolled material). The validation of this computational approach was obtained by a comparison between the prior austenite grain size of the strip in different positions of the hot rolling process, as well as by a comparison between the computed deformation power and the measured one provided by the engines moving the rolls.