Volume 2, Number 3, December 2004


Computing and Information Sciences is a peer reviewed journal that is committed to timely publication of original research, surveying and tutorial contributions on the analysis and development of computing and information science. The journal is designed mainly to serve researchers and developers, dealing with information and computing. Papers that can provide both theoretical analysis, along with carefully designed computational experiments, are particularly welcome. The journal is published 2-3 times per year with distribution to librarians, universities, research centers, researchers in computing, mathematics, and information science. The journal maintains strict refereeing procedures through its editorial policies in order to publish papers of only the highest quality. The refereeing is done by anonymous Reviewers. Often, reviews take four months to six months to obtain, occasionally longer, and it takes an additional several months for the publication process.

Paper 1: The Multimedia Approach in Visualizing Engineering Concept

The Multimedia Approach in Visualizing Engineering Concept

Manjit Singh Sidhu, Ramesh Singh, and Selvanathan Narainasamy

Abstract: Various levels of interaction in a multimedia development tool for a tutorial topic on Structural Analysis in the engineering mechanics statics course were examined. This study look at how interactive multimedia could be employed to support learners as well as to enhance their understanding and visualization of specific engineering concept. In addition, various design aspects and pertinent issues that were considered during the multimedia development process are discussed. Preliminary evaluation of the prototype tool that was conducted on a group of students taking the course revealed that multimedia technology provided an effective platform to enhance learning and understanding of the subject matter where engineering concepts are presented dynamically through multimedia animations.



Paper 2: A Novel Algorithm to Compute all Vertex Matrices of an Interval Matrix ...

A Novel Algorithm to Compute all Vertex Matrices of an Interval Matrix: A Computational Approach

Mohammed Tawfik Hussein

Abstract: In this paper an algorithm was developed and implemented to obtain all possible vertex matrices for nxn interval matrix. Given a matrix  A in Rnxn with entries aij in [aijL , aijH] Ì R  for   i.j=1,… ,n. The uncertain parameters generate an infinite family of nxn matrices. From the above matrix let's generate all of the vertex matrices, by allowing each uncertain entry of A to vary over the entire interval. The problem treated in this research is of considerable practical significance. Illustrative examples are given to validate the proposed method..



Paper 3: AdAgen: Adaptive Interface Agent for X-Ray Fracture Detection

AdAgen: Adaptive Interface Agent for X-Ray Fracture Detection

M. Mohamed Syiam, M.Abd El-Aziem, and M. El Menshawy Soliman

Abstract: In this paper we have proposed an adaptive interface agent, called the AdAgen that collaborates with trained agents using neural network to build the software interface agent to detect fractures in long bones. The software agent that provides a semi-intelligent system learns by the "Dialog Customizer "from the user’s interests, goals and general preferences. A major problem with the learning approach is that the agent has to learn from scratch and thus takes some time becoming useful. Secondly, the agent's competence is necessarily limited to the actions it has seen the user perform. When the proposed AdAgen is faced with an unfamiliar situation, the agent consults its peers who may have the necessary experience to help it. Thus the proposed framework can alleviate the mentioned problems. The simulation results have shown how the neural network of the collaborating agents can help maintain the performance for automatic detection of fractures in leg radiograph. 



Paper 4: A Nonparametric Multichart CUSUM Test for Rapid Detection of DOS Attacks ...

A Nonparametric Multichart CUSUM Test for Rapid Detection of DOS Attacks in Computer Netwetwork 

Hongjoong Kim, Boris L. Rozovskii, and Alexander G. Tartakovsky

Abstract: Rapid response, minimal false alarm rate, and the capability to detect a wide spectrum of attacks are the crucial features of intrusion detection systems. In this paper, we develop an efficient nonparametric change-point detection method for the rapid detection of denial of service (DOS) attacks that lead to abrupt changes in network traffic. This method is essentially a multichart cumulative sum (CUSUM) detection procedure that uses a minimum amount of available information on pre-change (legitimate) and post-change (attack) traffic models. The proposed algorithm, having both a manageable computational complexity and certain optimality properties, allows for the quick detection of attacks with a low false alarm rate. The results of Monte Carlo simulations with the use of a network simulator testbed show its high efficiency for detecting typical DOS attacks such as TCP SYN Flooding, UDP Packet Storm, and ICMP Ping of Death attacks.




Prof. Jihad Mohamad Alja'am 
Email: journal.editor.ijcis@gmail.com

The Journal Secretary
Eng. Dana Bandok
Ontario, Canada 
Email: sec.ijcis@gmail.com 


Home Page »