A scalable interest-oriented peer-to-peer pub/sub network

There has been a big challenge in structured peer-to-peer overlay network research area. Generally, a structured overlay network involves nodes evenly or based on their resource availabilities, and gathers nodes?? resources to achieve some bigger tasks. The challenge here is to gather resources based on nodes?? interests, and only interested nodes are involved in a certain task. Toward this challenge, we propose a new scheme to a peer-to-peer publish/subscribe network. Publish/subscribe represents a new paradigm for distributed content delivery. It provides an alternative to address-based communication due to its ability to decouple communication between the source and the destination. We propose a Bloom filter based mapping scheme to map IDs to nodes?? interests in addition to new interest proximity metric to forward events and to build nodes?? routing tables. We also propose a new approach called ??shared interest approach?? for network discovery. To evaluate the algorithms proposed in this work, we conducted simulations in both static and dynamic settings, and found a low false positive rate. We also discuss about a well-known application called Twitter, and show how our scheme would work in a real environment.     

An adaptive threshold in joint approximate diagonalization by assuming exponentially distributed errors

Joint approximate diagonalization (JAD) is one of well-known methods for solving blind source separation. JAD diagonalizes many cumulant matrices of given observed signals as accurately as possible, where the optimization for each pair of signals is repeated until the convergence. In each pair optimization, JAD should decide whether the pair is actually optimized by a convergence decision condition, where a fixed threshold has been employed in many cases. Though a sufficiently small threshold is desirable for the accuracy of results, the speed of convergence is quite slow if the threshold is too small. In this paper, we propose a new decision condition with an adaptive threshold for JAD under a probabilistic framework. First, it is assumed that the errors in JAD (non-diagonal elements in cumulant matrices) are given by the exponential distribution. Next, it is shown that the maximum likelihood estimation of the probabilistic model is equivalent to JAD. Then, an adaptive threshold is theoretically derived by utilizing the model selection theory. Numerical experiments verify the efficiency of the proposed method for blind source separation of artificial sources and natural images. It is also shown that the proposed method is especially effective when the number of samples is limited.     

A performance evaluation of disassembly systems with reverse blocking

For sustainable manufacturing, manufacturers should construct and design inverse manufacturing systems consisting of assembly and disassembly systems. The sorting process in the disassembly system is the first process of the whole inverse manufacturing system. Therefore, it can become a bottleneck and decrease the productivity of the whole inverse manufacturing systems.This study focuses on a disassembly system with reverse blocking in a sorting process [Yamada, T., & Matsui, M. (2003). Disassembly production systems and its design issues. Reprints of Japan Industrial Management Association, Spring meeting, Chofu, Japan, May, 144–145 (in Japanese)]. It generalizes the queuing model and discusses the performance of the disassembly system by mathematical and numerical analysis. First, the sorting process with reverse blocking is generally modeled as a queuing system. Next, the stationary state equations of the system are formulated, and the objective function is set as the throughput. Finally, the system performance is discussed by mathematical and numerical analysis in cases of a different number of stations and buffers, and also an example of the system design is shown and discussed in view of the busy rate, blocking probability and throughput.     

LMNtal as a hierarchical logic programming language

LMNtal (pronounced “elemental”) is a simple language model based on hierarchical graph rewriting that uses logical variables to represent connectivity and membranes to represent hierarchy. LMNtal is an outcome of the attempt to unify constraint-based concurrency and Constraint Handling Rules (CHR), the two notable extensions to concurrent logic programming. LMNtal is intended to be a substrate language of various computational models, especially those addressing concurrency, mobility and multiset rewriting. Although the principal objective of LMNtal was to provide a unifying computational model, it is of interest to equip the formalism with a precise logical interpretation. In this paper, we show that it is possible to give LMNtal a simple logical interpretation based on intuitionistic linear logic and a flattening technique. This enables us to call LMNtal a hierarchical, concurrent linear logic language.     

