arXiv papers from June 2011

Bernard Leikind

Dr. William Bruno asserts the well-known fact that cell phones radiate microwaves in the classical regime. This, he says, means that the photon energy is not relevant to assessing safety. Citing optical tweezers as an example of biologically relevant non-thermal effects of electromagnetic radiation, Bruno concludes that all other reports of non-thermal effec

David A. Siegel, Shuyun Zhou, Farid El Gabaly, Andreas K. Schmid

The crystallographic symmetries and spatial distribution of stacking domains in graphene films on SiC have been studied by low energy electron diffraction (LEED) and dark field imaging in a low energy electron microscope (LEEM). We find that the graphene diffraction spots from 2 and 3 atomic layers of graphene have 3-fold symmetry consistent with AB (Bernal)

T. J. Humanic

Identical neutral kaon pair correlations are measured in 7 TeV pp collisions in the ALICE experiment. K0s-K0s correlation functions are formed in 3 multiplicity X 4 kT bins. The femtoscopic kaon source parameters Rinv and lambda are extracted from these correlation functions by fitting a (femtoscopy) X (PYTHIA) model to them, PYTHIA accounting for the non-fl

Cheng Ling, Gabriel Setzler, Ming-Wei Lin, Kulwinder

A simple one-stage solution-based method was developed to produce graphene nanoribbons by sonicating graphite powder in organic solutions with polymer surfactant. The graphene nanoribbons were deposited on silicon substrate, and characterized by Raman spectroscopy and atomic force microscopy. Single-layer and few-layer graphene nanoribbons with a width rangi

Andrzej K. Brodzik, Robert H. Enders

The Dempster-Shafer theory of evidence accumulation is one of the main tools for combining data obtained from multiple sources. In this paper a special case of combination of two bodies of evidence with non-zero conflict coefficient is considered. It is shown that application of the Dempster-Shafer rule of combination in this case leads to an evaluation of m

Patrick L. Combettes, Jean-Christophe Pesquet

We propose a primal-dual splitting algorithm for solving monotone inclusions involving a mixture of sums, linear compositions, and parallel sums of set-valued and Lipschitzian operators. An important feature of the algorithm is that the Lipschitzian operators present in the formulation can be processed individually via explicit steps, while the set-valued op

M. Krzewicki

We report on the first measurements of elliptic and triangular flow for charged pions, kaons and anti-protons in lead-lead collisions at 2.76 TeV measured with the ALICE detector at the LHC. We compare the observed mass splitting of differential elliptic flow at LHC energies to RHIC measurements at lower energies and theory predictions. We test the quark coa

Peter Kevei, Jose Alfredo Lopez Mimbela

We consider a critical branching particle system in $\R^d$, composed of individuals of a finite number of types $i\in\{1,...,K\}$. Each individual of type $i$ moves independently according to a symmetric $\alpha_i$-stable motion. We assume that the particle lifetimes and offspring distributions are type-dependent. Under the usual independence assumptions in

Feng Jiang, A. Lee Swindlehurst

In this paper we consider a collection of single-antenna ground nodes communicating with a multi-antenna unmanned aerial vehicle (UAV) over a multiple-access ground-to-air wireless communications link. The UAV uses beamforming to mitigate the inter-user interference and achieve spatial division multiple access (SDMA). First, we consider a simple scenario wit

T. J. Davidge, T. H. Puzia

Images recorded with MegaCam are used to investigate the recent star-forming history (SFH) of the Local Group Sc galaxy M33. The properties of the stellar disk change near R = 8 kpc. Within this radius the star formation rate (SFR) has been constant with time during at least the past 250 Myr, while at larger radii the SFR has declined during this same time p

Daryush D. Mehta, Daniel Rudoy, Patrick J. Wolfe

Vocal tract resonance characteristics in acoustic speech signals are classically tracked using frame-by-frame point estimates of formant frequencies followed by candidate selection and smoothing using dynamic programming methods that minimize ad hoc cost functions. The goal of the current work is to provide both point estimates and associated uncertainties o

G. G. Guzmán-Verri, L. C. Lew Yan Voon

We have developed an unifying tight-binding Hamiltonian that can account for the electronic properties of recently proposed Si-based nanostructures, namely, Si graphene-like sheets and Si nanotubes. We considered the $sp^3s^*$ and $sp^{3}$ models up to first- and second-nearest neighbors, respectively. Our results show that the Si graphene-like sheets consid

