The counterpropagation network was obtained by combining Kohonen learning and Grossberg learning. By adding of dynamical elements in the Kohonen learning, we obtained a new network, the counterpropagation neural netwo...
详细信息
ISBN:
(纸本)0780383591
The counterpropagation network was obtained by combining Kohonen learning and Grossberg learning. By adding of dynamical elements in the Kohonen learning, we obtained a new network, the counterpropagation neural network with delays. This network is suitable to be applied for solving problems in the domain of temporal sequence processing. An application to a financial prediction problem, the forecasting of the currency exchange rate, is shown.
Location management and message delivery protocol is fundamental to the further development of mobile agent systems in a multi-region mobile agent computing environment in order to control mobile agents and guarantee ...
详细信息
ISBN:
(纸本)0769520863
Location management and message delivery protocol is fundamental to the further development of mobile agent systems in a multi-region mobile agent computing environment in order to control mobile agents and guarantee message delivery between them. However previous works have some problems when they are applied to a multi-region mobile agent computing environment. First, the cost of location management and message delivery is increased relatively. Second, a following problem arises. Finally, cloned mobile agents and parent & child mobile agents don't get dealt with with respect to location management and message delivery. In this paper we present a HB (Home-Blackboard) protocol which is a new location management and message delivery protocol for mobile agents in a multi-region mobile agent computing environment. We have implemented the HB protocol. The HB protocol decreases the cost of location management and message delivery and solves the following problem with low communication cost. In addition, the HB protocol deals with the location management and message delivery of cloned and parent & child mobile agents, so that it guarantees message delivery of these mobile agents.
This paper presents a novel algorithm for computing similarity between very short texts of sentence length. It will introduce a method that takes account of not only semantic information but also word order informatio...
详细信息
ISBN:
(纸本)1577352017
This paper presents a novel algorithm for computing similarity between very short texts of sentence length. It will introduce a method that takes account of not only semantic information but also word order information implied in the sentences. Firstly, semantic similarity between two sentences is derived from information from a structured lexical database and from corpus statistics. Secondly, word order similarity is computed from the position of word appearance in the sentence. Finally, sentence similarity is computed as a combination of semantic similarity and word order similarity. The proposed algorithm is applied to a real world domain of conversational agents. Experimental results demonstrated that the proposed algorithm reduces the scripter's effort to devise rule base for conversational agent.
computing the planar sections of objects is a fundamental operation in solid modeling. Subdivision method is commonly used far solving such intersection problems. In this paper, a novel revolute quadric decomposition ...
详细信息
ISBN:
(纸本)0769520758
computing the planar sections of objects is a fundamental operation in solid modeling. Subdivision method is commonly used far solving such intersection problems. In this paper, a novel revolute quadric decomposition is proposed for surfaces of revolution, which are subdivided into a set of coaxial revolute quadrics along the generatrix. This reduces the intersection problem of a plane and a surface of revolution to the intersection problem of a plane and a revolute quadric, which has robust, accurate and efficient geometric solution. Further, the intersection curves can be represented with a group of G1 conic arcs. A new concept, valid intersection interval (VII), is introduced and a new technique, cylindrical bounding shell clipping, is proposed for efficient intersection detection for a plane and a surface of revolution. Finally, a tracing algorithm is presented for recognizing singular points and closed loops of intersection curves. Implemented examples show the robustness and effectiveness of the proposed algorithm.
This paper investigates the experimental setup and signal processing and estimation techniques required to identify a model of an open-frame Remotely Operated Vehicle (ROV) using a low-cost Inertia] Measurement Unit (...
详细信息
Group communication in large-scale interactive applications such as real-time conferencing and collaboration, networked virtual environments (e.g. massively multi-player games) requires efficient, low-overhead group c...
详细信息
ISBN:
(纸本)0769522327
Group communication in large-scale interactive applications such as real-time conferencing and collaboration, networked virtual environments (e.g. massively multi-player games) requires efficient, low-overhead group communication mechanisms. In this paper we consider the application-level (or end-system) multicast and propose a stateless group communication mechanism together with its tree building algorithms. Stateless multicast reduces the control signaling of dynamic multicast groups linearly with the group size. To support interactive applications involving a large number of dynamic multicast groups, the application level multicast uses stateless forwarding within clusters of network nodes and hierarchical aggregation of multicast group membership. We show that dynamic tree construction achieve low computation overhead with a controlled degradation of the end-to-end data path performance.
Continuous numeric prediction techniques known as model trees which build decision trees and then use linear regression at the terminal nodes are used to characterize resource consumption in a computer system. An adva...
详细信息
ISBN:
(纸本)1581139896
Continuous numeric prediction techniques known as model trees which build decision trees and then use linear regression at the terminal nodes are used to characterize resource consumption in a computer system. An advantage of model trees over time series and other traditional statistical models is the ability to add background knowledge to the model. Models are built using production data from several banks in collaboration with domain experts at those institutions. A demonstration of improving the models by adding background expert knowledge is given. An example of using model predictions to allow adaptive elements of an operating system to become more self-managing with respect to memory usage is also presented. Comparisons with other predictive techniques are made and advantages and disadvantages of using this technique in the operating system are discussed.
Ubiquitous computing places humans in the center of environments saturated with computing and wireless communications capabilities, yet gracefully integrated, so that technology recedes in the background of everyday a...
ISBN:
(纸本)9781581138122
Ubiquitous computing places humans in the center of environments saturated with computing and wireless communications capabilities, yet gracefully integrated, so that technology recedes in the background of everyday activities. The ubiquitous computing world then, is a world largely defined by applications. But such applications present an altogether new set of requirements. The special track on ubiquitous computing applications, first introduced in acm SAC 2004, provides a forum for the discussion of all types of ubiquitous computing applications and related specialized infrastructures built for the deployment of targeted applications. Individual papers place applications within their use context and introduce novel and appropriate interaction paradigms while at the same time addressing related technical and business aspects and consequently identify novel opportunities or constraints.
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each customer has a particular demand of servi...
详细信息
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each customer has a particular demand of service and the behavior of the customers is determined by utility functions that are non-increasing in the congestion. Customers decide whether to join or leave the service based on the experienced congestion and the offered prices. Following standard game theory, we assume each customer behaves in the most rational way. If the prices of service are fixed, then such a customer behavior leads to a pure, not necessarily unique Nash equilibrium among the customers. In order to evaluate marketing strategies, the service provider is interested in estimating its revenue under the best and worst customer equilibria. We study the complexity of this problem under different models of information available to the provider. We first consider the classical model in which the provider has perfect knowledge of the behavior of all customers. We present a complete characterization of the complexity of computing optimal pricing strategies and of computing best and worst equilibria. Basically, we show that most of these problems are inapproximable in the worst case but admit an "average-case FPAS." Our average case analysis covers general distributions for customer demands and utility thresholds. We generalize our analysis to robust equilibria in which players change their strategies only when this promises a significant utility improvement. We extend our analysis to a more realistic model in which the provider has incomplete information. Following the game theoretic framework of Bayesian games introduced by Harsanyi, we assume that the provider is aware of probability distributions describing the behavior of the customers and aims at estimating its expected revenue under best and worst equilibria. Somewhat counterintuitive, we obtain an FPRAS for the equilibria problem in th
As a consequence of the increasing role of computers throughout society, computers, especially mobile devices, are used in diverse situations. Additionally, the computing environment is becoming more changeable. A net...
详细信息
ISBN:
(纸本)3540234233
As a consequence of the increasing role of computers throughout society, computers, especially mobile devices, are used in diverse situations. Additionally, the computing environment is becoming more changeable. A network application coordinating mobile devices needs to be able to adapt to changes in the environments. In this paper, we propose a new architecture for mobile computing, which uses a mobile agent technology and adapts to changes flexibly. The framework splits the specification of an application into network environments, coordination logic and patterns. Patterns are applied to the coordination logic in order to derive appropriate behaviors automatically.
暂无评论