bluuebunny/crossref_metadata_2025_split huggingface dataset:
Monitoring internal body heat using water proton chemical shift during a fast spin echo pulse sequence
Authors: Ishihara Yasutoshi , Okamoto Kazuya , Kanamatsu Tomoyuki , Tsukada Yasuzo 
Published: January 2004

AbstractWith the advancements in high‐speed imaging technology in MRI (magnetic resonance imaging), clinically useful images have become obtainable within a short time. On the other hand, internal body heating due to many radio‐frequency magnetic field pulses applied in a short time has become a problem. In efficient data acquisition while ensuring the safety of a test subject, monitoring its internal body temperature during data acquisition is desirable. In this paper, a method of measuring real‐time information regarding temperature changes during image data acquisition that incorporates a temperature measuring method using the temperature dependence (−0.01 ppm/°C) of the water proton chemical shift with a high‐speed imaging method is proposed. The efficacy of the proposed method is demonstrated by showing that it can measure temperature changes with an error of less than 0.5 °C in laboratory experiments using agar phantoms. © 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(2): 49–58, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.10376
Multiroute planning for aircraft using genetic algorithms
Authors: Tanaka Masaharu , Mizoguchi Masanobu , Tange Toshiaki , Takami Isao , Suzuki Shinji 
Published: January 2004

AbstractThis paper proposes a scheme for generating multiple flight routes using genetic algorithms (GAs). In obtaining multiple routes or multiroutes by GAs simultaneously, there is a problem of collisions or near‐misses occurring due to interference between the routes (closeness or intersecting of the routes) when similar routes are generated. The proposed scheme realizes a scheme for searching multiple flight routes without interference by incorporating a method for correcting their fitness on the basis of the neighborhood density for maintaining the variety and the degree of interference or the interference degree for obtaining routes that do not come close to or intersect one another. In addition, this paper proposes a priority candidate preserving strategy that preserves superior multiple individuals for each generation in order to improve the search performance. Computer simulation results confirm that the scheme proposed generates multiple flight routes without interference, indicating its efficacy. © 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(2): 39–48, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.10428
A method for detecting conceptual differences based on correlation between decision trees
Authors: Ohnishi Kensuke , Yoshida Tetsuya , Nishida Shogo 
Published: January 2004

AbstractWhen several people are engaged in cooperative work, conceptual differences resulting from differences in background knowledge or specialized fields can impede the flow of ideas. Previously, the authors have represented user knowledge as a decision tree for when different symbols are used with the same meaning for conceptual differences, or when the same symbols are used with a different meaning. They then worked on detecting conceptual differences by using the differences in the structure of the decision trees. In this paper, the authors describe the problems with conventional methods to detect differences by generating virtual knowledge based on each user's knowledge and then creating a decision tree. As a solution to these problems, they propose a method to detect differences by finding correlations between decision trees in a bottom‐up fashion based on class classification in the decision trees. The authors create a prototype using their proposed method, and then confirm in experiments on a case involving the diagnosis of a motor failure that detection precision rises. © 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(2): 25–38, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.10430
Approximation of probability distribution functions by Coxian distribution to evaluate multimedia systems
Authors: Sasaki Yukie , Imai Hiroei , Tsunoyama Masahiro , Ishii Ikuo 
Published: January 2004

AbstractIt has been reported in several studies that the probability distribution functions for interarrival times of tasks in multimedia systems cannot be represented by traditional probability distribution functions, such as exponential ones.In this paper we propose an approximation method, based on the Coxian distribution function, to calculate the probability distribution functions used in analyzing multimedia systems. Although the Coxian function can represent arbitrary distribution functions, it is difficult to determine their parameters directly from a given distribution function. In this work, this drawback is remedied by first approximating the given distribution function with a linear combination of Erlang function, and then converting it to a Coxian function. We also present examples of the approximation and evaluate its accuracy. © 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(2): 16–24, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.10446
Machine translation using recursive chain‐link‐type learning based on translation examples
Authors: Echizen‐Ya Hiroshi , Araki Kenji , Momouchi Yoshio , Tochinai Koji 
Published: January 2004

