bluuebunny/crossref_metadata_2025_split huggingface dataset:
Evolving sse: A new population‐oriented search scheme based on schemata processing
Authors: Aizawa Akiko N. 
Published: July 2007

AbstractA new population‐oriented search algorithm called Stochastic Schemata Exploiter (SSE) is proposed here. Similarly to genetic algorithms (GAs), SSE also performs search in the space of solutions by a schemata processing mechanism; however, SSE is characterized by an emphasis on local search. So far, the adaptive global search ability of GAs has been viewed positively. In contrast, SSE takes the point of view that, when applied to actual optimization problems, the GA adaptive global search ability is not necessarily effective; instead, the global search is started by simplifying the population‐oriented search of GAs and reducing the number of control parameters. After reviewing herein the schemata processing in GAs, the property of schemata exploitation is defined, a schemata exploitation search algorithm is devised and the proposed method is evaluated and compared with a simple GA using GA‐easy and GA‐hard test problems.
Experimental study of recognition rate in statistical pattern classification based on finite size of design sample set
Authors: Takeshita Tetsuo , Nozawa Shigeyuki , Toriwaki Jun‐Ichiro 
Published: July 2007

AbstractWhen two classes of patterns follow the multidimensional normal distribution, the following procedure is considered. The same number of finite samples is extracted from each set of patterns. The covariance matrices and the average vectors are estimated. Using the estimated parameters, the linear discriminant function or the quadratic discriminant function is assessed by testing how correctly other samples extracted from the same set can be recognized. The authors found a method in which the above method is iterated to examine the deterioration of the recognition ratio due to the finiteness of the learning samples and to calculate the average recognition ratio.Next, the relations among the dimension of the feature patterns, the number of learning samples and the average recognition ratio are examined and compared to the expression for the approximate recognition ratio (theoretical formula) by Raudys and Fukunaga et al. The limit of application of the evaluation formula is indicated. The deterioration of the recognition ratio is examined, and it is shown that the error ratio is higher in the Bayes decision, and the error ratio becomes closer to the ‐distribution when the dimension of the feature vector is increased.
Improvement of generalization for a perceptron with localized representation
Authors: Oohori Takahumi , Watanabe Kazuhisa , Hoshino Ken 
Published: July 2007

AbstractThis paper intends to solve problems in the BP learning in the conventional multilayered perceptron, and proposes two methods, the local generalization and the global generalization, improve the generalization ability of the perceptron with the localized representation. In the local generalization, the generalization learning is executed so that the generalization ability function based on the distance between the separating partial hyperplanes and the set of patterns for learning, is maximized under the given order of separation in the learning. A problem then is that the range of adjustment for the separating partial hyperplane is limited depending on the order of separations, which prevents the improvement of the generalization ability.In the global generalization, the generalization ability function is defined considering the order of category separation and the optimal separating partial hyperplanes are determined simultaneously to maximize the function.Simulation experiments are carried out for the learning task on the two‐dimensional plane and the recognition task for the handwritten Chinese characters. It is seen that the generalization ability is improved greatly. It is seen that the local generalization can realize nearly the same generalization ability, and the global generalization can realize a better generalization ability, compared to the BP learning.
The multidimensional persistent tree: A spatiotemporal data management structure suitable for spatial search
Authors: Teraoka Teruhiko , Maruyama Minoru , Nakamura Yasuaki , Nishida Shogo 
Published: July 2007

AbstractMultidimensional data structures have been proposed for management of spatial data including points, lines, and regions. Concomitantly, more research on temporal databases as a way to handle temporal information is needed. Although the management of spatiotemporal data becomes increasingly important in geographic information systems and computer‐aided design, these data structures cannot manage spatiotemporal data efficiently. In this paper, the MP‐tree (multidimensional persistent tree) is proposed for handling multidimensional data with insertion/deletion version without the loss of efficiency of a spatial search. The MP‐tree is developed by extending conventional spatial data structure using techniques of Persistent Search Tree. The advantages and disadvantages of conventional methods with respect to both search and memory efficiency are discussed. Finally, using computer simulations, the MP‐tree is shown to have better performances for both range search and spatiotemporal search.
Identification of complicated shape objects by fractal characteristic variables — categorizing dust particles on LSI wafer surface
Authors: Kamijo Masayoshi , Nakazawa Masaru , Shimizu Yoshio 
Published: July 2007