Romulo Augusto Ventura Silva

The correct evaluation of a material property is fundamental to, on their application; they met all expectations that were designed for. In development of an expansive cement for ornamental rocks purpose, was denoted the absence of methodologies and equipments to evaluate the expansive pressure and temperature of expansive cement during their expansive proce

G. J. Ribeill, D. Hover, Y. -F. Chen, S. Zhu

We describe a novel scheme for low-noise phase-insensitive linear amplification at microwave frequencies based on the Superconducting Low-inductance Undulatory Galvanometer (SLUG). Direct integration of the junction equations of motion provides access to the full scattering matrix of the SLUG. We discuss the optimization of SLUG amplifiers and calculate ampl

Jean-Philippe Mandallena

Relaxation theorems for multiple integrals on W^{1,p}(\Omega;\RR^m), where p\in]1,\infty[, are proved under general conditions on the integrand L:\MM\to[0,\infty] which is Borel measurable and not necessarily finite. We involve a localization principle that we previously used to prove a general lower semicontinuity result. We apply these general results to t

John Bechhoefer

The implications of causality, as captured by the Kramers-Kronig relations between the real and imaginary parts of a linear response function, are familiar parts of the physics curriculum. In 1937, Bode derived a similar relation between the magnitude (response gain) and phase. Although the Kramers-Kronig relations are an equality, Bode's relation is effecti

Elizabeth Rivers, Alex Markowitz, Richard Rothschild

We have analyzed a Suzaku long-look of the active galactic nucleus MCG-2-58-22, a type 1.5 Seyfert with very little X-ray absorption in the line of sight and prominent features arising from reflection off circumnuclear material: the Fe line and Compton reflection hump. We place tight constraints on the power law photon index (Gamma=1.80+/-0.02), the Compton

R. Szczęśniak, M. W. Jarosik

The thermodynamic properties of the superconducting state induced in metallic molecular hydrogen under the influence of pressure 347 GPa were determined. In particular, it has been shown that the critical temperature ($T_{C}$) changes in the range from 120 K to 90 K for $\mu^{*}\in<0.08,0.15>$, where $\mu^{*}$ is the value of the Coulomb pseudopotential. Nex

Francisco Durán, Martin Gogolla, Manuel Roldán

The starting point of this paper is a system described in form of a UML class diagram where system states are characterized by OCL invariants and system transitions are defined by OCL pre- and postconditions. The aim of our approach is to assist the developer in learning about the consequences of the described system states and transitions and about the form

Suzana Andova, Mark van den Brand, Luc Engelen

A formal definition of the semantics of a domain-specific language (DSL) is a key prerequisite for the verification of the correctness of models specified using such a DSL and of transformations applied to these models. For this reason, we implemented a prototype of the semantics of a DSL for the specification of systems consisting of concurrent, communicati

Francisco Durán, Peter Csaba Ölveczky, José E. Rivera

e-Motions is an Eclipse-based visual timed model transformation framework with a Real-Time Maude semantics that supports the usual Maude formal analysis methods, including simulation, reachability analysis, and LTL model checking. e-Motions is characterized by a novel and powerful set of constructs for expressing timed behaviors. In this paper we illustrate

Bertrand Boisvert, Louis Féraud, Sergei Soloviev

This paper deals with model transformation based on attributed graph rewriting. Our contribution investigates a single pushout approach for applying the rewrite rules. The computation of graph attributes is obtained through the use of typed lambda-calculus with inductive types. In this paper we present solutions to cope with single pushout construction for t

Jeroen van den Bos, Mark Hills, Paul Klint, Tijs van der Storm

Algebraic specification has a long tradition in bridging the gap between specification and programming by making specifications executable. Building on extensive experience in designing, implementing and using specification formalisms that are based on algebraic specification and term rewriting (namely Asf and Asf+Sdf), we are now focusing on using the best

Peter Csaba Ölveczky

This paper motivates why Real-Time Maude should be well suited to provide a formal semantics and formal analysis capabilities to modeling languages for embedded systems. One can then use the code generation facilities of the tools for the modeling languages to automatically synthesize Real-Time Maude verification models from design models, enabling a formal

Alphan Ulusoy, Stephen L. Smith, Xu Chu Ding, Calin Belta

In this paper we present a method for automatically planning optimal paths for a group of robots that satisfy a common high level mission specification. Each robot's motion in the environment is modeled as a weighted transition system. The mission is given as a Linear Temporal Logic formula. In addition, an optimizing proposition must repeatedly be satisfied

Lin He, Jian Wang, Moses H. W. Chan

The current-voltage I-V characteristics of a 1.2 \mum long Au nanowire contacted by superconducting electrodes were studied in details. Interestingly, the I-V curves over a wide range of temperatures display multiple steps at voltages V = (m/n)(V0/2e) in the absence of microwave radiation, where m, n are integer numbers and V0 ~ 92 \muV. We posit that these

Diego Cifuentes

The degree chromatic polynomial $Pm(G,k)$ of a graph $G$ counts the number of $k$-colorings in which no vertex has $m$ adjacent vertices of its same color. We prove Humpert and Martin's conjecture on the leading terms of the degree chromatic polynomial of a tree.

J. J. Hernández, Gómez, V. Marquina, R. Gómez

A simple algorithm and a computational program to numerically compute the electric field gradient and the concomitant quadrupolar nuclear splitting is developed for an arbitrary ionic crystal. The calculations are performed using a point charge model. The program provides three different ways for the data input: by Bravais lattices, by lattice parameters, or

R. Dascaliuc, Z. Grujić

Existence of 2D enstrophy cascade in a suitable mathematical setting, and under suitable conditions compatible with 2D turbulence phenomenology, is known both in the Fourier and in the physical scales. The goal of this paper is to show that the same geometric condition preventing the formation of singularities - 1/2-H\"older coherence of the vorticity direct

Shengjun Yuan, Rafael Roldán, Mikhail I. Katsnelson

We study the Landau level spectrum of ABA- and ABC-stacked trilayer graphene. We derive analytic low energy expressions for the spectrum, the validity of which is confirmed by comparison to a \pi -band tight-binding calculation of the density of states on the honeycomb lattice. We further study the effect of a perpendicular electric field on the spectrum, wh

Victor Campos, Cláudia Linhares-Sales, Ana Karolinna Maia, Nicolas Martins

In this paper, we obtain polynomial time algorithms to determine the acyclic chromatic number, the star chromatic number, the Thue chromatic number, the harmonious chromatic number and the clique chromatic number of $P_4$-tidy graphs and $(q,q-4)$-graphs, for every fixed $q$. These classes include cographs, $P_4$-sparse and $P_4$-lite graphs. All these color

W. Zhang

In recent years, there has been much interest in phase transitions of combinatorial problems. Phase transitions have been successfully used to analyze combinatorial optimization problems, characterize their typical-case features and locate the hardest problem instances. In this paper, we study phase transitions of the asymmetric Traveling Salesman Problem (A

W. P. Birmingham, C. J. Meek

We propose a model for errors in sung queries, a variant of the hidden Markov model (HMM). This is a solution to the problem of identifying the degree of similarity between a (typically error-laden) sung query and a potential target in a database of musical works, an important problem in the field of music information retrieval. Similarity metrics are a crit

N. Roy, G. Gordon, S. Thrun

Standard value function approaches to finding policies for Partially Observable Markov Decision Processes (POMDPs) are generally considered to be intractable for large models. The intractability of these algorithms is to a large extent a consequence of computing an exact, optimal policy over the entire belief space. However, in real-world POMDP problems, com

J. Hoffmann, J. Porteous, L. Sebastia

Many known planning tasks have inherent constraints concerning the best order in which to achieve the goals. A number of research efforts have been made to detect such constraints and to use them for guiding search, in the hope of speeding up the planning process. We go beyond the previous approaches by considering ordering constraints not only over the (top

R. Begleiter, R. El-Yaniv, G. Yona

This paper is concerned with algorithms for prediction of discrete sequences over a finite alphabet, using variable order Markov models. The class of such algorithms is large and in principle includes any lossless compression algorithm. We focus on six prominent prediction algorithms, including Context Tree Weighting (CTW), Prediction by Partial Match (PPM)

A. Felner, S. Hanan, R. E. Korf

We explore a method for computing admissible heuristic evaluation functions for search problems. It utilizes pattern databases, which are precomputed tables of the exact cost of solving various subproblems of an existing problem. Unlike standard pattern database heuristics, however, we partition our problems into disjoint subproblems, so that the costs of so

Kiran Jain, S. C. Tripathy, F. Hill

In this paper, we address the controversy regarding the recent extended solar minimum as seen in helioseismic low- and intermediate-degree mode frequencies: studies from different instruments identify different epochs of seismic minima. Here we use mode frequencies from a network of six identical instruments, Global Oscillation Network Group, continuously co

E. Celaya, J. M. Porta

In this paper, we confront the problem of applying reinforcement learning to agents that perceive the environment through many sensors and that can perform parallel actions using many actuators as is the case in complex autonomous robots. We argue that reinforcement learning can only be successfully applied to this case if strong assumptions are made on the

C. V. Goldman, S. Zilberstein

Decentralized control of cooperative systems captures the operation of a group of decision makers that share a single global objective. The difficulty in solving optimally such problems arises when the agents lack full observability of the global state of the system when they operate. The general problem has been shown to be NEXP-complete. In this paper, we

P. Derbeko, R. El-Yaniv, R. Meir

Inductive learning is based on inferring a general rule from a finite data set and using it to label new data. In transduction one attempts to solve the problem of using a labeled training set to label a set of unlabeled points, which are given to the learner prior to learning. Although transduction seems at the outset to be an easier task than induction, th

C. Cayrol, M. C. Lagasquie-Schiex

Argumentation is based on the exchange and valuation of interacting arguments, followed by the selection of the most acceptable of them (for example, in order to take a decision, to make a choice). Starting from the framework proposed by Dung in 1995, our purpose is to introduce 'graduality' in the selection of the best arguments, i.e., to be able to partiti

P. Beame, H. Kautz, A. Sabharwal

Efficient implementations of DPLL with the addition of clause learning are the fastest complete Boolean satisfiability solvers and can handle many significant real-world problems, such as verification, planning and design. Despite its importance, little is known of the ultimate strengths and limitations of the technique. This paper presents the first precise

D. Cohen, M. Cooper, P. Jeavons, A. Krokhin

Many researchers in artificial intelligence are beginning to explore the use of soft constraints to express a set of (possibly conflicting) problem requirements. A soft constraint is a function defined on a collection of variables which associates some measure of desirability with each possible combination of values for those variables. However, the crucial

N. L. Zhang, W. Zhang

Value iteration is a popular algorithm for finding near optimal policies for POMDPs. It is inefficient due to the need to account for the entire belief space, which necessitates the solution of large numbers of linear programs. In this paper, we study value iteration restricted to belief subsets. We show that, together with properly chosen belief subsets, re

A. Ben-Yair, A. Felner, S. Kraus, N. Netanyahu

We address the problem of finding the shortest path between two points in an unknown real physical environment, where a traveling agent must move around in the environment to explore unknown territory. We introduce the Physical-A* algorithm (PHA*) for solving this problem. PHA* expands all the mandatory nodes that A* would expand and returns the shortest pat

H. E. Dixon, M. L. Ginsberg, A. J. Parkes

This is the first of three planned papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high-performance solvers. The fundamental idea underlying ZAP is that many problems passed to such engines contain rich internal structure that is obscured by the Boolean rep

Omer Friedland, Yosef Yomdin

The main observation of this note is that the Lebesgue measure $\mu$ in the Tur\'an-Nazarov inequality for exponential polynomials can be replaced with a certain geometric invariant $\omega \ge \mu$, which can be effectively estimated in terms of the metric entropy of a set, and may be nonzero for discrete and even finite sets. While the frequencies (the ima

B. Hnich, B. M. Smith, T. Walsh

When writing a constraint program, we have to choose which variables should be the decision variables, and how to represent the constraints on these variables. In many cases, there is considerable choice for the decision variables. Consider, for example, permutation problems in which we have as many values as variables, and each variable takes an unique valu

R. Miikkulainen, K. O. Stanley

Two major goals in machine learning are the discovery and improvement of solutions to complex problems. In this paper, we argue that complexification, i.e. the incremental elaboration of solutions through adding new structure, achieves both these goals. We demonstrate the power of complexification through the NeuroEvolution of Augmenting Topologies (NEAT) me

A. Borodin, R. El-Yaniv, V. Gogan

A novel algorithm for actively trading stocks is presented. While traditional expert advice and "universal" algorithms (as well as standard technical trading heuristics) attempt to predict winners or trends, our approach relies on predictable statistical relations between all pairs of stocks in the market. Our empirical results on historical markets provide

J. Keppens, Q. Shen

The predominant knowledge-based approach to automated model construction, compositional modelling, employs a set of models of particular functional components. Its inference mechanism takes a scenario describing the constituent interacting components of a system and translates it into a useful mathematical model. This paper presents a novel compositional mod

K. M. Lochner, D. M. Reeves, Y. Vorobeychik, M. P. Wellman

The 2002 Trading Agent Competition (TAC) presented a challenging market game in the domain of travel shopping. One of the pivotal issues in this domain is uncertainty about hotel prices, which have a significant influence on the relative cost of alternative trip schedules. Thus, virtually all participants employ some method for predicting hotel prices. We su

M. Bowling, M. Veloso

Multiagent learning is a necessary yet challenging problem as multiagent systems become more prevalent and environments become more dynamic. Much of the groundbreaking work in this area draws on notable results from game theory, in particular, the concept of Nash equilibria. Learners that directly learn an equilibrium obviously rely on their existence. Learn

Jeremy Callner

Measurements of charged dihadron DeltaEta-DeltaPhi correlations from the CMS collaboration are presented for PbPb collisions at a center-of-mass energy of 2.76 TeV per nucleon pair over a broad range of pseudorapidity and the full range of azimuthal angle. A significant correlated yield is observed for pairs of particles with small DeltaPhi but large longitu

P. Gorniak, D. Roy

We present a visually-grounded language understanding model based on a study of how people verbally describe objects in scenes. The emphasis of the model is on the combination of individual word meanings to produce meanings for complex referring expressions. The model has been implemented, and it is able to understand a broad range of spatial referring expre

O. Arieli, M. Bruynooghe, M. Denecker, B. Van Nuffelen

We introduce an abductive method for a coherent integration of independent data-sources. The idea is to compute a list of data-facts that should be inserted to the amalgamated database or retracted from it in order to restore its consistency. This method is implemented by an abductive solver, called Asystem, that applies SLDNFA-resolution on a meta-theory th

M. H. Goker, P. Langley, C. A. Thompson

Searching for and making decisions about information is becoming increasingly difficult as the amount of information and number of choices increases. Recommendation systems help users find items of interest of a particular type, such as movies or restaurants, but are still somewhat awkward to use. Our solution is to take advantage of the complementary streng

M. Babaioff, N. Nisan

With the recent technological feasibility of electronic commerce over the Internet, much attention has been given to the design of electronic markets for various types of electronically-tradable goods. Such markets, however, will normally need to function in some relationship with markets for other related goods, usually those downstream or upstream in the s

T. Kocka, N. L. Zhang

Hierarchical latent class (HLC) models are tree-structured Bayesian networks where leaf nodes are observed while internal nodes are latent. There are no theoretically well justified model selection criteria for HLC models in particular and Bayesian networks with latent nodes in general. Nonetheless, empirical studies suggest that the BIC score is a reasonabl

M. J. Nederhof, G. Satta

We propose a formalism for representation of finite languages, referred to as the class of IDL-expressions, which combines concepts that were only considered in isolation in existing formalisms. The suggested applications are in natural language processing, more specifically in surface natural language generation and in machine translation, where a sentence

S. Edelkamp

The Model Checking Integrated Planning System (MIPS) is a temporal least commitment heuristic search planner based on a flexible object-oriented workbench architecture. Its design clearly separates explicit and symbolic directed exploration algorithms from the set of on-line and off-line computed estimates and associated data structures. MIPS has shown disti

A. Darwiche, J. D. Park

MAP is the problem of finding a most probable instantiation of a set of variables given evidence. MAP has always been perceived to be significantly harder than the related problems of computing the probability of a variable instantiation Pr, or the problem of computing the most probable explanation (MPE). This paper investigates the complexity of MAP in Baye

C. Boutilier, R. I. Brafman, C. Domshlak, H. H. Hoos

Information about user preferences plays a key role in automated decision making. In many domains it is desirable to assess such preferences in a qualitative rather than quantitative way. In this paper, we propose a qualitative graphical representation of preferences that reflects conditional dependence and independence of preference statements under a ceter

D. Monderer, M. Tennenholtz

This paper discusses an interested party who wishes to influence the behavior of agents in a game (multi-agent interaction), which is not under his control. The interested party cannot design a new game, cannot enforce agents' behavior, cannot enforce payments by the agents, and cannot prohibit strategies available to the agents. However, he can influence th

W. E. Walsh, M. P. Wellman

Supply chain formation is the process of determining the structure and terms of exchange relationships to enable a multilevel, multiagent production activity. We present a simple model of supply chains, highlighting two characteristic features: hierarchical subtask decomposition, and resource contention. To decentralize the formation process, we introduce a

O. Grumberg, S. Livne, S. Markovitch

The size and complexity of software and hardware systems have significantly increased in the past years. As a result, it is harder to guarantee their correct behavior. One of the most successful methods for automated verification of finite-state systems is model checking. Most of the current model-checking systems use binary decision diagrams (BDDs) for the

S. Acid, L. M. de Campos

Although many algorithms have been designed to construct Bayesian network structures using different approaches and principles, they all employ only two methods: those based on independence criteria, and those based on a scoring function and a search procedure (although some methods combine the two). Within the score+search paradigm, the dominant approach us

A. Al-Ani, M. Deriche

This paper presents a new classifier combination technique based on the Dempster-Shafer theory of evidence. The Dempster-Shafer theory of evidence is a powerful method for combining measures of evidence from different classifiers. However, since each of the available methods that estimates the evidence of classifiers has its own limitations, we propose here

J. E. Forero-Romero, Y. Hoffman, G. Yepes, S. Gottoeber

We make detailed theoretical predictions for the assembly properties of the Local Group (LG) in the standard LambdaCDM cosmological model. We use three cosmological N-body dark matter simulations from the CLUES project, which are designed to reproduce the main dynamical features of the matter distribution down to the scale of a few Mpc around the LG. Additio

T. G. Akin, Sharon Kennedy, Ben Dribus, Jeremy Marzuola

Multiply-connected traps for cold, neutral atoms fix vortex cores of quantum gases. Laguerre-Gaussian laser modes are ideal for such traps due to their phase stability. We report theoretical calculations of the Bose-Einstein condensation transition properties and thermal characteristics of neutral atoms trapped in multiply connected geometries formed by Lagu

Jitesh Dundas

The aim of this research review is to propose the logic and search mechanism for the development of an artificially intelligent automaton (AIA) that can find affected cells in a 3-dimensional biological system. Research on the possible application of such automatons to detect and control cancer cells in the human body are greatly focused MRI and PET scans fi

Guenther Hoermann, Michael Kunzinger, Roland Steinbauer

We consider wave equations on Lorentzian manifolds in case of low regularity. We first extend the classical solution theory to prove global unique solvability of the Cauchy problem for distributional data and right hand side on smooth globally hyperbolic space-times. Then we turn to the case where the metric is non-smooth and present a local as well as a glo

Sam R. Dolan, Barry Wardell, Leor Barack

This is the second in a series of papers aimed at developing a practical time-domain method for self-force calculations in Kerr spacetime. The key elements of the method are (i) removal of a singular part of the perturbation field with a suitable analytic "puncture" based on the Detweiler--Whiting decomposition, (ii) decomposition of the perturbation equatio

Kundan Singh, Carol Davids

Internet telephony and multimedia communication protocols have matured over the last fifteen years. Recently, the web is evolving as a popular platform for everything we do on the Internet including email, text chat, voice calls, discussions, enterprise apps and multi-party collaboration. Unfortunately, there is a disconnect between web and traditional Inter

Shantanu Dave, Guenther Hoermann, Michael Kunzinger

We investigate regularizations of distributional sections of vector bundles by means of nets of smooth sections that preserve the main regularity properties of the original distributions (singular support, wavefront set, Sobolev regularity). The underlying regularization mechanism is based on functional calculus of elliptic operators with finite speed of pro

S. Blondin, D. Kasen, F. K. Roepke, R. P. Kirshner

We compare models for Type Ia supernova (SN Ia) light curves and spectra with an extensive set of observations. The models come from a recent survey of 44 two-dimensional delayed-detonation models computed by Kasen, Roepke & Woosley (2009), each viewed from multiple directions. The data include optical light curves of 251 SNe Ia and 2231 low-dispersion spect

Olaf Hohm, Seung Ki Kwak, Barton Zwiebach

We use double field theory to give a unified description of the low energy limits of type IIA and type IIB superstrings. The Ramond-Ramond potentials fit into spinor representations of the duality group O(D,D) and field-strengths are obtained by acting with the Dirac operator on the potentials. The action, supplemented by a Spin^+(D,D)-covariant self-duality

Jun Wen, Mehdi Kargarian, Abolhassan Vaezi, Gregory A. Fiete

We study the Kane-Mele-Hubbard model both at half-filling and away from half-filling using a slave-boson mean-field approach at zero temperature. We obtain a phase diagram at half-filling and discuss its connection to recent results from quantum Monte Carlo, slave-rotor, and $Z_2$ mean-field studies. In particular, we find a small window in parameter space w

Oleg A. Tretiakov, Ar. Abanov, Jairo Sinova

We study the thermoelectric properties of three-dimensional topological insulators with many holes (or pores) in the bulk. We show that at high density of these holes the thermoelectric figure of merit ZT can be large due to the contribution of the conducting surfaces and the suppressed phonon thermal conductivity. The maximum efficiency can be tuned by an i

Sukyoung K. Yi, Jihye Lee, Yun-Kyeong Sheen, Hyunjin Jeong

It is suspected that the ultraviolet (UV) upturn phenomenon in elliptical galaxies and extended horizontal-branch stars in globular clusters have a common origin. An extremely high abundance of helium (Y~0.4) allows for a working hypothesis, but its origin is unclear. Peng & Nagai (2009) proposed that primordial helium sedimentation in dark haloes over cosmi

Nobuhiro Okabe, Herve Bourdin, Pasquale Mazzotta, Sophie Maurogordato

We present a weak-lensing analysis of the merging cluster A2163 using Subaru/Suprime-Cam and CFHT/Mega-Cam data and discuss the dynamics of this cluster merger, based on complementary weak-lensing, X-ray, and optical spectroscopic datasets. From two dimensional multi-component weak-lensing analysis, we reveal that the cluster mass distribution is well descri

Dimitrie Culcer, A. L. Saraiva, Belita Koiller, Xuedong Hu

We devise a platform for noise-resistant quantum computing using the valley degree of freedom of Si quantum dots. The qubit is encoded in two polarized (1,1) spin-triplet states with different valley compositions in a double quantum dot, with a Zeeman field enabling unambiguous initialization. A top gate gives a difference in the valley splitting between the

Timothy A. Davis, Katherine Alatalo, Marc Sarzi, Martin Bureau

We make use of interferometric CO and HI observations, and optical integral-field spectroscopy to probe the origin of the molecular and ionised interstellar medium (ISM) in local early-type galaxies (ETGs). We find that 36\pm5% of our sample of fast rotating ETGs have their ionised gas kinematically misaligned with respect to the stars, setting a strong lowe

Paul Torrey, Thomas J. Cox, Lisa Kewley, Lars Hernquist

Nuclear inflows of metal-poor interstellar gas triggered by galaxy interactions can account for the systematically lower central oxygen abundances observed in local interacting galaxies. Here, we investigate the metallicity evolution of a large set of simulations of colliding galaxies. Our models include cooling, star formation, feedback, and a new stochasti

Michele Redi, Andreas Weiler

The flavor protection in composite Higgs models with partial compositeness is known to be insufficient. We explore the possibility to alleviate the tension with CP odd observables by assuming that flavor or CP are symmetries of the composite sector, broken by the coupling to Standard Model fields. One realization is that the composite sector has a flavor sym

Costantino Sigismondi

The physiology of the dark adaption process of the eye is revisited from an astronomical point of view. A new method for the magnitude estimation of a star is presented. It is based upon the timing of the physiological cycle of the rhodopsin during the eye dark adaption process. The limits of the application of the method are discussed. This method is suitab

Tyson B. Littenberg

The Galaxy is suspected to contain hundreds of millions of binary white dwarf systems, a large fraction of which will have sufficiently small orbital period to emit gravitational radiation in band for space-based gravitational wave detectors such as the Laser Interferometer Space Antenna (LISA). LISA's main science goal is the detection of cosmological event

Bryan W. Lynn

B.W.Lee/K.Symanzik proved that Ward-Takahashi identities and tadpole renormalization force all ultra-violet quadratic divergences (UV-QD) to be absorbed into the physical renormalized pseudo-scalar pion mass in O(4)LSM (linear sigma models) across the Higgs-VEV vs. Pion-Mass-Squared half-plane. We show that all UV-QD vanish identically in the "Goldstone mode

Sanil Unnikrishnan, Shruti Thakur, T. R. Seshadri

This paper has been withdrawn by the author due to an error in equation 13.

V. L. Khandramai, R. S. Pasechnik, D. V. Shirkov, O. P. Solovtsova

We study the polarized Bjorken sum rule at low momentum transfers in the range $0.22<Q<1.73 {\rm GeV}$ with the four-loop N$^3$LO expression for the coefficient function $C_{\rm Bj}(\alpha_s)$ in the framework of the common QCD perturbation theory (PT) and the singularity-free analytic perturbation theory (APT). The analysis of the PT series for $C_{\rm Bj}(

I. C. Fulga, F. Hassler, A. R. Akhmerov

The topological invariant of a topological insulator (or superconductor) is given by the number of symmetry-protected edge states present at the Fermi level. Despite this fact, established expressions for the topological invariant require knowledge of all states below the Fermi energy. Here, we propose a way to calculate the topological invariant employing s

Chun Shen, Steffen A Bass, Tetsufumi Hirano, Pasi Huovinen

With the new viscous hydrodynamic + hadron cascade hybrid code VISHNU, a rather precise (O(25%)) extraction of the QGP shear viscosity (eta/s)_QGP from heavy-ion elliptic flow data is possible if the initial eccentricity of the collision fireball is known with <5% accuracy. At this point, eccentricities from initial state models differ by up to 20%, leading

Rafael Ferraro, Franco Fiorini

The vierbein (tetrad) fields for closed and open Friedmann-Robertson-Walker cosmologies are hard to work out in most of the theories featuring absolute parallelism. The difficulty is traced in the fact that these theories are not invariant under local Lorentz transformations of the vierbein. We illustrate this issue in the framework of f(T) theories and Born

Pradeep Sarvepalli, Pawel Wocjan

Infrastructures are group-like objects that make their appearance in arithmetic geometry in the study of computational problems related to number fields and function fields over finite fields. The most prominent computational tasks of infrastructures are the computation of the circumference of the infrastructure and the generalized discrete logarithms. Both

Joseph Polchinski

A recent paper by Gambini, Rastgoo and Pullin [arXiv:1106.1417 investigates the important issue of constraints from Lorentz invariance on Planck scale physics, arguing that the classic analysis of Collins, Perez, Sudarsky, Urrutia and Vucetich \cite{cpsuv} is not generally valid. We argue that the new work is based on models that do not capture the relevant

Gennady Gorelik

The cultural infrastructure that let Galileo invent the modern physics is discussed. The key new element of modern physics was firm belief in its fundamental structure, which could be expressed in the double postulate: 1) There are fundamental axioms that all the physical laws could be deduced from; those axioms are not evident, as invisible as the undergrou

Joel C. Miller, Erik M. Volz

We consider the edge-based compartmental models for infectious disease spread introduced in Part I. These models allow us to consider standard SIR diseases spreading in random populations. In this paper we show how to handle deviations of the disease or population from the simplistic assumptions of Part I. We allow the population to have structure due to eff

Helmut Knebl, Ernst Kunz, Rolf Waldi

We continue the investigation of curves of type p,q started in [KKW]. We study the space of such curves and the space of nodal curves with prescribed Weierstra\ss semigroup. A necessary and sufficient criterion for a numerical semigroup to be a Weierstra\ss semigroup is given. We find a class of Weierstra\ss semigroups which apparently has not yet been descr

Sebastian Deorowicz

The problem of finding a longest common subsequence of two main sequences with some constraint that must be a substring of the result (STR-IC-LCS) was formulated recently. It is a variant of the constrained longest common subsequence problem. As the known algorithms for the STR-IC-LCS problem are cubic-time, the presented quadratic-time algorithm is signific