44974850
A Massively Multi-agent System for Discovering HIV-Immune Interaction Dynamics
In MMAS-based biological system simulation, it is a challenging task to deal with numerous interactions among a vast number of autonomous agents. In our work, a hybrid massively multi-agent systems (MMAS) model is developed, and it incorporates the characteristics of cellular automaton (CA) and system-level mathematical equation modeling to simulate HIV-immune interaction dynamics. The mathematical equations are adopted within the site of a two-dimensional lattice. As the average high density, agent interactions can be calculated according to the equations without significantly affecting the performance of the systems studied. In the mean time, the CA model keeps the spatial characteristics of HIV evolution among the sites. The simulation based on the implemented MMAS discovers the dynamics of HIV evolution over different temporal and spatial scales, and reproduces the typical three-stage dynamics of HIV infection.
14178256
Distributed Problem Solving Without Communication - An Examination of Computationally Hard Satisfiability Problems
In this paper, we extend and modify the ERA approach proposed in Ref. 13 to solve Propositional Satisfiability Problems (SATs). The new ERA approach involves a multiagent system where each agent only senses its local environment and applies some self-organizing rules for governing its movements. The environment, which is a two-dimensional cellular environment, records and updates the local values that are computed and affected according to the movements of individual agents. In solving a SAT with the ERA approach, we first divide variables into several groups, and represent each variable group with an agent whose possible positions correspond to the elements in a Cartesian product of variable domains, and then randomly place each agent onto one of its possible positions. Thereafter, the ERA system will keep on dispatching agents to choose their movements until an exact or approximate solution emerges. The experimental results on some benchmark SAT test-sets have shown that the ERA approach can obtain comparable results as well as stable performances for SAT problems. In particular, it can find approximate solutions for SAT problems in only a few steps. The real value of this approach is that it is a distributed asynchronous approach without any centralized control or evaluation, where the agents can cooperate to solve problems without explicit communication.
5692814
Mining associated implication networks: computational intermarket analysis
Current attempts to analyze international financial markets include the use of financial technical analysis and data mining techniques. In this paper, we propose a new approach that incorporates implication networks and association rules to form an associated network structure. The proposed approach explicitly addresses the issue of local vs. global influences between financial markets.
37683026
Web Intelligence (WI)
The 21st century is the age of the Internet and the World Wide Web. The Web revolutionizes the way we gather, process, and use information. At the same time, it also redefines the meanings and processes of business, commerce, marketing, finance, publishing, education, research, development, as well as other aspects of our daily life. The revolution is just beginning. Although individual Web based information systems are constantly being deployed, advanced issues and techniques for developing and for benefiting from Web intelligence still remain to be systematically studied. The article defines a new research field, namely Web Intelligence (WI) by giving a complete picture of WI related topics for systematic study on advanced Web technology and developing Web based intelligent information systems. Roughly speaking, WI exploits AI and advanced information technology on the Web and Internet. It is the key and the most urgent research field of IT for business intelligence.
33842812
Anycast-Based Cooperative Proxy Caching
As one of the most popular applications currently running on the Internet, the World Wide Web is of an exponential growth in size, which results in the network congestion and server overloading. Web caching as an important technique aims at reducing network traffic, server load, and user-perceived retrieval delays by replicating popular contents on proxy caches. In our paper, we develop an anycast-based cooperative web proxy caching mechanism. It puts response time, hop counts, self-organized load balancing, adaption, and self-configuration as primary concerns. In our scheme, anycast is used to bring a server “nearest” to a client to improve overall performance, all proxies in a local network consists an anycast group. The object placement and replacement problems are formulated as an optimization problem and the solution is obtained by using an anycast-based cooperative proxy caching algorithm. Some simulation experiments have been conduced to evaluate the proposed scheme in terms of a wide range of performance metrics. Analytical and experimental results show that our algorithm outperforms some existing algorithms in response time, hop counts.
18067929
Multiagent SAT (MASSAT): Autonomous Pattern Search in Constrained Domains
In this paper, we present an autonomous pattern search approachto solving Satisfiability Problems (SATs). Our approach is essentially a multiagent system. To solve a SAT problem, we first divide variables into groups, and represent each variable group with an agent. Then, we randomly place each agent onto a position in the correspoding local space which is composed of the domains of the variables that are represented by this agent. Thereafter, all agents will autonomously make searchdecisions guided by some reactive rules in their local spaces until a special pattern (i.e., solution) is found or a time step threshold is reached. Experimental results on some benchmark SAT test-sets have shown that by employing the MASSAT approach, we can obtain performances comparable to those of other popular algorithms.
11266138
Proxy cache management for fine-grained scalable video streaming
Caching video objects at proxies close to clients has attracted a lot of attention in recent years. To meet diverse client bandwidth conditions, there have been research efforts to combine proxy caching with video layering or transcoding. Nevertheless, these adaptive systems suffer from either coarse adaptation granularity due to the inflexible structures of existing layered coders or high computation overhead due to the transcoding operations. In this paper, we propose a novel adaptive video caching framework that enables low-cost and fine-grained adaptation. The innovative approach employs the MPEG-4 fine-grained scalable (FGS) video with postencoding rate control. We demonstrate that the proposed framework is both network aware and media adaptive: clients can be of heterogeneous streaming rates, and the backbone bandwidth consumption can be adaptively controlled. We also examine the design and management issues in the framework, in particular, the optimal stream portions to cache and the optimal streaming rate to each client. Simulation results demonstrate that, compared to nonadaptive caching, the proposed framework with optimal cache management not only achieves significant reduction on transmission costs but also enables flexible utility assignment for the heterogeneous clients. Meanwhile, its computational overhead is kept at a low level, implying that it is practically deployable
1037858
Power-Aware Task Motion for Enhancing Dynamic Range of Embedded Systems with Renewable Energy Sources
In this paper we propose a novel scheduling framework for a dynamic real-time environment that experiences power consumption constraints. This framework is capable of dynamically adjusting the voltage/ speed of the system, such that no task in the system misses its deadline and the total energy savings of the system are maximized. 
 
