Evolution of polyembryony: Consequences to the fitness of mother and offspring

Polyembryony, referring here to situations where a nucellar embryo is formed along with the zygotic embryo, has different consequences for the fitness of the maternal parent and offspring. We have developed genetic and inclusive fitness models to derive the conditions that permit the evolution of polyembryony under maternal and offspring control. We have also derived expressions for the optimal allocation (evolutionarily stable strategy, ESS) of resources between zygotic and nucellar embryos. It is seen that (i) Polyembryony can evolve more easily under maternal control than under that of either the offspring or the ‘selfish’ endosperm. Under maternal regulation, evolution of polyembryony can occur for any clutch size. Under offspring control polyembryony is more likely to evolve for high clutch sizes, and is unlikely for low clutch sizes (<3). This conflict between mother and offspring decreases with increase in clutch size and favours the evolution of polyembryony at high clutch sizes, (ii) Polyembryony can evolve for values of “x” (the power of the function relating fitness to seed resource) greater than 0.5758; the possibility of its occurrence increases with “x”, indicating that a more efficient conversion of resource into fitness favours polyembryony. (iii) Under both maternal parent and offspring control, the evolution of polyembryony becomes increasingly unlikely as the level of inbreeding increases, (iv) The proportion of resources allocated to the nucellar embryo at ESS is always higher than that which maximizes the rate of spread of the allele against a non-polyembryonic allele.Finally we argue that polyembryony is a maternal counter strategy to compensate for the loss in her fitness due to brood reduction caused by sibling rivalry. We support this assertion by two empirical evidences: (a) the extent of polyembryony is positively correlated with brood reduction inCitrus, and (b) species exhibiting polyembryony are more often those that frequently exhibit brood reduction.

Performance prediction and loss analysis of low specific speed submersible pumps

A performance prediction procedure is presented for low specific speed submersible pumps with a review of loss models given in the literature. Most of the loss theories discussed in this paper are one dimensional and improvements are made with good empiricism for the prediction to cover the entire range of operation of the low specific speed pumps. Loss correlations, particularly in the low flow range, are discussed. Prediction of the shape of efficiency-capacity and total head-capacity curves agrees well with the experimental results in almost the full range of operating conditions. The approach adopted in the present analysis, of estimating the losses in the individual components of a pump, provides means for improving the performance and identifying the problem areas in existing designs of the pumps. The investigation also provides a basis for selection of parameters for the optimal design of the pumps in which the maximum efficiency is an important design parameter. The scope for improvement in the prediction procedure with the nature of flow phenomena in the low flow region has been discussed in detail.

Electron energy loss spectroscopic study of Cr(CO)6, Mo(CO)6 and W(CO)6 in the vapour phase

Electron energy loss spectra (EELS) of Cr, Mo and W hexacarbonyls in the vapour phase are reported. Most of the bands observed are similar to those in optical spectra, but the two high energy transitions in the 9·8–11·2 eV region are reported here for the first time. Based on the orbital energies from the ultraviolet photoelectron spectra and the electronic transition energies from EELS and earlier optical studies, the molecular energy level schemes of these molecules are constructed.

Anomalous viscous loss in emulsions

We propose a model for concentrated emulsions based on the speculation that a macroscopic shear strain does not produce an affine deformation in the randomly close-packed droplet structure. The model yields an anomalous contribution to the complex dynamic shear modulus that varies as the square root of frequency. We test this prediction using a novel light scattering technique to measure the dynamic shear modulus, and directly observe the predicted behavior over six decades of frequency and a wide range of volume fractions.

