Looking at the Gregory-Laflamme instability through quasinormal modes

We study evolution of gravitational perturbations of black strings. It is well known that for all wave numbers less than some threshold value, the black string is unstable against the scalar type of gravitational perturbations, which is named the Gregory-Laflamme instability. Using numerical methods, we find the quasinormal modes and time-domain profiles of the black string perturbations in the stable sector and also show the appearance of the Gregory-Laflamme instability in the time domain. The dependence of the black string quasinormal spectrum and late-time tails on such parameters as the wave vector and the number of extra dimensions is discussed. There is numerical evidence that at the threshold point of instability, the static solution of the wave equation is dominant. For wave numbers slightly larger than the threshold value, in the region of stability, we see tiny oscillations with very small damping rate. While, for wave numbers slightly smaller than the threshold value, in the region of the Gregory-Laflamme instability, we observe tiny oscillations with very small growth rate. We also find the level crossing of imaginary part of quasinormal modes between the fundamental mode and the first overtone mode, which accounts for the peculiar time domain profiles.

Evolution of perturbations of squashed Kaluza-Klein black holes: Escape from instability

The squashed Kaluza-Klien (KK) black holes differ from the Schwarzschild black holes with asymptotic flatness or the black strings even at energies for which the KK modes are not excited yet, so that squashed KK black holes open a window in higher dimensions. Another important feature is that the squashed KK black holes are apparently stable and, thereby, let us avoid the Gregory-Laflamme instability. In the present paper, the evolution of scalar and gravitational perturbations in time and frequency domains is considered for these squashed KK black holes. The scalar field perturbations are analyzed for general rotating squashed KK black holes. Gravitational perturbations for the so-called zero mode are shown to be decayed for nonrotating black holes, in concordance with the stability of the squashed KK black holes. The correlation of quasinormal frequencies with the size of extra dimension is discussed.

Closing the window on strongly interacting dark matter with IceCube

We use the recent results on dark matter searches of the 22-string IceCube detector to probe the remaining allowed window for strongly interacting dark matter in the mass range 10(4) < m(X) < 10(15) GeV. We calculate the expected signal in the 22-string IceCube detector from the annihilation of such particles captured in the Sun and compare it to the detected background. As a result, the remaining allowed region in the mass versus cross section parameter space is ruled out. We also show the expected sensitivity of the complete IceCube detector with 86 strings.

Social interaction as a heuristic for combinatorial optimization problems

We investigate the performance of a variant of Axelrod's model for dissemination of culture-the Adaptive Culture Heuristic (ACH)-on solving an NP-Complete optimization problem, namely, the classification of binary input patterns of size F by a Boolean Binary Perceptron. In this heuristic, N agents, characterized by binary strings of length F which represent possible solutions to the optimization problem, are fixed at the sites of a square lattice and interact with their nearest neighbors only. The interactions are such that the agents' strings (or cultures) become more similar to the low-cost strings of their neighbors resulting in the dissemination of these strings across the lattice. Eventually the dynamics freezes into a homogeneous absorbing configuration in which all agents exhibit identical solutions to the optimization problem. We find through extensive simulations that the probability of finding the optimal solution is a function of the reduced variable F/N(1/4) so that the number of agents must increase with the fourth power of the problem size, N proportional to F(4), to guarantee a fixed probability of success. In this case, we find that the relaxation time to reach an absorbing configuration scales with F(6) which can be interpreted as the overall computational cost of the ACH to find an optimal set of weights for a Boolean binary perceptron, given a fixed probability of success.

Gravitational quasinormal modes of AdS black branes in d spacetime dimensions

