Argon plasma treatment of glass surfaces

The effect of argon plasma treatment of glass surfaces is studied by FTIR and SEM. The argon plasma on cleaned glass surfaces resulted in increased surface area due to microetching and surface rearrangement of the silicate network as indicated by the observed changes in the Si-O stretching infrared absorption. The result was a relative increase in surface hydrophilicity which could be optimized by the plasma reaction conditions. The etching action of the argon plasma on the substrate surfaces facilitated the removal of the micrometre thick sizing from the commercial fibres accompanied by little loss in tensile strength. Plasma was also used to graft selected monomers to the surface of glass fibres for enhancement of bond compatibility in a composite system. This grafting treatment was followed by an argon etching step. The argon plasma action on the coated surfaces improved the wettability further and increased the sur face area. Changes in surface chemistry that accompanied the argon etching treatment were very subtle in the case of the plasma polymer of allylamine, but proved significant in the case of the plasma polymer of hexamethyldisiloxane. On the latter surfaces, rearrangement of the siloxane (Si-O-Si) bonds to silylmethylene (Si-(CH₂) _n -Si) groups is suggested.     

Performance models of storage contention in cloud environments

We propose simple models to predict the performance degradation of disk requests due to storage device contention in consolidated virtualized environments. Model parameters can be deduced from measurements obtained inside Virtual Machines (VMs) from a system where a single VM accesses a remote storage server. The parameterized model can then be used to predict the effect of storage contention when multiple VMs are consolidated on the same server. We first propose a trace-driven approach that evaluates a queueing network with fair share scheduling using simulation. The model parameters consider Virtual Machine Monitor level disk access optimizations and rely on a calibration technique. We further present a measurement-based approach that allows a distinct characterization of read/write performance attributes. In particular, we define simple linear prediction models for I/O request mean response times, throughputs and read/write mixes, as well as a simulation model for predicting response time distributions. We found our models to be effective in predicting such quantities across a range of synthetic and emulated application workloads.     

Performing Efficient NURBS Modeling Operations on the GPU

We present algorithms for evaluating and performing modeling operations on NURBS surfaces using the programmable fragment processor on the Graphics Processing Unit (GPU). We extend our GPU-based NURBS evaluator that evaluates NURBS surfaces to compute exact normals for either standard or rational B-spline surfaces for use in rendering and geometric modeling. We build on these calculations in our new GPU algorithms to perform standard modeling operations such as inverse evaluations, ray intersections, and surface-surface intersections on the GPU. Our modeling algorithms run in real time, enabling the user to sketch on the actual surface to create new features. In addition, the designer can edit the surface by interactively trimming it without the need for retessellation. Our GPU-accelerated algorithm to perform surface-surface intersection operations with NURBS surfaces can output intersection curves in the model space as well as in the parametric spaces of both the intersecting surfaces at interactive rates. We also extend our surface-surface intersection algorithm to evaluate self-intersections in NURBS surfaces.     

GPU-accelerated minimum distance and clearance queries

We present practical algorithms for accelerating distance queries on models made of trimmed NURBS surfaces using programmable Graphics Processing Units (GPUs). We provide a generalized framework for using GPUs as coprocessors in accelerating CAD operations. By supplementing surface data with a surface bounding-box hierarchy on the GPU, we answer distance queries such as finding the closest point on a curved NURBS surface given any point in space and evaluating the clearance between two solid models constructed using multiple NURBS surfaces. We simultaneously output the parameter values corresponding to the solution of these queries along with the model space values. Though our algorithms make use of the programmable fragment processor, the accuracy is based on the model space precision, unlike earlier graphics algorithms that were based only on image space precision. In addition, we provide theoretical bounds for both the computed minimum distance values as well as the location of the closest point. Our algorithms are at least an order of magnitude faster and about two orders of magnitude more accurate than the commercial solid modeling kernel ACIS.     

Performance stress vectors and capacity planning for e-commerce applications

