Surprising absence of association between flower surface microstructure and pollination system

The epidermal cells of flowers come in different shapes and have different functions, but how they evolved remains largely unknown. Floral micro-texture can provide tactile cues to insects, and increases in surface roughness by means of conical (papillose) epidermal cells may facilitate flower handling by landing insect pollinators. Whether flower microstructure correlates with pollination system remains unknown. Here, we investigate the floral epidermal microstructure in 29 (congeneric) species pairs with contrasting pollination system. We test whether flowers pollinated by bees and/or flies feature more structured, rougher surfaces than flowers pollinated by non-landing moths or birds and flowers that self-pollinate. In contrast with earlier studies, we find no correlation between epidermal microstructure and pollination system. The shape, cell height and roughness of floral epidermal cells varies among species, but is not correlated with pollinators at large. Intriguingly, however, we find that the upper (adaxial) flower surface that surrounds the reproductive organs and often constitutes the floral display is markedly more structured than the lower (abaxial) surface. We thus conclude that conical epidermal cells probably play a role in plant reproduction other than providing grip or tactile cues, such as increasing hydrophobicity or enhancing the visual signal

Polynomial cases of the tarification problem

We consider the problem of determining a set of optimal tariffs for an agent in a network, who owns a subset of the arcs of the network, and who wishes to maximize his revenues on this subset from a set of clients that make use of the network.The general variant of this problem is NP-hard, already with a single client. This paper introduces several new polynomially solvable special cases. An important case is the following.For multiple clients, if the number of tariff arcs is bounded from above, we can solve the problem by a polynomial number of linear programs (each of which is of polynomial size). Furthermore, we show that the parametric tarification problem and the single arc fixed charge tarification problem can be solved in polynomial time.Economics ;

Pricing Network Edges to Cross a River.

We consider a Stackelberg pricing problem in directed networks:Tariffs (prices) have to be defined by an operator, the leader, for a subset of the arcs. Clients, the followers, choose paths to route their demand through the network selfishly and independently of each other, on the basis of minimal total cost. The problem is to find tariffs such as to maximize the operator''s revenue. We consider the case where each client takes at most one tariff arc to route the demand.The problem, which we refer to as the river tarification problem, is a special case of problems studied previously in the literature.We prove that the problem is strongly NP-hard.Moreover, we show that the polynomially solvable case of uniform tarification yields an m--approximation algorithm, and this is tight. We suggest a new type of analysis that allows to improve the result to \bigO{\log m}, whenever the input data is polynomially bounded. We furthermore derive an \bigO{m^{1-\varepsilon}}--inapproximability result for problems where the operator must serve all clients, and we discuss some polynomial special cases. Finally, a computational study with instances from France Telecom suggests that uniform pricing performs better in practice than theory would suggest.operations research and management science;

Pricing bridges to cross a river.

We consider a Stackelberg pricing problem in directed, uncapacitated networks. Tariffs have to be defined by an operator, the leader, for a subset of m arcs, the tariff arcs. Costs of all other arcs are assumed to be given. There are n clients, the followers, that route their demand independent of each other on paths with minimal total cost. The problem is to find tariffs that maximize the operator's revenue. Motivated by problems in telecommunication networks, we consider a restricted version of this problem, assuming that each client utilizes at most one of the operator's tariff arcs. The problem is equivalent to pricing bridges that clients can use in order to cross a river. We prove that this problem is APX-hard. Moreover, we show that uniform pricing yields both an m–approximation, and a (1 + lnD)–approximation. Here, D is upper bounded by the total demand of all clients. We furthermore discuss some polynomially solvable special cases, and present a short computational study with instances from France Télécom. In addition, we consider the problem under the additional restriction that the operator must serve all clients. We prove that this problem does not admit approximation algorithms with any reasonable performance guarantee, unless NP = ZPP, and we prove the existence of an n–approximation algorithm.Pricing; Networks; Tariffs; Costs; Cost; Demand; Problems; Order; Yield; Studies; Approximation; Algorithms; Performance;

Physics performances for Scalar Electrons, Scalar Muons and Scalar Neutrinos searches at CLIC

The determination of scalar leptons and gauginos masses is an important part of the program of spectroscopic studies of Supersymmetry at a high energy linear collider. In this talk we present results of a study of pair produced Scalar Electrons, Scalar Muons and Scalar Neutrinos searches in a Supersymmetric scenario at 3 TeV at CLIC. We present the performances on the lepton energy resolution and report the expected accuracies on the production cross sections and on the scalar leptons and gauginos masses.Comment: Linera Collider Workshop, LCWS11, 6 pages, 2 figures, 4 table