Robust Consensus for a Class of Uncertain Multi-Agent Dynamical Systems

published_or_final_versio

Stimulus-specific adaptation at the synapse level in vitro

published_or_final_versio

On the Hierarchy of Block Deterministic Languages

A regular language is $k$-lookahead deterministic (resp. $k$-block deterministic) if it is specified by a $k$-lookahead deterministic (resp. $k$-block deterministic) regular expression. These two subclasses of regular languages have been respectively introduced by Han and Wood ($k$-lookahead determinism) and by Giammarresi et al. ($k$-block determinism) as a possible extension of one-unambiguous languages defined and characterized by Br\"uggemann-Klein and Wood. In this paper, we study the hierarchy and the inclusion links of these families. We first show that each $k$-block deterministic language is the alphabetic image of some one-unambiguous language. Moreover, we show that the conversion from a minimal DFA of a $k$-block deterministic regular language to a $k$-block deterministic automaton not only requires state elimination, and that the proof given by Han and Wood of a proper hierarchy in $k$-block deterministic languages based on this result is erroneous. Despite these results, we show by giving a parameterized family that there is a proper hierarchy in $k$-block deterministic regular languages. We also prove that there is a proper hierarchy in $k$-lookahead deterministic regular languages by studying particular properties of unary regular expressions. Finally, using our valid results, we confirm that the family of $k$-block deterministic regular languages is strictly included into the one of $k$-lookahead deterministic regular languages by showing that any $k$-block deterministic unary language is one-unambiguous

Human induced pluripotent stem cell-derived sensory neurons for fate commitment of bone marrow-derived Schwann cells: Implications for re-myelination therapy

published_or_final_versio

AFLP analysis on genetic diversity and population structure of small yellow croaker Larimichthys polyactis

The population genetic structure and diversity of small yellow croaker Larimichthys polyactis in the Bohai Bay, Yellow Sea and East China Sea were analyzed using amplified fragment length polymorphism(AFLP). Ninety-one individuals were collected from six locations representing three stocks of small yellow croaker. A total of 218 putative loci were detected by 3 primer combinations, 148 of which were polymorphic (67.89%). The proportion of polymorphic loci and Nei’s genetic diversity for six populations ranged from 55.34 - 60.09%, and from 0.1244 - 0.1378. AMOVA analysis and pairwise FST revealedsignificant genetic differentiation among the three groups based on the breeding migration routes and over-wintering grounds, supporting separate stocks in this species. The result shows the migratorybehavior might be an important factor which influences the genetic structure of this species. The UPGMA tree also revealed the significant geographic structure in this species. Pattern of isolation bydistance was observed in this species, indicating that significant genetic differentiation among localities of small yellow croaker might be due to the geographic distance

PRESENT STATUS OF THE POHANG LIGHT-SOURCE

ope

The Bishop-Phelps-Bollobas theorem for operators on L-1(mu)

In this paper we show that the Bishop-Phelps-Bollobas theorem holds for L(L-1(mu), L-1(v)) for all measures and v and also holds for L(L-1(mu), L-infinity(nu)) for every arbitrary measure mu and every localizable measure nu Finally, we show that the Bishop-Phelps-Bollobas theorem holds for two classes of bounded linear operators from a real L-1(mu) into a real C(K) if mu is a finite measure and K is a compact Hausdorff space. In particular, one of the classes includes all Bochner representable operators and all weakly compact operators. (c) 2014 Elsevier Inc. All rights reserved.X1174Ysciescopu

Confluent Orthogonal Drawings of Syntax Diagrams

We provide a pipeline for generating syntax diagrams (also called railroad diagrams) from context free grammars. Syntax diagrams are a graphical representation of a context free language, which we formalize abstractly as a set of mutually recursive nondeterministic finite automata and draw by combining elements from the confluent drawing, layered drawing, and smooth orthogonal drawing styles. Within our pipeline we introduce several heuristics that modify the grammar but preserve the language, improving the aesthetics of the final drawing.Comment: GD 201

A synthesis-enabled relative stereochemical assignment of the C1-C28 region of hemicalide.

Through synthesising both candidate diastereomers of a model C1-C28 fragment of the potent cytotoxic marine polyketide hemicalide, an assignment of the relative configuration between the C1-C15 and C16-C26 regions has been achieved. By detailed NMR comparisons with the natural product, the relative stereochemistry between these two 1,6-related stereoclusters is elucidated as 13,18-syn rather than the previously proposed 13,18-anti relationship. A flexible and modular strategy using an advanced C1-C28 ketone fragment 22 is outlined to elucidate the remaining stereochemical features and achieve a total synthesis

A New Technique for Reachability of States in Concatenation Automata

We present a new technique for demonstrating the reachability of states in deterministic finite automata representing the concatenation of two languages. Such demonstrations are a necessary step in establishing the state complexity of the concatenation of two languages, and thus in establishing the state complexity of concatenation as an operation. Typically, ad-hoc induction arguments are used to show particular states are reachable in concatenation automata. We prove some results that seem to capture the essence of many of these induction arguments. Using these results, reachability proofs in concatenation automata can often be done more simply and without using induction directly.Comment: 23 pages, 1 table. Added missing affiliation/funding informatio