ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Publication Date: 2005-09-10
    Description: On 4 July 2005, many observatories around the world and in space observed the collision of Deep Impact with comet 9P/Tempel 1 or its aftermath. This was an unprecedented coordinated observational campaign. These data show that (i) there was new material after impact that was compositionally different from that seen before impact; (ii) the ratio of dust mass to gas mass in the ejecta was much larger than before impact; (iii) the new activity did not last more than a few days, and by 9 July the comet's behavior was indistinguishable from its pre-impact behavior; and (iv) there were interesting transient phenomena that may be correlated with cratering physics.〈br /〉〈span class="detail_caption"〉Notes: 〈/span〉Meech, K J -- Ageorges, N -- A'Hearn, M F -- Arpigny, C -- Ates, A -- Aycock, J -- Bagnulo, S -- Bailey, J -- Barber, R -- Barrera, L -- Barrena, R -- Bauer, J M -- Belton, M J S -- Bensch, F -- Bhattacharya, B -- Biver, N -- Blake, G -- Bockelee-Morvan, D -- Boehnhardt, H -- Bonev, B P -- Bonev, T -- Buie, M W -- Burton, M G -- Butner, H M -- Cabanac, R -- Campbell, R -- Campins, H -- Capria, M T -- Carroll, T -- Chaffee, F -- Charnley, S B -- Cleis, R -- Coates, A -- Cochran, A -- Colom, P -- Conrad, A -- Coulson, I M -- Crovisier, J -- deBuizer, J -- Dekany, R -- de Leon, J -- Dello Russo, N -- Delsanti, A -- DiSanti, M -- Drummond, J -- Dundon, L -- Etzel, P B -- Farnham, T L -- Feldman, P -- Fernandez, Y R -- Filipovic, M D -- Fisher, S -- Fitzsimmons, A -- Fong, D -- Fugate, R -- Fujiwara, H -- Fujiyoshi, T -- Furusho, R -- Fuse, T -- Gibb, E -- Groussin, O -- Gulkis, S -- Gurwell, M -- Hadamcik, E -- Hainaut, O -- Harker, D -- Harrington, D -- Harwit, M -- Hasegawa, S -- Hergenrother, C W -- Hirst, P -- Hodapp, K -- Honda, M -- Howell, E S -- Hutsemekers, D -- Iono, D -- Ip, W-H -- Jackson, W -- Jehin, E -- Jiang, Z J -- Jones, G H -- Jones, P A -- Kadono, T -- Kamath, U W -- Kaufl, H U -- Kasuga, T -- Kawakita, H -- Kelley, M S -- Kerber, F -- Kidger, M -- Kinoshita, D -- Knight, M -- Lara, L -- Larson, S M -- Lederer, S -- Lee, C-F -- Levasseur-Regourd, A C -- Li, J Y -- Li, Q-S -- Licandro, J -- Lin, Z-Y -- Lisse, C M -- LoCurto, G -- Lovell, A J -- Lowry, S C -- Lyke, J -- Lynch, D -- Ma, J -- Magee-Sauer, K -- Maheswar, G -- Manfroid, J -- Marco, O -- Martin, P -- Melnick, G -- Miller, S -- Miyata, T -- Moriarty-Schieven, G H -- Moskovitz, N -- Mueller, B E A -- Mumma, M J -- Muneer, S -- Neufeld, D A -- Ootsubo, T -- Osip, D -- Pandea, S K -- Pantin, E -- Paterno-Mahler, R -- Patten, B -- Penprase, B E -- Peck, A -- Petitas, G -- Pinilla-Alonso, N -- Pittichova, J -- Pompei, E -- Prabhu, T P -- Qi, C -- Rao, R -- Rauer, H -- Reitsema, H -- Rodgers, S D -- Rodriguez, P -- Ruane, R -- Ruch, G -- Rujopakarn, W -- Sahu, D K -- Sako, S -- Sakon, I -- Samarasinha, N -- Sarkissian, J M -- Saviane, I -- Schirmer, M -- Schultz, P -- Schulz, R -- Seitzer, P -- Sekiguchi, T -- Selman, F -- Serra-Ricart, M -- Sharp, R -- Snell, R L -- Snodgrass, C -- Stallard, T -- Stecklein, G -- Sterken, C -- Stuwe, J A -- Sugita, S -- Sumner, M -- Suntzeff, N -- Swaters, R -- Takakuwa, S -- Takato, N -- Thomas-Osip, J -- Thompson, E -- Tokunaga, A T -- Tozzi, G P -- Tran, H -- Troy, M -- Trujillo, C -- Van Cleve, J -- Vasundhara, R -- Vazquez, R -- Vilas, F -- Villanueva, G -- von Braun, K -- Vora, P -- Wainscoat, R J -- Walsh, K -- Watanabe, J -- Weaver, H A -- Weaver, W -- Weiler, M -- Weissman, P R -- Welsh, W F -- Wilner, D -- Wolk, S -- Womack, M -- Wooden, D -- Woodney, L M -- Woodward, C -- Wu, Z-Y -- Wu, J-H -- Yamashita, T -- Yang, B -- Yang, Y-B -- Yokogawa, S -- Zook, A C -- Zauderer, A -- Zhao, X -- Zhou, X -- Zucconi, J-M -- New York, N.Y. -- Science. 2005 Oct 14;310(5746):265-9. Epub 2005 Sep 8.〈br /〉〈span class="detail_caption"〉Author address: 〈/span〉Institute for Astronomy, University of Hawaii at Manoa, 2680 Woodlawn Drive, Honolulu, HI 96822, USA.〈br /〉〈span class="detail_caption"〉Record origin:〈/span〉 〈a href="http://www.ncbi.nlm.nih.gov/pubmed/16150977" target="_blank"〉PubMed〈/a〉
    Keywords: Cosmic Dust ; Jupiter ; *Meteoroids ; Organic Chemicals ; Photometry
    Print ISSN: 0036-8075
    Electronic ISSN: 1095-9203
    Topics: Biology , Chemistry and Pharmacology , Computer Science , Medicine , Natural Sciences in General , Physics
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Publication Date: 2016-03-17
    Description: We investigate optical reprocessing of X-rays in the low-mass X-ray binary (LMXB) pulsar 4U 1626–67 in its current spin-up phase using observations with Southern African Large Telescope (SALT), near-simultaneous observations with Swift -X-ray Telescope and non-simultaneous RXTE -Proportional Counter Array (PCA) observations and present the results of timing analysis. Using SALT observations carried out on 2014 March 5 and 6, we detect some interesting reprocessing signatures. We detect a weak optical quasiperiodic oscillation (QPO) in the power density spectrum on March 5 at 48 mHz with a fractional rms of 3.3 per cent in spite of the fact that source shows no corresponding X-ray QPO in the spin-up phase. In the light curve obtained on March 5, we detect a coherent pulsation at the spin period of ~7.677 s. A previously known, slightly down-shifted side-band is also detected at 129.92 mHz. The frequency spacing between main pulse and this side-band is different from earlier observations, though the statistical significance of the difference is limited. The light curve of March 6 displays short time-scale variability in the form of flares on time-scales of a few minutes. Folded pulse profiles resulting from data of this night show an interesting trend of pulse peak drifting. This drift could be due to (i) rapid changes in the reprocessing agent, like orbital motion of an accretion disc warp around the neutron star, or (ii) intrinsic pulse phase changes in X-rays. We also examine some X-ray light curves obtained with RXTE -PCA during 2008–2010 for pulse shape changes in short time-scales during X-ray flares.
    Print ISSN: 0035-8711
    Electronic ISSN: 1365-2966
    Topics: Physics
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Publication Date: 2016-01-29
    Description: There is growing evidence that chromosome territories (CT) have a probabilistic non-random arrangement within the cell nucleus of mammalian cells including radial positioning and preferred patterns of interchromosomal interactions that are cell-type specific. While it is generally assumed that the three-dimensional (3D) arrangement of genes within the CT is linked to genomic regulation, the degree of non-random organization of individual CT remains unclear. As a first step to elucidating the global 3D organization (topology) of individual CT, we performed multi-color fluorescence in situ hybridization using six probes extending across each chromosome in human WI38 lung fibroblasts. Six CT were selected ranging in size and gene density (1, 4, 12, 17, 18 and X). In-house computational geometric algorithms were applied to measure the 3D distances between every combination of probes and to elucidate data-mined structural patterns. Our findings demonstrate a high degree of non-random arrangement of individual CT that vary from chromosome to chromosome and display distinct changes during the cell cycle. Application of a classic, well-defined data mining and pattern recognition approach termed the ‘ k -means’ generated 3D models for the best fit arrangement of each chromosome. These predicted models correlated well with the detailed distance measurements and analysis. We propose that the unique 3D topology of each CT and characteristic changes during the cell cycle provide the structural framework for the global gene expression programs of the individual chromosomes.
    Print ISSN: 0964-6906
    Electronic ISSN: 1460-2083
    Topics: Biology , Medicine
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Publication Date: 2015-07-08
    Description: Protease-activated receptor-1 (PAR1) is a G-protein-coupled receptor (GPCR) for the coagulant protease thrombin. Similar to other GPCRs, PAR1 is promiscuous and couples to multiple heterotrimeric G-protein subtypes in the same cell and promotes diverse cellular responses. The molecular mechanism by which activation of a given GPCR with the same ligand...
    Print ISSN: 0027-8424
    Electronic ISSN: 1091-6490
    Topics: Biology , Medicine , Natural Sciences in General
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Publication Date: 2019
    Description: Although Bangladesh has suffered from different types of floods which have caused enormous damage to properties and lives, managing floods still remains a challenging task. Flood management is a multisectoral activity due to its complexity, scale, and multidisciplinary nature. Sirajganj district can be regarded as one of the most vulnerable areas in Bangladesh and hence a study was carried out for Sirajganj district to provide guidelines to combat challenges to flood risk management. The flood frequency analyses at three river stations using water level data were carried out, the flood inundation map for different return periods and a flood depth versus damage curve are plotted to address the vulnerable areas and damages, and to help design flood mitigation structures. It can be inferred that damages will be proportional to return period since the risk is a function of hazard, vulnerability, and exposure. Both structural and non‐structural measures including rejuvenation of the Jamuna River and low‐cost flood resistant building approaches for flood affected char (island) people are suggested along with a few recommendations to mitigate floods in the study area. The government, Non governmental organization (NGO), funding agencies, and transboundary countries should come forward to mitigate flood hazards to improve the livelihood of the affected people.
    Electronic ISSN: 1753-318X
    Topics: Architecture, Civil Engineering, Surveying , Geosciences
    Published by Wiley
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Publication Date: 2014-10-14
    Type: inbook
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    ISSN: 1741-0444
    Keywords: Field distribution ; Finite-element method ; Plethysmography
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Chemistry and Pharmacology , Medicine
    Notes: Abstract A two-dimensional model of the thorax has been analysed to study the electrical potential distributions under various physiological conditions in relation to electrical field plethysmography. The quasi-harmonic equation has been solved over a cross-section of the thorax with the help of a finite-element method under the assumptions of homogeneous and isotropic tissue characteristics. Potentials along the boundary of the model have been plotted and the optimum electrode locations derived from the analysis corresponded well with the experimentally obtained positions. It is concluded that cardiac activity can be monitored effectively in the presence of lung activity. It has also been found that, with a suitable modification of the positions of the pick-up electrodes, lung activity can also be monitored. The equipotential lines drawn and the current densities computed have provided a picture of the field distribution pattern in the thoracic model. The analysis showed that the technique fulfils the preliminary requirements of a plethysmographic tool.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    ISSN: 1573-2975
    Keywords: Biomonitoring ; bioindicator ; India ; macrobenthos ; mercury and organomercury ; pollution ; trace metal
    Source: Springer Online Journal Archives 1860-2000
    Topics: Energy, Environment Protection, Nuclear Power Engineering , Sociology
    Notes: Abstract Organisms sensitive to ambient environment are used as bioindicators in monitoring pollution. The present investigation is designed to measure the extent of mercury and organomercury levels in selective biota of different trophic levels inhabiting in the coastal environment of Sunderban Biosphere Reserve, eastern part of India. The primary objective of this work is to provide baseline data for future environmental quality programme and to ascertain the suitability of these organisms to be used as bioindicator species of pollution. The seagrass (Porterasia coarctata), macrobenthos (polychaetes, gastropods and bivalve molluscs) and pelagic finfishes were collected from sites of different physiochemical characteristics. Concentration of total mercury was determined by cold vapour atomic absorption spectrophotometry technique (CVAAS) using a Perkin-Elmer 2380 AAS equipped with MHS 10. Both mercury and organomercury levels showed considerable interspecific and regional variations which reflected the feeding strategy of these animals and also the location of stations. The bivalve molluscs showed a high degree of organ-specificity in accumulation which might be attributed to the ion exchange activity of mucous membrane covering gill and mantle. Mercury levels in various compartments did not reveal any regular temporal variations but showed a slight increase in the late monsoon months indicating the apparent influence of river run-off and reduction in salinity in the ambient medium. A continuous monitoring programme is recommended in order to clarify the present trend and to establish the studied organisms as indicator species.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Computing 46 (1991), S. 93-119 
    ISSN: 1436-5057
    Keywords: 52.A30 ; 52.A10 ; transversals ; stabbing lines ; algorithms ; complexity ; computational geometry
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Wir stellen einen Algorithmus zur Berechnung der kürzesten Strecke vor, welchen in der Ebene gegebene Geraden oder Strecken schneidet. Die Berechnung erfordertO(nlog2 n) Zeit undO(n) Platz. Falls sich die Strecken nicht schneiden, kann der Zeitbedarf aufO(nlogn) reduziert werden. In Verbindung mit Linearer Optimierung findet der Algorithmus auch die kürzeste Strecke, welchen isothetische Rechtecke schneidet. Hier ist der ZeitbedarfO(nlogk), wobeik die kombinatorische Komplexität des Raumes der Transversalen ist undk≤4n gelten muß. Mögliche Anwendungen der Ergebnisse sind: (1) Bestimmung der kürzestenPass-Linie fürn Datenbereiche, (2) Bestimmung der kürzesten Strecke, von welcher ein konvexesn-Polygon schwach sichtbar ist und (3) Bestimmung der kürzestenSichtlinie eines einfachenn-Polygons, wobei wir auchO(n)-Zeit Algorithmen angeben. Alle Algorithmen beruhen auf der Lösung einer grundlegenden geometrischen Optimierungsaufgabe. Diese ist von selbständigem Interesse und sollte weitere Anwendungen ermöglichen.
    Notes: Abstract We present anO(nlog2 n) time andO(n) space algorithm for computing the shortest line segment that intersects a set ofn given line segments or lines in the plane. If the line segments do not intersect the algorithm may be trimmed to run inO(nlogn) time. Furthermore, in combination with linear programming the algorithm will also find the shortest line segment that intersects a set ofn isothetic rectangles in the plane inO(nlogk) time, wherek is the combinatorial complexity of the space of transversals andk≤4n. These results find application in: (1) line-fitting between a set ofn data ranges where it is desired to obtain the shortestline-of-fit, (2) finding the shortest line segment from which a convexn-vertex polygon is weakly externally visible, and (3) determing the shortestline-of-sight between two edges of a simplen-vertex polygon, for whichO(n) time algorithms are also given. All the algorithms are based on the solution to a new fundamental geometric optimization problem that is of independent interest and should find application in different contexts as well.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    ISSN: 1436-5057
    Keywords: 52.A30 ; 52.A10 ; Intersection radius ; prune-and-search ; algorithms ; complexity ; computational geometry
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Wir bezeichnen als Radius des Durchschnitts einer Menge vonn geometrischen Objekten imd-dimensionalen Euklidischen RaumE d Radius der kleinsten abgeschlossenen Hyperkugel, welche einen nichtleeren Durchschnitt mit allen Objekten besitzt. In der vorliegenden Arbeit beschreiben wir optimale Algorithmen zuer Bestimmung einiger solcher Radien. Zuerst stellen wir einen Algorithmus mit linearem Zeitbedarf vor, wenn die Objekte Hyperebenen inE d mit festemd sind. Er beruht auf der Reduktion des Problems auf eine (d+1)-dimensionale Lineare Optimierungsaufgabe mit 2n linearen Nebenbedingungen. Wir beschreiben auch die Lösung des Durchschnitts-Radius Problems fürn Strecken in der Ebene. Dazu benutzen wir neben Breitensuche die Ersetzung von Halbstrahlen durch Punkte oder Gerade. Bisher waren keine Algorithmen bekannt, welche diese Probleme in den gleichen Zeitschranken lösen.
    Notes: Abstract The intersection radius of a set ofn geometrical objects in ad-dimensional Euclidean space,E d , is the radius of the smallest closed hypersphere that intersects all the objects of the set. In this paper, we describe optimal algorithms for some intersection radius problems. We first present a linear-time algorithm to determine the smallest closed hypersphere that intersects a set of hyperplanes inE d , assumingd to be a fixed parameter. This is done by reducing the problem to a linear programming problem in a (d+1)-dimensional space, involving 2n linear constraints. We also show how the prune-and-search technique, coupled with the strategy of replacing a ray by a point or a line can be used to solve, in linear time, the intersection radius problem for a set ofn line segments in the plane. Currently, no algorithms are known that solve these intersection radius problems within the same time bounds.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...