18,051 research outputs found
Hot corrosion resistance of nickel-chromium-aluminum alloys
The hot corrosion resistance of nickel-chromium-aluminum alloy was examined by cyclically oxidizing sodium sulfate coated specimens in still air at 900, 1000 and 1100 C. The compositions tested were within the ternary region: Ni; Ni-50 at.% Cr; and Ni-50 at.% Al. At each temperature the corrosion data were statistically fitted to a third order regression equation as a function of chromium and aluminum contents. Corrosion isopleths were prepared from these equations. Compositional regions with the best hot corrosion resistance were identified
Fast Consensus under Eventually Stabilizing Message Adversaries
This paper is devoted to deterministic consensus in synchronous dynamic
networks with unidirectional links, which are under the control of an
omniscient message adversary. Motivated by unpredictable node/system
initialization times and long-lasting periods of massive transient faults, we
consider message adversaries that guarantee periods of less erratic message
loss only eventually: We present a tight bound of for the termination
time of consensus under a message adversary that eventually guarantees a single
vertex-stable root component with dynamic network diameter , as well as a
simple algorithm that matches this bound. It effectively halves the termination
time achieved by an existing consensus algorithm, which also works under
our message adversary. We also introduce a generalized, considerably stronger
variant of our message adversary, and show that our new algorithm, unlike the
existing one, still works correctly under it.Comment: 13 pages, 5 figures, updated reference
Isothermal and cyclic oxidation at 1000 and 1100 deg C of four nickel-base alloys: NASA-TRW VIA, B-1900, 713C, and 738X
The isothermal and cyclic oxidation resistance of four cast Ni-base gamma + gamma prime alloys, NASA-TRW Via, B-1900, 713C, and 738X, was determined in still air at 1000 and 1100 C. The oxidation process was evaluated by specific sample weight change with time, sample thickness change, X-ray diffraction of the scales, and sample metallography. The behavior is discussed in terms of the Cr, Al, and refractory metal contents of the alloys
Distributed Approximation Algorithms for Weighted Shortest Paths
A distributed network is modeled by a graph having nodes (processors) and
diameter . We study the time complexity of approximating {\em weighted}
(undirected) shortest paths on distributed networks with a {\em
bandwidth restriction} on edges (the standard synchronous \congest model). The
question whether approximation algorithms help speed up the shortest paths
(more precisely distance computation) was raised since at least 2004 by Elkin
(SIGACT News 2004). The unweighted case of this problem is well-understood
while its weighted counterpart is fundamental problem in the area of
distributed approximation algorithms and remains widely open. We present new
algorithms for computing both single-source shortest paths (\sssp) and
all-pairs shortest paths (\apsp) in the weighted case.
Our main result is an algorithm for \sssp. Previous results are the classic
-time Bellman-Ford algorithm and an -time
-approximation algorithm, for any integer
, which follows from the result of Lenzen and Patt-Shamir (STOC 2013).
(Note that Lenzen and Patt-Shamir in fact solve a harder problem, and we use
to hide the O(\poly\log n) term.) We present an -time -approximation algorithm for \sssp. This
algorithm is {\em sublinear-time} as long as is sublinear, thus yielding a
sublinear-time algorithm with almost optimal solution. When is small, our
running time matches the lower bound of by Das Sarma
et al. (SICOMP 2012), which holds even when , up to a
\poly\log n factor.Comment: Full version of STOC 201
Primary and secondary particle contributions to the depth dose distribution in a phantom shielded from solar flare and Van Allen protons
Calculations have been made using the nucleon-meson transport code NMTC to estimate the absorbed dose and dose equivalent distributions in astronauts inside space vehicles bombarded by solar flare and Van Allen protons. A spherical shell shield of specific radius and thickness with a 30-cm-diam. tissue ball at the geometric center was used to simulate the spacecraft-astronaut configuration. The absorbed dose and the dose equivalent from primary protons, secondary protons, heavy nuclei, charged pions, muons, photons, and positrons and electrons are given as a function of depth in the tissue phantom. Results are given for solar flare protons with a characteristic rigidity of 100 MV and for Van Allen protons in a 240-nautical-mile circular orbit at 30 degree inclination angle incident on both 20-g/sq cm-thick aluminum and polyethylene spherical shell shields
Breathing Machines, Patchwork Monsters and Mechanical Limbs: Steampunk and the Grotesque
Steampunk literature commonly focuses on improving, constructing, and reconstructing living bodies, through living machinery, vivisections, and other techno-fantastical experimentation. These bodies are grotesque forms. Focusing on various steampunk grotesque creations and creators, and exploring the audience relationship to the grotesque through an examination of the grotesque interval, this study aims to explore how steampunk authors use these grotesques to examine their own relationship with technology and scientific progress. “Breathing Machines, Patchwork Monsters, and Mechanical Limbs: Steampunk and the Grotesque,” concludes by applying its analysis of the steampunk grotesque to the steampunk subculture, especially as this applies to costuming, art, music, and technology
Recent innovations in Treasury cash management
The Treasury Tax and Loan program, a joint undertaking of the Treasury and the Federal Reserve, is designed to manage federal tax receipts and stabilize the supply of reserves in the banking system. Three recent innovations-electronic collection of business taxes, real-time investment of excess Treasury balances, and competitive bidding for Treasury deposits-have materially enhanced the ability of the two agencies to achieve these objectives.Taxation ; Tax and loan account ; Federal Reserve System
Faster annealing schedules for quantum annealing
New annealing schedules for quantum annealing are proposed based on the
adiabatic theorem. These schedules exhibit faster decrease of the excitation
probability than a linear schedule. To derive this conclusion, the asymptotic
form of the excitation probability for quantum annealing is explicitly obtained
in the limit of long annealing time. Its first-order term, which is inversely
proportional to the square of the annealing time, is shown to be determined
only by the information at the initial and final times. Our annealing schedules
make it possible to drop this term, thus leading to a higher order (smaller)
excitation probability. We verify these results by solving numerically the
time-dependent Schrodinger equation for small size systemsComment: 10 pages, 5 figures, minor correction
Theoretical and experimental studies of the deposition of Na2So4 from seeded combustion gases
Flames in a Mach 0.3 atmospheric pressure laboratory burner rig were doped with sea salt, NaS04, and NaCl, respectively, in an effort to validate theoretical dew point predictions made by a local thermochemical equilibrium (LTCE) method of predicting condensation temperatures of sodium sulfate in flame environments. Deposits were collected on cylindrical platinum targets placed in the combustion products, and the deposition was studied as a function of collector temperature. Experimental deposition onset temperatures checked within experimental error with LTCE-predicted temperatures. A multicomponent mass transfer equation was developed to predict the rate of deposition of Na2SO4(c) via vapor transport at temperatures below the deposition onset temperature. Agreement between maximum deposition rates predicted by this chemically frozen boundary layer (CFBL) theory and those obtained in the seeded laboratory burner experiments is good
- …