Makespan estimation and order acceptance in batch process industries when processing times are uncertain

Batch process industries are characterized by complex precedence relationships between operations, which renders the estimation of an acceptable workload very difficult. A detailed schedule based model can be used for this purpose, but for large problems this may require a prohibitive large amount of computation time. We propose a regression based model to estimate the makespan of a set of jobs. We extend earlier work based on deterministic processing times by considering Erlang-distributed processing times in our model. This regression-based model is used to support customer order acceptance. Three order acceptance policies are compared by means of simulation experiments: a scheduling policy, a workload policy and a regression policy. The results indicate that the performance of the regression policy can compete with the performance of the scheduling policy in situations with high variety in the job mix and high uncertainty in the processing times. Correspondence to: C.V. Ivanescu     

Simple concepts for ion source improvement

We report on improvements in the overall intensity of a sputter ion source that evolved originally from an NEC MCSNICS. Beam output increases benefit both AMS measurements and nuclear physics experiments using low natural abundance beams. In particular, minor changes in source geometry suggested by a combination of electrostatic calculations and simple design principles have yielded increases in extracted negative ion intensity of nearly a factor of 4.     

Nanocell logic gates for molecular computing

Molecular electronics seeks to build electrical devices to implement computation - logic and memory - using individual or small collections of molecules. These devices have the potential to reduce device size and fabrication costs, by several orders of magnitude, relative to conventional CMOS. However, the construction of a practical molecular computer will require the molecular switches and their related interconnect technologies to behave as large-scale diverse logic, with input/output wires scaled to molecular dimensions. It is unclear whether it is necessary or even. possible to control the precise regular placement and interconnection of these diminutive molecular systems. This paper describes genetic algorithm-based simulations of molecular device structures in a nanocell where placement and connectivity of the internal molecular switches are not specifically directed and the internal topology is generally disordered. With some simplifying assumptions, these results show that it is possible to use easily fabricated nanocells as logic devices by setting the internal molecular switch states after the topological molecular assembly is complete. Simulated logic devices include an inverter, a NAND gate, an XOR gate and a 1-bit adder. Issues of defect and fault tolerance are addressed.     

A practical controller for explicit rate congestion control

This paper examines congestion control for explicit rate data networks. The available bit rate (ABR) service category of asynchronous transfer mode (ATM) networks serves as an example system, however, the results of this paper are applicable to other explicit rate systems as well. After a plant model is established, an adaptive control strategy is presented. Several algorithm enhancements are then introduced. These enhancements reduce convergence time, improve queue depth management, and reduce parameter bias. This work differentiates itself from the other contributions in the area of rate-based congestion control in its balanced approach of retaining enough complexity as to afford attractive performance properties, but not so much complexity as to make implementation prohibitively expensive     

Cluster analysis in industrial market segmentation through artificial neural network

Market segmentation has commonly applied cluster analysis. This study intends to make the comparison of conventional two-stage method with proposed two-stage method through the simulated data. The proposed two-stage method is the combination of self-organizing feature maps and K-means method. The simulation results show that the proposed scheme is better than the conventional two-stage method based on the rate of misclassification.     

A Refinement Calculus for Shared-Variable Parallel and Distributed Programming

Parallel computers have not yet had the expected impact on mainstream computing. Parallelism adds a level of complexity to the programming task that makes it very error-prone. Moreover, a large variety of very different parallel architectures exists. Porting an implementation from one machine to another may require substantial changes. This paper addresses some of these problems by developing a formal basis for the design of parallel programs in the form of a refinement calculus. The calculus allows the stepwise formal derivation of an abstract, low-level implementation from a trusted, high-level specification. The calculus thus helps structuring and documenting the development process. Portability is increased, because the introduction of a machine-dependent feature can be located in the refinement tree. Development efforts above this point in the tree are independent of that feature and are thus reusable. Moreover, the discovery of new, possibly more efficient solutions is facilitated. Last but not least, programs are correct by construction, which obviates the need for difficult debugging. Our programming/specification notation supports fair parallelism, shared-variable and message-passing concurrency, local variables and channels. The calculus rests on a compositional trace semantics that treats shared-variable and message-passing concurrency uniformly. The refinement relation combines a context-sensitive notion of trace inclusion and assumption-commitment reasoning to achieve compositionality. The calculus straddles both concurrency paradigms, that is, a shared-variable program can be refined into a distributed, message-passing program and vice versa. Received July 2001 / Accepted in revised form May 2002     

