bluuebunny/crossref_metadata_2025 huggingface dataset:
Verification system for partial correctness of communicating sequential processes
Authors: Murakami Masaki , Inagaki Yasuyoshi
Published: July 2007

The communication sequential processes (CSP) system proposed by Hoare is a model for parallel computation which has no shared variables and performs information exchange and synchronization among processes by means of communication commands. In this paper we first consider a set of states for the given CSP program. Using a binary relation on the set, we introduce a semantics representing only the input‐output relations of the CSP program. Based on this semantics, we propose an axiom system which serves to verify the partial correctness of CSP. We prove the soundness of this axiom system. The axiom system proposed in this paper differs from the previously proposed systems in the following aspects. In our system, the inferences proceed simultaneously over all processes. On the other hand, conventional methods adopt a procedure wherein a given property is first proved independently for each process and it is then shown that a certain condition holds among the processes. Our method of proof is a more direct representation of the actual execution of process.
Development of self‐multiplicating compiler writing system
Authors: Hamada Takashi , Masui Toshiyuki , Kayano Yoshiaki
Published: July 2007

In the automatic generation of the compiler, the area requiring further study is the automatic generation of a semantic analyzer. Several methods have been proposed to define the semantics, but a large‐scale description is required. From such a viewpoint, this paper aims at the construction of a compiler‐compiler which can describe the semantics efficiently. A self multiplicating compiler‐compiler (SMCC) was developed by the bootstrap technique used in the development of a new language. SMCC utilizes LL(1) grammar for the syntax analysis and attribute grammar for the semantic analysis. Not only the compiler, but also the SMCC itself can be described. Consequently, the SMCC can successively be extended and an efficient and complex compiler‐compiler can be generated much simpler than by the manual procedure. SMCC is described entirely by C language, and translates the definitions for the compiler or compiler‐compiler into C language. This paper describes the compiler‐compiler SMCC1 which is constructed manually and serves as the initial kernel, and SMCC2 and SMCC3, which are the result of extensions by SMCC1, together with their evaluations.
High‐speed rotation of digital images by raster scanning and table‐lookup operations
Authors: Tabata Kuniaki , Takeda Haruo , Machida Tetsuo
Published: July 2007

A high‐speed processing method of rotating two‐dimensional digital images by arbitrary angles is proposed. This method rotates images by combining two skew transformations of raster scanning along X and Y axes. It makes possible group access to horizontally or vertically adjacent pixels in the memory, and shortens memory read/write time per pixel. Each skew transformation includes scale change of images in which the scale factor is approximated by a rational number. The resultant periodicity in transformation is used for high‐speed processing by simple table look‐up operation. The estimated rotation time of images is 250 ‐ 375 ns per pixel with a two‐dimensional memory of transfer speed 1 m̈s/word (1 word = 16 bits) and the pixel shift clock time 125 ns (8 MHz). The scaling error due to rational number approximation depends on the transformation table capacity. The table capacity being 32 or 16 digits, the error is approximately 0.3 or 0.8 percent, respectively. In applying to document image editing, the table of 16 to 32 digits is practically sufficient, implemented by a small number of IC's (about 100). The effectiveness of this method is justified with those examples.
Image data compression based on interpolative dpcm by area decomposition
Authors: Machizawa Akihiko , Tanaka Mamoru
Published: July 2007

This paper proposes a useful method of image data compression which is a two‐dimensional interpolative DPCM, where the mean gray‐scale values of the neighborhood are used as the prediction for the pixel. In the proposed image processing system, the two‐dimensional image is partitioned into subareas in encoding, and the highly correlated subareas in the region are data‐compressed by the interpolative DPCM. A highspeed decoding is realized by calculating the low‐dimensional system of equations by parallel relaxation for the partitioned subareas. The decoding can be executed with the scale of iterative computations required for the analysis of the subarea with the largest dimensions. The architecture of the decoder is suited to the LSI realization, since it can be realized by the bit‐serial adder cell array without using the multiplier‐divider. The encoder has many points in common to the decoder and can be constructed using the same chip. This paper also presents a theoretical evaluation for the compression ratio by encoding and the encoding‐decoding speed in the proposed two‐dimensional interpolative DPCM. A further discussion is made for the three‐dimensional interpolative DPCM for the motion picture. It is shown theoretically that the compression ratio can be made larger utilizing the region‐partitioning of the three‐dimensional space than in the two‐dimensional case with the high‐speed encoding and decoding scheme.
Three‐dimensional reconstruction of torsos by computer and its applications
Authors: Agui Takeshi , Kaneko Yoshikazu , Nakajima Masayuki
Published: July 2007

