Operational experience and recent developments at the National Medical Cyclotron, Sydney

The National Medical Cyclotron, Sydney, Australia commenced operation in mid 1991, with a mission to provide PET and SPECT radionuclides throughout Australia. The realization of the present production capacity has been synonymous with the development of the facility's industrial cyclotron (IBA Cyclone 30). The choice of cyclotron was based on the Cyclone 30's virtues as a compact, user-friendly, energy efficient cyclotron, offering the beam quality characteristic of negative ion technology. Development of the cyclotron has improved reliability and increased beam capacity, while improvements to targetry have increased production reliability. More recently, the installation and commissioning of a new solid target irradiation facility has provided much needed redundancy. This paper describes the major cyclotron and targetry developments carried out to date.     

A propositional probabilistic logic with discrete linear time for reasoning about evidence

The aim of the paper is to present a sound, strongly complete and decidable probabilistic temporal logic that can model reasoning about evidence. The formal system developed here is actually a solution of a problem proposed by Halpern and Pucella (J Artif Intell Res 26:1–34, 2006).     

A case of using the Semantic Interoperability Framework for custom orthopedic implants manufacturing

The efficiency and effectiveness of the daily practice in orthopedic surgery depend on the availability, interoperability and unique access to a wide set of information, related to the patient’s medical record and diagnosis, domain knowledge and available resources and staff. The most important of the tangible resources, needed for the therapeutic or preventive actions are orthopedic implants. In some cases, the implants may be highly complex and customized products, which need to be manufactured (assembled) on basis of the above information in a shortest possible timeframe. In this paper, the case of the custom orthopedic implants manufacturing is described from the perspective of the collaborative enterprising, with special consideration of the interoperability issues of the involved enterprise collaboration. It is shown how the previously developed Semantic Interoperability Framework can be used to improve the efficiency of the manufacturing and other relevant processes.     

Electrophoretic deposition of carbon nanotubes

Electrophoretic deposition (EPD) has been gaining increasing interest as an economical and versatile processing technique for the production of novel coatings or films of carbon nanotubes (CNTs) on conductive substrates. The purpose of the paper is to present an up-to-date comprehensive overview of current research progress in the field of EPD of CNTs. The paper specifically reviews the preparation and characterisation of stable CNT suspensions, and the mechanism of the EPD process; it includes discussion of pure CNT coatings and CNT/nanoparticle composite films. A complete discussion of the EPD parameters is presented, including electrode materials, deposition time, electrode separation, deposition voltage and resultant electric field. The paper highlights potential applications of the resulting CNT and CNT/composite structures, in areas such as field emission devices, fuel cells, and supercapacitors.     

Scalable Realistic Rendering with Many‐Light Methods

Recent years have seen increasing attention and significant progress in many‐light rendering, a class of methods for efficient computation of global illumination. The many‐light formulation offers a unified mathematical framework for the problem reducing the full lighting transport simulation to the calculation of the direct illumination from many virtual light sources. These methods are unrivaled in their scalability: they are able to produce plausible images in a fraction of a second but also converge to the full solution over time. In this state‐of‐the‐art report, we give an easy‐to‐follow, introductory tutorial of the many‐light theory; provide a comprehensive, unified survey of the topic with a comparison of the main algorithms; discuss limitations regarding materials and light transport phenomena and present a vision to motivate and guide future research. We will cover both the fundamental concepts as well as improvements, extensions and applications of many‐light rendering.     

Automatic player position detection in basketball games

This paper presents us with a framework for the automatic player position detection (APPD) in the game of basketball. Court players are detected in the images broadcasted via television stations. In them, at any point of time, the view is from only one camera. This makes the detection process much more difficult. The player detection is based on the mixture of non-oriented pictorial structures. The detection of body parts is performed by the Support Vector Machine (SVM) algorithm. The results of these detections are combined together with constraints on their locations, which specify the position of one body part with respect to the parent body part. In order to train the whole model, we used a latent form of SVM called the latent SVM (LSVM). Such approach generated the statistical accuracy of about 82 %, which represents one of the best results in basketball player detection framework. Beside players, the algorithm detected a certain number of false positive objects. These are mostly people from the audience and the referees as well. This paper contains a simple and robust solution to remove them all, based on the play court boundaries and the histogram comparison. Separating players in different teams is done by k-means clustering. The inputs to this algorithm are saturation histograms calculated on the jerseys. A spatial transformation is determined by the detected play court boundaries and the actual court measures. Using this transformation, points representing the location of detected players in TV images are mapped to the actual location of players on the court, which was the main goal of our research. The proposed solution is sound and efficient. In addition, it is backed up by the experimental results obtained using the model of the actual footage of basketball games.     

Tensor Clustering for Rendering Many‐Light Animations

Rendering animations of scenes with deformable objects, camera motion, and complex illumination, including indirect lighting and arbitrary shading, is a long‐standing challenge. Prior work has shown that complex lighting can be accurately approximated by a large collection of point lights. In this formulation, rendering of animation sequences becomes the problem of efficiently shading many surface samples from many lights across several frames. This paper presents a tensor formulation of the animated many‐light problem, where each element of the tensor expresses the contribution of one light to one pixel in one frame. We sparsely sample rows and columns of the tensor, and introduce a clustering algorithm to select a small number of representative lights to efficiently approximate the animation. Our algorithm achieves efficiency by reusing representatives across frames, while minimizing temporal flicker. We demonstrate our algorithm in a variety of scenes that include deformable objects, complex illumination and arbitrary shading and show that a surprisingly small number of representative lights is sufficient for high quality rendering. We believe out algorithm will find practical use in applications that require fast previews of complex animation.     

Querying business processes with BP-QL

We present in this paper BP-QL, a novel query language for querying business processes. The BP-QL language is based on an intuitive model of business processes, an abstraction of the emerging BPEL (business process execution language) standard. It allows users to query business processes visually, in a manner very analogous to how such processes are typically specified, and can be employed in a distributed setting, where process components may be provided by distinct providers.     

Optimizing throughput and resource utilization using pipelining: Transformation based approach

A simple formulation of pipelining: Pipelining withN stages is equivalent to retiming where the number of delays on all inputs or all outputs, but not both, is increased byN is used as the basis for a convenient and efficient treatment of pipelining in the design of application specific computers.Pipelining according to the objective function (throughput or resource utilization) and the latency is introduced. For two polynomial complexity pipelining classes, optimal algorithms are presented. For two other classes both proofs of NP-completeness and efficient probabilistic algorithms are presented. Both theoretical and experimental properties of pipelining are discussed and a relationship with other transformations is explored. Due to similar formulations for both software pipelining and the pipelining presented here, all results can be easily modified for use in compilers for general purpose computers. We have also developed a polynomial complexity algorithm for determining the iteration bound.This work was done while the first author was at the University of California, Berkeley.