bluuebunny/crossref_metadata_2025_split huggingface dataset:
High‐ and average‐risk individuals' beliefs about, and perceptions of, malignant melanoma: an Australian perspective
Authors: Kasparian Nadine A. , Butow Phyllis N. , Meiser Bettina , Mann Graham J. 
Published: June 2007

AbstractDespite expanding knowledge regarding the genetics of melanoma, there have been few attempts to define the psychosocial experiences of individuals with a family history of this disease. This study explored the ways in which individuals at varying levels of risk perceive, and respond to, melanoma. Forty semi‐structured interviews were undertaken with affected (n = 20) and unaffected (n = 20) individuals with or without a family history of melanoma. Data were analysed for potential thematic differences between risk groups, genders, and intentions to pursue genetic testing for melanoma risk. Overall, participants with a family history were in acceptance of their increased risk status and had developed ways of coping without major disruption to their daily lives. However, some participants expressed ambiguity regarding the causes of melanoma and the effectiveness of health behaviours such as sun protection. Major thematic patterns identified for those intending to pursue genetic testing were: negative emotional associations with melanoma; an emphasis on screening and sun avoidance, but not sun protection; and heightened perceptions of personal susceptibility to melanoma. In contrast, thematic patterns identified for those likely to decline testing were: ready access to stories of melanoma survival; and an emphasis on the causal role of sun exposure, whilst still believing that genetic factors may contribute to melanoma susceptibility. Compared to males, females reported a greater tendency to completely avoid the sun in order to reduce their melanoma risk. The data provide preliminary evidence for the importance of identifying misconceptions that may impede informed decision‐making about genetic testing for melanoma risk. Copyright © 2007 John Wiley & Sons, Ltd.
Evaluation of antiviral activity of South American plant extracts against herpes simplex virus type 1 and rabies virus
Authors: Müller Vanessa , Chávez Juliana H. , Reginatto Flávio H. , Zucolotto Silvana M. , Niero Rivaldo , Navarro Dionezine , Yunes Rosendo A. , Schenkel Eloir P. , Barardi Célia R. M. , Zanetti Carlos R. , Simões Cláudia M. O. 
Published: June 2007

AbstractThis paper describes the screening of different South American plant extracts and fractions. Aqueous and organic extracts were prepared and tested for antiherpetic (HSV‐1, KOS and 29R strains) and antirabies (PV strain) activities. The evaluation of the potential antiviral activity of these extracts was performed by using an MTT assay for HSV‐1, and by a viral cytopathic effect (CPE) inhibitory method for rabies virus (RV). The results were expressed as 50% cytotoxicity (CC50) for MTT assay and 50% effective (EC50) concentrations for CPE, and with them it was possible to calculate the selectivity indices (SI = CC50/EC50) of each tested material. From the 18 extracts/fractions tested, six extracts and four fractions showed antiviral action.Ilex paraguariensis, Lafoensia pacari, Passiflora edulis, Rubus imperialisandSlonea guianensisshowed values of SI > 7 against HSV‐1 KOS and 29‐R strains andAlamanda schottiishowed a SI of 5.6 against RV, PV strain. Copyright © 2007 John Wiley & Sons, Ltd.
Beneficial effects of Centella asiatica aqueous extract against arsenic‐induced oxidative stress and essential metal status in rats
Authors: Flora S. J. S. , Gupta Richa 
Published: June 2007

AbstractThe efficacy of an aqueous extract of Centella asiatica (100, 200 and 500 mg/kg for 5 consecutive days) was studied in the depletion of arsenic and in the recovery of a few altered biochemical variables in arsenic pre‐exposed rats (20 ppm in drinking water for 5 weeks). Exposure to arsenic significantly depleted δ‐aminolevulinic acid dehydratase (ALAD) activity, reduced glutathione (GSH) level, superoxide dismutase (SOD) and increased thiobarbituric acid reactive substance (TBARS) activity in red blood cells. Significant depletion of ALAD activity, GSH level, glutathione peroxidase (GPx), SOD and catalase (CAT) activities and an increase in TBARS levels in liver tissues was also noted. There was a significant depletion of SOD, CAT and GPx activities in kidneys and an increased TBARS levels in kidney and brain accompanied by increased arsenic concentration in blood and soft tissues. Treatment with aqueous extract of Centella asiatica provided significant protection against ALAD, GSH and TBARS levels, particularly at doses of 200 and 500 mg. Centella asiatica also provided significant recovery in the inhibited liver ALAD and G6PD activities. Arsenic concentration in blood and soft tissues remained uninfluenced after Centella asiatica administration. The present study thus suggests a beneficial effect of Centella asiatica against arsenic‐induced oxidative stress but possesses no chelating property. Copyright © 2007 John Wiley & Sons, Ltd.
Measurement of microelectroretinogram by photodiode stimulation
Authors: Jiang Xin , Morita Tatsuya 
Published: July 2007

