Molecular determination of oxytetracycline-resistant bacteria and their resistance genes from mariculture environments of China

Aims: To assess the diversity of antibiotic-resistant bacteria and their resistance genes in typical maricultural environments. Methods nand Results: Multidrug-resistant bacteria and resistance genes from a mariculture farm of China were analysed via cultivation and polymerase chain reaction (PCR) methods. Oxytetracycline (OTC)-resistant bacteria were abundant in both abalone and turbot rearing waters, accounting for 3.7% and 9.9% of the culturable microbes. Multidrug resistance was common, with simultaneous resistance to OTC, chloramphenicol and ampicillin the most common resistance phenotype. 16S rDNA sequence analyses indicate that the typical resistant isolates belonged to marine Vibrio, Pseudoalteromonas or Alteromonas species, with resistance most common in Vibrio splendidus isolates. For OTC resistance, tet(A), tet(B) and tet(M) genes were detected in some multidrug-resistant isolates, with tet(D) being the most common molecular determinant. For chloramphenicol resistance, cat II was common, and floR was also detected, especially in marine Pseudoalteromonas strains. Conclusions: There is the risk of multidrug-resistant bacteria contamination in mariculture environments and marine Vibrio and Pseudoalteromonas species serve as reservoirs of specific antibiotic resistance determinants. Significance and Impact of the Study: This paper and similar findings from Korea and Japan indicate the potential for widespread distribution of antibiotic resistance genes in mariculture environments from the East Asian region of the world.

Modern sedimentary environments and dynamic depositional systems in the southern Yellow Sea

Based on analyses of more than 600 surface sediment samples together with large amounts of previous sedimentologic and hydrologic data, the characteristics of modern sedimentary environments and dynamic depositional systems in the southern Yellow Sea (SYS) are expounded, and the controversial formation mechanism of muddy sediments is also discussed. The southern Yellow Sea shelf can be divided into low-energy sedimentary environment and high-energy sedimentary environment; the low-energy sedimentary environment can be further divided into cyclonic and anticyclonic ones, and the high-energy environment is subdivided into high-energy depositional and eroded environments. In the shelf low-energy environments, there developed muddy depositional system. In the central part of the southern Yellow Sea, there deposited the cold eddy sediments under the actions of a meso-scale cyclonic eddy (cold eddy), and in the southeast of the southern Yellow Sea, an anticyclonic eddy muddy depositional system (warm eddy sediment) was formed. These two types of sediments showed evident differences in grain size, sedimentation rate, sediment thickness and mineralogical characteristics. The high-energy environments were covered with sandy sediments on seabed; they appeared mainly in the west, south and northeast of the southern Yellow Sea. In the high-energy eroded environment, large amounts of sandstone gravels were distributed on seabed. In the high-energy depositional environment, the originally deposited fine materials (including clay and fine silt) were gradually re-suspended and then transported to a low-energy area to deposit again. In this paper, the sedimentation model of cyclonic and anticyclonic types of muddy sediments is established, and a systematic interpretation for the formation cause of muddy depositional systems in the southern Yellow Sea is given.

PCBs and its coupling with eco-environments in Southern Yellow Sea surface sediments

In this paper, the spatial distribution and source of the PCBs in surface sediments of the Southern Yellow Sea (SYS) and influencing factors, such as the sediment characteristics (components, relative proportions and total organic carbon contents), and hydrodynamic conditions were analyzed. PCB concentrations in the surface sediments ranged from 518-5848 pg/g, with average values of 1715 pg/g decreasing sharply compared to last year. In the study area, the PCB pollution level in the middle area was the highest, followed by that of the east coast and the west coast, respectively. Although the PCB level in the coastal areas was lower than that in the middle areas, it was proven in our study that the Yellow Sea obtained PCBs by virtue of river inputs. There was a positive and pertinent correlation between the clay proportion and PCB concentrations, and the increase of the PCB concentrations was directly proportional to the increase of TOC contents, with r = 0.61, but it was contrary to the sediment grain size. Consequently, the factors controlling PCB distribution had direct or indirect relationships with sediment grain size; moreover, the hydrodynamic conditions determined the sediment components and grain size. In conclusion, hydrodynamic conditions of the Yellow Sea were the most important influencing factors effecting the distribution of PCBs in the surface sediments of the SYS. (C) 2007 Elsevier Ltd. All rights reserved.

自主机器人的强化学习研究进展

虽然基于行为控制自主机器人具有较高的鲁棒性，但其对于动态环境缺乏必要的自适应能力，强化学习方法使机器人可以通过学习来完成任务，而无需设计者完全预先规定机器人的所有动作，它是将动态规划和监督学习结合的基础上发展起来的一种新颖的学习方法，它通过机器人与环境的试错交互，利用来自成功和失败经验的奖励和惩罚信号不断改进机器人的性能，从而达到目标，并容许滞后评价，由于其解决复杂问题的突出能力，强化学习已成为一种非常有前途的机器人学习方法，本文系统论述了强化学习方法在自主机器人中的研究现状，指出了存在的问题，分析了几种问题解决途径，展望了未来发展趋势。

A QUASI-SIMPLEX METHOD FOR STRICTLY CONVEX QUADRATIC PROGRAMMING

