This paper presents an accurate and efficient approach to optimize radiation transport simulations in a stochastic medium of high heterogeneity, like the Very High Temperature Gas-cooled Reactor (VHTR) configurations packed with TRISO fuel particles. Based on a fast nearest neighbor search algorithm, a modified fast Random Sequential Addition (RSA) method is first developed to speed up the gene...

Recent SSDs use parallel architectures with multi-channel and multiway, and manages multiple pages in a group, called superpage, to reduce the size of address mapping information. Such a coavrse grained mapping provides a poor performance for small sized random write requests. To solve the problem, this paper proposes a novel host-level device driver, called HARD, which merges several small siz...

In this paper we describe a computational study to solve hard frequency assignment problems (FAPs) to optimality using a tree decomposition of the graph that models interference constraints. We present a dynamic programming algorithm which solves FAPs based on this tree decomposition. With the use of several dominance and bounding techniques it is possible to solve small and medium-sized real-l...

Many signal processing algorithms are based on the computation of the eigenstructure (eigenvalues and eigenvectors) of the covariance matrix of a data matrix. Applications include: direction of arrival estimation in array processing, spectral estimation and CDMA synchronization [1]. The advantages of using the eigenvector-based methods (also called subspace based methods) are well-known. In the...

A mass Hierarchy of magnitude O(10) GeV separates the gravitational and electroweak interactions. Traditional proposed resolutions of this anomaly have included supersymmetric theories (most notably, the MSSM and ESSM) and string theory. However, energiers at which s-particles are expected to appear are not accessible to experiment, and string theory is only testable at ∼ Mpl. A novel idea invo...

In this paper, we study the container stacking problem (CSP) which is one of the most important problems in marine terminal. An optimisation model is developed in order to determine the optimal storage strategy for various container-handling schedules. The objective of the model is to minimise the distance between vessel berthing location and the storage positions of containers. The CSP is solv...

2 Consider a batch-sizing problem, where all jobs are identical or similar, and a unit processing time (1  p) is specified for each job. To minimize the total completion time of jobs, partitioning jobs into batches may be necessary. Learning effect from setup repetition makes small-sized batches; on the contrary, job's learning effect results in large-sized batches. With their collaborative in...

...................................................................................iii LIST OF FIGURES...........................................................................................iv INTRODUCTION..............................................................................................1 Scope and Motivation................................................................1 Basic D...

This paper addresses the joint quay crane and truck scheduling problem at a container terminal, considering the coordination of the two types of equipment to reduce their idle time between performing two successive tasks. For the unidirectional flow problem with only inbound containers, in which trucks go back to quayside without carrying outbound containers, a mixed-integer linear programming ...