Parasitic bipolar gain in fully depleted n-channel SOI MOSFET's

Fully depleted SOI MOSFET's include an inherent parasitic lateral bipolar structure with a floating base. We present here the first complete physically based explanation of the bipolar gain mechanism, and its dependence on bias and technological parameters. A simple, one-dimensional physical model, with no fitting parameters, is constructed, and is shown to agree well with simulations and measurements performed on a new type of SOI MOSFET structure. It is shown that parameters which affect the gain, such as SOI layer thickness, body doping concentration and gate and drain voltages, do so primarily by affecting the concentration of holes in the body region. Thus, current gain falls dramatically with increasing drain voltage due to the associated impact ionization driven increase in the hole concentration. Gummel plots of this parasitic bipolar indicate an apparent ideality factor of 0.5 for the hole current, due to the body hole concentration's dependence on drain voltage     

Critical incidents and chronic stressors at work: Their impact on forensic doctors.

Workers in medium- or high-risk professions are often confronted with critical incidents at the workplace. The impact of these acute stressors may be serious and enduring. Many workers also experience chronic job stressors, such as work overload or role conflicts. This study examined the frequently neglected relationship of acute and chronic stressors with self-reported health symptoms, such as posttraumatic responses, fatigue, and burnout. This association was investigated in a sample of forensic doctors in the Netherlands (N = 84). It was found that the more traumatic events the respondents experienced, the more problems they reported in coping with the traumatic events. Chronic job stressors were associated with posttraumatic responses (intrusions and avoidances) and with burnout and fatigue. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Impact toughened blends of styrene-maleic anhydride copolymer,polyethylene, and ethylene-propylene copolymer

Impact-toughened, compatibilized binary blends of styrene-maleic anhydride (SMA) copolymer/amine functionalized ethylene-propylene (amine-EP) polymer and ternary blends consisting of SMA/amine-EP/high density polyethylene (HDPE) are described. In both blends 0.02 to 4 μm range rubbery inclusions, which toughen the SMA matrix, are formed. SMA sub-inclusions exist in the amine-EP phase. In the ternary blend substantially all of the polyethylene is embedded in the EP phase. Compatibilization of the SMA and the commingled polyolefin phase is promoted by a graft copolymer formed by the reaction of amine groups on the EP with the maleic anhydride groups on the SMA. We describe the morphology, rheology, aging characteristics and impact properties of these blends. SMA modification by SMA-g-(amine-EP) polymers formed in situ in the melt, with HDPE, has not been previously reported.     

Drawing non‐layered tidy trees in linear time

The well‐known Reingold–Tilford algorithm produces tidy‐layered drawings of trees: drawings where all nodes at the same depth are vertically aligned. However, when nodes have varying heights, layered drawing may use more vertical space than necessary. A non‐layered drawing of a tree places children at a fixed distance from the parent, thereby giving a more vertically compact drawing. Moreover, non‐layered drawings can also be used to draw trees where the vertical position of each node is given, by adding dummy nodes. In this paper, we present the first linear‐time algorithm for producing non‐layered drawings. Our algorithm is a modification of the Reingold–Tilford algorithm, but the original complexity proof of the Reingold–Tilford algorithm uses an invariant that does not hold for the non‐layered case. We give an alternative proof of the algorithm and its extension to non‐layered drawings. To improve drawings of trees of unbounded degree, extensions to the Reingold–Tilford algorithm have been proposed. These extensions also work in the non‐layered case, but we show that they then cause a O(n²) run‐time. We then propose a modification to these extensions that restores the O(n) run‐time. Copyright © 2013 John Wiley & Sons, Ltd.     

Improving retrieval accuracy of Hierarchical Cellular Trees for generic metric spaces