The AdS/CFT duality has established a mapping between quantities in the bulk AdS black-hole physics and observables in a boundary finite-temperature field theory. Such a relationship appears to be valid for an arbitrary number of spacetime dimensions, extrapolating the original formulations of Maldacena`s correspondence. In the same sense properties like the hydrodynamic behavior of AdS black-hole fluctuations have been proved to be universal. We investigate in this work the complete quasinormal spectra of gravitational perturbations of d-dimensional plane-symmetric AdS black holes (black branes). Holographically the frequencies of the quasinormal modes correspond to the poles of two-point correlation functions of the field-theory stress-energy tensor. The important issue of the correct boundary condition to be imposed on the gauge-invariant perturbation fields at the AdS boundary is studied and elucidated in a fully d-dimensional context. We obtain the dispersion relations of the first few modes in the low-, intermediate- and high-wavenumber regimes. The sound-wave (shear-mode) behavior of scalar (vector)-type low- frequency quasinormal mode is analytically and numerically confirmed. These results are found employing both a power series method and a direct numerical integration scheme.

Discourse priming of homophones in individuals with dominant subcortical lesions, cortical lesions, and Parkinson’s disease

An on-line priming experiment was used to investigate discourse-level processing in four matched groups of subjects: individuals with nonthalamic subcortical lesions (NSL) ( n =10), normal control subjects ( n =10), subjects with Parkinsons disease (PD) ( n =10), and subjects with cortical lesions ( n =10). Subjects listened to paragraphs that ended in lexical ambiguities, and then made speeded lexical decisions on visual letter strings that were: nonwords, matched control words, contextually appropriate associates of the lexical ambiguity, contextually inappropriate associates of the ambiguity, and inferences (representing information which could be drawn from the paragraphs but was not explicitly stated). Targets were presented at an interstimulus interval (ISI) of 0 or 1000ms. NSL and PD subjects demonstrated priming for appropriate and inappropriate associates at the short ISI, similar to control subjects and cortical lesion subjects, but were unable to demonstrate selective priming of the appropriate associate and inference words at the long ISI. These results imply intact automatic lexical processing and a breakdown in discourse-based meaning selection and inference development via attentional/strategic mechanisms.

On learning context-free and context-sensitive languages

The long short-term memory (LSTM) is not the only neural network which learns a context sensitive language. Second-order sequential cascaded networks (SCNs) are able to induce means from a finite fragment of a context-sensitive language for processing strings outside the training set. The dynamical behavior of the SCN is qualitatively distinct from that observed in LSTM networks. Differences in performance and dynamics are discussed.

Database technologies for l-system simulations in virtual plant applications on bioinformatics

One of the most important advantages of database systems is that the underlying mathematics is rich enough to specify very complex operations with a small number of statements in the database language. This research covers an aspect of biological informatics that is the marriage of information technology and biology, involving the study of real-world phenomena using virtual plants derived from L-systems simulation. L-systems were introduced by Aristid Lindenmayer as a mathematical model of multicellular organisms. Not much consideration has been given to the problem of persistent storage for these simulations. Current procedures for querying data generated by L-systems for scientific experiments, simulations and measurements are also inadequate. To address these problems the research in this paper presents a generic process for data-modeling tools (L-DBM) between L-systems and database systems. This paper shows how L-system productions can be generically and automatically represented in database schemas and how a database can be populated from the L-system strings. This paper further describes the idea of pre-computing recursive structures in the data into derived attributes using compiler generation. A method to allow a correspondence between biologists' terms and compiler-generated terms in a biologist computing environment is supplied. Once the L-DBM gets any specific L-systems productions and its declarations, it can generate the specific schema for both simple correspondence terminology and also complex recursive structure data attributes and relationships.

Type checking cryptography implementations

Cryptographic software development is a challenging eld: high performance must be achieved, while ensuring correctness and com- pliance with low-level security policies. CAO is a domain speci c language designed to assist development of cryptographic software. An important feature of this language is the design of a novel type system introducing native types such as prede ned sized vectors, matrices and bit strings, residue classes modulo an integer, nite elds and nite eld extensions, allowing for extensive static validation of source code. We present the formalisation, validation and implementation of this type system

EVIV: An end-to-end verifiable Internet voting system

Traditionally, a country's electoral system requires the voter to vote at a specific day and place, which conflicts with the mobility usually seen in modern live styles. Thus, the widespread of Internet (mobile) broadband access can be seen as an opportunity to deal with this mobility problem, i.e. the adoption of an Internet voting system can make the live of voter's much more convenient; however, a widespread Internet voting systems adoption relies on the ability to develop trustworthy systems, i.e. systems that are verifiable and preserve the voter's privacy. Building such a system is still an open research problem. Our contribution is a new Internet voting system: EVIV, a highly sound End-to-end Verifiable Internet Voting system, which offers full voter's mobility and preserves the voter's privacy from the vote casting PC even if the voter votes from a public PC, such as a PC at a cybercafe or at a public library. Additionally, EVIV has private vote verification mechanisms, in which the voter just has to perform a simple match of two small strings (4-5 alphanumeric characters), that detect and protect against vote manipulations both at the insecure vote client platform and at the election server side. (c) 2012 Elsevier Ltd. All rights reserved.

Principais dificuldades que os alunos de viola de arco apresentam quando ingressam no ensino superior português: relatório de estágio

A maioria dos instrumentistas de cordas friccionadas apresentam problemas ou dificuldades ao longo de toda a sua aprendizagem musical. Como professora e violetista, realizei este relatório de estágio com o intuito de pesquisar onde se focam a maioria desses problemas. Este relatório de estágio está dividido em duas diferentes secções, a primeira apresenta todo o trabalho pedagógico efectuado com três diferentes alunos, de diferentes níveis ao longo do ano lectivo de 2012/13 na Fundação Musical dos Amigos das Crianças (FMAC), e a segunda apresenta toda a investigação que realizei para concluir quais as principais dificuldades que os alunos de viola de arco apresentam quando ingressam no Ensino Superior. A investigação apresenta uma vasta pesquisa literária e o testemunho dos professores de várias instituições, como a Universidade do Minho, Escola Superior de Música e Artes de Espectáculo, Universidade de Aveiro, Escola Superior das Artes Aplicadas de Castelo Branco e Escola Superior de Música de Lisboa que ajudaram à profunda análise deste tema. Os resultados revelaram que os principais problemas apresentados nos estudantes de viola de arco são de origem técnica, ou seja, postura (posição do corpo, distribuição do peso correcto pelas pernas e escolha adequada do instrumento de acordo com a fisionomia do aluno); mão direita (pega correcta dos dedos no arco, distribuição de arco e contracção muscular); mão esquerda (posição do polegar, ombro e braço que afectam a afinação, flexibilidade, mudanças de posição e vibrato); influência da escolha do repertório por parte de um professor e autonomia do aluno.

Using an LED as a sensor and visible light communication device in a smart illumination system

The need for more efficient illumination systems has led to the proliferation of Solid-State Lighting (SSL) systems, which offer optimized power consumption. SSL systems are comprised of LED devices which are intrinsically fast devices and permit very fast light modulation. This, along with the congestion of the radio frequency spectrum has paved the path for the emergence of Visible Light Communication (VLC) systems. VLC uses free space to convey information by using light modulation. Notwithstanding, as VLC systems proliferate and cost competitiveness ensues, there are two important aspects to be considered. State-of-the-art VLC implementations use power demanding PAs, and thus it is important to investigate if regular, existent Switched-Mode Power Supply (SMPS) circuits can be adapted for VLC use. A 28 W buck regulator was implemented using a off-the-shelf LED Driver integrated circuit, using both series and parallel dimming techniques. Results show that optical clock frequencies up to 500 kHz are achievable without any major modification besides adequate component sizing. The use of an LED as a sensor was investigated, in a short-range, low-data-rate perspective. Results show successful communication in an LED-to-LED configuration, with enhanced range when using LED strings as sensors. Besides, LEDs present spectral selective sensitivity, which makes them good contenders for a multi-colour LED-to-LED system, such as in the use of RGB displays and lamps. Ultimately, the present work shows evidence that LEDs can be used as a dual-purpose device, enabling not only illumination, but also bi-directional data communication.

Quantization of energy and writhe in self-repelling knots

Probably the most natural energy functional to be considered for knotted strings is that given by electrostatic repulsion. In the absence of counter-charges, a charged, knotted string evolving along the energy gradient of electrostatic repulsion would progressively tighten its knotted domain into a point on a perfectly circular string. However, in the presence of charge screening self-repelling knotted strings can be stabilized. It is known that energy functionals in which repulsive forces between repelling charges grow inversely proportionally to the third or higher power of their relative distance stabilize self-repelling knots. Especially interesting is the case of the third power since the repulsive energy becomes scale invariant and does not change upon Mobius transformations (reflections in spheres) of knotted trajectories. We observe here that knots minimizing their repulsive Mobius energy show quantization of the energy and writhe (measure of chirality) within several tested families of knots.

Description of microsatellite markers and genotyping performances using feathers and buccal swabs for the Ivory gull (Pagophila eburnea).

We report 22 new polymorphic microsatellites for the Ivory gull (Pagophila eburnea), and we describe how they can be efficiently co-amplified using multiplexed polymerase chain reactions. In addition, we report DNA concentration, amplification success, rates of genotyping errors and the number of genotyping repetitions required to obtain reliable data with three types of noninvasive or nondestructive samples: shed feathers collected in colonies, feathers plucked from living individuals and buccal swabs. In two populations from Greenland (n=21) and Russia (Severnaya Zemlya Archipelago, n=21), the number of alleles per locus varied between 2 and 17, and expected heterozygosity per population ranged from 0.18 to 0.92. Twenty of the markers conformed to Hardy-Weinberg and linkage equilibrium expectations. Most markers were easily amplified and highly reliable when analysed from buccal swabs and plucked feathers, showing that buccal swabbing is a very efficient approach allowing good quality DNA retrieval. Although DNA amplification success using single shed feathers was generally high, the genotypes obtained from this type of samples were prone to error and thus need to be amplified several times. The set of microsatellite markers described here together with multiplex amplification conditions and genotyping error rates will be useful for population genetic studies of the Ivory gull.

Algorithmic aspects of bio-inspired string operations

We present building blocks for algorithms for the efficient reduction of square factor, i.e. direct repetitions in strings. So the basic problem is this: given a string, compute all strings that can be obtained by reducing factors of the form zz to z. Two types of algorithms are treated: an offline algorithm is one that can compute a data structure on the given string in advance before the actual search for the square begins; in contrast, online algorithms receive all input only at the time when a request is made. For offline algorithms we treat the following problem: Let u and w be two strings such that w is obtained from u by reducing a square factor zz to only z. If we further are given the suffix table of u, how can we derive the suffix table for w without computing it from scratch? As the suffix table plays a key role in online algorithms for the detection of squares in a string, this derivation can make the iterated reduction of squares more efficient. On the other hand, we also show how a suffix array, used for the offline detection of squares, can be adapted to the new string resulting from the deletion of a square. Because the deletion is a very local change, this adaption is more eficient than the computation of the new suffix array from scratch.