Pseudobagrus fui Miao, a valid bagrid species from the Yangtze River drainage, South China (Teleostei: Bagridae)

Pseudobagrus fui Miao is a valid bagrid species that can be separated from all its congeners in having 27-33 anal-fin rays. Among the species of Pseudobagrus, it forms part of a group of approximately 20 species putatively characterized by having a smooth anterior margin of the pectoral-fin spine and short maxillary barbels not extending to the base of the pectoral-fin spine. Pseudobagrus fui, together with P. nitidus and P. vachelli, can be differentiated from all other fork-tailed species of this group by having no fewer than 20 branched anal-fin rays, the posterior end of the anal-fin base posterior to the vertical through the posterior end of the adipose-fin base, and anal-fin base longer than the adipose-fin base. It further differs from P. nitidus in having a gas bladder without beaded lateral and posterior margins, and from P. vachelli in having short maxillary barbels not extending to the base of the pectoral-fin spine. Pseudobagrus fui is currently known from the main stream of the upper Yangtze River and its tributaries, the Min River, Jialing River, Tuo River, Wu River and Chishui River in Sichuan Province, Guizhou Province, and the Chongqing City. The identity and nomenclature of Pseudobagrus nitidus is also discussed.

Extraordinarily thick-boned fish linked to the aridification of the Qaidam Basin (northern Tibetan Plateau)

Scattered with numerous salt lakes and approximate to 2,700-3,200 m above sea level, the giant Qaidam inland basin on the northern Tibetan Plateau has experienced continuing aridification since the beginning of the Late Cenozoic as a result of the India-Asia plate collision and associated uplift of the Tibetan Plateau. Previous evidence of aridification comes mainly from evaporite deposits and salinity-tolerant invertebrate fossils. Vertebrate fossils were rare until recent discoveries of abundant fish. Here, we report an unusual cyprinid fish, Hsianwenia wui, gen. et sp. nov., from Pliocene lake deposits of the Qaidam Basin, characterized by an extraordinarily thick skeleton that occupied almost the entire body. Such enormous skeletal thickening, apparently leaving little room for muscles, is unknown among extant fish. However, an almost identical condition occurs in the much smaller cyprinodontid Aphanius crassicaudus (Cyprinodonyiformes), collected from evaporites exposed along the northern margins of the Mediterranean Sea during the Messinian desiccation period. H. wui and A. crassicaudus both occur in similar deposits rich in carbonates (CaCO3) and sulfates (CaSO4), indicating that both were adapted to the extreme conditions resulting from the ariclification in the two areas. The overall skeletal thickening was most likely formed through deposition of the oversaturated calcium and was apparently a normal feature of the biology and growth of these fish.

Cathodoluminescence study on in composition inhomogeneity of thick InGaN layer

We have investigated the optical properties of thick InGaN film grown on GaN by cathodeluminescence (CL) spectroscopy. It is found that there is obvious In composition variation in both growth and lateral direction of InGaN film. The depth distribution of In composition is closely related to the strain relaxation process of InGaN film. Accompanied with the relaxation of compressive strain, the In composition of InGaN layer increases and the CL peak energy shifts towards red. Moreover, a rather apparent In composition fluctuation is found in the relaxed upper part of InGaN layer as confirmed by CL imaging.

Silicon waveguide modulator based on carrier depletion in periodically interleaved PN junctions

We present the design and numerical simulation results for a silicon waveguide modulator based on carrier depletion in a linear array of periodically interleaved PN junctions that are oriented perpendicular to the light propagation direction. In this geometry the overlap of the optical waveguide mode with the depletion region is much larger than in designs using a single PN junction aligned parallel to the waveguide propagation direction. Simulations predict that an optimized modulator will have a high modulation efficiency of 0.56 V.cm for a 3V bias, with a 3 dB frequency bandwidth of over 40 GHz. This device has a length of 1.86 mm with a maximum intrinsic loss of 4.3 dB at 0V bias, due to free carrier absorption. (C) 2009 Optical Society of America