Computing systems are essential resources for both the business and public sectors. With the increasing interdependence of integrated electronic commerce and business applications within the global computing environment, performance and reliability are of great concern. Poor performance can mean lost cooperation, opportunity, and revenue. This paper describes performance challenges that these applications face over the short and long term. We present an analytic technique that can predict the performance of an e-commerce application over a given deployment period. This technique can be used to deduce performance stress testing vectors over this period and for design and capacity planning exercises. A Web-based shopping server case study is used as an example. Published online: 22 August 2001     

TriM: An Ultra-Accurate High-Speed Six Degree-of-Freedom Manipulator Using Planar Stepper Motors

In this paper, we propose a novel six degree-of-freedom positioning system. This mechanism is a tripod structure with inextensible limbs actuated at the base by two-dimensional linear stepper motors (other types of actuators may also be utilized). This manipulator has a closed-chain kinematic structure. Both the direct and the inverse kinematics of the manipulator are presented in detail. While the inverse kinematics are obtained in closed form, the direct kinematics can not be solved in closed form and an algorithm is provided for numerically computing the direct kinematic solution. A detailed dynamic model of the positioning system is also provided. The dynamics of the actuators (Sawyer motors) are also included in the dynamic modeling. The design of the tripod manipulator (TriM) included a kinematic optimization of the system parameters to maximize the manipulator workspace. The proposed manipulator achieves large range of motion in all the 6 degrees of freedom. Furthermore, high resolution and high speed motion may be achieved in all axes due to the actuators used and the direct-drive nature of the manipulator. This work was supported in part by NSF under grants ECS-9977693 and ECS-0501539. An earlier version of this paper was presented at the 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems, Las Vegas, NV, Oct. 2003.     

Performance evaluation of a multi-product system under CONWIP control

Analytical models of multi-product manufacturing systems operating under CONWIP control are composed of closed queuing networks with synchronization stations. Under general assumptions, these queuing networks are hard to analyze exactly and therefore approximation methods must be used for performance evaluation. This research proposes a new approach based on parametric decomposition. Two-moment approximations are used to estimate the performance measures at individual stations. Subsequently, the traffic process parameters at the different stations are linked using stochastic transformation equations. The resulting set of non-linear equations is solved using an iterative algorithm to obtain estimates of key performance measures such as throughput, and mean queue lengths. Numerical studies indicate that the proposed method is computationally efficient and yields fairly accurate results when compared to simulation.     

The performance of CBN tools in the machining of titanium alloys

Advancements in the aerospace, nuclear and other industries require the enhanced in-service performance of engineering components. These requirements have resulted in the large scale development and use of heat-resistant and high-strength materials such as titanium alloys, which pose considerable machining problems. In this study on machining of titanium alloy using CBN tools, the machining performance was evaluated in terms of cutting force, specific cutting pressure, cutting temperature, chip strain and surface finish.     

An improvement to the interacting multiple model (IMM) algorithm

Computing the optimal conditional mean state estimate for a jump Markov linear system requires exponential complexity, and hence, practical filtering algorithms are necessarily suboptimal. In the target tracking literature, suboptimal multiple-model filtering algorithms, such as the interacting multiple model (IMM) method and generalized pseudo-Bayesian (GPB) schemes, are widely used for state estimation of such systems. We derive a reweighted interacting multiple model algorithm. Although the IMM algorithm is an approximation of the conditional mean state estimator, our algorithm is a recursive implementation of a maximum a posteriori (MAP) state sequence estimator. This MAP estimator is an instance of a previous version of the EM algorithm known as the alternating expectation conditional maximization (AECM) algorithm. Computer simulations indicate that the proposed reweighted IMM algorithm is a competitive alternative to the popular IMM algorithm and GPB methods     

Physical layer impairment-aware shared path protection in wavelength-routed optical networks

The Journal of Supercomputing - In this paper, physical layer impairment (PLI)-aware shared path protection (SPP) scheme for single-link failures in transparent optical WDM mesh networks is...