Gel permeation chromatography: Automatic data acquisition and reduction in real-time with a process computer

A real-time computer system is described which minimizes the total analysis time in gel permeation chromatography by automatically acquiring the data, performing the necessary calculations and displaying the molecular weight distribution and molecular weight averages as soon as the polymer peak has eluted. The calculation method described here is valid for linear homopolymers only, and does not include corrections for instrumental peak broadening. The experimental results show good reproducibility and precision. On-line changes of the constants and other parameters may be implemented by means of an auxiliary program which runs in parallel with the data analysis program. A system such as that described here is suitable for utilization as a measurement technique in process control applications. The programs are written in CORAL 66 for a Ferranti Argus 700 E computer.     

Approximate similarity search for online multimedia services on distributed CPU–GPU platforms

Similarity search in high-dimensional spaces is a pivotal operation for several database applications, including online content-based multimedia services. With the increasing popularity of multimedia applications, these services are facing new challenges regarding (1) the very large and growing volumes of data to be indexed/searched and (2) the necessity of reducing the response times as observed by end-users. In addition, the nature of the interactions between users and online services creates fluctuating query request rates throughout execution, which requires a similarity search engine to adapt to better use the computation platform and minimize response times. In this work, we address these challenges with Hypercurves, a flexible framework for answering approximate k-nearest neighbor (kNN) queries for very large multimedia databases. Hypercurves executes in hybrid CPU–GPU environments and is able to attain massive query-processing rates through the cooperative use of these devices. Hypercurves also changes its CPU–GPU task partitioning dynamically according to the observed load, aiming for optimal response times. In our empirical evaluation, dynamic task partitioning reduced query response times by approximately 50 % compared to the best static task partition. Due to a probabilistic proof of equivalence to the sequential kNN algorithm, the CPU–GPU execution of Hypercurves in distributed (multi-node) environments can be aggressively optimized, attaining superlinear scalability while still guaranteeing, with high probability, results at least as good as those from the sequential algorithm.     

Mechanisms and conditions that affect phase inversion processes: A review

The phenomenon of phase inversion occurs in liquid‐liquid dispersions found in a variety of chemical engineering fields. From simple oil‐water mixtures to complex polymeric systems, the operating variables that affect this physical phenomenon are discussed in this work. The contribution on this matter by a large number of researchers is critically assessed, outlining both coherent and conflicting results. A detailed review of the mechanisms by which phase inversion takes place is also provided. While this subject has been studied for the past 50 years, this multivariate nonlinear process is not yet comprehensively understood, and this review article aims to describe the conclusions so far reached to provide insight for future research.     

A probabilistic alternative to regression suites

Automated regression suites are essential in developing large applications, while maintaining reasonable quality and timetables. The main argument against the automation of regression suites, in addition to the cost of creation and maintenance, is the observation that if you run the same test many times, it becomes increasingly less likely to find bugs. To alleviate such problems, a new regression suite practice, using random test generators to create regression suites on-the-fly, is becoming more common. In this practice, instead of maintaining tests, we generate test suites on-the-fly by choosing several specifications and generating a number of tests from each specification.     

Automatic boosting of cross-product coverage using Bayesian networks

Closing the feedback loop from coverage data to the stimuli generator is one of the main challenges in the verification process. Typically, verification engineers with deep domain knowledge manually prepare a set of stimuli generation directives for that purpose. Bayesian networks based CDG (coverage directed generation) systems have been successfully used to assist the process by automatically closing this feedback loop. However, constructing these CDG systems requires manual effort and a certain amount of domain knowledge from a machine learning specialist. We propose a new method that boosts coverage in the early stages of the verification process with minimal effort, namely a fully automatic construction of a CDG system that requires no domain knowledge. Experimental results on a real-life cross-product coverage model demonstrate the efficiency of the proposed method.     

A systematic mapping study of software product lines testing

Context

In software development, Testing is an important mechanism both to identify defects and assure that completed products work as specified. This is a common practice in single-system development, and continues to hold in Software Product Lines (SPL). Even though extensive research has been done in the SPL Testing field, it is necessary to assess the current state of research and practice, in order to provide practitioners with evidence that enable fostering its further development.

Objective

This paper focuses on Testing in SPL and has the following goals: investigate state-of-the-art testing practices, synthesize available evidence, and identify gaps between required techniques and existing approaches, available in the literature.

Method

A systematic mapping study was conducted with a set of nine research questions, in which 120 studies, dated from 1993 to 2009, were evaluated.

Results

Although several aspects regarding testing have been covered by single-system development approaches, many cannot be directly applied in the SPL context due to specific issues. In addition, particular aspects regarding SPL are not covered by the existing SPL approaches, and when the aspects are covered, the literature just gives brief overviews. This scenario indicates that additional investigation, empirical and practical, should be performed.

Conclusion

The results can help to understand the needs in SPL Testing, by identifying points that still require additional investigation, since important aspects regarding particular points of software product lines have not been addressed yet.     

On the Wyner-Ziv problem for individual sequences

We consider a variation of the Wyner-Ziv (W-Z) problem pertaining to lossy compression of individual sequences using finite-state encoders and decoders. There are two main results in this paper. The first characterizes the relationship between the performance of the best M-state encoder-decoder pair to that of the best block code of size /spl lscr/ for every input sequence, and shows that the loss of the latter relative to the former (in terms of both rate and distortion) never exceeds the order of (logM)//spl lscr/, independently of the input sequence. Thus, in the limit of large M, the best rate-distortion performance of every infinite source sequence can be approached universally by a sequence of block codes (which are also implementable by finite-state machines). While this result assumes an asymptotic regime where the number of states is fixed, and only the length n of the input sequence grows without bound, we then consider the case where the number of states M=M/sub n/ is allowed to grow concurrently with n. Our second result is then about the critical growth rate of M/sub n/ such that the rate-distortion performance of M/sub n/-state encoder-decoder pairs can still be matched by a universal code. We show that this critical growth rate of M/sub n/ is linear in n.     

Impairment in long-term retention but not short-term performance on a water maze reversal task following hippocampal or mediodorsal striatal n-methyl-d-aspartate receptor blockade.

Male Long-Evans rats were injected with 32 ng/μl of the N-methyl-D-aspartate (NMDA) receptor antagonist 3-(2-carboxypiperazin-4-yl) propyl-1-phosphonic acid (CPP) or vehicle and trained to locate a hidden platform in a different location (reversal training) than used on the initial 4 days of training. Rats treated with vehicle or CPP into the dorsal hippocampus, basolateral amygdala, or mediodorsal striatum had similar latencies to locate the platform on the reversal day. Rats infused with CPP into the dorsal hippocampus or mediodorsal striatum failed to search preferentially in the novel location during a 24-hr, drug-free retention test, whereas all other groups searched preferentially in this location. Therefore, blocking dorsal hippocampal or mediodorsal striatal NMDA receptors selectively blocked long-term spatial retention without producing short-term performance deficits. (PsycINFO Database Record (c) 2010 APA, all rights reserved)