actants is used to compute the time evolution of reactant concentrations. The stochastic algorithm is rigorous in the The stochastic time evolution method has been used previously to study non-linear chemical reaction processes in well-stirred hosense that it provides an exact solution to the correspondmogeneous systems. We present the first treatment of diffusion, in ing master equation for ch...

The thesis in hand comprises the general part of my cumulative dissertation, sub-mitted to the University of Hamburg in September 2012. It describes my scientificwork on computer strategies for structure-based active site analysis in the group forComputational Molecular Design of the Center for Bioinformatics from June 2008 tillSeptember 2012. Furthermore, this manuscript contai...

We examine a standard factory scheduling problem with stochastic processing and setup times, minimizing the expectation of the weighted number of tardy jobs. Because the costs of operators in the schedule are stochastic and sequence dependent, standard dynamic programming algorithms such as A* may fail to find the optimal schedule. The SDA * (Stochastic Dominance A*) algo­ rithm remedies this d...

This paper describes the combination of previously-developed component placement and routing algorithms into an integrated computational approach to product layout optimization. Previ ous work introduced simulated annealing-based algorithms for optimal component packing (Szykman and Cagan, 1995), con strained layout (Szykman and Cagan, 1997), and routing (Szyk man and Cagan, 1996). These proble...

We describe an automatic storm-tracking system to help Doppler radar system to detect severe storms such as thunderwith the forecasting of severe storms. In this article, we present the storms and tornadoes. The Doppler radar generates intensity and concepts of fuzzy point, fuzzy vector, fuzzy length of a fuzzy vector, radial velocity images, examples of which are shown in Figures and fuzzy ang...

Many high level parallel programming languages allow for ne grained parallelism As in the popular work time frame work for parallel algorithm design programs written in such languages can express the full parallelism in the program without specifying the mapping of program tasks to proces sors A common concern in executing such programs is to schedule tasks to processors dynamically so as to mi...

As part of the ongoing Illinois Digital Library Initiative are expected to worsen as the amount of online informaproject, this research proposes an intelligent agent aption increases. This is mainly due to the problems of proach to Web searching. In this experiment, we develinformation overload and vocabulary differences (Chen, oped two Web personal spiders based on best first 1994; Furnas, Lan...

A method for parallel morphological and syntactic analysis of Japanese language is proposed. Parallel syntactic analysis is based on an efficient parallel LR parsing algorithm for general context-free grammars. It handles syntactic features as constraints. Each syntactic feature is defined by a verbal sub-categorization and attached to a special set of phrases called bunsetsu in Japanese. The b...

In data centers, data replication is the primary method used to ensure avail-ability of customer data. To avoid correlated failure, cloud storage infras-tructure providers model hierarchical failure domains using a tree, and avoidplacing a large number of data replicas within the same failure domain (i.e.on the same branch of the tree). Typical best practices ensure that replica...

An algorithm for least squares fitting of a polynomial to a function z(x.y) of two independent variables is described. It is assumed that the function is given by a number of "measured values". which may be arbitrarily distributed over the ~Yplane. The polynomial is constructed as a linear combination of a set of polynomials which are orthonormalized over the set of given data points by the mod...