The spectrum of bicyclic antiautomorphisms of directed triple systems

AbstractA transitive triple, (a,b,c), is defined to be the set {(a,b),(b,c),(a,c)} of ordered pairs. A directed triple system of order v, DTS(v), is a pair (D,β), where D is a set of v points and β is a collection of transitive triples of pairwise distinct points of D such that any ordered pair of distinct points of D is contained in precisely one transitive triple of β. An antiautomorphism of a directed triple system, (D,β), is a permutation of D which maps β to β−1, where β−1={(c,b,a)|(a,b,c)∈β}. In this paper we complete the necessary and sufficient conditions for the existence of a directed triple system of order v admitting an antiautomorphism consisting of two cycles

Cyclic, f-Cyclic, and Bicyclic Decompositions of the Complete Graph into the 4-Cycle with a Pendant Edge.

In this paper, we consider decompositions of the complete graph on v vertices into 4-cycles with a pendant edge. In part, we will consider decompositions which admit automorphisms consisting of: (1) a single cycle of length v, (2) f fixed points and a cycle of length v − f, or (3) two disjoint cycles. The purpose of this thesis is to give necessary and sufficient conditions for the existence of cyclic, f-cyclic, and bicyclic Q-decompositions of Kv

Target identification strategies in plant chemical biology

The current needs to understand gene function in plant biology increasingly require more dynamic and conditional approaches opposed to classic genetic strategies. Gene redundancy and lethality can substantially complicate research, which might be solved by applying a chemical genetics approach. Now understood as the study of small molecules and their effect on biological systems with subsequent target identification, chemical genetics is a fast developing field with a strong history in pharmaceutical research and drug discovery. In plant biology however, chemical genetics is still largely in the starting blocks, with most studies relying on forward genetics and phenotypic analysis for target identification, whereas studies including direct target identification are limited. Here, we provide an overview of recent advances in chemical genetics in plant biology with a focus on target identification. Furthermore, we discuss different strategies for direct target identification and the possibilities and challenges for plant biology

Ionic Liquid-functionalized Mesoporous Sorbents And Their Use In The Capture Of Polluting Gases

A composite structure for capturing a gaseous electrophilic species, the composite structure comprising mesoporous refractory sorbent particles on which an ionic liquid is covalently attached, wherein said ionic liquid includes an accessible functional group that is capable of binding to said gaseous electrophilic species. In particular embodiments, the mesoporous sorbent particles are contained within refractory hollow fibers. Also described is a method for capturing a gaseous electrophilic species by use of the above-described composite structure, wherein the gaseous electrophilic species is contacted with the composite structure. In particular embodiments thereof, cooling water is passed through the refractory hollow fibers containing the IL-functionalized sorbent particles in order to facilitate capture of the gaseous electrophilic species, and then steam is passed through the refractory hollow fibers to facilitate release of the gaseous electrophilic species such that the composite structure can be re-used to capture additional gas.Ut-battelle, LLCGeorgia Tech Research Corporatio

Use of Parthenolide Derivatives as Antileukemic and Cytotoxic Agents

To read this abstract, please download this patent

Use of Parthenolide Derivatives as Antileukemic and Cytotoxic Agents

To view this abstract, please download this patent

Use of Parthenolide Derivatives as Antileukemic and Cytotoxic Agents

To view this abstract, please download this patent

Silent Transitions in Automata with Storage

We consider the computational power of silent transitions in one-way automata with storage. Specifically, we ask which storage mechanisms admit a transformation of a given automaton into one that accepts the same language and reads at least one input symbol in each step. We study this question using the model of valence automata. Here, a finite automaton is equipped with a storage mechanism that is given by a monoid. This work presents generalizations of known results on silent transitions. For two classes of monoids, it provides characterizations of those monoids that allow the removal of \lambda-transitions. Both classes are defined by graph products of copies of the bicyclic monoid and the group of integers. The first class contains pushdown storages as well as the blind counters while the second class contains the blind and the partially blind counters.Comment: 32 pages, submitte