森林生态系统健康评估Ⅱ.案例实践

结合样地调查和他人对阔叶红松林生态系统相关指标的研究资料数据,利用健康距离(HD)评估法和上文建立的阔叶红松林生态系统健康评估指标体系框架,对不同人为干扰影响的长白山阔叶红松林生态系统进行系统健康的评估实践.结果按顺序依次为20%强度择伐林021<50%强度择伐林044<白桦中成林067<白桦中幼林072<红松人工林074<人工落叶松林077.

内蒙古陈巴尔虎旗饮茶型氟铝联合中毒调查

目的查明内蒙古陈巴尔虎旗饮茶型氟、铝联合中毒原因。方法在陈巴尔虎旗3个牧区嘎查随机抽取93名20~50岁牧民进行发、血清、尿含氟、铝水平测定,并拍摄前臂、小腿、骨盆正位及腰椎正侧位X线片,同时检测饮水、牛奶、砖茶等氟和铝水平,以扎兰屯市地方病防治研究所的34名23~50岁职工为对照组。结果陈巴尔虎旗牧民发、血清、尿及饮用的奶茶含铝量分别是(22.34±8.06)mg/kg、(1.13±0.48)mg/L、(3.78±1.62)mg/L、(6.02±1.77)mg/L,含氟量分别是(1.21±0.63)mg/kg、(0.092±0.042)mg/L、(2.08±1.16)mg/L、(3.00±1.11)mg/L,饮水、牛奶含铝量分别是(39±16)μg/L、(0.553±0.179)mg/L,含氟量分别是(0.50±0.39)、(0.063±0.032)mg/L;对照组发、血清、尿铝分别是(5.80±2.14)mg/kg,(0.203±0.101)mg/L、(2.19±1.34)mg/L,含氟量分别是(1.17±0.68)mg/kg、(0.033±0.008)mg/L、(0.57±0.32)mg/L,牧民发、血清、尿铝及血清、尿氟均高于对照组(P<0.001)。牧民X线改变硬化型22.2%(20/88),疏松型37.5%(33/88),退行性变86.4%(79/88),对照组退行性变13.3%(4/30),其余改变未检出。结论陈巴尔虎旗牧区饮茶型氟中毒实际为饮茶型氟、铝联合中毒。

Multi-armed poly(L-glutamic acid)-graft-oligoethylenimine copolymers as efficient nonviral gene delivery vectors

Background The application of polyethylenimine (PEI) in gene delivery has been severely limited by significant cytotoxicity that results from a nondegradable methylene backbone and high cationic charge density. It is therefore necessary to develop novel biodegradable PEI derivates for low-toxic, highly efficient gene delivery.Methods A series of novel cationic copolymers with various charge density were designed and synthesized by grafting different kinds of oligoethylenimine (OEI) onto a determinate multi-armed poly(L-glutamic acid) backbone. The molecular structures of multi-armed poly(L-glutamic acid)-graft-OEI (MP-g-OEI) copolymers were characterized using nuclear magnetic resonance, viscosimetry and gel permeation chromatography. Moreover, the MP-g-OEI/DNA complexes were measured by a gel retardation assay, dynamic light scattering and atomic force microscopy to determine DNA binding ability, particle size, zeta potential, complex formation and shape, respectively. MP-g-OEI copolymers were also evaluated in Chinese hamster ovary and human embryonic kidney-293 cells for their cytotoxicity and transfection efficiency.

A new dinuclear molybdenum(V)-sulfur complex containing citrate ligand: synthesis and characterization of K2.5Na2NH4[Mo2O2S2(cit)(2)].5H(2)O

The complex, K2.5Na2NH4[Mo2O2S2(cit)(2)]. 5H(2)O (1), was obtained by crystallization from a solution of (NH4)(2)MoS4, potassium citrate (K(3)cit) and hydroxyl sodium in methanol and water under an atmosphere of pure nitrogen at ambient temperature. The crystals are triclinic, space group , a = 7.376 (3)Angstrom, b = 14.620 (2) Angstrom, c = 14.661 (1) Angstrom, alpha = 71.10 (1)degrees, beta = 81.77 (1)degrees, gamma = 78.27(2)degrees, R = 0.0584 for 2545 observed (I > 2 sigma (I)) reflections. Single crystal structure analysis reveals that citrate ligand coordinated to molybdenum atom through two carboxylato oxygens and one deprotonated hydroxyl oxygen together with two bridging sulfur atoms and a terminal oxygen atom completes distorted coordination octahedron around each molybdenum atom. Principal dimensions are: Mo = O-t, 1.707 Angstrom (av); Mo-S-b, 2.341 Angstrom (av); Mo-O-(hydroxyl), 2.021 Angstrom (av); Mo-O(alpha-carboxyl), 2.1290 Angstrom (av) and Mo-O(beta-carboxyl), 2.268(av) Angstrom. IR spectrum is in agreement with the structure.