Revised ab initio natural band offsets of all group IV, II-VI, and III-V semiconductors

Using an all-electron band structure approach, we have systematically calculated the natural band offsets between all group IV, III-V, and II-VI semiconductor compounds, taking into account the deformation potential of the core states. This revised approach removes assumptions regarding the reference level volume deformation and offers a more reliable prediction of the "natural" unstrained offsets. Comparison is made to experimental work, where a noticeable improvement is found compared to previous methodologies.

两个冠醚分子在简正坐标分析及NRCC程序在微机上的移植

本文用加拿大国立研究院(National Research Council of Canada) Fuhrer等人编制的FORTRAN语言程序（以下简称NRCC程序），对两个冠醚类化合物进行了简正坐标分析，这两个化合物分子是二氧六环(C_4H_8O_2)和12－冠－4(C_8H_(16)O_4)。作者用Synder和Zerbi提出的一般价力场，计算了二氧六环的36个简正振动频率，精化四次后的结果误差为14.04 cm~(-1)，得到了二氧六环的精化力场和势能分析矩阵；做了12－冠－4－的中红外光谱(3200-5000cm~(-1))。远红外光谱(500-70cm~(-1))和拉曼光谱(3200-50 cm~(-1)，从而归属出12－冠－4的78个简正振动频率实验值；利用二氧六环的精化力场作为初始力场，计算了12－冠－4的简正振动频率，对78个简正振动频率进行了精化计算，精化三次后的结果误差为13.99 cm~(-1)，精化后得到12－冠－4的精化力场和势能分布矩阵；将NRCC程序以BASIC语言移至TRS-80微型机上，对二氧六环进行了计算，结果良好，首次给出二氧六环一般价力场的势能分布。一、对二氧六环的处理 二氧六环分子式C_4H_8O_2，合14个原子，有3N－6＝36个简正振动频率。分子结构系由二个乙氧基(-CH_2-CH_2-O-)单元组成的含有四个碳，两个氧的六元环，平衡态分子为椅式构象，属于C_(2h)点群，36个简正振动频率分为四个对称类Ag、Au、Bg和Bu，分布是：Ag 10个，Bg 8个，Au 9个，Bu9个。二氧六环的分子结构及坐标示意图见28而图5，定义了14个伸缩内坐标，26个弯曲内坐标，6个扭曲内坐标，共46个，C－C键长1.54A，C-O键长1.41 A，C－H键长1.096A，键角都用109°28'。用CART程序（NRCC程序之一）计算二氧六环14个原子的笛卡尔坐标，用GMAT程序（NRCC程序之二）计算其B矩阵和G矩阵，用FPERT程序（NRCC程序之三）计算其简正振动频率、精化力场，计算用一般价力场，引入V矩阵对称化，将46个坐标化为46个（内）对称坐标，10个多余坐标在FPERT程序计算中除去。二、对12－冠－4的处理 12－冠－4分子式C_8H_(16)O_4，含28个原子，共3N－6＝78个简正振动频率，分子结构为四个乙氧基(-CH_2-CH_2-O-)单元组成的含八个碳、四个氧的12元环，自由分子的12－冠－4属于C点群。结构数据引自Groth的X光衍射分数和坐标，自己编制了BASIC语言程度将分数坐标化为笛卡尔坐标，用GMAT程序计算B矩阵和G矩阵，FPERT程序计算78个简正振动频率、精化力场、计算势能分布矩阵，引入U矩阵将92个内坐标化为92个对称坐标，14个多余坐标在FPERT程序中自动除去。三、结果 势能分布矩阵给出分子的振动归属，对这两个冠醚类分子的3N－6个简正振动频率，可以划分为五个振动区域。1．C－H伸缩振动区（3000－2800 cm~(-1)） 在该区中，二氧六环有八个值：2974、2966、2854和2867 cm~(-1)各两个，12－冠－4有16个值：2935、2923、2915和2907 cm~(-1)各两个，2860 cm~(-1)8个，高于2900 cm~(-1)者为反对称伸缩振动，低于2900 cm~(-1)者为对称伸缩振动。2．亚甲基弯曲振动之一(1500-1400 cm~(-1)) 该区的主要振动是亚甲基剪式振动(Scissor)，其它振动小于10％二氧六环在该区有四个频率：1443、1461、1451和1457 cm~(-1)，12－冠－4有八个频率：1466、1450、1450和1405 cm~(-1)各两个。3．亚甲基弯曲振动区二(1400-1200 cm~(-1))该区的主要振动模式为亚甲基的颤动(wag)、卷曲(twist)和摆动(rock)振动，其它振动小于13％。二氧六环在该区有八个频率：1334、1303、1396、1216、1367、1264、1377和1296 cm~(-1)，12－冠－4有十六个频率：1388、1363、……1229 cm~(-1)（其中1288、1307cm~(-1)非简并，其余皆两重简并）。4．环的骨架伸缩振动区(1200-600 cm~(-1))该区振动模式复杂，除环的骨架伸缩振动外，还有亚甲基的wag、twist、rock以及环的骨架弯曲振动，而且这些振动的势能分布值都不小。二氧六环在该区有十一个频率，从1127至610 cm~(-1)，12－冠－4有二十个频率，从1135至184 cm~(-1)且大都是二重简并的。5．低频区(600-50cm~(-1))这两个分子在低频区的势能分布略有差别。二氧六环在该区有五个频率：503、486、427、276和224 cm~(-1)，主要振动模式为骨架弯曲振动和扭曲振动，C－O、C－C的扭曲振动在三个最低频率中分布占10－30％。12－冠－4在该区有18个频率，除570和547cm~(-1)处，都是二重简并的，六个最低频率的振动模式完全属于C－O、C－C键的扭曲振动，其它振动小于10％，所以200 cm~(-1)以下可称为12－冠－4的扭曲振动区，在600－200cm~(-1)之间的12个频率主要是骨架的弯曲振动，也有一定量的亚甲基wag、twist、rock振动。12－冠－4的简正坐标分析尚未有人做过。二氧六环的计算结果与Snyder和Zerbi的分析相吻合，12－冠－4和二氧六环两分子势能分布的相对一致性证明了对12－冠－4的简正坐标分析基本是正确的。本文比较了二分子的力常数和振动频率，探讨了环的大小对振动光谱的影响。四、NRCC程序简介 NRCC程序由CART、GMAT和FPERT三个程序组成，即可联一起运用，亦可分开独立进行运算。该程序功能强，所占内存大，适于大、中型计算机使用。CART程序之名字取自Cartisian Co-or-dinates的前四个字母，功能系由分子结构参数（键长、键角）计算分子内各原子的笛卡尔坐标。GMAT程序之名字取自G matrix的前四个字母，功能系由分子内各原子的笛卡尔坐标，原子质量和内坐标定义计算分子内各原子的坐标交换矩阵B和Wilson振动动能矩阵G。FPERT程序之名字取自F Perturbation的前五个字母，功能系由分子振动功能矩阵G、势能常数即力常数矩阵F计算分子的简正振动频率和势能分布矩阵，再通过实验频率精化势能矩阵F。NRCC程序可对含30个原子、60个内坐标的分子进行简正坐标分析，扩充后容量增大一倍。该程序可选用一般价力场(General Valence Force Field, 简称GVFF)和UBS���场(Urey-Bradley-Shimanouchi Force Field)，简称UBSFF或UBFF)。可选用对称化U矩阵，可自行决定力场精化次数和阻尼常数以限制精化结果的收敛性。五、NRCC程序在TRS－80微型机上移植试尝（该部分曾在第三届长春夏季化学讨论会上宣读）针对NRCC程序占内存空间大、难以在微型机上实现的情况，作者将NRCC程序改编为BASIC语言，改变程序的原来结构，形成一组BASIC语言程序：CART／BAS、GMAT／BAS和VIFR／BAS，改编后的BASIC程序在TRS－80微型机调试通过，TRS－80机字长8位，New Dos系统内存32K。改写后的程序只保持了原程序的基本原理，在内存，语句上改动很大，以适于微型机使用。数据在程序中直接嵌入，利于修改替换，且BASIC语言简单易学，便于操作。CART／BAS程序可计算含30个原子以内的分子的笛卡尔坐标，GMAT／BAS程序可计算含20个原子、45个内坐标的分子的G矩阵，VIFR／BAS程序可计算含15个原子的分子的简正振动频率。利用这组程序，作者以二氧六环分子为例做了一些试尝运算，误差14.4 cm~(-1)，相对误差1.8%，结果较理想。

Investigation on the strain relaxation of InGaN layer and its effects on the InGaN structural and optical properties

The evolution of strain and structural properties of thick epitaxial InGaN layers grown on GaN with different thicknesses are investigated. It is found that, with increase in InGaN thickness, plastic relaxation via misfit dislocation generation becomes a more important strain relaxation mechanism. Accompanied with the relaxation of compressive strain, the In composition of InGaN layer increases and induces an apparent red-shift of the cathodoluminescence peak of the InGaN layer. On the other hand, the plastic relaxation process results in a high defect density, which degrades the structural and optical properties of InGaN layers. A transition layer region with both strain and In composition gradients is found to exist in the 450-nm-thick InGaN layer.

Double ionization of helium in collision with 20-500-keV/amu Cq+ and Oq+ (q=1-3) ions

Target ionization and projectile charge changing were investigated for 20-500 keV/u Cq+, Oq++He (q=1-3) collisions. Double- to single-ionization ratios R-21 of helium associated with no projectile charge change (direct ionization), single-electron capture, and single-electron loss were measured. The cross-section ratio R-21 depends strongly on the collision velocity v, the projectile charge state q, and the outgoing reaction channel. Meanwhile, a model extended from our previous work [J. X. Shao, X. M. Chen, and B. W. Ding, Phys. Rev. A 75, 012701 (2007)] is presented to interpret the above-mentioned dependences. Good agreement is found between the model and the experimental data.

A data-model fusion approach for upscaling gross ecosystem productivity to the landscape scale based on remote sensing and flux footprint modelling

Chinese Academy of Sciences ; National Science Foundation of China [41071059]; National Key Technology R&D Program of China [2008BAK50B06-02]; National Basic Research Program of China [2010CB950900, 2010CB950704]; Natural Sciences and Engineering Research Council of Canada

Temperature variation through 2000 years in China: An uncertainty analysis of reconstruction and regional difference

Chinese Academy of Sciences [KZCX2-YW-315, KZCX2-YW-Q1-01]; National Natural Science Foundation of China [40625002, 90502009, 200905006]; Office of Science (BER), U. S. Department of Energy ; EU/FP7 [212250]

The Specialized Mappings Architecture

A probabilistic, nonlinear supervised learning model is proposed: the Specialized Mappings Architecture (SMA). The SMA employs a set of several forward mapping functions that are estimated automatically from training data. Each specialized function maps certain domains of the input space (e.g., image features) onto the output space (e.g., articulated body parameters). The SMA can model ambiguous, one-to-many mappings that may yield multiple valid output hypotheses. Once learned, the mapping functions generate a set of output hypotheses for a given input via a statistical inference procedure. The SMA inference procedure incorporates an inverse mapping or feedback function in evaluating the likelihood of each of the hypothesis. Possible feedback functions include computer graphics rendering routines that can generate images for given hypotheses. The SMA employs a variant of the Expectation-Maximization algorithm for simultaneous learning of the specialized domains along with the mapping functions, and approximate strategies for inference. The framework is demonstrated in a computer vision system that can estimate the articulated pose parameters of a human’s body or hands, given silhouettes from a single image. The accuracy and stability of the SMA are also tested using synthetic images of human bodies and hands, where ground truth is known.

Systematic Verification of Safety Properties of Arbitrary Network Protocol Compositions Using CHAIN

Formal correctness of complex multi-party network protocols can be difficult to verify. While models of specific fixed compositions of agents can be checked against design constraints, protocols which lend themselves to arbitrarily many compositions of agents-such as the chaining of proxies or the peering of routers-are more difficult to verify because they represent potentially infinite state spaces and may exhibit emergent behaviors which may not materialize under particular fixed compositions. We address this challenge by developing an algebraic approach that enables us to reduce arbitrary compositions of network agents into a behaviorally-equivalent (with respect to some correctness property) compact, canonical representation, which is amenable to mechanical verification. Our approach consists of an algebra and a set of property-preserving rewrite rules for the Canonical Homomorphic Abstraction of Infinite Network protocol compositions (CHAIN). Using CHAIN, an expression over our algebra (i.e., a set of configurations of network protocol agents) can be reduced to another behaviorally-equivalent expression (i.e., a smaller set of configurations). Repeated applications of such rewrite rules produces a canonical expression which can be checked mechanically. We demonstrate our approach by characterizing deadlock-prone configurations of HTTP agents, as well as establishing useful properties of an overlay protocol for scheduling MPEG frames, and of a protocol for Web intra-cache consistency.

Learning Euclidean Embeddings for Indexing and Classification

BoostMap is a recently proposed method for efficient approximate nearest neighbor retrieval in arbitrary non-Euclidean spaces with computationally expensive and possibly non-metric distance measures. Database and query objects are embedded into a Euclidean space, in which similarities can be rapidly measured using a weighted Manhattan distance. The key idea is formulating embedding construction as a machine learning task, where AdaBoost is used to combine simple, 1D embeddings into a multidimensional embedding that preserves a large amount of the proximity structure of the original space. This paper demonstrates that, using the machine learning formulation of BoostMap, we can optimize embeddings for indexing and classification, in ways that are not possible with existing alternatives for constructive embeddings, and without additional costs in retrieval time. First, we show how to construct embeddings that are query-sensitive, in the sense that they yield a different distance measure for different queries, so as to improve nearest neighbor retrieval accuracy for each query. Second, we show how to optimize embeddings for nearest neighbor classification tasks, by tuning them to approximate a parameter space distance measure, instead of the original feature-based distance measure.

Safe Composition of Web Communication Protocols for Extensible Edge Services

As new multi-party edge services are deployed on the Internet, application-layer protocols with complex communication models and event dependencies are increasingly being specified and adopted. To ensure that such protocols (and compositions thereof with existing protocols) do not result in undesirable behaviors (e.g., livelocks) there needs to be a methodology for the automated checking of the "safety" of these protocols. In this paper, we present ingredients of such a methodology. Specifically, we show how SPIN, a tool from the formal systems verification community, can be used to quickly identify problematic behaviors of application-layer protocols with non-trivial communication models—such as HTTP with the addition of the "100 Continue" mechanism. As a case study, we examine several versions of the specification for the Continue mechanism; our experiments mechanically uncovered multi-version interoperability problems, including some which motivated revisions of HTTP/1.1 and some which persist even with the current version of the protocol. One such problem resembles a classic degradation-of-service attack, but can arise between well-meaning peers. We also discuss how the methods we employ can be used to make explicit the requirements for hardening a protocol's implementation against potentially malicious peers, and for verifying an implementation's interoperability with the full range of allowable peer behaviors.

Fast Approximate Reconciliation of Set Differences

We present new, simple, efficient data structures for approximate reconciliation of set differences, a useful standalone primitive for peer-to-peer networks and a natural subroutine in methods for exact reconciliation. In the approximate reconciliation problem, peers A and B respectively have subsets of elements SA and SB of a large universe U. Peer A wishes to send a short message M to peer B with the goal that B should use M to determine as many elements in the set SB–SA as possible. To avoid the expense of round trip communication times, we focus on the situation where a single message M is sent. We motivate the performance tradeoffs between message size, accuracy and computation time for this problem with a straightforward approach using Bloom filters. We then introduce approximation reconciliation trees, a more computationally efficient solution that combines techniques from Patricia tries, Merkle trees, and Bloom filters. We present an analysis of approximation reconciliation trees and provide experimental results comparing the various methods proposed for approximate reconciliation.