bluuebunny/crossref_metadata_2025_split huggingface dataset:
High Performance Fortran, Version 2
Authors: Schreiber Robert 
Published: October 2003

This paper introduces the ideas that underly the data-parallel language High Performance Fortran (HPF) and the new ideas in version 2 of HPF. It first reviews HPF's key language elements. It discusses the meaning of data parallelism and the limitations of HPF version 1 as a data-parallel programming language. The second part of the paper is a review of the development of version 2 of HPF. The extended language, under development in 1996, includes a richer data mapping capability; an extension to the independent loop that allows reduction operations in the loop range; a means for directing the mapping of computation as well as data; and a way to specify concurrent execution of several parallel tasks on disjoint subsets of processors.
Effect of Sairei-To Combined with Aspirin and Prednisolone on Four Recurrent Reproductive Failure Women who are Positive for Anti-Phospholipid Antibodies
Authors: Takakuwa Koichi , Ishii Keisuke , Takaki Yoshihiro , Natsume Norihiro , Adachi Hiroshi , Kurata Hitoshi , Tamura Masaki , Kurabayasi Takumi , Tanaka Kenichi 
Published: October 2003

We treated four pregnancy cases positive for antiphospholipid antibodies (APLs) who had experienced recurrent second trimester fetal or neonatal losses using a Japanese modified Chinese herbal medicine, Sairei-to, low dose aspirin and adrenocorticosteroid hormone. The clinical courses of their new pregnancies in conjunction with the dynamic changes in their APL titers are described in this paper, and the possible efficacy of this treatment is discussed. The concept that autoimmune abnormalities, especially positive APLs, are generative factors for a range of reproductive failures, such as recurrent abortions, intrauterine growth retardation, intrauterine fetal death and preeclampsia, is now attracting a great deal of attention in the fields of reproductive immunology and perinatal medicine (Yasuda et al., 1995). The main mechanisms in the generation of reproductive failures are considered to be direct damage to chorionic villi by APLs during the period of placentation (Rote et al., 1998), as well as the formation of thrombi intervillous spaces (Arakawa et al., 1999). Considering these mechanisms of the reproductive failure generation by APLs, the application of immune suppressive therapy in combination with anti-coagulation therapy should be reconsidered as a treatment option. In this context, we treated four pregnancy cases positive for APLs who had experienced recurrent second trimester fetal or neonatal losses using a Japanese modified Chinese herbal medicine, Sairei-to, low dose aspirin and an adrenocorticosteroid hormone.
Nucleation Model for the Description of Glass Formation
Authors: Micoulaut M. 
Published: October 2003

We present in this letter a model of glass formation using energy barriers and a crystal nucleation process. We then analyze the corresponding dynamical equation in the vicinity of the stationary solutions. The occurence of a pure amorphous solution (i.e. glass) is due to the contribution of a ratio depending on the cooling rate and the crystal nucleation frequency. We also construct time-temperature transformation (TTT) curves in order to relate the model with the kinetic treatment of glass formation.
Submicrometer Shadow Mask Fabricated by Anisotropic Wet Etching and Focused Ion Beam Techniques for Nanofabrication in UHV
Authors: Sheng Hanyu , Fujita Daisuke , Ohgi Taizo , Okamoto Hiroshi , Nejoh Hitoshi 
Published: October 2003

We have developed a new method for fabricating a silicon submicrometer shadow mask for nanofabrication in ultra-high vacuum. Combining KOH anisotropic wet etching, electron beam lithography, reactive ion etching and focused ion beam techniques, a pattern size of 2.5×2.5 mm2 and opaque part about 1 μm can be obtained.
A Combined Mechanism Mediated by Lochons and Phonons for Cuprate Superconductors
Authors: Sinha K. P. 
Published: October 2003