Computer graphics has been applied in the past to the CAD (computer‐aided design) in machine design. However, the technique is recently applied to other fields of industry, and positive attitudes toward CAD are observed in the design of dresses. This paper proposes an algorithm to determine the three‐dimensional structure of torsos from basic dress patterns.

A method to reconstruct three‐dimensional objects from dress patterns is described first, and then the algorithm to texture the torsos is described. By the texturing algorithm, it is made possible to choose cloths and design according to individual taste in the form of the completed dress worn on the torso of the customer.
An error detecting and correcting coding method for bilevel images of line drawings using the redundancy of the images
Authors: Minoh Michihiko , Sakai Toshiyuki
Published: July 2007

The development of technology concerning semiconductors and optical fibers now makes image transmission cheaper and more practical. This paper describes an error correcting coding method for binary images of line drawings. First the bilevel images of line drawings are represented by legal patterns, which are defined with a 3 × 3‐pixel unit mesh (window) and employ line constraints. The resulting image is a picture represented by a legal symbol connection (LSC‐picture). This picture includes certain connecting relations among the neighboring legal patterns, which are considered to represent explicitly the redundancy of the original image. Next we encode the picture using a legal pattern as a coding unit. The information source model used for encoding is a simple Markov model. We use line‐to‐line dependencies for the purpose of error detection and correction. When a transmission error is detected by checking the relations, the decoding process generates a tree called an “error correcting tree.” The problem of correcting the transmission error is considered as one of how to search the error correcting tree. The simulation results of this method show that almost all the transmission errors can be corrected if we incorporate a little redundancy of the code words themselves, as in an ordinary method. At the same time, the compression ratio is as high as that of the MR coding method. For image transmission in the future we believe that a description should be considered which can make explicit the redundancy of the image itself as much as possible and that the redundancy should be utilized not only for compressing the amount of data but also for correcting transmission errors.
Defect detection method for stamped patterns utilizing random access parallel matching technique
Authors: Shima Yoshihiro , Kashioka Seiji , Yasue Toshikazu
Published: July 2007

In the fabrication processor of electronic components, the outlook inspection has been performed primarily by visual observation. The automation of this process is presently considered important. This paper describes automatic defect detection considering the stamped pattern on the surface of the electronic parts on the integrated circuit, etc. The only clue to the information on the kind of electronics part is the characters and symbols stamped on its surface. In this sense, the stamped pattern is considered as a part of the part quality. Some defects of the stamped pattern are the disappearance, lack of a part, and dirt. The feature of these defects are discussed first. The fixed‐point sampling is considered which detects the existence of the character pattern at the observation point. The method is modified so that the decision can be made at the observation point along the stroke. Furthermore, a character defect detection system is proposed which can shift the observation point in horizontal and vertical directions so that the system can cope with the variation of the position of the character. A dedicated image processing device was developed to perform the defect detection with high speed. The architecture and the operation of the system are described. The system is advantageous in that the high‐speed operation is realized by the pipeline control for a series of processings, from the parallel read‐out of the local patterns in the image memory to the matching operation. Finally, the configuration of the experimental system is described and the results are shown for the automatic outlook inspection for the stamped pattern of the actual electronic part, thereby indicating the usefulness of the proposed system.
A coding method of line drawings using templates
Authors: Ishii Ikuo
Published: July 2007

This paper proposes a coding method using a template as a highly efficient coding of the line drawing. In the proposed method, the maximum permissible error is specified, and the line drawing with arbitrary curvature is coded within the specified error. In such a case, it is advisable to use the triangular grid for quantization. To improve the efficiency, the direction difference as well as the segment length are simultaneously coded for several links of the triangular grid. Compared with the case of linkwise coding, the number of states to be discriminated is increased in such a shceme, making the coding complex. To simplify the procedure, a template is used to normalize the coding procedure. As a result, the coding complexity can be decreased by 30 to 40 percent, compared with the past direction difference coding using the square grid.
A reducing method for a set of clauses using prepositional formulas
Authors: Nishioka Hiroaki
Published: July 2007

In the resolution‐based theorem proving, logical formulas to be proved are expressed in the form of a closure set (a set of clauses). For proof efficiency, it is desirable that a clause set be reduced to a Horn set by renaming if possible. Several reducing methods have been proposed for this transformation.

This paper defines a new reducing method which uses prepositional formulas and is related to a method using 0 – 1 programming. The new method generates a pro‐positional clause set for renaming from the original predicate clause set.

A set of logical formulas generated in the method is called a “structural clause set,” because each element in this set indicates the distribution of positive/negative literals in the original predicate clause.

An interpretation which satisfies a structural clause set corresponds to a renaming which transforms the original predicate clause set into Horn set.

