- arXiv.org
- Popular Physics
- Space Physics
- Data Analysis, Statistics and Probability
- General Physics
- Optics
- Physics and Society
- Atomic and Molecular Clusters
- Fluid Dynamics
- Biological Physics
- History and Philosophy of Physics
- Geophysics
- Atomic Physics
- Plasma Physics
- Medical Physics
- Atmospheric and Oceanic Physics
- Instrumentation and Detectors
- Computational Physics
- Chemical Physics
- Classical Physics
- Accelerator Physics
- Physics Education

- Analysis of PDEs
- Statistics Theory
- Number Theory
- Information Theory
- History and Overview
- Algebraic Geometry
- Mathematical Physics
- Complex Variables
- Representation Theory
- Probability
- Group Theory
- Combinatorics
- Operator Algebras
- Metric Geometry
- Symplectic Geometry
- Quantum Algebra
- Differential Geometry
- Optimization and Control
- Dynamical Systems
- Numerical Analysis
- Geometric Topology
- General Topology
- Logic
- General Mathematics
- Spectral Theory
- Classical Analysis and ODEs
- Algebraic Topology
- Functional Analysis
- Rings and Algebras
- Commutative Algebra
- Category Theory
- K-Theory and Homology

- General Literature
- Symbolic Computation
- Information Retrieval
- Computational Complexity
- Information Theory
- Multiagent Systems
- Formal Languages and Automata Theory
- Other Computer Science
- Sound
- Social and Information Networks
- Databases
- Computer Vision and Pattern Recognition
- Learning
- Numerical Analysis
- Neural and Evolutionary Computing
- Programming Languages
- Operating Systems
- Software Engineering
- Emerging Technologies
- Computational Engineering, Finance, and Science
- Discrete Mathematics
- Distributed, Parallel, and Cluster Computing
- Systems and Control
- Hardware Architecture
- Computer Science and Game Theory
- Digital Libraries
- Artificial Intelligence
- Cryptography and Security
- Human-Computer Interaction
- Performance
- Mathematical Software
- Data Structures and Algorithms
- Robotics
- Multimedia
- Computation and Language
- Computational Geometry
- Networking and Internet Architecture
- Computers and Society
- Logic in Computer Science
- Graphics

