Publications Copyright (c) 2013 Southern Illinois University Carbondale All rights reserved. http://opensiuc.lib.siu.edu/cs_pubs Recent documents in Publications en-us Sat, 26 Jan 2013 22:23:32 PST 3600 Network Intrusion Detection Types and Computation http://opensiuc.lib.siu.edu/cs_pubs/36 http://opensiuc.lib.siu.edu/cs_pubs/36 Tue, 25 Sep 2012 12:15:19 PDT Our research created a network Intrusion Detection Math (ID Math) consisting of two components: (1) a way of specifying intrusion detection types in a manner which is more suitable for an analytical environment; and (2) a computational model which describes methodology for preparing intrusion detection data stepwise from network packets to data structures in a way which is appropriate for sophisticated analytical methods such as statistics, data mining, and computational intelligence. We used ID Math in a production Self-Organizing Map (SOM) intrusion detection system named ANNaBell as well as in the SOM+ Diagnostic System which we developed.

]]> Purvag Patel et al. Design of High Performance Distributed Snapshot/Recovery Algorithms for Ring Networks http://opensiuc.lib.siu.edu/cs_pubs/35 http://opensiuc.lib.siu.edu/cs_pubs/35 Tue, 21 Sep 2010 13:54:51 PDT In this work, we have presented non-blocking checkpointing and recovery algorithms for bidirectional networks. We have deviated from the conventional approach of taking first temporary checkpoints and then converting them to permanent ones by processes (as followed by any coordinated checkpointing scheme). Thus, the proposed coordinated checkpointing algorithm allows processes to take permanent checkpoints directly without taking temporary checkpoints and whenever a process is busy, it takes a checkpoint after completing its current procedure. We have shown that the presented algorithms take much less time for their execution and use much less number of control messages (and hence much less number of interrupts to a process) when compared to a noted recent work [4].

]]> Bidyut Gupta et al. A Novel Low-Overhead Recovery Approach for Distributed Systems http://opensiuc.lib.siu.edu/cs_pubs/34 http://opensiuc.lib.siu.edu/cs_pubs/34 Tue, 21 Sep 2010 13:35:24 PDT We have addressed the complex problem of recovery for concurrent failures in distributed computing environment. We have proposed a new approach in which we have effectively dealt with both orphan and lost messages. The proposed checkpointing and recovery approaches enable each process to restart from its recent checkpoint and hence guarantee the least amount of recomputation after recovery. It also means that a process needs to save only its recent local checkpoint. In this regard, we have introduced two new ideas. First, the proposed value of the common checkpointing interval is such that it enables an initiator process to log the minimum number of messages sent by each application process. Second, the determination of the lost messages is always done a priori by an initiator process; besides it is done while the normal distributed application is running. This is quite meaningful because it does not delay the recovery approach in any way.

]]> B. Gupta et al. An Intelligence Representation in Agent Systems: An Extended π-Calculus http://opensiuc.lib.siu.edu/cs_pubs/33 http://opensiuc.lib.siu.edu/cs_pubs/33 Tue, 21 Sep 2010 13:04:24 PDT Intelligent mobile agent technology is one of the most promising of the newer software paradigms for providing solutions to complex, distributed computing problems. Agent properties of autonomy, intelligence and mobility provide a powerful platform for implementations that can utilize techniques involving collaborative problem solving and adaptive behavior. Although the technological tools and capabilities have advanced to this point, research into formal models and extensions to support representations of this new computing paradigm has not been kept pace. Specifically, we find that current formal processing models are lacking in representation abilities for: (1) intelligence capabilities, (2) team-based problem-solving approaches, and (3) mobility. In this paper, we present an extension of π-calculus that addresses the first of these deficiencies, the representation of intelligence.

]]> Shahram Rahimi et al. Fuzzy Spatial Querying with Inexact Inference http://opensiuc.lib.siu.edu/cs_pubs/32 http://opensiuc.lib.siu.edu/cs_pubs/32 Tue, 21 Sep 2010 12:48:58 PDT The issue of spatial querying accuracy has been viewed as critical to the successful implementation and long-term viability of the GIS technology. In order to improve the spatial querying accuracy and quality, the problems associated with the areas of fuzziness and uncertainty are of great concern in the spatial database community. There has been a strong demand to provide approaches that deal with inaccuracy and uncertainty in GIS. In this paper, we are dedicated to develop an approach that can perform fuzzy spatial querying under uncertainty. An inexact inferring strategy is investigated. The study shows that the fuzzy set and the certainty factor can work together to deal with spatial querying. Querying examples implemented by FuzzyClips are also provided.

]]> Huiqing Yang et al. An Inexact Inferencing Strategy for Spatial Objects with Determined and Indeterminate Boundaries http://opensiuc.lib.siu.edu/cs_pubs/31 http://opensiuc.lib.siu.edu/cs_pubs/31 Tue, 21 Sep 2010 11:49:40 PDT For many years, spatial querying has been of interest for the researchers in the GIS community. Any successful implementation and long-term viability of the GIS technology depends on the issue of accuracy of spatial queries. In order to improve the accuracy and quality of spatial querying, the problems associated with the areas of fuzziness and uncertainty need to be addressed. There has been a strong demand to provide approaches that deal with inaccuracy and uncertainty in GIS. In this paper, we develop an approach that can perform fuzzy spatial querying under uncertainty. An inexact inferencing strategy for objects with determined and indeterminate boundaries is investigated, using type-2 fuzzy set theory.

]]> Shahram Rahimi et al. ABSA: An Agent-Based Tool for System Administration http://opensiuc.lib.siu.edu/cs_pubs/30 http://opensiuc.lib.siu.edu/cs_pubs/30 Tue, 21 Sep 2010 11:39:00 PDT Studies indicate that because of the difficulty and complexity, the cost of administering systems is ten times the cost of the actual hardware. ABSA is an agent-based solution to automated system administration. ABSA architecture is introduced to minimize the cost of administering computers in multi-platform networks and to provide a simple, consistent, expandable, and integrated system administration tool.

]]> Santosh Ramakrishna et al. MPIAB: A Novel Agent Architecture for Parallel Processing http://opensiuc.lib.siu.edu/cs_pubs/29 http://opensiuc.lib.siu.edu/cs_pubs/29 Tue, 21 Sep 2010 11:30:33 PDT This paper presents MPIAB, an agent based architecture for parallel processing. The architecture is developed to model the functions of standard MPI using Java agents. It remedies the deficiencies that exist in MPI, including the incapability to operate in heterogeneous environments. The architecture also addresses other issues such as effective utilization of system resources by dynamically selecting the least busy computing nodes through the computation of a threshold barrier value. Our proposed agent architecture would integrate the power of Java technology and agents to support efficient communication and synchronization of the nodes over the network for parallel processing.

]]> Shahram Rahimi et al. Preliminary Performance Evaluation of an Agent-Based Geospatial Data Conflation System http://opensiuc.lib.siu.edu/cs_pubs/28 http://opensiuc.lib.siu.edu/cs_pubs/28 Tue, 21 Sep 2010 11:21:13 PDT A rapid growth of available geospatial data requires development of systems capable of autonomous data retrieval, integration and validation. Mobile agent technology may provide a suitable framework for developing such systems since this technology can deal, in a natural way, with the distributed heterogeneous nature of the data. We evaluate our novel multi-agent architecture for geospatial data integration and compare its performance with a client/server and a single-agent architecture. We analyze the performance alteration for various numbers of participating nodes, amount of database accesses, processing loads, and network loads.

]]> Shahram Rahimi et al. A Combined Crisp and Fuzzy Approach for Handwriting Analysis http://opensiuc.lib.siu.edu/cs_pubs/27 http://opensiuc.lib.siu.edu/cs_pubs/27 Tue, 21 Sep 2010 07:06:37 PDT This paper presents an off-line writer-independent handwriting analysis system which utilizes both classical crisp and fuzzy methodologies to output possible personality traits of the writer. The design deploys an analytical handwriting analysis approach based on two primitives, the baseline and the slant angle of the characters. The objective of the design strategy is to present a group of parameters for handwriting analysis based on the text. These parameters allow for the classification of writing into different categories which could be used as a preliminary step for outputting the personality traits of the writer. Two parameters, the baseline and the slant-angle, are the inputs to a rule-base which outputs the personality trait category. The evaluation of the baseline is non-fuzzy (crisp) whereas the evaluation of the slant-angle utilizes the fuzzy paradigm.

