Simulation and diagnosis of large-scale atmospheric moisture and surface hydrology over North America

We describe a preliminary investigation into large-scale atmospheric and surface moisture variations over North America. We compare large-scale hydrologic budgets in the Los Alamos general circulation model (GCM) to observed precipitation and vertically integrated atmospheric moisture fluxes derived from the National Meteorological Center's operational analyses. THe GCM faithfully simulates the integrated flux divergence and P-E differences. However, the integrated moisture content is too low, and precipitation and evaporation are too high. The model produces summertime soil moisture dryness, which supports previous studies showing increased droughts under warmer conditions.

Tree-Structured Stick Breaking Processes for Hierarchical Data

Many data are naturally modeled by an unobserved hierarchical structure. In this paper we propose a flexible nonparametric prior over unknown data hierarchies. The approach uses nested stick-breaking processes to allow for trees of unbounded width and depth, where data can live at any node and are infinitely exchangeable. One can view our model as providing infinite mixtures where the components have a dependency structure corresponding to an evolutionary diffusion down a tree. By using a stick-breaking approach, we can apply Markov chain Monte Carlo methods based on slice sampling to perform Bayesian inference and simulate from the posterior distribution on trees. We apply our method to hierarchical clustering of images and topic modeling of text data.

Novel architecture to facilitate disassembly and reuse of electronic components and sub-assemblies

This paper advances the proposition that in many electronic products, the partitioning scheme adopted and the interconnection system used to interconnect the sub-assemblies or components are intimately related to the economic benefits, and hence the attractiveness, of reuse of these items. An architecture has been developed in which the residual values of the connectors, components and sub-assemblies are maximized, and opportunities for take-back and reuse of redundant items are greatly enhanced. The system described also offers significant manufacturing cost benefits in terms of ease of assembly, compactness and robustness.

A closely integrated digital image capture device for embedded applications

A modular image capture system with close integration to CCD cameras has been developed. The aim is to produce a system capable of integrating CCD sensor, image capture and image processing into a single compact unit. This close integration provides a direct mapping between CCD pixels and digital image pixels. The system has been interfaced to a digital signal processor board for the development and control of image processing tasks. These have included characterization and enhancement of noisy images from an intensified camera and measurement to subpixel resolutions. A highly compact form of the image capture system is in an advanced stage of development. This consists of a single FPGA device and a single VRAM providing a two chip image capturing system capable of being integrated into a CCD camera. A miniature compact PC has been developed using a novel modular interconnection technique, providing a processing unit in a three dimensional format highly suited to integration into a CCD camera unit. Work is under way to interface the compact capture system to the PC using this interconnection technique, combining CCD sensor, image capture and image processing into a single compact unit. ©2005 Copyright SPIE - The International Society for Optical Engineering.

中国树鼩的寄生虫调查研究

树鼩是一种新开发的小型实验动物. 研究树鼩的寄生虫对保护树鼩群体, 保证准确的实验结果, 以及寻找人类疾病的动物模型等方面都有着重要的实用意义和理论意义. 关于缅甸、越南、婆罗洲、马来西亚、马来亚、印度、和印度尼西亚树鼩的体内外寄生虫研究, 国外学者已作过许多研究(Dunn, 1963, 1964; Van Peenen等, 1967;Durette-Desset等, 1975, 1981; File, 1974; Quentin等, 1975, 1977; Chabaud等, 1975;Ohbayashi等, 1983; Betteron等, 1977; Betterton, 1979, 1980; Myers, 1960; Orihel, 1966; Nandi, 1982; Manning等, 1972; Mallin等, 1972; Schmidt等, 1977; Houdemer, 1938; Heyneman 等, 1965; Jordan,1926; Durden 等, 1984)。

Decentralised minimal-time consensus

This study considers the discrete-time dynamics of a network of agents that exchange information according to the nearest-neighbour protocol under which all agents are guaranteed to reach consensus asymptotically. We present a fully decentralised algorithm that allows any agent to compute the consensus value of the whole network in finite time using only the minimal number of successive values of its own history. We show that this minimal number of steps is related to a Jordan block decomposition of the network dynamics and present an algorithm to obtain the minimal number of steps in question by checking a rank condition on a Hankel matrix of the local observations. Furthermore, we prove that the minimal number of steps is related to other algebraic and graph theoretical notions that can be directly computed from the Laplacian matrix of the graph and from the underlying graph topology. © 2011 IEEE.

Decentralised minimum-time consensus

We consider the discrete-time dynamics of a network of agents that exchange information according to a nearest-neighbour protocol under which all agents are guaranteed to reach consensus asymptotically. We present a fully decentralised algorithm that allows any agent to compute the final consensus value of the whole network in finite time using the minimum number of successive values of its own state history. We show that the minimum number of steps is related to a Jordan block decomposition of the network dynamics, and present an algorithm to compute the final consensus value in the minimum number of steps by checking a rank condition of a Hankel matrix of local observations. Furthermore, we prove that the minimum number of steps is related to graph theoretical notions that can be directly computed from the Laplacian matrix of the graph and from the minimum external equitable partition. © 2013 Elsevier Ltd. All rights reserved.

马口鱼类分类的重新整理