AbstractThe electroretinogram (ERG) is considered interesting not only as a diagnostic information in the ophthalmological clinics but also in biological engineering as a clue to the opto‐electric conversion mechanism in the retina. Conventionally, ERG is observed using the whole field stimulation of the retina by a strong flash, where the information concerning the local activities of the retina cannot be obtained. Another point in ERG is that the analysis is difficult due to the nonlinearity and the ambiguity of the stimulus waveform. This paper proposes a new method which analyzes the frequency characteristics of the micro‐ERG (μ‐ERG), evoked by the stimulation using the light‐emitting diode (LED).This method has the following advantages: the stimulating waveform can be controlled arbitrarily; the method of linear system analysis can be applied; the local stimulation can be realized; and the color sensation can be examined.This paper discusses two basic techniques in the detection of the μ‐ERG. One is the Fourier analysis of the synchronized ERG evoked by the sine wave stimulus, and the other is the correlation analysis using the random stimulus. The results of the two methods are compared, and the usefulness of the proposed method is indicated.
Understanding mechanical assembly illustrations‐obtaining assembly information from auxiliary lines showing assembly relations
Authors: He Shoujie , Kitahashi Tadahiro , Abe Norihiro 
Published: July 2007

AbstractAssembly illustrations are drawn usually in an assembly manual to show assembly information because, in many cases, instructions cannot show assembly information unambiguously enough. Therefore, it is necessary to combine the assembly information both from instructions and illustrations so that unambiguous assembly information is obtained finally. Naturally, it becomes necessary to construct a cooperative system for image understanding and language understanding. For such a final purpose, the purpose of this study is to obtain assembly information only from illustrations by means of image understanding.This paper presents an approach for obtaining assembly information from illustrations. As an example, the approach takes an auxiliary line employed to show an assembly relation between two certain mechanical parts. By extracting auxiliary lines and using the information on the location and orientation of these lines, we can recognize not only the assembly relations but also the structure of mechanical parts, especially such structural details as the invisible or occluded holes. Further, the assembly order can also be conjectured to some extent from an illustration in which several assembly relations are shown simultaneously. By taking advantage of the foregoing information, the system can decide whether an object is equal to the assembly constructed from the given illustration.
On finding the axes of skewed symmetry using the image normalization with moment
Authors: Yoshikawa Toshinori , Iida Izumi 
Published: July 2007

AbstractAmong the reconstruction methods for three‐dimensional information, methods are known for extracting the axes of skewed symmetry that place constraints on the orientation of the plane in space. Since skewed symmetry loses the symmetric nature for the most part, the many earlier methods for extracting axes of symmetry could not be directly applied to extracting axes of skewed symmetry. In addition, conventional methods for extracting the axes of skewed symmetry have the drawbacks of having long processing times and being difficult to apply to complex figures. In this paper, we propose a method that uses moments to perform a first‐order transform on a skew symmetric figure into a symmetric figure and then extracts the axes of symmetry. In this method, the problem is simplified by transforming a skew symmetric figure into a symmetric figure so that conventional methods for extracting the axes of symmetry can be applied. In addition, the evaluation of symmetry which uses the fact that the areas on both sides of an axis of symmetry are equal is adopted in the proposed extraction of the axes of symmetry. The features of this method are discussed by giving practical examples of extracting the axes of skewed symmetry.
Modeling a three‐dimensional shape from a silhouette by detecting symmetry
Authors: Fukushima Shigehiro , Okumura Takeshi 
Published: July 2007

AbstractA human being, observing a silhouette outline of an object, can estimate its three‐dimensional (3‐D) shape. This process has implications for the problem of recognizing and understanding 3‐D shapes, since a similar process is needed in 3‐D shape modeling of computer graphics.One idea for such 3‐D shape modeling is to generate generalized cylinders on the basis of symmetry of the silhouette. This means finding symmetrically related pairs of points on the outline and estimating cross sections of the object from line segments connecting respective pairs of points.A generalized cylinder for the object can be constructed from the set of such cross sections. However, the symmetric point pairs previously were extracted by heuristic methods, and some instability was involved.This paper applies a recently proposed method of computing symmetric point pairs based on geometric division of the plane to 3‐D shape modeling. Two ways to develop it are proposed: (1) prune it if the symmetric axis has branches, thereby generating a generalized cylinder for the trunk; and (2) generate generalized cylinders for the trunk and for respective branches, thereby modeling a complex shape as a self‐intersecting object composed of multiple segments. The segment decomposition is implemented by natural reasoning.
A study of distributed environment for three‐dimensional image processing using extended server‐client model
Authors: Okada Minoru , Yokoi Shigeki , Toriwaki Jun'Ichiro 
Published: July 2007