- Jun 27 2017 hep-th arXiv:1706.08140v1Linearized gravity is considered as an ordinary gauge field theory. This implies the need for gauge fixing in order to have well defined propagators. Only after having achieved this, the most general mass term is added. The aim of this paper is to study of the degrees of freedom of the gauge fixed theory of linearized gravity with mass term. The main result is that, even outside the usual Fierz-Pauli constraint on the mass term, it is possible to choose a gauge fixing belonging to the Landau class, which leads to a massive theory of gravity with the five degrees of freedom of a spin two massive particle.
- Jun 27 2017 q-bio.CB arXiv:1706.08139v1We derived an ordinary differential equation model to capture the disease dynamics during blood-stage malaria. The model was directly derived from an earlier age-structured partial differential equation model. The original model was simplified due to the experimental constraint. Here we calibrated the simplified model with experimental data using multiple objective genetic algorithm. Through the calibration process, we quantified the removal of healthy red blood cells and the preferential infection of reticulocytes during \textitPlamodium cynomolgi infection of \textitMacaca mulatta. The calibration of our model also revealed the existence of host erythropoietic response prior to blood stage infection.
- Valeri Matrosov, Susan Gordleeva, Natalia Boldyreva, Eshel Ben-Jacob, Alexey Semyanov, Victor Kazantsev, Maurizio De PittàJun 27 2017 q-bio.NC arXiv:1706.08138v1We use tools of bifurcation theory to characterize dynamics of astrocytic~IP$_3$ and~Ca$^{2+}$ for different~IP$_3$ regimes from a mathematical point of view. We do so following a bottom-up approach, starting from a compact, well-stirred astrocyte model to first identify characteristic~IP$_3$ pathways whereby~Ca$^{2+}$ (and~IP$_3$) dynamics "bifurcate", namely change from stable (constant) concentration levels, to oscillatory dynamics. Then we extend our analysis to the elemental case of two astrocytes, coupled by~IP$_3$ diffusion mediated by gap junction channels, putting emphasis on the mechanisms of emergence of chaotic oscillations. Finally, we complete our analysis discussing spatiotemporal~Ca$^{2+}$ dynamics in a spatially-extended astrocyte model, gaining insights on the possible physical mechanisms whereby random Ca$^{2+}$~generation could be orchestrated into robust, spatially-confined intracellular~Ca$^{2+}$ oscillations.
- A wireless sensor network (WSN) typically consists of base stations and a large number of wireless sensors. The sensory data gathered from the whole network at a certain time snapshot can be visualized as an image. As a result, information hiding techniques can be applied to this "sensory data image". Steganography refers to the technology of hiding data into digital media without drawing any suspicion, while steganalysis is the art of detecting the presence of steganography. This article provides a brief review of steganography and steganalysis applications for wireless sensor networks (WSNs). Then we show that the steganographic techniques are both related to sensed data authentication in wireless sensor networks, and when considering the attacker point of view, which has not yet been investigated in the literature. Our simulation results show that the sink level is unable to detect an attack carried out by the nsF5 algorithm on sensed data.
- We prove the existence of a center, or continuous selection of a point, in the relative interior of $C^1$ embedded $k$-disks in Riemannian $n$-manifolds. If $k\le 3$ the center can be made equivariant with respect to the isometries of the manifold, and under mild assumptions the same holds for $k=4=n$. By contrast, for every $n\ge k\ge 6$ there are examples where an equivariant center does not exist. The center can be chosen to agree with any of the classical centers defined on the set of convex compacta in the Euclidean space.
- Jun 27 2017 math.CO arXiv:1706.08134v1Let $F$, $G$ and $H$ be simple graphs. We say $F \rightarrow (G, H)$ if for every $2$-coloring of the edges of $F$ there exists a monochromatic $G$ or $H$ in $F$. The Ramsey number $r(G, H)$ is defined as $r(G, H) = min\{|V (F)|: F \rightarrow (G, H)\}$, while the restricted size Ramsey number $r^{*}(G, H)$ is defined as $r^{*}(G, H) = min\{|E (F)|: F \rightarrow (G, H) , |V (F) | = r(G, H)\}$. In this paper we determine previously unknown restricted size Ramsey numbers $r^{*}(P_3, C_n)$ for $7 \leq n \leq 12$. We also give new upper bound $r^{*}(P_3, C_n) \leq 2n-2$ for even $n \geq 8$.
- Jun 27 2017 cs.DC arXiv:1706.08133v1Wireless sensor networks are often deployed in public or otherwise untrusted and even hostile environments, which prompts a number of security issues. Although security is a necessity in other types of networks, it is much more so in sensor networks due to the resource-constraint, susceptibility to physical capture, and wireless nature. In this work we emphasize two security issues: (1) secure communication infrastructure and (2) secure nodes scheduling algorithm. Due to resource constraints, specific strategies are often necessary to preserve the network's lifetime and its quality of service. For instance, to reduce communication costs nodes can go to sleep mode periodically (nodes scheduling). These strategies must be proven as secure, but protocols used to guarantee this security must be compatible with the resource preservation requirement. To achieve this goal, secure communications in such networks will be defined, together with the notions of secure scheduling. Finally, some of these security properties will be evaluated in concrete case studies.
- Using the locally compact abelian group $\BT \times \BZ$, we assign a meromorphic function to each ideal triangulation of a 3-manifold with torus boundary components. The function is invariant under all 2--3 Pachner moves, and thus is a topological invariant of the underlying manifold. If the ideal triangulation has a strict angle structure, our meromorphic function can be expanded into a Laurent power series whose coefficients are formal power series in $q$ with integer coefficients that coincide with the 3D index of \citeDGG2. Our meromorphic function can be computed explicitly from the matrix of the gluing equations of a triangulation, and we illustrate this with several examples.
- Elizabeth D. Trippe, Jacob B. Aguilar, Yi H. Yan, Mustafa V. Nural, Jessica A. Brady, Juan B. GutierrezJun 27 2017 q-bio.QM arXiv:1706.08131v1Background: The past few years have seen a tremendous increase in the size and complexity of datasets. Scientific and clinical studies must to incorporate datasets that cross multiple spatial and temporal scales to describe a particular phenomenon. The storage and accessibility of these heterogeneous datasets in a way that is useful to researchers and yet extensible to new data types is a major challenge. Methods: In order to overcome these obstacles, we propose the use of data primitives as a common currency between analytical methods. The four data primitives we have identified are time series, text, annotated graph and triangulated mesh, with associated metadata. Using only data primitives to store data and as algorithm input, output, and intermediate results, promotes interoperability, scalability, and reproducibility in scientific studies. Results: Data primitives were used in a multi-omic, multi-scale systems biology study of malaria infection in non-human primates to perform many types of integrative analysis quickly and efficiently. Conclusions: Using data primitives as a common currency for both data storage and for cross talk between analytical methods enables the analysis of complex multi-omic, multi-scale datasets in a reproducible modular fashion.
- Jun 27 2017 cond-mat.quant-gas cond-mat.stat-mech arXiv:1706.08130v1In this paper, we consider a one-dimensional boson system in a superlattice potential. This system is feasible by using ultracold atomic gases, and attracts much attention these days. It is expected that it has an interesting topological phase called topological Mott insulator (TMI). We fond that the competition between the superlattice potential and the on-site interaction leads to various TMIs with non-vanishing integer Chern number. Comparing to hard-core case, the soft-core boson system exhibits rich phase diagrams including various non-trivial TMIs. In particular, global phase diagrams of the Chern number are obtained by using the exact diagonalization method. We also show the Chern number corresponds to the particle transfer, i.e., topological charge pumping in many-body interacting system. The various TMIs are charactered by topological charge pumping, feasible in real experiments.
- Jun 27 2017 hep-ex arXiv:1706.08128v1A measurement of the cross section for top quark-antiquark (ttbar) pairs produced in association with a photon in proton-proton collisions at sqrt(s) = 8 TeV A measurement of the cross section for top quark-antiquark (ttbar) pairs produced in association with a photon in proton-proton collisions at sqrt(s) = 8 TeV is presented. The analysis uses data collected with the CMS detector at the LHC, corresponding to an integrated luminosity of 19.7 inverse femotbarns. The signal is defined as the production of a ttbar pair in association with a photon having a transverse energy larger than 25 GeV and an absolute pseudorapidity smaller than 1.44. The measurement is performed in the fiducial phase space corresponding to the semileptonic decay chain of the ttbar pair, and the cross section is measured relative to the inclusive ttbar pair production cross section. The fiducial cross section for associated ttbar pair and photon production is found to be 127 +/- 27 (stat+syst) fb per semileptonic final state. The measured value is in agreement with the theoretical prediction.
- Jun 27 2017 cond-mat.mtrl-sci arXiv:1706.08127v1Recently, it was shown that quantum spin Hall insulator (QSHI) phase with a gap wide enough for practical applications can be realized in the ultra thin films constructed from two inversely stacked structural elements of trivial band insulator BiTeI. Here, we study the edge states in the free-standing Bi$_2$Te$_2$I$_2$ sextuple layer (SL) and the electronic structure of the Bi$_2$Te$_2$I$_2$ SL on the natural BiTeI substrate. We show that the topological properties of the Bi$_2$Te$_2$I$_2$ SL on this substrate keep $\mathbb Z_2$ invariant. We also demonstrate that ultra thin centrosymmetric films constructed in the similar manner but from related material BiTeBr are trivial band insulators up to five-SL film thickness. In contrast to Bi$_2$Te$_2$I$_2$ for which the stacking of nontrivial SLs in 3D limit gives a strong topological insulator (TI) phase, strong TI is realized in 3D Bi$_2$Te$_2$Br$_2$ in spite of the SL is trivial. For the last material of the BiTe$X$ ($X$=I,Br,Cl) series, BiTeCl, both 2D and 3D centrosymmetric phases are characterized by topologically trivial band structure.
- Jun 27 2017 astro-ph.HE arXiv:1706.08125v1We present a detailed multi-wavelength study of an unobscured, highly super-Eddington Type-1 QSO RX J0439.6-5311. We combine the latest XMM-Newton observation with all archival data from infrared to hard X-rays. The optical spectrum is very similar to that of 1H 0707-495 in having extremely weak [O \sc iii] and strong Fe \sc ii emission lines, although the black hole mass is probably slightly higher at $5-10 \times10^{6}~\rm M_{\odot}$. The broadband SED is uniquely well-defined due to the extremely low Galactic and intrinsic absorption, so the bolometric luminosity is tightly constrained. The optical/UV accretion disc continuum is seen down to 900 Å, showing that there is a standard thin disc structure down to $R \ge$ 190-380 $R_{\rm g}$ and determining the mass accretion rate through the outer disc. This predicts a much higher bolometric luminosity than observed, indicating that there must be strong wind and/or advective energy losses from the inner disc, as expected for a highly super-Eddington accretion flow. Significant outflows are detected in both the NLR and BLR emission lines, confirming the presence of a wind. We propose a global picture for the structure of a super-Eddington accretion flow where the inner disc puffs up, shielding much of the potential NLR material, and show how inclination angle with respect to this and the wind can explain very different X-ray properties of RX J0439.6-5311 and 1H 0707-495. Therefore, this source provides strong supporting evidence that `simple' and `complex' super-Eddington NLS1s can be unified within the same accretion flow scenario but with different inclination angles. We also propose that these extreme NLS1s could be the low-redshift analogs of weak emission-line quasars (WLQs).
- Lucas Fidon, Wenqi Li, Luis C. Garcia-Peraza-Herrera, Jinendra Ekanayake, Neil Kitchen, Sebastien Ourselin, Tom VercauterenJun 27 2017 cs.CV arXiv:1706.08124v1Brain tumour segmentation plays a key role in computer-assisted surgery. Deep neural networks have increased the accuracy of automatic segmentation significantly, however these models tend to generalise poorly to different imaging modalities than those for which they have been designed, thereby limiting their applications. For example, a network architecture initially designed for brain parcellation of monomodal T1 MRI can not be easily translated into an efficient tumour segmentation network that jointly utilises T1, T1c, Flair and T2 MRI. To tackle this, we propose a novel scalable multimodal deep learning architecture using new nested structures that explicitly leverage deep features within or across modalities. This aims at making the early layers of the architecture structured and sparse so that the final architecture becomes scalable to the number of modalities. We evaluate the scalable architecture for brain tumour segmentation and give evidence of its regularisation effect compared to the conventional concatenation approach.
- We consider a space with noncommutativity of coordinates and noncommutativity of momenta. It is shown that coordinates in noncommutative phase space depend on mass therefore they can not be considered as kinematic variables. Also, noncommutative momenta are not proportional to a mass as it has to be. We find conditions on the parameters of noncommutativity on which these problems are solved. It is important that on the same conditions the weak equivalence principle is not violated, the properties of kinetic energy are recovered, and the motion of the center-of-mass of composite system and relative motion are independent in noncommutative phase space.
- Jun 27 2017 math.AP arXiv:1706.08122v1We study time-harmonic electromagnetic and acoustic waveguides, modeled by an infinite cylinder with a non-smooth cross section. We introduce an infinitesimal generator for the wave evolution along the cylinder, and prove estimates of the functional calculi of these first order non-self adjoint differential operators with non-smooth coefficients. Applying our new functional calculus, we obtain a one-to-one correspondence between polynomially bounded time-harmonic waves and functions in appropriate spectral subspaces.
- Jun 27 2017 math.AP arXiv:1706.08121v1We consider the Cauchy problem on a nonlinear conversation law with large initial data. By Green's function methods, energy methods, Fourier analysis, frequency decomposition, pseudo-differential operators, we obtain the global existence and the optimal decay estimate of $t$.
- The blow up phenomenon in the first step of the classical Picard's scheme was proved in this paper. For certain initial spaces, Bourgain-Pavlović and Yoneda proved the ill-posedness of the Navier-Stokes equations by showing the norm inflation in certain solution spaces. But Chemin and Gallagher said the space $\dot{B}^{-1,\infty}_{\infty}$ seems to be optimal for some solution spaces best chosen. In this paper, we consider more general initial spaces than Bourgain-Pavlović and Yoneda did and establish ill-posedness result independent of the choice of solution space. Our result is a complement of the previous ill-posedness results on Navier-Stokes equations.
- Jun 27 2017 q-bio.GN arXiv:1706.08119v1During evolution of microorganisms genomes underwork have different changes in their lengths, gene orders, and gene contents. Investigating these structural rearrangements helps to understand how genomes have been modified over time. Some elements that play an important role in genome rearrangements are called insertion sequences (ISs), they are the simplest types of transposable elements (TEs) that widely spread within prokaryotic genomes. ISs can be defined as DNA segments that have the ability to move (cut and paste) themselves to another location within the same chromosome or not. Due to their ability to move around, they are often presented as responsible of some of these genomic recombination. Authors of this research work have regarded this claim, by checking if a relation between insertion sequences (ISs) and genome rearrangements can be found. To achieve this goal, a new pipeline that combines various tools have firstly been designed, for detecting the distribution of ORFs that belongs to each IS category. Secondly, links between these predicted ISs and observed rearrangements of two close genomes have been investigated, by seeing them with the naked eye, and by using computational approaches. The proposal has been tested on 18 complete bacterial genomes of Pseudomonas aeruginosa, leading to the conclusion that IS3 family of insertion sequences are related to genomic inversions.
- We prove that for any dimension function $h$ with $h \prec x^d$ and for any countable set of linear patterns, there exists a compact set $E$ with $\mathcal{H}^h(E)>0$ avoiding all the given patterns. We also give several applications and recover results of Keleti, Maga, and Mathe.
- Jun 27 2017 math.PR arXiv:1706.08117v1We consider sums of increments given by a functional of a stationary Markov chain. Letting $T$ be the first return time of the partial sums process to $(-\infty,0]$, under general assumptions we give determine the asymptotic behavior of the survival probability, $\mathbb{P}(T\ge t)\sim Ct^{-1/2}$ for an explicit constant $C$. Our analysis is based on a novel connection between the survival probability and the running maximum of the time-reversed process, and relies on a functional central limit theorem for Markov chains. Our result extends the classic theorem of Sparre Anderson on sums of mean zero and independent increments to the case of correlated increments. As applications, we recover known clustering results for the 3-color cyclic cellular automaton and the Greenberg-Hastings model in one dimension, and we prove a new clustering result for the 3-color firefly cellular automaton.
- Jun 27 2017 math.CA arXiv:1706.08116v1The main objective of this paper is to study some Ostrowski and Cebysev type inequalities in three variables on Time Scales
- In the Steiner point removal (SPR) problem, we are given a weighted graph $G=(V,E)$ and a set of terminals $K\subset V$ of size $k$. The objective is to find a minor $M$ of $G$ with only the terminals as its vertex set, such that the distance between the terminals will be preserved up to a small multiplicative distortion. Kamma, Krauthgamer and Nguyen [KKN15] used a ball-growing algorithm with exponential distributions to show that the distortion is at most $O(\log^5 k)$. Cheung [Che17] improved the analysis of the same algorithm, bounding the distortion by $O(\log^2 k)$. We improve the analysis of this ball-growing algorithm even further, bounding the distortion by $O(\log k)$.
- The existence of an extremal self-dual binary linear code of length 120 is a long-standing open problem. We continue the investigation of its automorphism group, proving that automorphisms of order 8, 30 and 57 cannot occur. Supposing the involutions acting fixed point freely, we show that the automorphism group is of order at most 120, with further restrictions. Finally, we present some necessary conditions for the existence of the code, based on its shadow and on design theory.
- Jun 27 2017 math.AP arXiv:1706.08113v1The purpose of this paper is to investigate acoustic wave scattering by a large number of bubbles in a liquid at frequencies near the Minnaert resonance frequency. This bubbly media has been exploited in practice to obtain super-focusing of acoustic waves. Using layer potential techniques we derive the scattering function for a single spherical bubble excited by an incident wave in the low frequency regime. We then derive the point scatter approximation for multiple scattering by N bubbles. We describe several numerical experiments based on the point scatterer approximation that demonstrate the possibility of achieving super-focusing using bubbly media.
- Jun 27 2017 nucl-th arXiv:1706.08112v1The event detection rates for the WIMP (a dark matter candidate) are calculated with $^{73}$Ge as the detector. The calculations are performed within the deformed shell model (DSM) based on Hartree-Fock states. First the energy levels and magnetic moment for the ground state and two low lying positive parity states for this nucleus are calculated and compared with experiment. The agreement is quite satisfactory. Then the nuclear wave functions are used to investigate the elastic and inelastic scattering of WIMP from $^{73}$Ge. The nuclear structure factors which are independent of supersymmetric model are also calculated as a function of WIMP mass. The event rates are calculated for a given set of SUSY parameters. The calculation shows that $^{73}$Ge is a good detector for detecting dark matter.
- Jun 27 2017 cond-mat.str-el cond-mat.dis-nn arXiv:1706.08111v1We introduce a fully automatic self-learning scheme for detecting phase boundaries. This method extends the previously introduced confusion scheme for learning phase transitions, by using a cooperative network that learns to optimize the guess for the transition point. The networks together are capable of finding transition points for fully unlabeled data. This improvement allows us to efficiently study 1D and 2D parameter spaces, where for the latter we utilize an active contour model -- the snake -- from computer vision as a representation of the learned phase boundary. The snakes, equipped with neural networks, can learn while they move in the parameter space and thereby detect phase boundaries automatically.
- Theoretical studies have proven that the Hilbert space has remarkable performance in many fields of applications. Frames in tensor product of Hilbert spaces were introduced to generalize the inner product to high-order tensors. However, these techniques require tensor decomposition where information could be lost and it is a NP-hard problem to determine the rank of tensors. Here, we present a new framework, namely matrix Hilbert space to perform a matrix inner product space when data observations are represented as matrices. We put forward theoretical analysis, including several basic inequalities, orthogonality and orthonormal basis. In addition, we extend the reproducing kernel Hilbert space (RKHS) to reproducing kernel matrix Hilbert space (RKMHS) and propose an equivalent condition of the space uses of the certain kernel function. A new family of kernels is introduced in our framework and comparative experiments are performed on a number of real-world datasets to support our contributions.
- We use methods from the cohomology of groups to describe the finite groups which can act freely and homologically trivially on closed 3-manifolds which are rational homology spheres.
- Jun 27 2017 math.AP arXiv:1706.08108v1In the present contribution we consider a singular phase field system located in a smooth bounded domain. The entropy balance equation is perturbed by a logarithmic nonlinearity and by the presence of an additional term involving a possibly nonlocal maximal monotone operator and arising from a class of sliding mode control problems. The second equation of the system accounts for the phase dynamics and is deduced from a balance law for the microscopic forces that are responsible for the phase transition process. The resulting system is highly nonlinear and the main difficulties lie in the contemporary presence of two nonlinearities, one of which under time derivative, in the entropy balance equation. Consequently, we are able to prove only the existence of solutions. To this aim, we will introduce a backward finite differences scheme and argue on this by proving uniform estimates and passing to the limit on the time step.
- Jun 27 2017 cs.CV arXiv:1706.08107v1In recent years a growing interest on action recognition is observed, including detection of fall accident for the elderly. However, despite many efforts undertaken, the existing technology is not widely used by elderly, mainly because of its flaws like low precision, large number of false alarms, inadequate privacy preserving during data acquisition and processing. This research work meets these expectations. The work is empirical and it is situated in the field of computer vision systems. The main part of the work situates itself in the area of action and behavior recognition. Efficient algorithms for fall detection were developed, tested and implemented using image sequences and wireless inertial sensor worn by a monitored person. A set of descriptors for depth maps has been elaborated to permit classification of pose as well as the action of a person. Experimental research was carried out based on the prepared data repository consisting of synchronized depth and accelerometric data. The study was carried out in the scenario with a static camera facing the scene and an active camera observing the scene from above. The experimental results showed that the developed algorithms for fall detection have high sensitivity and specificity. The algorithm were designed with regard to low computational demands and possibility to run on ARM platforms. Several experiments including person detection, tracking and fall detection in real-time were carried out to show efficiency and reliability of the proposed solutions.
- Wiem Elghazel, Kamal Medjaher, Nourredine Zerhouni, Jacques Bahi, Ahamd Farhat, Christophe Guyeux, Mourad HakemJun 27 2017 cs.AI arXiv:1706.08106v1In this paper, random forests are proposed for operating devices diagnostics in the presence of a variable number of features. In various contexts, like large or difficult-to-access monitored areas, wired sensor networks providing features to achieve diagnostics are either very costly to use or totally impossible to spread out. Using a wireless sensor network can solve this problem, but this latter is more subjected to flaws. Furthermore, the networks' topology often changes, leading to a variability in quality of coverage in the targeted area. Diagnostics at the sink level must take into consideration that both the number and the quality of the provided features are not constant, and that some politics like scheduling or data aggregation may be developed across the network. The aim of this article is ($1$) to show that random forests are relevant in this context, due to their flexibility and robustness, and ($2$) to provide first examples of use of this method for diagnostics based on data provided by a wireless sensor network.
- Counting the number of interior disjoint empty convex polygons in a point set is a typical Erdős-Szekeres-type problem. We study this problem for 4-gons. Let $P$ be a set of $n$ points in the plane and in general position. A subset $Q$ of $P$ with four points is called a $4$-hole in $P$ if the convex hull of $Q$ is a quadrilateral and does not contain any point of $P$ in its interior. Two 4-holes in $P$ are compatible if their interiors are disjoint. We show that $P$ contains at least $\lfloor 5n/11\rfloor {-} 1$ pairwise compatible 4-holes. This improves the lower bound of $2\lfloor(n-2)/5\rfloor$ which is implied by a result of Sakai and Urrutia (2007).
- Jun 27 2017 astro-ph.IM physics.ins-det arXiv:1706.08104v1Acoustic neutrino detection is a promising approach to extend the energy range of neutrino telescopes to energies beyond $10^{18}$\u2009eV. Currently operational and planned water-Cherenkov neutrino telescopes, most notably KM3NeT, include acoustic sensors in addition to the optical ones. These acoustic sensors could be used as instruments for acoustic detection, while their main purpose is the position calibration of the detection units. In this article, a Monte Carlo simulation chain for acoustic detectors will be presented, covering the initial interaction of the neutrino up to the signal classification of recorded events. The ambient and transient background in the simulation was implemented according to data recorded by the acoustic set-up AMADEUS inside the ANTARES detector. The effects of refraction on the neutrino signature in the detector are studied, and a classification of the recorded events is implemented. As bipolar waveforms similar to those of the expected neutrino signals are also emitted from other sound sources, additional features like the geometrical shape of the propagation have to be considered for the signal classification. This leads to a large improvement of the background suppression by almost two orders of magnitude, since a flat cylindrical "pancake" propagation pattern is a distinctive feature of neutrino signals. An overview of the simulation chain and the signal classification will be presented and preliminary studies of the performance of the classification will be discussed.
- Jun 27 2017 physics.app-ph arXiv:1706.08103v1We consider the problem of the nonlinear response of a Rayleigh beam to the passage of a train of forces moving with stochastic velocity. The Fourier transform and the theory of residues is used to estimate the mean-square amplitude of the beam, while the stochastic averaging method gives the stationary probability density function of the oscillations amplitude. The analysis shows that the effect of the load random velocities is highly nonlinear, leading to a nonmonotonic behavior of the mean amplitude versus the intensity of the stochastic term and of the load weight. The analytic approach is also checked with numerical simulations. The effect of loads number on the system response is numerically investigated.
- The algebraic method of singular reduction is applied for non regular group action on manifolds which provides singular symplectic spaces. The problem of deformation quantization of the singular surfaces is the focus. For some examples of singular Poisson spaces the deformation quantization is explicitly constructed. In is shown that for the flat phase space with the classical moment map and the orthogonal group action the deformation quantization converges for the entire arguments of exponential type.
- Jun 27 2017 cs.CR arXiv:1706.08101v1Investigating how to construct a secure hash algorithm needs in-depth study, as various existing hash functions like the MD5 algorithm have recently exposed their security flaws. At the same time, hash function based on chaotic theory has become an emerging research in the field of nonlinear information security. As an extension of our previous research works, a new chaotic iterations keyed hash function is proposed in this article. Chaotic iterations are used both to construct strategies with pseudorandom number generator and to calculate new hash values using classical hash functions. It is shown that, by doing so, it is possible to apply a kind of post-treatment on existing hash algorithms, which preserves their security properties while adding Devaney's chaos. Security performance analysis of such a post-treatment are finally provided.
- Jun 27 2017 cs.AI arXiv:1706.08100v1In Markov Decision Processes (MDPs), the reward obtained in a state depends on the properties of the last state and action. This state dependency makes it difficult to reward more interesting long-term behaviors, such as always closing a door after it has been opened, or providing coffee only following a request. Extending MDPs to handle such non-Markovian reward function was the subject of two previous lines of work, both using variants of LTL to specify the reward function and then compiling the new model back into a Markovian model. Building upon recent progress in the theories of temporal logics over finite traces, we adopt LDLf for specifying non-Markovian rewards and provide an elegant automata construction for building a Markovian model, which extends that of previous work and offers strong minimality and compositionality guarantees.
- Jun 27 2017 cs.CR arXiv:1706.08099v1The Cipher Block Chaining (CBC) mode of encryption was invented in 1976, and it is currently one of the most commonly used mode. In our previous research works, we have proven that the CBC mode of operation exhibits, under some conditions, a chaotic behavior. The dynamics of this mode has been deeply investigated later, both qualitatively and quantitatively, using the rigorous mathematical topology field of research. In this article, which is an extension of our previous work, we intend to compute a new important quantitative property concerning our chaotic CBC mode of operation, which is the Lyapunov exponent.
- A selection of astrometric catalogues are presented in three tables for respectively positions, proper motions and trigonometric parallaxes. The tables contain characteristics of each catalogue showing the evolution in optical astrometry, in fact the evolution during the past 2000 years for positions. The number of stars and the accuracy are summarized by the weight of a catalogue, proportional with the number of stars and the statistical weight. The present report originally from 2008 was revised in 2017 with much new information about the accuracy of catalogues before 1800 AD.
- Jun 27 2017 cond-mat.mes-hall arXiv:1706.08095v1The nuclear spin state of a phosphorus donor ($^{31}$P) in isotopically enriched silicon-28 is an excellent host to store quantum information in the solid state. The spin's insensitivity to electric fields yield a solid-state qubit with record coherence times, but also renders coupling to other quantum systems very challenging. Here we show that, by coupling the phosphorus donor to an electron shared with an interface dot, a magnetic drive at microwave frequencies creates a strong electric dipole ($>50$ Debye) transition for the donor nuclear spin. The magnetic drive also stabilizes the spin's phase and electric dipole, thereby suppressing decoherence arising from electrical noise. The nuclear spin can then be strongly coupled to microwave resonators, with a vacuum Rabi splitting of order 1 MHz, or to other nuclear spins, nearly half a micrometer apart, via strong electric dipole-dipole interaction. This work brings the $^{31}$P nuclear qubit into the realm of hybrid quantum systems and opens up new avenues in quantum information processing.
- Sub-categories of mathematical topology, like the mathematical theory of chaos, offer interesting applications devoted to information security. In this research work, we have introduced a new chaos-based pseudorandom number generator implemented in FPGA, which is mainly based on the deletion of a Hamilton cycle within the $n$-cube (or on the vectorial negation), plus one single permutation. By doing so, we produce a kind of post-treatment on hardware pseudorandom generators, but the obtained generator has usually a better statistical profile than its input, while running at a similar speed. We tested 6 combinations of Boolean functions and strategies that all achieve to pass the most stringent TestU01 battery of tests. This generation can reach a throughput/latency ratio equal to 6.7 Gbps, being thus the second fastest FPGA generator that can pass TestU01.
- Let $X_1,\ldots,X_n$ be a standard normal sample in $\mathbb R^d$. We compute exactly the expected volume of the Gaussian polytope $\mathrm{conv}[X_1,\ldots,X_n]$, the symmetric Gaussian polytope $\mathrm{conv}[\pm X_1,\ldots,\pm X_n]$, and the Gaussian zonotope $[0,X_1]+\ldots+[0,X_n]$ by exploiting their connection to the regular simplex, the regular crosspolytope, and the cube with the aid of Tsirelson's formula. The expected volumes of these random polytopes are given by essentially the same expressions as the intrinsic volumes and external angles of the regular polytopes. For all these quantities, we obtain asymptotic formulae which are more precise than the results which were known before. More generally, we determine the expected volumes of some heteroscedastic random polytopes including $ \mathrm{conv}[l_1X_1,\ldots,l_nX_n] $ and $ \mathrm{conv}[\pm l_1 X_1,\ldots, \pm l_n X_n], $ where $l_1,\ldots,l_n\geq 0$ are parameters, and the intrinsic volumes of the corresponding deterministic polytopes. Finally, we relate the $k$-th intrinsic volume of the regular simplex $S^{n-1}$ to the expected maximum of independent standard Gaussian random variables $\xi_1,\ldots,\xi_n$ given that the maximum has multiplicity $k$. Namely, we show that $$ V_k(S^n-1) = \frac (2\pi)^\frac k2 k! ⋅\lim_\varepsilon↓0 \varepsilon^1-k \mathbb E [\max{\xi_1,\ldots,\xi_n} 1_{\xi_(n) - \xi_(n-k+1)≤\varepsilon}], $$ where $\xi_{(1)} \leq \ldots \leq \xi_{(n)}$ denote the order statistics. A similar result holds for the crosspolytope if we replace $\xi_1,\ldots,\xi_n$ by their absolute values.
- We calculate the (semi-)static hard-loop self-energy and propagator using the Keldysh formalism in a momentum-space anisotropic quark-gluon plasma. The static retarded, advanced, and Feynman (symmetric) self-energies and propagators are calculated to all orders in the momentum-space anisotropy parameter $\xi$. For the retarded and advanced self-energies/propagators, we present a concise derivation and comparison with previously-obtained results and extend the calculation of the self-energies to next-to-leading order in the gluon energy, $\omega$. For the Feynman self-energy/propagator, we present new results which are accurate to all orders in $\xi$. We compare our exact results with prior expressions for the Feynman self-energy/propagator which were obtained using Taylor-expansions around an isotropic state. We show that, unlike the Taylor-expanded results, the all-orders expression for the Feynman propagator is free from infrared singularities. Finally, we discuss the application of our results to the calculation of the imaginary-part of the heavy-quark potential in an anisotropic quark-gluon plasma.
- In this paper, we present a toolbox for a specific optimization problem that frequently arises in bioinformatics or genomics. In this specific optimisation problem, the state space is a set of words of specified length over a finite alphabet. To each word is associated a score. The overall objective is to find the words which have the lowest possible score. This type of general optimization problem is encountered in e.g 3D conformation optimisation for protein structure prediction, or largest core genes subset discovery based on best supported phylogenetic tree for a set of species. In order to solve this problem, we propose a toolbox that can be easily launched using MPI and embeds 3 well-known metaheuristics. The toolbox is fully parametrized and well documented. It has been specifically designed to be easy modified and possibly improved by the user depending on the application, and does not require to be a computer scientist. We show that the toolbox performs very well on two difficult practical problems.
- Jun 27 2017 cs.CV arXiv:1706.08088v1Wireless Multimedia Sensor Network (WMSN) is a promising technology capturing rich multimedia data like audio and video, which can be useful to monitor an environment under surveillance. However, many scenarios in real time monitoring requires 3D depth information. In this research work, we propose to use the disparity map that is computed from two or multiple images, in order to monitor the depth information in an object or event under surveillance using WMSN. Our system is based on distributed wireless sensors allowing us to notably reduce the computational time needed for 3D depth reconstruction, thus permitting the success of real time solutions. Each pair of sensors will capture images for a targeted place/object and will operate a Stereo Matching in order to create a Disparity Map. Disparity maps will give us the ability to decrease traffic on the bandwidth, because they are of low size. This will increase WMSN lifetime. Any event can be detected after computing the depth value for the target object in the scene, and also 3D scene reconstruction can be achieved with a disparity map and some reference(s) image(s) taken by the node(s).
- A. V. Malyshev, D. A. Glazov, A. V. Volotka, I. I. Tupitsyn, V. M. Shabaev, G. Plunien, Th. StöhlkerJun 27 2017 physics.atom-ph arXiv:1706.08087v1High-precision QED calculations of the ground-state ionization energies are performed for all boronlike ions with the nuclear charge numbers in the range $16 \leqslant Z\leqslant 96$. The rigorous QED calculations are performed within the extended Furry picture and include all many-electron QED effects up to the second order of the perturbation theory. The contributions of the third- and higher-order electron-correlation effects are accounted for within the Breit approximation. The nuclear recoil and nuclear polarization effects are taken into account as well. In comparison with the previous evaluations of the ground-state ionization energies of boronlike ions the accuracy of the theoretical predictions has been improved significantly.
- Jun 27 2017 nucl-th arXiv:1706.08086v1Tamura coupling model has been extended to consider the coupling of additional low-lying rotational bands to the ground state band. Rotational bands are built on vibrational bandheads (even-even targets) or single particle bandheads (odd-$A$ targets) including both axial and non-axial deformations. These additional excitations are introduced as a perturbation to the underlying axially-symmetric rigid rotor structure of the ground state rotational band. Coupling matrix elements of the generalized optical model are derived for extended multi-band transitions in even-even and odd-$A$ nuclei. Isospin symmetric formulation of the optical model is employed. A coupled-channels optical model potential (OMP) containing a dispersive contribution is used to fit simultaneously all available optical experimental databases including neutron strength functions for nucleon scattering on $^{232}$Th, $^{233,235,238}$U and $^{239}$Pu nuclei and quasi-elastic ($p$,$n$) scattering data on $^{232}$Th and $^{238}$U. Lane consistent OMP is derived for all actinides if corresponding multi-band coupling schemes are defined. Calculations using the derived OMP potential reproduce measured total cross-section differences between several actinide pairs within experimental uncertainty for incident neutron energies from 50 keV up to 150MeV. Multi-band coupling is stronger in even-even targets due to the collective nature of the coupling; the impact of extended coupling on predicted compound-nucleus formation cross section reaches 5% below 3 MeV of incident neutron energy. Coupling of ground-state rotational band levels in odd-$A$ nuclei is sufficient for a good description of the compound-nucleus formation cross sections as long as the coupling is saturated (a minimum of 7 coupled levels are typically needed).
- Jun 27 2017 cond-mat.quant-gas arXiv:1706.08085v1Spin-1 Bose gas with anti-ferromagnetic interactions can form a Bose condensate of singlet pairs (singlet molecules) at low concentrations of atoms. We show that despite the effective attractive inter-atomic interactions in spin-singlet channel, the molecular condensate can be stabilized against further collapse due to the repulsive interactions in the spin-2 channel, and determine the region of stability of the singlet condensate. Our results provide an example of stabilization of the Bose-condensed phase by competing attractive and repulsive interactions.
- Jun 27 2017 math.CV arXiv:1706.08084v1In this paper we study the global geometry of the Kobayashi metric on "convex" sets. We provide new examples of non-Gromov hyperbolic domains in $\mathbb{C}^n$ of many kinds: pseudoconvex and non-pseudocon \newline -vex, bounded and unbounded. Our first aim is to prove that if $\Omega$ is a bounded weakly linearly convex domain in $\mathbb{C}^n,\,n\geq 2,$ and $S$ is an affine complex hyperplane intersecting $\Omega,$ then the domain $\Omega\setminus S$ endowed with the Kobayashi metric is not Gromov hyperbolic (Theorem 1.3). Next we localize this result on Kobayashi hyperbolic convex domains. Namely, we show that Gromov hyperbolicity of every open set of the form $\Omega\setminus S',$ where $S'$ is relatively closed in $\Omega$ and $\Omega$ is a convex domain, depends only on that how $S'$ looks near the boundary, i.e., whether $S'$ near $\partial\Omega$ (Theorem 1.7). We close the paper with a general remark on Hartogs type domains. The paper extends in an essential way results in [6].