AbstractThis paper describes a mathematical model of dust particles having complex shapes, and an algorithm to identify them, aiming mainly at categorizing types of dust on an LSI wafer surface. Fractal dimension is used to represent the dust features. A conventional fractal dimension applied to specimens as a whole, however, does not sufficiently represent the shapes of dust in each category of the model.This paper introduces a local fractal dimension into a global fractal dimension so that the feature of a mathematical model can be represented. Also proposed is a method based on Mahalanobis' distance using a fractal characteristic valuable to categorize the data. The proposed method has been tested successively by using real data.
Direction‐invariant methodology for bill pattern recognition
Authors: Mese Michihiro , Sako Hiroshi , Miyatake Takafumi , Ejiri Masakazu , Ueda Hirotada 
Published: July 2007

AbstractThis paper presents a new pattern recognition method for the automatic discrimination of various kinds of bills. The pattern of the object input from the sensor fluctuates due to the a posteriori factors such as the orientation, position and rotation errors, as well as the a priori factors such as wrinkles and smears. The proposed method is to cope mostly with the fluctuations due to the a posteriori factors. It is noted first that the patterns obtained by the two sensing elements at the point‐symmetrical positions in regard to the center of the arrayed sensors are equivalent in terms of the orientation. Then, as the feature parameter for the discrimination, some Hadamard features are adopted which are suited to the processing by the microprocessors. Two feature parameters are derived from the bill pattern, which have a higher discrimination ability, and the “mutually paired domain judgment method” is proposed, where the matching discrimination is applied by exchanging those two features as feature points in the two‐dimensional space. The decision region to be used in the discrimination has the orientation‐invariant property due to the above equivalence, which helps to reduce greatly the memory capacity.Finally, the result of the evaluation experiment using the actual samples is presented. It is shown that the required misrecognition rate can be cleared if the number of elements with the point‐symmetry is increased. It is anticipated that the proposed method can also be used in the automatic recognition of other sheet‐shaped printings.
Image representation through gray‐scale iterated function systems
Authors: Honda Hiroyuki , Haseyama Miki , Kitajima Hideo 
Published: July 2007

AbstractImage representation using the random iterated function system (Random IFS) has a disadvantage in that it requires many iterations. This paper proposes image representation through a gray‐scale iterated function system. This method requires fewer iterations and it can obtain better images than the random IFS. The saving in iterations is realized first by the use of a deterministic method, whereas in the random IFS, each mapping is defined as a probablistic event, and it needs many iterations to satisfy the law of large numbers.In the proposed method, the reconstructed image converges faster than in the conventional method, and it is shown to yield better reconstructed images. Second, statistical characteristics of the IFS parameters are investigated to be used for further accelerating the IFS parameter search. The characteristics are shown to be stable among different images. Simulation results are included to demonstrate the effectiveness of the accelerated algorithm.
A phase connection method for communication protocols
Authors: Sano Tetsuo , Higuchi Masahiro , Seki Hiroyuki , Kasami Tadao 
Published: July 2007

AbstractAs one of the methods to define a large‐scale protocol by combining multiple subprotocols, Chow et al. proposed a method in which protocols satisfying a certain condition called phase are serially connected. In their method of connection, however, two conditions for connection are imposed: 1) the protocol machine should be modeled as a finite‐state machine; and 2) the two‐way channels should both be empty at the termination of the phase.This paper relaxes those two constraints, and proposes a more general method of phase connection. Using the method proposed in this paper, it is made possible, for example, to define the protocol containing the token passing control by connecting two phases, where the token is fixed in one of the protocol machines.
A structured object modeling method SOMM and its environment SOME
Authors: Harada Minoru , Sawada Takafumi , Fujisawa Terutada 
Published: July 2007

AbstractIt is often pointed out that existing object‐oriented analysis/design methods have problems that make comprehension of design diagrams difficult because too many classes are displayed in a single diagram, design diagrams cannot be reused and details of dynamic behavior cannot be described on design diagrams, etc. To solve these problems, an object modeling method called SOMM is proposed and its modeling environment SOME is proposed where design diagrams are hierarchically structured.With SOMM, objects are modeled from different viewpoints and are represented using four types of diagrams. Derivation Diagram: DD expresses inheritance relationships among classes; Object Diagram: OD represents association among classes; Even‐trace Diagram: ETD shows even communication sequence among classes; and State‐transition Diagram: STD expresses state transitions in a class life cycle. Aggregation among classes is represented by embedding (Zoom In) an object diagram into a class of another object diagram. As a result, the diagrams are hierarchically structurized. Moreover, because the diagrams are made and controlled for each class, reuse is easy.Further, all these three models of a class are stored in an integrated object, so SOME can check inconsistency among related diagrams and correct them.Meanwhile, the event‐trace diagram is extended to represent the details of dynamic behavior of a class, especially the sequence of reactions to the incoming event. Thus the programs could be made systematically and directly from the diagrams.
Recurrent SOLAR algorithm
Authors: Demura Kosei , Anzai Yuichiro , Kajiura Masahiro 
Published: July 2007

