bluuebunny/crossref_metadata_2025 huggingface dataset:
A realtime learning algorithm for recurrent neural networks
Authors: Uchiyama Tadasu , Shimohara Katsunori
Published: July 2007

In recent years, recurrent networks have been attracting attention as a processing mechanism of spatiotemporal patterns by neural networks. Although learning algorithms based on the steepest descent method have been proposed by Williams and Zipser and by Pearlmutter, that of Williams and Zipser has a problem of increased computational complexity for large‐scale networks, and Pearlmutter1s has a flaw in that learning cannot be completed in a real time.

In this paper, gradients of objective functionals are derived by variational calculus and a real‐time computation method of gradients is proposed. With this method, it is expected that the real‐time learning, requiring less computational complexity compared to conventional learning algorithms, will become possible.
A point‐inclusion algorithm for a domain with boundary composed of algebraic curve segments
Authors: Ying Jiang‐Qian , Sugie Noboru
Published: July 2007

In this paper an algorithm is given which decides, for a domain with boundary composed of planar algebraic curve segments, whether an arbitrary point is inside or external to the domain. The algebraic curve segments of the algorithm are assumed to be contained in rectangles or other polygons (which may not contain other pieces of the curve). We discuss which curve segments have this representation. When the curves are conic sections, we give some simple rules for constructing the representation.
Texture Discrimination Using Self‐Organized Multiresolution Filtering
Authors: Sakou Hiroshi , Matsushima Hitoshi , Ejiri Masakazu
Published: July 2007

In texture discrimination the basic image processes are considered to choose effective resolution, to determine representative features and to unify subregions having the same representative features. To realize these processes, this paper presents an improved method for discriminating higher‐order features by using a self‐organized multiresolutional filter.

First, we make a local transformation function with the maximum discrimination ability by a limited‐size neighborhood operation. Next, extending the method to the multiresolutional case, we let neighbor pixels of resolution which is optimal for discrimination be chosen automatically. Moreover, we realize unification of texture regions by connecting features represented by these pixel values and by obtaining macro‐features.

In this paper we also describe examples in which this method is applied to extract title characters from printed pages and to extract a specific part from a map image, and show that this method using higher‐order features possess sufficient discrimination ability for real texture images.
Photometric stereo under illumination from unknown zenith angles
Authors: Iwahori Yuji , Sugie Hidezumi , Ishii Naohiro
Published: July 2007

As a photometric stereo method, this paper proposes a new algorithm for reconstructing a surface shape under the condition that the information of zenith angles of three light source directions is unknown.

The object has a uniform Lambertian surface which has whole gradients. An illuminating equation consisting of the parameters of light source directions is derived from the information of three shading images. The simultaneous equations can be held at multiple surface elements and be solved by the method of least squares. This method makes it possible to extract the information of zenith angles of three lighting directions and optimized surface gradient distribution of the object.

When the method of least squares is applied, a method to set the initial values for three zenith angles of lighting directions is described, and a method to select surface elements which construct the objective function is proposed. The effectiveness and the validity are confirmed by computer experiments.

While the conventional photometric stereo treats the information of zenith angles and azimuth angles of three lighting directions as known constants, this algorithm can make it possible to reconstruct the surface shape from the information of only the azimuth angles of lighting directions.
Efficient algorithms for realizing a layout of complete binary trees
Authors: Fukushima Yumi , Igarashi Yoshihide
Published: July 2007

This paper discusses an efficient algorithm for realizing a layout of complete binary trees. This algorithm is an improvement of Ullman's layout method for complete binary trees. This layout is composed of H‐trees, vertical trees, and a horizontal tree. The vertical trees and a horizontal tree have the same structure.

First, a simple algorithm based on the pre‐order of a horizontal tree is given. This pre‐order algorithm realized the layout by Ullman, and the area and the maximum edge length of a complete binary tree by this method attain the respective lower bounds.

Next, an improved algorithm based on the post‐order of a horizontal tree is presented. The area of a complete binary tree by this method is two‐thirds that of the previous method when the height of the tree is sufficiently large. Also, the maximum edge length is the same as that by Ullman's method.
Neural network model for realtime adaptation to rapidly changing environments
Authors: Okamoto Yoshinori
Published: July 2007

We propose a new neural network model called the paradigm model (PDM), which adapts to rapidly changing, nonstationary environments in real time. The creation and destruction of cells play an important role in PDM training, and we show by simulation that for an application in a noisy and rapidly changing environment, the performance of PDM exceeds that of existing, parametric neural network models. PDM is an extension of the existing RCE (restricted Coulomb energy) model which does not use iterative computation, is easily retrained and can be implemented using integer arithmetic. The PDM model solves the problem that in noisy and nonstationary environments, the number of cells in the middle layer of the RCE model increases without bound. In addition, we show the influence of the PDM training parameters on the recognition rate, number of cells in the middle layer, and the number of cells eliminated from the middle layer.
A drawing editor key 3 with capabilities of defining figure parts and preserving connection/inclusion relationships
Authors: Matsuura Toshio , Naota Hajime , Nakamura Makoto
Published: July 2007

