Estimation of Execution Times of Process Control Algorithms on Microcomputers

An important question which has to be answered in evaluting the suitability of a microcomputer for a control application is the time it would take to execute the specified control algorithm. In this paper, we present a method of obtaining closed-form formulas to estimate this time. These formulas are applicable to control algorithms in which arithmetic operations and matrix manipulations dominate. The method does not require writing detailed programs for implementing the control algorithm. Using this method, the execution times of a variety of control algorithms on a range of 16-bit mini- and recently announced microcomputers are calculated. The formulas have been verified independently by an analysis program, which computes the execution time bounds of control algorithms coded in Pascal when they are run on a specified micro- or minicomputer.

Voluntary Control of Multisaccade Gaze Shifts During Movement Preparation and Execution

Ramakrishnan A, Chokhandre S, Murthy A. Voluntary control of multisaccade gaze shifts during movement preparation and execution. J Neurophysiol 103: 2400-2416, 2010. First published February 17, 2010; doi: 10.1152/jn.00843.2009. Although the nature of gaze control regulating single saccades is relatively well documented, how such control is implemented to regulate multisaccade gaze shifts is not known. We used highly eccentric targets to elicit multisaccade gaze shifts and tested the ability of subjects to control the saccade sequence by presenting a second target on random trials. Their response allowed us to test the nature of control at many levels: before, during, and between saccades. Although the saccade sequence could be inhibited before it began, we observed clear signs of truncation of the first saccade, which confirmed that it could be inhibited in midflight as well. Using a race model that explains the control of single saccades, we estimated that it took about 100 ms to inhibit a planned saccade but took about 150 ms to inhibit a saccade during its execution. Although the time taken to inhibit was different, the high subject-wise correlation suggests a unitary inhibitory control acting at different levels in the oculomotor system. We also frequently observed responses that consisted of hypometric initial saccades, followed by secondary saccades to the initial target. Given the estimates of the inhibitory process provided by the model that also took into account the variances of the processes as well, the secondary saccades (average latency similar to 215 ms) should have been inhibited. Failure to inhibit the secondary saccade suggests that the intersaccadic interval in a multisaccade response is a ballistic stage. Collectively, these data indicate that the oculomotor system can control a response until a very late stage in its execution. However, if the response consists of multiple movements then the preparation of the second movement becomes refractory to new visual input, either because it is part of a preprogrammed sequence or as a consequence of being a corrective response to a motor error.

Exploiting Programmable Network Interfaces for Parallel Query Execution in Workstation Clusters

Workstation clusters equipped with high performance interconnect having programmable network processors facilitate interesting opportunities to enhance the performance of parallel application run on them. In this paper, we propose schemes where certain application level processing in parallel database query execution is performed on the network processor. We evaluate the performance of TPC-H queries executing on a high end cluster where all tuple processing is done on the host processor, using a timed Petri net model, and find that tuple processing costs on the host processor dominate the execution time. These results are validated using a small cluster. We therefore propose 4 schemes where certain tuple processing activity is offloaded to the network processor. The first 2 schemes offload the tuple splitting activity - computation to identify the node on which to process the tuples, resulting in an execution time speedup of 1.09 relative to the base scheme, but with I/O bus becoming the bottleneck resource. In the 3rd scheme in addition to offloading tuple processing activity, the disk and network interface are combined to avoid the I/O bus bottleneck, which results in speedups up to 1.16, but with high host processor utilization. Our 4th scheme where the network processor also performs apart of join operation along with the host processor, gives a speedup of 1.47 along with balanced system resource utilizations. Further we observe that the proposed schemes perform equally well even in a scaled architecture i.e., when the number of processors is increased from 2 to 64

Wave propagation in elastic solids undergoing damage and growth process

Modeling and analysis of wave propagation in elastic solids undergoing damage and growth process are reported in this paper. Two types of diagnostic problems, (1) the propagation of waves in the presence of a slow growth process and (2) the propagation of waves in the presence of a fast growth process, are considered. The proposed model employs a slow and a fast time scale and a homogenization technique in the wavelength scale. A detailed analysis of wave dispersion is carried out. A spectral analysis reveals certain low-frequency bands, where the interaction between the wave and the growth process produces acoustic metamaterial-like behavior. Various practical issues in designing an efficient method of acousto-ultrasonic wave based diagnostics of the growth process are discussed. Diagnostics of isotropic damage in a ductile or quasi-brittle solid by using a micro-second pulsating signal is considered for computer simulations, which is to illustrate the practical application of the proposed modeling and analysis. The simulated results explain how an estimate of signal spreading can be effectively employed to detect the presence of a steady-state damage or the saturation of a process.