Determination of sulfadiazine and sulfamethoxazole by capillary electrophoresis with end-column electrochemical detection

Capillary electrophoresis (CE) with end-column electrochemical detection (EC) of sulfadiazine (SDZ) and sulfamethoxazole (SMZ) is described. Under the optimum conditions, SDZ and SMZ were separated satisfactorily, and a highly sensitive and stable response was obtained at a potential of 1.1 V versus Ag/AgCl. Optimized end-column detection provides detection limits as low as 0.1 mu M for both compounds, which corresponds to 0.024 and 0.021 fmol with peak efficiencies of 394000 and 335000 theoretical plates for SDZ arid SMZ, respectively. The calibration graph was linear over three orders of magnitude. The relative standard deviations (n = 12) of peak currents and migration times were 2.3 and 2.7%, and 0.8 and 1.3%, respectively, for the two compounds. The proposed method was applied to the analysis of tablets and human urine samples with satisfactory results.

扇贝丝氨酸蛋白酶抑制剂基因CfKZSPI及Aikunitz的克隆与重组表达

扇贝养殖是我国重要的海水养殖产业，然而自1997 年以来，养殖扇贝陆续爆发的大规模死亡，不但造成了巨大的经济损失，而且严重影响了该产业的健康发展。丝氨酸蛋白酶抑制因子及丝氨酸蛋白酶在无脊椎动物的免疫应答中起着核心作用，它们的协同作用直接导致外界病源入侵的信号转导和级联放大，并进一步激活一系列防御体系，如黑化反应、血液凝结和抗菌肽的合成等。因此，克隆扇贝参与免疫防御的丝氨酸蛋白酶抑制剂基因并对其功能进行研究，将有助于进一步研究扇贝的免疫防御机制，丰富和发展无脊椎动物免疫学的内容。 运用大规模EST技术和RACE技术从栉孔扇贝中克隆出一个Kazal型丝氨酸蛋白酶抑制剂基因，定名为CfKZSPI。该基因cDNA序列全长1788bp，其中5' 非编码区（Untranslated Region, UTR）为97 bp，3' UTR161 bp，有一个典型的多聚腺苷酸信号序列（AATAAA）和一个ploy A 尾巴，开放阅读框（Open Reading Frame, ORF）含有1530 bp，编码509 个氨基酸残基。对其推测氨基酸序列进行分析，发现其中包括22个氨基酸残基组成的信号肽序列和12个Kazal型丝氨酸蛋白酶抑制剂结构域。采用QRT-PCR（quantitative real time PCR）对鳗弧菌浸泡刺激后栉孔扇贝血淋巴中CfKZSPI 的 mRNA表达量进行了检测，发现其mRNA 的表达量在鳗弧菌刺激后3h明显上升，达到空白组的43.6倍；然后在6h时有所下降，为空白组的15.0倍；随着菌刺激时间的增长，CfKZSPI基因的 mRNA 表达量急剧增加，在刺激后8h，12h，24h分别达到空白组的174.1，207.8，675.4倍。统计分析发现3h（P=0.019<0.05）和12h（P=0.020<0.05）时，CfKZSPI基因mRNA表达量与空白组差异均显著。为了研究栉孔扇贝CfKZSPI的蛋白活性，将其第十二个结构域克隆到pET-32a（+）载体中，转化大肠杆菌Rosetta-gami（DE3）表达菌株，获得可溶性表达的蛋白rCfKZSPI-12，对其进行抑制蛋白酶活性的分析，发现其对胰蛋白酶有很强的抑制活性，而对凝血酶没有抑制活性。当rCfKZSPI-12与胰蛋白酶分子比率为1：1时，约90%的蛋白酶活性被抑制。运用狄更斯作图法研究rCfKZSPI-12对胰蛋白酶的抑制能力，结果发现其对胰蛋白酶的抑制常数为173 nmol L-1。 采用同样方法从海湾扇贝cDNA文库中克隆出一个Kunitz型丝氨酸蛋白酶抑制剂基因，定名为Aikunitz。该基因全长632 bp，其中5' UTR 为105 bp，3' UTR 为 245 bp，有一个典型的多聚腺苷酸信号序列（AATAAA）和一个ploy A 尾巴，ORF 含有282 bp，编码93 个氨基酸残基。推测的氨基酸序列N末端有一个20个氨基酸残基组成的信号肽序列，成熟蛋白包括一个Kunitz型丝氨酸蛋白酶抑制剂结构域。采用QRT-PCR对鳗弧菌和藤黄微球菌感染后海湾扇贝血淋巴中Aikunitz 的mRNA的表达量进行了检测，结果发现其在鳗弧菌刺激后3h到9h持续上升，9h时表达量为PBS对照组的4.49倍（P=0.008<0.05），然后开始下降，在72h时表达量为对照组的0.24倍（P=0.021<0.05）；而在藤黄微球菌刺激后3h到12h其表达量上升，其中6h时为空白组的5.95倍（P=0.0004<0.01）；12h以后迅速下降，其中24h的表达量为对照组的0.38倍（P=0.028<0.05）。将Aikunitz基因编码的成熟蛋白按照重组CfKZSPI-12的方法进行重组表达，并对重组蛋白进行抑制蛋白酶和抑菌活性分析。结果发现其对胰蛋白酶和弹性蛋白酶两种丝氨酸蛋白酶都没有抑制作用。抑菌实验同样发现，重组Aikunitz 对供试的革兰氏阳性菌藤黄微球菌和革兰氏阴性菌鳗弧菌和大肠杆菌都不显示明显抑菌活性。

