1,721,001 research outputs found

    A Q-Learning-based method applied to stochastic resource constrained project scheduling with new project arrivals

    No full text
    In many resource-constrained project scheduling problems (RCPSP), the set of candidate projects is not fixed a priori but evolves with time. For example, while performing an initial set of projects according to a certain decision policy, a new promising project can emerge. To make an appropriate resource allocation decision for such a problem, project cancellation and resource idling decisions should complement the conventional scheduling decisions. In this study, the problem of stochastic RCPSP (sRCPSP) with dynamic project arrivals is addressed with the added flexibility of project cancellation and resource idling. To solve the problem, a Q-Learning-based approach is adopted. To use the approach, the problem is formulated as a Markov Decision Process with appropriate definitions of states, including information state and action variables. The Q-Learning approach enables us to derive an empirical state transition rules from simulation data so that analytical calculations of potentially exorbitantly complicated state transition rules can be circumvented. To maximize the advantage of using the empirically learned state transition rules, special type of actions including project cancellation and resource idling, which are difficult to incorporate into heuristics, were randomly added in the simulation. The random actions are filtered during the Q-Value iteration and properly utilized in the online decision making to maximize the total expected reward. Copyright (C) 2007 John Wiley & Sons, Ltd

    Machine learning: Overview of the recent progresses and implications for the process systems engineering field

    No full text
    Machine learning (ML) has recently gained in popularity, spurred by well-publicized advances like deep learning and widespread commercial interest in big data analytics. Despite the enthusiasm, some renowned experts of the field have expressed skepticism, which is justifiable given the disappointment with the previous wave of neural networks and other AI techniques. On the other hand, new fundamental advances like the ability to train neural networks with a large number of layers for hierarchical feature learning may present significant new technological and commercial opportunities. This paper critically examines the main advances in deep learning. In addition, connections with another ML branch of reinforcement learning are elucidated and its role in control and decision problems is discussed. Implications of these advances for the fields of process and energy systems engineering are also discussed. (C) 2017 Elsevier Ltd. All rights reserved.

    Identifying the interacting positions of a protein using Boolean learning and support vector machines

    No full text
    It is known that in the three-dimensional structure of a protein, certain amino acids can interact with each other in order to provide structural integrity or aid in its catalytic function. If these positions are mutated the loss of this interaction usually leads to a non-functional protein. Directed evolution experiments, which probe the sequence space of a protein through mutations in search for an improved variant, frequently result in such inactive sequences. In this work, we address the use of machine learning algorithms, Boolean learning and support vector machines (SVMs), to find such pairs of amino acid positions. The recombination method of imparting mutations was simulated to create in silico sequences that were used as training data for the algorithms. The two algorithms were combined together to develop an approach that weighs the structural risk as well as the empirical risk to solve the problem. This strategy was adapted to a multi-round framework of experiments where the data generated in the present round is used to design experiments for the next round to improve the generated library, as well as the estimation of the interacting positions. It is observed that this strategy can greatly improve the number of functional variants that are generated as well as the average number of mutations that can be made in the library. (c) 2006 Published by Elsevier Ltd

    Carbon - Right out of Thin Air

    No full text
    Matthew Realff, from the Georgia Tech School of Chemical & Biomolecular Engineering joins us to discuss our environmental carbon problem and some unique solutions, such as carbon removal from air

    Pooling for improved screening of combinatorial libraries for directed evolution

    No full text
    Following diversity generation in combinatorial protein engineering, a significant amount of effort is expended in screening the library for improved variants. Pooling, or combining multiple cells into the same assay well when screening, is a means to increase throughput and screen a larger portion of the library with less time and effort. We have developed and validated a Monte Carlo simulation model of pooling and used it to screen a library of beta-galactosidase mutants randomized in the active site to increase their activity toward fucosides. Here, we show that our model can successfully predict the number of highly improved mutants obtained via pooling and that pooling does increase the number of good mutants obtained. In unpooled conditions, we found a total of three mutants with higher activity toward p-nitrophenyl-beta-D-fucoside than that of the wild-type beta-galactosidase, whereas when pooling 10 cells per well we found a total of approximately 10 improved mutants. In addition, the number of "supermutants", those with the highest activity increase, was also higher when pooling was used. Pooling is a useful tool for increasing the efficiency of screening combinatorial protein engineering libraries

    Methods And Controllers For Simulated Moving Bed Chromatography For Multicomponent Separation

    No full text
    A system for reacting and separating solid and fluid components includes a series of sequential simulated moving bed (SMB) chromatography columns connected to form a circulation loop. Each SMB chromatography column includes an inlet and an outlet. A reactor is configured to receive a solid reactant and has an inlet and an outlet, and the reactor inlet is fluidly connected to an outlet of a first SMB chromatography column of the series of sequential SMB chromatography columns. The reactor outlet is fluidly connected to an inlet of a second SMB chromatography column of the series of sequential SMB chromatography columns.Georgia Tech Research Corporatio
    corecore