Commissioning of a Geant4 based treatment plan simulation tool : linac model and dicom-rt interface

A Geant4 based simulation tool has been developed to perform Monte Carlo modelling of a 6 MV VarianTM iX clinac. The computer aided design interface of Geant4 was used to accurately model the LINAC components, including the Millenium multi-leaf collimators (MLCs). The simulation tool was verified via simulation of standard commissioning dosimetry data acquired with an ionisation chamber in a water phantom. Verification of the MLC model was achieved by simulation of leaf leakage measurements performed using GafchromicTM film in a solid water phantom. An absolute dose calibration capability was added by including a virtual monitor chamber into the simulation. Furthermore, a DICOM-RT interface was integrated with the application to allow the simulation of treatment plans in radiotherapy. The ability of the simulation tool to accurately model leaf movements and doses at each control point was verified by simulation of a widely used intensity-modulated radiation therapy (IMRT) quality assurance (QA) technique, the chair test.

A pattern mining approach for information filtering systems

It is a big challenge to clearly identify the boundary between positive and negative streams for information filtering systems. Several attempts have used negative feedback to solve this challenge; however, there are two issues for using negative relevance feedback to improve the effectiveness of information filtering. The first one is how to select constructive negative samples in order to reduce the space of negative documents. The second issue is how to decide noisy extracted features that should be updated based on the selected negative samples. This paper proposes a pattern mining based approach to select some offenders from the negative documents, where an offender can be used to reduce the side effects of noisy features. It also classifies extracted features (i.e., terms) into three categories: positive specific terms, general terms, and negative specific terms. In this way, multiple revising strategies can be used to update extracted features. An iterative learning algorithm is also proposed to implement this approach on the RCV1 data collection, and substantial experiments show that the proposed approach achieves encouraging performance and the performance is also consistent for adaptive filtering as well.

Automated proofs for Diffie–Hellman–based key exchanges

We present an automated verification method for security of Diffie–Hellman–based key exchange protocols. The method includes a Hoare-style logic and syntactic checking. The method is applied to protocols in a simplified version of the Bellare–Rogaway–Pointcheval model (2000). The security of the protocol in the complete model can be established automatically by a modular proof technique of Kudla and Paterson (2005).

Reduction rules for YAWL workflows with cancellation regions and OR-joins

As the need for concepts such as cancellation and OR-joins occurs naturally in business scenarios, comprehensive support in a workflow language is desirable. However, there is a clear trade-off between the expressive power of a language (i.e., introducing complex constructs such as cancellation and OR-joins) and ease of verification. When a workflow contains a large number of tasks and involves complex control flow dependencies, verification can take too much time or it may even be impossible. There are a number of different approaches to deal with this complexity. Reducing the size of the workflow, while preserving its essential properties with respect to a particular analysis problem, is one such approach. In this paper, we present a set of reduction rules for workflows with cancellation regions and OR-joins and demonstrate how they can be used to improve the efficiency of verification. Our results are presented in the context of the YAWL workflow language.

Soundness of workflow nets: classification, decidability, and analysis

Workflow nets, a particular class of Petri nets, have become one of the standard ways to model and analyze workflows. Typically, they are used as an abstraction of the workflow that is used to check the so-called soundness property. This property guarantees the absence of livelocks, deadlocks, and other anomalies that can be detected without domain knowledge. Several authors have proposed alternative notions of soundness and have suggested to use more expressive languages, e.g., models with cancellations or priorities. This paper provides an overview of the different notions of soundness and investigates these in the presence of different extensions of workflow nets.We will show that the eight soundness notions described in the literature are decidable for workflow nets. However, most extensions will make all of these notions undecidable. These new results show the theoretical limits of workflow verification. Moreover, we discuss some of the analysis approaches described in the literature.

Reduction rules for reset/inhibitor nets

Reset/inhibitor nets are Petri nets extended with reset arcs and inhibitor arcs. These extensions can be used to model cancellation and blocking. A reset arc allows a transition to remove all tokens from a certain place when the transition fires. An inhibitor arc can stop a transition from being enabled if the place contains one or more tokens. While reset/inhibitor nets increase the expressive power of Petri nets, they also result in increased complexity of analysis techniques. One way of speeding up Petri net analysis is to apply reduction rules. Unfortunately, many of the rules defined for classical Petri nets do not hold in the presence of reset and/or inhibitor arcs. Moreover, new rules can be added. This is the first paper systematically presenting a comprehensive set of reduction rules for reset/inhibitor nets. These rules are liveness and boundedness preserving and are able to dramatically reduce models and their state spaces. It can be observed that most of the modeling languages used in practice have features related to cancellation and blocking. Therefore, this work is highly relevant for all kinds of application areas where analysis is currently intractable.

An efficient public key management system : an application in vehicular ad hoc networks