AbstractRule‐based machine translation analyzes source‐language sentences using large‐scale linguistic knowledge that is given by the developer beforehand. However, it is difficult to give complete linguistic knowledge to the systemex antebecause natural language has various linguistic phenomena. Therefore, we worked to develop learning‐based machine translation. In learning‐based machine translation, a system acquires translation rules automatically from translation examples that are pairs of source and target language sentences. However, existing learning‐based machine translation presents the problem that it requires a large number of similar translation examples. Consequently, it cannot acquire enough useful translation rules from sparse translation examples. This paper proposes a method of machine translation using Recursive Chain‐Link‐type Learning, which can acquire many useful translation rules from sparse translation examples. Our system, based on this method, efficiently acquires translation rules from each translation example without requiring two similar translation examples. Translation rules are acquired by extracting corresponding parts between source and target language sentences in translation examples. Our system determines those corresponding parts using previously acquired translation rules. Therefore, the system engenders a chain reaction in acquisition of new translation rules. Evaluation experiments using our system demonstrated an effective translation rate of 61.1%. Moreover, the effective translation rate was 85.0% when sufficient learning data were given to our system. © 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(2): 1–15, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.10511
Real‐time human tracking system with multiple omnidirectional vision sensors
Authors: Sogo Takushi , Ishiguro Hiroshi , Trivedi Mohan M. 
Published: January 2004

AbstractWe propose a real‐time human tracking system that uses multiple omnidirectional vision sensors. This system estimates and tracks the locations of multiple persons from omnidirectional 360‐degree images captured by multiple omnidirectional vision sensors using N‐ocular stereo, which is obtained by extending conventional trinocular stereo, and without using image characteristics. In N‐ocular stereo, robust real‐time target location estimation can be achieved by taking into account human model errors and human azimuth observation errors, as well as the problem of measurement precision of target locations in stereo based on omnidirectional images; and by further simplifying these factors and correcting them. Using this method, we created a prototype system and verified its effectiveness based on a human tracking experiment. © 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(2): 79–90, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.1228
A method of generating seamless texture using GA
Authors: Yamada Tatsumi , Hashimoto Akihiko , Adachi Fumio , Shimohara Katsunori , Tokunaga Yukio 
Published: January 2004

AbstractThis paper proposed a method of generating seamless textures by means of a genetic algorithm (GA). When the texture of a large region is built up from textures in regions of finite size, textural discontinuities usually arise at the boundaries between these regions. A seamless texture is one in which such discontinuities do not occur. A fractal method has been proposed for the generation of seamless textures, but in that method it is difficult to predict what seamless texture will be generated. Pattern generation cannot be controlled in such a way that a texture similar to an already generated seamless texture will be produced. In this paper an attempt is made to solve this problem by applying the GA to texture generation, yielding seamless textures that are similar to seamless textures previously generated. This method can also be used to generate multiple seamless textures. By using the proposed method, a texture with a user‐selected pattern can be generated from simultaneously displayed seamless textures. In addition, to avoid monotonous behavior due to the arrangement of textures of a single kind, a method of generating seamless textures with the same boundary but with different internal pattern (group texture) is proposed. © 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(2): 91–99, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.1229
A Bayesian analysis of the 4‐year follow‐up data of the Wisconsin epidemiologic study of diabetic retinopathy
Authors: Angers Jean‐François , Biswas Atanu 
Published: January 2004