AbstractOne method for constructing a distributed image processing environment for three‐dimensional digital images is examined. VISUAL, which is proposed here, is based on an extended client/server model. Specifically, an image processing system is constructed from one server that manages the images and clients that correspond to the processing units in a series of image processes. VISUAL offers a platform where multiple client processes cooperate and operate under a server. In this paper, the basic overview, design objectives, and implementation are explained. In addition, the effectiveness of more efficient development of image processing systems by distributed functions and program hiding is demonstrated.
Organization of a real‐time operating system “A‐RMS”
Authors: Yokohata Shizuo , Sugita Yumiko , Aoki Hisanobu , Ishikawa Tomoo 
Published: July 2007

AbstractAs technologies in the process control and the equipment control fields become more and more advanced, there are increasing needs for a real time operating system which provides the interactive processing function in addition to the conventional control function.In the past, as a means to cope with these needs, technologies such as the virtual machine system of the emulation system were proposed. However, these systems presented difficulties in handling because each environment in these conventional systems uses its own operating system interface.This paper describes “A‐RMS,” a newly developed real‐time operating system which incorporates an interactive processing function as native on top of a real‐time operating system providing a control function. The control function and the interactive processing function are realized with unified concept and specification in A‐RMS. Adverse effects on the control function which might be induced by the incorporated interactive processing function are prevented by introducing a concept of environment to separate the interactive processing function from the control function.The new operating system is implemented on the M68010. This paper also mentions the effect of incorporation of the interactive processing function on A‐RMS performance. To secure response, A‐RMS employs only the real memory. The memory management unit (MMU) is used exclusively for memory protection.
A parallel algorithm for tree pattern matching
Authors: Tarora Koji , Hirata Tomio , Inagaki Yasuyoshi 
Published: July 2007

AbstractGiven a text tree t and a pattern tree p, tree pattern matching involves finding subtrees of t which match p. This paper proposed a parallel algorithm for tree pattern matching. The algorithm is designed to run in O(log n) parallel time using mn/logn processors on CREW‐PRAM, where n and m are the sizes of t and p respectively. This improves the result of Ramesh et al. that runs in O(log2n) time using nr/log2n processors, where r is the number of vertices of p labeled with variables. Futhermore, the method of processor allocation is described specifically in the proposed algorithm.
Multi‐valued current‐mode parallel multiplier based on redundant positive‐digit number representations
Authors: Kaqahito Shoui , Ishida Makoto , Nakamura Tetsuro , Mizuno Kentaro , Kameyama Michitaka , Higuchi Tatsuo 
Published: July 2007

AbstractThis paper proposes a new parallel multiplier based on the redundant number representation using positive digits (called redundant positive‐digit number representation, or simply PD number representation). The proposed algorithm is the fastest algorithm that can execute the multiplication of n x n digit by a time proportional to log2n. The structure is regular and is suited to LSI implementation.The proposed parallel multiplier is designed in two ways, i.e., by the multivated current mode circuit and by the binary digital circuit. Then the results are evaluated. The circuit designed by the multivated current mode, especially, has the feature that the 6‐input addition with partial product operand can be executed by the wired addition and a single‐stage parallel adder based on the PD number representation. Thus, it is demonstrated that the circuit has a high speed and can be realized with a very small number of elements and wirings. The basic circuits for the proposed parallel multiplier are constructed experimentally by 5 μm CMOS technology, and a satisfactory performance is verified.
Development of an expert system for recognizing handwritten dollar amounts
Authors: Kameyama Hirofumi , Miki Shoji , Suzuki Hisashi , Arimoto Suguru 
Published: July 2007

AbstractThis paper presents an expert system for automatically recognizing handwritten characters of dollar amounts on personal checks. The dollar amounts composed of numerals and marks—, “X X,” etc., are freely handwritten in various formats that individuals favor, inside the amount field. Then frequently there is contact between not only horizontally adjacent characters but also vertically adjacent ones. Recognition of such unconstrained character strings handwritten by the public whose formats are undecided beforehand is a problem in optical character recognition.The system developed in this paper has the ability to segment the dollar amount image into individual characters automatically and to recognize them accurately. The recognition process of the dollar amount consists of the following steps: divide a digitized image into groups, called a “block,” of line elements connected with one another; give attributes to each block by using the knowledge on arrangement patterns of characters; and segment the block into individual characters according to the attributes and recognize them. It is suggested that this system will enable the saving of considerable operator labor in check processing.
A static processor‐scheduling algorithm resistive to dynamic fluctuation of execution timing
Authors: Takagi Hiromitsu , Arita Takaya , Sowa Masahiro 
Published: July 2007

