Oberflächenuntersuchungen an kugelgemahlenem Fichtenholz nach Dioxan-Extraktion

Ohne Zusammenfassung     

Efficiency Roll‐Off in Blue Emitting Phosphorescent Organic Light Emitting Diodes with Carbazole Host Materials

The efficiency roll‐off in blue phosphorescent organic light emitting diodes (OLEDs) using different carbazole compounds as the host is systematically studied. While there is no significant difference in device efficiency, OLEDs using ter‐carbazole as the host show a reduction in efficiency roll‐off at high luminance. Data from transient photoluminescence and electroluminescence measurements show that the lower triplet–triplet annihilation (TTA) and triplet–polaron quenching (TPQ) rates in devices with the ter‐carbazole host compared with other carbazole hosts are the reasons for this reduced efficiency roll‐off. It is also found that the host materials with low glass transition temperatures are more susceptible to the efficiency roll‐off problem.     

Research on orotron oscillator with dispersive open resonant system

Theoretical and experimental results of an investigation into a new resonant system have been obtained. This system is named the sphere-corner-echelette open resonator (SCEOR) due to the employment of a mirror that was formed by two echelettes at the angles of 45° to the resonator axis. It turns ont that this resonator is excited on the specific modes not unique to others oscillating systems. There are presented the results of the experimental research of the orotron oscillator with the SCEOR. The spectrum of this device contains only the fundamental modes such as theT E M ₀₀₆,T E M ₀₀₇,T E M ₀₀₈. The efficiency of the orotron is improved, when all other factors are the same the orotron with a much used sphere-cylindrical open resonator.     

Der PC in zehn Jahren und seine Auswirkungen auf die Gesellschaft

In this article it is argued that in ten years’ time personal computers as we know them now won’t exist anymore — all their functions will by then be integrated in mobiles which will be our steady companions. As such, mobiles will change our lives to an enormous extent. Technology as well as consequences will be discussed in this paper.     

Compact Harmonic Filter Design and Fabrication Using IPD Technology

An integrated passive device (IPD) technology has been developed to meet the ever increasing needs of size and cost reduction in radio front-end transceiver module applications. Electromagnetic (EM) simulation was used extensively in the design of the process technology and the optimization of inductor and harmonic filter designs and layouts. Parameters such as inductor shape, inner diameter, metal thickness, metal width, and substrate thickness have been optimized to provide inductors with high quality factors. The technology includes 1) a thick plated gold metal process to reduce resistive loss; 2) MIM capacitors using PECVD SiN dielectric layer; 3) airbridges for inductor underpass and capacitor pick-up; and 4) a 10 mil finished GaAs substrate to improve inductor quality factor. Both lumped element circuit simulations and electromagnetic (EM) simulations have been used in the harmonic filter circuit designs for high accuracy and fast design cycle time. This paper will present the EM simulation calibration and demonstrate the importance of using EM simulation in the filter design in order to achieve first-time success in wafer fabrication. The fabricated IPD devices have insertion loss of 0.5 dB and harmonic rejections of 30dB with die size of 1.42 mm for high band (1710 MHz-1910 MHz) and 1.89 mm for low band (824-915 MHz) harmonic filters.     

Applying Petri Nets to Modeling of Many-Core Processor Self-Testing when Tests are Performed Randomly

Today’s many-core processors are manufactured in inherently unreliable technologies. Massively defective technologies used for production of many-core processors are the direct consequence of the feature size shrinkage in today’s CMOS (complementary metal-oxide-semiconductor) technology. Due to these reliability problems, fault-tolerance of many-core processors becomes one of the major challenges. To reduce the probability of failures of many-core processors various fault tolerance techniques can be applied. The most preferable and promising techniques are the ones that can be easily implemented and have minimal cost while providing high level of processor fault tolerance. One of the promising techniques for detection of faulty cores, and consequently, for performing the first step in providing many-core processor fault tolerance is mutual testing among processor cores. Mutual testing can be performed either in a random manner or according to a deterministic scheduling policy. In the paper we deal with random execution of mutual tests. Effectiveness of such testing can be evaluated through its modeling. In the paper, we have shown how Stochastic Petri Nets can be used for this purpose and have obtained some results that can be useful for developing and implementation of testing procedure in many-core processors.     

Player Simulation and General Adversary Structures in Perfect Multiparty Computation

The goal of secure multiparty computation is to transform a given protocol involving a trusted party into a protocol without need for the trusted party, by simulating the party among the players. Indeed, by the same means, one can simulate an arbitrary player in any given protocol. We formally define what it means to simulate a player by a multiparty protocol among a set of (new) players, and we derive the resilience of the new protocol as a function of the resiliences of the original protocol and the protocol used for the simulation. In contrast to all previous protocols that specify the tolerable adversaries by the number of corruptible players (a threshold), we consider general adversaries characterized by an adversary structure, a set of subsets of the player set, where the adversary may corrupt the players of one set in the structure. Recursively applying the simulation technique to standard threshold multiparty protocols results in protocols secure against general adversaries. The classical results in unconditional multiparty computation among a set of n players state that, in the passive model, any adversary that corrupts less than n/2 players can be tolerated, and in the active model, any adversary that corrupts less than n/3 players can be tolerated. Strictly generalizing these results we prove that, in the passive model, every function (more generally, every cooperation specified by involving a trusted party) can be computed securely with respect to a given adversary structure if and only if no two sets in the adversary structure cover the full set of players, and, in the active model, if and only if no three sets cover the full set of players. The complexities of the protocols are polynomial in the number of maximal adverse player sets in the adversary structure. Received 31 December 1997 and revised 26 February 1999