We present a brief review of the combined pairing mechanism mediated by phonons and lochons (local charged bosons) for the high temperature superconducting materials (mainly cuprates). The phonon contribution (λ p ) being weak, the lochon part (λl) dominates to give higher critical temperatures (T c ). The combined mechanism along with the variation of λl with carrier concentration (x c ) gives the right variation of T c and the oxygen isotope exponent on doping. The superconducting gap Δ(0) at T = 0, its ratio with T c , the condensation energy, gap anisotropy, pseudogap, etc. are also discussed. With reasonable agreement with available experimental data, the combined mechanism emerges as a strong contender for an acceptable model for oxide superconducting materials.
Fermionic Coherent State Representation for Generalized Fermionic Bogolyubov Transformation
Authors: Fan Hong-Yi , Fan Yue , Chan F. T. 
Published: October 2003

We show that the generalized fermionic Bogolyubov transformation generator [Formula: see text], where Λ is an even n×n matrix, has the manifest fermionic coherent state representation [Formula: see text] The normally ordered form of V(Λ) can be obtained through the technique of integration within an ordered product of fermionic operators. This work is a supersymmetric partner of Ref. 1.
Temperature Dependence of Electron Mobility in Doped n-Ge
Authors: Jakeli I. , Kekelidze N. , Ambokadze I. , Shamugia N. , Baskoutas S. , Kapaklis V. 
Published: October 2003

In this work we point out experimentally the anomalous behavior of the total mobility as a function of temperature for a specified doped n-Ge sample. Three perfect Ge crystals were grown, with As and Ga as donor and acceptor impurities, with suitable concentrations in one of the crystals, in order to satisfy the condition which is imposed by a theoretical model e.g. 5×10-2<NA/ND<0:33 and ND+NA>8×1013 cm-3. Therefore for this specified crystal the mobility reaches at T=9 K a maximum, at T=23 K it reaches a minimum, at T 25 K it increases according to T-3/2 law, and then decreases monotonously according to T-3/2 law due to the phonon scattering. In contrast in the other two samples, the mobilities rst increase monotonously and then at 18 K and at 26 K decrease monotonously due to the T-3/2 law.
Equivalence in Mapping of Conductivity, Elasticity and Diffusion Equations Appears or Disappears
Authors: Skal Asya S. 
Published: October 2003

Equivalence in mapping of diffusion and conductivity equations appears when diffusion and conductivity belong to the same universality class and disappears in the opposite case. For asymptotic long-time behavior one exponent of regular diffusion coefficient above the threshold [Formula: see text] and two below the threshold [Formula: see text] and [Formula: see text] are introduced, using the conductivity critical exponent (μ and s) and the Hall coeffcient critical exponent Re(p-pc)-g if R2/R1→1 and Re(p-pc)2s if R2/R1→1 and p<pc. In the first two cases equivalence between the diffusion and conductivity problems are disappear. A problem with this analogy lies in an intrinsic property that for percolation lattice the diffusion coeffcient is not a self-averaging quantity unlike the conductivity. Analogy between conductivity and elasticity appears for scalar forces and disappears for vector forces. The latter leads to new equivalence between elasticity and conductivity in a magnetic field. The new formulae for a real part of dielectric constant in the static limit for p>pc and the low-frequency ac conductivity are determined due to the new critical exponent for regular diffusion.
Assessing Feature Importance in the Context of Object Recognition
Authors: West Geoff A. W. 
Published: October 2003

A popular paradigm in computer vision is based on dividing the vision problem into three stages namely segmentation, feature extraction and recognition. For example edge detection followed by line detection followed by planar object recognition. It can be argued that each of these stages needs to be thoroughly described to enable vision systems to be configured with predictable performance. However an alternative view is that the performance of each stage is not in itself important as long as the overall performance is acceptable. This paper discusses feature performance concentrating on the assessmentof edge-based feature detection and object recognition. Evaluation techniques are discussed for assessing arc and line detection algorithmsand for features in the context of verification and pose refinement strategies. These techniques can then be used for the design and integration of indexing and verification stages of object recognition. A theme of the paper is the need to assess feature extraction in the context of the chosen task.
Recent Advances in Graph Matching
Authors: Bunke H. , Messmer B. T. 
Published: October 2003