AbstractThe Wisconsin epidemiologic study of diabetic retinopathy (WESDR) is a population‐based epidemiologic study carried out in Southern Wisconsin during the 1980s of the last century. The resulting data were analysed by different statisticians and ophthalmologists during the last two decades. Most of the analyses were carried out on the baseline data, although there were two follow‐up studies on the same population. In this present paper, we provide a Bayesian analysis of the first follow‐up data which were taken 4 years after the baseline study. Our Bayesian analysis provides estimates of the associated covariate effects. Choice of the best model in terms of the covariate inclusion is also performed. The baseline data were used to set the prior for the parameters. Extensive numerical computations illustrate our present methodology. Copyright © 2004 John Wiley & Sons, Ltd.
Parametric randomization‐based methods for correcting for treatment changes in the assessment of the causal effect of treatment
Authors: Walker A. Sarah , White Ian R. , Babiker Abdel G. 
Published: January 2004

AbstractWe develop parametric maximum likelihood methods to adjust for treatment changes during follow‐up in order to assess the causal effect of treatment in clinical trials with time‐to‐event outcomes. The accelerated failure time model of Robins and Tsiatis relates each observed event time to the underlying event time that would have been observed if the control treatment had been given throughout the trial. We introduce a bivariate parametric frailty model for time to treatment change and time to trial endpoint. Estimating equations which respect the randomization are constructed and compared to maximum likelihood methods in a simulation study. The Concorde trial of immediate versus deferred zidovudine in HIV infection is used as a motivating example and illustration of the methods. Copyright © 2004 John Wiley & Sons, Ltd.
Clarifying the fundamentals of HTTP
Authors: Mogul Jeffrey C. 
Published: January 2004

AbstractThe simplicity of HTTP was a major factor in the success of the Web. However, as both the protocol and its uses have evolved, HTTP has grown complex. This complexity results in numerous problems, including confused implementors, interoperability failures, difficulty in extending the protocol, and a long specification without much documented rationale.Many of the problems with HTTP can be traced to unfortunate choices about fundamental definitions and models. This paper analyzes the current (HTTP/1.1) protocol design, showing how it fails in certain cases, and how to improve these fundamentals. Some problems with HTTP can be fixed simply by adopting new models and terminology, allowing us to think more clearly about implementations and extensions. Other problems require explicit (but compatible) protocol changes.This paper explains that HTTP needs a clean and consistent data‐type model, and in particular needs an explicit ‘instance’ data type; that HTTP needs a clear data access model, and that resources and instances should carry explicit access‐model labels; and that HTTP needs a simple name space for implementations to declare sets of supported extensions. Copyright © 2004 John Wiley & Sons, Ltd.
High‐performance benchmarking with Web Polygraph
Authors: Rousskov Alex , Wessels Duane 
Published: January 2004

AbstractThis paper presents the design and implementation of Web Polygraph, a tool for benchmarking HTTP intermediaries. We discuss various challenges involved in simulating Web traffic and in developing a portable, high‐performance tool for generating such traffic. Polygraph's simulation models, as well as our experiences with developing and running the benchmark, may be useful for Web proxy developers, performance analysts, and researchers interested in Web traffic simulation. Copyright © 2004 John Wiley & Sons, Ltd.
A large‐scale study of the evolution of Web pages
Authors: Fetterly Dennis , Manasse Mark , Najork Marc , Wiener Janet L. 
Published: January 2004

