Global analysis of AAC for determining polarized parton distribution functions

We report global analysis results for polarized parton distribution functions in the nucleon. The optimum distributions are determined by using spin asymmetry data on polarized lepton scattering on proton, neutron, and deuteron. Their uncertainties are estimated by the Hessian method. As a result, polarized quark distributions are relatively well determined, whereas the polarized gluon distribution has a large uncertainty band. We find that the obtained gluon distribution is compatible with recent \Delta g/g measurements in high-p_T hadron productions.Comment: 3 pages, 2 figures, to be published in the proceedings of the XVIIth Particles and Nuclei International Conference (PANIC), Santa Fe, New Mexico, USA, October 24-28, 200

Interspecific differences in the larval performance of Pieris butterflies (Lepidoptera: Pieridae) are associated with differences in the glucosinolate profiles of host plants

The tremendous diversity of plants and herbivores has arisen from a coevolutionary relationship characterized by plant defense and herbivore counter adaptation. Pierid butterfly species feed on Brassicales plants that produce glucosinolates as a chemical deterrent against herbivory. In turn, the larvae of pierids have nitrile specifier proteins (NSPs) that are expressed in their gut and disarm glucosinolates. Pierid butterflies are known to have diversified in response to glucosinolate diversification in Brassicales. Therefore, each pierid species is expected to have a spectrum of host plants characterized by specific glucosinolate profiles. In this study, we tested whether the larval performance of different Pieris species, a genus in Pieridae (Lepidoptera: Pieridae), was associated with plant defense traits of putative host plants. We conducted feeding assays using larvae of three Pieris species and 10 species of the Brassicaceae family possessing different leaf physical traits and glucosinolate profile measurements. The larvae of Pieris rapae responded differently in the feeding assays compared with the other two Pieris species. This difference was associated with differences in glucosinolate profiles but not with variations in physical traits of the host plants. This result suggests that individual Pieris species are adapted to a subset of glucosinolate profiles within the Brassicaceae. Our results support the idea that the host ranges of Pieris species depend on larval responses to glucosinolate diversification in the host species, supporting the hypothesis of coevolution between butterflies and host plants mediated by the chemical arms race

A Semantic Framework for the Security Analysis of Ethereum smart contracts

Smart contracts are programs running on cryptocurrency (e.g., Ethereum) blockchains, whose popularity stem from the possibility to perform financial transactions, such as payments and auctions, in a distributed environment without need for any trusted third party. Given their financial nature, bugs or vulnerabilities in these programs may lead to catastrophic consequences, as witnessed by recent attacks. Unfortunately, programming smart contracts is a delicate task that requires strong expertise: Ethereum smart contracts are written in Solidity, a dedicated language resembling JavaScript, and shipped over the blockchain in the EVM bytecode format. In order to rigorously verify the security of smart contracts, it is of paramount importance to formalize their semantics as well as the security properties of interest, in particular at the level of the bytecode being executed. In this paper, we present the first complete small-step semantics of EVM bytecode, which we formalize in the F* proof assistant, obtaining executable code that we successfully validate against the official Ethereum test suite. Furthermore, we formally define for the first time a number of central security properties for smart contracts, such as call integrity, atomicity, and independence from miner controlled parameters. This formalization relies on a combination of hyper- and safety properties. Along this work, we identified various mistakes and imprecisions in existing semantics and verification tools for Ethereum smart contracts, thereby demonstrating once more the importance of rigorous semantic foundations for the design of security verification techniques.Comment: The EAPLS Best Paper Award at ETAP

On fractionality of the path packing problem

In this paper, we study fractional multiflows in undirected graphs. A fractional multiflow in a graph G with a node subset T, called terminals, is a collection of weighted paths with ends in T such that the total weights of paths traversing each edge does not exceed 1. Well-known fractional path packing problem consists of maximizing the total weight of paths with ends in a subset S of TxT over all fractional multiflows. Together, G,T and S form a network. A network is an Eulerian network if all nodes in N\T have even degrees. A term "fractionality" was defined for the fractional path packing problem by A. Karzanov as the smallest natural number D so that there exists a solution to the problem that becomes integer-valued when multiplied by D. A. Karzanov has defined the class of Eulerian networks in terms of T and S, outside which D is infinite and proved that whithin this class D can be 1,2 or 4. He conjectured that D should be 1 or 2 for this class of networks. In this paper we prove this conjecture.Comment: 18 pages, 5 figures in .eps format, 2 latex files, main file is kc13.tex Resubmission due to incorrectly specified CS type of the article; no changes to the context have been mad

Designing Secure Ethereum Smart Contracts: A Finite State Machine Based Approach

The adoption of blockchain-based distributed computation platforms is growing fast. Some of these platforms, such as Ethereum, provide support for implementing smart contracts, which are envisioned to have novel applications in a broad range of areas, including finance and Internet-of-Things. However, a significant number of smart contracts deployed in practice suffer from security vulnerabilities, which enable malicious users to steal assets from a contract or to cause damage. Vulnerabilities present a serious issue since contracts may handle financial assets of considerable value, and contract bugs are non-fixable by design. To help developers create more secure smart contracts, we introduce FSolidM, a framework rooted in rigorous semantics for designing con- tracts as Finite State Machines (FSM). We present a tool for creating FSM on an easy-to-use graphical interface and for automatically generating Ethereum contracts. Further, we introduce a set of design patterns, which we implement as plugins that developers can easily add to their contracts to enhance security and functionality

Determination of polarized parton distribution functions with recent data on polarization asymmetries

Global analysis has been performed within the next-to-leading order in Quantum Chromodynamics (QCD) to determine polarized parton distributions with new experimental data in spin asymmetries. The new data set includes JLab, HERMES, and COMPASS measurements on spin asymmetry A_1 for the neutron and deuteron in lepton scattering. Our new analysis also utilizes the double-spin asymmetry for pi^0 production in polarized pp collisions, A_{LL}^{pi^0}, measured by the PHENIX collaboration. Because of these new data, uncertainties of the polarized PDFs are reduced. In particular, the JLab, HERMES, and COMPASS measurements are valuable for determining Delta d_v(x) at large x and Delta qbar(x) at x~0.1. The PHENIX pi^0 data significantly reduce the uncertainty of Delta g(x). Furthermore, we discuss a possible constraint on Delta g(x) at large x by using the HERMES data on g_1^d in comparison with the COMPASS ones at x~0.05.Comment: 11 pages, REVTeX, 13 eps files, Phys. Rev. D in pres

Discrete Convex Functions on Graphs and Their Algorithmic Applications

The present article is an exposition of a theory of discrete convex functions on certain graph structures, developed by the author in recent years. This theory is a spin-off of discrete convex analysis by Murota, and is motivated by combinatorial dualities in multiflow problems and the complexity classification of facility location problems on graphs. We outline the theory and algorithmic applications in combinatorial optimization problems