The role of the harmonic vector average in motion integration

The local speeds of object contours vary systematically with the cosine of the angle between the normal component of the local velocity and the global object motion direction. An array of Gabor elements whose speed changes with local spatial orientation in accordance with this pattern can appear to move as a single surface. The apparent direction of motion of plaids and Gabor arrays has variously been proposed to result from feature tracking, vector addition and vector averaging in addition to the geometrically correct global velocity as indicated by the intersection of constraints (IOC) solution. Here a new combination rule, the harmonic vector average (HVA), is introduced, as well as a new algorithm for computing the IOC solution. The vector sum can be discounted as an integration strategy as it increases with the number of elements. The vector average over local vectors that vary in direction always provides an underestimate of the true global speed. The HVA, however, provides the correct global speed and direction for an unbiased sample of local velocities with respect to the global motion direction, as is the case for a simple closed contour. The HVA over biased samples provides an aggregate velocity estimate that can still be combined through an IOC computation to give an accurate estimate of the global velocity, which is not true of the vector average. Psychophysical results for type II Gabor arrays show perceived direction and speed falls close to the IOC direction for Gabor arrays having a wide range of orientations but the IOC prediction fails as the mean orientation shifts away from the global motion direction and the orientation range narrows. In this case perceived velocity generally defaults to the HVA.

Participatory crop improvement: the challenges of and opportunities for institutionalisation in the Indian public research sector

This thesis considers Participatory Crop Improvement (PCI) methodologies and examines the reasons behind their continued contestation and limited mainstreaming in conventional modes of crop improvement research within National Agricultural Research Systems (NARS). In particular, it traces the experiences of a long-established research network with over 20 years of experience in developing and implementing PCI methods across South Asia, and specifically considers its engagement with the Indian NARS and associated state-level agricultural research systems. In order to address the issues surrounding PCI institutionalisation processes, a novel conceptual framework was derived from a synthesis of the literatures on Strategic Niche Management (SNM) and Learning-based Development Approaches (LBDA) to analyse the socio-technical processes and structures which constitute the PCI ‘niche’ and NARS ‘regime’. In examining the niche and regime according to their socio-technical characteristics, the framework provides explanatory power for understanding the nature of their interactions and the opportunities and barriers that exist with respect to the translation of lessons and ideas between niche and regime organisations. The research shows that in trying to institutionalise PCI methods and principles within NARS in the Indian context, PCI proponents have encountered a number of constraints related to the rigid and hierarchical structure of the regime organisations; the contractual mode of most conventional research, which inhibits collaboration with a wider group of stakeholders; and the time-limited nature of PCI projects themselves, which limits investment and hinders scaling up of the innovations. It also reveals that while the niche projects may be able to induce a ‘weak’ form of PCI institutionalisation within the Indian NARS by helping to alter their institutional culture to be more supportive of participatory plant breeding approaches and future collaboration with PCI researchers, a ‘strong’ form of PCI institutionalisation, in which NARS organisations adopt participatory methodologies to address all their crop improvement agenda, is likely to remain outside of the capacity of PCI development projects to deliver.

Potential sites of triple-helical nucleic acid formation in chromosomes of Rhynchosciara (Diptera: Sciaridae) and Drosophila melanogaster

Antibodies to specific nucleic acid conformations are amongst the methods that have allowed the study of non-canonical (Watson-Crick) DNA structures in higher organisms. In this work, the structural limitations for the immunological detection of DNA.RNA hybrid duplexes were examined using specific RNA homopolymers as probes for homopolymer polydeoxyadenylic acid (poly(dA)).polydeoxythymidylic acid (poly(dT))-rich regions of Rhynchosciara americana (Diptera: Sciaridae) chromosomes. Anti-DNA.RNA duplexes did not react with the complex formed between chromosomal poly(dA) and exogenous polyuridylic acid (poly(rU)). Additionally, poly(rU) prevented the detection of polyadenylic acid.poly(dT) hybrid duplexes preformed in situ. These results raised the possibility that three-stranded structures rather than duplexes were formed in chromosomal sites. To test this hypothesis, the specificity of antibodies to triple-helical nucleic acids was reassessed employing distinct nucleic acid configurations. These antibodies were raised to the poly(dA).poly(rU).poly(rU) complex and have been used here for the first time in immunocytochemistry. Anti-triplex antibodies recognised the complex poly(dA).poly(rU).poly(rU) assembled with poly(rU) in poly(dA).poly(dT)-rich homopolymer regions of R. americana chromosomes. The antibodies could not detect short triplex stretches, suggesting the existence of constraints for triple-helix detection, probably related to triplex tract length. In addition, anti-poly(dA).poly(rU).poly(rU) antibodies reacted with the pericentric heterochromatin of RNase-treated polytene chromosomes of R. americana and Drosophila melanogaster. In apparent agreement with data obtained in cell types from other organisms, the results of this work suggest that significant triple-helix DNA extensions can be formed in pericentric regions of these species.

The Evolution of Modularity in the Mammalian Skull II: Evolutionary Consequences