A powerful and universal data structure with applications invarious subfields of science and engineering is graphs. In computer vision and image analysis, graphs are often used for the representation of structured objects. For example, if the problem is to recognize instances of known objects in an image, then often models, or prototypes, of the known objects are represented by means of graphs and stored in a database. The unknown objects in the input image are extracted by means of suitable preprocessing and segmentation algorithms, and represented by graphs that are analogous to the model graphs. Thus, the problem of object recognition is transformed into a graph matching problem. In this paper, it is assumed that there is an input graph that is given on-line, and a number of model, or prototype, graphs that are known a priori. We present a new approach to subgraph isomorphism detection which is based on a compact representation of the model graphs that is computed off-line. Subgraphs that appear multiple times within the same or within different model graphs are represented only once, thus reducing the computational effort to detect them in an input graph. In the extreme case where all model graphs are highly similar, the run time of the new algorithm becomes independent of the number of model graphs. We also describe an extension of this method to error-correcting graph matching. Furthermore, an approach to subgraph isomorphism detection based on decision trees is proposed. A decision tree is generated from the models in an off-line phase. This decision tree can be used for subgraph isomorphism detection. The time needed for decision tree traversal is only polynomial in terms of the number of nodes of the input graph. Moreover, the time complexity of the decision tree traversal is completely independent on the number of model graphs, regardless of their similarity. However, the size of the decision tree is exponential in the number of nodes of the models. To cut down the space complexity of the decision tree, some pruning strategies are discussed.
A Strategy and Architecture for the Visualization of Complex Geographical Datasets
Authors: Gahegan Mark , O'Brien David 
Published: October 2003

The use of computer visualization as a means to analyze complex geographic datasets is discussed. Visualization is a valuable tool for conducting exploratory data analysis on geographical data; making good use of the human eye's unparalleled ability to recognize structure and relationships that may be inherent within the data. Traditional GIS are extremely poor at visualization, being limited to a very restricted set of visual attributes with which to convey information (position, size, color). The use of a more sophisticated approach is discussed in detail. Specifically, a system to visualise complex environmental datasets is described, which makes use of knowledge concerning the problem domain as well as knowledge concerning human cognition. In the realizations produced, the most salient attributes in the data, for a particular task, are assigned to the most striking visual attributes. Assignments are controlled by heuristics that may be changed to alter system behavior. Results are presented showing the application of this approach on datasets involving several multi-dimensional thematic layers of environmental data, used in mineral exploration.
The Visitors Guide: A Simple Video Reuse Application
Authors: Shearer Kim , Venkatesh Svetha , Kieronska Dorota 
Published: October 2003

One of the results of the surge in interest in the internet is the great increase in availability of pictorial and video data. Web browsers such as Netscape give access to an enormous range of such data. In order to make use of large amounts of pictorial and video data, it is necessary to develop indexing and retrieval methods.Pictorial databases have made great progress recently, to theextent that there are now a number of commercially available products. Video databases are now being researched and developed from a number ofdifferent viewpoints.Given a general indexing scheme for video, the next step is to reuse clipsin further applications. In this paper we present an initial application for the reuse of video clips. The aim of the system is to resequence video clips for a particularapplication. We have chosen a well-constrained application for this purpose,the aim being to produce a video tour of a campus between designatedstart and destination points from a set of indexed videoclips. We use clips of a guide entering and leaving buildings on ourcampus, and when visitors select a start location and a destination, the systemwill retrieve clips suitable for guiding the visitor along the correct path.The system uses an index of spatial relationships of key objects for thevideo clips to decide which clips provide the correct sequence of motionaround the campus. Although the full power of the indexing notation is unnecessary for this simple problem, the results from this initial implementation indicate that the concept could be applicable to more complex problems.
A Belief-Based Approach for Adaptive Image Processing
Authors: Murino Vittorio , Foresti Gian Luca , Regazzoni Carlo S. 
Published: October 2003