A High-Resolution Transmission of the Precipitation Process in a Electron Microscopy Study Dilute Ti-N Alloy

The precipitation processes in dilute nitrogen alloys of titanium have been examined in detail by conventional transmission electron microscopy (CTEM) and high-resolution electron microscopy (HREM). The alloy Ti-2 at. pct N on quenching from its high-temperature beta phase field has been found to undergo early stages of decomposition. The supersaturated solid solution (alpha''-hcp) on decomposition gives rise to an intimately mixed, irresolvable product microstructure. The associated strong tweed contrast presents difficulties in understanding the characteristic features of the process. Therefore, HREM has been carried out with a view to getting a clear picture of the decomposition process. Studies on the quenched samples of the alloy suggest the formation of solute-rich zones of a few atom layers thick, randomly distributed throughout the matrix. On aging, these zones grow to a size beyond which the precipitate/matrix interfaces appear to become incoherent and the alpha' (tetragonal) product phase is seen distinctly. The structural details, the crystallography of the precipitation process, and the sequence of precipitation reaction in the system are illustrated.

Different phenomenological theories and their abilities to describe the interdiffusion process in a binary system during multiphase growth

There are essentially two different phenomenological models available to describe the interdiffusion process in binary systems in the olid state. The first of these, which is used more frequently, is based on the theory of flux partitioning. The second model, developed much more recently, uses the theory of dissociation and reaction. Although the theory of flux partitioning has been widely used, we found that this theory does not account for the mobility of both species and therefore is not suitable for use in most interdiffusion systems. We have first modified this theory to take into account the mobility of both species and then further extended it to develop relations or the integrated diffusion coefficient and the ratio of diffusivities of the species. The versatility of these two different models is examined in the Co-Si system with respect to different end-member compositions. From our analysis, we found that the applicability of the theory of flux partitioning is rather limited but the theory of dissociation and reaction can be used in any binary system.

Removal Of Chromium From Electroplating Effluents By The Sulfide Process

A method has been developed for the removal of chromium using ferrous sulphide generated in situ. The effects of experimental parameters such as pH, reagent dosages, interference from cations and chelating agents have been investigated. Under optimum conditions, removal efficiencies of 99 and 97% for synthetic and industrial samples have been obtained. The method offers all the advantages of sulphide precipitation process and can be adopted easily for industrial effluents.

Effects of the filling process on the evolution of the mushy zone and macrosegregation in alloy casting

A numerical model of the entire casting process starting from the mould filling stage to complete solidification is presented. The model takes into consideration any phase change taking place during the filling process. A volume of fluid method is used for tracking the metal–air interface during filling and an enthalpy based macro-scale solidification model is used for the phase change process. The model is demonstrated for the case of filling and solidification of Pb–15 wt%Sn alloy in a side-cooled two-dimensional rectangular cavity, and the resulting evolution of a mushy region and macrosegregation are studied. The effects of process parameters related to filling, namely degree of melt superheat and filling velocity on macrosegregation in the cavity, are also investigated. Results show significant differences in the progress of the mushy zone and macrosegregation pattern between this analysis and conventional analysis without the filling effect.

Temperature measurements in the boron carbide manufacturing process - A hot model study

Boron carbide is produced in a heat resistance furnace using boric oxide and petroleum coke as the raw materials. The product yield is very low. Heat transfer plays an important role in the formation of boron carbide. Temperature at the core reaches up to 2600 K. No experimental study is available in the open literature for this high temperature process particularly in terms of temperature measurement and heat transfer. Therefore, a laboratory scale hot model of the process has been setup to measure the temperatures in harsh conditions at different locations in the furnace using various temperature measurement devices such as pyrometer and various types of thermocouple. Particular attention was paid towards the accuracy and reliability of the measured data. The recorded data were analysed to understand the heat transfer process inside the reactor and the effect of it on the formation of boron carbide.

