21650131
On a web browsing support system with 3d visualization
Existing commercial Web browsers provide various utilities and functions, e.g., Web bookmarks and a browsing history list. Since the bookmark and history functions only the title and URL of the Web page, users who cannot remember the contents of each Web page have difficulty retracing their steps. In this paper, we propose a bookmark system based on a 3D interface. Additionally, our system offers three main functions a 3D browsing history function, a marker function, and a look-ahead loading function. These functions enable users to browse Web pages more effectively.
39290569
Implementing a proxy agent based writable web for a dynamic information sharing system
In this paper, we propose a Web based information sharing system called the Proxy Agent-based Information Sharing(PAIS).We also developed a writable Web mechanism called Web browser-based Direct Editing (Wedit), that is a major component of PAIS. Wedit enables public users to effectively edit HTML text on an existing Web browser. Since Wedit was developed with conventional technologies, users quickly learn how to use it. PAIS is implemented by using Wedit and a proxy agent. PAIS enables users to share information via Web pages using Wedit. The proxy agent maintainsusers' editing data. The agent autonomously sends its user's modification data to other agents in the same community. In PAIS, certain confidential information in the community is not publicly shared by using the proxy agent.
20000085
Toward a Large Scale E-Market: A Greedy and Local Search Based Winner Determination
Combinatorial auction is one of the most popular market mechanisms and it has a huge effect on electronic markets and political strategies. On large scale e-markets, we need a good approximation algorithm for winner determination that is robust for changing the distribution and the number of bids in an auction. We proposed approximate algorithms for combinatorial auctions with massively large number of (more than 100,000) bids. In this paper, we show the robustness of our winner determination algorithms for combinatorial auctions with large number of bids. Experimental results demonstrate that our proposed algorithms are robust on changing the distribution and the number of bids in an auction. Finally, we shortly describe a theoretical limitation about our algorithms that concerns with giving truthfulness of the auction mechanism.
9544952
An Approach to Building Mobile Intelligent Agents Based on Anytime Migration
In this paper, we present an implementation of a Java-based framework for building mobile agents : MiLog (Mobile intelligent agents using Logic programming). MiLog provides logic programming and Java programming for developing intelligent agents since it helps users to effectively construct intelligent mechanisms. We address how to realize an anytime migration mechanism, a HTTP(Hyper Text Transfer Protocol)-based communication mechanism among agents, and web service/access mechanism. Anytime migration enables agents to reactively and autonomously migrate from one computer to another. We present practical applications that have been built on MiLog framework. These applications demonstrate that MiLog is an effective tool for developing practical applications based on mobile intelligent agents.
2241033
Multiple negotiations among agents for a distributed meeting scheduler
We present a method for multi-agent negotiation for implementing a distributed meeting scheduler. In the meeting scheduler, an agent negotiates with other agents about making a public schedule by referring user's private schedules and preferences. We propose a new persuasion method for multi-agent negotiation for reflecting private preferences. We call the method multiple negotiations. In order to reach a consensus effectively, we propose an effective preference revision mechanism based on the multi attribute utility theory. We have implemented a distributed meeting scheduler to show how effectively the multiple negotiations can be used. The result shows that the multiple negotiations are effective in supporting group decision-making for scheduling a meeting.
35506309
Scheduling Meetings with Distributed Local Consistency Reinforcement
13514702
Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size
Assume that each vertex of a graph G is assigned a constant number q of nonnegative integer weights, and that q pairs of nonnegative integers li and ui, 1 ≤i ≤q, are given. One wishes to partition G into connected components by deleting edges from G so that the total i-th weights of all vertices in each component is at least li and at most ui for each index i, 1 ≤i ≤q. The problem of finding such a “uniform” partition is NP-hard for series-parallel graphs, and is strongly NP-hard for general graphs even for q = 1. In this paper we show that the problem and many variants can be solved in pseudo-polynomial time for series-parallel graphs. Our algorithms for series-parallel graphs can be extended for partial k-trees, that is, graphs with bounded tree-width.
6670892
Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
Abstract Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by deleting edges from G so that the total weight of each component is at least l and at most u. Such an “almost uniform” partition is called an ( l , u ) -partition. We deal with three problems to find an ( l , u ) -partition of a given graph; the minimum partition problem is to find an ( l , u ) -partition with the minimum number of components; the maximum partition problem is defined analogously; and the p-partition problem is to find an ( l , u ) -partition with a fixed number p of components. All these problems are NP-complete or NP-hard, respectively, even for series-parallel graphs. In this paper we show that both the minimum partition problem and the maximum partition problem can be solved in time O ( u 4 n ) and the p-partition problem can be solved in time O ( p 2 u 4 n ) for any series-parallel graph with n vertices. The algorithms can be extended for partial k-trees, that is, graphs with bounded tree-width.
204985889
Regular graphs with excess one
Abstract It is shown that there exists no regular graph with excess e =1 and girth 2 r +1⩾5.
40274616
On the spectra of certain distance-regular graphs
Let r be an undirected graph whose vertex-set V(F) is the set (ZJ~ , u2 ,..., v,>. The adjacency matrix of I’ is the n x n matrix A = A(r), over the complex number field, whose entries aij are given by a,j = 1 if vi and vi are adjacent, = 0 otherwise. DEFINITION 1. The spectrum of r is the set of distinct eigenvalues 4l , 4 ,**-> Od of A(F), together with their multiplicities, written m(&), m(4),..., m(0,). Since r is undirected, A is symmetric, and so the Bi are all real numbers. We arrange the Bi in increasing order, namely, 0, < O1 < *.. < e dMany studies have been done on the spectra of graphs by many mathematicians. Some of them may be found, for instance, in Biggs [2].
10045838
Algorithms for finding distance-edge-colorings of graphs
For a bounded integer @?, we wish to color all edges of a graph G so that any two edges within distance @? have different colors. Such a coloring is called a distance-edge-coloring or an @?-edge-coloring of G. The distance-edge-coloring problem is to compute the minimum number of colors required for a distance-edge-coloring of a given graph G. A partial k-tree is a graph with tree-width bounded by a fixed constant k. We first present a polynomial-time exact algorithm to solve the problem for partial k-trees, and then give a polynomial-time 2-approximation algorithm for planar graphs.