Each task in the system consumes a certain amount of energy, which depends on a speed chosen for execution. The process of selecting speeds for execution while maximizing the energy savings of the system requires the exploration of a large number of combinations, which is too time consuming to be computed on-line. Thus, we propose an integrated heuristic methodology which executes an optimization procedure and an approximate greedy algorithm in a low computation time. This scheme allows the scheduler to handle power-aware real-time tasks with low cost while maximizing the use of the available resources and without jeopardizing the temporal constraints of the system. Simulation results show that our heuristic methodology achieves a performance with near-optimal results.
2139488
Projection method III: Spatial discretization on the staggered grid
In E & Liu (SIAM J Numer. Anal., 1995), we studied convergence and the structure of the error for several projection methods when the spatial variable was kept continuous (we call this the semi-discrete case). In this paper, we address similar questions for the fully discrete case when the spatial variables are discretized using a staggered grid. We prove that the numerical solution in velocity has full accuracy up to the boundary, despite the fact that there are numerical boundary layers present in the semi-discrete solutions.
16580627
Handling Safety-Related Feature Interaction in Safety-Critical Product Lines
The variation management of software product lines is currently handled without adequately taking safety or other system-level properties into account. This is largely due to (1) the fact that the available product-line variation-management techniques lack sufficient support for representing the combined effect of different features, and (2) the existing feature interaction techniques do not suffice for handling one-to-many feature interactions typical of many safety-critical product lines. The challenge is that we need to track the safety-related feature interactions while still promoting reuse. The expected contribution of this work is to demonstrate how safety-related feature interactions can be better investigated and managed by the safety-analysis guided, model-based approach described in this paper.
33033165
Embedding in Benzenoid Hydrocarbons
Using the embedding scheme and a rule we proposed previously, in this work we discuss common eigenvalues and their degeneracies in benzenoid molecular graphs.