A Method of Geographical Name Extraction from Japanese Text for Thematic Geographical Search

A text retrieval method called the thematic geographical search method has been developed and applied to a Japanese encyclopedia called the World Encyclopdia. In this method, the user specifies a search theme using free words, then obtains a sorted list of excerpts and hyperlinks to encyclopedia sentences that contain geographical names. Using this list, the user can also open maps that indicate the locations of the names. To generate an index of names for this searching, a method of extracting geographical names has been developed. In this method, geographical names are extracted, matched to names in a geographical name database, and identified. Geographical names, however, often have several types of ambiguities. Ambiguities are resolved by using non-local context analysis, which uses a stack and several other techniques. As a result, the precision of extracted names is more than 96% on average. This method depends on features of the Japanese language, but the strategy and most of the techniques can be applied to texts in English or other languages

Methods of Extracting Year References for Chronological-table-generating Text Searching

A method of extracting year references for a textual information retrieval method called the thematic chronological-table search method is explained in this paper. This search method generates an index by extracting and collecting year references from a text collection. The resulting index and a full-text index are used for searching sentences that contain year references and search words. The results are displayed in the form of a chronological table with hyperlinks to the original text. Seven forms of year or century references are extracted and normalized using string matching patterns. The extraction error rate is reduced by using both local and non-local contexts. If the lower two digits of a Gregorian year, which matches a form, occurs, it is normalized by supplementing the upper digits using the non-local context. This method has been applied to a Japanese encyclopedia. An evaluation shows the precision of extraction to be higher than 99 % in most cases

Self-organized 3D-Printing Patterns Simulated by Cellular Automata

Abstract. 3D printers are usually used for printing objects designed by 3D CAD exactly, i.e., deterministically. However, 3D printing pro-cess contains stochastic self-organization process that generate emergent patterns. A method for generating fully self-organized patterns using a fused deposition modeling (FDM) 3D printer has been developed. Melted plastic filament is extruded constantly in this method; however, by using this method, various patterns, such as stripes, splitting and/or merg-ing patterns, and meshes can be generated. A cellular-automata-based computational model that can simulate such patterns have also been developed.

A Node Plug-in Architecture for Evolving Network Virtualization Nodes

Abstract – Virtualization nodes, i.e., physical nodes with network virtualization functions, contain computational and networking components. Virtualization nodes called “VNodes ” enabled mutually independent evolution of computational component called programmer and networking component called redirector. However, no methodology for this evolution has been available. Accordingly, a method for evolving programmer and redirector and developing new types of virtualized networking and/or computational functions in two steps is proposed. The first step is to develop a new function without updating the original VNode, which continues services to existing slices, using a proposed plug-in architecture. This architecture defines predefined interfaces called open VNode plug-in interfaces (OVPIs), which connect a data and a control plug-ins to a VNode. The second step is to merge the completed plug-ins into the original programmer or redirector. A prototype implementation of the above plug-in architecture was developed, tested, and evaluated. The prototype extends the redirector by adding new types of virtual links and new types of network accommodation. Estimated throughputs of a VLAN-based network accommodation and a VLAN-based virtual link using network processors are close to a wire rate of 10 Gbps

Parallel Processing Method of Combinatorial Problem Solving Based on Implicit Stochastic Divide-and-Conquer

A method of solving combinatorial problems, such as the N queens problem or graph coloring problems using independent parallel processes, is proposed . This method is stochastic (or randomized). Problems are decomposed for parallel processing implicitly and stochastically. This method is based on CCM, which is a computational model proposed by the author. A program consists of production rules and local evaluation functions in CCM. Each process uses the same set of rules and functions, and it may use the same set of initial data . However, the performance is approximately in proportion to the number of processors in average in certain cases. The theoretical reason of this linear acceleration is explained, and several results of experiments are also shown. Keywords Combinatorial problem solving, Randomized algorithms, Emergent computation, Stochastic computation, Divide-and-conquer method 1. Introduction Most of conventional methods of solving complex problems have, as we believe, t..