<正> 马口鱼类包括马口鱼属Opsariichthys Bleeker、(鱼巤)属Zacco Jordan et Evermann、须(鱼巤)属Candidia Jordan et Richardson和异(鱼巤)属Parazacco, gen.nov.等4个属,以性成熟个体臀鳍条特别延长和具有发达的追星为共同特征,组成鲤科鱼类中的一个自然类群。这个类群分布于黑龙江以南、红河以北的东亚地区,是我国溪河中的常见鱼类。1964年杨

Correlation Between Lattice Strain and Energy Gap Bowing of AlxGa1-xN Epitaxial Thin Films

The correlation between the energy band-gap of AlxGa1-xN epitaxial thin films and lattice strain was investigated using both High Resolution X-ray Diffraction (HRXRD) and Spectroscopic Ellipsometry (SE). The Al fraction, lattice relaxation, and elastic lattice strain were determined for all AlxGa1-xN epilayers, and the energy gap as well. Given the type of intermediate layer, a correlation trend was found between energy band-gap bowing parameter and lattice mismatch, the higher the lattice mismatch is, the smaller the bowing parameter (b) will be.

黄土高原子午岭林区6个典型群落优势种的热值和养分特征

能量流动、物质循环和信息传递共同构成了生态系统三大功能。能量是维持生态系统功能与过程的动力,Jordan(1971)认为能量比干物质更能反映出群落对自然资源(特别是太阳能)的利用情况。Long(1934)率先用热值来表示植物所含能量的多少,此后关于植物热值的研究工作逐渐展开。我国的植物热值研究始于20世纪80年代(杨福囤等,1983;祖元刚等,1986),主要集中在海南(林益明等,2000)、福建(林益明等,2004)、广东(任海等,1999)和浙江(郝朝运等,2006)等热带亚热带植物群落以及内蒙古羊草草原(鲍雅静等,2003),但有关黄土高原地区的植被热值研究尚未见报道。子午岭林区是黄土高原主要的天然次生林区,其植被主要是在弃耕地基础上逐渐恢复起来的(邹厚远等,2002)。由于自然因素与人为因素的影响,子午岭的植被在恢复时间上存在较大差异,形成了处于不同演替阶段的各种植被群落类型。本研究选取的6个代表性植被群落分别是沙棘(Hippophae rhamnoides)群落、山杨(Populus davidiana)群落、白桦(Betula platyphylla)群落、油松(Pinus tabulaeform...

Life history cycles of flatfish species in the Bohai Sea, China

This paper provides basic information on the general ecology and life history cycles of various flatfish species in the Bohai Sea, China. The species studied are Paralichthys olivaceus (Temminck & Schlegel), Cleisthenes herzensteini (Schmidt), Eopsetta grigorjewi (Herzenstein), Verasper variegatus (Temminck & Schlegel), Pleuronichthys cornutus (Temminck & Schlegel), Pseudopleuronectes yokohamae (Gunther), Pseudopleuronectes herzensteini (Jordan & Snyder), Kareius bicoloratus (Basilewsky), Zebrias zebra (Bloch), Cynoglossus semilaevis Gunther, Cynoglossus abbreviatus (Gray) and Cynoglossus joyneri Gunther. Information on reproduction, eggs and larval distribution, growth and adult abundance is presented. Based on the biology and ecology of these flatfish, artificial enhancement of the commercial species in the Bohai Sea is discussed.

Convergence Results for the EM Approach to Mixtures of Experts Architectures

The Expectation-Maximization (EM) algorithm is an iterative approach to maximum likelihood parameter estimation. Jordan and Jacobs (1993) recently proposed an EM algorithm for the mixture of experts architecture of Jacobs, Jordan, Nowlan and Hinton (1991) and the hierarchical mixture of experts architecture of Jordan and Jacobs (1992). They showed empirically that the EM algorithm for these architectures yields significantly faster convergence than gradient ascent. In the current paper we provide a theoretical analysis of this algorithm. We show that the algorithm can be regarded as a variable metric algorithm with its searching direction having a positive projection on the gradient of the log likelihood. We also analyze the convergence of the algorithm and provide an explicit expression for the convergence rate. In addition, we describe an acceleration technique that yields a significant speedup in simulation experiments.

Learning Fine Motion by Markov Mixtures of Experts

Compliant control is a standard method for performing fine manipulation tasks, like grasping and assembly, but it requires estimation of the state of contact between the robot arm and the objects involved. Here we present a method to learn a model of the movement from measured data. The method requires little or no prior knowledge and the resulting model explicitly estimates the state of contact. The current state of contact is viewed as the hidden state variable of a discrete HMM. The control dependent transition probabilities between states are modeled as parametrized functions of the measurement We show that their parameters can be estimated from measurements concurrently with the estimation of the parameters of the movement in each state of contact. The learning algorithm is a variant of the EM procedure. The E step is computed exactly; solving the M step exactly would require solving a set of coupled nonlinear algebraic equations in the parameters. Instead, gradient ascent is used to produce an increase in likelihood.

Mean Field Theory for Sigmoid Belief Networks

We develop a mean field theory for sigmoid belief networks based on ideas from statistical mechanics. Our mean field theory provides a tractable approximation to the true probability distribution in these networks; it also yields a lower bound on the likelihood of evidence. We demonstrate the utility of this framework on a benchmark problem in statistical pattern recognition -- the classification of handwritten digits.