Furthermore, a procedure is presented which determines satisfiability of a structural clause set, and then its time complexity is evaluated.
Fundamental algorithm for train scheduling based on artificial intelligence
Authors: Fukumori Koji , Sano Hiroshi , Hasegawa Toshiharu , Sakai Toshiyuki
Published: July 2007

The trial‐and‐error efforts by experts have been considered as indispensable in compiling railroad timetables. There is a strong requirement to computerize the procedure, but it has been considered difficult. It is proposed to merge the following two concepts as a means to obtain an efficient trial‐and‐error procedure, which is the basis of the compilation of railroad timetables: (1) the concept of (time) belt, where a number of alternatives for arrival and departure is handled as one alternative, considering only the order of arrivals and departures; (2) the concept of the propagation of constraints, which is well known in the artificial intelligence where alternatives in conflict to the order of arrivals and departures are eliminated. This paper discusses the scheduling problem for the partially ordered set of events. The requirement for the time difference between events is considered as a constraint. An algorithm is proposed which calculates the permissible range of time for the event generation, as a closed interval on the time axis. It is shown that the constructed algorithm can be applied as the basic algorithm for the railroad timetable compilation system, where the timetable is considered as a specification for the order of arrivals and departures of the trains, and the arrival‐departure time is considered as a belt. An efficient method of compilating the timetable by the proposed algorithm is presented, based on the search for the possible orders of the trains, together with the construction example of the timetable for the actual railway.
Throughput analysis of reservation protocols with tree‐type reservation channel
Authors: Oie Yuuji , Muro Shojiro , Hasegawa Toshiharu
Published: July 2007

Numerous multiple access protocols have been proposed aiming at an efficient utilization of transmission channels. Among those, the tree‐type protocol is one of the multiple access protocols which provide a stable throughput. Various studies have been made on the tree‐type communication protocols. This paper is concerned especially with the analysis of the throughput of the reservation protocols with tree‐type reservation channel. In the proposed system, the tree‐type protocol is employed to reserve the data slot, providing stable and high throughput. There are two types of tree‐type protocols: the blocked‐access tree protocol which inhibits the transmission of a new packet in the collision resolution interval; and the free‐access tree protocol which does not inhibit the transmission. The reservation protocols employing these two protocols are discussed. Through the analysis, the optimum frame structure for each type is obtained. The maximum throughput of CCA proposed by Lee and Mark, as well as the optimum number of the small reservation slots, are obtained analytically.
Response time minimization for processing simple queries in star networks
Authors: Miyao Jun'Ichi , Kikuno Tohru , Yoshida Noriyoshi
Published: July 2007

It has already been shown that the problem of obtaining an optimal strategy for a general query on a distributed database system is NP‐hard. On the other hand, simple queries have been known as one class of queries for which an optimal strategy can be obtained efficiently. So far, it has been shown that if the topology of a computer network is a complete graph, then a strategy with the minimum response time for simple queries can be obtained in O(n2), where n is the number of sites of the network.

This paper discusses the problem of obtaining a strategy with the minimum response time for simple queries when the topology of a computer network is a star (in brief, problem RT). We assume that each communication channel of a star network has equal communication capacity, and that each site has an equal capability for data processing. Here, we also assume that the center of a star network is capable of performing so‐called broadcasting. In this paper, we present an algorithm called RT of O(n2) time for solving problem RT. Algorithm RT constructs a schedule graph that represents an optimal strategy by using the dynamic programming method.
Completeness of temporal and spatial logic ETSL
Authors: Iwanuma Koji , Harao Masateru , Noguchi Shoichi
Published: July 2007

The behaviors of such concurrent systems as array processors, should be considered to be a compound interaction of temporal and spatial properties. Thus it is important in expressing semantics to consider both time and spatial axes. However, up to now, few researches have been conducted for a method which treats both axes within the same framework. As a result, previously, we proposed a propositional modal logic ETSL and investigated its model theoretic aspect. In ETSL, the existence theorem of the finite model holds when only finite space is treated. This paper investigates the formal system of ETSL and gives a complete and consistent axiom system for the restricted ETSL which treats only finite spaces. This axiom system is constructed by adding some axioms characterizing time and space to Segerberg's axioms for propositional dynamic logic. Some fundamental operators, e.g., an operator representing “simultaneity,” play important roles in this axiom system. Completeness is proved based on the existence theorem of the foredescribed finite model.
A recognition algorithm of dashed and chained lines for automatic inputting of drawings
Authors: Shimada Shigeru , Kakumoto Shigeru , Ejiri Masakazu
Published: July 2007