本文提出一个不用 Kuhn- Tucker条件而直接搜索严格凸二次规划最优目标点的鲁棒方法 .在搜索过程中 ,目标点沿约束多面体边界上的一条折线移动 .这种移动目标点的思想可以被认为是线性规划单纯形法的自然推广 ,在单纯形法中 ,目标点从一个顶点移到另一个顶点。

Type-omega DPLs

Type-omega DPLs (Denotational Proof Languages) are languages for proof presentation and search that offer strong soundness guarantees. LCF-type systems such as HOL offer similar guarantees, but their soundness relies heavily on static type systems. By contrast, DPLs ensure soundness dynamically, through their evaluation semantics; no type system is necessary. This is possible owing to a novel two-tier syntax that separates deductions from computations, and to the abstraction of assumption bases, which is factored into the semantics of the language and allows for sound evaluation. Every type-omega DPL properly contains a type-alpha DPL, which can be used to present proofs in a lucid and detailed form, exclusively in terms of primitive inference rules. Derived inference rules are expressed as user-defined methods, which are "proof recipes" that take arguments and dynamically perform appropriate deductions. Methods arise naturally via parametric abstraction over type-alpha proofs. In that light, the evaluation of a method call can be viewed as a computation that carries out a type-alpha deduction. The type-alpha proof "unwound" by such a method call is called the "certificate" of the call. Certificates can be checked by exceptionally simple type-alpha interpreters, and thus they are useful whenever we wish to minimize our trusted base. Methods are statically closed over lexical environments, but dynamically scoped over assumption bases. They can take other methods as arguments, they can iterate, and they can branch conditionally. These capabilities, in tandem with the bifurcated syntax of type-omega DPLs and their dynamic assumption-base semantics, allow the user to define methods in a style that is disciplined enough to ensure soundness yet fluid enough to permit succinct and perspicuous expression of arbitrarily sophisticated derived inference rules. We demonstrate every major feature of type-omega DPLs by defining and studying NDL-omega, a higher-order, lexically scoped, call-by-value type-omega DPL for classical zero-order natural deduction---a simple choice that allows us to focus on type-omega syntax and semantics rather than on the subtleties of the underlying logic. We start by illustrating how type-alpha DPLs naturally lead to type-omega DPLs by way of abstraction; present the formal syntax and semantics of NDL-omega; prove several results about it, including soundness; give numerous examples of methods; point out connections to the lambda-phi calculus, a very general framework for type-omega DPLs; introduce a notion of computational and deductive cost; define several instrumented interpreters for computing such costs and for generating certificates; explore the use of type-omega DPLs as general programming languages; show that DPLs do not have to be type-less by formulating a static Hindley-Milner polymorphic type system for NDL-omega; discuss some idiosyncrasies of type-omega DPLs such as the potential divergence of proof checking; and compare type-omega DPLs to other approaches to proof presentation and discovery. Finally, a complete implementation of NDL-omega in SML-NJ is given for users who want to run the examples and experiment with the language.

Paradigms for Structure in an Amorphous Computer

Recent developments in microfabrication and nanotechnology will enable the inexpensive manufacturing of massive numbers of tiny computing elements with sensors and actuators. New programming paradigms are required for obtaining organized and coherent behavior from the cooperation of large numbers of unreliable processing elements that are interconnected in unknown, irregular, and possibly time-varying ways. Amorphous computing is the study of developing and programming such ultrascale computing environments. This paper presents an approach to programming an amorphous computer by spontaneously organizing an unstructured collection of processing elements into cooperative groups and hierarchies. This paper introduces a structure called an AC Hierarchy, which logically organizes processors into groups at different levels of granularity. The AC hierarchy simplifies programming of an amorphous computer through new language abstractions, facilitates the design of efficient and robust algorithms, and simplifies the analysis of their performance. Several example applications are presented that greatly benefit from the AC hierarchy. This paper introduces three algorithms for constructing multiple levels of the hierarchy from an unstructured collection of processors.

An Algorithm for Group Formation and Maximal Independent Set in an Amorphous Computer

Amorphous computing is the study of programming ultra-scale computing environments of smart sensors and actuators cite{white-paper}. The individual elements are identical, asynchronous, randomly placed, embedded and communicate locally via wireless broadcast. Aggregating the processors into groups is a useful paradigm for programming an amorphous computer because groups can be used for specialization, increased robustness, and efficient resource allocation. This paper presents a new algorithm, called the clubs algorithm, for efficiently aggregating processors into groups in an amorphous computer, in time proportional to the local density of processors. The clubs algorithm is well-suited to the unique characteristics of an amorphous computer. In addition, the algorithm derives two properties from the physical embedding of the amorphous computer: an upper bound on the number of groups formed and a constant upper bound on the density of groups. The clubs algorithm can also be extended to find the maximal independent set (MIS) and $Delta + 1$ vertex coloring in an amorphous computer in $O(log N)$ rounds, where $N$ is the total number of elements and $Delta$ is the maximum degree.

Advanced Programming Language Features for Executable Design Patterns "Better Patterns Through Reflection

The Design Patterns book [GOF95] presents 24 time-tested patterns that consistently appear in well-designed software systems. Each pattern is presented with a description of the design problem the pattern addresses, as well as sample implementation code and design considerations. This paper explores how the patterns from the "Gang of Four'', or "GOF'' book, as it is often called, appear when similar problems are addressed using a dynamic, higher-order, object-oriented programming language. Some of the patterns disappear -- that is, they are supported directly by language features, some patterns are simpler or have a different focus, and some are essentially unchanged.