The colony-stimulating factor 1 receptor is expressed on dendritic cells during differentiation and regulates their expansion

The lineage of dendritic cells (DC), and in particular their relationship to monocytes and macrophages, remains obscure. Furthermore, the requirement for the macrophage growth factor CSF-1 during DC homeostasis is unclear. Using a transgenic mouse in which the promoter for the CSF-1R (c-fms) directs the expression of enhanced GFP in cells of the myeloid lineage, we determined that although the c-fms promoter is inactive in DC precursors, it is up-regulated in all DC subsets during differentiation. Furthermore, plasmacytoid DC and all CD11c(high) DC subsets are reduced by 50-70% in CSF-1-deficient osteopetrotic mice, confirming that CSF-1 signaling is required for the optimal differentiation of DC in vivo. These data provide additional evidence that the majority of tissue DC is of myeloid origin during steady state and supports a close relationship between DC and macrophage biology in vivo.

A multiresolution terrain model for efficient visualization query processing

Multiresolution Triangular Mesh (MTM) models are widely used to improve the performance of large terrain visualization by replacing the original model with a simplified one. MTM models, which consist of both original and simplified data, are commonly stored in spatial database systems due to their size. The relatively slow access speed of disks makes data retrieval the bottleneck of such terrain visualization systems. Existing spatial access methods proposed to address this problem rely on main-memory MTM models, which leads to significant overhead during query processing. In this paper, we approach the problem from a new perspective and propose a novel MTM called direct mesh that is designed specifically for secondary storage. It supports available indexing methods natively and requires no modification to MTM structure. Experiment results, which are based on two real-world data sets, show an average performance improvement of 5-10 times over the existing methods.

Diurnal polyp expansion behavior in stony corals may enhance carbon availability for symbionts photosynthesis

Photosynthesis of zooxanthellate stony corals may be limited by inorganic carbon at high irradiances. We demonstrated that oxygen consumption of expanded corals is higher than that of contracted corals in both night-expanding and day-expanding corals. It is assumed that at the single-polyp level, the expansion of tentacles increases the surface area for solute exchange with the surrounding water, which may alleviate potential carbon limitation and excess oxygen levels in the tissue under high irradiance. We investigated this hypothesis using stable carbon isotope (613 C) analysis of coral species from the Red Sea exhibiting different morphologies. delta C-13 ratios in zooxanthellae of branched coral colonies with small polyp size that extend their tentacles during daytime (diurnal morphs) showed lower delta C-13 values in their zooxanthellae - 13.83 +/- 1.45 parts per thousand, compared to corals from the same depth with large polyps, which are usually massive and expand their tentacles only at night (nocturnal morphs). Their algae delta C-13 was significantly higher, averaging - 11.33 +/- 0.59 parts per thousand. Carbon isotope budget of the coral tissue suggests that branched corals are more autotrophic, i.e., that they depend on their symbionts for nutrition compared to massive species, which are more heterotrophic and depend on plankton predation. (c) 2005 Elsevier B.V. All rights reserved.

Nitrenes, diradicals, and ylides. Ring expansion and ring opening in 2-quinazolylnitrenes

Tetrazolo[1,5-a] quinazoline (9) is converted to 2-azidoquinazoline (10) on sublimation at 200 degrees C and above, and the azide-tetrazole equilibrium is governed by entropy. 2-Quinazolylnitrenes 11 and 27 and/ or their ring expansion products 14 and 29 can undergo type I (ylidic) and type II (diradicaloid) ring opening. Argon matrix photolysis of 9/10 affords 2-quinazolylnitrene (11), which has been characterized by ESR, UV, and IR spectroscopy. A minor amount of a second nitrene, formed by rearrangement or ring opening, is also observed. A diradical (19) is formed rapidly by type II ring opening and characterized by ESR spectroscopy; it decays thermally at 15 K with a half-life of ca. 47 min, in agreement with its calculated facile intersystem crossing (19T -> 19OSS) followed by facile cyclization/rearrangement to 1-cyanoindazole (21) (calculated activation barrier 1- 2 kcal/mol) and N-cyanoanthranilonitrile (22). 21 and 22 are the isolated end products of photolysis. 21 is also the end product of flash vacuum thermolysis. An excellent linear correlation between the zero-field splitting parameter D (cm(-1)) and the spin density F on the nitrene N calculated at the B3LYP/EPRIII level is reported (R-2 = 0.993 for over 100 nitrenes). Matrix photolysis of 3-phenyltetrazolo[1,5-a] quinazoline (25) affords the benzotriazacycloheptatetraene 29, which can be photochemically interconverted with the type I ring opening product 2-isocyano-alpha-diazo-alpha- phenyltoluene (33) as determined by IR and UV spectroscopy. The corresponding carbene 37, obtained by photolysis of 33, was detected by matrix ESR spectroscopy.

