A generator of efficient abstract machine implementations and its application to emulator minimization

The implementation of abstract machines involves complex decisions regarding, e.g., data representation, opcodes, or instruction specialization levéis, all of which affect the final performance of the emulator and the size of the bytecode programs in ways that are often difficult to foresee. Besides, studying alternatives by implementing abstract machine variants is a time-consuming and error-prone task because of the level of complexity and optimization of competitive implementations, which makes them generally difficult to understand, maintain, and modify. This also makes it hard to genérate specific implementations for particular purposes. To ameliorate those problems, we propose a systematic approach to the automatic generation of implementations of abstract machines. Different parts of their definition (e.g., the instruction set or the infernal data and bytecode representation) are kept sepárate and automatically assembled in the generation process. Alternative versions of the abstract machine are therefore easier to produce, and variants of their implementation can be created mechanically, with specific characteristics for a particular application if necessary. We illustrate the practicality of the approach by reporting on an implementation of a generator of production-quality WAMs which are specialized for executing a particular fixed (set of) program(s). The experimental results show that the approach is effective in reducing emulator size.

An abstract machine based execution model for computer architecture design and efficient implementation of logic programs in parallel.

The term "Logic Programming" refers to a variety of computer languages and execution models which are based on the traditional concept of Symbolic Logic. The expressive power of these languages offers promise to be of great assistance in facing the programming challenges of present and future symbolic processing applications in Artificial Intelligence, Knowledge-based systems, and many other areas of computing. The sequential execution speed of logic programs has been greatly improved since the advent of the first interpreters. However, higher inference speeds are still required in order to meet the demands of applications such as those contemplated for next generation computer systems. The execution of logic programs in parallel is currently considered a promising strategy for attaining such inference speeds. Logic Programming in turn appears as a suitable programming paradigm for parallel architectures because of the many opportunities for parallel execution present in the implementation of logic programs. This dissertation presents an efficient parallel execution model for logic programs. The model is described from the source language level down to an "Abstract Machine" level suitable for direct implementation on existing parallel systems or for the design of special purpose parallel architectures. Few assumptions are made at the source language level and therefore the techniques developed and the general Abstract Machine design are applicable to a variety of logic (and also functional) languages. These techniques offer efficient solutions to several areas of parallel Logic Programming implementation previously considered problematic or a source of considerable overhead, such as the detection and handling of variable binding conflicts in AND-Parallelism, the specification of control and management of the execution tree, the treatment of distributed backtracking, and goal scheduling and memory management issues, etc. A parallel Abstract Machine design is offered, specifying data areas, operation, and a suitable instruction set. This design is based on extending to a parallel environment the techniques introduced by the Warren Abstract Machine, which have already made very fast and space efficient sequential systems a reality. Therefore, the model herein presented is capable of retaining sequential execution speed similar to that of high performance sequential systems, while extracting additional gains in speed by efficiently implementing parallel execution. These claims are supported by simulations of the Abstract Machine on sample programs.

Analyzing energy-efficient configurations in hexapod robots for demining applications

Purpose – Reducing energy consumption in walking robots is an issue of great importance in field applications such as humanitarian demining so as to increase mission time for a given power supply. The purpose of this paper is to address the problem of improving energy efficiency in statically stable walking machines by comparing two leg, insect and mammal, configurations on the hexapod robotic platform SILO6. Design/methodology/approach – Dynamic simulation of this hexapod is used to develop a set of rules that optimize energy expenditure in both configurations. Later, through a theoretical analysis of energy consumption and experimental measurements in the real platform SILO6, a configuration is chosen. Findings – It is widely accepted that the mammal configuration in statically stable walking machines is better for supporting high loads, while the insect configuration is considered to be better for improving mobility. However, taking into account the leg dynamics and not only the body weight, different results are obtained. In a mammal configuration, supporting body weight accounts for 5 per cent of power consumption while leg dynamics accounts for 31 per cent. Originality/value – As this paper demonstrates, the energy expended when the robot walks along a straight and horizontal line is the same for both insect and mammal configurations, while power consumption during crab walking in an insect configuration exceeds power consumption in the mammal configuration.

A Semi-Lagrangian Particle Level Set Finite Element Method for Interface Problems

We present a quasi-monotone semi-Lagrangian particle level set (QMSL-PLS) method for moving interfaces. The QMSL method is a blend of first order monotone and second order semi-Lagrangian methods. The QMSL-PLS method is easy to implement, efficient, and well adapted for unstructured, either simplicial or hexahedral, meshes. We prove that it is unconditionally stable in the maximum discrete norm, � · �h,∞, and the error analysis shows that when the level set solution u(t) is in the Sobolev space Wr+1,∞(D), r ≥ 0, the convergence in the maximum norm is of the form (KT/Δt)min(1,Δt � v �h,∞ /h)((1 − α)hp + hq), p = min(2, r + 1), and q = min(3, r + 1),where v is a velocity. This means that at high CFL numbers, that is, when Δt > h, the error is O( (1−α)hp+hq) Δt ), whereas at CFL numbers less than 1, the error is O((1 − α)hp−1 + hq−1)). We have tested our method with satisfactory results in benchmark problems such as the Zalesak’s slotted disk, the single vortex flow, and the rising bubble.