This paper proposes a new approach to the problem of intelligently regulating image-processing parameters of a distributed network. The proposed approach is based on two-step probabilistic process: (a) belief updating, which consists in computing a functional cost at each node of the network and, (b) belief maximization, which depends on maximizing this functional cost by using a stochastic optimization algorithm. The architecture of an image processing system, consisting of three modules connected in a chain-like structure, is presented as an example showing the capabilities of the proposed approach. Each module is provided with a priori information about the set of parameters that manage a particular data transformation, and with evaluation criteria to judge data quality and to decide on the parameters to be adjusted. Experimental results obtained by using a digitally controlled camera and lens objective, are presented to show the validity of the proposed approach.
Methods of Combining Multiple Classifiers with Different Features and Their Applications to Text-Independent Speaker Identification
Authors: Chen Ke , Wang Lan , Chi Huisheng 
Published: October 2003

In practical applications of pattern recognition, there are often different features extracted from raw data which needs recognizing. Methods of combining multiple classifiers with different features are viewed as a general problem in various application areas of pattern recognition. In this paper, a systematic investigation has been made and possible solutions are classified into three frameworks, i.e. linear opinion pools, winner-take-all and evidential reasoning. For combining multiple classifiers with different features, a novel method is presented in the framework of linear opinion pools and a modified training algorithm for associative switch is also proposed in the framework of winner-take-all. In the framework of evidential reasoning, several typical methods are briefly reviewed for use. All aforementioned methods have already been applied to text-independent speaker identification. The simulations show that results yielded by the methods described in this paper are better than not only the individual classifiers' but also ones obtained by combining multiple classifiers with the same feature. It indicates that the use of combining multiple classifiers with different features is an effective way to attack the problem of text-independent speaker identification.
Automatic Bankcheck Processing: A New Engineered System
Authors: Dimauro G. , Impedovo S. , Pirlo G. , Salzo A. 
Published: October 2003

A new bankcheck processing system is presented in this paper. A full exploitation of the contextual knowledge, together with a multi-expert approach, have been used both to analyze the complex shape of handwritten text and to design the system. Several processing modules have been integrated in the system. Some of the most relevant are those for data acquisition, preprocessing, machine-printed numeral recognition, layout analysis, courtesy amount recognition, legal amount recognition, amount validation, and signature verification. Some combination techniques have also been used in the system. Reuse and maintenance of the system were two of the main goals of the designing process and the Khoros software tool was used for this purpose.
The A2iA Intercheque System: Courtesy Amount and Legal Amount Recognition for French Checks
Authors: Knerr S. , Anisimov V. , Baret O. , Gorski N. , Price D. , Simon J. C. 
Published: October 2003

We developed a check reading system, termed INTERCHEQUE, which recognizes both the legal (LAR) and the courtesy amount (CAR) on bank checks. The version presented here is designed for the recognition of French, omni-bank, omni-scriptor, handwritten bank checks, and meets industrial requirements, such as high processing speed, robustness, and extremely low error rates. We give an overview of our recognition system and discuss some of the pattern recognition techniques used. We also describe an installation which processes of the order of 70,000 checks per day. Results on a data base of about 170,000 checks show a recognition rate of about 75% for an error rate of the order of 1/10,000 checks.
Multi-Bank Check Recognition System: Consideration on the Numeral Amount Recognition Module
Authors: Heutte L. , Barbosa-Pereira P. , Bougeois O. , Moreau J. V. , Plessis B. , Courtellemont P. , Lecourtier Y. 
Published: October 2003