AbstractHow fast does the Web change? Does most of the content remain unchanged once it has been authored, or are the documents continuously updated? Do pages change a little or a lot? Is the extent of change correlated to any other property of the page? All of these questions are of interest to those who mine the Web, including all the popular search engines, but few studies have been performed to date to answer them.One notable exception is a study by Cho and Garcia‐Molina, who crawled a set of 720 000 pages on a daily basis over 4 months, and counted pages as having changed if their MD5 checksum changed. They found that 40% of all Web pages in their set changed within a week, and 23% of those pages that fell into the .com domain changed daily.This paper expands on Cho and Garcia‐Molina's study, both in terms of coverage and in terms of sensitivity to change. We crawled a set of 150 836 209 HTML pages once every week, over a span of 11 weeks. For each page, we recorded a checksum of the page, and a feature vector of the words on the page, plus various other data such as the page length, the HTTP status code, etc. Moreover, we pseudo‐randomly selected 0.1% of all of our URLs, and saved the full text of each download of the corresponding pages.After completion of the crawl, we analyzed the degree of change of each page, and investigated which factors are correlated with change intensity. We found that the average degree of change varies widely across top‐level domains, and that larger pages change more often and more severely than smaller ones.This paper describes the crawl and the data transformations we performed on the logs, and presents some statistical observations on the degree of change of different classes of pages. Copyright © 2004 John Wiley & Sons, Ltd.
Effects of acute acetylcholinesterase inhibition on the cerebral cholinergic neuronal system and cognitive function: Functional imaging of the conscious monkey brain using animal PET in combination with microdialysis
Authors: Tsukada Hideo , Nishiyama Shingo , Fukumoto Dai , Ohba Hiroyuki , Sato Kengo , Kakiuchi Takeharu 
Published: January 2004

AbstractThis study demonstrated the effects of acute acetylcholinesterase (AChE) inhibition by donepezil (Aricept) on the cerebral cholinergic neuronal system in the brains of young (5.2 ± 1.1 years old) and aged (20.3 ± 2.6 years old) monkeys (Macaca mulatta) in the conscious state. Donepezil at doses of 50 and 250 μg/kg suppressed AChE activity, analyzed by metabolic rate (k3) of N‐[11C]methyl‐4‐piperidyl acetate ([11C]MP4A), in all cortical regions in a dose‐dependent manner in both age groups. However, the suppression degree was more marked in young than in aged monkeys. AChE inhibition by donepezil resulted in a dose‐dependent increase in acetylcholine levels in the prefrontal cortex of young animals as measured by microdialysis. Binding of (+)N‐[11C]propyl‐3‐piperidyl benzilate ([11C](+)3‐PPB) to cortical muscarinic receptors was reduced by donepezil, probably in a competitive inhibition manner. Aged monkeys showed less reduction of [11C](+)3‐PPB binding than young animals. As evaluated by an oculomotor delayed response task, aged monkeys showed impaired working memory performance compared to young monkeys, and the impaired performance was partly improved by the administration of donepezil, due to the facilitation of the cholinergic neuronal system by AChE inhibition. These results demonstrate that the PET imaging technique with specific labeled compounds in combination with microdialysis and a behavioral cognition task could be a useful method to clarify the mechanism of drugs in the living brains of experimental animals. Synapse 52:1–10, 2004. © 2004 Wiley‐Liss, Inc.
Evaluation of [18F]fluorinated sigma receptor ligands in the conscious monkey brain
Authors: Elsinga P.H. , Tsukada H. , Harada N. , Kakiuchi T. , Kawamura K. , Vaalburg W. , Kimura Y. , Kobayashi T. , Ishiwata K. 
Published: January 2004

