Verification of EL2 electronic absorption effect on charge transfer in semi-insulating GaAs

The electronic absorption of EL2 centers has been clarified to be related to the electron acid hole photoionizations, and the transition from its ground state to metastable state, respectively. Under an illumination with a selected photon energy in the near infrared region, these three processes with different optical cross sections will show different kinetics against the illumination time. It has recently been shown that the photosensitivity (measured under 1.25 eV illumination) of the local vibrational mode absorption induced by some deep defect centers in SI-GaAs is a consequence of the electron and hole photoionizations of EL2. This paper directly measures the kinetics of the electronic transition associated with EL2 under 1.25 eV illumination, which implies the expected charge transfer among different charge states of the EL2 center. A calculation based on a simple rate equation model is in good agreement with the experimental results.

etl workflow analysis and verification using backwards constraint propagation

University of Twente; Centre for Telematics and Information Technology; Netherlands Organisation for Scientific Research; Jacquard; Capgemini

Experimental verification of therapeutic doses for the superficially-placed tumor radiotherapy with heavy ions at HIRFL

Up to now, clinical trials of heavy-ion radiotherapy for superficially placed tumors have been carried out for six times and over 60 selected patients have been treated with 80—100 MeV/u carbon ions supplied by the Heavy Ion Research Facility in Lanzhou (HIRFL) at the Institute of Modern Physics, Chinese Academy of Sciences since November, 2006. A passive irradiation system and a dose optimization method for radiotherapy with carbon-ion beams have been developed. Experimental verification of longitudinally ...

Capability verification of the beam delivery system in the superficially-placed tumor therapy terminal at HIRFL

The passive beam delivery system in the superficially-placed tumor therapy terminal at Heavy Ion Researc h Facility in Lanzhou (HIRFL), which includes two orthogonal dipole magnets as scanning system, a motor-driven energy degrader as range-shifter, series of ridge filters as range modulator and a multileaf collimator, is introduced in detail. The capacities of its important components and the whole system have been verified experimentally. The tests of the ridge filter for extending Bragg peak and the range shifter for energy adjustment show both work well. To examine the passive beam delivery system, a beam shaping experiment were carried out, simulating a three-dimensional (3D) conformal irradiation to a tumor. The encouraging experimental result confirms that 3D layer-stacking conformal irradiation can be performed by means of the passive system. The validation of the beam delivery system establishes a substantial basis for upcoming clinical trial for superficially-placed tumors with heavy ions in the therapy terminal at HIRFL.

The glass transition temperatures of PS/PPO blends: Couchman volume-based equation and its verification

The glass transition temperatures (T-g) of PS/PPO blends with different compositions were studied under various pressures by means of a PVT-100 analyzer. A general relation of T-g and pressure of the PS/PPO system was deduced by fitting the experimental T-g's. Couchman volume-based equation was testified with the aid of those data. It was found that the experimental T-g's do not obey the Couchman equation of glass transition temperature based on thermodynamic theory. According to our studies, the major reason of the deviation is caused by the neglect of DeltaV(mix). (C) 2001 Published by Elsevier Science Ltd.

Systematic Verification of Safety Properties of Arbitrary Network Protocol Compositions Using CHAIN

Formal correctness of complex multi-party network protocols can be difficult to verify. While models of specific fixed compositions of agents can be checked against design constraints, protocols which lend themselves to arbitrarily many compositions of agents-such as the chaining of proxies or the peering of routers-are more difficult to verify because they represent potentially infinite state spaces and may exhibit emergent behaviors which may not materialize under particular fixed compositions. We address this challenge by developing an algebraic approach that enables us to reduce arbitrary compositions of network agents into a behaviorally-equivalent (with respect to some correctness property) compact, canonical representation, which is amenable to mechanical verification. Our approach consists of an algebra and a set of property-preserving rewrite rules for the Canonical Homomorphic Abstraction of Infinite Network protocol compositions (CHAIN). Using CHAIN, an expression over our algebra (i.e., a set of configurations of network protocol agents) can be reduced to another behaviorally-equivalent expression (i.e., a smaller set of configurations). Repeated applications of such rewrite rules produces a canonical expression which can be checked mechanically. We demonstrate our approach by characterizing deadlock-prone configurations of HTTP agents, as well as establishing useful properties of an overlay protocol for scheduling MPEG frames, and of a protocol for Web intra-cache consistency.

