Suppose some autonomous shopbot agents had been representing us by dealing with a vendor's pricebot, and suppose they didn't share an agent communication language (ACL). What should they know at a fundamental ...
详细信息
Suppose some autonomous shopbot agents had been representing us by dealing with a vendor's pricebot, and suppose they didn't share an agent communication language (ACL). What should they know at a fundamental level, what could each point to, and how could they establish a common language? Recent research at the University of Texas at Arlington has shown that agents first establish a common vocabulary, progress to a primitive language similar to human pidgin, then enrich the language's grammar to develop a creole, and eventually arrive at a full-blown ACL. During this process, the vocabulary and grammatical structures most important to the agents' task at hand appear first. Thus, shopbots and pricebots will first learn to communicate about various types of goods and money, while softbots that deal with, say, stock market investing will likely develop a different language. However, we must make some assumptions about the agents. First, the agents must be knowledge based. Second, the agents must be purposeful, with well-defined goals, that is, precise descriptions of the states of the world they are to bring about. Third, the agents must be rational. This means they act so as to further their goals, given what they know
In spite of current practices and thoughts, the grid and P2P models share several features and have more in common than we perhaps generally recognize. A synergy between the two research communities, and the two comp...
详细信息
In spite of current practices and thoughts, the grid and P2P models share several features and have more in common than we perhaps generally recognize. A synergy between the two research communities, and the two computing models, could start with identifying the similarities and differences between them. Developers and users could exploit the many contact points between P2P and grid networks by recognizing P2P's relevance to corporations and public organizations rather than viewing it as just a home computing technology. They also could exploit P2P protocols and models to face grid-computing issues such as scalability, connectivity, and resource discovery.
Interval routing is a space-efficient method for point-to-point networks. For a survey of interval routing, one can refer to [C. Gavoille, A survey on interval routing, Theoret. Comput. Sci. 245 (2) (2000) 217-253 [1]...
详细信息
Interval routing is a space-efficient method for point-to-point networks. For a survey of interval routing, one can refer to [C. Gavoille, A survey on interval routing, Theoret. Comput. Sci. 245 (2) (2000) 217-253 [1]]. The network in question is an undirected connected graph, G = (V, E), where V is the set of nodes, and E the set of the edges. G has n nodes and diameter D. In this paper, we will focus on the dilation analysis. In [S.S.H. Tse, F.C.M. Lau, An optimal lower bound for interval routing in general networks, in: Proc. 4th Internal. Colloquium on Structural Information and Communication Complexity (SIROCCO'97), 1997, pp. 112-124], by using one label, we have a lower bound of 2D-3, where D >= 8. In [C. Gavoille, On dilation of interval routing, Comput. J. 43 (1) (2000) 1-7 [7]], by using O(n/Dlog(n/D)) labels, the best known lower bound is [3/2D]- 1, where D >= 2. In this paper, we modify the technique used in [S.S.H. Tse, F.C.M. Lau, Two lower bounds for multi label interval routing, in: Proc. computing: The Australasian Theory Symposium (CATS'97), 1997, pp. 36-43] and contribute with a better lower bound 3/2 D by using O(log n) labels, where D >=, 2 and even. (c) 2005 Elsevier B.V. All rights reserved.
It is shown that probabilistic data association yields biased tracks in a multitarget environment, and the magnitude of the bias is investigated. A critical target separation distance exists, within which the tracks t...
详细信息
It is shown that probabilistic data association yields biased tracks in a multitarget environment, and the magnitude of the bias is investigated. A critical target separation distance exists, within which the tracks tend to coalesce completely. The problem of track initiation on new targets is also discussed.
Filtering problems with kinematic constraints which may arise in target tracking problems are considered. A novel approach which treats kinematic constraints as additional fictitious or pseudomeasurements is proposed....
详细信息
Filtering problems with kinematic constraints which may arise in target tracking problems are considered. A novel approach which treats kinematic constraints as additional fictitious or pseudomeasurements is proposed. A numerical example is provided to show the technical feasibility of the proposed idea for target tracking problems. This example shows that the proposed method can improve estimation accuracy significantly for velocity and acceleration states in the tracking problem. However, it is noted that the tracking performance may be deteriorated if the constraints do not properly represent the target characteristics and a small R/sub c/ is chosen.< >
The boundary element method (BEM) is one of the numerical methods for solving the boundary value problems under the integral scheme equivalent to the partial differential representation. In this paper we investigate t...
详细信息
The boundary element method (BEM) is one of the numerical methods for solving the boundary value problems under the integral scheme equivalent to the partial differential representation. In this paper we investigate the fundamental nature of the discretization errors inherent to the BEM. Numerical experiments conducted using new configuration models reveal: 1. The usual stepwise solution represents a very good approximation of the true solution sampled at regular intervals rather than the average value over each element. 2. The discretization errors thus evaluated against the sampled values show similar characteristics to those of the piecewise polynomial approximation in the numerical quadratures.
Charge collection transients following a strike by an ionizing particle are computed for a multilayer N+PNN+ device at two different bias points. The results are consistent with experimental observations. Details of t...
详细信息
Charge collection transients following a strike by an ionizing particle are computed for a multilayer N+PNN+ device at two different bias points. The results are consistent with experimental observations. Details of the current paths within the device are also shown and indicate that field funneling concepts do not directly apply to this structure.
Current coil are decomposed in straight segments of rectangular cross section, whose sides are trapezoidal in general. For curved coil portions, an appropriate number of straight segments are considered in terms of th...
详细信息
Current coil are decomposed in straight segments of rectangular cross section, whose sides are trapezoidal in general. For curved coil portions, an appropriate number of straight segments are considered in terms of the desired accuracy. Simple formulas are derived for the contribution of such a coil segment to the resultant magnetic field by modeling the given volume current density in terms of a distribution of fictitious magnetization inside the segment volume and corresponding surface currents and magnetic charges. The expressions obtained contain only elementary functions, and computed results illustrate their efficiency with respect to existing analytical and numerical integration methods.
Sense of direction is a property of the labelling of (possibly anonymous) networks which allows to assign coherently local identifiers to other processors on the basis of the route followed by incoming messages. A gra...
详细信息
Sense of direction is a property of the labelling of (possibly anonymous) networks which allows to assign coherently local identifiers to other processors on the basis of the route followed by incoming messages. A graph has minimal sense of direction whenever it has sense of direction and the number of colours equals its maximum outdegree, We prove that an outregular digraph with minimal weak sense of direction is a Cayley colour graph (in the general sense, i.e., we do not require connectedness). Since Cayley colour graphs are known to possess minimal transitive sense of direction, we obtain a characterization of outregular graphs with minimal (weak, transitive) sense of direction. As a consequence, deciding whether a coloured graph is a Cayley colour graph reduces to deciding whether it has weak sense of direction, which can be done in AC(1). (C) 1997 Elsevier Science B.V.
暂无评论