Recognition of lines in drawings is a major task in automatic data acquisition for CAD (computer‐aided design). This paper proposes an algorithm for the recognition of dashed and chained lines in graphical images. This algorithm consists of two major steps: the local recognition step which extracts local connectivity of line segments, and the global recognition step which performs route finding of connected segments based on syntax. The syntax is usually specific to each type of drawing, and is represented as rules. The performance of the proposed algorithm is demonstrated based on experiments using LSI cell drawings and topographical maps containing dashed and chained lines as graphical components.
Neural mechanisms of information processing in the brain
Authors: Amari Shun‐Ichi
Published: July 2007

Numerous researchers have recently become interested in the information processing in the brain. This is because the brain seems to process information in a mechanism which is completely different from that of the computer. The parallel information processing, learning and self‐organizing ability, as well as the memory mechanism of the brain, present interesting principles of information processing which will be very helpful in the design of future computers. To arrive at a clear understanding of those principles, various attempts have been made to describe the underlying principles in a mathematical and systematic way, in parallel to the examination of the behavior of the neural network model. This paper outlines those efforts from the viewpoint of pattern dynamics of the neural field and the visual information processing, learning function in the input‐output characteristics and the control of movement, self‐organization of information recognition mechanism, the associative model, and its stochastic realization. However, this paper aims not only at a review of the present status, but also at pointing out the present problems such as the bottleneck, indicating the problems posed and the direction of the new possible researches.
Sequences of state configurations realizable by the network of a single threshold element
Authors: Miyasaki Kiyonori , Fujino Eiichi
Published: July 2007

The autonomous network composed of a threshold element and n delay elements can be considered as a logical model for the neural network. The discussion of the structure of the state configuration sequences, which are realizable by such a network, will give a clue to the logical operation of the neural network. This paper discusses the state configuration sequences realizable by such a network and the property of the threshold function using the connecting edges and boundary vectors. It is shown first that when the state configuration sequences can only be periodic, the maximum realizable length of the periodic sequences is 2n. Then the self‐dual state configuration sequences are generated from the foregoing state configuration sequences, preserving a certain periodic sequence. It is shown that the network function in this case can be composed of an MBS function, and all boundary vectors and weights and thresholds can easily be determined. The structure of the realizable transient sequences is also discussed.
Distributed algorithms tolerant of link failures
Authors: Masuzawa Toshimitsu , Hagihara Ken'Ichi , Tokura Nobuki
Published: July 2007

So far, numerous distributed algorithms have been proposed. However, most of them do not work well on failure of a processor or link. This paper investigates the relationship between knowledge a processor has concerning the network and the existence of a distributed algorithm under link failure. In this situation, because of the link failure, it is not possible to send a message using it and the processor does not know which link is faulty. The following results are obtained.
Structure data sharing method of highly parallel inference engine pie
Authors: Hirata Keiji , Tanaka Hidehiko
Published: July 2007

This paper presents an efficient data management technique for the highly parallel reference engine PIE. PIE aims at the general‐purpose machine in the future knowledge processing. It is a machine which executes logic programming languages with a high speed in OR‐parallel, according to the goal‐rewriting model. In the implementation scheme considered by the authors for the goal‐rewriting model, the initial scheme is the one where the elementary processing unit is generated by a complete copy, and the sharing mechanisms are gradually adopted. The structure data sharing scheme proposed in this paper is a scheme, where the elementary processing units share only the ground instances among the structure data owned by the elementary processing units. In this paper, the structure data sharing scheme is estimated by the software simulations indicating its usefulness. The proposed scheme can reduce the degeneration time and the transfer time of the basic processing units, and improve the processing speed. On the other hand, there appears the overhead due to the lazy fetch, separating and storing of group instances, and garbage collection is required. From the detailed simulation for those aspects, we make a quantitative discussion.
Image processing algorithm for edge‐line extraction of lymph vessel wall and measurement of the vessel diameter
Authors: Horikoshi Tsutomu , Minamitani Haruyuki , Sekizuka Eiichi , Tsuchiya Masaharu , Ohshio Chikara
Published: July 2007

The mechanism of the lymph flow is not fully understood. Since the lymphatic system has no pump apparatus such as a heart in the blood vessel system, it is important to study the relationship between the lymph flow and the contractile movement of its wall. This paper analyzes the rhythmical contraction of the lymphatics of the rat mesentery in vivo. Only the image of the lymph vessel wall was extracted from the microscopic image of the mesentery recorded on video tape. An algorithm was developed which was suited to the continuous measurement of the vessel diameter. In the process of the automatic extraction of the lymph vessel wall, not only its derivative and the direction, but also the running state of the lymph vessel were utilized as information. A circular scanning was employed for the first time as a method which realized an accurate diameter measurement of the vessel that always changed its shape with time. By the proposed image processing system, the periodic movement of the lymph vessel could be analyzed quantitatively.
An algorithm to obtain test data by path analysis
Authors: Masuyama Hiroshi
Published: July 2007