Toward efficient multifeature query processing

In many advanced applications, data are described by multiple high-dimensional features. Moreover, different queries may weight these features differently; some may not even specify all the features. In this paper, we propose our solution to support efficient query processing in these applications. We devise a novel representation that compactly captures f features into two components: The first component is a 2D vector that reflects a distance range ( minimum and maximum values) of the f features with respect to a reference point ( the center of the space) in a metric space and the second component is a bit signature, with two bits per dimension, obtained by analyzing each feature's descending energy histogram. This representation enables two levels of filtering: The first component prunes away points that do not share similar distance ranges, while the bit signature filters away points based on the dimensions of the relevant features. Moreover, the representation facilitates the use of a single index structure to further speed up processing. We employ the classical B+-tree for this purpose. We also propose a KNN search algorithm that exploits the access orders of critical dimensions of highly selective features and partial distances to prune the search space more effectively. Our extensive experiments on both real-life and synthetic data sets show that the proposed solution offers significant performance advantages over sequential scan and retrieval methods using single and multiple VA-files.

A scaleless data model for direct and progressive spatial query processing

A progressive spatial query retrieves spatial data based on previous queries (e.g., to fetch data in a more restricted area with higher resolution). A direct query, on the other side, is defined as an isolated window query. A multi-resolution spatial database system should support both progressive queries and traditional direct queries. It is conceptually challenging to support both types of query at the same time, as direct queries favour location-based data clustering, whereas progressive queries require fragmented data clustered by resolutions. Two new scaleless data structures are proposed in this paper. Experimental results using both synthetic and real world datasets demonstrate that the query processing time based on the new multiresolution approaches is comparable and often better than multi-representation data structures for both types of queries.

How does your model grow? An empirical investigation of the effects of ontological clarity and application domain size on query performance

Semantic data models provide a map of the components of an information system. The characteristics of these models affect their usefulness for various tasks (e.g., information retrieval). The quality of information retrieval has obvious important consequences, both economic and otherwise. Traditionally, data base designers have produced parsimonious logical data models. In spite of their increased size, ontologically clearer conceptual models have been shown to facilitate better performance for both problem solving and information retrieval tasks in experimental settings. The experiments producing evidence of enhanced performance for ontologically clearer models have, however, used application domains of modest size. Data models in organizational settings are likely to be substantially larger than those used in these experiments. This research used an experiment to investigate whether the benefits of improved information retrieval performance associated with ontologically clearer models are robust as the size of the application domains increase. The experiment used an application domain of approximately twice the size as tested in prior experiments. The results indicate that, relative to the users of the parsimonious implementation, end users of the ontologically clearer implementation made significantly more semantic errors, took significantly more time to compose their queries, and were significantly less confident in the accuracy of their queries.

Semantic caching for multiresolution spatial query processing in mobile environments

Spatial data are particularly useful in mobile environments. However, due to the low bandwidth of most wireless networks, developing large spatial database applications becomes a challenging process. In this paper, we provide the first attempt to combine two important techniques, multiresolution spatial data structure and semantic caching, towards efficient spatial query processing in mobile environments. Based on the study of the characteristics of multiresolution spatial data (MSD) and multiresolution spatial query, we propose a new semantic caching model called Multiresolution Semantic Caching (MSC) for caching MSD in mobile environments. MSC enriches the traditional three-category query processing in semantic cache to five categories, thus improving the performance in three ways: 1) a reduction in the amount and complexity of the remainder queries; 2) the redundant transmission of spatial data already residing in a cache is avoided; 3) a provision for satisfactory answers before 100% query results have been transmitted to the client side. Our extensive experiments on a very large and complex real spatial database show that MSC outperforms the traditional semantic caching models significantly