Changes in patterns and magnitudes of integration may influence the ability of a species to respond to selection. Consequently, modularity has often been linked to the concept of evolvability, but their relationship has rarely been tested empirically. One possible explanation is the lack of analytical tools to compare patterns and magnitudes of integration among diverse groups that explicitly relate these aspects to the quantitative genetics framework. We apply such framework here using the multivariate response to selection equation to simulate the evolutionary behavior of several mammalian orders in terms of their flexibility, evolvability and constraints in the skull. We interpreted these simulation results in light of the integration patterns and magnitudes of the same mammalian groups, described in a companion paper. We found that larger magnitudes of integration were associated with a blur of the modules in the skull and to larger portions of the total variation explained by size variation, which in turn can exert a strong evolutionary constraint, thus decreasing the evolutionary flexibility. Conversely, lower overall magnitudes of integration were associated with distinct modules in the skull, to smaller fraction of the total variation associated with size and, consequently, to weaker constraints and more evolutionary flexibility. Flexibility and constraints are, therefore, two sides of the same coin and we found them to be quite variable among mammals. Neither the overall magnitude of morphological integration, the modularity itself, nor its consequences in terms of constraints and flexibility, were associated with absolute size of the organisms, but were strongly associated with the proportion of the total variation in skull morphology captured by size. Therefore, the history of the mammalian skull is marked by a trade-off between modularity and evolvability. Our data provide evidence that, despite the stasis in integration patterns, the plasticity in the magnitude of integration in the skull had important consequences in terms of evolutionary flexibility of the mammalian lineages.

Crop rotation scheduling with adjacency constraints

In this article we propose a 0-1 optimization model to determine a crop rotation schedule for each plot in a cropping area. The rotations have the same duration in all the plots and the crops are selected to maximize plot occupation. The crops may have different production times and planting dates. The problem includes planting constraints for adjacent plots and also for sequences of crops in the rotations. Moreover, cultivating crops for green manuring and fallow periods are scheduled into each plot. As the model has, in general, a great number of constraints and variables, we propose a heuristics based on column generation. To evaluate the performance of the model and the method, computational experiments using real-world data were performed. The solutions obtained indicate that the method generates good results.

Approximating a class of combinatorial problems with rational objective function

In the late seventies, Megiddo proposed a way to use an algorithm for the problem of minimizing a linear function a(0) + a(1)x(1) + ... + a(n)x(n) subject to certain constraints to solve the problem of minimizing a rational function of the form (a(0) + a(1)x(1) + ... + a(n)x(n))/(b(0) + b(1)x(1) + ... + b(n)x(n)) subject to the same set of constraints, assuming that the denominator is always positive. Using a rather strong assumption, Hashizume et al. extended Megiddo`s result to include approximation algorithms. Their assumption essentially asks for the existence of good approximation algorithms for optimization problems with possibly negative coefficients in the (linear) objective function, which is rather unusual for most combinatorial problems. In this paper, we present an alternative extension of Megiddo`s result for approximations that avoids this issue and applies to a large class of optimization problems. Specifically, we show that, if there is an alpha-approximation for the problem of minimizing a nonnegative linear function subject to constraints satisfying a certain increasing property then there is an alpha-approximation (1 1/alpha-approximation) for the problem of minimizing (maximizing) a nonnegative rational function subject to the same constraints. Our framework applies to covering problems and network design problems, among others.

Graphical constraints: a graphical user interface for constraint problems

A constraint satisfaction problem is a classical artificial intelligence paradigm characterized by a set of variables (each variable with an associated domain of possible values), and a set of constraints that specify relations among subsets of these variables. Solutions are assignments of values to all variables that satisfy all the constraints. Many real world problems may be modelled by means of constraints. The range of problems that can use this representation is very diverse and embraces areas like resource allocation, scheduling, timetabling or vehicle routing. Constraint programming is a form of declarative programming in the sense that instead of specifying a sequence of steps to execute, it relies on properties of the solutions to be found, which are explicitly defined by constraints. The idea of constraint programming is to solve problems by stating constraints which must be satisfied by the solutions. Constraint programming is based on specialized constraint solvers that take advantage of constraints to search for solutions. The success and popularity of complex problem solving tools can be greatly enhanced by the availability of friendly user interfaces. User interfaces cover two fundamental areas: receiving information from the user and communicating it to the system; and getting information from the system and deliver it to the user. Despite its potential impact, adequate user interfaces are uncommon in constraint programming in general. The main goal of this project is to develop a graphical user interface that allows to, intuitively, represent constraint satisfaction problems. The idea is to visually represent the variables of the problem, their domains and the problem constraints and enable the user to interact with an adequate constraint solver to process the constraints and compute the solutions. Moreover, the graphical interface should be capable of configure the solver’s parameters and present solutions in an appealing interactive way. As a proof of concept, the developed application – GraphicalConstraints – focus on continuous constraint programming, which deals with real valued variables and numerical constraints (equations and inequalities). RealPaver, a state-of-the-art solver in continuous domains, was used in the application. The graphical interface supports all stages of constraint processing, from the design of the constraint network to the presentation of the end feasible space solutions as 2D or 3D boxes.