This paper considers the situation in which the specification of the software is described by a directed graph, and proposes an algorithm to find a test path that passes all routes in the graph. The directed graph considered in this paper has the property that the test data needed in passing through an arc is generated by passing through another arc. In other words, the directed graph contains the arc with control data. Whether or not the test data of the test path obtained by the proposed algorithm are unique and the minimum depends on the directed graph. In the past, the determination of the test path covering all arcs of the graph has been discussed. However, the test path determination has been either to check all possibilities by try‐for‐all search or to economize the memory capacity by representing the routes to memorize by logic expressions. By contrast, this paper discusses the test path determination, where the test data are unique and minimum as far as possible. Finally, the complexity of the procedure to determine the path is discussed.
A recognizing algorithm for a loop free context‐sensitive language based on the dynamic programming method
Authors: Ikeda Mitsuru , Tanaka Eiichi
Published: July 2007

Numerous recognizing algorithms have been proposed for the context‐sensitive language. These methods are essentially the try‐for‐all parsing by generating all possible parsing trees. This paper discusses Earley's method, which is a recognizing algorithm for the context‐free language, in correspondence with the technique employed in problem‐solving. A recognizing algorithm is presented for the context‐sensitive language based on that idea. By the proposed method, the term duplication procedure is eliminated, which has been a problem in earlier methods. This simplifies the verification of the context condition. The algorithm is based on dynamic programming.
Disjoint disjunctive form of boolean functions and its applications
Authors: Takahashi Naoya , Mukaidono Masao
Published: July 2007

Due to upscaling of digital systems, the development of efficient representations and manipulating algorithms of Boolean functions is becoming increasingly important. This paper considers the representation by the disjoint disjunctive form from representations of Boolean functions, and describes the properties, characteristics and manipulating algorithms. Conventionally used sharp operation and disjoint sharp operation are made more efficient for the algorithm which generates disjoint disjunctive forms. Moreover, a binary tree method is proposed as a method which generates disjoint disjunctive forms of positive and negative functions simultaneously. This binary tree method is also very powerful as a method to obtain negation of logical formulas, and is five to ten times faster than the conventional one using disjoint sharp operation in a case of 10‐variable function. Also, for the problem of number of product terms, which is generally regarded as a shortcoming of the disjoint disjunctive form, we conduct further studies by considering the simplest disjoint disjunctive form. Moreover, we show a unique negation algorithm as an example of using the properties of the disjoint disjunctive form more aggressively.
An msm coding of a binary image and an msm figure‐file system
Authors: Wakayama Tadao
Published: July 2007

Researches on the coding and filing of such binary image data as versatile links of drawings or topographical maps have been conducted widely [5 ‐ 19]. The reasons for this activity are tied to the advances made in techniques for processing topographical information [1, 2], automatic drawing reading [3], and image datebases [4].

These techniques are aimed at high‐density compressions in image coding, but especially at greater flexibility in figure reconstruction. Additionally, some of these techniques have found practical application in such commercial areas as image databases of topographical maps or drawings or visual communications by facsimile.

However, these techniques are difficult when using coding image data to obtain such flexible image processings as skeletonization or border following of figures, the detection of width or branch points of line figures, or structural analysis of line or surface drawings. As a result, this paper proposes an MSM figure‐file system which codes a binary image via the MSM method and files it as a figure, and retrieves figure data from the file.
Analysis and evaluation of sampling methods in binary pattern matching
Authors: Kashioka Seiji , Ejiri Masakazu
Published: July 2007

Binary image pattern matching is used widely in character and symbol recognition, and to determine pattern positions [1, 2].

Binary level deviation and superposition of noise have been reported as the causes of inaccuracy in matching between the template and image patterns. As a result, measures have been reported to solve this problem. However, these measures have not been entirely effective. There still remain problems of pattern change due to sampling deviation and error in matching caused by this change.

This paper presents a method to prevent sampling errors by using Boke processing [3, 4]. Also, the matching errors which occur due to binary pattern sampling are analyzed and measures to reduce them are proposed.
A real‐time recognition of languages for bounded cellular automata
Authors: Miyajima Hiromi
Published: July 2007

With the progress of VLSI technology, researchers are more interested in parallel computation. For example, discussions are made on the parallel processings such as the recognition of language, sorting, matrix computation and graph processing, using the systolic array, the iterative array, and the bounded cellular automaton. It was shown in a previous paper that the bounded cellular automaton is properly faster in the recognition of language than the systolic array, i.e., one‐way cellular automaton. This paper is a continuation of that previous paper, and shows that the bounded cellular automaton can recognize in nearly half the time the class of languages which can be recognized in real time.
Construction of associative memory from incomplete memorized information using space reduction method
Authors: Murakami Kenji , Yamajo Yasuhiro , Aibara Tsunehiro
Published: July 2007

