Travelling salesman problem tools for microcomputers

The problem of determining minimum total distance to be travelled by a salesman, who is to visit given cities each only once (i.e. the travelling salesman problem) is one of the most studied problems in computational mathematics. Finding an exact solution is not only intractably difficult, but also exceedingly costly. However, we implemented efficient optimal algorithms for both symmetric and asymmetric distance problems. The programs implemented can solve problems up to 180 cities in reasonable computer time.     

Dopamine release during ethanol drinking in AA rats

The dopamine overflow in the nucleus accumbens of rats from the high alcohol drinking AA line was measured by microdialysis before, during, and after one-half hour sessions of cued drinking of ethanol flavored with saccharin and peppermint or, as a control, saccharin-peppermint drinking. The animals had had extensive previous experience with ethanol drinking. Self-administration of the ethanol solution did not raise the dopamine level substantially: there was a small (17%) but significant increase only during the first 10 min after the onset of drinking. Giving the rats a cue for ethanol, which was part of their daily routine drinking regime, did not raise the dopamine level before ethanol was presented to the rats (i.e., during "anticipation"). The results are consistent with our previous studies showing a lack of a large ethanol-induced dopamine response in rats with previous experience of drinking ethanol and with the idea that although dopamine may play some role in alcohol drinking, it is not the central substrate producing the reinforcement from ethanol in AA rats.     

A coarse-grain reconfigurable architecture for multimedia applications supporting subword and floating-point calculations

Signal processors exploiting ASIC acceleration suffer from sky-rocketing manufacturing costs and long design cycles. FPGA-based systems provide a programmable alternative for exploiting computation parallelism, but the flexibility they provide is not as high as in processor-oriented architectures: HDL or C-to-HDL flows still require specific expertise and a hardware knowledge background. On the other hand, the large size of the configuration bitstream and the inherent complexity of FPGA devices make their dynamic reconfiguration not a very viable approach. Coarse-grained reconfigurable architectures (CGRAs) are an appealing solution but they pose implementation problems and tend to be application specific. This paper presents a scalable CGRA which eases the implementation of algorithms on field programmable gate array (FPGA) platforms. This design option is based on two levels of programmability: it takes advantage of performance and reliability provided by state-of-the-art FPGA technology, and at the same time it provides the user with flexibility, performance and ease of reconfiguration typical of standard CGRAs. The basic cell template provides advanced features such as sub-word SIMD integer and floating-point computation capabilities, as well as saturating arithmetic. Multiple reconfiguration contexts and partial run-time reconfiguration capabilities are provided, tackling this way the problem of high reconfiguration overhead typical of FPGAs. Selected instances of the proposed architecture have been implemented on an Altera Stratix II EP2S180 FPGA. On this system, we mapped some common DSP, image processing, 3D graphics and audio compression algorithms in order to validate our approach and to demonstrate its effectiveness by benchmarking the benefits achieved.     

Characterization and properties of metallic iron nanoparticles: spectroscopy, electrochemistry, and kinetics

There are reports that nano-sized zero-valent iron (Fe0) exhibits greater reactivity than micro-sized particles of Fe0, and it has been suggested that the higher reactivity of nano-Fe0 may impart advantages for groundwater remediation or other environmental applications. However, most of these reports are preliminary in that they leave a hostof potentiallysignificant(and often challenging) material or process variables either uncontrolled or unresolved. In an effort to better understand the reactivity of nano-Fe0, we have used a variety of complementary techniques to characterize two widely studied nano-Fe0 preparations: one synthesized by reduction of goethite with heat and H2 (Fe(H2)) and the other by reductive precipitation with borohydride (Fe(BH)). Fe(H2) is a two-phase material consisting of 40 nm alpha-Fe0 (made up of crystals approximately the size of the particles) and Fe3O4 particles of similar size or larger containing reduced sulfur; whereas Fe(BH) is mostly 20-80 nm metallic Fe particles (aggregates of <1.5 nm grains) with an oxide shell/coating that is high in oxidized boron. The FeBH particles further aggregate into chains. Both materials exhibit corrosion potentials that are more negative than nano-sized Fe2O3, Fe3O4, micro-sized Fe0, or a solid Fe0 disk, which is consistent with their rapid reduction of oxygen, benzoquinone, and carbon tetrachloride. Benzoquinone-which presumably probes inner-sphere surface reactions-reacts more rapidly with FeBH than Fe(H2), whereas carbon tetrachloride reacts at similar rates with FeBH and Fe(H2), presumably by outer-sphere electron transfer. Both types of nano-Fe0 react more rapidlythan micro-sized Fe0 based on mass-normalized rate constants, but surface area-normalized rate constants do not show a significant nano-size effect. The distribution of products from reduction of carbon tetrachloride is more favorable with Fe(H2), which produces less chloroform than reaction with Fe(BH).     