Efficient hybrid monocular-stereo approach to on-board, video-based traffic sign detection and tracking

In this paper we propose an innovative method for the automatic detection and tracking of road traffic signs using an onboard stereo camera. It involves a combination of monocular and stereo analysis strategies to increase the reliability of the detections such that it can boost the performance of any traffic sign recognition scheme. Firstly, an adaptive color and appearance based detection is applied at single camera level to generate a set of traffic sign hypotheses. In turn, stereo information allows for sparse 3D reconstruction of potential traffic signs through a SURF-based matching strategy. Namely, the plane that best fits the cloud of 3D points traced back from feature matches is estimated using a RANSAC based approach to improve robustness to outliers. Temporal consistency of the 3D information is ensured through a Kalman-based tracking stage. This also allows for the generation of a predicted 3D traffic sign model, which is in turn used to enhance the previously mentioned color-based detector through a feedback loop, thus improving detection accuracy. The proposed solution has been tested with real sequences under several illumination conditions and in both urban areas and highways, achieving very high detection rates in challenging environments, including rapid motion and significant perspective distortion

Trajectory-Based Morphological Operators: A Model for Efficient Image Processing

Mathematical morphology has been an area of intensive research over the last few years. Although many remarkable advances have been achieved throughout these years, there is still a great interest in accelerating morphological operations in order for them to be implemented in real-time systems. In this work, we present a new model for computing mathematical morphology operations, the so-called morphological trajectory model (MTM), in which a morphological filter will be divided into a sequence of basic operations. Then, a trajectory-based morphological operation (such as dilation, and erosion) is defined as the set of points resulting from the ordered application of the instant basic operations. The MTM approach allows working with different structuring elements, such as disks, and from the experiments, it can be extracted that our method is independent of the structuring element size and can be easily applied to industrial systems and high-resolution images.

Efficient Mitigation of Data and Control Flow Errors in Microprocessors

The use of microprocessor-based systems is gaining importance in application domains where safety is a must. For this reason, there is a growing concern about the mitigation of SEU and SET effects. This paper presents a new hybrid technique aimed to protect both the data and the control-flow of embedded applications running on microprocessors. On one hand, the approach is based on software redundancy techniques for correcting errors produced in the data. On the other hand, control-flow errors can be detected by reusing the on-chip debug interface, existing in most modern microprocessors. Experimental results show an important increase in the system reliability even superior to two orders of magnitude, in terms of mitigation of both SEUs and SETs. Furthermore, the overheads incurred by our technique can be perfectly assumable in low-cost systems.

More Competitive, More Efficient? The 2013 European Commission Defence Communication. Security Policy Brief No. 49, September 2013

The European Commission has now released its 2013 Communication on defence-industrial policy. But does the latest set of policy ideas offer European defence-industrial cooperation any new impetus? This Brief argues that while the majority of the Commission’s initiatives are not new, some much needed ideas have made their way into the latest Communication.

Efficient taxation of multi-national enterprises in the European Union. Bruges European Economic Policy (BEEP) Briefing 5/2003

Current arrangements for multi-national company taxation in EU are plagued by severe conceptual and administrative problems, leading to high compliance costs, considerable uncertainty and ample room for abuse. Integration is amplifying these difficulties. There are two possible approaches in designing an efficient trans-border corporate tax system for the European Union. The first is to consolidate the EU-wide operations of MNEs, using an agreed common base as the reference variable, and then to apportion this total tax base using some presumptive indicators of activity in each tax jurisdiction – hence, implicitly, of the likely benefits stemming from each location. The apportionment formula should respect requisites of neutrality between productive factors and forms of corporate financing. A radically different approach is also available that offers considerable advantages in terms of efficiency, simplicity and decentralisation, including full administrative autonomy of national tax authorities. It entails abandoning corporate income as the relevant tax base and taxing at a moderate rate some agreed measure of business activity such as company value added, sales or employment. These are the variables usually considered in formula apportionment, but they would apply directly without having first to go through the complications of EU-wide consolidation based on a common-base definition. Reference to a broad base, with no exemptions or deductions, would allow to set low statutory rates.

SaveRF: Towards efficient relevance feedback search

