WCET Analysis of Superscalar Processors Using Simulation With Coloured Petri Nets

Determining a tight WCET of a block of code to be executed on a modern superscalar processor architecture is becoming ever more difficult due to the dynamic behaviour exhibited by current processors, which include dynamic scheduling features such as speculative and out-of-order execution in the context of multiple execution units with deep pipelines. We describe the use of Coloured Petri Nets (CP-nets) in a simulation based approach to this problem. A complex model of a generic processor architecture is described, with emphasis on the modelling strategy for obtaining the WCET and an analysis of the results.     

Effective visualization of complex vascular structures using a non-parametric vessel detection method

The effective visualization of vascular structures is critical for diagnosis, surgical planning as well as treatment evaluation. In recent work, we have developed an algorithm for vessel detection that examines the intensity profile around each voxel in an angiographic image and determines the likelihood that any given voxel belongs to a vessel; we term this the "vesselness coefficient" of the voxel. Our results show that our algorithm works particularly well for visualizing branch points in vessels. Compared to standard Hessian based techniques, which are fine-tuned to identify long cylindrical structures, our technique identifies branches and connections with other vessels. Using our computed vesselness coefficient, we explore a set of techniques for visualizing vasculature. Visualizing vessels is particularly challenging because not only is their position in space important for clinicians but it is also important to be able to resolve their spatial relationship. We applied visualization techniques that provide shape cues as well as depth cues to allow the viewer to differentiate between vessels that are closer from those that are farther. We use our computed vesselness coefficient to effectively visualize vasculature in both clinical neurovascular x-ray computed tomography based angiography images, as well as images from three different animal studies. We conducted a formal user evaluation of our visualization techniques with the help of radiologists, surgeons, and other expert users. Results indicate that experts preferred distance color blending and tone shading for conveying depth over standard visualization techniques.     

Objective quantification of acetylcholine receptor aggregation using fast Fourier transforms

A new approach for objectively analyzing the aggregation of acetylcholine receptors (AChRs) through power spectrum analysis derived from fast Fourier transform (FFT) of images has been developed. Presently, detection of AChR aggregates at neuromuscular junctions is not easily accomplished. Though the formation of AChR clusters results in periodic gray-level variations that differ with time, no study reporting their correlation with frequency information in the Fourier domain for aggregates' detection purposes exists. To this end, we processed time-lapse images of AChR aggregates' formation on murine myotubes to extract peak values of power spectra. To validate interpretation of the Fourier spectra analysis, a computer routine was developed to semi-automatically count AChR aggregates. We found: (1) logarithmic maxima of Fourier spectra correlated significantly with experimentation time; (2) cluster count correlated significantly with time only after clusters were discernable from images, signifying that this method heavily depended on definitive growth data and thresholding values; (3) exponents of Fourier maxima versus time and cluster count versus time profiles during this phase compared favorably, indicating that both methods were analyzing identical cluster growth rates. Our observations suggest that analysis via FFT power spectrum is sensitive and robust enough to automatically quantify AChR aggregates.     

Data structures for symbolic multi-valued model-checking

Multi-valued logics provide an interesting alternative to classical boolean logic for modeling and reasoning about systems. Such logics can be used for reasoning about partially-specified systems, effectively encode vacuity detection and query-checking problems, help in detecting inconsistencies, and many others.In our earlier work, we identified a useful family of multi-valued logics: those specified over finite distributive lattices where negation preserves involution, i.e., for every element a of the logic. Such structures are called quasi-boolean algebras, and model-checking over these not only extends the domain of applicability of automated reasoning to new problems, but can also speed up solutions to some classical verification problems.Symbolic model-checking over quasi-boolean algebras can be cast in terms of operations over multi-valued sets: sets whose membership functions are multi-valued. In this paper, we propose and empirically evaluate several choices for implementing multi-valued sets with decision diagrams. In particular, we describe two major approaches: (1) representing the multi-valued membership function canonically, using MDDs or ADDs; (2) representing multi-valued sets as a collection of classical sets, using a vector of either MBTDDs or BDDs. The naive implementation of (2) includes having a classical set for each value of the algebra. We exploit a result of lattice theory to reduce the number of such sets that need to be represented.The major contribution of this paper is the evaluation of the different implementations of multi-valued sets, done via a series of experiments and using several case studies.

Biasing a differential pair in low-voltage analog circuits: a systematic approach

