bluuebunny/crossref_metadata_2025_split huggingface dataset:
Structure data sharing method of highly parallel inference engine pie
Authors: Hirata Keiji , Tanaka Hidehiko 
Published: July 2007

AbstractThis 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

AbstractThe 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

AbstractThis 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

AbstractNumerous 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

AbstractDue 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

AbstractResearches 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

AbstractBinary 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

AbstractWith 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

AbstractVarious 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

AbstractIn 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

AbstractThis 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

AbstractThe 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

AbstractThis 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.
MEDICAL EDUCATION ON ALCOHOL AND DRUGS, VICTORIA 1982
Authors: Fraillon J.M.G. 
Published: July 2007

AbstractFormal 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

AbstractAlcoholic 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

AbstractBy 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

AbstractThe 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.
A DRUG AND ALCOHOL SERVICE BASED IN A GENERAL HOSPITAL
Authors: BURNS F. HARDING 
Published: July 2007

AbstractThe development since 1976 of a treatment service for drugs and alcohol related problems at Royal Prince Alfred Hospital (RPAH) is described. The service, which was an initiative of the Division of Medicine is offered as a consultation, assessment and treatment service for in‐ and outpatients. The Unit acknowledges that a specific clinical intervention may not be important4, but that assessment and intervention of any sort may have a therapeutic importance. The organisation of Drug and Alcohol Services (DAS) in 1983 is headed by a General Physician with administrative responsibility to the Director of Medical Services and professional responsibility to the Division of Medicine, and the Department of Neurology. 376 new patient consultations were seen in 1983. A non medical detoxification unit on the hospital campus serviced 1700 admissions. There is a Liaison Nurse to assist with nursing management problems. The Unit has an education role in the Hospital for medical and nursing staff. Two project officers are completing a project on teaching guidelines and resource material for nurse education in N.S.W. A Regional Brain Damage Unit is investigating the prevalence of neurological disease due to alcohol and advising on special rehabilitiation needs of these patients. The overall success rate of the first 200 patients followed for at least six months in 1981 was 18%. There has been a satisfactory outcome in 15% of patients referred to community resources after alcohol detoxification. In 1983 5% of patients referred to the Service were using narcotics, 15% were using benzodiazepines or other sedatives. A methadone maintenance programme for heroin addicted mothers is run at King George V Hospital (RPAH) in conjunction with the Bourke Street Drug Advisory Service; referrals for opiate and other sedative dependence may be made to other special units in the region. The DAS Unit has become an integral part of the medical services offered at RPAH.
THE USE OF METHADONE IN QUEENSLAND
Authors: BOLTON M. 
Published: July 2007

AbstractMethadone is seen as a useful tool in the management of “street” narcotic drug dependence. The use of methadone constitutes part of a treatment plan in appropriate persons. “Methadone Programs” are one of the range of options which should be available for the treatment of narcotic drug dependence. Residential “therapeutic community” style programs and out‐patient drug free programs should also be available.Whenever instituted the prescription of methadone should be accompanied by individualised attention being paid to the social, psychological and physical needs of the patient.This paper will outline the purpose and goals of the Queensland Methadone Program, document present planning initiatives and examine some issues that may be regarded as contentious.
PRINCIPLES OF ADULT EDUCATION
Authors: FABB W.E. 
Published: July 2007

AbstractIn working with adult learners, the application of some well established principles will enhance the potential for learning. Adult learners work best in a non‐threatening atmosphere where they enjoy a good relationship with their teachers; they need opportunities to assess themselves against a standard, and having done so, prefer to select their own learning experiences — to be self directing. They prefer a problem oriented approach to learning, want to apply their newly‐acquired knowledge and skills immediately and need to know how they are progressing through constructive feedback. They want to help others to learn, and themselves learn much in the process of teaching others.Alcohol and drug workers whose responsibility it is to educate other health workers, will find these principles are applicable in their field endeavour.
NEURO‐ELECTRIC THERAPY IN ALCOHOL DETOXIFICATION
Authors: CAREY‐SMITH K.A. 
Published: July 2007

AbstractAcupuncture and transcutaneous electrical stimulation have been used for ten years to treat withdrawal and craving in heroin and other addictions.The use of a portable stimulator to provide continuous neuro‐electric therapy (NET) during withdrawal in 10 hospitalised alcoholics (and one polydrug abuser) is described. Good results, with high patient acceptance, were obtained without recourse to pharmacological agents, and no major side affects were noted. Current theories on mode of action are discussed.The technique provides a safe, well‐tolerated, non‐chemical method of preventing and treating withdrawal symptoms, and allows introduction of assessment and treatment programmes within hours of admission.
ALCOHOL‐RELATED BRAIN DAMAGE — SERIAL STUDIES AFTER ABSTINENCE AND RECOMMENCEMENT OF DRINKING
Authors: Cala L.A. , Burns P. , Davis R. , Jones B. 
Published: July 2007

SUMMARYThe present study is an extension of earlier work with a group of 65 light to moderate drinkers (Cala et al1,2). The aim was to investigate the effects of a return to social drinking after abstinence, and that of continued social drinking uninterrupted by a period of abstinence, on cerebral atrophy as seen on CAT scan, cognitive performance and biochemical factors.