The approach is based on a combination of classical geometric arithmetic evaluation and fuzzy control designs. For determination of the base line angle two methodologies are explored: the geometric-features based segmentation method and a method based on biologically inspired generation theories or the low pass filtering method. We utilize the geometric features evaluation for the baseline extraction since it proves more robust with respect to the variations of the handwriting in an off-line environment.

For determination of the slant type a fuzzy technique is adopted to determine the contributions of the slant-type angle to each of the five variations of the slant-type categories. The uncertainties in the system model are expressed by fuzzy-valued model parameters with their membership functions derived from experimental data. In total five variations of slant type are considered. These include extreme left, controlled left, vertical, controlled right and extreme right.

Fifteen personality traits PT1 - PT15 were identified and sets of rules formulation were created, (e.g., If Input1 is "level" and "Input2" is "Controlled Left" then Output is PTx.)

The proposed approach takes advantage of two differing methodologies that have clear outputs to evaluate two attributes of handwriting. The outputs are utilized to determine a personality trait. The system can be further enhanced by including more parameters such as size of letters, spacing between letters and other attributes of handwriting as part of the inputs for trait determination.

]]> N. Mogharreban et al. A Parallel Fuzzy C-Mean algorithm for Image Segmentation http://opensiuc.lib.siu.edu/cs_pubs/26 http://opensiuc.lib.siu.edu/cs_pubs/26 Tue, 21 Sep 2010 06:35:16 PDT This paper proposes a parallel Fuzzy C-Mean (FCM) algorithm for image segmentation. The sequential FCM algorithm is computationally intensive and has significant memory requirements. For many applications such as medical image segmentation and geographical image analysis that deal with large size images, sequential FCM is very slow. In our parallel FCM algorithm, dividing the computations among the processors and minimizing the need for accessing secondary storage, enhance the performance and efficiency of image segmentation task as compared to the sequential algorithm. such as medical image segmentation and geographical image analysis that deal with large size images, sequenrial FCM is very slow. In our parallel FCM algorithm, dividing the computations among the processors and minimizing the need for accessing secondary storage, enhance the performance and efficiency of image segmentation task as compared to the sequential algorithm

]]> Shahram Rahimi et al. A Directed FCM Approach for Analysis of Stained Tissues http://opensiuc.lib.siu.edu/cs_pubs/25 http://opensiuc.lib.siu.edu/cs_pubs/25 Tue, 21 Sep 2010 06:12:14 PDT The use of digital imagery has increased phenomenally especially in the clinical field. These images are obtained from different modalities such as X-ray and MRI. Digital imaging of the more traditional imagery such as stained tissues has opened up new means of investigation. Hence a need to build a system to analyze the stained tissues and extract the salient information has risen. A Directed FCM Approach for Analysis of Stained Tissues introduces a modified FCM to analyze the tissues. The analysis can be controlled by the user by selecting the number of clusters, size of the clusters and the centers for the clusters. The results of this analysis are reported as the percent of changes in a specific square area.

]]> Shahram Rahimi et al. A Perception Based, Domain Specific Expert System for Question-Answering Support http://opensiuc.lib.siu.edu/cs_pubs/24 http://opensiuc.lib.siu.edu/cs_pubs/24 Tue, 21 Sep 2010 05:59:24 PDT The ability to search has become an integral part of our interaction with technology. However, the current search technologies mostly use a keyword based searching mechanism, which does not have any deductive abilities. The recent introduction of the idea of Computing with Words, which can give deduction abilities to existing technologies, provides a new base for developing frameworks. This paper proposes implementation of a domain specific Fuzzy Expert System based on a question-answer system, which employs Computing with Words. In order to perform the translation of natural language sentences into a standard format, Probabilistic Context-Free Grammar is used.

]]> Raheel Ahmad et al. A Modified Competitive Agglomeration for Relational Data Algorithm http://opensiuc.lib.siu.edu/cs_pubs/23 http://opensiuc.lib.siu.edu/cs_pubs/23 Mon, 20 Sep 2010 12:32:42 PDT Clustering algorithms are invaluable methods for organizing data into useful information. The CARD Algorithm [11 is one such algorithm that is designed to organize user sessions into profiles, where each profile would highlight a particular type of user. The CARD algorithm is a viable candidate for web clustering. However it does have limitations such as long execution time. In addition, the data preparation for the algorithm's requirements employs concepts that are incomplete. These limitations of the algorithm will be explored and modified to yield a more practical and efficient algorithm.

]]> Lisa Gandy et al. A Multi-Agent Architecture for Distributed Domain-Specific Information Integration http://opensiuc.lib.siu.edu/cs_pubs/22 http://opensiuc.lib.siu.edu/cs_pubs/22 Mon, 20 Sep 2010 12:17:41 PDT On both the public Internet and private Intranets, there is a vast amount of data available that is owned and maintained by different organizations, distributed all around the world. These data resources are rich and recent; however, information gathering and knowledge discovery from them, in a particular knowledge domain, confronts major difficulties. The objective of this article is to introduce an autonomous methodology to provide for domain-specific information gathering and integration from multiple distributed sources.

]]> Shahram Rahimi et al. Extracting Web User Profiles Using a Modified CARD Algorithm http://opensiuc.lib.siu.edu/cs_pubs/21 http://opensiuc.lib.siu.edu/cs_pubs/21 Mon, 20 Sep 2010 12:05:17 PDT Clustering algorithms are widely used methods for organizing data into useful information. The Competitive Agglomeration for Relational Data (CARD) Algorithm is one such clustering algorithm that is designed to organize user sessions into profiles, where each profile would highlight a particular type of user. The CARD algorithm is a viable candidate for web clustering; however, it does have limitations such as an extended execution time. In addition, the methods that prepare the input data for the CARD algorithm’s use employs concepts which seem to be incomplete. These limitations of the CARD algorithm are explored and modifications are introduced to yield a more practical and efficient algorithm.

]]> Shahram Rahimi et al. TrAgent: A Multi-Agent System for Stock Exchange http://opensiuc.lib.siu.edu/cs_pubs/20 http://opensiuc.lib.siu.edu/cs_pubs/20 Mon, 20 Sep 2010 11:54:24 PDT TrAgent is a software-agent based model for a stock exchange such as the New York Stock Exchange and the procedure of trading securities on the trading floor. The model comprises the complete process from the initiation of a trading order until its execution. The software agent paradigm is the framework for implementing the proposed model. The properties of intelligent software agents meet the characteristics of the actors on the trading floor and provide capabilities for efficient distributed computing. Because of the space restriction, the main focus of this paper is on stock broker agent, one of the most important agents in TrAgent. Intelligence is provided to the stock broker agent in order to make reasoning and decisions on the profitability of a firm. This intelligence is provided using Fuzzy Expert System. The paper further discusses the design and development issues concerning different components of the model.

]]> Raju Tatikunta et al. A Perception Based, Domain Specific Expert System for Question-Answering Support http://opensiuc.lib.siu.edu/cs_pubs/19 http://opensiuc.lib.siu.edu/cs_pubs/19 Mon, 20 Sep 2010 11:27:18 PDT The current search engine technologies mostly use a keyword based searching mechanism, which does not have any deductive abilities. There is an urgent need for a more intelligent question-answering system that will provide a more intuitive, natural language interface, and more accurate and direct search results. The introduction of Computing with Words (CwW) provides a new theoretical base for developing frameworks with support for dealing with information in natural language. This paper proposes a domain specific question-answering system based on Fuzzy Expert Systems using CwW. In order to perform the translation of natural language based information into a standard format for use with CwW, Probabilistic Context-Free Grammar is used.

]]> Raheel Ahmad et al. An Intelligence-Aware Process Calculus for Multi-Agent System Modeling http://opensiuc.lib.siu.edu/cs_pubs/18 http://opensiuc.lib.siu.edu/cs_pubs/18 Mon, 20 Sep 2010 11:18:49 PDT In this paper we propose an agent modeling language named CAML that provides a comprehensive framework for representing all relevant aspects of a multi-agent system: specially, its configuration and the reasoning abilities of its constituent agents. The configuration modeling aspect of the language supports natural grouping and mobility, and the reasoning framework is inspired by an extension of the popular BDI theory of modeling cognitive skills of agents. We present the motivation behind the development of the language, its syntax, and an informal semantics.

]]> Raheel Ahmad et al. A Multi-Agent Based Approach for Particle Swarm Optimization http://opensiuc.lib.siu.edu/cs_pubs/17 http://opensiuc.lib.siu.edu/cs_pubs/17 Mon, 20 Sep 2010 11:02:17 PDT We propose a new approach towards Particle Swarm Optimization named Agent-based PSO. The swarm is elevated to the status of a multi-agent system by giving the particles more autonomy, an asynchronous execution, and superior learning capabilities. The problem space is modeled as an environment which forms clusters of points that are known to be non-optimal and this transforms the environment into a more dynamic and informative resource.

]]> Raheel Ahmad et al.