This paper deals with a systematic approach to the common mode and the differential mode biasing of a differential transistor pair. Four different variants will be shown, two of these variants show practical importance; a practical circuit of one of these variants turns out to be the traditional long-tailed pair. This variant is mainly suited, if the input signal operates at voltage level, whereas another variant has great advantages if operation at current level occurs. Besides, the latter variant turns out to be very favorable in circuits operating with a single low supply voltage. Two practical circuits based on this variant are given.     

Direct synthesis of hydrogen peroxide from H2 and O2 using zeolite-supported Au-Pd catalysts

The direct synthesis of hydrogen peroxide from H₂ and O₂ using zeolite-supported Au-Pd catalysts is described using two zeolites, ZSM-5 and zeolite Y, using an impregnation method of preparation. The addition of Pd to Au for these catalysts significantly enhances the productivity for hydrogen peroxide. The use of zeolites as a support for Au-Pd gives higher rates of hydrogen peroxide formation when compared with alumina-supported Au catalysts prepared using a similar method. The addition of metals other than Pd is also investigated, but generally Au-Pd catalysts give the highest activity for the synthesis of hydrogen peroxide. The addition of Ru and Rh have no significant effect, but the addition of Pt does enhance the activity for the selective formation of hydrogen peroxide.     

Satisfying quality requirements in the design of a partition‐based,distributed stock trading system

Although quality requirements (QRs) have become a major drive in today's software development, there have been very few real‐world examples in the literature that demonstrate how to meet these requirements. This paper presents such an example. Specifically, the paper describes the design of a partition‐based distributed stock trading service system that satisfies a set of QRs related to resource utilization, performance, scalability and availability. The paper evaluates this design through detailed experiments and discusses some design alternatives and the lessons learned. Central to this design are a static load distribution strategy and a dynamic load balancing strategy. The first strategy is to achieve an initial balanced workload on the system's server cluster during the system initialization time, whereas the second strategy is to maintain this balanced workload throughout the system execution time. Together, these two strategies work in unison to ensure that the server resources are efficiently utilized; the user requests are processed with the required speed; the application is partitioned with sufficient room to scale; and the system is highly available. Copyright © 2011 John Wiley & Sons, Ltd.     

A new paradigm based on agents applied to free-hand sketch recognition

Important advances in natural calligraphic interfaces for CAD (Computer Aided Design) applications are being achieved, enabling the development of CAS (Computer Aided Sketching) devices that allow facing up to the conceptual design phase of a product. Recognizers play an important role in this field, allowing the interpretation of the user’s intention, but they still present some important lacks. This paper proposes a new recognition paradigm using an agent-based architecture that does not depend on the drawing sequence and takes context information into account to help decisions. Another improvement is the absence of operation modes, that is, no button is needed to distinguish geometry from symbols or gestures, and also “interspersing” and “overtracing” are accomplished.     

Parameter optimization for the Gaussian model of protein folding

Computational models of protein folding and ligand docking are large and complex. Few systematic methods have yet been developed to optimize the parameters in such models. We describe here an iterative parameter optimization strategy that is based on minimizing a structural error measure by descent in parameter space. At the start, we know the ‘correct’ native structure that we want the model to produce, and an initial set of parameters representing the relative strengths of interactions between the amino acids. The parameters are changed systematically until the model native structure converges as closely as possible to the correct native structure. As a test, we apply this parameter optimization method to the recently developed Gaussian model of protein folding: each amino acid is represented as a bead and all bonds, covalent and noncovalent, are represented by Hooke's law springs. We show that even though the Gaussian model has continuous degrees of freedom, parameters can be chosen to cause its ground state to be identical to that of Go-type lattice models, for which the global ground states are known. Parameters for a more realistic protein model can also be obtained to produce structures close to the real native structures in the protein database.     

The beat goes on: Rhythmic modulation of cortical potentials by imagined tapping.

A frequency analysis was used to tag cortical activity from imagined rhythmic movements. Participants synchronized overt and imagined taps with brief visual stimuli presented at a constant rate, alternating between left and right index fingers. Brain potentials were recorded from across the scalp and topographic maps made of their power at the alternation frequency between left and right taps. Two prominent power foci occurred in each hemisphere for both overt and imagined taps, one over sensorimotor cortex and the other over posterior parietal cortex, with homologous foci in opposite hemispheres arising from oscillations 180° out of phase. These findings demonstrate temporal isomorphism at a neural level between overt and imagined movements and illustrate a new approach to studying covert actions. (PsycINFO Database Record (c) 2011 APA, all rights reserved)