AbstractThis paper proposes the Recurrent SOLAR (Supervised One‐shot Learning Algorithm for Real number inputs) algorithm, that can complete learning by a single presentation of analog time series data. The most remarkable feature of the Recurrent SOLAR is the one‐shot learning, which has been difficult in the past modes, and which can be completed with a high speed by a single presentation of the time‐series input data composed of real numbers. The basic idea of the Recurrent SOLAR is the same as in the context model. The time is considered as discrete, and the connection weight of the feedback loop from the output unit or the hidden unit to the state units is fixed. Consequently, the recurrent network can be considered as a feed‐forward network.The backpropagation algorithm is used in the context model, while the SOLAR algorithm is applied to the Recurrent SOLAR, which is the one‐shot learning algorithm based on the pattern recognition theory. By the use of the SOLAR algorithm, the Recurrent SOLAR can learn the analog time‐series data by a single presentation without falling in a local minimum even for large‐scale data. In other words, it is a learning algorithm that is suited to an environment where high speed is required in the learning.
One‐dimensional processing architecture for gray‐scale morphology
Authors: Kojima Shiji , Miyakawa Tatsuo 
Published: July 2007

AbstractMathematical morphology is logically very clear, and has many applications because of its adaptability. They are two types of morphology — binary and gray‐scale. The mathematical base of binary morphology is expressed in logical AND/OR notation. Gray‐scale morphology is based on the addition and comparison of gray‐scale values. However, in this type of processing, the computational cost is proportional to the area of both the original image and the structuring element. Therefore, the computational cost increases very rapidly when a large‐scale structuring element is required. For this reason, specialized architecture, e.g. a Cytocomputer, had been built for fast morphological processing, but large‐scale structuring elements are difficult to build by this method because it requires a large number of devices. In this paper, we describe an efficient architecture for gray‐scale morphological processing, in which we decompose the gray‐scale structuring element to one dimension, thereby efficiently reducing computational cost. We also propose the architecture for a pipelined parallel processor that calculates the gray‐scale dilation. This method greatly reduces the size of the hardware and maximizes the processing speed.
Ionic current model of the retinal photoreceptor and simulation analysis of the photoresponses
Authors: Ogura Toshihiko , Usui Shiro , Kamiyama Yoshimi 
Published: July 2007

AbstractThe fact that the reception of optical information by the retinal photoreceptor and the process of its transformation to the membrane voltage response are due to an interaction between the photocurrent from the outer segment and each ionic current in the inner segment has been confirmed by many physiological experiments. However, the properties of each ionic current in the photoreceptor have not been clear since no physiologically reliable model of the retinal photoreceptor has been constructed.This paper proposes a model of a retinal photoreceptor, which is a combination of the outer segment model (devised by Torre et al.) and the inner segment model (devised by the present authors). It has been confirmed that this model can accurately represent the electron physiological properties of a retinal photoreceptor. Using this model simulation, the relationship between the photocurrent and the photoresponse dynamics, and an oscillatory phenomena caused by a strong light flash have been analyzed. The results show that the dynamic and nonlinear response characteristics of a retinal photoreceptor are due to the interactions between the nonlinear ionic current in the inner segment and the mechanism of the intracellular calcium.
Comparative study of searching method in recurrent neural networks
Authors: Yokoi Kunio , Gouhara Kazutoshi , Uchikawa Yoshiki 
Published: July 2007

AbstractThe off‐line learning with a supervisor in the recurrent neural network can be considered as the minimum search on the surface (called learning surface) formed by the evaluation functions. The learning surface in the search has a characteristic shape, and the authors are proposing the valley searching method, based on the global shape of the learning surface.As the search for the minimum, various methods, such as the steepest descent (gradient) and the conjugate gradient methods, often are employed. The relation between the search method and the characteristic shape of the learning surface has not been clarified and it has been difficult to assess quantitatively the usefulness of the searching methods.From such a viewpoint, this paper considers three methods, i.e., the method of steepest descent, the conjugate gradient method, and the valley searching method, and analyzes the relation between the searching method and the learning surface. It is experimentally shown based on the result of simulation that the valley searching method is better. More precisely, the parameter dependencies of the searching method on the learning curve and the searching process are examined experimentally, and it is shown that the parameters are set more easily in the valley searching method than in other methods. It is also shown that the valley searching method is better also in terms of the convergence time and the dependency on the initial value.
Reconceptualising issues around HIV & breastfeeding advice: findings from KwaZulu‐Natal, South Africa
Authors: Seidel Gill 
Published: July 2007