AbstractPET‐imaging of the sigma receptors is very helpful to understand processes, e.g., several central nervous system (CNS)‐diseases in which the sigma receptors are involved. The [18F]fluoroethylated analogs of SA4503 and SA5845 ([18F]FE‐SA4503 and [18F]FE‐SA5845) were evaluated in conscious monkeys to estimate its suitability for human application for PET. Conscious monkeys (Macaca Mulatta) were either scanned with [18F]FE‐SA4503 or [18F]FE‐SA5845 (n = 3 for both groups, 220–802 MBq). After a dynamic study of 120 min, radioactivity was displaced by intravenous (i.v.) injection of haloperidol (1 mg/kg). One month later the same set of three monkeys were scanned with [18F]FE‐SA4503 for 120 min and “cold” SA4503 (1 mg/kg) was infused to displace the radioactivity, and the other three monkeys were pretreated with haloperidol (1 mg/kg) before the 120‐min PET‐scan with [18F]FE‐SA5845. Cortical areas (cingulate, frontal, occipital, parietal, temporal), striatum, and thalamus showed high radioactivity uptake. Infusion of haloperidol displaced the radioactivity levels of the two radioligands. The same effect was found for [18F]FE‐SA4503 after SA4503 displacement. Pretreatment with haloperidol blocked the [18F]FE‐SA5845 binding to give PET‐images with low and uniform uptake in the brain. The findings demonstrated the reversible binding of the two radioligands. Metabolite analysis showed that 14% and 23% parent compound of [18F]FE‐SA5845 and [18F]FE‐SA4503, respectively, at 120 min postinjection was present in plasma. Kinetic analysis showed that the binding potential of [18F]FE‐SA5845 was higher in all brain regions than that of [18F]FE‐SA4503 (4.75–8.79 vs. 1.65–4.04). The highest binding potential was found in the hippocampus, followed by the cortical regions, thalamus, cerebellar hemisphere, striatum and vermis. Both [18F]FE‐SA compounds bound specifically to cerebral sigma receptors of the monkey and have potential for mapping sigma receptors in the human brain. Synapse 52:29–37, 2004. © 2004 Wiley‐Liss, Inc.
DsdA (D‐serine deaminase): a new heterologous MX cassette for gene disruption and selection in Saccharomyces cerevisiae
Authors: Vorachek‐Warren Mara K. , McCusker John H. 
Published: January 2004

AbstractDominant drug resistance markers offer experimental flexibility in the study of Saccharomyces cerevisiae by eliminating the dependence on auxotrophic mutations and, because they are phenotypically neutral, avoid the deleterious effects of auxotrophic mutations. We have developed a new dominant resistance marker, dsdAMX4, for use in the genetic manipulation of S. cerevisiae. The dsdA gene, which is derived from Escherichia coli and encodes a D‐serine deaminase, confers to S. cerevisiae resistance to D‐serine and the ability to use D‐serine as a nitrogen source. Here we describe the construction of a dsdAMX4 cassette, capable of expression in S. cerevisiae, and the characterization of this new marker for use in chromosomal gene disruption. The unique selection properties of the dsdAMX4 cassette make it an important addition to the existing array of S. cerevisiae genetic tools. Copyright © 2004 John Wiley & Sons, Ltd.
Monofunctional catalase P of Paracoccidioides brasiliensis: identification, characterization, molecular cloning and expression analysis
Authors: Moreira Sabrina F. I. , Bailão Alexandre M. , Barbosa Mônica S. , Jesuino Rosalia S. A. , Felipe M. Sueli Soares , Pereira Maristela , Soares Célia Maria de Almeida 
Published: January 2004

AbstractWithin the context of studies on genes from Paracoccidioides brasiliensis (Pb) potentially associated with fungus–host interaction, we isolated a 61 kDa protein, pI 6.2, that was reactive with sera of patients with paracoccidioidomycosis. This protein was identified as a peroxisomal catalase. A complete cDNA encoding this catalase was isolated from a Pb cDNA library and was designated PbcatP. The cDNA contained a 1509 bp ORF containing 502 amino acids, whose molecular mass was 57 kDa, with a pI of 6.5. The translated protein PbCATP revealed canonical motifs of monofunctional typical small subunit catalases and the peroxisome‐PTS‐1‐targeting signal. The deduced and the native PbCATP demonstrated amino acid sequence homology to known monofunctional catalases and was most closely related to catalases from other fungi. The protein and mRNA were diminished in the mycelial saprobic phase compared to the yeast phase of infection. Protein synthesis and mRNA levels increased during the transition from mycelium to yeast. In addition, the catalase protein was induced when cells were exposed to hydrogen peroxide. The identification and characterization of the PbCATP and cloning and characterization of the cDNA are essential steps for investigating the role of catalase as a defence of P. brasiliensis against oxygen‐dependent killing mechanisms. These results suggest that this protein exerts an influence in the virulence of P. brasiliensis. Copyright © 2004 John Wiley & Sons, Ltd.