ALBERT — All Library Books, journals and Electronic Records Telegrafenberg

1

Unknown

MHC class I peptides as chemosensory signals in the vomeronasal organ (2004)

T. Leinders-Zufall ; P. Brennan ; P. Widmayer ; [et al.]

American Association for the Advancement of Science (AAAS)

In: Science. 306(5698): 1033-7. doi: 10.1126/science.1102818.

add to mindlist on the mindlist

Details

Publication Date: 2004-11-06

Description: The mammalian vomeronasal organ detects social information about gender, status, and individuality. The molecular cues carrying this information remain largely unknown. Here, we show that small peptides that serve as ligands for major histocompatibility complex (MHC) class I molecules function also as sensory stimuli for a subset of vomeronasal sensory neurons located in the basal Gao- and V2R receptor-expressing zone of the vomeronasal epithelium. In behaving mice, the same peptides function as individuality signals underlying mate recognition in the context of pregnancy block. MHC peptides constitute a previously unknown family of chemosensory stimuli by which MHC genotypic diversity can influence social behavior.〈br /〉〈span class="detail_caption"〉Notes: 〈/span〉Leinders-Zufall, Trese -- Brennan, Peter -- Widmayer, Patricia -- S, Prashanth Chandramani -- Maul-Pavicic, Andrea -- Jager, Martina -- Li, Xiao-Hong -- Breer, Heinz -- Zufall, Frank -- Boehm, Thomas -- New York, N.Y. -- Science. 2004 Nov 5;306(5698):1033-7.〈br /〉〈span class="detail_caption"〉Author address: 〈/span〉Department of Anatomy and Neurobiology, University of Maryland School of Medicine, Baltimore, MD 21201, USA.〈br /〉〈span class="detail_caption"〉Record origin:〈/span〉 〈a href="http://www.ncbi.nlm.nih.gov/pubmed/15528444" target="_blank"〉PubMed〈/a〉

