2,513 research outputs found
Wind-tunnel study of the effects of propeller operation and flap deflection on the pitching moments and elevator hinge moments of a single-engine pursuit-type airplane
CF6-6D engine performance deterioration
Cruise cockpit recordings and test cell performance data in conjunction with hardware inspection data from airline overhaul shops were analyzed to define the extent and magnitude of performance deterioration of the General Electric CF6-6D model engine. These studies successfully isolated short-term deterioration from the longer term, and defined areas where a significant reduction in aircraft energy requirements for the 1980's can be realized. Unrestored losses which remain after engine refurbishment represent over 70% of the loss at engine shop visit. Sixty-three percent of the unrestored losses are cost-effective to restore which could reduce fuel consumed by CF6-6D engines in 1980 by 10.9 million gallons
Bankruptcy
The authors analyze developments in bankruptcy, including decisions involving the rights of secured parties and lienors, jurisdiction of the bankruptcy courts, valuation of security, discharge, preferences and newsman\u27s and attorney-client privileges in bankruptcy. The article also reports recent decisions interpreting the Uniform Commercial Code as it pertains to bankruptcy. Included are a number of bankruptcy issues which recently have been adjudicated for the first time
Midcourse maneuver operations program
Midcourse Maneuver Operations Program /MMOP/ computes the required velocity change to correct a spacecraft trajectory. The program establishes the existence of maneuvers which satisfy spacecraft constraints, explores alternate trajectories in the event that some out-of-tolerance condition forces a change in plans, and codes the maneuvers into commands
Monotonic Prefix Consistency in Distributed Systems
We study the issue of data consistency in distributed systems. Specifically,
we consider a distributed system that replicates its data at multiple sites,
which is prone to partitions, and which is assumed to be available (in the
sense that queries are always eventually answered). In such a setting, strong
consistency, where all replicas of the system apply synchronously every
operation, is not possible to implement. However, many weaker consistency
criteria that allow a greater number of behaviors than strong consistency, are
implementable in available distributed systems. We focus on determining the
strongest consistency criterion that can be implemented in a convergent and
available distributed system that tolerates partitions. We focus on objects
where the set of operations can be split into updates and queries. We show that
no criterion stronger than Monotonic Prefix Consistency (MPC) can be
implemented.Comment: Submitted pape
Four-Round Concurrent Non-Malleable Commitments from One-Way Functions
How many rounds and which assumptions are required for concurrent non-malleable commitments? The above question has puzzled researchers for several years. Pass in [TCC 2013] showed a lower bound of 3 rounds for the case of black-box reductions to falsifiable hardness assumptions with respect to polynomial-time adversaries. On the other side, Goyal [STOC 2011], Lin and Pass [STOC 2011] and Goyal et al. [FOCS 2012] showed that one-way functions (OWFs) are sufficient with a constant number of rounds. More recently Ciampi et al. [CRYPTO 2016] showed a 3-round construction based on subexponentially strong one-way permutations. In this work we show as main result the first 4-round concurrent non-malleable commitment scheme assuming the existence of any one-way function. Our approach builds on a new security notion for argument systems against man-in-the-middle attacks: Simulation-Witness-Independence. We show how to construct a 4-round one-many simulation-witnesses-independent argument system from one-way functions. We then combine this new tool in parallel with a weak form of non-malleable commitments constructed by Goyal et al. in [FOCS 2014] obtaining the main result of our work
Revisiting Deniability in Quantum Key Exchange via Covert Communication and Entanglement Distillation
We revisit the notion of deniability in quantum key exchange (QKE), a topic
that remains largely unexplored. In the only work on this subject by Donald
Beaver, it is argued that QKE is not necessarily deniable due to an
eavesdropping attack that limits key equivocation. We provide more insight into
the nature of this attack and how it extends to other constructions such as QKE
obtained from uncloneable encryption. We then adopt the framework for quantum
authenticated key exchange, developed by Mosca et al., and extend it to
introduce the notion of coercer-deniable QKE, formalized in terms of the
indistinguishability of real and fake coercer views. Next, we apply results
from a recent work by Arrazola and Scarani on covert quantum communication to
establish a connection between covert QKE and deniability. We propose DC-QKE, a
simple deniable covert QKE protocol, and prove its deniability via a reduction
to the security of covert QKE. Finally, we consider how entanglement
distillation can be used to enable information-theoretically deniable protocols
for QKE and tasks beyond key exchange.Comment: 16 pages, published in the proceedings of NordSec 201
- …