A WYSIWYG style drawing editor Key 3 was designed and implemented with the following special functions: (1) Key 3 which allows users to define figure parts by selecting figures directly on the screen and also by describing figures in a language Keyfig designed by the authors in which formal parameters may be used; (2) Key 3 which recognizes topological relationships such as connection and inclusion between figures. Such relationships can be preserved when objects are moved or resized. The drawing time and the CPU time for some typical examples are measured. The experiment shows that the foregoing functions are useful and that the authors' implementation is reasonable.
Automatic shape model acquisition based on a generalization of convex/concave structure
Authors: Ueda Naonori , Suzuki Satoshi
Published: July 2007

This paper proposes a novel method for acquiring a shape model from shape samples of the same class. In conventional approaches, a priori knowledge and unique parts segmentation are needed because they perform generalization of predefined symbolic concepts. Moreover, they cannot form visual shape models because the model is represented as parts and parts relationships in the form of graph models such as semantic networks and multilevel graphs.

The approach herein can directly acquire a visual model from a few samples without a priori knowledge because it is based on the generalization of multiscale convex/concave structure of a class of shapes.

First, an optimal scale convex/concave segment structure common to shape samples using a multiscale segment matching method is extracted. Then the extracted segments are integrated to create generalized shapes. Finally, an importance measure based on the optimal scale is assigned to each convex/concave segment of the generalized shapes. That is, the proposed shape models consist of conjunctive descriptions as for the convex/concave segment structures, disjunctive descriptions as for the convex/concave segment forms, and the importance measure assigned to each segment of the shape model. A shape recognition method using the acquired models also is presented. Experimental results show the usefulness of the proposed method.
A universal literal circuit and its application to quaternary logic networks
Authors: Zukeran Chotei , Nagata Yasunori , Afuso Chushin , Honda Makoto , Nagamine Yutaka
Published: July 2007

A new type of universal literal circuit, in which two thresholds of the circuit are variable and controlled by external signals, is proposed herein. The circuit is designed with CMOS‐FETs, and both computer simulation by FSPICE and experiments on bread‐board with discrete elements confirm its correct operation.

A new type of basic quaternary operator, quaternary U‐gate, is also introduced. The U‐gate comprises a pair of CMOS pass transistors driven by the output of the universal literal circuit. Mathematical properties of the U‐gate are derived, and synthesis procedures of quaternary logic functions using U‐gates are given. The quaternary U‐gate and quaternary constants form a complete set of quaternary operators and its mathematical properties implicate those of CP‐gates and SCP‐gates.
Surface reconstruction from a contour line image by regularization
Authors: Muraki Shigeru , Yokoya Naokazu , Yamamoto Kazuhiko
Published: July 2007

The regularization method, which recovers three‐dimensional (3‐D) information from an image by solving the problem of minimizing an energy functional, has recently been applied to various problems in computer vision.

This paper proposes an algorithm for reconstructing a detailed 3‐D shape from a contour line image and a sparse set of altitude data by adding a new constraint that points on the same contour line have the same altitude to surface reconstruction by the traditional regularization method.

The problem of minimizing an energy functional defined in this paper is reduced to a problem in a very systematic way. This method is applied in practice to contour lines extracted from a real topographic map and geographic numerical information to verify that terrain surface reconstruction from a topographic map is possible.
A hand gesture recognition method and its application
Authors: Takahashi Tomoichi , Kishino Fumio
Published: July 2007

If information concerning speech and hand gestures is handled in an integrated way, a more user‐friendly interface will be realized. These are defined here as the “hand gesture” as the “shape and motion of hands to transmit the intention of the speaker.” They aim at the realization of the hand gesture interface.

Using the hand shape input device Data GloveTM, we investigate the coding of the hand shape/motion information, a series of hand shapes in a continuous motion and the recognition method for the hand motion. For the case of hand shape/motion in the alphabet gesture in the sign language, a recognition experiment is executed. It is verified that some 20 hand gestures can be recognized, including the dynamic hand gestures. As the interface for the map guidance system, the instruction by speech and hand gesture is realized.
An asynchronous parallel branch‐and‐bound algorithm
Authors: Kawaguchi Tsuyoshi , Masuyama Hiroshi , Maeda Tamotsu
Published: July 2007