Dielectric function and optical conductivity of TiOx (0.8loss spectroscopy

Reflection electron energy-loss spectra are reported for the family of compounds TiOx over the entire homogeneity range (0.8 < a: < 1.3). The spectra exhibit a plasmon feature on the low-energy side, while several interband transitions are prominent at higher energies. The real and imaginary parts of dielectric functions and optical conductivity for these compounds are determined using the Kramers-Kronig analysis. The results exhibit systematic behavior with varying oxygen stoichiometry.

A game theoretical multiple resource interaction approach to resource allocation in an air campaign

In this paper we propose a multiple resource interaction model in a game-theoretical framework to solve resource allocation problems in theater level military campaigns. An air raid campaign using SEAD aircraft and bombers against an enemy target defended by air defense units is considered as the basic platform. Conditions for the existence of saddle point in pure strategies is proved and explicit feedback strategies are obtained for a simplified model with linear attrition function limited by resource availability. An illustrative example demonstrates the key features.

Constraint loss under dynamic loading in rate independent plastic solids

The objectives of this paper are to examine the loss of crack tip constraint in dynamically loaded fracture specimens and to assess whether it can lead to enhancement in the fracture toughness at high loading rates which has been observed in several experimental studies. To this end, 2-D plane strain finite element analyses of single edge notched (tension) specimen and three point bend specimen subjected to time varying loads are performed. The material is assumed to obey the small strain J(2) flow theory of plasticity with rate independent behaviour. The results demonstrate that a valid J-Q field exists under dynamic loading irrespective of the crack length and specimen geometry. Further, the constraint parameter Q becomes strongly negative at high loading rates, particularly in deeply cracked specimens. The variation of dynamic fracture toughness K-dc with stress intensity rate K for cleavage cracking is predicted using a simple critical stress criterion. It is found that inertia-driven constraint loss can substantially enhance K-dc for (K) over dot > 10(5) MPa rootm/s.

Efficient algorithms for learning kernels from multiple similarity matrices with general convex loss functions

In this paper we consider the problem of learning an n × n kernel matrix from m(1) similarity matrices under general convex loss. Past research have extensively studied the m = 1 case and have derived several algorithms which require sophisticated techniques like ACCP, SOCP, etc. The existing algorithms do not apply if one uses arbitrary losses and often can not handle m > 1 case. We present several provably convergent iterative algorithms, where each iteration requires either an SVM or a Multiple Kernel Learning (MKL) solver for m > 1 case. One of the major contributions of the paper is to extend the well knownMirror Descent(MD) framework to handle Cartesian product of psd matrices. This novel extension leads to an algorithm, called EMKL, which solves the problem in O(m2 log n 2) iterations; in each iteration one solves an MKL involving m kernels and m eigen-decomposition of n × n matrices. By suitably defining a restriction on the objective function, a faster version of EMKL is proposed, called REKL,which avoids the eigen-decomposition. An alternative to both EMKL and REKL is also suggested which requires only an SVMsolver. Experimental results on real world protein data set involving several similarity matrices illustrate the efficacy of the proposed algorithms.

Optimal allocation of carbon credits to emitting agents in a carbon economy

Reduction of carbon emissions is of paramount importance in the context of global warming. Countries and global companies are now engaged in understanding systematic ways of achieving well defined emission targets. In fact, carbon credits have become significant and strategic instruments of finance for countries and global companies. In this paper, we formulate and suggest a solution to the carbon allocation problem, which involves determining a cost minimizing allocation of carbon credits among different emitting agents. We address this challenge in the context of a global company which is faced with the challenge of determining an allocation of carbon credit caps among its divisions in a cost effective way. The problem is formulated as a reverse auction problem where the company plays the role of a buyer or carbon planning authority and the different divisions within the company are the emitting agents that specify cost curves for carbon credit reductions. Two natural variants of the problem: (a) with unlimited budget and (b) with limited budget are considered. Suitable assumptions are made on the cost curves and in each of the two cases we show that the resulting problem formulation is a knapsack problem that can be solved optimally using a greedy heuristic. The solution of the allocation problem provides critical decision support to global companies engaged seriously in green programs.

Machine-tool selection and operation allocation in FMS: solving a fuzzy goal-programming model using a genetic algorithm

The decision-making process for machine-tool selection and operation allocation in a flexible manufacturing system (FMS) usually involves multiple conflicting objectives. Thus, a fuzzy goal-programming model can be effectively applied to this decision problem. The paper addresses application of a fuzzy goal-programming concept to model the problem of machine-tool selection and operation allocation with explicit considerations given to objectives of minimizing the total cost of machining operation, material handling and set-up. The constraints pertaining to the capacity of machines, tool magazine and tool life are included in the model. A genetic algorithm (GA)-based approach is adopted to optimize this fuzzy goal-programming model. An illustrative example is provided and some results of computational experiments are reported.

A Convex Optimization Framework for Almost Budget Balanced Allocation of a Divisible Good

We address the problem of allocating a single divisible good to a number of agents. The agents have concave valuation functions parameterized by a scalar type. The agents report only the type. The goal is to find allocatively efficient, strategy proof, nearly budget balanced mechanisms within the Groves class. Near budget balance is attained by returning as much of the received payments as rebates to agents. Two performance criteria are of interest: the maximum ratio of budget surplus to efficient surplus, and the expected budget surplus, within the class of linear rebate functions. The goal is to minimize them. Assuming that the valuation functions are known, we show that both problems reduce to convex optimization problems, where the convex constraint sets are characterized by a continuum of half-plane constraints parameterized by the vector of reported types. We then propose a randomized relaxation of these problems by sampling constraints. The relaxed problem is a linear programming problem (LP). We then identify the number of samples needed for ``near-feasibility'' of the relaxed constraint set. Under some conditions on the valuation function, we show that value of the approximate LP is close to the optimal value. Simulation results show significant improvements of our proposed method over the Vickrey-Clarke-Groves (VCG) mechanism without rebates. In the special case of indivisible goods, the mechanisms in this paper fall back to those proposed by Moulin, by Guo and Conitzer, and by Gujar and Narahari, without any need for randomization. Extension of the proposed mechanisms to situations when the valuation functions are not known to the central planner are also discussed. Note to Practitioners-Our results will be useful in all resource allocation problems that involve gathering of information privately held by strategic users, where the utilities are any concave function of the allocations, and where the resource planner is not interested in maximizing revenue, but in efficient sharing of the resource. Such situations arise quite often in fair sharing of internet resources, fair sharing of funds across departments within the same parent organization, auctioning of public goods, etc. We study methods to achieve near budget balance by first collecting payments according to the celebrated VCG mechanism, and then returning as much of the collected money as rebates. Our focus on linear rebate functions allows for easy implementation. The resulting convex optimization problem is solved via relaxation to a randomized linear programming problem, for which several efficient solvers exist. This relaxation is enabled by constraint sampling. Keeping practitioners in mind, we identify the number of samples that assures a desired level of ``near-feasibility'' with the desired confidence level. Our methodology will occasionally require subsidy from outside the system. We however demonstrate via simulation that, if the mechanism is repeated several times over independent instances, then past surplus can support the subsidy requirements. We also extend our results to situations where the strategic users' utility functions are not known to the allocating entity, a common situation in the context of internet users and other problems.