This paper proposes an advanced method of geocoding for walking directions in documents using daily local expressions. Walking directions are usually described in casual expressions, but not in regular ones like address. Thus, it has been considered practically impossible to geocode walking directions. However, sidewalk network databases in major cities of Japan have been available for human na...

We describe a simple and robust method to construct complex three-dimensional (3D) structures by using short synthetic DNA strands that we call "DNA bricks." In one-step annealing reactions, bricks with hundreds of distinct sequences self-assemble into prescribed 3D shapes. Each 32-nucleotide brick is a modular component; it binds to four local neighbors and can be removed or added independentl...

External walls made with hollow clay brick or block are widely used for their thermal, acoustic and structural properties. However, the performance of the bricks frequently does not conform with the minimum legal requirements or the values required for high efficiency buildings, and for this reason, they need to be integrated with layers of thermal insulation. In this paper, the thermal behavio...

Loose particles on impervious surfaces are an important carrier to transfer pesticides into residential runoff water and subsequently contribute to contamination of urban streams and estuaries by urban-use pesticides. However, data regarding levels of pesticide contamination in the runoff-transferable dusts are scarce and their runoff potential and toxicity impacts to urban watersheds still rem...

In 1987, Lovv asz conjectured that every brick G diierent from K 4 , C 6 , and the Petersen graph has an edge e such that G e is a matching covered graph with exactly one brick. Lovv asz and Vempala announced a proof of this conjecture in 1994. Their paper is under preparation. We present here an independent proof of their theorem. We shall in fact prove that if G is any brick diierent from K 4...