Computer-based estimation system for land productivity

International Science and Education Researcher Association (ISER); Gireida Education Co. Ltd; Wuhan University of Science and Technology; VIP Information Conference Center<span class="MedBlackText">Land productivity generally refers to the overall productivity related to various combinations of the natural characteristics of the land and socioeconomic factors. Structural change and pattern succession in land systems undoubtedly leads to changes in the suitability and quality of different kinds of land types and directly influences agricultural productivity. In this paper we describe the processes, parameters needed and methods of data preparation, which will improve the ability of readers to use this model and provide a foundation for its wide application.</span

Quantum Levy flights and multifractality of dipolar excitations in a random system

We consider dipolar excitations propagating via dipole-induced exchange among immobile molecules randomly spaced in a lattice. The character of the propagation is determined by long-range hops (Levy flights). We analyze the eigen-energy spectra and the multifractal structure of the wavefunctions. In 1D and 2D all states are localized, although in 2D the localization length can be extremely large leading to an effective localization-delocalization crossover in realistic systems. In 3D all eigenstates are extended but not always ergodic, and we identify the energy intervals of ergodic and non-ergodic states. The reduction of the lattice filling induces an ergodic to non-ergodic transition, and the excitations are mostly non-ergodic at low filling.Comment: 5 pages, 6 figure

De Novo Genome Sequence of "Candidatus Liberibacter solanacearum" from a Single Potato Psyllid in California.

The draft genome sequence of "Candidatus Liberibacter solanacearum" strain RSTM from a potato psyllid (Bactericera cockerelli) in California is reported here. The RSTM strain has a genome size of 1,286,787 bp, a G+C content of 35.1%, 1,211 predicted open reading frames (ORFs), and 43 RNA genes

The Least-core and Nucleolus of Path Cooperative Games

Cooperative games provide an appropriate framework for fair and stable profit distribution in multiagent systems. In this paper, we study the algorithmic issues on path cooperative games that arise from the situations where some commodity flows through a network. In these games, a coalition of edges or vertices is successful if it enables a path from the source to the sink in the network, and lose otherwise. Based on dual theory of linear programming and the relationship with flow games, we provide the characterizations on the CS-core, least-core and nucleolus of path cooperative games. Furthermore, we show that the least-core and nucleolus are polynomially solvable for path cooperative games defined on both directed and undirected network