Rule-Based Building-Block Architecture for Policy-based Networking (2003)
Brian J. O'keefe, Yasusi Kanada
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....
Dynamically Extensible Policy Server and Agent (2002)
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 method,...
A Method of Software-Hardware Integration for Qos Policy Combination (2002)
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 transformation, policy...
Diffserv Policies and Their Combinations in a Policy Server (2002)
Brian J. O'keefe, Yasusi Kanada
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...
Web Pages that Reproduce Themselves by JavaScript (2001)
this paper. Updated on 10/25/2001 reproduced page and clicks the button, then the button does not work as expected. It does not work because the program has gone! Microsoft Internet Explorer does not...
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...
Two Rule-based Building-block Architectures for Policy-based Network Control (2001)
In a policy-based network, two or more policies must often cooperate to provide a high-level function or policy. To support such building-block policies, two architectures for modeling a set of...
Taxonomy and Description of Policy Combination Methods (2001)
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 is called...
Two Rule-based Building-block Architectures (2001)
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, the network...
Rule-based Modular Representation of QoS Policies (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...
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...
A Method of Geographical Name Extraction from Japanese Text for Thematic Geographical Search (1999)
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...
Web Pages that Reproduce Themselves by JavaScript (1999)
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 F1,"...
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)....
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...
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 required to...
Fuzzy Constraint Satisfaction Using CCM --- A Local Information Based Computation Model (1999)
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...
Kanada, Y., A method of vector processing for shared symbolic data, Parallel Computing, X (1993) XXX-XXX. Conventional processing techniques for pipelined vector processors such as the Cray-XMP, or...
Web Pages that Reproduce Themselves by JavaScript (1999)
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 F1,"...
A General-Purpose Conjunctive Iterative Control Structure for Prolog (1999)
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...
The Effects of Randomness in Asynchronous 1D Cellular Automata (1997)
this paper is presented as a poster in Artificial Life IV [Kan 94b].
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...
Constraint Satisfaction by Parallel Optimization of Local Evaluation Functions with Annealing (1997)
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 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 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 Vector Processing for Shared Symbolic Data (1997)
Kanada, Y., A method of vector processing for shared symbolic data, Parallel Computing, X (1993) XXX-XXX. Conventional processing techniques for pipelined vector processors such as the Cray-XMP, or...
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...
HICSS-27 --- Emerging Paradigms (Revised version), 93.9.29 (Original version --- (1996)
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 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)....
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)....
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)....
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)....
Fuzzy Constraint Satisfaction Using CCM - A Local Information Based Computation Model (1994)
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...
SOOC-94: An Experimental Language Toward Building Real-World Computing Systems (1994)
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 required to...
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 required to...