In multimedia retrieval, a query is typically interactively refined towards the ‘optimal’ answers by exploiting user feedback. However, in existing work, in each iteration, the refined query is re-evaluated. This is not only inefficient but fails to exploit the answers that may be common between iterations. In this paper, we introduce a new approach called SaveRF (Save random accesses in Relevance Feedback) for iterative relevance feedback search. SaveRF predicts the potential candidates for the next iteration and maintains this small set for efficient sequential scan. By doing so, repeated candidate accesses can be saved, hence reducing the number of random accesses. In addition, efficient scan on the overlap before the search starts also tightens the search space with smaller pruning radius. We implemented SaveRF and our experimental study on real life data sets show that it can reduce the I/O cost significantly.

Low loss depressed cladding waveguide inscribed in YAG:Nd single crystal by femtosecond laser pulses

A depressed cladding waveguide with record low loss of 0.12 dB/cm is inscribed in YAG:Nd(0.3at.%) crystal by femtosecond laser pulses with an elliptical beam waist. The waveguide is formed by a set of parallel tracks which constitute the depressed cladding. It is a key element for compact and efficient CW waveguide laser operating at 1064 nm and pumped by a multimode laser diode. Special attention is paid to mechanical stress resulting from the inscription process. Numerical calculation of mode distribution and propagation loss with the elasto-optical effect taken into account leads to the conclusion that the depressed cladding is a dominating factor in waveguide mode formation, while the mechanical stress only slightly distorts waveguide modes.

An efficient screening method for computer experiments

Computer simulators of real-world processes are often computationally expensive and require many inputs. The problem of the computational expense can be handled using emulation technology; however, highly multidimensional input spaces may require more simulator runs to train and validate the emulator. We aim to reduce the dimensionality of the problem by screening the simulators inputs for nonlinear effects on the output rather than distinguishing between negligible and active effects. Our proposed method is built upon the elementary effects (EE) method for screening and uses a threshold value to separate the inputs with linear and nonlinear effects. The technique is simple to implement and acts in a sequential way to keep the number of simulator runs down to a minimum, while identifying the inputs that have nonlinear effects. The algorithm is applied on a set of simulated examples and a rabies disease simulator where we observe run savings ranging between 28% and 63% compared with the batch EE method. Supplementary materials for this article are available online.

A Variable Neighborhood Search Approach for Solving the Maximum Set Splitting Problem

This paper presents a Variable neighbourhood search (VNS) approach for solving the Maximum Set Splitting Problem (MSSP). The algorithm forms a system of neighborhoods based on changing the component for an increasing number of elements. An efficient local search procedure swaps the components of pairs of elements and yields a relatively short running time. Numerical experiments are performed on the instances known in the literature: minimum hitting set and Steiner triple systems. Computational results show that the proposed VNS achieves all optimal or best known solutions in short times. The experiments indicate that the VNS compares favorably with other methods previously used for solving the MSSP. ACM Computing Classification System (1998): I.2.8.

Model Mining and Efficient Verification of Software Product Lines

Software product line modeling aims at capturing a set of software products in an economic yet meaningful way. We introduce a class of variability models that capture the sharing between the software artifacts forming the products of a software product line (SPL) in a hierarchical fashion, in terms of commonalities and orthogonalities. Such models are useful when analyzing and verifying all products of an SPL, since they provide a scheme for divide-and-conquer-style decomposition of the analysis or verification problem at hand. We define an abstract class of SPLs for which variability models can be constructed that are optimal w.r.t. the chosen representation of sharing. We show how the constructed models can be fed into a previously developed algorithmic technique for compositional verification of control-flow temporal safety properties, so that the properties to be verified are iteratively decomposed into simpler ones over orthogonal parts of the SPL, and are not re-verified over the shared parts. We provide tool support for our technique, and evaluate our tool on a small but realistic SPL of cash desks.

Quantum-dot based ultrafast photoconductive antennae for efficient THz radiation

Here we overview our work on quantum dot based THz photoconductive antennae, capable of being pumped at very high optical intensities of higher than 1W optical mean power, i.e. about 50 times higher than the conventional LT-GaAs based antennae. Apart from high thermal tolerance, defect-free GaAs crystal layers in an InAs:GaAs quantum dot structure allow high carrier mobility and ultra-short photo carrier lifetimes simultaneously. Thus, they combine the advantages and lacking the disadvantages of GaAs and LT-GaAs, which are the most popular materials so far, and thus can be used for both CW and pulsed THz generation. By changing quantum dot size, composition, density of dots and number of quantum dot layers, the optoelectronic properties of the overall structure can be set over a reasonable range-compact semiconductor pump lasers that operate at wavelengths in the region of 1.0 μm to 1.3 μm can be used. InAs:GaAs quantum dot-based antennae samples show no saturation in pulsed THz generation for all average pump powers up to 1W focused into 30 μm spot. Generated THz power is super-linearly proportional to laser pump power. The generated THz spectrum depends on antenna design and can cover from 150 GHz up to 1.5 THz.