Simulation of ultrasonic-vibration drawing using the finite element method (FEM)

In ultrasonic-vibration drawing, wires are drawn while ultrasonic vibration is applied to a drawing die. Prior studies provide experimental proof that ultrasonic-vibration drawing reduces drawing resistance, improves lubrication and prevents wire breakage. In the future, ultrasonic-vibration drawing is expected to contribute to the drawing of difficult-to-draw materials and operations, such as shaped wires, ultrafine wires, and the wire drawing operation in semidry or dry condition. However, a detailed analysis and understanding of the mechanism of improvement is not possible on the basis of conventional experimental observations because the ultrasonic-vibration processing phenomenon occurs at high speed. Therefore, we attempted to understand the processing mechanism of ultrasonic-vibration drawing using the finite element method (FEM). ABAQUS was used for the FEM. Drawing force and stress–strain distributions in drawn wires were analyzed. From these studies, we quantitatively clarified the mechanism of improved drawing characteristics, such as decreased drawing force.     

Generalized measuring-worm algorithm: high-accuracy mapping and movement via cooperating swarm robots

Recently, many extensive studies have been conducted on robot control via self-positioning estimation techniques. In the simultaneous localization and mapping (SLAM) method, which is one approach to self-positioning estimation, robots generally use both autonomous position information from internal sensors and observed information on external landmarks. SLAM can yield higher accuracy positioning estimations depending on the number of landmarks; however, this technique involves a degree of uncertainty and has a high computational cost, because it utilizes image processing to detect and recognize landmarks. To overcome this problem, we propose a state-of-the-art method called a generalized measuring-worm (GMW) algorithm for map creation and position estimation, which uses multiple cooperating robots that serve as moving landmarks for each other. This approach allows problems of uncertainty and computational cost to be overcome, because a robot must find only a simple two-dimensional marker rather than feature-point landmarks. In the GMW method, the robots are given a two-dimensional marker of known shape and size and use a front-positioned camera to determine the marker distance and direction. The robots use this information to estimate each other’s positions and to calibrate their movement. To evaluate the proposed method experimentally, we fabricated two real robots and observed their behavior in an indoor environment. The experimental results revealed that the distance measurement and control error could be reduced to less than 3 %.     

High‐pixel‐rate grating‐light‐valve laser projector

Abstract— A high‐pixel‐rate, high‐contrast (30,000:1) wide‐color‐gamut grating‐light‐valve laser projector is reported. A new optical engine enabling high‐frame‐rate (240 Hz) scan projection is employed. Panoramic wide‐angle‐scan projection with a 64:9 aspect ratio was also developed. Speckle noise is eliminated using a simple but highly efficient technique. The optical throughput efficiency of the grating‐light‐valve laser projector is reviewed.     

Patient with unusual Hutchinson-Gilford syndrome (progeria)

A patient with unusual Hutchinson-Gilford syndrome (progeria) is reported. This 7-year-old boy had all the characteristics of progeria, except for coxa valga and the "horse-riding" stance. A previous cerebral infarction was detected in the right putamen on cranial magnetic resonance imaging. During treadmill exercise test electrocardiography, ST depression suggested the existence of arteriosclerotic lesions. Skin fibroblast culture exhibited 76% DNA-repair capacity compared to normal. He has not manifested endocrinologic abnormalities. From these findings it is concluded that this patient has an incomplete case of Hutchinson-Gilford syndrome and that a correlation may exist between the clinical features and the degree of DNA-repair capacity.     

Chemical nature of larval osmeterial secretions of papilionid butterflies in the generaParnassius,Sericinus andPachliopta

Volatile components of the larval osmeterial secretion ofParnassius glacialis (Parnassiinae, Parnassiini) consisted of isobutyric acid, 2-methylbutyric acid, and their methyl esters. In contrast, the osmeterial exudate ofSericinus montela (Parnassiinae, Zerynthiini) was characterized as monoterpene hydrocarbons comprising-myrcene (Major),-pinene, sabinene, limonene, and-phellandrene, whereas that ofPachliopta aristolochiae (Papilioninae, Troidini) was composed of numerous sesquiterpene hydrocarbons, including-himachalene,-amorphene, and germacrene-A, and a few oxygenated sesquiterpenoids. In these three species, the chemical nature of the secretions of the last and the penultimate instars was essentially of similar quality, suggesting that the three genera,Parnassius, Sericinus, andPachliopta, are assigned to homogeneous types.     