Simulation of non-Pauli Channels

Kenneth Goodenough Jun 21 2017 12:48 UTCStefano Pirandola Jun 20 2017 13:26 UTC

...(continued)Hi Kenneth, more precisely that plot is for a particular "Pauli-damping" channel, i.e., a qubit channel that is decomposable into a Pauli channel (1) and an amplitude damping channel (2). This "Pauli-damping" channel can be simulated by performing noisy teleportation over a resource state that corre

Kenneth Goodenough Jun 20 2017 12:47 UTC

Interesting work! I was wondering, how do the new upper bounds for the amplitude-damping channel in Fig. 2 compare to previous bounds?

Barbara Terhal Jun 20 2017 07:25 UTC

It would be good if this conflict on assigning priority and credit is peacefully resolved by the parties involved (i have no opinions on the matter).

Stefano Pirandola Jun 15 2017 05:32 UTC

...(continued)The secret-key capacity of the pure-loss channel -log(1-t) was proven in [9], not in the follow-up work [13] (which appeared 4 months later). Ref. [13] found that this capacity is also a strong converse bound, which is Eq. (1) here. Same story for Eq. (4) that was proven in [9], not in [13]. Again t

Chris Ferrie Jun 09 2017 10:06 UTC

I have posted an open review of this paper here: https://github.com/csferrie/openreviews/blob/master/arxiv.1703.09835/arxiv.1703.09835.md

