A Real Trading Model based Price Negotiation Agents
Sim proposed a market-driven negotiation agent model that makes adjustable amounts of concession by reacting to different market situations and trading constraints, and it was improved with an enhanced market-driven strategy by taking opponent eagerness into consideration. In both Sim's original model and improved model, however, it was implied that a negotiation agent has same behaviors and actions to all trading partners referring to a same trading issue. It is not quite true in a real world trading negotiation. Based on both models, this paper proposes a real trading model based price negotiation agents that take each trading partner as an individual with different strategies and actions. Moreover, negotiation actions between a negotiation agent and a trading partner are kept in secret and unknown to others

title: A user-friendly platform for developing and accessing grid services
abstract: This article presents an enhanced platform that provides a friendly environment of developing grid services and accessing grid services over Globus Toolkit 3 (GT3). This platform includes a class of functions for processing parameters input from a developer via GUI, a class of functions for generating files required for defining a grid service specified, and a class of functions for creating client program and facilitating accesses of the deployed services. As a result, the development and access of grid services requires less special expert knowledge of a developer at the server side and users at the client side, the efficiency of developing and accessing grid services can be improved. This paper describes our design ideas, necessary functions, and implementations. The comparisons with other related toolkits are given and the extended version of the platform on top of the web service environment rather than GT3.

title: A Dangerous Location Aware System for Assisting Kids Safety Care
abstract: This system focuses on a location-aware computing application and environment which provide preemptive information on dangerous locations in the kid's surroundings; i.e., the system alerts a kid on the move of the possible dangers whenever he/she is near accident prone areas. Using satellite-based GPS position sensing, this system can gradually learn and remember about the different locations that a kid routinely visits and/or passes by in his daily life, based on space-oriented contexts. The full set of system functionalities, including the map display, requires a graphical user interface. This location based services (LBSs) can compute the serious situations and alert kids to avoid dangerous situations. Our research can simulate the virtual environment as hyperspaces for kids safety care

title: Fast interval-valued statistical modeling of interconnect and effective capacitance
abstract: Correlated interval representations of range uncertainty offer an attractive solution to approximating computations on statistical quantities. The key idea is to use finite intervals to approximate the essential mass of a probability density function (pdf) as it moves through numerical operators; the resulting compact interval-valued solution can be easily interpreted as a statistical distribution and efficiently sampled. This paper first describes improved interval-valued algorithms for asymptotic wave evaluation (AWE)/passive reduced-order interconnect macromodeling algorithm (PRIMA) model order reduction for tree-structured interconnect circuits with correlated resistance, inductance, and capacitance (RLC) parameter variations. By moving to a much faster interval-valued linear solver based on path-tracing ideas, and making more optimal tradeoffs between interval- and scalar-valued computations, the delay statistics roughly 10/spl times/ faster than classical Monte Carlo (MC) simulation, with accuracy to within 5% can be extracted. This improved interval analysis strategy is further applied in order to build statistical effective capacitance (C/sub eff/) models for variational interconnect, and show how to extract statistics of C/sub eff/ over 100/spl times/ faster than classical MC simulation, with errors less than 4%.

title: Asymptotic convergence properties of the EM algorithm with respect to the overlap in the mixture
abstract: The EM algorithm is generally considered as a linearly convergent algorithm. However, many empirical results show that it can converge significantly faster than those gradient based first-order iterative algorithms, especially when the overlap of densities in a mixture is small. This paper explores this issue theoretically on mixtures of densities from a class of exponential families. We have proved that as an average overlap measure of densities in the mixture tends to zero, the asymptotic convergence rate of the EM algorithm locally around the true solution is a higher order infinitesimal than a positive order power of this overlap measure. Thus, the large sample local convergence rate for the EM algorithm tends to be asymptotically superlinear when the overlap of densities in the mixture tends to zero. Moreover, this result has been detailed on Gaussian mixtures.

title: The asymptotic memory capacity of the generalized Hopfield network
abstract: This paper presents a theoretical analysis on the asymptotic memory capacity of the generalized Hopfield network. The perceptron learning scheme is proposed to store sample patterns as the stable states in a generalized Hopfield network. We have obtained that (n-1) and 2n are a lower and an upper bound of the asymptotic memory capacity of the network of n neurons, respectively, which shows that the generalized Hopfield network can store the larger number of sample patterns than Hopfield network.

title: Unexpected means of protocol inference
abstract: Network managers are inevitably called upon to associate network traffic with particular applications. Indeed, this operation is critical for a wide range of management functions ranging from debugging and security to analytics and policy support. Traditionally, managers have relied on application adherence to a well established global port mapping: Web traffic on port 80, mail traffic on port 25 and so on. However, a range of factors - including firewall port blocking, tunneling, dynamic port allocation, and a bloom of new distributed applications - has weakened the value of this approach. We analyze three alternative mechanisms using statistical and structural content models for automatically identifying traffic that uses the same application-layer protocol, relying solely on flow content. In this manner, known applications may be identified regardless of port number, while traffic from one unknown application will be identified as distinct from another. We evaluate each mechanism's classification performance using real-world traffic traces from multiple sites.

title: TOMSCOP - a synchronous P2P collaboration platform over JXTA
abstract: We focus on design and implementation of a synchronous P2P (peer-to-peer) collaboration platform called TOMSCOP (Technology Of Multiuser Synchronous Collaboration Platform). Based on the elementary peer group services offered by the JXTA general framework, TOMSCOP provides the extra four types of services: synchronous message transportation, peer room administration, peer communication support and application space management. By using the four services, different kinds of shared applications for various specific purposes can be relatively easily developed and associated collaborative cyber spaces or communities can be quickly built across the JXTA virtual network overlaid on top of the existing physical networks.