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

published_or_final_versio

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

Stimulus-specific adaptation at the synapse level in vitro

published_or_final_versio

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

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

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

PRESENT STATUS OF THE POHANG LIGHT-SOURCE

ope

Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages

A language $L$ over an alphabet $\Sigma$ is suffix-convex if, for any words $x,y,z\in\Sigma^*$, whenever $z$ and $xyz$ are in $L$, then so is $yz$. Suffix-convex languages include three special cases: left-ideal, suffix-closed, and suffix-free languages. We examine complexity properties of these three special classes of suffix-convex regular languages. In particular, we study the quotient/state complexity of boolean operations, product (concatenation), star, and reversal on these languages, as well as the size of their syntactic semigroups, and the quotient complexity of their atoms.Comment: 20 pages, 11 figures, 1 table. arXiv admin note: text overlap with arXiv:1605.0669

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

High-yield isolation of extracellular vesicles using aqueous two-phase system

Extracellular vesicles (EVs) such as exosomes and microvesicles released from cells are potential biomarkers for blood-based diagnostic applications. To exploit EVs as diagnostic biomarkers, an effective pre-analytical process is necessary. However, recent studies performed with blood-borne EVs have been hindered by the lack of effective purification strategies. In this study, an efficient EV isolation method was developed by using polyethylene glycol/dextran aqueous two phase system (ATPS). This method provides high EV recovery efficiency (similar to 70%) in a short time (similar to 15 min). Consequently, it can significantly increase the diagnostic applicability of EVs.113219Ysciescopu