28387556
Perceiving Environments for Intelligent Agents
One of the important characteristics for intelligent agents is to be able to assess their environments in order to decide on the correct action to take. It is always difficult to do so because many factors including uncertain information, knowledge and bounded time will affect intelligent agent to perceive their environments. In this paper, we propose a procedure descriptive framework to perceive the environments for intelligent agents. The process of belief updating in this framework remains to be constantly changing, until the point of decision making is reached. During the dynamic change of beliefs, the intelligent agents will incorporate their knowledge about other agents, and the possible uncertain information they received from their local sensors and other agents.
28540558
A Serving Agent for Integrating Soft Computing and Software Agents
This paper discusses the design and implementation of a serving agent for integrating soft computing and software agents.
45852164
An Agent-Based Hybrid Intelligent System for Financial Investment Planning
Many complex problems including financial investment planning require hybrid intelligent systems that integrate many intelligent techniques including expert systems, fuzzy logic, neural networks, and genetic algorithms. however, hybrid intelligent systems are difficult to develop due to complicated interactions and technique incompatibilities. this paper describes a hybrid intelligent system for financial investment planning that was built from agent points of view. this system currently consists of 13 different agents. the experimental results show that all agents in the system can work cooperatively to provide reasonable investment advice. the system is very flexible and robust. the success of the system indicates that agent technologies can significantly facilitate the construction of hybrid intelligent systems.
83568
Fingerprint Reference Point Detection Based on Local Axial Symmetry
Reference point detection is an important process for fingerprint analysis. In this paper, we propose a novel feature which is named local axial symmetry (LAS) and present an algorithm to calculate reference point of a fingerprint based on this kind of feature. Experimental results demonstrate its feasibility, validity and the ability to detect reference points of all classes of fingerprints including arch-type fingerprints which is difficult to locate a stable reference point with other methods
5113927
An unsupervised segmentation framework for texture image queries
In this paper a novel unsupervised segmentation framework for texture image queries is presented. The proposed framework consists of an unsupervised segmentation method for texture images, and a multi-filter query strategy. By applying the unsupervised segmentation method on each texture image, a set of texture feature parameters for that texture image can be extracted automatically. Based upon these parameters, an effective multi-filter query strategy which allows the users to issue texture-based image queries is developed The test results of the proposed framework on 318 texture images obtained from the MIT VisTex and Brodatz database are presented to show its effectiveness.
2023360
A reliable Web-based system for hurricane analysis and simulation
In this paper, we present our research and development efforts toward a reliable, large-scale, Web-based system for hurricane analysis and simulation. The major contributions of this system lie in the following three aspects: (1) it supports the multidisciplinary research efforts in predicting and simulating the hurricane damages and insured losses; (2) it is a large-scale, distributed, Web-based system, which allows both the professional and general users to conduct computational intensive on-line analysis simultaneously and to share and exchange the information; and (3) database management techniques are employed in our system to manage the huge amount of hurricane-related historical and simulated data.
33375582
Edge coloring of graphs with small average degrees
Let G be a simple graph with average degree d? and maximum degree Δ. It is proved, in this paper that G is not critical if d?≤6 and Δ?8, or d?≤203 and Δ?9. This result generalizes earlier results of Vizing (Metody Diskret. Analiz. 5 (1965) 9), Mel'nikov (Mat. Zametki 7 (1970) 671) and Hind and Zhao (Discrete Math. 190 (1998) 107) and Yan and Zhao (Graphs Combin. 16 (2) (2000) 245). It also improves a result by Fiorini (Math. Proc. Cambridge Philos. Soc. 77 (1975) 475) on the number of edges of critical graphs for certain Δ.