AbstractThe feature of the parallel computer, where the tasks are allocated to the processors at the compiling stage, is that the control at the execution stage is simplified. Thus, a high‐speed execution is expected. However, a problem may arise when the processing of each task cannot accurately be estimated before the execution due to the uncertainty such as the delay in the network or the cache‐miss, making the performance deterioration inevitable.In the allocation of more than one executable task to the idle processors in the conventional scheduling algorithm, it is not particulary specified which task is allocated to which processor. This paper notes the forementioned point, and attempts to suppress the performance deterioration to the minimum by deciding the foregoing point by an adequate algorithm. More precisely, the basic idea is to reduce the precedence constraint by allocating two tasks with precedence constraint to the same processor.A new scheduling algorithm is proposed and is evaluated using a number of task graphs. It is shown that the speed improvement of 4 to 16 percent can be achieved, compared to the conventional algorithm.
Optimal number of processors in parallel processing of a single doacross loop for different execution times of iterations
Authors: Fukuda Akira 
Published: July 2007

AbstractIn most of the past theoretical studies of the parallel processing of the loop, the discussion developed assuming that all execution times of the iterations are the same. Especially, the discussion is always developed under such an assumption for the doacross loop, which is the general loop processing model, including the doall and doserial loops. Considering the multiprocessor memory architectures at present and in the future, however, the following assumption seems more adequate.In each of the processors participating in the loop processing, the execution times of the second and the following iterations are shorter than that of the first. Under this assumption, there exists the number of processors (called the optimal number of processors) that minimizes the loop processing time.This paper considers the single doacross loop, and discusses the following loop processing: (1) after the delay time of d from the start of execution of the i‐th iteration Ii, the next iteration Ii+1 is permitted; (2) the iteration that once started its execution is never preempted until the execution is completed; (3) for each processor participating in the loop processing, let the execution time for the first iteration be B, and that of the second and the following iterations be b. Then, d < b < B. This paper derives the optimal number of processors for the forementioned model.
Relationships between learning and information compression based on PAC learning model
Authors: Takimoto Eiji , Maruoka Akira 
Published: July 2007

AbstractThis paper is based on the concept of the learning function, which represents the input‐output relation of the learning algorithm. The learning process and the information compression process are formulated as the PAC learning function and the Occam function, respectively, and their equivalence is discussed. It is shown that the Occam function is always a consistent PAC learning function, while its converse is not always true.The weak Occam function which is obtained by weakening the condition concerning the information compression power of Occam function is defined anew and it is shown that the weak Occam function is always a consistent PAC learning function. Furthermore, a procedure is shown which derives the weak Occam function from the PAC learning function under a certain condition.
A neural fuzzy training approach for improving speech recognition
Authors: Komori Yasuhiro , Sagayama Shigeki , Waibel Alexander H. 
Published: July 2007

AbstractThis paper proposes a new training method for the phoneme identification neural network called “neural fuzzy training.” In the proposed training, nondeterministic (fuzzy) class information is assigned to the training signal, in contrast to the traditional method where a deterministic class information is assigned.This study aims at the realization of a robust neural network, thereby improving the cumulative recognition rate of the phoneme identification and avoiding overtraining. The proposed neural fuzzy training is realized by backpropagation. In the conventional training, a deterministic phoneme class information is assigned to the training signal of the neural network as the value 1 or 0. However, in the proposed training, the fuzzy class information is assigned to the training signal for each training sample as the likelihood value between 0 and 1.In the proposed training method, the likelihood is calculated by the monotonically decreasing function (such as exp(−α · d2)) of the distance between the training sample and the closest sample belonging to each phoneme class. The proposed neural fuzzy training method has a problem in that a large amount of computation cost is required since the training signal is determined by calculating the distances to all training samples. To solve this problem, the representative samples in each phoneme class are defined and the likelihood to the phoneme classes are determined by calculating the distance between the representative sample and the training sample.By this simplification of the likelihood calculation, the computational cost to determine the training signal is reduced considerably. To demonstrate the usefulness of the neural fuzzy training, an experiment is conducted: /b, d, g, m, n, N/ identification, 18 consonant identification and phrase recognition using TDNN‐LR. The ATR database is used in the experiment. In the phoneme identification experiment, the speech samples which are extracted using the hand‐label is used. The TDNN is trained using speed samples uttered in word style, and the evaluation is performed using speech samples uttered in phrase style and in sentence style.In the phrase recognition experiment using TDNN‐LR, the TDNN is trained using speed samples uttered word style using a hand label. The evaluation is performed using speech samples uttered in phrase style. In either experiment, an improvement of using the fuzzy training can be observed. Especially, in the phrase recognition experiment using TDNN‐LR, the top recognition rate is improved from 71.2 percent to 80.9 percent, and the top 5th recognition rate is improved from 92.8 percent to 96.O percent. Furthermore, it appeared also that the neural fuzzy training is a high‐speed training method.