bluuebunny/crossref_metadata_2025 huggingface dataset:
A predictor of unfavourable outcome in neutropenic paediatric patients presenting with fever of unknown origin
Authors: Semeraro Michaela , Thomée Caroline , Rolland Estelle , Le Deley Marie Cecile , Rosselini David , Troalen Frederic , Amoroso Loredana , Dubrel Marie , Hartmann Olivier
Published: November 2009

Background

No sensitive, specific marker able to discriminate favourable or unfavourable outcome of fever of unknown origin (FUO) at diagnosis has been identified. Procalcitonin, a recently assessed infection marker, may be useful in predicting the outcome of FUO.

Methods

We conducted a prospective study examining the following variables: age 0.5–22 years; solid tumour diagnosis; chemotherapy‐related grade‐4 febrile neutropenia (FN). A complete clinical, bacteriological and biological evaluation was performed at hospital admission (H0). Other investigations depended on clinical status. FUO was considered to be of unfavourable outcome if the fever was persistent or re‐appeared at day 3 (or later), or if secondary clinical or microbiological infection occurred. To validate the results of the analysis the data set was randomly split into a training set and a validation set.

Results

Out of 172 episodes of FN, 136 episodes were classified as FUO (80%). Seventy‐two (53%) were included in this study. PCT values were significantly higher in episodes of unfavourable outcome (P < 0.001). None of the other prediction candidates appeared to be significantly linked to the risk of unfavourable outcome. In the validation set, the best PCT cut‐off was 0.12 µ/L, which was associated with a sensitivity of 80% and specificity of 64%.

Conclusions

PCT‐H0 level can predict FUO outcome. A protocol based on PCT‐H0 measurement, integrating clinical and bacteriological evaluation, facilitates shorter hospital stays and less antibiotic treatment. Patients with a PCT‐H0 value <0.12 µ/L could benefit from an outpatient treatment starting at H48 thus reducing hospitalisation costs and improving quality of life. Pediatr Blood Cancer 2010;54:284–290. © 2009 Wiley‐Liss, Inc.
Resistance of stem‐like cells from neuroblastoma cell lines to commonly used chemotherapeutic agents
Authors: Vangipuram Sharada D. , Wang Zhihong J. , Lyman William D.
Published: November 2009

Background

Cancer stem cell theory suggests that the presence of tumor initiating stem‐like cells in cancers may be responsible for cancer progression and relapse. CD133 cell surface maker expression has been used to identify stem‐like cells in cancer cell lines. Our goal was to identify such cells in neuroblastoma cell lines and to study the cytotoxicity of common anticancer drugs for those cells.

Materials and Methods

CD133+ cells from SK‐N‐SH and SK‐N‐BE cell lines were isolated using magnetic microbeads. Cytotoxicity of four anticancer drugs was studied on CD133+ and CD133− populations. The percentage of live, apoptotic, and dead cells in each population after drug treatment was estimated by MTT and PI/Annexin‐binding assays. Western blot analyses were used to identify differences in the expression of kinases.

Results

Eight to 10% of SK‐N‐SH and 3–5% of SK‐N‐BE cells were CD133+. These cells were more resistant than CD133− cells to all four chemotherapeutic agents tested in the MTT assay. Decreased apoptosis was observed in CD133+ cells compared to CD133− cells by PI/Annexin V‐binding assay. Western blot analysis showed that CD133+ cells expressed less MKP‐1. Phosphorylated forms of both ERK and P‐38 kinases were expressed at higher levels in CD133+ cells than in CD133− cells.

Conclusions

This study suggests that CD133+ cells are more resistant to anticancer drugs than CD133− cells. Differences in the expression and phosphorylation of kinases could be partially responsible for this difference. Targeting CD133‐expressing cells could be a strategy to develop more effective treatments for neuroblastoma. Pediatr Blood Cancer 2010;54:361–368. © 2009 Wiley‐Liss, Inc.
Crystallization behavior of PIPD/nylon 6 blends
Authors: Yu Kejing , Du Zhongjie , Li Hangquan , Zhang Chen
Published: November 2009

Blends of poly‐ε‐caprolactam (nylon6) and poly{2,6‐diimidazo[4,5‐b:4′5′‐e]pyridinylene‐1,4(2,5‐dihydroxy) phenylene} (PIPD/nylon 6) have been prepared via a controlled polymer solution crystallization method. The crystallization behavior of nylon 6 in the blends was investigated using differential scanning calorimetry (DSC), x‐ray diffraction (XRD), and polarizing microscopy (PLM). The results indicated that the presence of PIPD inhibited the nucleation rate of the crystallization of nylon 6, resulting in reduction in crystallization temperature, degree of crystallinity, and the perfection of crystal. Such influence was attributed to the formation of hydrogen bonds between nylon 6 and PIPD molecules. POLYM. ENG. SCI., 2010. © 2009 Society of Plastics Engineers
Thermal and electrical behavior of polyimide/silica hybrid thin films
Authors: Hamciuc Elena , Hamciuc Corneliu , Olariu Marius
Published: November 2009