Metric Access Methods (MAMs) are indexing techniques which allow working in generic metric spaces. Therefore, MAMs are specially useful for Content-Based Image Retrieval systems based on features which use non L _p norms as similarity measures. MAMs naturally allow the design of image browsers due to their inherent hierarchical structure. The Hierarchical Cellular Tree (HCT), a MAM-based indexing technique, provides the starting point of our work. In this paper, we describe some limitations detected in the original formulation of the HCT and propose some modifications to both the index building and the search algorithm. First, the covering radius, which is defined as the distance from the representative to the furthest element in a node, may not cover all the elements belonging to the node’s subtree. Therefore, we propose to redefine the covering radius as the distance from the representative to the furthest element in the node’s subtree. This new definition is essential to guarantee a correct construction of the HCT. Second, the proposed Progressive Query retrieval scheme can be redesigned to perform the nearest neighbor operation in a more efficient way. We propose a new retrieval scheme which takes advantage of the benefits of the search algorithm used in the index building. Furthermore, while the evaluation of the HCT in the original work was only subjective, we propose an objective evaluation based on two aspects which are crucial in any approximate search algorithm: the retrieval time and the retrieval accuracy. Finally, we illustrate the usefulness of the proposal by presenting some actual applications.     

Towards a set of agrosystem-specific cropland mapping methods to address the global cropland diversity

Accurate cropland information is of paramount importance for crop monitoring. This study compares five existing cropland mapping methodologies over five contrasting Joint Experiment for Crop Assessment and Monitoring (JECAM) sites of medium to large average field size using the time series of 7-day 250 m Moderate Resolution Imaging Spectroradiometer (MODIS) mean composites (red and near-infrared channels). Different strategies were devised to assess the accuracy of the classification methods: confusion matrices and derived accuracy indicators with and without equalizing class proportions, assessing the pairwise difference error rates and accounting for the spatial resolution bias. The robustness of the accuracy with respect to a reduction of the quantity of calibration data available was also assessed by a bootstrap approach in which the amount of training data was systematically reduced. Methods reached overall accuracies ranging from 85% to 95%, which demonstrates the ability of 250 m imagery to resolve fields down to 20 ha. Despite significantly different error rates, the site effect was found to persistently dominate the method effect. This was confirmed even after removing the share of the classification due to the spatial resolution of the satellite data (from 10% to 30%). This underlines the effect of other agrosystems characteristics such as cloudiness, crop diversity, and calendar on the ability to perform accurately. All methods have potential for large area cropland mapping as they provided accurate results with 20% of the calibration data, e.g. 2% of the study area in Ukraine. To better address the global cropland diversity, results advocate movement towards a set of cropland classification methods that could be applied regionally according to their respective performance in specific landscapes.     

Randomization can be a healer: consensus with dynamic omission failures

Wireless ad-hoc networks are being increasingly used in diverse contexts, ranging from casual meetings to disaster recovery operations. A promising approach is to model these networks as distributed systems prone to dynamic communication failures. This captures transitory disconnections in communication due to phenomena like interference and collisions, and permits an efficient use of the wireless broadcasting medium. This model, however, is bound by the impossibility result of Santoro and Widmayer, which states that, even with strong synchrony assumptions, there is no deterministic solution to any non-trivial form of agreement if n ? 1 or more messages can be lost per communication round in a system with n processes. In this paper we propose a novel way to circumvent this impossibility result by employing randomization. We present a consensus protocol that ensures safety in the presence of an unrestricted number of omission faults, and guarantees progress in rounds where such faults are bounded by ${f \,{\leq}\,\lceil \frac{n}{2} \rceil (n\,{-}\,k)\,{+}\,k\,{-}\,2}$ , where k is the number of processes required to decide, eventually assuring termination with probability 1.     

Methodological design and comparative evaluation of a MAS providing AmI

Researches on Ambient Intelligent and Ubiquitous Computing using wireless technologies have increased in the last years. In this work, we review several scenarios to define a multi-agent architecture that support the information needs of these new technologies, for heterogeneous domain. Our contribution consists of designing in a methodological way a Context Aware System (involving location services) using agents that can be used in very different domains. We describe all the steps followed in the design of the agent system. We apply a hybridizing methodology between GAIA and AUML. Additionally we propose a way to compare different agent architectures for Context Aware System using agent interactions. So, in this paper, we describe the assignment of weight values to agents interaction in two different MAS architectures for Context Aware problems solving different scenarios inspired in FIPA standard negotiation protocols.