An endoscope is a medical instrument that acquires images inside the human body. This paper proposes a new approach for the automatic detection of polyp regions in an endoscope image using a Hessian Filter and machine learning approaches. The approach improves performance of automatic detection of polyp detection with higher accuracy. The approach uses HOG feature as a local feature since the polyp and non-polyp region often have similar color information. The approach also uses Real Adaboost and Random Forests as classifiers which works effciently even when the dimension of feature vector becomes large. It is suggested that Hessian filter can contribute to reducing the computational time in comparison with the case when only HOG features are used to detect the polyp region. K-means++ is introduced to integrate the detection results in the classification. It is shown that polyp detection with high accuracy is performed in the computer experiments with endoscope images.

It is common for clients using Twitter to adopt displays that indicate their posts (tweets) as textboxes, and they are individually and perpendicularly lined up in order. When several people discuss a particular topic, they frequently post tweets as "replies". However, it is difficult for users in these types of displays to obtain the information that is required and beneficial to understand to make progress in particular discussions. Consequently, we propose a system, which we evaluated, of visualizing the relations between tweets by using digraphs.

We describe a system for sharing distributed XML data among organizations using customizable schema. In our system, each organization can customize common DTD (Document Type Definition) within the bound of rule to create its own DTD, which is called customized DTD. And then it can describe information with tags according to the customized DTD. Basically, the upper structure of shared XML data is common. Proposed system consists of a management server, data providing servers, and application servers. They communicate with each other through web services technology. Customized DTDs are managed centrally by the management server. The server also examines whether they conform to the rule of customization. As a result of prototype system using welfare information, we found that our system was effective for sharing information among organizations of which each works freely in the same field.

This paper presents a new kind of document-information acquisition system, which we call an information probe system. This system is intended to enable the user-centric acquisition of information in which authors and users may not have a common interpretation. The notion of the ldquoskeletonrdquo is devised to abstract the relations between terms that appear in the pairs of adjacent layers of hierarchical documents. The skeleton reflects the assertions made by authors, and its formal description is presented by applying the notation of conceptual graphs. This model has produced a scheme for the assertion-based acquisition of information. The assertions of authors and of users are represented as respective sets of terms and their relations; document information is then selectively acquired by comparing the assertions. Probing is intended to cater to the original interpretations of individual users, and uses assertions as clues in searching for document information.

As network data rate increases rapidly, high-speed signaling circuits for server communication pose many design challenges due to various system requirements using different interconnect mediums. This paper discusses main problems and solutions of high-speed circuits for server interconnect. Then, it presents a high-speed circuit implementation for such interconnect using 90nm CMOS technology that achieved data rate at 6.25 Gbps in a backplane environment.

A method is presented for indexing terms in a knowledge-base retrieval-by-unification (RBU) system. The term is a well-defined structure which represents knowledge using variables. RBU operations are an extension of relational database operations using unification and backtracking to retrieve terms from term relations. The term indexing proposed uses hashing and trie structures to reduce the number of comparisons between elements of a search condition and of an object term relation. Unification on a trie structure is suited to backtracking bindings of variables. The search and updating speed of an RBU prototype is measured to evaluate the indexing method. This method is effective for fast term retrieval for a large number of similar and varied form terms. The overhead for maintaining indexes in updating is low.>

The FACOM ALPHA is the first and only commercially dedicated processor for Lisp and Prolog manufactured in Japan. This paper discusses the evaluation of the FACOM ALPHA for Lisp execution when compared with a general-purpose computer. The CPU use rate of machine instructions and the utilization ratio of the hardware resources are discussed. This paper also explains the interaction between the garbage collector and the virtual memory system, which improves system response time.

ALPHA is a dedicated machine designed for high-speed list processing. In this article, we describe a highly effective stack which can support a value cache and virtual stack, and high-speed garbage collection algorithm for virtual memory. These new ideas have been studied in ALPHA. ALPHA is designed as a back end processor for a large computer under TSS. ALPHA allows TSS users to do more high-speed list processing than a large computer does.