Eddie Smolansky May 26 2017 05:23 UTC

...(continued)Updated summary [here](https://github.com/eddiesmo/papers).

# How they made the dataset

- collect youtube videos

- automated filtering with yolo and landmark detection projects

- crowd source final filtering (AMT - give 50 face images to turks and ask which don't belong)

- quality control through s

Felix Leditzky May 24 2017 20:43 UTC

...(continued)Yes, that's right, thanks!

For (5), you use the Cauchy-Schwarz inequality $\left| \operatorname{tr}(X^\dagger Y) \right| \leq \sqrt{\operatorname{tr}(X^\dagger X)} \sqrt{\operatorname{tr}(Y^\dagger Y)}$ for the Hilbert-Schmidt inner product $\langle X,Y\rangle := \operatorname{tr}(X^\dagger Y)$ wi

Michael Tolan May 24 2017 20:27 UTC

Just reading over Eq (5) on P5 concerning the diamond norm.

Should the last $\sigma_1$ on the 4th line be replaced with a $\sigma_2$? I think I can see how the proof is working but not entirely certain.

Noon van der Silk May 23 2017 11:15 UTC

...(continued)I think this thread has reached it's end.

I've locked further comments, and I hope that the quantum computing community can thoughtfully find an approach to language that is inclusive to all and recognises the diverse background of all researchers, current and future.

I direct your attention t