bluuebunny/crossref_metadata_2025_split huggingface dataset:
Efficient discovery of interesting patterns based on strong closedness
Authors: Boley Mario , Horváth Tamás , Wrobel Stefan 
Published: November 2009

AbstractFinding patterns that are interesting to a user in a certain application context is one of the central goals of data mining research. Regarding all patterns above a certain frequency threshold as interesting is one way of defining interestingness. In this paper, however, we argue that in many applications, a different notion of interestingness is required in order to be able to capture “long”, and thus particularly informative, patterns that are correspondingly of low frequency. To identify such patterns, our proposed measure of interestingness is based on the degree or strength of closedness of the patterns. We show that (i) indeed this definition selects long interesting patterns that are difficult to identify with frequency‐based approaches, and (ii) that it selects patterns that are robust against noise and/or dynamic changes. We prove that the family of interesting patterns proposed here forms a closure system and use the corresponding closure operator to design a mining algorithm listing these patterns in amortized quadratic time. In particular, for nonsparse datasets its time complexity is \documentclass{article}\usepackage{amsmath}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{amsfonts}\pagestyle{empty}\begin{document}$\newcommand{\bigo}[1]{O\!\left(#1\right)} \bigo{nm}$\end{document} per pattern, where n denotes the number of items and m the size of the database. This is equal to the best known time bound for listing ordinary closed frequent sets, which is a special case of our problem. We also report empirical results with real‐world datasets. Copyright © 2009 Wiley Periodicals, Inc. Statistical Analysis and Data Mining 2: 346‐360, 2009
Discovering arbitrary event types in time series
Authors: Preston Dan , Protopapas Pavlos , Brodley Carla 
Published: November 2009

AbstractThe discovery of events in time series can have important implications, such as identifying microlensing events in astronomical surveys, or changes in a patient's electrocardiogram. Current methods for identifying events require a sliding window of a fixed size, which is not ideal for all applications and could overlook important events. In this work, we develop probability models for calculating the significance of an arbitrary‐sized sliding window and use these probabilities to find areas of significance. Because a brute force search of all sliding windows and all window sizes would be computationally intractable, we introduce a method for quickly approximating the results. We apply our method to over 100 000 astronomical time series from the MACHO survey, in which 56 different sections of the sky are considered, each with one or more known events. Our method was able to recover 100% of these events in the top 1% of the results, essentially pruning 99% of the data. Interestingly, our method was able to identify events that do not pass traditional event discovery procedures. In this extended work, we present a generalization of our algorithm to discover different event types characterized by distinct patterns. Copyright © 2009 Wiley Periodicals, Inc. Statistical Analysis and Data Mining 2: 396‐411, 2009
Analysis on Memory Contentions in a Homogeneous Multiprocessor System
Authors: Zhao Yongjian , Okada Hiromi , Maekawa Sadao 
Published: November 2009

AbstractThe performance of a homogeneous multiprocessor system with common memory contentions is evaluated in this paper. A symmetric continuous‐time Markovian queueing network model is developed and analyzed. The main result is that the average number of active processors, as an important performance measure, is derived and given by a very simple recursive formula. Using the result, several properties of the multiprocessor system are proved analytically. It is found that a profound performance measure defined as processing power saturation ratio is significant in the evaluation of multiprocessor systems. Some numerical examples are also available to verify the obtained results.
Phonemic Recognition of Input Frames by Partial Matching Method Based on Continuous Dynamic Programming
Authors: Oka Ryu‐Ichi 
Published: November 2009

AbstractThis paper proposes the partial matching method based on continuous DP, which is a new method to recognize the phoneme in continuous speech by pattern matching. The result of recognition experiment for the phoneme by the method is also shown. The standard pattern used in the continuous DP is a relatively macroscopic speech unit. The matching interval between the standard and the input patterns is labeled by a more microscopic speech unit, i.e., phoneme and pseudo‐phoneme. This is called the matching history, by the use of which, when the continuous DP values is less than a certain threshold, each input frame is identified using the phoneme and pseudo‐phoneme. For each input frame, the number of identifications for each phoneme or psuedo‐phoneme is calculated, and the result of recognition for the frame is determined as the phoneme or pseudo‐phoneme providing the maximum. The recognition experiment was made for the open data, composed of 19,440 frames uttered by 5 speakers, with 156 kinds of pseudo‐phonemes. The accumulated frame recognition rate was 57.6 percent for the first and 87.6 percent for the sixth. The accumulated pseudo‐phoneme recognition rate was 71.6 percent for the first and 90.1 percent for the sixth. The recognition system is of the frame‐wise form, and is suited to the realtime processing.
Tongue‐Shaped Measurement Using Piezoelectric Thin Film
Authors: Matsumura Masafumi , Fujii Katsuhiko 
Published: November 2009

AbstractA tongue‐shaped measuring system was developed using a polymer piezoelectric film to analyze the tongue motion in harmonization of utterance. The copolymer piezoelectric film has a bimorph structure and produces a voltage proportional to the curvature of the tongue. By attaching the film on the tongue, the curvature at each point on the surface is measured, and the shape of the tongue is calculated from the curvature. To evaluate the shape measurement using the developed system, a simulator for the tongue shape was constructed, which has a curved surface of curvature between −0.4 to −0.57cm−1. The shape of the simulator was measured. It was verified as a result that the error of estimation along the normal direction of the surface is within 0.5 mm, which is sufficient for the measurement of the tongue shape. Then the developed system was applied to measure the shape of the median and the frontal shape of the tongue during utterance. It is shown that the shape of the tongue during utterance can be measured. In the case of median shape, the curving. process from the main part to the tongue tip during the utterance of /r/ was clearly measured. The frontal shape, which has been difficult to measure, can easily be measured as in the case of the median shape, by modifying the placement of the copolymer piezoelectric film. The concave shape on the median line of the tongue during vowel harmonization was observed clearly.
A Generator for Syntax‐Directed Programming Systems
Authors: Hamada Takahashi , Kori Mitsunori 
Published: November 2009

AbstractThis paper describes a syntax‐directed programming system SPSG. SPSG generates automatically the interactive programming system from the formal specifications. The programming system provides an integrated programming environment, including the syntax‐directed editor, the interpreter with debugging functions and the compiler, utilizing the syntax structure of the programming language. A new parsing method XLALR(1) (and XSLR(1)) is proposed in SPSG to reconstruct the syntax tree efficiently during text‐editing. By utilizing this method, the syntax‐directed editing and the text‐based editing of the syntax editor can be performed simultaneously, which has been considered as difficult. Using SPSG, a PL/O‐like small‐scale language and a programming system for Pascal were generated, used and evaluated. The results indicated that the method adopted in the proposed system is useful and practical.
Representation of Procedural Knowledge by a Model of Human Associative Processor (HASP)
Authors: Hirai Yuzo 
Published: November 2009

AbstractA human associative processor (HASP) proposed by the author was developed and applied to procedural knowledge. The first step is a simple positive‐feedback model in which the output of a conventional HASP is fed back to its own key input. The chain of a procedure is memorized by taking the positive‐feedback input as the key input of the association, and by associating with the next procedure. A series of computer‐simulation studies showed that the model could express control structures such as wait, jump, do‐while, if‐then, and case control procedures. The second step shows that the simple positive‐feedback model sometimes cannot read the memorized procedure correctly; then an improved model was proposed. In the improved model structure, a converted orthogonal pattern from the positive feedback point and the external input key are used again as the key input. The improved model can read all the memorized procedures correctly; this was confirmed by computer simulation. It was also shown that the pattern completion function associated with the whole procedure from its part, can be represented by noise environmentalization.
The Concept of Software Service System (SSS)
Authors: Mori Ryoichi , Tashiro Shuichi 
Published: November 2009

AbstractThe software service system (SSS) is developed to protect software from unauthorized use and to encourage smooth marketing. The system does not impose any constraints on the users except for the request for the appropriate fees. The user can take the backup copy of the software, and at higher discretion, use the software stored at any position of the file system or computer network. The software can be exchanged not only through the discket but also any medium including the communication link and broadcast. The user can acquire the software on a fee basis from the medium, and may purchase the software, test or cancel if not satisfied. To realize such a free utilization scheme together with the security protection, as well as a very effective market channel aiming at the future, there must be established an automatic strict management of the propriety for the software as well as a carefully designed fee‐collecting system. To realize the automatic management of the software, common credit and the permission program are introduced. The implementation of the computer with a propriety management function together with its management operation is discussed.
Ultrasonic Reflection Mode CT with Projection Data Using A‐Mode Image
Authors: Ikegami Masiki , Yamamoto Tsuyoshi , Aoki Yoshinao 
Published: November 2009

AbstractA new computerized tomography (CT) using ultrasonic reflection A‐mode as projection data is proposed. First, taking X‐ray CT, the differences between transmission‐mode projection data and reflection A‐mode projection data were examined. Thus their reconstruction can be divided into the near‐field and far‐field regions. A conventional algorithm based on the projection theory can be used for reconstructing an image in the far‐field region, but this cannot be used for the near‐field region. To overcome this difficulty, an image‐reconstruction method modified from the filter‐compensated back‐projection method is proposed. The back‐projection method has complex coordinate calculations, their amount begin considerable. This is overcome by introducing a reference table so that a reduced calculation can be carried out by a simple integer‐operation alone. Unlike the conventional method which generally uses impulse waveforms for reconstructing the reflection A‐mode images, the wideband chirp‐pulse compression method is proposed to reduce the peak power and improve the definition. The method was confirmed by underwater experiments for the far‐field region, and by computer simulations for the near‐field region.
Pattern‐Directed Programming System for Lisp
Authors: Kawamura Tetsuya , Ohta Yoshikatsu , Yoshida Yuuji , Fukumura Teruo 
Published: November 2009

AbstractLisp has flexible data structures and can manipulate programs as data. Thus, Lisp is used often as descriptive language of systems which assist the development of Lisp programs. We have developed a system which transforms input/output specification described as a sequence of pattern pairs into a Lisp program. In this paper, we describe pattern definition and transformation rules which convert description by pattern into the Lisp program. We also describe some examples of description by pattern and transform their results. As its application, we describe an example of description by pattern of a pure Lisp compiler.
Cautious Transaction Schedulers with k Versions
Authors: Takeda Makoto , Masuyama Shigeru , Ibaraki Toshihide 
Published: November 2009

AbstractThis paper proposes cautious schedulers CS(WW(k)) and CS(WRW(k)), which are generalizations of the recently proposed cautious schedulers CS(WW), CS(WRW) and their multi‐version models CSm(MWW), CSm(MWRW). Here, it is assumed that only k versions of each data item are available. It is shown that their completion test can be performed in polynomial time, and that their fixed point sets WW*(k) and WRW(k) form infinite hierarchies, respectively, when k is increased from 1 to ∞. It is shown also that neither CS(W(k)) nor CS(WRW(k)) exhibits cancellation anomaly. These results indicate the practical importance of the cautious schedulers proposed herein.
Game Solving Procedure SSSR is Unsurpassed
Authors: Katoh Yoshiroh , Ibaraki Toshihide 
Published: November 2009

AbstractTwo‐person zero‐sum games with perfect information can be represented by minimax game trees. By solving such game trees, it is possible to compute the game values that are realized when both players always choose the best moves. Various search algorithms, such as α ‐β, SSS*, dual SSS*, B*, H*, are known for this purpose. Let A and B be two search algorithms; A surpasses B if, for any game tree, the region explored by A before computing the game value is contained in the region explored by B; A strictly surpasses B if A surpasses B and the region explored by A is properly contained in the region explored by B for at least one game tree. In this paper, we prove that no search algorithm strictly surpasses SSS* or dual SSS*.
Hierarchical Estimation of Displacement Vectors in Image Sequences
Authors: Sato Makoto , Sasaki Hiroshi 
Published: November 2009

AbstractThe problem of estimating the displacement vector for a moving object from a consecutive image sequence is one of the most important aspects of dynamic image processings in various fields such as image coding, remote sensing and robot vision. The displacement vector can be determined by the matching method, wherein the displacement vector is determined through the matching among subregions, or by the gradient method, wherein the displacement vector is estimated from the relation between the gray‐level gradient of the image and the gray‐level difference between images. Compared with the matching method, the gradient method has the advantage that the computation is simple and complex motion can be handled, although it is difficult to interpret global motion and the result is more vulnerable to noise. This paper proposes hierarchical estimation in which the advantage of the gradient method is utilized while coping with the demerits. The result is a more accurate estimation of the displacement vector. In the proposed method the hierarchical representation of the image is predetermined. The global motion estimated at a coarse level is transferred to more detailed levels of this hierarchy to compensate the previous estimation. By such a scheme, both the global and the detailed motions can be estimated with high accuracy and stability. By experiment it is demonstrated that the displacement vector can be estimated with high accuracy for image sequences for which estimation has been difficult by past methods.
Top‐Down Use of Linguistic Constraints in a Speech Understanding System
Authors: Niimi Yasuhisa , Kobayashi Yutaka , Uzuhara Shigeru 
Published: November 2009

AbstractThis paper proposes a method for the top‐down utilization of the linguistic constraints in the speed understanding system. In the proposed method, the syntactic constraint is represented by the context‐free grammar, and the semantic constraint is represented by the semantic marker and the case frame. The two kinds of constraints are integrated by using the definite clause grammar, which is an extension of the context‐free grammar. Based on the resulting representation, the word predictor program described by Prolog is generated by a mechanical transformation procedure. The left‐to‐right parsing scheme is assumed as the control. As the parser, a combination of top‐down and bottom‐up methods is adopted to parse utterances. This eliminates the problem in which the procedure falls in an infinite loop if a recursive rule exists, which has been serious in the traditional word predictor. The method was applied to a task, and its validity was verified. The average branching factor of the task was estimated by a simulation.
A Load Control Mechanism for Data‐Flow Machines
Authors: Takesue Masaru 
Published: November 2009

AbstractThe data‐flow computer is based essentially on parallel computation. Consequently, it is essential in the realization of such high‐level management and control functions as resource management to control the parallelism and parallel expansion. In the first part of this paper, the state and the transition are defined for the process in the dataflow computer, and the method for detecting the number of active state processes Na is discussed. Then a load control method is proposed whereby the processes are executed via the depth‐first approach while maintaining Na close to the predetermined threshold Nt. The compatibility between the load control and the load balancing is discussed. As a result of evaluation by the analysis and the simulation at the register transfer level, the following observations were made for the proposed load‐control method:(1) Na in a processor is maintained between Nt− 2 and Nt−1, and the depth‐first approach is utilized while maintaining the breadth parallelism of approximately 0.75 Nt.(2) The number of resources 0(2k) which has been considered necessary to execute a highly parallel program, is now reduced to 0(k), and the execution speed is improved by approximately 4 percent.(3) By combining the proposed method with the load balancing, the loads are distributed uniformly with the difference of Nt among processors being 3 or less.
Relation between Attention and Characteristics of Saccade during Tracking Eye Movement
Authors: Ebisawa Yoshinobu , Minamitani Haruyuki , Yamamoto Masahiro , Takase Moriichiro 
Published: November 2009

AbstractUntil now a satisfactory tracking eye movement control model has not been constructed. It is understood that the tracking eye movement characteristics are affected by the attention of the subject, for which, however, no study has been made. This paper considers the visual feedback called target brightness feedback, where the information concerning the accuracy of tracking and the moving target is fed back to the subject through the change of brightness of the target. By this method, the attention of the subject tracking a moving target is invoked. The saccadic motion is especially examined in detail. The saccade is observed to decrease with the increase of attention. As a result of more detailed analysis, it was observed that the position error at the start of the saccade is increased and the ratio of the saccadic amplitude to the position error is decreased. Those properties can be accounted for on the control model as the enlargement of the saccadic dead zone, and the decrease of the adjusting gain for position error, which is a new‐control element added to the model. It was also examined at which point on the retina the target is recognized. There was observed a tendency that the tracking is made at the periphery with the increase of attention. Those phenomena are considered as due to the avoidance of saccadic suppression.
A Method for Generating Messages of the Interactive Software Based on the Individual User Model
Authors: Nagata Morio , Nakashima Satoru 
Published: November 2009

AbstractStudies have been made on computer systems based on the user model reflecting the behavior of the users, aiming at the human interface which is easy to use. Recently, it has been proposed that individual models be constructed for the users, rather than a model where the only one “typical” human model represents the user in general. A case has not been observed, however, where the individual model is utilized fully in the interactive computer system which actually requires such an approach. From such a viewpoint, this paper proposes a generation of suitable messages utilizing the individual user model, by restricting the problem to the generation of the messages from the computer side in the construction of a program in the interactive programming environment. The features of the user model which will be useful in such a problem, are pointed out. The points in this study are that the skill of the user concerning the system is separated into the general understanding level and the knowledge of the individual functions; utilization of the information obtained by the operating system and for the language processor; and object‐oriented user model whose contents are always updated. A human interface was implemented experimentally which indicates the individual user, the error message from Lisp interpreter according to each situation. We have conducted an experiment by using the interface. The usefulness of our method was demonstrated by the result of experiment.
Human Interface Using Domain Knowledge Retrieval
Authors: Matsuzawa Kazumitsu , Nagano Yukari , Kaneda Shigeo 
Published: November 2009

AbstractThis paper proposes the domain knowledge retrieval method aiming at the realization a smooth man‐machine interface in the speech interactive service. The method is to reduce the ambiguities in the input produced in the recognition by utilizing the dependence among the input information. By the use of the proposed system, the naturalness of the interaction is improved since the input acknowledge by the user can be omitted. More precisely, a retrieval matching is proposed where the data retrieval corresponding to the user is made on the service side to restrict the recognition dictionary and to identify the final service information with a high probability. Various applications are shown from the viewpoint of the order of restriction. To guide the design of the retrieval matching, a quantitative evaluation method is presented based on the modelings of the recognition system and the service data.
Design Approach of BTRON Human Interface
Authors: Sakamura Ken 
Published: November 2009

AbstractThere can be several approaches to the discussion of the human interface. It is important to consider whether or not the model (or world view) is easily understandable to humans or how to guide the design at crucial points. Apart from those problems, however, which deal with the performance of the human interface itself, it is also important to consider the range of interface applications, i.e., how many working environments the interface can handle in a unified way. This paper discusses the design approach in the human interface in BTRON, where the design and realization are considered separately so that the unified human interface is realized even if a different implementation is made independently.