Various studies have been made on the construction of associative memory. This paper proposes a method of constructing an associative memory which exhibits almost the same associative ability as in the case where true information is given, even if an incomplete memorized information is given. The construction of the associative memory from the incomplete memorized information (learning pattern) is an important problem related to the learning function of the associative memory. The proposed method is to perform the singular‐value decomposition of the space spanned by the learning pattern, from which the space spanned by the memorized pattern is extracted. The difference of the singular values is utilized in the extraction of the space spanned by the memorized pattern. In the actual construction of the associative memory, it may frequently happen that only the incomplete memorized information disturbed by noise is available. It is very important from the practical viewpoint to consider the construction of the associative memory in such a noisy environment. In the proposed method, it is not necessary to know to which memorized pattern each learning pattern belongs (i.e., supervisor). The method is thus a kind of learning without a supervisor. This paper discusses also the construction of the associative memory with a supervisor, together with the role of the supervisor in the associative memory.
On‐line handwritten character recognition using local affine transformation
Authors: Wakahara Toru
Published: July 2007

In this paper we formed deformation vector fields between the input patterns and the template patterns. Through the components of a low‐order local affine transformation for the deformation fields, we deform the template pattern a priori and perform a pattern adjustment. We report a method for on‐line handwritten character recognition utilizing a local affine transformation. This method consists of three steps based on the representation of features of the input patterns and those of the template pattern. They are: (1) Through a dynamic programming method, we generate the deformation vector field by extracting the deformation vector from each feature point of the template pattern to the corresponding point of the input pattern. (2) We superpose a Gaussian type function onto the deformation vector field. By iterative applications of the local affine transformation, we expand asymptotically each deformation vector. (3) We perform a superposition of the local affine transformation of low‐order for each feature point and adjust the superposed template pattern with the input pattern. We considered 1,945 different Chinese characters of ordinary use for recognition objectives. For the template pattern, we used character samples consisting of average character patterns by standard handwritten characters. We used 300 deformed characters for 20 sample sets. These 6,000 characters were treated as unknown data for recognition experiments. As a result, we achieved the recognition percentage of 95.6 percent. It was higher than the recognition percentage of 91.9 percent for a case in which the template patterns were not deformed.
Intelligent retrieval of chest X‐ray image database using sketches
Authors: Hasegawa Jun‐Ichi , Okada Noritake , Toriwaki Jun‐Ichiro
Published: July 2007

This paper discusses the improvement of the function of the database system for chest X‐ray images, utilizing sketches described in a previous report. An experimental study was made on the intelligent retrieval of the image database using sketches. More precisely, the following points are investigated: (1) the procedure for constructing the sketch is improved, upgrading the function. The aim primarily is to improve the accuracy in the extracted rib image and the lung border. (2) The earlier sketch is a binary line figure, while in the new system, a gray‐level sketch is also possible. The aim is mostly the diagnosis record assist, as well as the retrieval of figure description and the patterns. (3) In the earlier system, only the feature parameters can be the object of retrieval, while the new system can retrieve the figure description as well as some of the patterns. Those are especially desirable aspects as a basic study for realizing the intelligent retrieval of the image database.
Advanced feature extraction from topographical maps by multiangled parallel operation
Authors: Yamada Hiromitsu , Yamamoto Kazuhiko , Nakamura Masanobu
Published: July 2007

The authors previously proposed MAP (multiangled parallel) operation, which extracts the feature of an image by applying the erosion‐dilation to the directional field, and applies the method to the topographical map. This paper discusses the development of MAP operation from the viewpoint of the hardware and the improvement of the extraction algorithm.

The hardware components for MAP operation are presented first. It is shown that the feature of the image can be extracted through cyclic processing by the four kinds of 8‐parallel logic circuits using the local parallel operations. The implementation on the image processor is discussed. As to the feature extraction algorithm, a method is presented which extracts the curve continuously by propagating the direction feature plane component among the planes. As an example of the feature extraction by the directional erosion‐dilation, the extraction of the ropeway symbol is demonstrated.
Complex neural networks
Authors: Nemoto Iku , Kono Tomoshi
Published: July 2007

This paper proposes complex neural networks in the form of a perceptron and an autocorrelation associatron. Their properties are described and the results of computer simulation are presented. The discriminant power of the complex perceptron is nearly twice that of the real perceptron because linear separability associated with the (one‐layer) real perceptron corresponds to separation by quadratic surfaces for the complex perceptron.

Two methods of increasing the memory capacity of the autocorrelation associatron by complexification are proposed, the first of which is equivalent to the method using a nonmonotonic output function proposed by Morita et al. [1].

