990 resultados para constrained efficiency
Resumo:
Capacity reduction programs in the form of buybacks or decommissioning programs have had relatively widespread application in fisheries in the US, Europe and Australia. A common criticism of such programs is that they remove the least efficient vessels first, resulting in an increase in average efficiency of the remaining fleet. The effective fishing power of the fleet, therefore, does not decrease in proportion to the number of vessels removed. Further, reduced crowding may increase efficiency of the remaining vessels. In this paper, the effects of a buyback program on average technical efficiency in Australia’s Northern Prawn Fishery are examined using a multi-output distance function approach with an explicit inefficiency model. The results indicate that average efficiency of the remaining vessels was greater than that of the removed vessels, and that average efficiency of remaining vessels also increased as a result of reduced crowding.
Resumo:
Several key issues need to be resolved before an efficient and reproducible Agrobacterium-mediated sugarcane transformation method can be developed for a wider range of sugarcane cultivars. These include loss of morphogenetic potential in sugarcane cells after Agrobacterium-mediated transformation, effect of exposure to abiotic stresses during in vitro selection, and most importantly the hypersensitive cell death response of sugarcane (and other nonhost plants) to Agrobacterium tumefaciens. Eight sugarcane cultivars (Q117, Q151, Q177, Q200, Q208, KQ228, QS94-2329, and QS94-2174) were evaluated for loss of morphogenetic potential in response to the age of the culture, exposure to Agrobacterium strains, and exposure to abiotic stresses during selection. Corresponding changes in the polyamine profiles of these cultures were also assessed. Strategies were then designed to minimize the negative effects of these factors on the cell survival and callus proliferation following Agrobacterium-mediated transformation. Some of these strategies, including the use of cell death protector genes and regulation of intracellular polyamine levels, will be discussed.
Resumo:
In automatic facial expression detection, very accurate registration is desired which can be achieved via a deformable model approach where a dense mesh of 60-70 points on the face is used, such as an active appearance model (AAM). However, for applications where manually labeling frames is prohibitive, AAMs do not work well as they do not generalize well to unseen subjects. As such, a more coarse approach is taken for person-independent facial expression detection, where just a couple of key features (such as face and eyes) are tracked using a Viola-Jones type approach. The tracked image is normally post-processed to encode for shift and illumination invariance using a linear bank of filters. Recently, it was shown that this preprocessing step is of no benefit when close to ideal registration has been obtained. In this paper, we present a system based on the Constrained Local Model (CLM) which is a generic or person-independent face alignment algorithm which gains high accuracy. We show these results against the LBP feature extraction on the CK+ and GEMEP datasets.
Resumo:
Focusing on the conditions that an optimization problem may comply with, the so-called convergence conditions have been proposed and sequentially a stochastic optimization algorithm named as DSZ algorithm is presented in order to deal with both unconstrained and constrained optimizations. The principle is discussed in the theoretical model of DSZ algorithm, from which we present the practical model of DSZ algorithm. Practical model efficiency is demonstrated by the comparison with the similar algorithms such as Enhanced simulated annealing (ESA), Monte Carlo simulated annealing (MCS), Sniffer Global Optimization (SGO), Directed Tabu Search (DTS), and Genetic Algorithm (GA), using a set of well-known unconstrained and constrained optimization test cases. Meanwhile, further attention goes to the strategies how to optimize the high-dimensional unconstrained problem using DSZ algorithm.