Reactivity of PPh3 towards Ru2Cl(O2CR)4 (R = Me, Ph) in alcoholic medium: a novel decarbonylation process mediated by a diruthenium compound

Abstract is not available.

Validation-Based Sparse Gaussian Process Classifier Design

Gaussian processes (GPs) are promising Bayesian methods for classification and regression problems. Design of a GP classifier and making predictions using it is, however, computationally demanding, especially when the training set size is large. Sparse GP classifiers are known to overcome this limitation. In this letter, we propose and study a validation-based method for sparse GP classifier design. The proposed method uses a negative log predictive (NLP) loss measure, which is easy to compute for GP models. We use this measure for both basis vector selection and hyperparameter adaptation. The experimental results on several real-world benchmark data sets show better orcomparable generalization performance over existing methods.

Origin of the activation barrier in the process of hydrogen abstraction: the perturbation treatment

The perturbation treatment previously given is extended to explain the process of hydrogen abstraction from the various hydrogen donor molecules by the triplet nπ* state of ketones or the ground state of the alkyl or alkoxy radical. The results suggest that, as the ionization energy of the donor bonds is decreased, the reaction is accelerated and it is not influenced by the bond strength of the donor bonds. The activation barrier in such reactions arises from a weakening of the charge resonance term as the ionization energy of the donor bond increases.

A novel combustion process for the synthesis of fine particle α-alumina and related oxide materials

Synthesis of fine particle α-alumina and related oxide materials such as MgAl2O4, CaAl2O4, Y3Al5O12 (YAG), Image , β′-alumina, LaAlO3 and ruby powder (Image ) has been achieved at low temperatures (500°C) by the combustion of corresponding metal nitrate-urea mixtures. Solid combustion products have been identified by their characteristic X-ray diffraction patterns. The fine particle nature of α-alumina and related oxide materials has been investigated using SEM, TEM, particle size analysis and surface area measurements.

Synergistic Execution of Stream Programs on Multicores with Accelerators

The StreamIt programming model has been proposed to exploit parallelism in streaming applications oil general purpose multicore architectures. The StreamIt graphs describe task, data and pipeline parallelism which can be exploited on accelerators such as Graphics Processing Units (GPUs) or CellBE which support abundant parallelism in hardware. In this paper, we describe a novel method to orchestrate the execution of if StreamIt program oil a multicore platform equipped with an accelerator. The proposed approach identifies, using profiling, the relative benefits of executing a task oil the superscalar CPU cores and the accelerator. We formulate the problem of partitioning the work between the CPU cores and the GPU, taking into account the latencies for data transfers and the required buffer layout transformations associated with the partitioning, as all integrated Integer Linear Program (ILP) which can then be solved by an ILP solver. We also propose an efficient heuristic algorithm for the work-partitioning between the CPU and the GPU, which provides solutions which are within 9.05% of the optimal solution on an average across the benchmark Suite. The partitioned tasks are then software pipelined to execute oil the multiple CPU cores and the Streaming Multiprocessors (SMs) of the GPU. The software pipelining algorithm orchestrates the execution between CPU cores and the GPU by emitting the code for the CPU and the GPU, and the code for the required data transfers. Our experiments on a platform with 8 CPU cores and a GeForce 8800 GTS 512 GPU show a geometric mean speedup of 6.94X with it maximum of 51.96X over it single threaded CPU execution across the StreamIt benchmarks. This is a 18.9% improvement over it partitioning strategy that maps only the filters that cannot be executed oil the GPU - the filters with state that is persistent across firings - onto the CPU.

2 Algorithms For 3-Layer Channel Routing

A channel router is an important design aid in the design automation of VLSI circuit layout. Many algorithms have been developed based on various wiring models with routing done on two layers. With the recent advances in VLSI process technology, it is possible to have three independent layers for interconnection. In this paper two algorithms are presented for three-layer channel routing. The first assumes a very simple wiring model. This enables the routing problem to be solved optimally in a time of O(n log n). The second algorithm is for a different wiring model and has an upper bound of O(n2) for its execution time. It uses fewer horizontal tracks than the first algorithm. For the second model the channel width is not bounded by the channel density.