The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm

This paper addresses the single machine scheduling problem with a common due date aiming to minimize earliness and tardiness penalties. Due to its complexity, most of the previous studies in the literature deal with this problem using heuristics and metaheuristics approaches. With the intention of contributing to the study of this problem, a branch-and-bound algorithm is proposed. Lower bounds and pruning rules that exploit properties of the problem are introduced. The proposed approach is examined through a computational comparative study with 280 problems involving different due date scenarios. In addition, the values of optimal solutions for small problems from a known benchmark are provided.

Simple and Efficient Access to 3-Ethoxycarbonylpyrroles, Benzofurans, and Naphthofurans

An efficient method was developed for the synthesis of pyrrole and furan derivatives from enamines, phenols, and naphthols. The key steps involve iodocyclization and alumina-induced dehydroiodination reactions.

Chiral Triphenylprolinol Ligands for the Efficient Catalytic Asymmetric Arylation of Aldehydes

The synthesis of new chiral amino alcohols by Heck arylation of an enecarbamate is described. These compounds were used as chiral ligands for the catalytic asymmetric arylation of aldehydes and can be easily recovered. Chiral, nonracemic diarylmethanols were obtained in high yields and enantioselectivities.

Highly efficient palladium-catalyzed Suzuki-Miyaura reactions of potassium aryltrifluoroborates with 5-iodo-1,3-dioxin-4-ones in water: an approach to alpha-aryl-beta-ketoesters

The high efficient palladium-catalyzed Suzuki-Miyaura reactions of potassium aryltrifluoroborates 3 with 5-iodo-1,3-dioxin-4-ones 2a-b in water as only solvent in the presence of n-Bu(4)NOH as base is reported. The respective 5-aryl-1,3-dioxin-4-ones 4a-n were obtained in good to excellent yields. The catalyst system provides high efficiency at low load using electronically diverse coupling partners. The obtained 2,2,6-trimethyl-5-aryl-1,3-dioxin-4-ones were transformed into corresponding alpha-aryl-beta-ketoesters 6 by reaction with an alcohol in the absence of solvent. (C) 2009 Elsevier Ltd. All rights reserved.

Copper salt-catalyzed homo-coupling reaction of potassium alkynyltrifluoroborates: a simple and efficient synthesis of symmetrical 1,3-diynes

The copper-catalyzed dimerization of alkynyltrifluoroborates proceeds readily with good yields. The homo-coupling reaction can be effected in DMSO, in the open air, using Cu(OAc)(2) as catalyst in the absence of any other additives. A variety of functional groups are tolerated. (C) 2008 Elsevier Ltd. All rights reserved.

Efficient sonochemical synthesis of novel 3,5-diaryl-4,5-dihydro-1H-pyrazole-1-carboximidamides

An Ultrasound-assisted preparation of a series of novel 3,5-diaryl-4,5-dihydro-1H-pyrazole-1-carboximidamides that proceeds via the efficient reaction of chalcones with aminoguanidine hydrochloride under clean conditions is described. (C) 2009 Elsevier B.V. All rights reserved.

Computationally efficient solution techniques for adsorption problems involving steep gradients in bidisperse particles

A piecewise uniform fitted mesh method turns out to be sufficient for the solution of a surprisingly wide variety of singularly perturbed problems involving steep gradients. The technique is applied to a model of adsorption in bidisperse solids for which two fitted mesh techniques, a fitted-mesh finite difference method (FMFDM) and fitted mesh collocation method (FMCM) are presented. A combination (FMCMD) of FMCM and the DASSL integration package is found to be most effective in solving the problems. Numerical solutions (FMFDM and FMCMD) were found to match the analytical solution when the adsorption isotherm is linear, even under conditions involving steep gradients for which global collocation fails. In particular, FMCMD is highly efficient for macropore diffusion control or micropore diffusion control. These techniques are simple and there is no limit on the range of the parameters. The techniques can be applied to a variety of adsorption and desorption problems in bidisperse solids with non-linear isotherm and for arbitrary particle geometry.

A scheme for efficient quantum computation wtih linear optics

Quantum computers promise to increase greatly the efficiency of solving problems such as factoring large integers, combinatorial optimization and quantum physics simulation. One of the greatest challenges now is to implement the basic quantum-computational elements in a physical system and to demonstrate that they can be reliably and scalably controlled. One of the earliest proposals for quantum computation is based on implementing a quantum bit with two optical modes containing one photon. The proposal is appealing because of the ease with which photon interference can be observed. Until now, it suffered from the requirement for non-linear couplings between optical modes containing few photons. Here we show that efficient quantum computation is possible using only beam splitters, phase shifters, single photon sources and photo-detectors. Our methods exploit feedback from photo-detectors and are robust against errors from photon loss and detector inefficiency. The basic elements are accessible to experimental investigation with current technology.

A fast cross-entropy method for estimating buffer overflows in queuing networks

In this paper, we propose a fast adaptive importance sampling method for the efficient simulation of buffer overflow probabilities in queueing networks. The method comprises three stages. First, we estimate the minimum cross-entropy tilting parameter for a small buffer level; next, we use this as a starting value for the estimation of the optimal tilting parameter for the actual (large) buffer level. Finally, the tilting parameter just found is used to estimate the overflow probability of interest. We study various properties of the method in more detail for the M/M/1 queue and conjecture that similar properties also hold for quite general queueing networks. Numerical results support this conjecture and demonstrate the high efficiency of the proposed algorithm.

Embedded Voxel Colouring