Keywords: Action Potentials ; Animals ; Chemoreceptor Cells ; Female ; H-2 Antigens/metabolism ; Histocompatibility Antigens Class I/*metabolism ; Ligands ; Male ; Mice ; Mice, Inbred C57BL ; Olfactory Receptor Neurons/metabolism ; Peptides/*metabolism ; Receptors, Vasopressin/metabolism ; *Signal Transduction ; Smell/physiology ; Urine ; Vomeronasal Organ/*metabolism

Print ISSN: 0036-8075

Electronic ISSN: 1095-9203

Topics: Biology , Chemistry and Pharmacology , Computer Science , Medicine , Natural Sciences in General , Physics

Published by American Association for the Advancement of Science (AAAS)

Permalink

	Location	Call Number	Expected	Availability

Others were also interested in ...

PAPER CURRENT

S·F·X

Fulltext

2

Electronic Resource

Tuning the hopping conductivity of WO3 films by ion bombardment at different temperatures (2001)

Heinz, B. ; Merz, M. ; Widmayer, P. ; [et al.]

[S.l.] : American Institute of Physics (AIP)

Journal of Applied Physics 90 (2001), S. 4007-4018

add to mindlist on the mindlist

Details

ISSN: 1089-7550

Source: AIP Digital Archive

Topics: Physics

Notes: WO3 films, either prepared by sputtering or evaporation under high or ultrahigh vacuum conditions, were irradiated with He+ and Ar+ ions (energy range 300–350 keV) at ambient and low temperatures (77–100 K). The resulting ion induced changes of the optical absorption as well as of the electrical conductivity could be determined on one and the same sample, which enables the variable range hopping (VRH) model to be tested under the assumption that the density of irradiation induced color centers is proportional to the electronic density of states contributing to the hopping conductivity. It is found that the data obtained at 300 K for He+ and Ar+ bombardment can be described within the VRH model by one common conductivity versus absorption curve, even though the effectiveness per projectile of the heavier ion for coloration as well as for increasing the conductivity is much higher. This is different at low temperatures. While the ion induced coloration is practically independent of the irradiation temperature for both projectiles, the effectiveness per projectile to enhance the conductivity is interchanged. This is attributed to the additional damage produced by the heavier ion at low temperatures resulting in strongly impeded hopping processes. Consistent with the VRH model, the temperature dependence of the conductivity of ion bombarded WO3 films follow the Mott "T−1/4" law, if the ion induced conductivity is not too high. For very high ion fluences clear deviations from the VRH model are observed for the conductivity versus absorption curves accompanied by a shift of the above power laws from T−1/4 towards T−1/2. © 2001 American Institute of Physics.

Type of Medium: Electronic Resource

URL: http://dx.doi.org/10.1063/1.1380215

Permalink

	Location	Call Number	Expected	Availability

Others were also interested in ...

Paper (German National Licenses)

Fulltext

3

Electronic Resource

Sequential ion-induced stress relaxation and growth: A way to prepare stress-relieved thick films of cubic boron nitride (2000)

Boyen, H.-G. ; Widmayer, P. ; Schwertberger, D. ; [et al.]

Woodbury, NY : American Institute of Physics (AIP)

Applied Physics Letters 76 (2000), S. 709-711

add to mindlist on the mindlist

Details

ISSN: 1077-3118

Source: AIP Digital Archive

Topics: Physics

Notes: It is shown that the bombardment of high quality cubic (c-) BN films with 300 keV Ar+ ions leads to a strong relaxation of their compressive stresses without destroying the cubic phase if the total ion fluence is kept below an upper limit. In addition, it was found that on top of such a stress-relieved film a further pure c-BN layer can be grown, but it builds up compressive stress again. Based on both results, a procedure is developed to grow thick (〉1 μm) c-BN films (〉80% c-BN) exhibiting low residual stress and long term stability under ambient conditions. © 2000 American Institute of Physics.

Type of Medium: Electronic Resource

URL: http://dx.doi.org/10.1063/1.125869

Permalink

	Location	Call Number	Expected	Availability

Others were also interested in ...

Paper (German National Licenses)

Fulltext

4

Electronic Resource

On some union and intersection problems for polygons with fixed orientations (1986)

Widmayer, P. ; Wu, Y. F. ; Schlag, M. D. F. ; [et al.]

Springer

Computing 36 (1986), S. 183-197

add to mindlist on the mindlist

Details

ISSN: 1436-5057

Keywords: 68C05 ; Polygons with fixed orientations ; computational geometry ; optimal algorithms

Source: Springer Online Journal Archives 1860-2000

Topics: Computer Science

Description / Table of Contents: Zusammenfassung Geometrische Objekte, die durch Geradenstücke mit wenigen, festgelegten Orientierungen begrenzt sind, spielen in vielen Anwendungsbereichen eine wichtige Rolle, so etwa beim Entwurf höchstintegrierter Schaltkreise (VLSI). Probleme, die nur Rechtecke betreffen, sind als ein einfachster Fall wegen ihrer Bedeutung beim VLSI-Entwurf bereits untersucht worden. Die Rechtecke repräsentieren Transistoren, Zellen, oder großere Funktionseinheiten. Eine wirklichkeitsgetreuere Repräsentation hierfür sind jedoch Polygone. In der vorliegenden Arbeit beschreiben wir ein allgemeines Verfahren zur Zerlegung einer Menge von Polygonen mit festen Orientierungen mit dem Ziel, beim VLSI-Entwurf wichtige Probleme der algorithmischen Geometrie zu lösen. Die Zerlegung ist sehr einfach und kann schnell berechnet werden; sie erlaubt die anschließende Lösung, von Problemen mit Hilfe von Algorithmen für rechteckige Objekte. Dieser Ansatz führt zu einigen effizienten und einigen optimalen Algorithmen. Wir illustrieren diese Technik im einzelnen am, Problem, die Zusammenhangskomponenten einer Menge von Polygonen zu bestimmen; wir beschreiben eine optimale Lösung dieses Problems. Dann zeigen wir die breite Anwendbarkeit des Verfahrens und leiten exemplarisch eine Lösung des Problems ab, alle Paare sich schneidender Polygone zu bestimmen.

Notes: Abstract Objects with fixed orientations play an important role in many application areas, for instance VLSI design. Problems involving only rectilinearly oriented (rectangular) objects, as a simplest case, have been studied with the VLSI design application in mind. These objects can be transistors, cells or macros. In reality, they are more suitably represented by polygons rather than just rectangles. In this note we describe how to perform a general decomposition of a set of polygons with fixed orientations in order to solve various computational geometry problems which are important in VLSI design. The decomposition is very simple and efficiently computable, and it allows the subsequent application of algorithms for the rectilinear case, leading to some very efficient and some optimal solutions. We illustrate the technique in detail at the problem of finding the connected components of a set of polygons, for which we derive an optimal solution. The wide applicability of the method is then demonstrated at the problem of finding all pairs of intersecting polygons, yielding an optimal solution.

Type of Medium: Electronic Resource

URL: http://dx.doi.org/10.1007/BF02240065

Permalink

	Location	Call Number	Expected	Availability

Others were also interested in ...

Paper (German National Licenses)

Fulltext

5

Electronic Resource

On optimal cuts of hyperrectangles (1995)

d'Amore, F. ; Nguyen, V. H. ; Roos, T. ; [et al.]

Springer

Computing 55 (1995), S. 191-206

add to mindlist on the mindlist

Details

ISSN: 1436-5057

Keywords: 68Q25 ; 68U05 ; Rectangles ; balanced cuts ; separation ; binary space partition

Source: Springer Online Journal Archives 1860-2000

Topics: Computer Science

Description / Table of Contents: Zusammenfassung Gegeben sei eine Menge vonn (ggf. überlappenden) isothetischen Hyperrechtecken imd-dimensionalen Raum. Diese Arbeit beschäftigt sich mit Zerlegungen dieser Hyperrechteckmenge durch Schnitthyperebenen, wobei wir annehmen, daß jedes von einer Hyperebene geschnittene Hyperrechteck in zwei nicht-überlappende Hyperrechtecke zerschnitten wird. Wir untersuchen das Verhalten einiger Balancierungskriterien für Schnitte und präsentieren optimale and praktikable Algorithmen zur Berechnung der entsprechenden balancierten Schnitte. Schließlich geben wir auch scharfe Worst-case-Schranken für die bestmöglich erreichbare Qualität der balancierten Schnitte an.

Notes: Abstract We are given a set ofn d-dimensional (possibly intersecting) isothetic hyperrectangles. The topic of this paper is the separation of these rectangles by means of a cutting isothetic hyperplane. Thereby we assume that a rectangle which is intersected by the cutting plane iscut into two non-overlapping hyperrectangles. We investigate the behavior of several kinds of balancing functions, as well as their linear combination and present optimal and practical algorithms for computing the corresponding balanced cuts. In addition, we give tight worst-case bounds for the quality of the balanced cuts.

Type of Medium: Electronic Resource

URL: http://dx.doi.org/10.1007/BF02238431

Permalink

	Location	Call Number	Expected	Availability

Others were also interested in ...

Paper (German National Licenses)

Fulltext

6

Electronic Resource

Book reviews (1995)

Brandt, A. ; Widmayer, P.

Springer

Mathematical methods of operations research 41 (1995), S. 381-383

add to mindlist on the mindlist

Details

ISSN: 1432-5217

Source: Springer Online Journal Archives 1860-2000

Topics: Mathematics , Economics

Type of Medium: Electronic Resource

URL: http://dx.doi.org/10.1007/BF01432366

Permalink

	Location	Call Number	Expected	Availability

Others were also interested in ...

Paper (German National Licenses)

Fulltext

7

Electronic Resource

A faster approximation algorithm for the Steiner problem in graphs (1986)

Wu, Y. F. ; Widmayer, P. ; Wong, C. K.

Springer

Acta informatica 23 (1986), S. 223-229

add to mindlist on the mindlist

Details

ISSN: 1432-0525

Source: Springer Online Journal Archives 1860-2000

Topics: Computer Science

Notes: Summary We present an algorithm for finding a Steiner tree for a connected, undirected distance graph with a specified subset S of the set of vertices V. The set V-S is traditionally denoted as Steiner vertices. The total distance on all edges of this Steiner tree is at most 2(1−1/l) times that of a Steiner minimal tree, where l is the minimum number of leaves in any Steiner minimal tree for the given graph. The algorithm runs in O(¦E¦log¦V¦) time in the worst case, where E is the set of all edges and V the set of all vertices in the graph. It improves dramatically on the best previously known bound of O(¦S¦¦V¦2), unless the graph is very dense and most vertices are Steiner vertices. The essence of our algorithm is to find a generalized minimum spanning tree of a graph in one coherent phase as opposed to the previous multiple steps approach.

Type of Medium: Electronic Resource

URL: http://dx.doi.org/10.1007/BF00289500

Permalink