157 research outputs found

    Cogeneration Technology Alternatives Study (CTAS). Volume 5: Cogeneration systems results

    Get PDF
    The use of various advanced energy conversion systems is examined and compared with each other and with current technology systems for savings in fuel energy, costs, and emissions in individual plants and on a national level. About fifty industrial processes from the largest energy consuming sectors were used as a basis for matching a similar number of energy conversion systems that are considered as candidate which can be made available by the 1985 to 2000 time period. The sectors considered included food, textiles, lumber, paper, chemicals, petroleum, glass, and primary metals. The energy conversion systems included steam and gas turbines, diesels, thermionics, stirling, closed cycle and steam injected gas turbines, and fuel cells. Fuels considered were coal, both coal and petroleum based residual and distillate liquid fuels, and low Btu gas obtained through the on site gasification of coal. The methodology and results of matching the cogeneration energy conversion systems to approximately 50 industrial processes are described. Results include fuel energy saved, levelized annual energy cost saved, return on investment, and operational factors relative to the noncogeneration base cases

    Cogeneration Technology Alternatives Study (CTAS). Volume 2: Analytical approach

    Get PDF
    The use of various advanced energy conversion systems were compared with each other and with current technology systems for their savings in fuel energy, costs, and emissions in individual plants and on a national level. The ground rules established by NASA and assumptions made by the General Electric Company in performing this cogeneration technology alternatives study are presented. The analytical methodology employed is described in detail and is illustrated with numerical examples together with a description of the computer program used in calculating over 7000 energy conversion system-industrial process applications. For Vol. 1, see 80N24797

    Denial-of-service resilience in peer-to-peer file sharing systems

    Get PDF
    Peer-to-peer (p2p) file sharing systems are characterized by highly replicated content distributed among nodes with enormous aggregate resources for storage and communication. These properties alone are not sufficient, however, to render p2p networks immune to denial-of-service (DoS) attack. In this paper, we study, by means of analytical modeling and simulation, the resilience of p2p file sharing systems against DoS attacks, in which malicious nodes respond to queries with erroneous responses. We consider the filetargeted attacks in current use in the Internet, and we introduce a new class of p2p-network-targeted attacks. In file-targeted attacks, the attacker puts a large number of corrupted versions of a single file on the network. We demonstrate that the effectiveness of these attacks is highly dependent on the clients’ behavior. For the attacks to succeed over the long term, clients must be unwilling to share files, slow in removing corrupted files from their machines, and quick to give up downloading when the system is under attack. In network-targeted attacks, attackers respond to queries for any file with erroneous information. Our results indicate that these attacks are highly scalable: increasing the number of malicious nodes yields a hyperexponential decrease in system goodput, and a moderate number of attackers suffices to cause a near-collapse of the entire system. The key factors inducing this vulnerability are (i) hierarchical topologies with misbehaving “supernodes,” (ii) high path-length networks in which attackers have increased opportunity to falsify control information, and (iii) power-law networks in which attackers insert themselves into high-degree points in the graph. Finally, we consider the effects of client counter-strategies such as randomized reply selection, redundant and parallel download, and reputation systems. Some counter-strategies (e.g., randomized reply selection) provide considerable immunity to attack (reducing the scaling from hyperexponential to linear), yet significantly hurt performance in the absence of an attack. Other counter-strategies yield little benefit (or penalty). In particular, reputation systems show little impact unless they operate with near perfection

    Profit-oriented resource allocation using online scheduling in flexible heterogeneous networks

    Full text link
    In this paper, we discuss a generalized measurement-based adaptive scheduling framework for dynamic resource allocation in flexible heterogeneous networks, in order to ensure efficient service level performance under inherently variable traffic conditions. We formulate our generalized optimization model based on the notion of a “profit center” with an arbitrary number of service classes, nonlinear revenue and cost functions and general performance constraints. Subsequently, and under the assumption of a linear pricing model and average queue delay requirements, we develop a fast, low complexity algorithm for online dynamic resource allocation, and examine its properties. Finally, the proposed scheme is validated through an extensive simulation study.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/47990/1/11235_2006_Article_6525.pd

    A Domain-Specific Language for Incremental and Modular Design of Large-Scale Verifiably-Safe Flow Networks (Preliminary Report)

    Get PDF
    We define a domain-specific language (DSL) to inductively assemble flow networks from small networks or modules to produce arbitrarily large ones, with interchangeable functionally-equivalent parts. Our small networks or modules are "small" only as the building blocks in this inductive definition (there is no limit on their size). Associated with our DSL is a type theory, a system of formal annotations to express desirable properties of flow networks together with rules that enforce them as invariants across their interfaces, i.e, the rules guarantee the properties are preserved as we build larger networks from smaller ones. A prerequisite for a type theory is a formal semantics, i.e, a rigorous definition of the entities that qualify as feasible flows through the networks, possibly restricted to satisfy additional efficiency or safety requirements. This can be carried out in one of two ways, as a denotational semantics or as an operational (or reduction) semantics; we choose the first in preference to the second, partly to avoid exponential-growth rewriting in the operational approach. We set up a typing system and prove its soundness for our DSL.Comment: In Proceedings DSL 2011, arXiv:1109.032

    A comparative view of glacial and periglacial landforms on Earth and Mars

    Get PDF
    This paper emphasizes the importance of using terrestrial analogues to improve our understanding of the role of ice on Mars through its associated landforms. We discuss terrestrial regions and techniques that can help understand Martian icy environments, and highlight the necessity to explore the Martian cryosphere as the next natural step

    Minimizing Blood Loss in Spine Surgery.

    Get PDF
    Study Design: Broad narrative review. Objective: To review and summarize the current literature on guidelines, outcomes, techniques and indications surrounding multiple modalities of minimizing blood loss in spine surgery. Methods: A thorough review of peer-reviewed literature was performed on the guidelines, outcomes, techniques, and indications for multiple modalities of minimizing blood loss in spine surgery. Results: There is a large body of literature that provides a consensus on guidelines regarding the appropriate timing of discontinuation of anticoagulation, aspirin, nonsteroidal anti-inflammatory drugs (NSAIDs), and herbal supplements prior to surgery. Additionally, there is a more heterogenous discussion the utility of preoperative autologous blood donation facilitated by erythropoietin and iron supplementation for healthy patients slated for procedures with high anticipated blood loss and for whom allogeneic transfusion is likely. Intraoperative maneuvers available to minimize blood loss include positioning and maintaining normothermia. Tranexamic acid (TXA), bipolar sealer electrocautery, and topical hemostatic agents, and hypotensive anesthesia (mean arterial pressure (MAP)Hg) should be strongly considered in cases with larger exposures and higher anticipated blood loss. There is strong level 1 evidence for the use of TXA in spine surgery as it reduces the overall blood loss and transfusion requirements. Conclusion: As the volume and complexity of spinal procedures rise, intraoperative blood loss management has become a pivotal topic of research within the field. There are many tools for minimizing blood loss in patients undergoing spine surgery. The current literature supports combining techniques to use a cost- effective multimodal approach to minimize blood loss in the perioperative period

    Effects Of Smoothing On End-To-End Performance Guarantees For Vbr Video

    No full text
    Integrated services networks have the framework needed to provide performance guarantees to multimedia traffic sources such as Variable Bit Rate (VBR) video. This paper investigates the effects of smoothing VBR traffic sources on their end-to-end delay bounds and on the achievable utilization inside the network. We provide a set of rules that determine if smoothing results in a net advantage to the source and use experiments with traces of MPEG-compressed video to quantify the effectiveness of smoothing in practical networking situations. INTRODUCTION Many distributed multimedia applications are delay- and loss-sensitive and have stringent requirements in terms of network performance. A resource reservation scheme together with priority service disciplines inside the network, as in (Ferrari and Verma, 1990), provide the means for giving network clients end-to-end Quality of Service (QoS) guarantees on delay, loss, and throughput. The guaranteed service can be deterministic, in which ..
    • …
    corecore