University of Texas at Austin

About: University of Texas at Austin is a education organization based out in Austin, Texas, United States. It is known for research contribution in the topics: Population & Poison control. The organization has 94352 authors who have published 206297 publications receiving 9070052 citations. The organization is also known as: UT-Austin & UT Austin.

Planetary Candidates Observed by Kepler, III: Analysis of the First 16 Months of Data

Abstract: New transiting planet candidates are identified in sixteen months (May 2009 - September 2010) of data from the Kepler spacecraft. Nearly five thousand periodic transit-like signals are vetted against astrophysical and instrumental false positives yielding 1,091 viable new planet candidates, bringing the total count up to over 2,300. Improved vetting metrics are employed, contributing to higher catalog reliability. Most notable is the noise-weighted robust averaging of multi-quarter photo-center offsets derived from difference image analysis which identifies likely background eclipsing binaries. Twenty-two months of photometry are used for the purpose of characterizing each of the new candidates. Ephemerides (transit epoch, T_0, and orbital period, P) are tabulated as well as the products of light curve modeling: reduced radius (Rp/R*), reduced semi-major axis (d/R*), and impact parameter (b). The largest fractional increases are seen for the smallest planet candidates (197% for candidates smaller than 2Re compared to 52% for candidates larger than 2Re) and those at longer orbital periods (123% for candidates outside of 50-day orbits versus 85% for candidates inside of 50-day orbits). The gains are larger than expected from increasing the observing window from thirteen months (Quarter 1-- Quarter 5) to sixteen months (Quarter 1 -- Quarter 6). This demonstrates the benefit of continued development of pipeline analysis software. The fraction of all host stars with multiple candidates has grown from 17% to 20%, and the paucity of short-period giant planets in multiple systems is still evident. The progression toward smaller planets at longer orbital periods with each new catalog release suggests that Earth-size planets in the Habitable Zone are forthcoming if, indeed, such planets are abundant.

Planet Occurrence within 0.25 AU of Solar-Type Stars from Kepler

Abstract: We report the distribution of planets as a function of planet radius, orbital period, and stellar effective temperature for orbital periods less than 50 days around solar-type (GK) stars. These results are based on the 1235 planets (formally "planet candidates") from the Kepler mission that include a nearly complete set of detected planets as small as 2 R_⊕. For each of the 156,000 target stars, we assess the detectability of planets as a function of planet radius, R_p, and orbital period, P, using a measure of the detection efficiency for each star. We also correct for the geometric probability of transit, R_*/a. We consider first Kepler target stars within the "solar subset" having T_eff = 4100-6100 K, log g = 4.0-4.9, and Kepler magnitude K_p 2 R_⊕ we measure an occurrence of less than 0.001 planets per star. For all planets with orbital periods less than 50 days, we measure occurrence of 0.130 ± 0.008, 0.023 ± 0.003, and 0.013 ± 0.002 planets per star for planets with radii 2-4, 4-8, and 8-32 R_⊕, in agreement with Doppler surveys. We fit occurrence as a function of P to a power-law model with an exponential cutoff below a critical period P_0. For smaller planets, P_0 has larger values, suggesting that the "parking distance" for migrating planets moves outward with decreasing planet size. We also measured planet occurrence over a broader stellar T_eff range of 3600-7100 K, spanning M0 to F2 dwarfs. Over this range, the occurrence of 2-4 R_⊕ planets in the Kepler field increases with decreasing T_eff, with these small planets being seven times more abundant around cool stars (3600-4100 K) than the hottest stars in our sample (6600-7100 K).

Reynolds averaged turbulence modelling using deep neural networks with embedded invariance

Abstract: There exists significant demand for improved Reynolds-averaged Navier–Stokes (RANS) turbulence models that are informed by and can represent a richer set of turbulence physics. This paper presents a method of using deep neural networks to learn a model for the Reynolds stress anisotropy tensor from high-fidelity simulation data. A novel neural network architecture is proposed which uses a multiplicative layer with an invariant tensor basis to embed Galilean invariance into the predicted anisotropy tensor. It is demonstrated that this neural network architecture provides improved prediction accuracy compared with a generic neural network architecture that does not embed this invariance property. The Reynolds stress anisotropy predictions of this invariant neural network are propagated through to the velocity field for two test cases. For both test cases, significant improvement versus baseline RANS linear eddy viscosity and nonlinear eddy viscosity models is demonstrated.

Effect of Structure on the Fe3 + / Fe2 + Redox Couple in Iron Phosphates

Abstract: To understand the role of structure on the position of the octahedral redox couple in compounds having the same polyanions, four iron phosphates: , and were investigated. They vary in structure as well as in the manner in which the octahedral iron atoms are linked to each other. The redox couple in the above compounds lies at 2.8, 2.9, 3.1, and 3.5 eV, respectively, below the Fermi level of lithium. The reason for the difference in the position of the redox couples is related to changes in the P‒O bond lengths as well as to changes in the crystalline electric field at the iron sites.

Compact Proofs of Retrievability

Abstract: In a proof-of-retrievability system, a data storage center convinces a verifier that he is actually storing all of a client's data. The central challenge is to build systems that are both efficient and provably secure--that is, it should be possible to extract the client's data from any prover that passes a verification check. In this paper, we give the first proof-of-retrievability schemes with full proofs of security against arbitrary adversaries in the strongest model, that of Juels and Kaliski. Our first scheme, built from BLS signatures and secure in the random oracle model, has the shortest query and response of any proof-of-retrievability with public verifiability. Our second scheme, which builds elegantly on pseudorandom functions (PRFs) and is secure in the standard model, has the shortest response of any proof-of-retrievability scheme with private verifiability (but a longer query). Both schemes rely on homomorphic properties to aggregate a proof into one small authenticator value.