Platform design for large-scale artificial market simulation and preliminary evaluation on the K computer

Artificial market simulations have the potential to be a strong tool for studying rapid and large market fluctuations and designing financial regulations. High-frequency traders, that exchange multiple assets simultaneously within a millisecond, are said to be a cause of rapid and large market fluctuations. For such a large-scale problem, this paper proposes a software or computing platform for large-scale and high-frequency artificial market simulations (Plham: /pl\(\Lambda\)m). The computing platform, Plham, enables modeling financial markets composed of various brands of assets and a large number of agents trading on a short timescale. The design feature of Plham is the separation of artificial market models (simulation models) from their execution (execution models). This allows users to define their simulation models without parallel computing expertise and to choose one of the execution models they need. This computing platform provides a prototype execution model for parallel simulations, which exploits the variety in trading frequency among traders, that is, the fact that some traders do not require up-to-date information of markets changing in millisecond order. We evaluated a prototype implementation on the K computer using up to 256 computing nodes.     

An efficient Earth Mover's Distance algorithm for robust histogram comparison

We propose EMD-L1: a fast and exact algorithm for computing the Earth Mover's Distance (EMD) between a pair of histograms. The efficiency of the new algorithm enables its application to problems that were previously prohibitive due to high time complexities. The proposed EMD-L1 significantly simplifies the original linear programming formulation of EMD. Exploiting the L1 metric structure, the number of unknown variables in EMD-L1 is reduced to O(N) from O(N2) of the original EMD for a histogram with N bins. In addition, the number of constraints is reduced by half and the objective function of the linear program is simplified. Formally, without any approximation, we prove that the EMD-L1 formulation is equivalent to the original EMD with a L1 ground distance. To perform the EMD-L1 computation, we propose an efficient tree-based algorithm, Tree-EMD. Tree-EMD exploits the fact that a basic feasible solution of the simplex algorithm-based solver forms a spanning tree when we interpret EMD-L1 as a network flow optimization problem. We empirically show that this new algorithm has an average time complexity of O(N2), which significantly improves the best reported supercubic complexity of the original EMD. The accuracy of the proposed methods is evaluated by experiments for two computation-intensive problems: shape recognition and interest point matching using multidimensional histogram-based local features. For shape recognition, EMD-L1 is applied to compare shape contexts on the widely tested MPEG7 shape data set, as well as an articulated shape data set. For interest point matching, SIFT, shape context and spin image are tested on both synthetic and real image pairs with large geometrical deformation, illumination change, and heavy intensity noise. The results demonstrate that our EMD-L1-based solutions outperform previously reported state-of-the-art features and distance measures in solving the two tasks.     

Information gathering and searching approaches on the Web

The information accessible through the Internet is increasing explosively as the Web is getting more and more widespread. In this situation, the Web is indispensable information resource for both of information gathering and information searching. Though traditional information retrieval techniques have been applied to information gathering and searching in the Web, they are insufficient for this new form of information source. Fortunately some Al techniques can be straightforwardly applicable to such tasks in the Web, and many researchers are trying this approach. In this paper, we attempt to describe the current state of information gathering and searching technologies in the Web, and the application of AI techniques in the fields. Then we point out limitations of these traditional and AI approaches and introduce two aapproaches: navigation planning and a Mondou search engine for overcoming them. The navigation planning system tries to collect systematic knowledge, rather than Web pages, which are only pieces of knowledge. The Mondou search engine copes with the problems of the query expansion/modification based on the techniques of text/web mining and information visualization. Seiji Yamada, Dr. Eng.: He received the B.S., M.S. and Ph.S. degrees in control engineering and artificial intelligence from Osaka University, Osaka, Japan, in 1984, 1986 and 1989, respectively. From 1989 to 1991, he served as a Research Associate in the Department of Control Engineering at Osaka University. From 1991 to 1996, he served as a Lecturer in the Institute of Scientific and Industrial Research at Osaka University. In 1996, he joined the Department of Computational Intelligence and Systems Science at Tokyo Institute of Technology, Yokohama, Japan, as an Associate Professor. His research interests include artificial intelligence, planning, machine learning for a robotics, intelligent information retrieval in the WWW, human computer interaction, He is a member of AAAI, IEEE, JSAI, RSJ and IEICE. Hiroyuki Kawano, Dr.Eng.: He is an Associate Professor at the Department of Systems Science, Graduate School of Informatics, Kyoto University, Japan. He obtained his B.Eng. and M.Eng. degrees in Applied Mathematics and Physics, and his Dr.Eng. degree in Applied Systems Science from Kyoto University. His research interests are in advanced database technologies, such as data mining, data warehousing, knowledge discovery and web search engine (Mondou). He has served on the program committees of several conferences in the areas of Data Base Systems, and technical committes of advanced information systems.     