This paper presents a parallel branch‐and‐bound algorithm which is applicable to a loosely coupled multiprocessor with nonhierarchical interconnection network such as torus or hypercube. This algorithm is asynchronous and processing elements (PEs) start evaluation of nodes without being synchronized. Thus, when each PE finishes evaluation of one node, it can immediately start the evaluation of the next node.

First, we compared the performance for parallel branch‐and‐bound algorithms which have almost the same communication overhead. From the simulation results it was confirmed that when the proposed algorithm is applied to a torus machine, an efficiency (speed‐up rate divided by the number of PEs) is obtained which is about twice better than that of the existing synchronous algorithm for the improved tree machine and about 1.4 times better than that of the synchronous algorithm for a torus machine proposed by the authors. Interconnection networks among PEs suitable for parallelization of branch‐and‐bound algorithms were investigated by applying the algorithm in this paper to several kinds of interconnection networks among PEs.

As the results, it was found that even in the case in which communication time between adjacent PEs has very little effect on the execution time of an algorithm, a hypercube machine realizes almost the same efficiency as that of an interconnection network with a larger degree of PEs.
Edge feature determination by using neural networks based on a blurred edge model
Authors: Naruse Hiroshi , Ide Atsushi , Tateda Mitsuhiro , Nomura Yoshihiko
Published: July 2007

This paper proposes a new model fit‐type edge feature measurement method. The characteristic of the proposed method is that it introduces a blurred edge model which matches well with a gray‐level pattern of an edge in an image actually observed. The blurred edge model is constructed by using not only edge features, which are the edge position and orientation within the pixel, but also the point spread function which expresses the image degradation during the image recording process as parameters. By using this model, the gray level of the multiple pixels near the edge for the various edge feature values is calculated, and a map is obtained from the edge features to the gray‐level pattern.

Next, the inverse map which obtains edge features from a gray‐level pattern is obtained in advance through learning by using error backpropagation‐type neural networks consisting of three layers. By using the obtained inverse map, the edge features are determined from the gray‐level pattern of the actually observed image.

Conventionally, since it was necessary to obtain this inverse map analytically, the edge model that could be used was restricted to the step‐edge type. On the other hand, with the method being proposed which utilizes the neural networks, an arbitrary optimal edge model for an individual image recording device can be used. For this reason, edge features can be determined precisely with this method even from local information. Many measurement experiments which changed the edge position and orientation were performed and the effectiveness of this method was confirmed.
A new information criterion combined with cross‐validation method to estimate generalization capability
Authors: Wada Yasuhiro , Kawato Mitsuo
Published: July 2007