The reconstruction of a complex scene from multiple images is a fundamental problem in the field of computer vision. Volumetric methods have proven to be a strong alternative to traditional correspondence-based methods due to their flexible visibility models. In this paper we analyse existing methods for volumetric reconstruction and identify three key properties of voxel colouring algorithms: a water-tight surface model, a monotonic carving order, and causality. We present a new Voxel Colouring algorithm which embeds all reconstructions of a scene into a single output. While modelling exact visibility for arbitrary camera locations, Embedded Voxel Colouring removes the need for a priori threshold selection present in previous work. An efficient implementation is given along with results demonstrating the advantages of posteriori threshold selection.

Can globalisation result in less efficient and more vulnerable industries?

Growing economic globalisation (a means of market extension) may increase the economic vulnerability of firms in modern industries, especially those in which firms experience substantial economies of scale. The possibility is explored that globalisation activates competitive pressures that forces firms into a situation where their leverage (fixed costs relative to variable costs, or overhead cost relative to operating costs or capital intensity) rises substantially. Consequently, they become increasingly vulnerable to a sudden adverse change in economic conditions, such as a collapse in the demand for their industry’s product. This is explored for monopolistically competitive markets and also for oligopolistic markets of the type considered and modelled by Sweezy using kinked demand curves. In addition, globalisation is hypothesised to induce firms to become more uniformly efficient. While this has static efficiency advantages, this lack of heterogeneity in productive efficiency of firms can make for economic inefficiency in the adjustment of the industry to altered economic conditions. It is shown that lack of variation in the economic efficiency of firms can impede the speed of market adjustment to new equilibria and may destabilise market equilibria.

An improved seeded region growing algorithm

Recently Adams and Bischof (1994) proposed a novel region growing algorithm for segmenting intensity images. The inputs to the algorithm are the intensity image and a set of seeds - individual points or connected components - that identify the individual regions to be segmented. The algorithm grows these seed regions until all of the image pixels have been assimilated. Unfortunately the algorithm is inherently dependent on the order of pixel processing. This means, for example, that raster order processing and anti-raster order processing do not, in general, lead to the same tessellation. In this paper we propose an improved seeded region growing algorithm that retains the advantages of the Adams and Bischof algorithm fast execution, robust segmentation, and no tuning parameters - but is pixel order independent. (C) 1997 Elsevier Science B.V.

Prediction of MHC class II-binding peptides using an evolutionary algorithm and artificial neural network

Motivation: Prediction methods for identifying binding peptides could minimize the number of peptides required to be synthesized and assayed, and thereby facilitate the identification of potential T-cell epitopes. We developed a bioinformatic method for the prediction of peptide binding to MHC class II molecules. Results: Experimental binding data and expert knowledge of anchor positions and binding motifs were combined with an evolutionary algorithm (EA) and an artificial neural network (ANN): binding data extraction --> peptide alignment --> ANN training and classification. This method, termed PERUN, was implemented for the prediction of peptides that bind to HLA-DR4(B1*0401). The respective positive predictive values of PERUN predictions of high-, moderate-, low- and zero-affinity binder-a were assessed as 0.8, 0.7, 0.5 and 0.8 by cross-validation, and 1.0, 0.8, 0.3 and 0.7 by experimental binding. This illustrates the synergy between experimentation and computer modeling, and its application to the identification of potential immunotheraaeutic peptides.

Efficient transformation and regeneration of diverse cultivars of peanut (Arachis hypogaea L.) by particle bombardment into embryogenic callus produced from mature seeds

Peanut, one of the world's most important oilseed crops, has a narrow germplasm base and lacks sources of resistance to several major diseases. The species is considered recalcitrant to transformation, with few confirmed transgenic plants upon particle bombardment or Agrobacterium treatment. Reported transformation methods are limited by low efficiency, cultivar specificity, chimeric or infertile transformants, or availability of explants. Here we present a method to efficiently transform cultivars in both botanical types of peanut, by (1) particle bombardment into embryogenic callus derived from mature seeds, (2) escape-free (not stepwise) selection for hygromycin B resistance, (3) brief osmotic desiccation followed by sequential incubation on charcoal and cytokinin-containing media; resulting in efficient conversion of transformed somatic embryos into fertile, non-chimeric, transgenic plants. The method produces three to six independent transformants per bombardment of 10 cm(2) embryogenic callus. Potted, transgenic plant lines can be regenerated within 9 months of callus initiation, or 6 months after bombardment. Transgene copy number ranged from one to 20 with multiple integration sites. There was ca. 50% coexpression of hph and luc or uidA genes coprecipitated on separate plasmids. Reporter gene (luc) expression was confirmed in T-1 progeny from each of six tested independent transformants. Insufficient seeds were produced under containment conditions to determine segregation ratios. The practicality of the technique for efficient cotransformation with selected and unselected genes is demonstrated using major commercial peanut varieties in Australia (cv. NC-7, a virginia market type) and Indonesia (cv. Gajah, a spanish market type).

Is the Australian wool futures market efficient as a predictor of spot prices?

Giles and Goss (1980) have suggested that, if a futures market provides a forward pricing function, then it is an efficient market. In this article a simple test for whether the Australian Wool Futures market is efficient is proposed. The test is based on applying cointegration techniques to test the Law of One Price over a three, six, nine, and twelve month spread of futures prices. We found that the futures market is efficient for up to a six-month spread, but no further into the future. Because futures market prices can be used to predict spot prices up to six months in advance, woolgrowers can use the futures price to assess when they market their clip, but not for longer-term production planning decisions. (C) 1999 John Wiley & Sons, Inc.