Isolation of penicillin-resistant Streptococcus pneumoniae in Saga Medical School Hospital

A recent nationwide increase in beta-lactams-resistant Streptococcus pneumoniae has attracted a great deal of attention. We studied the drug sensitivity of S. pneumoniae isolated from various clinical specimens in Saga Medical School Hospital between April 1988 and December 1991. To determine the drug sensitivity of the strains, we used a micro-dilution method and determined the MIC. Drug resistance was evaluated using MIC of ampicillin (ABPC) as a reference MIC, and the results were roughly classified into the following three groups: sensitive (< or = 0.1 microgram/ml), moderately resistant (0.2-3.13 micrograms/ml) and highly resistant (> or = 6.25 micrograms/ml). The isolation frequency was calculated on the basis of one strain from one patient. No strain of S. pneumoniae with high resistance against ABPC was found in 1988 (94 strains of S. pneumoniae were isolated) and 1990 (115 strains isolated), but one such strain (0.8%) was found among 129 strains isolated in 1989, and 2 such strains (2.4%) among 84 strains isolated in 1991. Moderately resistant strains were isolated at the frequencies of 12.8%, 15.5%, 22.6%, and 21.4% respectively, in 1988, 1989, 1990, and 1991. A sum of the frequencies of "moderately resistant" and "highly resistant" (2.4%) strains was 23.8% in 1991. The frequency of resistant strains is increasing and the intensity of resistance is also being elevated.     

Linearity Analysis of Concurrent Logic Programs

Automatic memory management and the hiding of the notion of pointers are the prominent features of symbolic processing languages. They make programming easy and guarantee the safety of memory references. For the memory management of linked data structures, copying garbage collection is most widely used because of its simplicity and desirable properties. However, if certain properties about runtime storage allocation and the behavior of pointers can be obtaind by static analysis, a compiler may be able to generate object code closer to that of procedural programs. In the fields of parallel, distributed and real-time computation, it is highly desirable to be able to identify data structures in a program that can be managed without using garbage collection. To this end, this paper proposes a framework of linearity analysis for a concurrent logic language Moded Flat GHC, and proves its basic property. The purpose of linearity analysis is to distinguish between fragments of data structures that may be referenced by two or more pointers and those that cannot be referenced by two or more pointers. Data structures with only one reader are amenable to compile-time garbage collection or local reuse. The proposed framework of linearity analysis is constraint-based and involves both equality and implicational constraints. It has been implemented as part of klint v2, a static analyzer for KL1 programs.     

Localization of vitamin A in the small intestine of mouse. An electron microscope radioautographic study

Localization of vitamin A in the small intestine of mice was studied with electron microscope radioautography after administration of tritiated vitamin A. The label was concentrated over lipid droplets in cells distributed in the lamina propria and the submucous layer. The cells were similar both to fibroblasts and to fat-storing cells in their morphological features. The name "Vitamin A-Storing Cell" is proposed for these labeled cells, including the fat-storing cell in the liver.