Neural network learning processes use only a limited number of examples of a given problem. Thus, generally speaking, it is not necessarily theoretically guaranteed that the trained network can give correct answers for unknown examples. A new method of selecting the optimal neural network structure with maximum generalization capability is proposed. In statistical mathematics, several information criteria, such as AIC (Akaike's information criterion), BIC (Bayesian information criterion), and MDL (minimum description length), are used widely to select a suitable model. Applications of these criteria were quite successful, especially for linear models. These criteria assume that the model parameters are estimated correctly by using the maximum likelihood method. Unfortunately, however, this assumption does not hold for conventional iterative learning processes such as backpropagation in multilayer perceptrons or Boltzmann machine learning. Thus, we should not apply AIC directly to the selection of the optimal neural network structure.

In this paper, by expanding AIC, a new information criterion is proposed that can estimate generalization capability without the maximum likelihood estimator of synaptic weights. The cross‐validation method is used to calculate the new information criterion. By computer simulation, we show that the proposed information criterion can accurately predict the generalization capability of multilayer perceptrons, and thus the optimal number of hidden units can be determined.
Simple parallel algorithms to compute interval maxima
Authors: Nakano Koji , Tokura Nobuki , Masuzawa Toshimitsu
Published: July 2007

The interval maxima problem is a problem to compute each interval maximum max{in(si), …, in(ti)} for given n data in(O), …, in(n ‐ 1) and a number of intervals [s1, t1], [s2, t2]. The following result is already known:.

(1) On the CRCW‐PRAM, each interval maximum can be computed using a single processor in O(1) time, after preprocessing using n/log log n processors in O(log log n) time.

The following two algorithms are shown in this paper.

(2) On the CRCW‐PRAM, each interval maximum can be computed using a single processor in O(log log n) time, after preprocessing using n/log log n processors in O(log log n) time.

(3) On the CRCW‐PRAM, each interval maximum can be computed using a single processor O(1) time, after preprocessing using n1ϵ processors in O(1) time for every fixed ϵ > 0.

These two algorithms are simpler than the algorithm (1). The preprocessing time in algorithm (3) is shorter than in (1), although a larger number of processors are employed.
Noise immunity learning for word‐spotting speech recognition
Authors: Takebayashi Yoichi , Kanazawa Hiroshi
Published: July 2007

This paper discusses noise immunity learning in speech recognition by word‐spotting. In the proposed method, the learning speech data with superposed noise is constructed by adding the noise data to the clean speech data collected beforehand. Then the recognition dictionary for word‐spotting is trained to improve noise immunity. In the learning, the recognition by word‐spotting is attempted for the artificially synthesized learning data while gradually increasing the ratio of the contained noise. The recognition is executed using the learning word feature vector automatically extracted based on the similarity.

The noise immunity is realized by the simulation in the noisy environment and the automatic learning. The recognition and learning use the word as the unit and the multiple similarity method, which can cope with a wide range of pattern deformation. An evaluation experiment is executed using 13‐word speech data (plus noise in a railway station). For the case of 96‐dimensional word feature vector (eight dimensions for frequency and 12 dimensions for time), and S/N ratio of 10 dB, the recognition rate is improved from 85.5 percent in the word‐spotting method without learning to 94.1 percent with learning. This indicates the usefulness of the proposed method.
A method of acquiring strategies and classifying knowledge from trace data
Authors: Kobayashi Satoshi , Ohsuga Setsuo , Hori Kohichi , Yamauchi Toshiyuki
Published: July 2007

It is important for a knowledge processing system to have a meta‐level inference mechanism for reducing problem search space. The authors have developed such a mechanism for KAUS (Knowledge Acquisition and Utilization System) and applied it to control system design, chemical structure design, etc. However, it is difficult for the domain experts to give meta‐level knowledge. This is partly because the object knowledge is not well structured in their minds.

This paper proposes a method to classify knowledge and to acquire strategies for improving system performance from trace data. Results of two experiments are given to show the effectiveness of the proposed method.
A new multiversion concurrency control algorithm for partial update transactions and bulk retrieval transactions
Authors: Kataoka Ryoji , Satoh Tetsuji , Inoue Ushio
Published: July 2007

With the advanced use of databases, on‐line and batch transactions are executed concurrently. Then a demand arose for the concurrency control method which can realize the excellent on‐line transaction processing independently of the batch transactions. The multiversion concurrency control is suitable for such a requirement.

This paper proposes a new multiversion concurrency control algorithm which has a high concurrency between the partial update transactions, which is a typical on‐line transaction, and the bulk retrieval transactions, which is a typical batch transaction. The algorithm is based on a mixture of an improved two‐version, two‐phase locking and the multiversion time stamp ordering. It is shown as simulation results that the proposed algorithm is better than the traditional ones in terms of the completion ratio of the partial update and the completion ratio of the bulk retrieval, independently of the number of partial updates executed concurrently. It is shown also that the algorithm is better than the traditional ones in such an environment since the data contention between partial update transactions is high.
Gaze point detection system allowing head motion
Authors: Iida Muneo , Tomono Akira
Published: July 2007

Since human eye movement easily follows one's intention, it is possible to use this to instruct a computer through a display screen, e.g., selection of a menu and control of a cursor. This paper proposes a method to detect a gaze point on a display screen independently of the movement of an operator's head. The method uses an eye tracker based on the limbus boundary method and a three‐dimensional (3‐D) magnetic sensor which determines the position of an operator's head in a fixed coordinate. Experiments show that position‐detection errors are about 1°, and this is enough for this application. To overcome an effect caused by a small involuntary movement of eyes around a target, a mouse is used at the same time. Experimental comparison between the proposed method (with a mouse) and a conventional operation (a mouse alone) shows that the former is faster when a target is relatively separated from the center, i.e., the method is effective.
A shell‐oriented boolean set operations algorithm suited for the b‐reps based on boundary edge loops
Authors: Kitajima Katsuhiro , Yamaguchi Mitsunori
Published: July 2007

This paper presents a shell‐oriented Boolean set operations algorithm which is simple and makes the most of the F‐L‐E‐V type B‐reps based on boundary edge loops of a face. The characteristic feature of the algorithm is that it resolves an operation between solids into plural operations between faces, generates intermediate open shells and finally reconstructs a new solid by combining them. The method is quite different from the conventional edge‐oriented algorithm, e.g., that of BUILD, which is suited for the well‐known winged‐edge type B‐reps based on the information with respect to the individual edges.

First, the outline of the conventional set operations algorithm is shown, which is suited for the winged‐edge type B‐reps and is used in almost all conventional solid modellers. Afterward, in comparison to it, our algorithm is discussed in detail.

An algorithm for the case of a basic intersection, with which the basic algorithms in other set operations, i.e., union and set difference, are also realized, is described first and then some essential expansions are made to meet more complex and particular conditions.
A stereo matching algorithm: An adaptive window based on a statistical model
Authors: Okutomi Masatoshi , Kanade Takeo
Published: July 2007

This paper describes a stereo matching algorithm capable of selecting an appropriate window size to achieve both objectives of precise localization and stable estimation in scene correspondence. Window size is an important parameter that depends on two local attributes: local intensity variation and scene disparity variation. A statistical model is introduced for evaluating the impact of these two types of variations on the uncertainty of disparity estimation and proposes a method of selecting an appropriate window size to minimize the uncertainty of the estimation. Experiments have been conducted for various window sizes. The experimental results demonstrate the effectiveness of the proposed model and the matching algorithm with an adaptive window.
Extracting distance from defocused images with different aperture sizes
Authors: Iwane Masahiko
Published: July 2007

Using a geometrical optics model, a method is derived for estimating distance from two images with blur due to defocus aberration taken under different conditions of aperture sizes in general illumination to an object.

First, it is shown that the Fourier spectrum of geometrical optics spatial frequency characteristics can be approximated by Gaussian‐type functions.

Next, the relationship between radii of blur circles and Gaussian‐type functions is clarified. It is shown that the ratio of Fourier spectra of two defocused images depends only on the radii of blur circles and that the distance to the object can be estimated by estimating blur spreading radii from two defocused images by the least‐square method. Experiments were conducted using commercially available equipment. Distance errors within 9 percent were obtained in the cases of defocused images with F = 1.4 and F = 2.8 and of about 4 percent in the cases of defocused images of general scenes with F = 2 and F = 4. Thus, the effectiveness of this method was shown.
A complete spanning tree maintenance algorithm and its complexity
Authors: Saitoh Akinori , Tsujino Yoshihiro , Tokura Nobuki
Published: July 2007

The spanning tree maintenance problem for an LAN model in which node processors may halt and recover is considered. An algorithm meeting the conditions that the spanning tree is an L‐ary complete tree and that nodes halt or recover singly is presented. The message complexity of this algorithm is shown to be comparable with local computational complexity.
Constructing hierarchies for incomplete frames
Authors: Ohkawa Takenao , Koizumi Kazuhiko , Babaguchi Noboru , Tezuka Yoshikazu
Published: July 2007

A frame is characterized as the hierarchical description with the object as the unit. On the other hand, it is not always true that the information is obtained by an interview with an expert or by observation in a systematic form. Then the obtained frames are described independently. It is desirable to organize the frames systematically by generating the class hierarchy. However, the frame contains incomplete information, such as undefined or indefinite attribute,and the traditional classification techniques based on the conceptual clustering cannot handle such information.

This paper proposes a method to generate the class frame and construct the hierarchy for the frames with mixed undefined and indefinite attributes. In the classification of the frames containing incomplete information, the proposed method considers the attribute values other than the attributes describing the incomplete information and constructs the hierarchy by classifying the frames to the class containing the most similar frame.

The validity of the generated classes, the effectiveness of the expansion procedure for the hierarchical tree, the validity of the evaluation criterion for the quality of the hierarchical tree, and the estimation performance for the attribute value in the classification of the undefined attribute are examined.
Advanced explanation capabilities for intelligent tutoring systems: The explanation structure model (EXSEL)
Authors: Kashihara Akihiro , Hirashima Tsukasa , Toyoda Jun'ichi , Nakamura Yuichi
Published: July 2007

This paper introduces an advanced explanation capability for the intelligent tutoring system (ITS) to assist students in understanding objects such as electric circuits designed by humans. In general, an object can be explained in various ways. To advance the explanation capability, it is necessary to clarify how these explanations are used properly according to some tutoring goals in the domain. Moreover, the design of ITS based on such a capability requires: (1) classification of explanations based on the tutoring goals, and (2) development of a facility to generate the classified explanations.

First, this paper defines object understanding by using two concepts, i.e., viewpoint and object model, and classifies explanations by regarding the defined object understanding as a tutoring goal.

Next, the explanation facility, Explanation Structure model (EXSEL) is proposed. EXSEL has a mechanism to generate an explanation structure that is regarded as a resource of explanation and is designed in due consideration of being applied to ITS.

The definition of object understanding, the classification of explanations and EXSEL are applicable to the objects explainable at three abstraction levels: structure, behavior, and function. Providing the mechanisms to operate EXSEL according to tutoring requisites such as the student's understanding, it is possible to realize various ITSs to support greatly object understanding.
Learning algorithms and the shape of the learning surface in recurrent neural networks
Authors: Watanabe Tatsumi , Uchikawa Yoshiki , Gouhara Kazutoshi
Published: July 2007

In recent years there has been a renewal of interest in recurrent neural networks (RNN) because learning algorithms for RNN have been derived by several independent groups. The network can express spatiotemporal patterns as the states of the neurons change with time. Since the network has connections with feedback loops between each neuron, it includes the majority of conventional neural network models.

The characteristics of three supervised learning algorithms are discussed from the viewpoint of: (1) formulations of gradient of the total squared error function; and (2) the number of calculations and amount of storage space, respectively. Through computer simulations the differences of convergence for each learning algorithm are investigated. For the backpropagation through time algorithm it is shown that the learning surface of RNN has two specific shapes, i.e., hills and valleys, and the learning descends gently on the steepest gradient forward along the bottom of a curved valley. These characteristics are basically consistent with those of the multilayer neural networks (MNN) analyzed by Gouhara and others.
A method of diagnosing single stuck‐at faults in combinational circuits
Authors: Yamada Teruhiko , Nakamura Yoshiyuki
Published: July 2007

A new method is proposed to diagnose single stuck‐at faults in combinational circuits. In this method, based on the operations of the nonfaulty circuit, first the possible faulty paths are examined from the primary outputs, at which errors have been observed, toward the primary inputs to narrow down the suspected faulty section. Then a fault simulation is conducted to deduce the fault location. According to the computational experiments it is expected that this method is faster than the conventional fault dictionary methods by about two orders of magnitude and the diagnosis time is almost proportional to the circuit size. Thus, this method is very effective for fault diagnosis of large‐scale circuits.
Performance comparison of neural network architectures for speaker‐independent phoneme recognition
Authors: Nakamura Satoru , Sawai Hidefumi
Published: July 2007

We applied several types of time‐delay neural networks (TDNNs), generally used for speaker‐dependent and multispeaker speech recognition, to speaker‐independent speech recognition and compared their performance. Six or 12 speakers were used to train each network, and recognition experiments for voiced stops /b, d, g/ were performed in open speaker mode. The best recognition rates were 91.3 percent and 93.6 percent, using six and 12 training speakers, respectively. We found that constructing modular networks, such as modular TDNN with each network corresponding to a speaker, is effective in terms of decreasing the number of training iterations needed, showing slightly better performance than with a single TDNN with a comparable network capacity. This is because the modular networks make use of limited capacity effectively. On the other hand, a single TDNN with an increased number of hidden units showed a recognition rate comparable to that of the modular TDNN.
Two kinds of pulse‐type hardware neuron models and their application to recognition circuits
Authors: Sekine Yoshifumi , Kanai Takeshi , Amamori Takehiko , Takahashi Shinya , Takeuchi Chie
Published: July 2007

Information processing by humans within themselves, e.g., such as reading letter characters, recognizing patterns, and other objects, and discriminating what they hear depends largely on the cerebral nerve. The human cerebrum learns various subjects and self‐organizes the human neural network with plastic changes of synapses that are formed through learning.

Based on this viewpoint, many studies on neural network models and synaptic transfer efficiency have been reported from the engineering field.

In this paper, the authors propose pulse‐type hardware neuron models. These models employ pulse‐type hardware cell body models which exhibit negative resistance characteristics and also chaos phenomena as reported in their earlier papers. The authors analyze the characteristics of the models and discuss an application of the models to a recognition circuit. That is, considering the subject of neurons, they propose pulse‐type hardware models taking into account that information transmission is in a form of pulse repetition rate and that the synaptic weight which is equivalent to the transmission efficiency of synapses is subject to plastic changes.

The pulse‐type hardware neuron models employ pulse‐type input/output circuits. The models are of a simple circuitry, consisting of a cell body section and a synaptic section. The cell body section employs V‐shaped transistors. The synaptic section employs a CR time constant circuit to simulate the synaptic weight and a MOS variable capacitance device to simulate plastic changes of synapses.

The authors propose two models. One type changes depending on learning signals which include functions of external signals such as teacher signal, as an example of the plastic change of synaptic weight. The other model is of a type that changes depending on the input signal. The learning functions of the models are discussed by applying Hebb's rule as a typical learning rule. It is concluded that the pulse‐type hardware neuron models provide methods for plastic synapse models with learning and memory functions, and also for synapse models with square characteristics.

The neural network models made of these pulse‐type hardware neuron models are effective for pattern recognition circuits, including vowel speech pattern recognition circuits.
Three-dimensional isocompositional profiles of buried SiGe∕Si(001) islands
Authors: Katsaros G. , Stoffel M. , Rastelli A. , Schmidt O. G. , Kern K. , Tersoff J.
Published: July 2007

The authors investigate the composition profile of SiGe islands after capping with Si to form quantum dots, using a two step etching procedure and atomic force microscopy. Initially, the Si capping layers are removed by etching selectively Si over Ge and then the composition of the disclosed islands is addressed by selectively etching Ge over Si. For samples grown at 580°C the authors show that even when overgrowth leads to a flat Si surface and the islands undergo strong morphological changes, a Ge-rich core region is still preserved in the dot. At high growth and overgrowth temperatures (740°C), the experiments show that the newly formed base of the buried islands is more Si rich than their top. Furthermore, the authors find that for the growth conditions used, no lateral motion takes place during capping.
From anticolonialism to postcolonialism: The emergence of Chinese indigenous psychology in Taiwan
Authors: Hwang Kwang‐Kuo
Published: July 2007

This article gives a brief history of the emergence of Chinese indigenous psychology from the background of Westernized social psychology in Taiwan, and reviews the various debates that have surrounded the first decade of its progress from the perspectives of ontology, epistemology, and methodology. Careful analysis of these debates indicates that their themes are similar to dilemmas encountered by indigenous psychologists in other regions of the world. It is argued that breakthroughs need to be made on three levels for the development of indigenous psychology, namely, philosophical reflection, theoretical construction, and empirical research. There are three philosophical assumptions in cross‐cultural psychology—absolutism, universalism, and relativism—which correspond to three research orientations—imposed etic, derived etic, and emic. In order to achieve the goal of establishing a global psychology, then indigenous psychologists in non‐Western societies must change their thinking from anticolonialism to postcolonialism; switch their philosophical assumption from relativism to universalism; assimilate the Western academic tradition; adopt a multiparadigm approach to construct formal theories on the functioning and mechanisms of the universal mind; use these to analyse the specific mentalities of a given culture; and use the results of this theoretical construction as a frame of reference for empirical research.
Invested with Life: Wall Painting and Imagery before the Qajars
Authors: Diba Layla S.
Published: July 2007

In the majority of Islamic countries, the art of painting has been restricted to non-figural and geometric designs in the public sphere, and strictly limited to small-scale narrative illustrations of manuscripts in the private sphere. By contrast, Qajar Iran witnessed the development of large-scale figural painting. Such a decisive break with Islamic tradition—where religious and social beliefs were primarily expressed through textual and calligraphic means—indicates that Iran possessed a distinctive, strongly visual culture. Nevertheless, Qajar painting has been perceived in the past as an offshoot of European easel painting.

In fact, Qajar painting, most particularly during the reign of the second ruler Fath ᶜAli Shah (1797-1834), represents the culmination of a long-standing indigenous tradition of imagery in both monumental painting and sculptural formats, primarily utilized for the decoration of palaces, exemplified by the bas reliefs and sculptures of the Achaemenid palace of Persepolis. Wall painting predated and subsequently coexisted with the better known traditions of decorative and manuscript painting.
The Caucasian Connection: National Identity in the Ballets of Aram Khachaturian
Authors: Robinson Harlow
Published: July 2007

The ballets of Aram Khachaturian (1903-1978) occupy a special place in the history of Soviet ballet and of Soviet music. Considered along with Dmitri Shostakovich and Sergei Prokofiev as one of the leaders of Soviet music, Khachaturian devoted many years to the creation of ballet, although in the end he produced only three ballet scores: Schast'e [Happiness], completed in 1939; Gayane, completed in 1942; and Spartak [Spartacus], completed in 1954. Of these three, Gayane and Spartacus (both repeatedly revised) were notably successful, both immediately acclaimed as important new achievements in the development of an identifiably Soviet ballet style. Taken on tour abroad by the Bolshoi Ballet in a revised version, Spartacus also became one of the most internationally successful ballets written by a Soviet composer, although it never came close to equaling the international recognition eventually achieved by Prokofiev's Soviet ballets Romeo and Juliet or Cinderella. Gayane was not widely staged outside the USSR, but some of the music from the ballet, arranged into three orchestral suites by the composer, became very popular internationally—particularly the “Sabre Dance,” which became the single most recognized piece of Khachaturian, recycled repeatedly in Hollywood film scores.
2004 HES Presidential Address: Autobiographical Memory and the Historiography of Economics
Authors: Weintraub E. Roy
Published: July 2007

In his autobiographical piece, “A Jevonian Seditionist,” Sidney Weintraub ([1983]1989, p. 50) recalled that in 1957 he sent an offprint of his paper on the micro-foundations of aggregate supply to D. H. Robertson. He remembered that “Robertson generously wrote me that it was ‘lucid and definitive,’ and that thenceforth he would not return to the subject again. I confess that I have lost or misplaced his letter, along with the one by [Alan] Sproul, in my move to Canada, though they were prized possessions.” And I have my own memory of a conversation with Sidney in which he told me that Robertson had written in that letter “If this is not what Keynes meant, it is what he should have meant.”
NARCOTIC MORTALITY: SOME IMPLICATIONS FOR DRUG PROGRAMS
Authors: Walsh Raoul A.
Published: July 2007

Widely held community beliefs about the mortality rates associated with narcotics use are examined in the light of published data from follow‐up studies. It is suggested that media reports, and even some health professionals, have tended to exaggerate these mortality rates. Some implications of these follow‐up studies for workers involved in drug dependence programs are discussed.
CHEMICAL DEPENDENCY AND RELIGIOUS AFFILIATION
Authors: STANHOPE J.M.
Published: July 2007

All first attendees at the Langton Clinic during 12 months beginning 1st December, 1980 were surveyed for certain demographic characteristics, including religion. Alcohol and opiate users were compared with state and national census populations. Catholics and Lutherans were more common among attendees than expected and Methodists and Orthodox less common. Persons professing no religion were possibly more common than expected, but difficult to assess because of wide state/national population differences.
TREATMENT OF OPIOID DEPENDENCE
Authors: O'NEILL KEVIN A. , REILLY DAVID K. , SINCLAIR RONA
Published: July 2007

The range of treatment interventions for opioid‐, mainly heroin‐related problems are listed. Matching client problems to appropriate interventions is emphasised. The four main broad approaches available in N.S.W. are described:

Detoxification

Methadone maintenance

Therapeutic communities

Outpatient management
INTERVENTION BY THE CLINICIAN TO MOTIVATE THE ALCOHOLIC
Authors: WILSON GEORGE C.
Published: July 2007

The alcoholic patient often cannot recognise his disorder and accept the need for treatment because of his own profound denial. Enabling behaviour by family, friends, fellow workers and medical practitioners, which covers up the alcoholism, often delays recovery. Clinicians can help the alcoholic patient by confronting him with his early behavioural changes and later organic findings indicating alcoholism.

Where the alcoholic consistently refuses treatment, concerned persons can be helped by instruction about the illness. A planned intervention can serve to break down the alcoholic's denial and prevent progression of his alcohol‐induced problems. This paper details the elements of confrontation and intervention with special reference to pre‐intervention training of concerning people.
An Analysis of the Conspiracy: Media, Industry, Health and Welfare Workers and Government
Authors: Hawks D. V.
Published: July 2007

Abstract:While it is accepted by most clinicians that denial forms part of the alcoholic's response to his problem and is often shared by his close associates, it is less frequently acknowledged that the same mechanism operates at a societal level. Examples are given of the operation of denial and of minimisation which implicate the health professions, governments and government agencies, the alcohol industry, the media and the international community.
Early Intervention for Problem Drinking in New Zealand Hospitals
Authors: Elvy G.A.
Published: July 2007

Abstract: Early intervention programs for problem drinkers in New Zealand hospitals are discussed. Preliminary studies indicated a high rate of unrecognised and untreated alcohol problems in general hospitals. A screening instrument, the CAST, was devised and is now routinely used throughout New Zealand general hospitals. A survey of 263 non‐paediatric patients screened as problem drinkers showed that referral to counselling can be beneficial for less serious problem drinkers and that follow‐up itself can be helpful.
Detection and Management of Alcohol Related Problems in General Practice
Authors: McLean Neil J.
Published: July 2007

Abstract: It has often been suggested that general practitioners (GPs) are in an ideal position to detect early signs of alcohol related problems amongst their patients. However it appears that GPs often do not recognize the signs and symptoms of excessive alcohol consumption, and even when they do suspect that their patients are drinking too much, they are uneasy about discussing the issue. There is a gap between what GPs say they should do, and what they actually do; they acknowledge that warning patients about alcohol and health is part of their role, but in practice they neglect opportunities to promote healthy drinking. Some possible explanations of the gap between rhetoric and practice are discussed. General practitioners have been successful in helping patients give up smoking and this work is seen as a model for alcohol related interventions. A kit to assist the GPs respond to their drinking patients is currently being developed and evaluated. Early indications are that GPs are still reluctant to raise the topic of alcohol with their patients, even though their reactions to the kit are favourable.
Iatrogenesis? Medical power and drug laws 1900–30
Authors: Manderson D.R.A.
Published: July 2007

Abstract: The article proposes to examine the development of laws making the sale of “dangerous drugs” such as heroin and cocaine illegal except on a doctor's prescription. These laws were principally a reflection of the growing power and authority of the medical profession; they signalled the defeat of the sellers of proprietary medicines and the subordination of pharmacists. The appropriation of drugs by the medical profession also took power away from the population at large and denied their right to use drugs as they chose. The medical profession thus redefined the “consumers” of drugs as “patients”.
How Alcoholics Anonymous came about
Authors: Wilson G.C.
Published: July 2007

Abstract: Though Alcoholics Anonymous (AA) drew inspiration from several sources, its co‐founder emphasised that the Oxford Group made the greatest contribution to its practical programme of recovery. The story of AA's beginning, growth and spread to Australia is recounted in this paper, simply, without comment.