Complex neural networks will be an effective and simple means to introduce phase differences among impulse trains and hence to study such temporal phenomena as synchronization of impulse trains.
Fluxional and aromatic behavior in small magic silicon clusters: A full ab initio study of Sin, Sin1−, Sin2−, and Sin1+, n=6, 10 clusters
Authors: Zdetsis Aristides D.
Published: July 2007

The structural, electronic, vibrational, optical, magnetic, and aromatic characteristics of Sin, Sin1−, Sin2−, and Sin1+, clusters have been calculated very accurately with a variety of high level ab initio techniques. These calculations have been performed with the aim to clarify existing ambiguities in the literature and to bring up the fluxional and aromatic characteristics of these species. The fluxional behavior, according to earlier conjecture of the present author, could be connected to the magic property. In addition such behavior could also explain the existence of conflicting results. The ab initio techniques include quadratic configuration interaction, coupled cluster, and multireference second order perturbation theory, together with density functional theory (“static” and time dependent) with the hybrid B3LYP functional. Various high quality correlation-consistent basis sets, ranging from 2Z up to 5Z quality, were employed. It is demonstrated that Si6 is fluxional, fluctuating around a symmetric D4h structure. Si10 is also fluxional but to a lesser degree, in contrast to Si101− anion which is highly fluxional. For both clusters, in full agreement with Wade’s and Lipscomb’s rules for deltahedral boranes, the corresponding dianions have higher symmetry (Oh and D4d, respectively) and lower energy than the neutral clusters. The aromatic behavior of Si6 fits better to a mixed conflicting aromaticity picture. This type of aromatic and fluxional behavior has also been observed in stable “magic” carbon clusters as C6 and carbon fullerenes such as C20. The present results, which support possible connection of fluxional and magic properties, are in excellent agreement with experimental measurements of ionization energies, electron affinities, and vibrationally resolved photoelectron spectra.
Analysis of the surface order parameter of liquid crystal on a polymer surface using the phase transition droplet method
Authors: Oh S.-J. , Kuboki K. , Miyashita T. , Uchida T.
Published: July 2007

The essence of the anisotropic alignment of liquid crystal (LC) molecules at the substrate surface is derived from the distribution of the molecular direction of the LC, which is best described in terms of the order parameter. The order parameter of LC molecules at a polymer surface can be determined by measuring the contact angle of a nematic LC droplet at the nematic-isotropic phase transition temperature. In this study, we quantified the relationship between the surface order parameter and contact angle of the droplet for a homogeneous alignment LC cell. Based on the results, we propose a model for a droplet on a polymer surface. Its validity was confirmed by measuring the polarized infrared absorption.
Emergence and contributions of a Latin American indigenous social psychology
Authors: Diaz‐Loving Rolando
Published: July 2007

Increasingly, understanding behaviour requires a multidimensional conceptual and methodological approach. A historical analysis of social psychology leads to the identification of separate and clear psychological, sociological, and cultural perspectives in the thinking and research of the field. In an overview of the highlights of each orientation, this paper identifies the way in which each subbranch of social psychology flourished and is closely tied to the psycho‐socio‐cultural ecosystem in which its theoreticians and researchers developed. Evident from this process is the inclination of psychological researchers to stress functional aspects of behaviour and utilize experimental methodologies; the sociological orientation stresses structural variables and is inclined toward observational and field descriptive studies; and cultural investigation tends to pull from both the psychological and sociological perspectives and places major interest on the ecosystem in which behaviour presents itself. Linked to individual researchers' interests and training, and congruent with the sociocultural parameters and ecosystem in which Latin American social psychologists have evolved, novel indigenous interpretations of each social psychology have emerged. Documentation of the research topics, preferred theoretical and methodological approaches, and idiosyncratic findings is presented for the emergence of social psychology in Latin America. Emphasis is placed on the process of creating and shaping an indigenous view of social psychological thought, in which phenomena derived from a combination of one of the three views, and the behavioural manifestations and ideas representative of autochthonous everyday life, are stressed. As a conclusion, true to its upbringing, and born out of a perennial antithesis between mainstream thought and mundane reality, both a series of replications and novel conceptualizations and findings have emerged that have a distinct psychological, sociological, and cultural flavour.
Tribal Order and the State: The Political Organization of Boir Ahmad
Authors: Loeffler Reinhold
Published: July 2007

