Evolution of Giant Planets in Eccentric Disks

We investigate the interaction between a giant planet and a viscous circumstellar disk by means of high-resolution, two-dimensional hydrodynamical simulations. We consider planet masses that range from 1 to 3 Jupiter masses (Mjup) and initial orbital eccentricities that range from 0 to 0.4. We find that a planet can cause eccentricity growth in a disk region adjacent to the planet's orbit, even if the planet's orbit is circular. Disk-planet interactions lead to growth in a planet's orbital eccentricity. The orbital eccentricities of a 2 Mjup and a 3 Mjup planet increase from 0 to 0.11 within about 3000 orbits. Over a similar time period, the orbital eccentricity of a 1 Mjup planet grows from 0 to 0.02. For a case of a 1 Mjup planet with an initial eccentricity of 0.01, the orbital eccentricity grows to 0.09 over 4000 orbits. Radial migration is directed inwards, but slows considerably as a planet's orbit becomes eccentric. If a planet's orbital eccentricity becomes sufficiently large, e > ~0.2, migration can reverse and so be directed outwards. The accretion rate towards a planet depends on both the disk and the planet orbital eccentricity and is pulsed over the orbital period. Planet mass growth rates increase with planet orbital eccentricity. For e~0.2 the mass growth rate of a planet increases by approximately 30% above the value for e=0. For e > ~0.1, most of the accretion within the planet's Roche lobe occurs when the planet is near the apocenter. Similar accretion modulation occurs for flow at the inner disk boundary which represents accretion toward the star.Comment: 20 pages 16 figures, 3 tables. To appear in The Astrophysical Journal vol.652 (December 1, 2006 issue

Tractable Pathfinding for the Stochastic On-Time Arrival Problem

We present a new and more efficient technique for computing the route that maximizes the probability of on-time arrival in stochastic networks, also known as the path-based stochastic on-time arrival (SOTA) problem. Our primary contribution is a pathfinding algorithm that uses the solution to the policy-based SOTA problem---which is of pseudo-polynomial-time complexity in the time budget of the journey---as a search heuristic for the optimal path. In particular, we show that this heuristic can be exceptionally efficient in practice, effectively making it possible to solve the path-based SOTA problem as quickly as the policy-based SOTA problem. Our secondary contribution is the extension of policy-based preprocessing to path-based preprocessing for the SOTA problem. In the process, we also introduce Arc-Potentials, a more efficient generalization of Stochastic Arc-Flags that can be used for both policy- and path-based SOTA. After developing the pathfinding and preprocessing algorithms, we evaluate their performance on two different real-world networks. To the best of our knowledge, these techniques provide the most efficient computation strategy for the path-based SOTA problem for general probability distributions, both with and without preprocessing.Comment: Submission accepted by the International Symposium on Experimental Algorithms 2016 and published by Springer in the Lecture Notes in Computer Science series on June 1, 2016. Includes typographical corrections and modifications to pre-processing made after the initial submission to SODA'15 (July 7, 2014

A decidable policy language for history-based transaction monitoring

Online trading invariably involves dealings between strangers, so it is important for one party to be able to judge objectively the trustworthiness of the other. In such a setting, the decision to trust a user may sensibly be based on that user's past behaviour. We introduce a specification language based on linear temporal logic for expressing a policy for categorising the behaviour patterns of a user depending on its transaction history. We also present an algorithm for checking whether the transaction history obeys the stated policy. To be useful in a real setting, such a language should allow one to express realistic policies which may involve parameter quantification and quantitative or statistical patterns. We introduce several extensions of linear temporal logic to cater for such needs: a restricted form of universal and existential quantification; arbitrary computable functions and relations in the term language; and a "counting" quantifier for counting how many times a formula holds in the past. We then show that model checking a transaction history against a policy, which we call the history-based transaction monitoring problem, is PSPACE-complete in the size of the policy formula and the length of the history. The problem becomes decidable in polynomial time when the policies are fixed. We also consider the problem of transaction monitoring in the case where not all the parameters of actions are observable. We formulate two such "partial observability" monitoring problems, and show their decidability under certain restrictions

Tameness of holomorphic closure dimension in a semialgebraic set

Given a semianalytic set S in a complex space and a point p in S, there is a unique smallest complex-analytic germ at p which contains the germ of S, called the holomorphic closure of S at p. We show that if S is semialgebraic then its holomorphic closure is a Nash germ, for every p, and S admits a semialgebraic filtration by the holomorphic closure dimension. As a consequence, every semialgebraic subset of a complex vector space admits a semialgebraic stratification into CR manifolds satisfying a strong version of the condition of the frontier.Comment: Published versio

Gathering Anonymous, Oblivious Robots on a Grid

We consider a swarm of $n$ autonomous mobile robots, distributed on a 2-dimensional grid. A basic task for such a swarm is the gathering process: All robots have to gather at one (not predefined) place. A common local model for extremely simple robots is the following: The robots do not have a common compass, only have a constant viewing radius, are autonomous and indistinguishable, can move at most a constant distance in each step, cannot communicate, are oblivious and do not have flags or states. The only gathering algorithm under this robot model, with known runtime bounds, needs $\mathcal{O}(n^2)$ rounds and works in the Euclidean plane. The underlying time model for the algorithm is the fully synchronous $\mathcal{FSYNC}$ model. On the other side, in the case of the 2-dimensional grid, the only known gathering algorithms for the same time and a similar local model additionally require a constant memory, states and "flags" to communicate these states to neighbors in viewing range. They gather in time $\mathcal{O}(n)$. In this paper we contribute the (to the best of our knowledge) first gathering algorithm on the grid that works under the same simple local model as the above mentioned Euclidean plane strategy, i.e., without memory (oblivious), "flags" and states. We prove its correctness and an $\mathcal{O}(n^2)$ time bound in the fully synchronous $\mathcal{FSYNC}$ time model. This time bound matches the time bound of the best known algorithm for the Euclidean plane mentioned above. We say gathering is done if all robots are located within a $2\times 2$ square, because in $\mathcal{FSYNC}$ such configurations cannot be solved

Entangled Quantum Clocks for Measuring Proper-Time Difference

We report that entangled pairs of quantum clocks (non-degenerate quantum bits) can be used as a specialized detector for precisely measuring difference of proper-times that each constituent quantum clock experiences. We describe why the proposed scheme would be more precise in the measurement of proper-time difference than a scheme of two-separate-quantum-clocks. We consider possibilities that the proposed scheme can be used in precision test of the relativity theory.Comment: no correction, 4 pages, RevTe

Spectroscopy by frequency entangled photon pairs

Quantum spectroscopy was performed using the frequency-entangled broadband photon pairs generated by spontaneous parametric down-conversion. An absorptive sample was placed in front of the idler photon detector, and the frequency of signal photons was resolved by a diffraction grating. The absorption spectrum of the sample was measured by counting the coincidences, and the result is in agreement with the one measured by a conventional spectrophotometer with a classical light source.Comment: 11 pages, 5 figures, to be published in Phys. Lett.

Recent developments in planet migration theory

Planetary migration is the process by which a forming planet undergoes a drift of its semi-major axis caused by the tidal interaction with its parent protoplanetary disc. One of the key quantities to assess the migration of embedded planets is the tidal torque between the disc and planet, which has two components: the Lindblad torque and the corotation torque. We review the latest results on both torque components for planets on circular orbits, with a special emphasis on the various processes that give rise to additional, large components of the corotation torque, and those contributing to the saturation of this torque. These additional components of the corotation torque could help address the shortcomings that have recently been exposed by models of planet population syntheses. We also review recent results concerning the migration of giant planets that carve gaps in the disc (type II migration) and the migration of sub-giant planets that open partial gaps in massive discs (type III migration).Comment: 52 pages, 18 figures. Review article to be published in "Tidal effects in Astronomy and Astrophysics", Lecture Notes in Physic

Early socialization and environmental enrichment of lactating piglets affects the caecal microbiota and metabolomic response after weaning

The aim of this study was to determine the possible impact of early socialization and an enriched neonatal environment to improve adaptation of piglets to weaning. We hypothesized that changes in the microbiota colonization process and in their metabolic response and intestinal functionality could help the animals face weaning stress. A total of 48 sows and their litters were allotted into a control (CTR) or an enriched treatment (ENR), in which piglets from two adjacent pens were combined and enriched with toys. The pattern of caecal microbial colonization, the jejunal gene expression, the serum metabolome and the intestinal physiology of the piglets were assessed before (-2 d) and after weaning (+ 3d). A differential ordination of caecal microbiota was observed after weaning. Serum metabolome suggested a reduced energetic metabolism in ENR animals, as evidenced by shifts in triglycerides and fatty acids, VLDL/LDL and creatine regions. The TLR2 gene showed to be downregulated in the jejunum of ENR pigs after weaning. The integration of gene expression, metabolome and microbiota datasets confirmed that differences between barren and enriched neonatal environments were evident only after weaning. Our results suggest that improvements in adaptation to weaning could be mediated by a better response to the post-weaning stress.info:eu-repo/semantics/publishedVersio

Projection on Segre varieties and determination of holomorphic mappings between real submanifolds

It is shown that a germ of a holomorphic mapping sending a real-analytic generic submanifold of finite type into another is determined by its projection on the Segre variety of the target manifold. A necessary and sufficient condition is given for a germ of a mapping into the Segre variety of the target manifold to be the projection of a holomorphic mapping sending the source manifold into the target. An application to the biholomorphic equivalence problem is also given.Comment: 16 page