Evidence for divided automatic attention

A long-standing debate in the literature is whether attention can form two or more independent spatial foci in addition to the well-known unique spatial focus. There is evidence that voluntary visual attention divides in space. The possibility that this also occurs for automatic visual attention was investigated here. Thirty-six female volunteers were tested. In each trial, a prime stimulus was presented in the left or right visual hemifield. This stimulus was characterized by the blinking of a superior, middle or inferior ring, the blinking of all these rings, or the blinking of the superior and inferior rings. A target stimulus to which the volunteer should respond with the same side hand or a target stimulus to which she should not respond was presented 100 ms later in a primed location, a location between two primed locations or a location in the contralateral hemifield. Reaction time to the positive target stimulus in a primed location was consistently shorter than reaction time in the horizontally corresponding contralateral location. This attentional effect was significantly smaller or absent when the positive target stimulus appeared in the middle location after the double prime stimulus. These results suggest that automatic visual attention can focus on two separate locations simultaneously, to some extent sparing the region in between.

Characterizing chaotic melodies in automatic music composition

In this paper, we initially present an algorithm for automatic composition of melodies using chaotic dynamical systems. Afterward, we characterize chaotic music in a comprehensive way as comprising three perspectives: musical discrimination, dynamical influence on musical features, and musical perception. With respect to the first perspective, the coherence between generated chaotic melodies (continuous as well as discrete chaotic melodies) and a set of classical reference melodies is characterized by statistical descriptors and melodic measures. The significant differences among the three types of melodies are determined by discriminant analysis. Regarding the second perspective, the influence of dynamical features of chaotic attractors, e.g., Lyapunov exponent, Hurst coefficient, and correlation dimension, on melodic features is determined by canonical correlation analysis. The last perspective is related to perception of originality, complexity, and degree of melodiousness (Euler's gradus suavitatis) of chaotic and classical melodies by nonparametric statistical tests. (c) 2010 American Institute of Physics. [doi: 10.1063/1.3487516]

A Goldstone theorem in thermal relativistic quantum field theory

We prove a Goldstone theorem in thermal relativistic quantum field theory, which relates spontaneous symmetry breaking to the rate of spacelike decay of the two-point function. The critical rate of fall-off coincides with that of the massless free scalar field theory. Related results and open problems are briefly discussed. (C) 2011 American Institute of Physics. [doi:10.1063/1.3526961]

Automatic Network Fingerprinting through Single-Node Motifs

Complex networks have been characterised by their specific connectivity patterns (network motifs), but their building blocks can also be identified and described by node-motifs-a combination of local network features. One technique to identify single node-motifs has been presented by Costa et al. (L. D. F. Costa, F. A. Rodrigues, C. C. Hilgetag, and M. Kaiser, Europhys. Lett., 87, 1, 2009). Here, we first suggest improvements to the method including how its parameters can be determined automatically. Such automatic routines make high-throughput studies of many networks feasible. Second, the new routines are validated in different network-series. Third, we provide an example of how the method can be used to analyse network time-series. In conclusion, we provide a robust method for systematically discovering and classifying characteristic nodes of a network. In contrast to classical motif analysis, our approach can identify individual components (here: nodes) that are specific to a network. Such special nodes, as hubs before, might be found to play critical roles in real-world networks.

An algorithmic Friedman-Pippenger theorem on tree embeddings and applications

An (n, d)-expander is a graph G = (V, E) such that for every X subset of V with vertical bar X vertical bar <= 2n - 2 we have vertical bar Gamma(G)(X) vertical bar >= (d + 1) vertical bar X vertical bar. A tree T is small if it has at most n vertices and has maximum degree at most d. Friedman and Pippenger (1987) proved that any ( n; d)- expander contains every small tree. However, their elegant proof does not seem to yield an efficient algorithm for obtaining the tree. In this paper, we give an alternative result that does admit a polynomial time algorithm for finding the immersion of any small tree in subgraphs G of (N, D, lambda)-graphs Lambda, as long as G contains a positive fraction of the edges of Lambda and lambda/D is small enough. In several applications of the Friedman-Pippenger theorem, including the ones in the original paper of those authors, the (n, d)-expander G is a subgraph of an (N, D, lambda)-graph as above. Therefore, our result suffices to provide efficient algorithms for such previously non-constructive applications. As an example, we discuss a recent result of Alon, Krivelevich, and Sudakov (2007) concerning embedding nearly spanning bounded degree trees, the proof of which makes use of the Friedman-Pippenger theorem. We shall also show a construction inspired on Wigderson-Zuckerman expander graphs for which any sufficiently dense subgraph contains all trees of sizes and maximum degrees achieving essentially optimal parameters. Our algorithmic approach is based on a reduction of the tree embedding problem to a certain on-line matching problem for bipartite graphs, solved by Aggarwal et al. (1996).

A NEW PROOF OF OKAJI'S THEOREM FOR A CLASS OF SUM OF SQUARES OPERATORS

Let P be a linear partial differential operator with analytic coefficients. We assume that P is of the form ""sum of squares"", satisfying Hormander's bracket condition. Let q be a characteristic point; for P. We assume that q lies on a symplectic Poisson stratum of codimension two. General results of Okaji Show that P is analytic hypoelliptic at q. Hence Okaji has established the validity of Treves' conjecture in the codimension two case. Our goal here is to give a simple, self-contained proof of this fact.

SAB(IO): A BIOLOGICALLY PLAUSIBLE CONNECTIONIST APPROACH TO AUTOMATIC TEXT SUMMARIZATION

An implementation of a computational tool to generate new summaries from new source texts is presented, by means of the connectionist approach (artificial neural networks). Among other contributions that this work intends to bring to natural language processing research, the use of a more biologically plausible connectionist architecture and training for automatic summarization is emphasized. The choice relies on the expectation that it may bring an increase in computational efficiency when compared to the sa-called biologically implausible algorithms.

An algorithm for computerized automatic tuning of power system stabilizers

The main objective of this paper is to relieve the power system engineers from the burden of the complex and time-consuming process of power system stabilizer (PSS) tuning. To achieve this goal, the paper proposes an automatic process for computerized tuning of PSSs, which is based on an iterative process that uses a linear matrix inequality (LMI) solver to find the PSS parameters. It is shown in the paper that PSS tuning can be written as a search problem over a non-convex feasible set. The proposed algorithm solves this feasibility problem using an iterative LMI approach and a suitable initial condition, corresponding to a PSS designed for nominal operating conditions only (which is a quite simple task, since the required phase compensation is uniquely defined). Some knowledge about the PSS tuning is also incorporated in the algorithm through the specification of bounds defining the allowable PSS parameters. The application of the proposed algorithm to a benchmark test system and the nonlinear simulation of the resulting closed-loop models demonstrate the efficiency of this algorithm. (C) 2009 Elsevier Ltd. All rights reserved.

Automatic tuning method for the design of supplementary damping controllers for flexible alternating current transmission system devices

The design of supplementary damping controllers to mitigate the effects of electromechanical oscillations in power systems is a highly complex and time-consuming process, which requires a significant amount of knowledge from the part of the designer. In this study, the authors propose an automatic technique that takes the burden of tuning the controller parameters away from the power engineer and places it on the computer. Unlike other approaches that do the same based on robust control theories or evolutionary computing techniques, our proposed procedure uses an optimisation algorithm that works over a formulation of the classical tuning problem in terms of bilinear matrix inequalities. Using this formulation, it is possible to apply linear matrix inequality solvers to find a solution to the tuning problem via an iterative process, with the advantage that these solvers are widely available and have well-known convergence properties. The proposed algorithm is applied to tune the parameters of supplementary controllers for thyristor controlled series capacitors placed in the New England/New York benchmark test system, aiming at the improvement of the damping factor of inter-area modes, under several different operating conditions. The results of the linear analysis are validated by non-linear simulation and demonstrate the effectiveness of the proposed procedure.

AUTOMATIC CORONARY WALL SEGMENTATION IN INTRAVASCULAR ULTRASOUND IMAGES USING BINARY MORPHOLOGICAL RECONSTRUCTION

Intravascular ultrasound (IVUS) image segmentation can provide more detailed vessel and plaque information, resulting in better diagnostics, evaluation and therapy planning. A novel automatic segmentation proposal is described herein; the method relies on a binary morphological object reconstruction to segment the coronary wall in IVUS images. First, a preprocessing followed by a feature extraction block are performed, allowing for the desired information to be extracted. Afterward, binary versions of the desired objects are reconstructed, and their contours are extracted to segment the image. The effectiveness is demonstrated by segmenting 1300 images, in which the outcomes had a strong correlation to their corresponding gold standard. Moreover, the results were also corroborated statistically by having as high as 92.72% and 91.9% of true positive area fraction for the lumen and media adventitia border, respectively. In addition, this approach can be adapted easily and applied to other related modalities, such as intravascular optical coherence tomography and intravascular magnetic resonance imaging. (E-mail: matheuscardosomg@hotmail.com) (C) 2011 World Federation for Ultrasound in Medicine & Biology.

Listeria monocytogenes in two different poultry facilities: Manual and automatic evisceration

Listeriosis is a serious foodborne disease caused by Listeria monocytogenes, a pathogen often found in food processing plants. Poultry meat and its derivatives may harbor L. monocytogenes even if good manufacturing practices are implanted in abattoirs. Little information exists in Brazil on the frequency of L. monocytogenes contamination, even though the country is considered the top poultry meat exporter in the world. This study attempted to compare 2 exporters poultry facilities following same the standards but differing only in manual (plant M) or automatic (plant A) evisceration. Eight hundred fifty-one samples from food, food contact and non-food contact surfaces, water, and workers` hands were collected from cage to finished products over a 1-yr period. In plant A, 20.1% of the samples were positive for L. monocytogenes, whereas in plant M, 16.4% was found. The greatest incidence of contamination with the pathogen in plant A was found in non- food contact surfaces (27.3%), while in plant M, it was found in products (19.4%). The most prevalent serovars were 1/2a or 3a (plant M) and 4b, 4d, or 4e (plant A). Despite having proper hygiene and good manufacturing practices, controlling the entry and persistence of L. monocytogenes in processing facilities remains a formidable task.

On the Jager-Kaul theorem concerning harmonic maps

In 1983, Jager and Kaul proved that the equator map u*(x) = (x/\x\,0) : B-n --> S-n is unstable for 3 less than or equal to n less than or equal to 6 and a minimizer for the energy functional E(u, B-n) = integral B-n \del u\(2) dx in the class H-1,H-2(B-n, S-n) with u = u* on partial derivative B-n when n greater than or equal to 7. In this paper, we give a new and elementary proof of this Jager-Kaul result. We also generalize the Jager-Kaul result to the case of p-harmonic maps.

Exponential Rates of Convergence in the Ergodic Theorem: A Constructive Approach

We prove that, once an algorithm of perfect simulation for a stationary and ergodic random field F taking values in S(Zd), S a bounded subset of R(n), is provided, the speed of convergence in the mean ergodic theorem occurs exponentially fast for F. Applications from (non-equilibrium) statistical mechanics and interacting particle systems are presented.

Multifidus muscle recovery is not automatic after resolution of acute, first-episode low back pain

Study Design. A clinical study was conducted on 39 patients with acute, first-episode, unilateral low back pain and unilateral, segmental inhibition of the multifidus muscle. Patients were allocated randomly to a control or treatment group. Objectives. To document the natural course of lumbar multifidus recovery and to evaluate the effectiveness of specific, localized, exercise therapy on muscle recovery. Summary of Background Data. Acute low back pain usually resolves spontaneously, but the recurrence rate is high. Inhibition of multifidus occurs with acute, first-episode, low back pain, and pathologic changes in this muscle have been linked with poor outcome and recurrence of symptoms. Methods. Patients in group 1 received medical treatment only. Patients in group 2 received medical treatment and specific, localized, exercise therapy. Outcome measures for both groups included 4 weekly assessments of pain, disability, range of motion, and size of the multifidus cross-sectional area. Independent examiners were blinded to group allocation. Patients were reassessed at a 10-week follow-up examination. Results. Multifidus muscle recovery was not spontaneous on remission of painful symptoms in patients in group 1. Muscle recovery was more rapid and more complete in patients in group 2 who received exercise therapy (P = 0.0001). Other outcome measurements were similar for the two groups at the 4-week examination. Although they resumed normal levels of activity, patients in group 1 still had decreased multifidus muscle size at the 10-week follow-up examination. Conclusions. Multifidus muscle recovery is not spontaneous on remission of painful symptoms. Lack of localized, muscle support may be one reason for the high recurrence rate of low back pain following the initial episode.