Nature and Criteria of Systems Models in the Social Sciences

Abstract

This paper is an attempt to present an overview of the various meanings in which the concept of model is being employed in scientific literature. Particular emphasis is laid upon systems models and their characteristic features from the viewpoint of social science applications. The criteria of models in the pursuit of such classic goals as explanation and prediction are discussed. It turns out that the criteria of goodness of models should be different in explanation, prediction and action (or policy-making). It is argued that the organizational aspects of models deserve a careful attention because much of what is known about social reality is related to organization. Furthermore, most of what can be done about social reality is concerned with the component coupling structure of systems. Some illustrations from the social science literature are discussed in order to support the arguments of the paper.     

Thermodynamic Evaluation of Inclusions Formation and Behaviour in Steels during Casting and Solidification

For demanding applications high steel cleanliness and strictly controlled inclusions are required. Primary inclusions are formed during steel treatments in the ladle. Most of these are removed to the ladle slag or on the lining. However, the rest of the inclusions still remain through the successive process stages, and additionally new inclusions are formed during casting and solidification due to decreasing thermodynamic solubility of oxygen in the steel at lower temperatures, reactions with surrounding slag, refractory materials and eventual contact with air. Inclusions formation and transformation are simulated by thermodynamic calculations in the steel/inclusions/slag system taking into account the solidification phenomena. In this paper inclusions in Si/Mn‐deoxidised steel and Al‐deoxidised Ca‐treated steels are contributed. Calculations are compared with experimental results from steel plants.     

High-level parameterizable area estimation modeling for ASIC designs

Architectural design space exploration and early area budgeting for ASIC and IP block development require accurate high level gate count estimation methods without requiring the hardware being fully specified. The proposed method uses hierarchical and parameterizable models requiring minimal amount of information about the implementation technology to meet this goal. The modeling process flow is to: (1) create a block diagram of the design, (2) create a model for each block, and (3) sum up estimates of all sub-blocks by supplying the correct parameters to each sub-model. We discuss the model creation for a few parameterized library blocks as well as three communication blocks and a processor core from real IC projects ranging from 22 to 250 kgates. The average relative estimation error of the proposed method for the library blocks is 3.2% and for the real world examples 4.0%. The best application of this method is early in the design phase when different implementation architectures are compared.     

The development of a multicenter database for reference values in clinical neurophysiology--principles and examples

This paper describes the work undertaken to establish principles for the development of multicenter databases for reference values in clinical neurophysiology. The study was initiated because of interest of the involved laboratories in knowledge-based systems in electromyographic diagnosis, for which it was necessary to formalize the key concepts in the diagnostic process: diseases, pathophysiology and test results. The paper deals specifically with the structuring of results of motor and sensory nerve conduction studies.     

BeTelGeuse: A Platform for Gathering and Processing Situational Data

BeTelGeuse is an extensible data collection platform for mobile devices, which also automatically infers higher level context from sensor data. In this article, the authors introduce BeTelGeuse's architecture and current features, and evaluate its impact on mobile phone performance.     

A dynamic fixed windowing problem

Given a point set in the plane and a fixed planar region (window) a window query consists of enumerating the points in a translate of the region. A recently presented result demonstrates that there is astatic data structure, of optimal size, that solves window queries for convex regions in optimal time. We give a data structure, of optimal size, that not only supports window queries in optimal time for, possibly nonconvex, polygonal windows, but also allows updating of the point set in optimal time.