Silica‐containing polyimide films were prepared by sol‐gel technique using a poly(amic acid) and tetraethoxysilane. The poly(amic acid) was synthesized by solution polycondensation reaction of 4,4′‐oxydiphthalic anhydride with 2,6‐bis(3‐aminophenoxy)benzene and an aminosilane coupling agent, 3‐aminopropyltriethoxysilane. The properties of these films, such as water vapors sorption capacity, dynamic contact angles and contact angle hysteresis, thermal, and electrical behavior have been evaluated with respect to their structure. The polymer films exhibited good thermal stability having the initial decomposition temperature above 450°C, glass transition temperature in the range of 223−228°C, and low‐dielectric constant in the range of 2.64−3.16. Two subglass transitions, γ and β, were evidenced by dynamic mechanical analysis and dielectric spectroscopy. The surface morphology and the roughness were investigated by atomic force microscopy and scanning electron microscopy. POLYM. ENG. SCI., 2010. © 2009 Society of Plastics Engineers
Determination of plane‐strain fracture toughness of polyethylene copolymer based on the concept of essential work of fracture
Authors: Ben Jar P.‐Y. , Adianto Riski
Published: November 2009

Toughness and deformation capacity of six polyethylene copolymers in plane‐strain fracture were characterized using the concept of essential work of fracture (EWF). Two types of regression analysis were considered: one based on the traditional, total work of fracture, while the other on the energy partition to extract the portion that is relevant to the plane‐strain fracture. In particular, the latter analysis excludes energy that is for the final stretch of the surface flanks and produces toughness values that are smaller than those determined based on the total work of fracture. The study found that two types of analysis rank the copolymers in different orders. Based on the results from the energy‐partition approach, the article discusses the influence of material characteristics (molecular weight, branch concentration, density, etc.) on the plane‐strain fracture toughness of the polyethylene copolymers. POLYM. ENG. SCI., 2010. © 2009 Society of Plastics Engineers
Micromechanical modeling of the mechanical behavior of thermoplastic olefin
Authors: Ma Qiu , Tibbenham Patricia C. , Lai Xinmin , Glogovsky Todd , Su Xuming
Published: November 2009

The aim of this study was to investigate the mechanical behavior and to develop a micromechanical model for thermoplastic olefin (TPO). The TPO with varying ratios of polypropylene (PP)/rubber/talc were prepared in a twin‐screw extruder. The mechanical behavior was studied through a series of tensile tests at different strain rates. Considering TPO as a composite consisting of PP matrix, rubber phase, and talc phase, the effective self‐consistent method was used to predict material Young's modulus, and an averaging method was used to predict yield stress. Comparisons between predictions and experiments showed that the models capture the elastic behavior of TPO accurately. POLYM. ENG. SCI., 2010. © 2009 Society of Plastics Engineers
School mental health and prevention science in the Baltimore City schools
Authors: Weist Mark D. , Stiegler Kerri , Stephan Sharon , Cox Jennifer , Vaughan Courtney
Published: November 2009

This article provides background on school mental health (SMH) programs in Baltimore and efforts to integrate evidence‐based preventive interventions into the schools served by these programs. We describe the triangular model of SMH promotion, building at the base from environment and relationship enhancement, followed by universal and selective prevention, efforts taken at each of these levels, challenges experienced, and ideas for overcoming challenges. The agenda to integrate evidence‐based preventive interventions into schools offers much promise for improving valued outcomes for students and schools. This is a difficult agenda, however, with many dimensions, including program infrastructure, training, building and sustaining school administrator and staff support, and addressing competing contingencies and tendencies toward drift. Better linkage between SMH, prevention science, and implementation science is called for. © 2009 Wiley Periodicals, Inc.
Training the next generation of school professionals to be prevention scientists: The Missouri Prevention Center model
Authors: Reinke Wendy M. , Herman Keith C. , Stormont Melissa , Brooks Constance , Darney Dana
Published: November 2009

Empirically supported school‐based programs have been shown to reduce the present and future risk for various emotional disturbances. Unfortunately, few of these programs have been successfully transported or maintained outside the context of controlled research studies. Central to attaining this goal is the pressing need to train the next generation of school psychology faculty leaders, versed in evidence‐based practices (EBPs), who can train school personnel to deliver existing EBPs, design and develop innovative new practices, and conduct rigorous research to evaluate the effectiveness of these practices. In part to address this critical need, we developed the Missouri Prevention Center (MPC). In this article we describe the training, service, and research activities associated with MPC. The Center works toward supporting a high‐quality training program for school psychologists who will lead the nation, state, and individual school districts in overcoming barriers to using EBPs in schools. © 2009 Wiley Periodicals, Inc.
Ligth induced bleaching and absorption kinetics in highly excited InN layers
Authors: Nargelas Saulius , Aleksiejūnas Ramūnas , Jarašiūnas Kęstutis , Vengris Mikas
Published: November 2009

