3 resultados para Feedback Mechanism in MIMO
em Nottingham eTheses
Resumo:
We propose a model for chiral polymerisation and investigate its symmetric and asymmetric solutions. The model has a source species which decays into left- and right-handed types of monomer, each of which can polymerise to form homochiral chains; these chains are susceptible to `poisoning' by the opposite handed monomer. Homochiral polymers are assumed to influence the proportion of each type of monomer formed from the precursor. We show that for certain parameter values a positive feedback mechanism makes the symmetric steady-state solution unstable. The kinetics of polymer formation are then analysed in the case where the system starts from zero concentrations of monomers and chains. We show that following a long induction time, extremely large concentrations of polymers are formed for a short time, during this time an asymmetry introduced into the system by a random external perturbation may be massively amplified. The system then approaches one of the steady-state solutions described above.
Resumo:
Abstract. Two ideas taken from Bayesian optimization and classifier systems are presented for personnel scheduling based on choosing a suitable scheduling rule from a set for each person's assignment. Unlike our previous work of using genetic algorithms whose learning is implicit, the learning in both approaches is explicit, i.e. we are able to identify building blocks directly. To achieve this target, the Bayesian optimization algorithm builds a Bayesian network of the joint probability distribution of the rules used to construct solutions, while the adapted classifier system assigns each rule a strength value that is constantly updated according to its usefulness in the current situation. Computational results from 52 real data instances of nurse scheduling demonstrate the success of both approaches. It is also suggested that the learning mechanism in the proposed approaches might be suitable for other scheduling problems.
Resumo:
Abstract. Two ideas taken from Bayesian optimization and classifier systems are presented for personnel scheduling based on choosing a suitable scheduling rule from a set for each person's assignment. Unlike our previous work of using genetic algorithms whose learning is implicit, the learning in both approaches is explicit, i.e. we are able to identify building blocks directly. To achieve this target, the Bayesian optimization algorithm builds a Bayesian network of the joint probability distribution of the rules used to construct solutions, while the adapted classifier system assigns each rule a strength value that is constantly updated according to its usefulness in the current situation. Computational results from 52 real data instances of nurse scheduling demonstrate the success of both approaches. It is also suggested that the learning mechanism in the proposed approaches might be suitable for other scheduling problems.