Creating and Justifying Research and Development Value: Scope,Scale, Skill and Social Networking of R&D

In this paper we describe a framework for analysing the creation and justification of Research & Development. The 4S framework is developed for analysing the scope, scale, skills and social network aspects of Research & Development value. The framework is based on social system theory, a process contingency model, and recent Research & Development metrics. We present a first empirical assessment based on a workshop using the 4S framework for leveraging Research & Development. Results that assist in the assessment of value creation utilising R & D within networks are very relevant in high tech industries. The multi–dimensional process approach of this framework seems promising for understanding and managing R&D value creation, but needs further operationalisation. Case studies are described and a Dutch network on leveraging R&D has been initiated.     

ROLE OF COMPOSITION ON THE VISCOSITY AND SHEAR STRESS TEMPERATURE BEHAVIOUR OF SOME LUBE OIL BASE STOCKS

Lubricating oil base stocks differ greatly in their chemical composition and consequently in their physical properties and applications. Influence of waxes and various hydrocarbon type constituents viz saturates and aromatic components on the viscosity and shear stress as a function of temperature in different lube oil base stocks has been studied in the present paper.     

Mathematical analysis of dynamic channel selection in indoor mobilewireless communication systems

Dynamic channel selection (DCS) is an algorithm for flexible resource sharing in mobile radio systems. The digital enhanced cordless telecommunications (DECT) standard implements a version of DCS based on time as well as frequency multiplexing. In this paper, mathematical models are developed to evaluate the probabilities of channel availability, desired carrier power, and the carrier-to-interference ratio (CIR) for a constant traffic load. These results can be used to compute the call setup blocking probability. The models reported in this study are based on a decentralized DCS according to the DECT standard specifications. The results show that blocking due to availability of a channel (resource blocking), not interference blocking, generally is the most important factor in overall call blocking. Furthermore, it is seen that resource blocking is sensitive to the implementation of portable sets. Also, with homogeneous static traffic, this type of DCS ran be as good as fixed channel allocation (FCA) with respect to resource blocking     

Reconstruction and rehabilitation of short-range, high-velocity gunshot injury to the lower face: a case report

BACKGROUND: Germ cell tumors (GCTs) and their metastases may be found in numerous sites that are accessible to cytologic sampling, and many are responsive to chemotherapy. METHODS: The authors reviewed 20 examples of GCT cytology from 16 males and 3 females ranging in age from 1.5 to 61 years (median, 34 years). With two exceptions, one benign cystic ovarian teratoma in which intraoperative cytology was used to diagnose an associated adult-type carcinoma and one undescended testis in which seminoma presented as an abdominal mass, the material reviewed included no examples of primary gonadal GCT. RESULTS: The authors studied 7 primary and 13 metastatic GCTs; these studies were based on 13 in vivo aspirations, 4 intraoperative preparations, and 3 samples of body cavity fluids. All samples were correctly interpreted as malignant, and only one was incorrectly classified as a non-GCT malignancy. CONCLUSIONS: Clinical and cytologic findings are useful in the diagnosis of GCTs and their metastases. Incorrect interpretation of these neoplasms as poorly differentiated malignancies of other types may deprive the patient of effective chemotherapy. Air-dried, Romanowsky-stained smear material and cell block sections may contribute to the resolution of diagnostic dilemmas.