The problem of scheduling under uncertainty is addressed. We propose a novel robust optimization methodology, which when applied to Mixed-Integer Linear Programming (MILP) problems produces “robust” solutions that are, in a sense, immune against uncertainty. The robust optimization approach is applied to the scheduling under uncertainty problem. Based on a novel and effective continuous-time sh...

Consider search designs for searching one nonzero 2- or 3-factor interaction under the search linear model. In the noisy case, search probability is given by Shirakura et al. (Ann. Statist. 24(6) (1996) 2560). In this paper some new properties of the searching probability are presented. New properties of the search probability enable us to compare designs, which depend on an unknown parameter ?...

This paper investigates a special type of recurrent expressions, lexical bundles, defined as a sequence of three or more words that co-occur frequently in a particular register (Biber et al., 1999). Considering the importance of this group of multi-word sequences in academic prose, this study explores the forms and syntactic structures of three- and four-word bundles in English abstracts writte...

In the last decade, switched systems have gained much attention since a large class of practical systems can be modeled as switched systems (see e.g., (Dayawansa & Martin, 1999)) and there exist systems that cannot be asymptotically stabilized by a single continuous feedback control law (see e.g., (Brockett, 1983)). For stability analysis of switched systems, many interesting results have been ...

Circuit simulation is a fundamental enabler for the design of integrated circuits. As the design complexity increases, there has been a long lasting interest in speeding up transient circuit simulation using paralellization (Dong et al., 2008; Dong & Li, 2009b;c; Reichelt et al., 1993; Wever et al., 1996; Ye et al., 2008). On the other hand, Harmonic Balance (HB), as a general frequency-domain ...

A new solution technique is proposed here for a specific kind of separation-network synthesis (SNS) problem, using Branch-and-Bound (B&B) framework and linear programming (LP). The suggested method determines effectively the structure and flowrates of the optimal separation network. The method is illustrated by the solution of an SNS problem introduced in (Kovacs et al., 1995). The aim is to pr...

• Weak formulation: – Involves a typical primal DG formulation for the Laplace equation (see Arnold et al. (2002)). – Adopt the numerical flux proposed by Brezzi et al. (1999). – Second order accurate time discretization is used for the time derivative in the free surface boundary condition (Van der Vegt and Tomar (2005)). • Finite element discretization results in a symmetric and positive defi...