Synthesis and quantum-chemistry analysis on novel triazole compounds containing ester group

Nine novel triazole compounds containing ester group were designed and synthesized. Their structures were confirmed by elemental, H-1 NMR and IR analyses, and optimized by means of DFT (Density Functional Theory) method at the B3LYP/6-31G* level. Based on the quantum-chemical calculation results and the Pearson coefficients between FA and quantumchemical parameters, V, LogP, MR and E-HOMO are shown to be the important relative factors which affect FA of the title compounds.

Group size effects on foraging and vigilance in migratory Tibetan antelope

Large group sizes have been hypothesized to decrease predation risk and increase food competition. We investigated group size effects on vigilance and foraging behaviour during the migratory period in female Tibetan antelope Pantholops hodgsoni, in the Kekexili Nature Reserve of Qinghai Province, China. During June to August, adult female antelope and yearling females gather in large migratory groups and cross the Qinghai-Tibet highway to calving grounds within the Nature Reserve and return to Qumalai county after calving. Large groups of antelope aggregate in the migratory corridor where they compete for limited food resources and attract the attention of mammalian and avian predators and scavengers. We restricted our sampling to groups of less than 30 antelopes and thus limit our inference accordingly. Focal-animal sampling was used to record the behaviour of the free-ranging antelope except for those with lambs. Tibetan antelope spent more time foraging in larger groups but frequency of foraging bouts was not affected by group size. Conversely, the time spent vigilant and frequency of vigilance bouts decreased with increased group size. We suggest that these results are best explained by competition for food and risk of predation. (C) 2007 Elsevier B.V. All rights reserved.

Molecular evidence for the sister relationship of the eastern Asia-North American intercontinental species pair in the Podophyllum group (Berberidaceae)

The presumed pair relationships of intercontinental vicariad species in the Podophyllum group (Sinopodophyllum hexandrum vs. Podophyllum pelatum and Diphylleia grayi vs. D. cymosa) were recently, considered to be paraphyletic. In the present paper, the trnL-F and ITS gene sequences of the representatives were used to examine the sister relationships of these two vicariad species. A heuristic parsimony analysis based on the trnLF data identified Diphylleia as the basal clade of the other three genera, but provided poor resolution of their inter-relationships. High sequence divergence was found in the ITS data. ITS1 region, more variable but parsimonyuninformative. has no phylogenetic value, Sequence divergence of the ITS2 region provided abundant, phylogenetically informative variable characters. Analysis of ITS2 sequences confirmeda sister relationship between the presumable vicariad species, in spite of a low bootstrap support for Sinopodophyllum hexandrum vs. Podophyllum pelatum. The combined ITS2 and trnL-F data enforced a sister relationship between Sinopodophyllum hexandrum and Podophyllum pelatum with an elevated bootstrap support of 100%. Based on molecular phylogeny, the morphological evolution of this group was discussed. The self-pollination might have evolved from cross-fertilization two times in this group. The different pollination and seed dispersal systems of Sinopodophyllum hexandrum and Podophlyllum pelatum resulted from their adaptations to different ecological habitats. The divergence time of Sinopodophyllum hexandrum-Podophyllum pelatum is estimated to be 6.52+/-1.89 myr based on the ITS divergence. The divergence of this species pair predated or co-occurred with the recent uplift of the Himalayas 4-3 myr during the late Miocene and the formation of the alpine habitats. Sinopodophyllum hexandrum developed a host of specialized characters in its subsequent adaptation to the arid alpine surroundings. The present study confirmed the different patterns of species relationship between Asian-North American disjuncts. The isolation of plant elements between North America and eastern Asia must have been a gradual process, resulting in the different phylogenetic patterns and divergence times of the disjuncts.

Synthesis of a group of diosgenyl saponins with combined use of glycosyl trichloroacetimidate and thioglycoside donors

With the combined use of glycosyl trichloroacetimidates and thioglycosides, a group of natural diosgenyl saponins (1-6) are efficiently synthesized, in either a stepwise or a 'one-pot' manner. The trichloroacetimidate is employed as an efficient temporary hydroxy protecting group in glycosylation with the glycosyl trichloroacetimidate. The intermolecular alkylthio-group transfer is demonstrated to be a common side-reaction during glycosylation with thioglycosides.

Trichloroacetimidate as an efficient protective group for alcohols

The trichloroacetimidate is disclosed to be a general and efficient protective group for alcohols, which can be deprotected under mild acidic, basic, or neutral conditions, and has orthogonal stability with the acetate and tert-butyldimethylsilyl (TBS) protections.

Synthesis of a group of diosgenyl saponins by a one-pot sequential glycosylation

A group of natural diosgenyl saponins was synthesized in a highly efficient manner employing the 'one-pot sequential glycosylation' protocol with the combined use of glycosyl trichloroacetimidates and thioglycosides. (C) 1999 Elsevier Science Ltd. All rights reserved.

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.

Proceedings of the Fourth PHANTOM Users Group Workshop

This Report contains the proceedings of the Fourth Phantom Users Group Workshop contains 17 papers presented October 9-12, 1999 at MIT Endicott House in Dedham Massachusetts. The workshop included sessions on, Tools for Programmers, Dynamic Environments, Perception and Cognition, Haptic Connections, Collision Detection / Collision Response, Medical and Seismic Applications, and Haptics Going Mainstream. The proceedings include papers that cover a variety of subjects in computer haptics including rendering, contact determination, development libraries, and applications in medicine, path planning, data interaction and training.

ADEPT: A Heuristic Program for Proving Theorems of Group Theory

A computer program, named ADEPT (A Distinctly Empirical Prover of Theorems), has been written which proves theorems taken from the abstract theory of groups. Its operation is basically heuristic, incorporating many of the techniques of the human mathematician in a "natural" way. This program has proved almost 100 theorems, as well as serving as a vehicle for testing and evaluating special-purpose heuristics. A detailed description of the program is supplemented by accounts of its performance on a number of theorems, thus providing many insights into the particular problems inherent in the design of a procedure capable of proving a variety of theorems from this domain. Suggestions have been formulated for further efforts along these lines, and comparisons with related work previously reported in the literature have been made.