Learning Object-Independent Modes of Variation with Feature Flow Fields

We present a unifying framework in which "object-independent" modes of variation are learned from continuous-time data such as video sequences. These modes of variation can be used as "generators" to produce a manifold of images of a new object from a single example of that object. We develop the framework in the context of a well-known example: analyzing the modes of spatial deformations of a scene under camera movement. Our method learns a close approximation to the standard affine deformations that are expected from the geometry of the situation, and does so in a completely unsupervised (i.e. ignorant of the geometry of the situation) fashion. We stress that it is learning a "parameterization", not just the parameter values, of the data. We then demonstrate how we have used the same framework to derive a novel data-driven model of joint color change in images due to common lighting variations. The model is superior to previous models of color change in describing non-linear color changes due to lighting.

Welsh Reflections: Y Drych and America 1851-2001

Jones, A. and Jones, W. (2001). Welsh Reflections: Y Drych and America 1851-2001. Llandysul: Gomer Press. RAE2008

Structural Analysis of Network Traffic Flows

Network traffic arises from the superposition of Origin-Destination (OD) flows. Hence, a thorough understanding of OD flows is essential for modeling network traffic, and for addressing a wide variety of problems including traffic engineering, traffic matrix estimation, capacity planning, forecasting and anomaly detection. However, to date, OD flows have not been closely studied, and there is very little known about their properties. We present the first analysis of complete sets of OD flow timeseries, taken from two different backbone networks (Abilene and Sprint-Europe). Using Principal Component Analysis (PCA), we find that the set of OD flows has small intrinsic dimension. In fact, even in a network with over a hundred OD flows, these flows can be accurately modeled in time using a small number (10 or less) of independent components or dimensions. We also show how to use PCA to systematically decompose the structure of OD flow timeseries into three main constituents: common periodic trends, short-lived bursts, and noise. We provide insight into how the various constituents contribute to the overall structure of OD flows and explore the extent to which this decomposition varies over time.

Safe Compositional Specification of Networking Systems

The Science of Network Service Composition has clearly emerged as one of the grand themes driving many of our research questions in the networking field today [NeXtworking 2003]. This driving force stems from the rise of sophisticated applications and new networking paradigms. By "service composition" we mean that the performance and correctness properties local to the various constituent components of a service can be readily composed into global (end-to-end) properties without re-analyzing any of the constituent components in isolation, or as part of the whole composite service. The set of laws that would govern such composition is what will constitute that new science of composition. The combined heterogeneity and dynamic open nature of network systems makes composition quite challenging, and thus programming network services has been largely inaccessible to the average user. We identify (and outline) a research agenda in which we aim to develop a specification language that is expressive enough to describe different components of a network service, and that will include type hierarchies inspired by type systems in general programming languages that enable the safe composition of software components. We envision this new science of composition to be built upon several theories (e.g., control theory, game theory, network calculus, percolation theory, economics, queuing theory). In essence, different theories may provide different languages by which certain properties of system components can be expressed and composed into larger systems. We then seek to lift these lower-level specifications to a higher level by abstracting away details that are irrelevant for safe composition at the higher level, thus making theories scalable and useful to the average user. In this paper we focus on services built upon an overlay management architecture, and we use control theory and QoS theory as example theories from which we lift up compositional specifications.