This paper presents a complete numeral amount recognition module which is integrated in an automatic system aimed at reading all types of French checks. This module is combined with an automatic reading system of literal amounts. This complete working system, called LIREChèques, is developed by MATRA MS&I and is now in advanced test at SERINTEL, a pilot site. Two aspects of the numeral amount recognition system are particularly emphasized: the numeral recognition stage itself and the syntactic analysis stage. The numeral recognition module relies on a combination of two individual classifiers, the first one is based on concavity measurements, the second one on both statistical and structural features. The syntactic analysis, called syntactic/contextual analysis, is combined with contextual information to take into account the segmentation behaviour and the presence of literal entities in the numeral amount. We demonstrate that very good performances can be obtained on digits such as those extracted from numeral amounts since a substitution rate of 0.06% while still preserving a recognition rate of near 87% can be achieved. As for the syntactic/contextual analysis stage, results obtained on a test set (containing checks from more than 40 different banks and 15/ of typed checks, thus being a good representation of the real tests realized on site) show clearly that introduction of contextual information in association with syntactic analysis allows to process much more numeral amounts than a simple syntactic analysis and increases perceptibility of the recognition rate.
Bankcheck Recognition using Cross Validation Between Legal and Courtesy Amounts
Authors: Kim Gyeonghwan , Govindaraju Venu 
Published: October 2003

A bankcheck reading system using cross validation of both the legal and the courtesy amounts is presented in this paper. Some of the challenges posed by the task are (i) segmentation of the legal amount into words, (ii) location of boundaries between dollars and cents amounts, and (iii) high accuracy in terms of recognition performance. Word segmentation in the legal amount is a serious issue because of the nature of the data and patrons' writing habits which tend to clump words together. We have developed a word segmentation algorithm based on the character segmentation results to address this issue. The list of possible amounts generated by the word segmentation hypotheses is used as lexicon for the courtesy amount recognition. The order of magnitude of the amount is estimated during legal amount recognition. We treat the courtesy amount as a numeral string and apply the same word recognition scheme as used for the legal amount. Our approach to check recognition differs from traditional methods in two significant aspects: First, our emphasis on both the legal and the courtesy amounts is balanced. We use an accurate word recognizer which performs equally well on alpha words and digit strings. Second, our combination strategy is serial rather than the commonly used parallel method. Experimental results show that 43.8% of check images are correctly read with an error rate of 0%.
Hand Gesture Recognition using Ensembles of Radial Basis Function (RBF) Networks and Decision Trees
Authors: Gutta Srinivas , Imam Ibrahim F. , Wechsler Harry 
Published: October 2003

Hand gestures are the natural form of communication among people, yet human-computer interaction is still limited to mice movements. The use of hand gestures in the field of human-computer interaction has attracted renewed interest in the past several years. Special glove-based devices have been developed to analyze finger and hand motion and use them to manipulate and explore virtual worlds. To further enrich the naturalness of the interaction, different computer vision-based techniques have been developed. At the same time the need for more efficient systems has resulted in new gesture recognition approaches. In this paper we present an hybrid intelligent system for hand gesture recognition. The hybrid approach consists of an ensemble of connectionist networks — radial basis functions (RBF) — and inductive decision trees (AQDT). Cross Validation (CV) experimental results yield a false negative rate of 1.7% and a false positive rate of 1% while the evaluation takes place on a data base including 150 images corresponding to 15 gestures of 5 subjects. In order to assess the robustness of the system, the vocabulary of the gestures has been increased from 15 to 25 and the size of the database from 150 to 750 images corresponding now to 15 subjects. Cross Validation (CV) experimental results yield a false negative rate of 3.6% and a false positive rate of 1.8% respectively. The benefits of our hybrid architecture include (i) robustness via query by consensus as provided by ensembles of networks when facing the inherent variability of the image formation and data acquisition process, (ii) classifications made using decision trees, (iii) flexible and adaptive thresholds as opposed to ad hoc and hard thresholds and (iv) interpretability of the way classification and retrieval is eventually achieved.