Among the tribal peoples of the Middle East, from the Atlas to the Hindukush mountains, the most common type of political organization appears to be some form of segmentary structure in which powerful sociocultural mechanisms function to contain every tendency toward the emergence of permanent centralized power figures. Some tribes of Iran characteristically deviate from this general pattern. The Boir Ahmadi is one of them. Their political organization, as it existed during the nineteenth century and up to 1963, consisted in an intrinsically centralized system, that is, a system in which its political power figures showed a vested interest in maintaining, rather than preventing, centralized leadership. In this paper I describe--as much as is possible within a limited space--the bases and the functioning of this system, trace its emergence and inner evolution, and outline its present transformation. In conclusion, to further highlight some of its features, I compare it with European feudalism.
Pseudoparticipation and Countermobilization: Roots of the Iranian Revolution
Authors: Green Jerrold D.
Published: July 2007

The Iranian revolution presents a unique challenge to social scientists. Marked by massive popular participation (primarily in urban areas), by the rejection of violence by the revolutionaries, and by the rapid fulfillment of its goals, the Iranian experience seems to elude prevailing paradigms for the study of revolution. Although there were several factors that made the country ripe for revolution—widespread feelings of relative deprivation, a state apparatus under pressure from the international system, impeded elite circulation, and conflicts among various social classes—none of these alone can explain why the upheaval occurred. While it is unlikely that a definitive explanation of the revolution can ever be found, virtually all theories of revolution implicitly ask two questions: (1) What social conditions lead to revolution, and (2) What is the nature of participation in such revolutions? It is with the first of these questions that this essay is primarily concerned.
Robert Lowe, The Times, and Political Economy
Authors: Maloney John
Published: July 2007

Most historians know Robert Lowe (1811–1892) as W. E. Gladstone's first Chancellor (1868–73) and the leading orator against the Reform Bill of 1867. Educationists to this day criticize or praise his Revised Code of 1862, which introduced payment by results in schools. Historians of economic thought add Lowe's critique of relativism (evinced by his views on Ireland) and his stridently classical statements of the role of political economy from his later dispute with the English historical school.
Herodotus's Statistics: Quantitative Commentary
Authors: Hombas Vassilios C.
Published: July 2007

The ancient Greeks were admired for many things, but particularly for their lack of the corrosive, self-centered complex that leads many authors today to believe that everything started with, and everything originated in, Greece. The ancient Greeks were self-confident enough to accept that they had been influenced by and had absorbed many foreign elements, which their talent then transformed into a new expression of civilization. At a somewhat less mundane level, many ideas that have shaped our thoughts and continue to influence our thinking today, across the world, originated in the past. They were also debated from different points of view in Athens and in other areas in Greece.
MEDICAL EDUCATION ON ALCOHOL AND DRUGS, VICTORIA 1982
Authors: Fraillon J.M.G.
Published: July 2007

Formal teaching for general practice in alcohol and drug‐related illness and problems is developing both in the vocational training and continuing medical education streams. Undergraduate teaching is not highly structured nor coordinated as a transdisciplinary topic, so the base‐line level for beginning post‐graduate teaching must assume a nil data base on the part of the participants, but must be formulated to maintain interest by those who have greater experience than this.
SELF‐DISCHARGE FROM IN‐PATIENT CARE OF CHEMICAL DEPENDENCY
Authors: Stanhope John
Published: July 2007

Alcoholic and drug‐dependent patients frequently discharge themselves from hospital against medical advice. Simple objective guidelines for deciding whether certain patients would be readmitted, have been derived from previous self‐discharge behaviour recorded in patient files at the Langton Clinic. Alcoholics are not readmitted if there have been four self‐discharges or two discharges for breaking clinic rules. Opiate dependents were less consistent than alcoholics in their self‐discharge behaviour and a decision not to readmit should be based on previous rule violations rather than on signing out or absconding.
DRUG‐RELATED DEATHS IN AUSTRALIA FROM 1969 TO 1980
Authors: Drew L.R.H.
Published: July 2007

By using the local and international literature indices are developed relating the use of particular drugs to a specific proportion of deaths from various causes. These indices are then applied to statistics on cause of death, supplied by the Australian Bureau of Statistics, to estimate the number of drug‐related deaths and corresponding death rates per 100 000 population in Australia for each year from 1969 to 1980, with tabulation by age and sex.

Overall there were estimated to be about 19 000 to 20 000 drug‐related deaths each year, most associated with tobacco use, about a fifth with alcohol and only about 3% with other drugs.

It appeared that a peak may have been reached for deaths associated with tobacco (1976), alcohol (1977) and other drugs (1978).
MANAGING THE PREGNANT DRUG USER
Authors: Williamson P.
Published: July 2007

The population of pregnant narcotic addicts in Adelaide is small. These patients can suffer a wide range of medical and obstetric problems, causing great anxiety to obstetric hospital staff.

A case history of such a patient is detailed and the liaison developed between obstetric hospital and drug clinic is described. Mutual benefit for hospital, drug clinic and patients has been evident.