The major purpose of Vehicular Ad Hoc Networks (VANETs) is to provide safety-related message access for motorists to react or make a life-critical decision for road safety enhancement. Accessing safety-related information through the use of VANET communications, therefore, must be protected, as motorists may make critical decisions in response to emergency situations in VANETs. If introducing security services into VANETs causes considerable transmission latency or processing delays, this would defeat the purpose of using VANETs to improve road safety. Current research in secure messaging for VANETs appears to focus on employing certificate-based Public Key Cryptosystem (PKC) to support security. The security overhead of such a scheme, however, creates a transmission delay and introduces a time-consuming verification process to VANET communications. This paper proposes an efficient public key management system for VANETs: the Public Key Registry (PKR) system. Not only does this paper demonstrate that the proposed PKR system can maintain security, but it also asserts that it can improve overall performance and scalability at a lower cost, compared to the certificate-based PKC scheme. It is believed that the proposed PKR system will create a new dimension to the key management and verification services for VANETs.

Removal of toxic arsenic and antimony from groundwater Spiro Tunnel Bulkhead in Park City Utah using colloidal iron hydroxide : comparison with reverse ssmosis

Verification testing of two model technologies in pilot scale to remove arsenic and antimony based on reverse osmosis and chemical coagulation/filtration systems was conducted in Spiro Tunnel Water Filtration Plant located in Park City, Utah, US. The source water was groundwater in abandoned silver mine, naturally contaminated by 60-80 ppb of arsenic and antimony below 10 ppb. This water represents one of the sources of drinking water for Park City and constitutes about 44% of the water supply. The failure to remove antimony efficiently by coagulation/filtration (only 4.4% removal rate) under design conditions is discussed in terms of the chemistry differences between Sb (III, V) and As (III, V). Removal of Sb(V) at pH > 7, using coagulation/filtration technology, requires much higher (50 to 80 times) concentration of iron (III) than As. The stronger adsorption of arsenate over a wider pH range can be explained by the fact that arsenic acid is tri-protic, whereas antimonic acid is monoprotic. This difference in properties of As(V) and Sb(V) makes antimony (V) more difficult to be efficiently removed in low concentrations of iron hydroxide and alkaline pH waters, especially in concentration of Sb < 10 ppb.

Scaling of natural convection of an inclined flat plate : ramp cooling condition

A scaling analysis is performed for the transient boundary layer established adjacent to an inclined flat plate following a ramp cooling boundary condition. The imposed wall temperature decreases linearly up to a specific value over a specific time. It is revealed that if the ramp time is sufficiently large then the boundary layer reaches quasi-steady mode before the growth of the temperature is finished. However, if the ramp time is shorter then the steady state of the boundary layer may be reached after the growth of the temperature is completed. In this case, the ultimate steady state is the same as if the start up had been instantaneous. Note that the cold boundary layer adjacent to the plate is potentially unstable to Rayleigh-Bénard instability if the Rayleigh number exceeds a certain critical value for this cooling case. The onset of instability may set in at different stages of the boundary layer development. A proper identification of the time when the instability may set in is discussed. A numerical verification of the time for the onset of instability is presented in this study. Different flow regimes based on the stability of the boundary layer have also been discussed with numerical results.

Scaling of natural convection of an inclined flat plate : sudden cooling condition

The natural convection boundary layer adjacent to an inclined plate subject to sudden cooling boundary condition has been studied. It is found that the cold boundary layer adjacent to the plate is potentially unstable to Rayleigh-Bénard instability if the Rayleigh number exceeds a certain critical value. A scaling relation for the onset of instability of the boundary layer is achieved. The scaling relations have been developed by equating important terms of the governing equations based on the development of the boundary layer with time. The flow adjacent to the plate can be classified broadly into a conductive, a stable convective or an unstable convective regime determined by the Rayleigh number. Proper scales have been established to quantify the flow properties in each of these flow regimes. An appropriate identification of the time when the instability may set in is discussed. A numerical verification of the time for the onset of instability is also presented in this study. Different flow regimes based on the stability of the boundary layer have been discussed with numerical results.

Explanations of police racism

This paper describes the development of a substantive theory about police racism as the most significant factor, from among a number of competing societal based explanations, in accounting for Aboriginal over-representation in police arrest rates.

Digit recognition using trispectral features

Features derived from the trispectra of DFT magnitude slices are used for multi-font digit recognition. These features are insensitive to translation, rotation, or scaling of the input. They are also robust to noise. Classification accuracy tests were conducted on a common data base of 256× 256 pixel bilevel images of digits in 9 fonts. Randomly rotated and translated noisy versions were used for training and testing. The results indicate that the trispectral features are better than moment invariants and affine moment invariants. They achieve a classification accuracy of 95% compared to about 81% for Hu's (1962) moment invariants and 39% for the Flusser and Suk (1994) affine moment invariants on the same data in the presence of 1% impulse noise using a 1-NN classifier. For comparison, a multilayer perceptron with no normalization for rotations and translations yields 34% accuracy on 16× 16 pixel low-pass filtered and decimated versions of the same data.

Improving visual noise insensitivity in small vocabulary audio visual speech recognition applications

Visual noise insensitivity is important to audio visual speech recognition (AVSR). Visual noise can take on a number of forms such as varying frame rate, occlusion, lighting or speaker variabilities. The use of a high dimensional secondary classifier on the word likelihood scores from both the audio and video modalities is investigated for the purposes of adaptive fusion. Preliminary results are presented demonstrating performance above the catastrophic fusion boundary for our confidence measure irrespective of the type of visual noise presented to it. Our experiments were restricted to small vocabulary applications.