Examples of Network Flow Verification Using TRAFFIC(X)

In our previous work, we developed TRAFFIC(X), a specification language for modeling bi-directional network flows featuring a type system with constrained polymorphism. In this paper, we present two ways to customize the constraint system: (1) when using linear inequality constraints for the constraint system, TRAFFIC(X) can describe flows with numeric properties such as MTU (maximum transmission unit), RTT (round trip time), traversal order, and bandwidth allocation over parallel paths; (2) when using Boolean predicate constraints for the constraint system, TRAFFIC(X) can describe routing policies of an IP network. These examples illustrate how to use the customized type system.

The Sensor Network Workbench: Towards Functional Specification, Verification and Deployment of Constrained Distributed Systems

As the commoditization of sensing, actuation and communication hardware increases, so does the potential for dynamically tasked sense and respond networked systems (i.e., Sensor Networks or SNs) to replace existing disjoint and inflexible special-purpose deployments (closed-circuit security video, anti-theft sensors, etc.). While various solutions have emerged to many individual SN-centric challenges (e.g., power management, communication protocols, role assignment), perhaps the largest remaining obstacle to widespread SN deployment is that those who wish to deploy, utilize, and maintain a programmable Sensor Network lack the programming and systems expertise to do so. The contributions of this thesis centers on the design, development and deployment of the SN Workbench (snBench). snBench embodies an accessible, modular programming platform coupled with a flexible and extensible run-time system that, together, support the entire life-cycle of distributed sensory services. As it is impossible to find a one-size-fits-all programming interface, this work advocates the use of tiered layers of abstraction that enable a variety of high-level, domain specific languages to be compiled to a common (thin-waist) tasking language; this common tasking language is statically verified and can be subsequently re-translated, if needed, for execution on a wide variety of hardware platforms. snBench provides: (1) a common sensory tasking language (Instruction Set Architecture) powerful enough to express complex SN services, yet simple enough to be executed by highly constrained resources with soft, real-time constraints, (2) a prototype high-level language (and corresponding compiler) to illustrate the utility of the common tasking language and the tiered programming approach in this domain, (3) an execution environment and a run-time support infrastructure that abstract a collection of heterogeneous resources into a single virtual Sensor Network, tasked via this common tasking language, and (4) novel formal methods (i.e., static analysis techniques) that verify safety properties and infer implicit resource constraints to facilitate resource allocation for new services. This thesis presents these components in detail, as well as two specific case-studies: the use of snBench to integrate physical and wireless network security, and the use of snBench as the foundation for semester-long student projects in a graduate-level Software Engineering course.

Improving the Accessibility of Lightweight Formal Verification Systems

In research areas involving mathematical rigor, there are numerous benefits to adopting a formal representation of models and arguments: reusability, automatic evaluation of examples, and verification of consistency and correctness. However, broad accessibility has not been a priority in the design of formal verification tools that can provide these benefits. We propose a few design criteria to address these issues: a simple, familiar, and conventional concrete syntax that is independent of any environment, application, or verification strategy, and the possibility of reducing workload and entry costs by employing features selectively. We demonstrate the feasibility of satisfying such criteria by presenting our own formal representation and verification system. Our system’s concrete syntax overlaps with English, LATEX and MediaWiki markup wherever possible, and its verifier relies on heuristic search techniques that make the formal authoring process more manageable and consistent with prevailing practices. We employ techniques and algorithms that ensure a simple, uniform, and flexible definition and design for the system, so that it easy to augment, extend, and improve.