We study the carrier recombination in highly excited InN epilayers by means of femtosecond differential transmission technique. The light induced bleaching or absorption is observed by tuning the probe photon energy by 100‐200 meV above or below the bandgap. The induced absorption decays roughly twice faster than the induced bleaching at the absorption edge. We conclude that the induced absorption kinetics show dynamics of the overall excess carrier population, while the bleaching at the absorption edge is related to carrier recombination in the band tails. Lifetime τ of absorption decay is inversely dependent on the total electron density τ=B*·(n0+N) with B*=4×10–10 cm3/s, which agrees well with the results of previous measurements. High B* value cannot be attributed to band‐to‐band recombination and supports the assumption that defect‐assisted Auger is the dominant nonlinear recombination process in InN. (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
Field effect transistors for terahertz imaging
Authors: Knap Wojciech , Valušis Gintaras , Łusakowski Jerzy , Coquillat Dominique , Teppe Frederic , Dyakonova Nina , Nadar Salman , Karpierz Krzysztof , Bialek Marcin , Seliuta Dalius , Kašalynas Irmantas , Fatimy Abdel El
Published: November 2009

Resonant frequencies of the two‐dimensional plasma in field effect transistors (FETs) increase with the reduction of the channel dimensions and can reach the terahertz (THz) range for micrometer and sub‐micrometer channel lengths. Nonlinearity of the gated electron gas in the transistor channel can be used for the detection of THz radiation. The possibility of tuneable narrow band detection in sub‐THz and THz range, related to plasma resonances, has been demonstrated for nanometre gate length transistors at cryogenic temperatures. At room temperatures the plasma oscillations are usually strongly damped, but field effect transistors can still operate as an efficient broadband detectors in the THz range. We present an overview of experimental results on THz detection by field effect transistors made of III‐V and Si materials, The material issue is discussed and first room applications of FETs for imaging at frequencies above 1 THz are demonstrated. (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
Phase transitions in modified Na1/2Bi1/2TiO3‐SrTiO3 solid solutions
Authors: Birks Eriks , Dunce Marija , Antonova Maija , Sternberg Andris
Published: November 2009

Continuous transfer from relaxor to normal ferroelectric phase transition is found in Na1/2Bi1/2TiO3‐SrTiO3‐PbTiO3 if concentration of PbTiO3 increases. The relaxor properties in NBT solid solutions are described by the power law and Vogel‐Fulcher relationship, and concentration dependence of the relevant parameters is discussed. (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
Optical properties of diamond like carbon and diamond like nanocomposite films
Authors: Tamulevičienė Asta , Meškinis Šarūnas , Kopustinskas Vitoldas , Tamulevičius Sigitas
Published: November 2009

Diamond‐like carbon (DLC) films are at the top of the significant interest due to their exceptional mechanical, chemical, optical and electrical properties as well as possibility of the room temperature deposition. Particularly, optical transmittance as well as electrical conductivity of these films can be changed in very wide range by setting appropriate synthesis conditions.

In the present study diamond‐like carbon and diamond like nanocomposite films were deposited by RF plasma enhanced chemical vapor deposition (PECVD) using methane, acetylene and hexamethyldisiloxane (HMDSO) precursors. Effects of the applied bias voltage during deposition were investigated. (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
A theoretical analysis of topography and molecular parameters of the CFCl3···O3 complex: Linear and bifurcate halogen‐oxygen bonding interactions
Authors: de Oliveira Boaz Galdino , de Araújo Regiane de Cássia Maritan Ugulino , Leite Elisa Soares , Ramos Mozart Neves
Published: November 2009

A theoretical analysis of linear and bifurcate halogen‐oxygen bonds is presented in this work. B3LYP/6‐311++G(d,p) and MP2/6‐311++G(d,p) calculations were used to determine the optimized geometries of intermolecular systems formed by CFCl3 and O3. Molecular properties often analyzed in hydrogen‐bonded complexes were used here to describe the interaction between chlorine (CFCl3) and oxygen (O3). The halogen‐oxygen bond in the CFCl3···O3 complex was characterized using the topological parameters derived from the quantum theory of atoms in molecules. © 2009 Wiley Periodicals, Inc. Int J Quantum Chem, 2011
An ONIOM and DFT study of water adsorption on rutile TiO2 (110) cluster
Authors: Erdogan Rezan , Fellah Mehmet Ferdi , Onal Isik
Published: November 2009

Density functional theory (DFT) calculations performed at ONIOM DFT B3LYP/6‐31G**‐MD/UFF level are employed to study molecular and dissociative water adsorption on rutile TiO2 (110) surface represented by partially relaxed Ti25O37 ONIOM cluster. DFT calculations indicate that dissociative water adsorption is not favorable because of high activation barrier (23.2 kcal/mol). The adsorption energy and vibration frequency of both molecularly and dissociatively adsorbed water molecule on rutile TiO2 (110) surface compare well with the values reported in the literature. © 2009 Wiley Periodicals, Inc. Int J Quantum Chem, 2011
Density functional theory study of geometry and stability of small Zrn (n = 2–10) clusters
Authors: Wang Xiao‐Qing , Jiang Zhen‐Yi , Li Jun‐Qian , He Qing‐Li , Chu San‐Yan
Published: November 2009

Geometric structures, electronic properties, and stabilities of small Zrn and Zr (n = 2–10) clusters have been investigated using density functional theory with effective core potential LanL2DZ basis set. For both neutral and charged systems, several isomers and different multiplicities were studied to determine the lowest energy structures. Many most stable states with high symmetry were found for small Zrn clusters. The most stable structures and symmetries of Zr clusters are the same as the neutral ones except n = 4 and 7. We found that the clusters with n > 3 possess highly compact structures. The clusters are inclined to form the caged‐liked geometry containing pentagonal structures for n > 8, which is in favor of energy. From the formation energy and second‐order energy difference, we obtained that 2‐, 5‐, 7‐atoms of neutral and 4‐, 7‐atoms cationic clusters are the magic numbers. Furthermore, the highest occupied molecular orbital‐lowest unoccupied molecular orbital gaps display that the Zr3, Zr6, Zr, and Zr are more stable in chemical stability. © 2009 Wiley Periodicals, Inc. Int J Quantum Chem, 2011
Effects of different basis sets and donor‐acceptor groups on linear and second‐order nonlinear optical properties and molecular frontier orbital energies
Authors: Avci Davut , Başoğlu Adi̇l , Atalay Yusuf
Published: November 2009

The calculation of molecular hyperpolarizability, molecular frontier orbital energies of some donor‐acceptor oxadiazoles (5a–f, 8a–f, and 9a–f) have been investigated using ab initio methods and different basis sets. Ab initio optimizations were performed at the Hartree–Fock (HF) and density functional (Beckee‐3–Lee–Yang–Parr; B3LYP) levels of theory with 6‐31G basis set. The polarizability (<α>), anisotropy of polarizability (Δα), and ground‐state dipole moment (μ), first hyperpolarizability (β), and molecular frontier orbital (HOMO, highest occupied molecular orbital and LUMO, lowest unoccupied molecular orbital) energies of 5a–f, 8a–f, and 9a–f have been calculated at the HF and B3LYP methods with 6‐31G, 6‐31G(d), 6‐31+G(d), 6‐31++G(d,p), 6‐311G, 6‐311G(d), 6‐311+G(d), and 6‐311++G(d,p) basis sets. Also, the molecular hardness (η) and electronegativity (χ) parameters have been obtained using molecular frontier orbital energies. The <α>, Δα, μ, β, HOMO, LUMO energies, η and χ parameters have been investigated as dependence on the choice of method and basis set. The variation graphics of <α>, Δα, μ, β, η, and χ parameters using HF and B3LYP methods with different basis sets are presented. We have examined the frontier molecular orbital pictures of 5a–f, 8a–f, and 9a–f using B3LYP/6‐31++G(d,p) level. The 5a–f, 8a–f, and 9a–f display significant linear, second‐order molecular nonlinearity, and molecular parameters and provide the basis for future design of efficient nonlinear optical materials having the 1,3,4‐oxadiazole core. © 2009 Wiley Periodicals, Inc. Int J Quantum Chem, 2011
A Composition Method to Realize Self‐checking Fault Locators
Authors: Namiki Yoshihiro , Koga Yoshiaki
Published: November 2009

A fault locator is a self‐checking functional unit which identifies a faulty module in a self‐checking system constructed with self‐checking modules (subsystems) by collecting and observing the test outputs from each module.

Faulty modules are identified by observing the syndrome corresponding to the preset input code space and identifying to which module fault the input coding subspace corresponds. Since the inputs to the fault locator are given as vectors of the preset coding subspace in this case, there may not be a sufficient number of vectors to self‐test the fault locator. Thus we present a method to construct a self‐checking fault locator by using permuters for inputs to provide sufficient input vectors for self‐testing.
Reduction of Word and Minimal Phrase Candidates for Speech Recognition Based on Phoneme Recognition
Authors: Matsunaga Sho‐Ichi , Kohda Masaki
Published: November 2009

This paper discusses the selection of candidates in speech recognition based on the phoneme recognition. The method is based on the result of phoneme recognition for the part of speech input, for which the segmentation is performed with a high reliability. Using the information concerning the order of the phonemes or phoneme chains, and the information concerning the top and tail phonemes, the candidates are selected. Since only the part for which the segmentation can be performed with a high reliability is used, the candidate reduction has a great effect for the clearly uttered speech, and vice versa. Consequently, the method has the feature that the recognition rate is degraded less by the candidate selection.

First, the proposed selection method is introduced into the word recognition. The candidate selection is applied to all words in the dictionary. A recognition experiment was performed for the cases of the word dictionary composed of 643 city names, with 100 city names uttered by 50 examinees as the input. As a result, the word candidates were reduced to 16 percent, maintaining almost the same recognition performance as in the case without candidate reduction.

Next, the proposed candidate selection is introduced into the phase recognition. In the method, the location of the phoneme to be rejected is estimated in the candidate selection in the derivation of hypothesis, and based on that result, the syntax tree is back‐tracked. An experiment was performed for 235 phrases uttered by 2 examinees. As a result, the phrase candidates were reduced to 21 percent, compared with the case without candidate selection.
Optimization of Multiple Queries in Relational Database Systems
Authors: Miyao Jun'ichi , Tominaga Kazuyuki , Kikuno Tohru , Yoshida Noriyoshi
Published: November 2009

Recently, relational database systems which allow concurrent executions have been developed on mainframes and minicomputers. In such a system, optimization of multiple queries can be performed as an extension of optimization of a single query. By unifying the common operations in the multiple queries, the computation time or the number of disk page fetches can be reduced. In this paper, the optimization of the join operations is considered, since the join operation is the most time‐consuming one in the relational database. A problem (problem JM) is formulated to minimize the number of disk page fetches by unifying the common join operations in multiple queries. The number of page fetches depends on the realization method of a single join operation. In this paper, it is assumed that the join operation follows the nested loops method [4]. This paper proposes a heuristic algorithm for problem JM, and the effectiveness of the method is evaluated by a simulation experiment.
Automatic Rule Extraction from Statistical Data and Fuzzy Tree Search
Authors: Morishima Shigeo , Harashima Hiroshi
Published: November 2009

Generally speaking, it is necessary to extract knowledge from an expert in a given discipline and implement this knowledge into a system when constructing an expert system. However, it is not easy to extract knowledge in such fields as medical diagnosis or pattern recognition because the inference logic depends on the experience and intuition of the expert.

This paper proposes an automatic rule extraction mechanism using statistical analysis. In this system, production rules are expressed in the form of the threshold function. Because the threshold function can describe any kinds of inference logic, it is expressed easily as a linear combination of input vectors and weighting coefficients. Thus weighting coefficients can be calculated by the same method as a discriminant function. If only one threshold is defined, general Boolean logic an be expressed. Moreover, an ambiguous inference rule can be expressed when the threshold levels are multidefined and a membership function is defined at each category.

Further, the Fuzzy Tree Search algorithm which combines ambiguous inference and tree search is proposed at the end of this paper. This algorithm can search and determine an optimum cluster with little calculation and good performance.

In practice, a medical diagnostic system applied to psychiatry which has most ambiguous diagnostic logic, has been constructed based on this algorithm and inference rules have been extracted automatically. By this experiment, Fuzzy Tree Search is as fast as the tree search technique and has as good a performance as a full search clustering technique.
Three—Dimensional Computer Animation by Trigonometric Approximation to Aperiodic Motion
Authors: Agui Takeshi , Sugahara Koichi , Nakajima Masayuki
Published: November 2009

In recent years, computers have been applied widely to produce animation. There have been few tests, however, which aimed at the animation of living objects. The authors have proposed a method of composing animation by primitives based on the approximation by trigonometric functions as a means to construct animation for living objects. By applying the method, animation for the human walking motion was constructed with a satisfactory result. However, the method was limited to the periodic motion on the two‐dimensional plane, and could not cope with the requirement for the animation of complex motion. This paper aims at the application of the trigonometric approximation, and describes a method which applies Fourier expansion after providing a correction to the measured coordinate of the joint. The method was applied to various motions, and satisfactory animation was produced.
The Design and Implementation of Unix‐Based Network System Adopting X.25 Protocol
Authors: Nakajima Tatsuo , Tokoro Mario
Published: November 2009

This paper considers the design and implementation of a Unix‐based global network system named X25 Net: X25 Net uses X.25 protocol and has the following characteristics:

A compatible network interface with Unix 4.2 BSD is provided.

The amount of packet transmission is small.

It is not required to establish additional expensive hardware devices.

We describe the design policy, layer, implementation, and measured performance of X25 Net.
FEAL — Fast Data Encipherment Algorithm
Authors: Shimizu Akihiro , Miyaguchi Shoji
Published: November 2009

This paper discusses the design of the fast data encipherment algorithm (FEAL). FEAL is a conventional encipherment algorithm using the same key for enciphering and deciphering. It is a block cipher algorithm which produces 64 bit ciphertext from 64 plaintext, using a 64‐bit key. The main feature of the cipher processing in FEAL is that it is based on 8‐bit data manipulations such as addition with modulo 256, and data cycle and data transfer commands for 1‐byte. The program performance of FEAL is improved greatly compared with that of DES. The security of FEAL is based on the characteristic value representing the trace of the plaintext and ciphering key remaining in the ciphertext, as well as on the algorithm structure.
A Tomographic Image Reconstruction from Limited View Angle Projection Data
Authors: Kudo Hiroyuki , Saito Tsuneo
Published: November 2009

This paper discusses the tomographic reconstruction processing from the incomplete projection data with limited projection angle, based on the estimation of the missing data by extrapolation. Essentially, there is a kind of correlation, called consistency condition, among the projection data of different directions. Mathematically, it is possible to reconstruct the image by estimating the missing data from the measured data utilizing this correlation. The algorithm proposed in this paper is based on such a mathematical principle. In this kind of inverse problem, however, the measurement noise and the computational error are greatly amplified. By applying the constrained extrapolation, which combines the known information concerning the smoothness of the object image, the processing is stabilized. As a result of the simulation experiment using a model image, it was demonstrated that the proposed method is more useful and practical for this problem, from the viewpoints of the quality of the reconstructed image, the computational complexity, and the stability against the measurement noise.
A Mathematical Formula for Subjective Expression of Visual Patterns
Authors: Iijima Taizo
Published: November 2009

In actual image recognition, one does not always view the whole image, but often subjectively selects a certain subregion on the image to obtain some useful information. This paper clarifies theoretically the reason why such an ability possessed by humans is naturally carried out, by using a mathematical analysis regarding the fundamental properties of a visual pattern. A mathematical formula showing multilayer structures of a visual pattern is obtained by the foregoing analysis. The results obtained in this paper may contribute to elucidating the aspect of the basic process of the feature extraction from the pattern.
Effective Vectorization Techniques for Circuit Analyses on a Vector Computer
Authors: Kage Tetsuro , Shimogori Shintaro
Published: November 2009

This paper presents a vectorization processing method for circuit analyses using a vector computer. It had been difficult in circuit analyses to evaluate device models with an adequately long vector length, which is the most expensive task in the computation. Therefore use of a vector computer could improve the computation time only a few times. In the proposed method, the evaluation of device models is carried out at the level of a basic element and each evaluation is vectorized throughout the circuit matrix. It is shown that neither the forward nor backward substitutions can be ignored in solving a sparse matrix with the LU decomposition method. Therefore, the vectorization is applied to the whole matrix‐solving process. These algorithms are realized in a user‐defined model circuit analysis program FINAP‐VP. As a result, all the main processes of the analysis loop are vectorized with the length of the order of a hundred to ten thousand so that the analysis time for the scalar mode was improved by a factor of more than 10. This paper describes the method of vectorization of the device‐models evaluation and the circuit matrix solution (which are the main process in a circuit analysis). The results of the benchmark tests using the vector‐computer FACOM‐VP, are also described.
Algebraic Specification of Parallel Systems Based on Binary Relations between Events
Authors: Teshima Shigeharu , Hiraishi Hiromi , Yajima Shuzo
Published: November 2009

A new algebraic model is proposed for operational behavior of parallel systems and present syntax and formal semantics of a specification language based on it are presented. In our model, a parallel system is considered to generate events which we consider as primitive operations of the system, not only in a sequence, but also in parallel. To characterize a history of operational behavior formally, we introduce three types of binary relations between events: timing relation, causality relation; and value relation. The history of operational behavior is considered as a set of events which these three relations are given. In a specification of parallel systems, the characteristics are specified which it should satisfy in its history of operational behavior and they are described in a first‐order predicate logic by using the three binary relations. These descriptions can be considered as axioms on the relations. Formal semantics of the specification becomes a maximal set of events which can be deduced from the axioms given as specification and initial value and input patterns of the system. This is proved to be a fix point of the deduction step.
Parallel Processing of Robot Dynamics Simulation Using Optimal Multiprocessor Scheduling Algorithms
Authors: Kasahara Hironori , Iwata Masahiko , Narita Seinosuke , Fujii Hirofumi
Published: November 2009

This paper discusses the parallel processing of real‐time robot dynamics simulation. Real‐time robot dynamics simulation is an indispensable technique for a robot with a high‐level function. It is a computation procedure to determine the robot motion (joint position, speed, acceleration, etc.) for the given torque and driving force at each joint. In the proposed scheme, the optimal multiprocessor scheduling algorithms developed in this paper are employed, and the dynamics of the robot arm with arbitrary shape can be simulated with the minimum processing time on a multiprocessor system composed of an arbitrary number of parallel processors. The effectiveness and the practical usefulness of the proposed parallel processing scheme ire demonstrated on the robot motion simulator using a prototype multiprocessor system. This is the first report of the robot dynamics simulation being realized efficiently by the parallel processing on the real‐time multiprocessor system. Thus it is verified that the multiprocessor robot dynamics simulator with an excellent cost‐performance ratio can be realized.
Curved‐Solid‐Object Input‐System Using Conformal Projection Method
Authors: Nakajima Masayuki , Agui Takeshi , Hanyuda Chiharu
Published: November 2009

One of the important themes in computer graphics is the method of designing an easy data‐input system of 3D objects. The authors proposed, in a previous paper, a polyhedron input system using a projection plane based on a conformal projection method. This paper proposes a new input algorithm for a curved object using the projection plane. Some examples are included.
A High‐speed Optical Bus and Its Design
Authors: Tajima Hiroaki , Suzuki Motohiro , Hamazaki Youichi , Sanechika Noriaki , Okada Yoshikuni , Tamura Kouichirou
Published: November 2009

One of the problems in the construction of a large‐scale multiprocessor system is that a long time is required for the data exchange among such system elements as the processor unit and the memory unit, which degrades the efficiency of the whole system. If the data exchange in such a system is performed by electrical wiring, a limit is imposed on the transmission speed and the reliability. From such a viewpoint, we proposed an optical data exchange system suited to high‐speed large‐capacity communication. The broadcasting optical bus using the cylindrical mirror was developed, and its feasibility was demonstrated by the recently constructed experimental pilot model. This paper presents the design method for the broadcasting optical bus based on the cylindrical mirror and the optical transmitter receivers. Expressions are derived for the optical power distribution on the transmitter receivers and the efficiency of the optical bus. The actual design is shown by an example.
Design Methods for Cascaded Gaussian Filters
Authors: Sato Yoshinobu , Tamura Shinichi
Published: November 2009

This paper considers the multiresolution (in terms of standard deviation) Gaussian filter, which plays an important role in the visual information processing and the signal analysis. A high‐speed and highly accurate method is proposed for Gaussian filtering and calculation of its derivative, using the filter with a recursive structure utilizing the properties of Gaussian function. The earlier method, based on the iterative convolution of Gaussian function, is generalized. The problem is reformulated permitting the variation of the weight coefficient and the scale factor (expansion ratio of standard deviation), to achieve a sufficient accuracy. First, a formulation is made for the continuous system to realize a Gaussian filter and the sequence of its derivative filters for the specified scale factor. Then based on the result, a generation formula is derived for the filter sequence in the discrete system by iterative convolutions with the same weight coefficient. Furthermore, the factors for the error in discrete representation is analyzed, and the condition is derived for suppressing the error.
Mental Model on Telephone Operation
Authors: Matsui Hiroyuki , Yokota Hiroyuki , Tokunaga Yukio
Published: November 2009

According to the recent research results on the user interface, the user forms a certain mental model in the operation of an unknown function. However, it is not known, when the function is not satisfactory in the first trial, by what process the mental model is constructed. From such a viewpoint, the authors investigated experimentally the formation of the mental model in the advanced dialing function called directory dialing.

The following observations were made as a result.

The mental model is constructed only from the operation knowledge already acquired by the user.

When the mental model constructed in the first trial is not acknowledged, the mental model is reconstructed by the following order:

repeat of the same operation;

change operation speed; and

change the operation procedure.

Using these observations, the formation of the mental model in the directory dialing is represented in a flowchart.
Protocol Implementation Support System and Its User Interface
Authors: Takahashi Kaoru , Shiratori Norio , Noguchi Shoichi
Published: November 2009

To increase the productivity of communication software development for information networks, it is necessary to establish the techniques of automatic implementation and verification of protocols. This paper presents a user‐friendly interactive protocol implementation support system which produces software corresponding to a given protocol specification. In this system, when specification is given using a protocol specification language NESDEL, a corresponding program is generated interactively by obtaining necessary information from the user. The programs are written in IDL, a communication software oriented programming language. One of the most important problems in designing this system is how to represent and acquire information necessary to generate software from a protocol. We show that the concept of frame in knowledge engineering is effective in constructing a user‐friendly interface to represent such information and to obtain necessary information from the user.
Brain Control of Voluntary Muscular Activities
Authors: Taguchi Hideo , Munakata Koichi , Kiriyama Koichi , Fujii Katsuhiko
Published: November 2009

The purpose of this paper is to give a clear description of the control scheme for the voluntary muscular activities by the brain. To describe the mechanism of muscular control by the complex central nervous system including the brain, it will be useful to adopt a synthetic approach in which a hypothesis is set for the functional structure of the entire motor center based on the physiological and anatomical findings, and to verify the hypothesis by referring to the observation of the muscular activities. From such a viewpoint, this paper considers first the target tracking by the forearm horizontal flection and extension. The muscular activities of the head of the biceps brachii and the head of the triceps brachii, which play major roles in the flexor and extensor muscles, were examined. It is assumed that a wide range of central mechanisms, from the visual to motor systems, is involved with the tracking forearm movement. From the viewpoint of their functional roles, the central mechanism is divided as follows from the top level: the brain reflex mechanism; the cerebrum‐cerebellum mechanism; reciprocal neural control mechanism and stretch reflex mechanisms; and the activity adjustment mechanism for the motor units, which are the final basic units for motor output. For each of these levels, the physiological findings are arranged with the interpretations from control theory. The model for the central nervous system is thus constructed. Finally, using the constructed model for the central nervous system, the tracking forearm movement is reconstructed. The behavior of the model was verified by simulating the muscular activities.
Recovery of 3D Shape Based on Generalized Symmetry
Authors: Tanaka Toshimitsu , Naito Seiichiro , Takahashi Tokiichiro , Masuda Isao
Published: November 2009

With the widening range of applications of computer graphics, simple methods of feeding graphic information into computers which matches the human senses are demanded. This paper proposes a method of reconstructing a 3D (three‐dimensional) shape from a line drawing by using generalized symmetry. Generalized symmetry is an extended concept of skewed symmetry and represents the synmetrical characteristics of an object in terms of its curvilinear symmetrical axes. First, this paper defines generalized symmetry and describes its property; then it describes an algorithm which reconstructs the 30 shape of an object satisfying the generalized symmetry from an orthographically projected image of the object and such additional information as auxiliary lines. This algorithm produces a description of a 3D shape by using a line drawing and a small amount of additional information. This paper also demonstrates a computer simulation of the reconstruction of a complex 3D shape (such as one described by the generalized cylinder) drawn by using a data tablet.
An Automatic Recognition System for Piping and Instrument Diagrams
Authors: Ishii Mitsuo , Ito Yoshikazu , Yamamoto Masanari , Harada Hiroaki , Iwasaki Michiko
Published: November 2009

This paper describes an automatic diagram input system which reads the handwritten piping and instrument diagram and recognizes the symbol, character, and line drawn on the diagram. The object is a handwritten diagram which is easily understandable by the knowledge of the designer under a very mild constraint. The symbols which are the object of recognition are of more than 200 kinds of various sizes. In addition, a large symbol with unspecified shape may be drawn, and there can be various kinds of lines. To cope with such complex diagrams containing a large amount of handwriting distortions, various diagram processing techniques are proposed. Examples are vector representation with a high accuracy, shaping of various distortions, and the two‐stage segmentation, where line, symbol and character are separated hierarchically from the vectorized figure. Other examples are the symbol recognition combining a decision tree and pattern matching, and recognition dictionary based on automatic generation of distorted patterns. The developed diagram input system is a flexible system, in which new symbols can be additionally registered, and complex handwritten diagrams can be recognized. A test was made for the system using the actually written design diagrams. The result indicated a practically satisfactory performance, where the processing time is 3 to 8 min for an A3 sized diagram by a large‐scale computer and the recognition rate is above 95 percent.
Image Segmentation Based on Distribution of a Measure of Centrality
Authors: Oh Weon Geun , Tsuji Saburo
Published: November 2009

Edge detection can be executed by computer at a high speed and thus lends itself to region extraction. However, the edges detected from most images are imperfect due to noise and broken edges.

This paper presented an edge‐based region segmentation algorithm using a global measurement called degree of centrality. Methods of computing the degree of centrality from the input image, analyzing its distribution and detecting gaps between edges will be described. The spatial relationship of disjoint boundaries and pseudoregions will be analyzed to determine region splitting and/or merging. The performance of the proposed algorithm is demonstrated via experiment using images of an indoor scene.

Advantages of this algorithm include its simple work‐flow, and its ability to perform feature extraction while performing region segmentation.
Estimation of the Reciprocating Point of a Rigid Body Moving Periodically in a Two‐Dimensional Space—An Iterative Method Using a Correspondence between the Forward Path and the Backward Path
Authors: Hayashi Toyohiko , Ogawa Hidemitsu , Iijima Taizo
Published: November 2009

This paper provides a method of estimating a rotation center to analyze kinematically the movement of a rigid body moving periodically in a two‐dimensional (2‐D) space. The rotation center, which is derived from an axis point of the human jaw joint, is defined as a point which moves reciprocally in periodic movement. Accordingly, it is called the reciprocating point. Separating a path of the reciprocating point by its turning point, we can divide the path into two parts—the forward path and the backward path. Both paths are identical and hence it appears that any position in one path has its counterpart in the other path. We show that if we have a function corresponding to a pair of positions mentioned in the foregoing, we can estimate the reciprocating point. Then we derive an algorithm which approximates successively the function and the reciprocating point alternatively. This algorithm is proved to be effective for estimating an axis point of the jaw joint.
Improvement of Video Hardcopy Image Quality by Using Spline Interpolation
Authors: Toraichi Kazuo , Mori Ryoichi , Kamada Masaru , Ishiuchi Satomi , Yang Sai
Published: November 2009

This paper aims at realizing a video hardcopy of a quality required for photographs in an album. A method is proposed for digital image interpolation by which the subjective quality of the static image is improved to the same level as that of the original dynamic image. The goal of the improvement of the subjective quality was set as 1.5 times in terms of the improvement in the resolution in vertical and horizontal directions. The method is based on the bivariate quadratic spline interpolation. By calculating the corresponding impulse response, a digital filter with a high‐speed operation was designed. By simulation and psychovisual experiment, it was verified that the goal of the improvement was achieved.
Class of Queries Processed by Navigation in Network Databases
Authors: Furukawa Tetsuya , Kambayashi Yahiko
Published: November 2009

Queries in network databases are usually processed by navigation. In this paper, queries are classified according to the network structures to be retrieved to process the queries (so‐called query schemas) and the correspondence of navigational capability, the classes of network queries, and the classes of relational queries are discussed. Simple queries are those whose answers are obtained by selection and projection of connections of records. They are divided into tree queries and cyclic queries according to the cyclicity of their query schemas. Simple queries are generalized to join queries whose answers are obtained from the Cartesian product of connections of records. Basic navigation, which produces only connections of records, can process almost all the tree simple queries and queries in some class of tree join queries. Navigation with facility to compare records can process all simple queries including cyclic queries and some class of join queries. If navigation can use variables to compare with the records' values, all simple and join queries can be processed. Natural join queries in the relational model which do not include lossy join are simple queries in the network model. Most queries including the class of relational complete ones can be processed by navigation.
High‐Efficiency Image‐Coding Method Using Vector Quantization and Block Coding
Authors: Nonomura Tomoyuki , Yamashita Kazumi , Satoh Kiyotsugu
Published: November 2009

This paper proposes a high‐efficiency image‐coding method which is a two‐step coding using a vector quantization and an adaptive block coding. This method is equivalent to separate quantizations of low‐ and high‐frequency components of an image signal, and was applied to the luminance signal and monochrome image obtained from a color image. The results show that this method is superior to conventional vector quantization and adaptive block‐coding method. The method was also applied successfully to a color image by converting its R, G and B signals to the Y, u and v signals, and by applying the two‐step coding method to its Y signal (luminance) and the u and v signals (chromatic ones).