This article is concerned with the dynamics between health care workers and pregnant women, and advice given to women about mother‐to‐child transmission (MTCT) through breastfeeding in KwaZulu‐Natal (KZN). Using ethnographic methods, it explores issues relating to HIV and infant feeding in settings where a period of breastfeeding is expected.
The anti‐baby milk action of the 1970s remains an important point of reference, which has profoundly shaped attitudes towards breastfeeding as ‘the culture of health’. For many health professionals in KZN, the breastfeeding lobby, on which the authority of many nurses depends, and its successes, are now perceived to be undermined by AIDS and the ‘AIDS camp’.
International data that point to the risks attached to any period of breastfeeding have provoked a range of reactions among health workers in KZN, from suspicion attached to information ‘from outside’, to confusion and outright disbelief. An integral part of this study is the pattern of power relations that pertain between health workers and their patients, and the values they may seek to sustain. Many nurses hold negative attitudes about young, pregnant and largely unmarried mothers, and HIV/AIDS is an additional stigma. Nurses’ professional socialisation, influencing how they construct gender, women with HIV, and ‘motherhood’, has an important bearing on how they interact with vulnerable young women, and on the information and advice they make available to them. These patterns will also shape the ways in which they engage with the new South African and UNAIDS policy guidelines, which emphasise a woman's right to make an informed decision on infant feeding, in what is a rights’ culture. These representations, investments, and practices, are also shaped by earlier identity processes, and are shot through with images of gender, class and ethnicity. How to advise and counsel HIV+ women on how best to feed their babies raises some of the most complex and hotly debated issues in health care ethics today. It is imperative that these issues, including the ideologies and discourses that may accompany changes in breastfeeding practices, and the values they underwrite, be explored from new angles, underpinned by social theory.
The uncertain future of bilateralism or, ‘it takes two fingers to kill a louse’
Authors: Bracking Sarah 
Published: July 2007

Economic and political accounts of events often exist as distinct texts which can obscure the political economy of the subject under discussion. In the analysis of bilateral relations this is particularly evident in the new orthodoxy which takes as given that there is a necessary accommodation which must be made with the requirements of ‘modern’ globalisation to ensure international competitiveness. This has caused many economic policy issues to be regarded as a closed box, as a given, not open to discussion. Debates about them have disappeared from view. As a consequence, it is possible for bilateral development finance organisations to maintain a political and, more importantly, moral agenda of poverty reduction, human rights, good governance and a crusade against corruption without questions of political economy or the more specifically economic relationships between states impinging on considerations of the ‘donor’ state's behaviour.
This article argues that the radical agenda of Britain's Department for International Development (DfID) and the political interventions of international NGOs are often undermined in practice (whatever their good intentions) by bilateral economic and trade relations which are in desperate need of regulation and reform. If there were some concept of international solidarity and true co‐operation, it might be possible to shape the reforms required. Instead, international fora ‐ generally characterised by a democratic deficit themselves ‐ become immersed in a quagmire of hypothetical, even arbitrary, ‘good practice’ codes while developing a blindspot concerning the underlying inequities of bilateral economic relations between North and South.
The Tanzanian general elections on Zanzibar
Authors: Cameron Greg 
Published: July 2007

Background
On 29 October 2000,10 million voters in 231 constituencies cast their votes for 13 political parties throughout Tanzania. The election on the Tanzanian mainland was predictably won by the ruling CCM (Party of the Revolution) against a divided and weak opposition. In Zanzibar, on the other hand, the CCM faced a fierce challenge from the CUF (Civic United Front) as approximately 450,000 people voted in 50 constituencies for Union and Zanzibar Presidents and candidates for the Union and Zanzibar Legislatures. In the words of the staid Commonwealth Observer Group, The Zanzibar elections were not free and fair, and were in fact, “a shambles'”. The January 2001 massacres on Zanzibar and subsequent refugee crisis can be directly linked to the flawed elections and the refusal of the CCM regime to respect the majority will of Zanzibaris. Without a doubt a watershed has been reached, one that will further deepen the political, socio‐economic and constitutional crises afflicting the Isles and the United Republic of Tanzania itself.