Studying properties of Lagrangian bounds for many-to-many assignment problems

Classical and modified Lagrangian bounds for the optimal value of optimization problems with a double decomposable structure are studied. For the class of many-to-many assignment problems, this property of constraints is used to design a subgradient algorithm for solving the modified dual problem. Numerical results are presented to compare the quality of classical and modified bounds, as well as the properties of the corresponding Lagrangian solutions.

Comparison of Lagrangian Bounds for One Class of Generalized Assignment Problems

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Estimation of variances of the effects of incomplete diallels using a matrix approach

A matrix approach is described for assessing the variance of effects in incomplete diallels designs. The method is illustrated by reference to simulated complete and incomplete diallels using different combinations of constraints, average degree of dominance and, for the incomplete diallel, number of hybrids. Our results showed that caution should be taken in working with incomplete diallels under conditions of overdominance because there were changes in the rank of the genotypes when the excluded hybrid had parents with a low frequency of the favorable allele (i.e. the allele which increases expression of a character). The expression described in this paper is a rapid and safe approach to estimate variances and covariances of the effects of contrasts of incomplete diallels. Copyright by the Brazilian Society of Genetics.

Application of an iterative method and an evolutionary algorithm in fuzzy optimization

This work develops two approaches based on the fuzzy set theory to solve a class of fuzzy mathematical optimization problems with uncertainties in the objective function and in the set of constraints. The first approach is an adaptation of an iterative method that obtains cut levels and later maximizes the membership function of fuzzy decision making using the bound search method. The second one is a metaheuristic approach that adapts a standard genetic algorithm to use fuzzy numbers. Both approaches use a decision criterion called satisfaction level that reaches the best solution in the uncertain environment. Selected examples from the literature are presented to compare and to validate the efficiency of the methods addressed, emphasizing the fuzzy optimization problem in some import-export companies in the south of Spain. © 2012 Brazilian Operations Research Society.

Product mix: The approach of throughput per day

Defining product mix is very important for organisations because it determines how productive resources are allocated among various operations. However, it is often defined subjectively. The methods commonly used for this definition are Integer Linear Programming and heuristics based in Theory of Constraints, which use maximum throughput as a performance measure. Although this measure provides maximum throughput to specific problem, it does not consider aspects of time, as days, utilised to make the throughput. Taking this into account, the aim of this paper is to present a throughput per day approach to define product mix, as well as to propose a constructive heuristic to help in this process. The results show that the proposed heuristic obtained satisfactory approximation when compared to the optimum values obtained by enumeration. © 2013 Copyright Taylor and Francis Group, LLC.

Capacity of Active Power Reserve for Frequency Control Enhanced by Distributed Generators

Usually, ancillary services are provided by large conventional generators; however, with the growing interest in distributed generation to satisfy energy and environmental requirements, it seems reasonable to assume that these services could also be provided by distributed generators in an economical and efficient way. In this paper, a proposal for enhancement of the capacity of active power reserve for frequency control using distributed generators is presented. The goal is to minimize the payments done by the transmission system operator to conventional and distributed generators for this ancillary service and for the energy needed to satisfy loads and system losses, subject to a set of constraints. In order to perform analysis, the proposal was implemented using data of the IEEE 30-bus transmission test system. Comparisons were performed considering conventional generators without and with distributed generators installed in the system.

Higher spin constraints and the super (W∞/2 ⊕ W1+∞/2) algebra in the super eigenvalue model

We show that the partition function of the super eigenvalue model satisfies, for finite N (non-perturbatively), an infinite set of constraints with even spins s = 4, 6, . . . , ∞. These constraints are associated with half of the bosonic generators of the super (W∞/2 ⊕ W1+∞/2) algebra. The simplest constraint (s = 4) is shown to be reducible to the super Virasoro constraints, previously used to construct the model.

Optimization of Large-Scale Hydrothermal System Operation

This paper presents the development of a mathematical model to optimize the management and operation of the Brazilian hydrothermal system. The system consists of a large set of individual hydropower plants and a set of aggregated thermal plants. The energy generated in the system is interconnected by a transmission network so it can be transmitted to centers of consumption throughout the country. The optimization model offered is capable of handling different types of constraints, such as interbasin water transfers, water supply for various purposes, and environmental requirements. Its overall objective is to produce energy to meet the country's demand at a minimum cost. Called HIDROTERM, the model integrates a database with basic hydrological and technical information to run the optimization model, and provides an interface to manage the input and output data. The optimization model uses the General Algebraic Modeling System (GAMS) package and can invoke different linear as well as nonlinear programming solvers. The optimization model was applied to the Brazilian hydrothermal system, one of the largest in the world. The system is divided into four subsystems with 127 active hydropower plants. Preliminary results under different scenarios of inflow, demand, and installed capacity demonstrate the efficiency and utility of the model. From this and other case studies in Brazil, the results indicate that the methodology developed is suitable to different applications, such as planning operation, capacity expansion, and operational rule studies, and trade-off analysis among multiple water users. DOI: 10.1061/(ASCE)WR.1943-5452.0000149. (C) 2012 American Society of Civil Engineers.