In situ measurements of ion-exchange processes in single polymer particles: laser trapping microspectroscopy and confocal fluorescence microspectroscopy

Ion-exchange processes of a cationic dye (Rhodamine B; RhB) were studied for individual polymer particles (diameter of 16-20 μm) by laser trapping microspectroscopy and confocal fluorescence laser microspectroscopy. The absorbance of RhB at 565 nm adsorbed on a cation-exchange particle increased linearly with the concentration of RhB in the aqueous phase, while it was independent of the particle diameter. Fluorescence intensity profile measurements of RhB along the particle diameter by confocal fluorescence microspectroscopy directly proved that ion exchange took place in the surface layer (～2-μm thickness) of the particle in the initial stage (1 h). Diffusion of RhB in the particle was very slow, and ion exchange proceeded gradually to the inner volume in the order of days. The ion-exchange processes were analyzed on the basis of simulation of the time course of the concentration profile of RhB in the particle, and the diffusion coefficient of RhB was determined to be (2-4) × 10(-11) cm(2)·s(-1).     

Sudden death of adults in Japan

Epidemiological features, risk factors and preventive methods of sudden death (SD) derived from studies the authors have performed since 1987 together with colleagues in Niigata University School of Medicine were reviewed. When SD was defined as death occurring within 24 hours of the onset of symptoms, the annual incidence was 145/100,000 for people aged 15 years and older in Niigata Prefecture. The incidence increased sharply along with the advance of age, while the proportion of SD to natural death due to circulatory diseases was higher in younger people. Though diseases of the circulatory system made up approximately 90 percent of all causes of death, SD due to ischemic heart disease was less frequent in Japan than in western countries. SD showed various patterns in seasonal and "within-a-day" occurrences according to sex, age and cause of death. The months of the highest SD occurrence differed by occupation and matched the busiest work periods. A decrease in sleeping hours and mental stress experienced during the preceding week were related to the occurrence of both sudden death and non-fatal acute myocardial infarction. People having structural circulatory diseases were shown to be predisposed to SD when stress occurred, because fatal arrhythmia is easily induced by the above factors in such people. Health examinations were shown to have preventive effects, though limited, against SD. Differences in the resuscitated rates in cases where a witness was present and where one was not indicates that educating people about correct resuscitation methods is important to minimizing SD.     

Logic programming for combinatorial problems

Combinatorial problems appear in many areas in science, engineering, biomedicine, business, and operations research. This article presents a new intelligent computing approach for solving combinatorial problems, involving permutations and combinations, by incorporating logic programming. An overview of applied combinatorial problems in various domains is given. Such computationally hard and popular combinatorial problems as the traveling salesman problem are discussed to illustrate the usefulness of the logic programming approach. Detailed discussions of implementation of combinatorial problems with time complexity analyses are presented in Prolog, the standard language of logic programming. These programs can be easily integrated into other systems to implement logic programming in combinatorics.     

New dissimilarity measure for recognizing noisy subsequence trees

Tree is a data structure used to express various objects such as semistructured data and genes. When objects are represented as trees, computing tree similarity is essential for pattern recognition and retrieval. This paper considers the noisy subsequence tree recognition problem whose purpose is to recognize the original tree, given its noisy subsequence tree. Previous research on this problem relied on constrained tree edit distance to measure the dissimilarity. However, the number of relabelings must be predetermined to compute it. This paper proposes a new dissimilarity measure for this problem. Our dissimilarity measure is obtained by counting the node edit operations included in the unit‐cost tree edit distance that contribute to the matching of node labels. The number of relabelings need not be specified to compute our dissimilarity measure. Moreover, our measure achieves more accurate recognition performance and faster execution speed than the constrained tree edit distance. Our measure is also useful to solve the tree inclusion problem which is the problem of deciding whether a tree includes another tree and shows the extent of approximate tree inclusion when a tree incompletely includes another tree. © 2011 Wiley Periodicals, Inc.