Structure and impedance of ZrO2 doped with SC2O3 and CeO2

Scandia and ceria doped zirconia samples, with 10 mol% SC2O3 and different content of CeO2, were synthesized and characterized. The XRD results depict that the sintered samples have a cubic phase structure. However, Raman spectra show that besides the main cubic phase, a secondary phase is also present in the sintered samples. The addition of CeO2 can raise the content of the cubic phase, but the minor metastable tetragonal phase (t'-phase) exists even at the CeO2 content as high as 10 mol%. The near-UV Raman spectra indicate that the deformed tetragonal structure predominates at the grain boundary. The addition of CeO2 can reduce the impurity at grain boundary, and no impurity can be found by near-UV Raman spectroscopy at the grain boundary of the samples with high CeO2 content. The impedance measurements show that with the increase of CeO2 content, the impedance of grain boundary decreases and the bulk impedance increases. The low impedance of grain boundary can be attributed to the formation of a clean grain boundary upon CeO2 doping, and the increase of the bulk impedance is due to the blocking effect of the large Ce(IV) ions. (c) 2005 Elsevier B.V All rights reserved.

Klaster Bibliotek Bi@lskich próbą poszukiwania płaszczyzn synergii lokalnych bibliotek

W części wprowadzającej artykułu pokrótce przedstawiono koncepcję i typologię klastrów, a także cechy wspólne i różnice między klastrami a organizacjami sieciowymi. Prezentowane w drugiej części artykułu zagadnienia dotyczą szeroko rozumianego zarządzania: strategii powstawania klastra, barier rozwoju, czynników decydujących o powodzeniu projektu i korzyści wynikających z jego funkcjonowania w otoczeniu lokalnym. W części końcowej zaprezentowano przykłady współdziałania uczestników klastra wyzwalające efekt synergii.

OS Support for Portable Bulk Synchronous Parallel Programs

Predictability -- the ability to foretell that an implementation will not violate a set of specified reliability and timeliness requirements -- is a crucial, highly desirable property of responsive embedded systems. This paper overviews a development methodology for responsive systems, which enhances predictability by eliminating potential hazards resulting from physically-unsound specifications. The backbone of our methodology is the Time-constrained Reactive Automaton (TRA) formalism, which adopts a fundamental notion of space and time that restricts expressiveness in a way that allows the specification of only reactive, spontaneous, and causal computation. Using the TRA model, unrealistic systems – possessing properties such as clairvoyance, caprice, infinite capacity, or perfect timing -- cannot even be specified. We argue that this "ounce of prevention" at the specification level is likely to spare a lot of time and energy in the development cycle of responsive systems -- not to mention the elimination of potential hazards that would have gone, otherwise, unnoticed. The TRA model is presented to system developers through the Cleopatra programming language. Cleopatra features a C-like imperative syntax for the description of computation, which makes it easier to incorporate in applications already using C. It is event-driven, and thus appropriate for embedded process control applications. It is object-oriented and compositional, thus advocating modularity and reusability. Cleopatra is semantically sound; its objects can be transformed, mechanically and unambiguously, into formal TRA automata for verification purposes, which can be pursued using model-checking or theorem proving techniques. Since 1989, an ancestor of Cleopatra has been in use as a specification and simulation language for embedded time-critical robotic processes.

Communicable Memory and Lazy Barriers for Bulk Synchronous Parallelism in BSPk

Communication and synchronization stand as the dual bottlenecks in the performance of parallel systems, and especially those that attempt to alleviate the programming burden by incurring overhead in these two domains. We formulate the notions of communicable memory and lazy barriers to help achieve efficient communication and synchronization. These concepts are developed in the context of BSPk, a toolkit library for programming networks of workstations|and other distributed memory architectures in general|based on the Bulk Synchronous Parallel (BSP) model. BSPk emphasizes efficiency in communication by minimizing local memory-to-memory copying, and in barrier synchronization by not forcing a process to wait unless it needs remote data. Both the message passing (MP) and distributed shared memory (DSM) programming styles are supported in BSPk. MP helps processes efficiently exchange short-lived unnamed data values, when the identity of either the sender or receiver is known to the other party. By contrast, DSM supports communication between processes that may be mutually anonymous, so long as they can agree on variable names in which to store shared temporary or long-lived data.

Securing Bulk Content Almost for Free

Content providers often consider the costs of security to be greater than the losses they might incur without it; many view "casual piracy" as their main concern. Our goal is to provide a low cost defense against such attacks while maintaining rigorous security guarantees. Our defense is integrated with and leverages fast forward error correcting codes, such as Tornado codes, which are widely used to facilitate reliable delivery of rich content. We tune one such family of codes - while preserving their original desirable properties - to guarantee that none of the original content can b e recovered whenever a key subset of encoded packets is missing. Ultimately we encrypt only these key codewords (only 4% of all transmissions), making the security overhead negligible.