1,261 research outputs found
Hiroyuki Suzuki (1945–2014)
No full textWe must bring to you all a very heartbreaking notice of the sudden and totally unexpected loss of a giant, our beloved and most admired Professor Hiroyuki Suzuki, who was not only the former and first president of docomomo Japan but also a Professor Emeritus of The University of Tokyo, Professor at Aoyama Gakuin University Graduate School and the General Director of the Museum Meiji-Mura (a major outdoor architectural museum)
Microbial community in a geothermal aquifer associated with the subsurface of the Great Artesian Basin, Australia.
No full textTo investigate the biomass and phylogenetic diversity of the microbial community inhabiting the deep aquifer of the Great Artesian Basin (GAB), geothermal groundwater gushing out from the aquifer was sampled and analyzed. Microbial cells in the groundwater were stained with acridine orange and directly counted by epifluorescence microscopy. Microbial cells were present at a density of 108-109 cells per liter of groundwater. Archaeal and bacterial small-subunit rRNA genes (rDNAs) were amplified by PCR with Archaea- and Bacteria-specific primer sets, and clone libraries were constructed separately. A total of 59 clones were analyzed in archaeal and bacterial 16S rDNA libraries, respectively. The archaeal 16S rDNA clones were divided into nine operated taxonomic units (OTUs) by restriction fragment length polymorphism. These OTUs were closely related to the methanogenic genera Methanospirillum and Methanosaeta, the heterotrophic genus Thermoplasma, or miscellaneous crenarchaeota group. More than one-half of the archaeal clones (59% of total 59 clones) were placed beside phylogenetic clusters of methanogens. The majority of the methanogen-related clones (83%) was closely related to a group of hydrogenotrophic methanogens (genus Methanospirillum). The bacterial OTUs branched into seven phylogenetic clusters related to hydrogen-oxidizing thermophiles in the genera Hydrogenobacter and Hydrogenophilus, a sulfate-reducing thermophile in the genus Thermodesulfovibrio, chemoheterotropic bacteria in the genera Thermus and Aquaspirillum, or the candidate division OP10. Clones closely related to the thermophilic hydrogen-oxidizers in the genera Hydrogenobacter and Hydrogenophilus were dominant in the bacterial clone library (37% of a total of 59 clones). The dominancy of hydrogen-users strongly suggested that H2 plays an important role as a primary substrate in the microbial ecosystem of this deep geothermal aquifer.No Full Tex
<Book reviews>AKAGAMI, Hiroyuki, The Sociology of Counterfactuals: 'What Ifs' of History
No full textNon-Collimatorによるシンチグラムの画像復元について
No full textWe have conducted an experiment on restoring scintigram images obtained without the use of collimators. Uncollimated images of liver slice phantoms filled with 99mTc were taken at a phantom-camera distance of 0 cm. The sensitivity under these conditions was about one thousand times higher than that using a low-energy high-resolution collimator. Uncollimated images were restored using unsharp masking in combination with spatial filtering. The unsharp masking process involved subtracting two images taken at phantom-camera distances of 0 and 2.3 cm to produce a difference image. The mean squared errors found were 0.56 for the uncollimated images, 0.54 for the images processed with the spatial filter only, and 0.53 for the images produced using unsharp masking followed by spatial filtering. Thus, the images processed using both unsharp masking and the spatial filter bore the closest resemblance to the actual images. Also, since this method was capable of revealing the shape of the phantom, it may already be usable for imaging large lesions, such as in lung perfusion scintigraphy.「久保直樹，花田博之著：Non-Collimatorによるシンチグラムの画像復元について, 北海道大学医療技術短期大学部紀要，8, p.151-156(1995)」の英訳
Data for ''First simulations of day-to-day variability of mid-latitude sporadic E layer structures''
No full textOne file was added on July 21, 2020. (Caiondensity_average.nc)Two files were added on August 3, 2020. (ReadMe2_si_grl.pdf, S1.txt)The title was changed on August 3, 2020. (Before: Simulated Calcium Ion Density)One author was added on August 3, 2020. (Shinagawa Hiroyuki)ReadMe file was replaced on October 13, 2020.Two files were deleted on October 13, 2020. (ReadMe2_si_grl.pdf, S1.txt)Three files were added on October 13, 2020. (MeridionalWind_fig1.txt, VerticalWind_fig1.txt, ZonalWind_fig1.txt
Mid-Air Ultrasonic Stimulations of the Palm - The Influence of Frequency and Stimulus Duration on Perceived Intensity
No full textIt is known that the duration of a short stimulus affects the perceived intensity of both visual, auditory, and, vibrotactile events, but it is still unclear whether such a relationship also exists for mid-air ultrasonic inputs to the hand. Here we investigate this issue and show how the perceived intensity of focused ultrasonic stimulations of the palm is indeed systematically related to stimulus duration - a relationship that is, however, independent of modulation frequency. This is an important finding for the overall goal of providing perceptually stronger inputs and enlarging the repertoire of realistic mid-air haptic experiences.Human Information Communication Desig
Average-case linear-time similar substring searching by the q-gram distance
No full textIn this paper we consider the problem of similar substring searching in the q-gram distance. The q-gram distance d(q)(x, y) is a similarity measure between two strings x and y defined by the number of different q-grams between them. The distance can be used instead of the edit distance due to its lower computation cost, O(|x| + |Y|) vs. O(|x||Y|). and its good approximation for the edit distance. However, if this distance is applied to the problem of finding all similar strings, in a long text t, to a given pattern p, the total computation cost is sometimes not acceptable. Ukkonen already proposed two fast algorithms: one with an array and the other with a tree. When "similar" means k or less in dq, their time complexities are O(|t|k + |P|) and O(|t| log k + |p|). respectively. In this paper, we propose two algorithms of average-case complexity O(|t| + |p|). although their worst-case complexities are still O(|t|k + |P|) and O(|t| log k + |p|). respectively. The linearity of the average-case complexity is analyzed under the assumption of random sampling of t and the condition that q is larger than a threshold. The algorithms exploit the fact that similar substrings in t are often found at very close positions if the beginning positions of the substrings are close. In the second proposed algorithm, we adopted a doubly-linked list supported by an array and a search tree to search for a list element in O(log k) time. Experimental results support their theoretical average-case complexities. (C) 2014 Elsevier B.V. All rights reserved
Specific Problems With Accidental Deaths in Japan – Cardiac Arrest From Hot Baths and Foreign Body Airway Obstruction in Elders –
No full textCOMPUTER PROCESSING OF RI IMAGES BY USE OF LOW-PASS FILTERS (I) : LOW-PASS DIGITAL FILTER SYNTHESIS
No full textCOMPUTER PROCESSING OF RI IMAGES BY USE OF LOW-PASS FILTERS (II) : FILTERINGS AND SUBTRACTIONS
No full text- …