A Linearization of the Lambda-Calculus and Consequences

If every lambda-abstraction in a lambda-term M binds at most one variable occurrence, then M is said to be "linear". Many questions about linear lambda-terms are relatively easy to answer, e.g. they all are beta-strongly normalizing and all are simply-typable. We extend the syntax of the standard lambda-calculus L to a non-standard lambda-calculus L^ satisfying a linearity condition generalizing the notion in the standard case. Specifically, in L^ a subterm Q of a term M can be applied to several subterms R1,...,Rk in parallel, which we write as (Q. R1 \wedge ... \wedge Rk). The appropriate notion of beta-reduction beta^ for the calculus L^ is such that, if Q is the lambda-abstraction (\lambda x.P) with m\geq 0 bound occurrences of x, the reduction can be carried out provided k = max(m,1). Every M in L^ is thus beta^-SN. We relate standard beta-reduction and non-standard beta^-reduction in several different ways, and draw several consequences, e.g. a new simple proof for the fact that a standard term M is beta-SN iff M can be assigned a so-called "intersection" type ("top" type disallowed).

3D Hand Pose Estimation by Finding Appearance-Based Matches in a Large Database of Training Views

Ongoing work towards appearance-based 3D hand pose estimation from a single image is presented. A large database of synthetic hand views is generated using a 3D hand model and computer graphics. The views display different hand shapes as seen from arbitrary viewpoints. Each synthetic view is automatically labeled with parameters describing its hand shape and viewing parameters. Given an input image, the system retrieves the most similar database views, and uses the shape and viewing parameters of those views as candidate estimates for the parameters of the input image. Preliminary results are presented, in which appearance-based similarity is defined in terms of the chamfer distance between edge images.

Sampling Biases in IP Topology Measurements

Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute studies have led some authors to conclude that the router graph of the Internet is a scale-free graph, or more generally a power-law random graph. In such a graph, the degree distribution of nodes follows a distribution with a power-law tail. In this paper we argue that the evidence to date for this conclusion is at best insufficient. We show that graphs appearing to have power-law degree distributions can arise surprisingly easily, when sampling graphs whose true degree distribution is not at all like a power-law. For example, given a classical Erdös-Rényi sparse, random graph, the subgraph formed by a collection of shortest paths from a small set of random sources to a larger set of random destinations can easily appear to show a degree distribution remarkably like a power-law. We explore the reasons for how this effect arises, and show that in such a setting, edges are sampled in a highly biased manner. This insight allows us to distinguish measurements taken from the Erdös-Rényi graphs from those taken from power-law random graphs. When we apply this distinction to a number of well-known datasets, we find that the evidence for sampling bias in these datasets is strong.

Extracting Location from Contact Traces

Localization is essential feature for many mobile wireless applications. Data collected from applications such as environmental monitoring, package tracking or position tracking has no meaning without knowing the location of this data. Other applications have location information as a building block for example, geographic routing protocols, data dissemination protocols and location-based services such as sensing coverage. Many of the techniques have the trade-off among many features such as deployment of special hardware, level of accuracy and computation power. In this paper, we present an algorithm that extracts location constraints from the connectivity information. Our solution, which does not require any special hardware and a small number of landmark nodes, uses two types of location constraints. The spatial constraints derive the estimated locations observing which nodes are within communication range of each other. The temporal constraints refine the areas, computed by the spatial constraints, using properties of time and space extracted from a contact trace. The intuition of the temporal constraints is to limit the possible locations that a node can be using its previous and future locations. To quantify this intuitive improvement in refine the nodes estimated areas adding temporal information, we performed simulations using synthetic and real contact traces. The results show this improvement and also the difficulties of using real traces.

Assessing the Security of a Clean-Slate Internet Architecture

The TCP/IP architecture was originally designed without taking security measures into consideration. Over the years, it has been subjected to many attacks, which has led to many patches to counter them. Our investigations into the fundamental principles of networking have shown that carefully following an abstract model of Interprocess Communication (IPC) addresses many problems [1]. Guided by this IPC principle, we designed a clean-slate Recursive INternet Architecture (RINA) [2]. In this paper, we show how, without the aid of cryptographic techniques, the bare-bones architecture of RINA can resist most of the security attacks faced by TCP/IP. We also show how hard it is for an intruder to compromise RINA. Then, we show how RINA inherently supports security policies in a more manageable, on-demand basis, in contrast to the rigid, piecemeal approach of TCP/IP.