Constraint Satisfaction Using Neural Networks with a Local and Autonomous Annealing Technique (2008)
Teleconferencing systems, including audio-only and audio-andvideo conferencing systems, enable conversation between three or more persons. In many teleconferencing systems, there are multiple virtual...
SOOC-94: An Experimental Language toward Building Real-World Computing Systems (2008)
Today’s computer applications often require on-line input and output and some-times requires change of computation methods while processing complex tasks. In future, they will probably be required...
Methods of Extracting Year References for Chronological-table-generating Text Searching (2008)
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...
A text search method, which is called an axisspecified search method, is proposed. This method is suitable for full-text searches of a large-scale text collection. In this method, in addition to...
A method for conference-room management for an auditory-virtual-space-based voicecommunication medium called voiscape and a voice-communication system prototype called VPII, which used this method,...
Constraint Satisfaction by Parallel Optimization of Local Evaluation Functions with Annealing (2008)
A method for solving large-scale constraint satisfaction problems is proposed in the present paper. This method is stochastic (or randomized) and uses local information only, i.e., no global plan is...
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)....
The author researches toward establishing voice communication media called voiscape which shall replace telephone. A virtual “sound room ” that is created by spatial audio technology is used in...
Cellular automata are used as models of emergent computation and artificial life. They are usually simulated under synchronous and deterministic conditions. Thus, they are evolved without existence...
Diffserv Policies and Their Combinations in OpenView/JP1 PolicyXpert (2008)
In policy-based networks, two or more policies often work in cooperation. For example, in a QoS-assured network service such as Diffserv, packets from service subscribers are classified and policed...
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)....
SOOC-94: An Experimental Language toward Building Real-World Computing Systems (2007)
Today's computer applications often require on-line input and output and sometimes requires change of computation methods while processing complex tasks. In future, they will probably be...
A Method of Software-Hardware Integration for QoS Policy Combination in Gigabit Routers (2007)
Abstract: In policy-based networks, two or more policies often have to cooperate because combined and customized network functions must be controlled using policies. Two types of policy...
Dynamically Extensible Policy Server and Agent (2007)
Abstract: This paper proposes a method, called the policyextension-by-policy method, for quickly and dynamically adding policy classes with new functionality to policy servers and agents. In this...
Simulated Virtual Market Place - Using Voiscape Communication Medium (2005)
We are developing a new voice communication medium called voiscape. Voiscape enables natural and seamless bi-directional voice communication by using sound to create a virtual sound room. In a sound...
Rule-Based Building-Block Architecture for Policy-based Networking (2003)
Yasusi Kanada, Brian J. O'Keefe
We developed two rule-based building-block architectures, i.e., pipe-connection and label-connection architectures, for describing complex and structured policies, especially network QoS policies....
In policy-based networking, policies sometimes have to be combined and applied in cooperation to represent such programmable and customizable network functions as Diffserv. For a policy server called...
Because higher- and lower-level policies do not necessarily correspond one-to-one, a higher-level network policy may have to be translated into two or more lowerlevel policies, and two or more...
Division and Fusion: Examples and A Method (2001)
Introduction to policy division and fusion 2. Examples and problems in Diffserv 3. A Method of policy division and fusion 4. Resolution of the 1. Introduction to policy division and 3 2001 2001-5-16...
Two Rule-based Building-block Architectures for Policy-based Network (2000)
Abstract. Policy-based networks can be customized by users by injecting programs called policies into the network nodes. So if general-purpose functions can be specified in a policy-based network,...
Rule-based Modular Representation of QoS Policies, Networking Architecture Workshop (2000)
To realize internet-protocol-based QoS-assured networks, using differentiated services under policy-based networking is a promising approach. A QoS policy server must work in multi-vendor...
A Representation of Network Node QoS Control Policies Using Rule-based Building Blocks (2000)
Network node functions, such as QoS or the security functions of routers, are becoming increasingly complex, so programs, not only configuration parameters, are required to control network nodes. In...
Methods of Extracting Year References for Chronological-table-generating Text Searching (1999)
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...
Web Pages That Reproduce Themselves By Javascript (1997)
A JavaScript program in a Web page can clear the page content including the program itself and generate new content. The program can generate exactly the same content including the program itself....
Web Pages that Reproduce Themselves by JavaScript (1997)
Yasusi Kanada Central, Yasusi Kanada
this paper. The process of self-reproduction is explained below. The same page as shown in Figure 2 is divided into five parts in Figure 4. The program in the first part, which is labeled "Part...
Web Pages that Reproduce Themselves by JavaScript (1997)
this paper. The process of self-reproduction is explained below. The same page as shown in Figure 2 is divided into five parts in Figure 4. The program in the first part, which is labeled "Part...
Cellular automata are used as models of emergent computation and artificial life. They are usually simulated under synchronous and deterministic conditions. Thus, they are evolved without existence...
Two methods for solving large-scale constraint satisfaction problems using parallel processing are surveyed in the present paper. These methods are based on CCM, which is a model for emergent...
Taxonomy and Description of Policy Combination Methods (1995)
Abstract. To control complicated and decomposable networking functions, such as Diffserv, two or more policies must cooperate. Combining two or more mutually dependent policies for a specific purpose...
Fuzzy Constraint Satisfaction Using CCM --- A Local Information Based Computation Model (1995)
The present paper proposes a method of solving the fuzzy constraint satisfaction problems defined by Ruttkay. This method is based on CCM, which is a computational model for emergent computation, or...
Hisaaki Hatano, Yuji Sato, Yasusi Kanada, Shoji Hatano, Ryuichi Oka
M) [Kan 94b]. FAM is a method similar to simulated annealing but only uses local information. The performance is comparable to GSAT in large-scale graph coloring problems [Kan 95c]. Secondly,...
Combinatorial Problem Solving Using Randomized Dynamic Tunneling on A Production System (1995)
Yasusi Kanada, Shima Individually
Levy and Montalvo, Yao, and Shima individually proposed tunneling algorithms. The tunneling algorithms employ analogy to tunnel effect in physics, and are used to optimize continuous systems. The...
Combinatorial Problem Solving Using Randomized Dynamic Composition of Production Rules (1995)
The present paper proposes a method of solving combinatorial problems using randomized dynamic rule composition. This method is called CCM* and is based on a computational model called Chemical...
Fuzzy Constraint Satisfaction Using CCM - A Local Information Based Computation Model (1995)
The present paper proposes a method of solving the fuzzy constraint satisfaction problems defined by Ruttkay. This method is based on CCM, which is a computational model for emergent computation, or...
Stochastic Problem Solving by Local Computation based on Self-organization Paradigm (1994)
We are developing a new problem-solving methodology based on a self-organization paradigm. To realize our future goal of self-organizing computational systems, we have to study computation based on...
The Effects of Randomness in Asynchronous 1D Cellular Automata (1994)
Cellular automata are used as models of emergent computation and artificial life. They are usually simulated under synchronous and deterministic conditions. Thus, they are evolved without the...
Stochastic Problem Solving by Local Computation based (1994)
We are developing a new problem-solving methodology based on a self-organization paradigm. To realize our future goal of self-organizing computational systems, we have to study computation based on...
A method of vector processing for shared symbolic data (1993)
Conventional processing techniques for pipelined vector processors such as the Cray-XMP, or dataparallel computers, such as the Connection Machines, are generally applied only to independent multiple...
A method of vector processing for shared symbolic data (1993)
Conventional processing techniques for pipelined vector processors such as the Cray-XMP, or dataparallel computers, such as the Connection Machines, are generally applied only to independent multiple...
1 A General-Purpose Conjunctive Iterative Control Structure for Prolog (1989)
A loop-like control structure without using backtracking, or conjunctive iteration, is expressed using recursion in Prolog. However, recursion is too powerful to express an iteration, which needs...
A General-Purpose Conjunctive Iterative Control Structure for Prolog (1989)
A loop-like control structure without using backtracking, or conjunctive iteration, is expressed using recursion in Prolog. However, recursion is too powerful to express an iteration, which needs...
Constraint Satisfaction by Parallel Optimization of Local Evaluation Functions with Annealing
A method for solving large-scale constraint satisfaction problems is proposed in the present paper. This method is stochastic (or randomized) and uses local information only, i.e., no global plan is...