Vol. 3, JULY 2009

Internationa Journal of Computer Science and Information Security
Publication July 2009, Volume 3(DOWNLOAD IJCSIS VOL. 3)

Copyright © 2009 IJCSIS. This is an open access journal distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Paper 07060905: Efficient Web Log Mining using Doubly Linked Tree (Publication link)

Dr. R. S. Kasana, and Ratnesh Kumar Jain, Department of Computer Science & Applications,Dr. H. S. Gour, University, Sagar, MP (India)

Dr. Suresh Jain, Department of Computer Engineering, Institute of Engineering & Technology,Devi Ahilya University, Indore, MP (India)

Abstract - World Wide Web is a huge data repository and is growing with the explosive rate of about 1 million pages a day. As the information available on World Wide Web is growing the usage of the web sites is also growing. Web log records each access of the web page and number of entries in the web logs is increasing rapidly. These web logs, when mined properly can provide useful information for decision-making. The designer of the web site, analyst and management executives are interested in extracting this hidden information from web logs for decision making. Web access pattern, which is the frequently used sequence of accesses, is one of the important information that can be mined from the web logs. This information can be used to gather business intelligence to improve sales and advertisement, personalization for a user, to analyze system performance and to improve the web site organization. There exist many techniques to mine access patterns from the web logs. This paper describes the powerful algorithm that mines the web logs efficiently. Proposed algorithm firstly converts the web access data available in a special doubly linked tree. Each access is called an event. This tree keeps the critical mining related information in very compressed form based on the frequent event count. Proposed recursive algorithm uses this tree to efficiently find all access patterns that satisfy user specified criteria. To prove that our algorithm is efficient from the other GSP (Generalized Sequential Pattern) algorithms we have done experimental studies on sample data. 
Keywords: Web mining, Pattern discovery.

Paper 09060912: Authentication Without Identification using Anonymous Credential System (Publication Link)

Dr. A. Damodaram, UGC- ASC, JNTUH, Hyderabad. 
H.Jayasri, ATRI, Hyderabad, India. 

Abstract - Privacy and security are often intertwined. For example, identity theft is rampant because we have become accustomed to authentication by identification. To obtain some service, we provide enough information about our identity for an unscrupulous person to steal it (for example, we give our credit card number to Amazon.com). One of the consequences is that many people avoid e-commerce entirely due to privacy and security concerns. The solution is to perform authentication without identification. In fact, all on-line actions should be as anonymous as possible, for this is the only way to guarantee security for the overall system. A credential system is a system in which users can obtain credentials from organizations and demonstrate possession of these credentials. Such a system is anonymous when transactions carried out by the same user cannot be linked. An anonymous credential system is of significant practical relevance because it is the best means of providing privacy for users.

Keywords: Pseudonyms
Paper 10060913: Modeling reaction-diffusion of molecules on surface and in volume spaces with the E-Cell System (Publication Link)

Satya Nanda Vel Arjunan, Masaru Tomita

Abstract—The E-Cell System is an advanced open-source simulation platform to model and analyze biochemical reaction networks. The present algorithm modules of the system assume that the reacting molecules are all homogeneously distributed in the reaction compartments, which is not the case in some cellular processes. The MinCDE system in Escherichia coli, for example, relies on intricately controlled reaction, diffusion and localization of Min proteins to inhibit cell division at the poles of the rod-shaped cell. We have, therefore, extended the ECell System to model reaction-diffusion and dynamic localization of molecules on surface and in volume compartments. We validated the correctness of our method by modeling the MinCDE system and comparing the results with previous experimental and computational studies. Based on our simulation results, we suggest the function of the Min proteins in the system. 

Keywords—lattice, hexagonal close-packed, systems biology,

Paper 11060914: Recent Applications of Optical Parametric Amplifiers in Hybrid WDM/TDM Local Area Optical Networks (Publication Link)

Abd El Naser A. Mohamed, Mohamed M. E. El-Halawany, Ahmed Nabih Zaki Rashed and Mahmoud M. A. Eid
Electronics and Electrical Communication Engineering Department, Faculty of Electronic Engineering, Menouf 32951, Menoufia University, EGYPT

Abstract - In the present paper, the recent applications of optical parametric amplifiers (OPAs) in hybrid wavelength division multiplexing (WDM)/time division multiplexing (TDM) local area passive optical networks have been modeled and parametrically investigated over wide range of the affecting parameters. Moreover, we have analyzed the ability of the hybrid WDM/TDM Passive optical networks to handle a triple play solution, offering voice, video, and data services to the multiple users. Finally, we have investigated the maximum time division multiplexing (MTDM) bit rates for optical network units (ONUs) for maximum number of supported users with optical parametric amplifier technique across the single mode fiber (SMF) or highly nonlinear fiber (HNLF) cables to achieve both maximum network reach and quality of service (QOS).
Keywords - Passive optical network; time division multiplexing; wavelength division multiplexing; highly nonlinear fiber; optical parametric amplifier; fiber optics.

Paper 12060915: IPv6 and IPv4 Threat reviews with Automatic Tunneling and Configuration Tunneling Considerations Transitional Model:
-A Case Study for University of Mysore Network- (Publication Link) (paper download)

Hanumanthappa.J, Teacher Fellow, Dos in Computer Science, University of Mysore, Manasagangothri, Mysore INDIA.

Dr.Manjaiah.D.H., Reader ,CS at Dept.of Computer Science, Mangalore University, Mangalagangothri, Mangalore, INDIA.

Abstract - The actual transition from IPv4 toIPv6 requires network administrators to become aware of the next generation protocol and the associated risk problems. Due to the scale and complexity of current internet architecture how to protect from the existing investment and reduce the negative influence to users and service providers during the transition from IPv4 to IPv6 is a very important future topic for the advanced version of an internet architecture.IPv6 for us provides a lot of new features which directly or indirectly the security environment for the devices connected to the dual private and public networks. However the very presence of IPv6 makes networks susceptible to attack. Moving to the Next Generation of Internet Protocol (IPv6) became an issue to solve many problems in the current generation. Tunneling is a widely accepted and a practical way to transition existing IPv4 network to the Next Generation Protocol IPv6.The universities as a high level learning organization should be the first mover to cope with this technology. By transitioning to IPv6 without adequate precautions an adversary can easily by pass the networks security infrastructure. Most of the network administrators are familiar of the security considerations with IPv4,however they are lacking knowledge for an IPv6.This paper summarizes and compares the IPv6 transition mechanisms translation methods like Dual Stack, Tunneling issues like IPv6 Automatic tunneling and manually configured tunneling considerations, the IPv6 transition scenarios,IPv6 transition security problems, highlights IPv6 and IPv4 threat review with automatic tunneling and configuration tunneling considerations. This paper evaluates and compares threats in IPv4 and IPv6 tunneling mechanisms. Automatic tunnels offer easy access to basic IPv6 connectivity in an unmanaged environment while negotiated tunnels offer the best solution when a provider is available locally. In this paper we have proposed a transitional threat model for automatic tunneling and a configuration tunneling that could be followed by the University of Mysore (UoM), to estimate automatic tunneling and a manually configured tunneling threat review issues. Further more, there are different tunneling mechanisms such as: IPv6 over IPv4 GRE Tunnel, Tunnel broker, Automatic IPv4–Compatible Tunnel, and Automatic 6-to-4 Tunnel and also outlines many of the common known threats against IPv6 and then it compares and contrast how these threats are similar ones, might affect an IPv6 network.

Keywords: Automatic Tunneling, Configuration Tunneling, IPv4, IPv6, IPv6 Transition, IPv6 Tunneling, IPv6 Security.

Paper 12060916: Performance Evaluation of Mesh based Multicast Reactive Routing Protocol under Black Hole Attack (Publication Link)

E.A. Mary Anita, Research Scholar, Anna University, Chennai, India  
V.Vasudevan, Professor & Head /IT, A.K. College of Engg., Virudhunagar, India

Abstract - A mobile ad-hoc network is an autonomous system of mobile nodes connected by wireless links in which nodes cooperate by forwarding packets for each other thereby enabling communication beyond direct wireless transmission range. The wireless and dynamic nature of ad-hoc networks makes them vulnerable to attacks especially in routing protocols. Providing security in mobile ad-hoc networks has been a major issue over the recent years. One of the prominent mesh base reactive multicast routing protocols used in ad-hoc networks is On Demand Multicast Routing protocol (ODMRP). The security of ODMRP is compromised by a primary routing attack called black hole attack. In this attack a malicious node advertises itself as having the shortest path to the node whose packets it wants to intercept. This paper discusses the impact of black hole attack on ODMRP under various scenarios. The performance is evaluated using metrics such as packet delivery ratio and end to end delay for various numbers of senders and receivers via simulation. The results enable us to propose solutions to counter the effect of black hole attack.  
Keywords- MANET; Black hole; ODMRP;

Paper 14060921: A Secure Multi-Party Computation Protocol for Malicious Computation Prevention for preserving privacy during Data Mining (Publication Link)

Dr. Durgesh Kumar Mishra, Neha Koria, Nikhil Kapoor, Ravish Bahety 
Acropolis Institute of Technology and Research, Indore, MP, India 

ABSTRACT - Secure Multi-Party Computation (SMC) allows parties with similar background to compute results upon their private data, minimizing the threat of disclosure. The exponential increase in sensitive data that needs to be passed upon networked computers and the stupendous growth of internet has precipitated vast opportunities for cooperative computation, where parties come together to facilitate computations and draw out conclusions that are mutually beneficial; at the same time aspiring to keep their private data secure. These computations are generally required to be done between competitors, who are obviously weary of each-others intentions. SMC caters not only to the needs of such parties but also provides plausible solutions to individual organizations for problems like privacy-preserving database query, privacy-preserving scientific computations, privacy-preserving intrusion detection and privacy-preserving data mining. This paper is an extension to a previously proposed protocol Encrytpo_Random, which presented a plain sailing yet effective approach to SMC and also put forward an aptly crafted architecture, whereby such an efficient protocol, involving the parties that have come forward for joint-computations and the third party who undertakes such computations, can be developed. Through this extended work an attempt has been made to further strengthen the existing protocol thus paving the way for a more secure multi-party computational process. 

Keywords: Complexity, Encryption, Decryption, Encrytpo_Random, Extended Encrytpo_Random, Pool of function, Random Dissemination, Secure multi-party computation (SMC), Trusted third party (TTP).

Paper 15060922: Efficient methodology for implementation of Encrypted File System in User Space (Publication Link)

Dr. Shishir Kumar, Department of CSE, Jaypee Institute of Engg. & Technology, Guna (M.P.), India

U.S. Rawat, Department of CSE, Jaypee Institute of Engg. & Technology, Guna (M.P.), India

Sameer Kumar Jasra, Department of CSE, Jaypee Institute of Engg. & Technology, Guna (M.P.), India

Akshay Kumar Jain, Department of CSE, Jaypee Institute of Engg. & Technology, Guna (M.P.), India

Abstract— Data encryption has become an increasingly important factor in all aspect of life. It’s a basic requirement for most of the users to identify a suitable method for securing their data with maximum ease and minimum overhead on their part; they want a security system that protects any files used by any of their applications, without resorting to application specific encryption methods. 
The Encrypted File System (EFS) pushes encryption services into the file system itself. EFS supports secure storage at the system level through a standard UNIX file system interface to encrypted files. User can associate a cryptographic key with the directories they wish to protect. Files in these directories (as well as their pathname components) are transparently encrypted and decrypted with the specified key without further user intervention; clear text is never stored on a disk or sent to a remote file server. EFS can use any available file system for its underlying storage without modifications, including remote file servers such as NFS. System management functions, such as file backup, work in a normal manner and without knowledge of the key. Performance is an important factor to users since encryption can be time consuming.
 The main issue discussed in this paper is that the user may not be aware about storage location & storage methodology of file, but he remains under impression that the file is stored in the same way as he stores it on the hard disk. If data gets hacked then also there will be an advantage due to its encrypted format, which cannot be easily understood by anybody. This paper describes the design and implementation of EFS in user space using faster cryptographic algorithms on UNIX Operating system. Implementing EFS in user space makes it portable & flexible; Kernel size will also not increase resulting in more reliable & efficient Operating System. Encryption techniques for file system level encryption are described, and general issues of cryptographic system interfaces to support routine secure computing are discussed.

Keywords- Advance Encryption standerd, Electronic code book mode, EFS daemon, Intialization vector, Network File system.
Paper 16060923: A new approach to services differentiation between mobile terminals of a wireless LAN (Publication Link)

ReDCAD Research Unit, National School of Engineering of Sfax, BP 1173-3038 Sfax, Tunisia 

ReDCAD Research Unit, National School of Engineering of Sfax, BP 1173-3038 Sfax, Tunisia 

Bachar ZOUARI 
ReDCAD Research Unit, National School of Engineering of Sfax, BP 1173-3038 Sfax, Tunisia 

Abstract - This study aims to identify the advantages and disadvantages of several mechanisms for service differentiation in mobile terminals of a wireless LAN to establish a more better and more optimal. At the end of the analysis of available approaches for the quality of service of the IEEE 802.11 standard, the objective of this paper is to suggest a new method named DF-DCF "Differentiated Frame DCF. The performance of the suggested method in a Network Simulator (NS) environment allowed its validation through a set of testing and simulation scenarios. Simulation results have shown that the DF-DCF method is better suited for mobile nodes in a wireless communication network. 

Key words: Service Differentiation, Wireless LAN, mobility, DCF, DF-DCF, NS.
Paper 17060924: Transmission Performance Analysis of Digital Wire and Wireless Optical Links in Local and Wide Areas Optical Networks (Publication Link)

Abd El–Naser A. Mohamed, Mohamed M. E. El-Halawany , Ahmed Nabih Zaki Rashed , and Amina E. M. El-Nabawy

Electronics and Electrical Communication Engineering Department, Faculty of Electronic Engineering, Menouf 32951, Menoufia University, EGYPT

Abstract—In the present paper, the transmission performance analysis of digital wire and wireless optical links in local and wide areas optical networks have been modeled and parametrically investigated over wide range of the affecting parameters. Moreover, we have analyzed the basic equations of the comparative study of the performance of digital fiber optic links with wire and wireless optical links. The development of optical wireless communication systems is accelerating as a high cost effective to wire fiber optic links. The optical wireless technology is used mostly in wide bandwidth data transmission applications. Finally, we have investigated the maximum transmission distance and data transmission bit rates that can be achieved within digital wire and wireless optical links for local and wide areas optical network applications.

  Keywords—Wireless fiber optics; Transmission distance; Transmission bit rate; Radio frequency; Bit error rate; Digital optical links; Local area network; Wide area Network.
Paper 17060926: Automatic local Gabor Features extraction for face recognition (Publication link)

Yousra BEN JEMAA, Signal and System Unit, National Engineering School of Sfax, BP W 3038, Tunisia

Abstract - In this paper we present a biometric system of face detection and recognition in color images. The face detection technique is based on skin color information and fuzzy classification. A new algorithm is proposed in order to detect automatically face features (eyes, mouth and nose) and extract their correspondent geometrical points. These fiducial points are described by sets of wavelet components which are used for recognition. To achieve the face recognition, we use neural networks and we study its performances for different inputs. We compare the two types of features used for recognition: geometric distances and Gabor coefficients which can be used either independently or jointly. This comparison shows that Gabor coefficients are more powerful than geometric distances. We show with experimental results how the importance recognition ratio makes our system an effective tool for automatic face detection and recognition. 

Index Terms - Face recognition, Feature extraction, Gabor wavelets, Geometric feature.
Paper 17060927: Intelligent Advisory System for Supporting University Managers in Law (Publication Link)
Atta E. E. Elalfi, Department of computer, Faculty of specific education, Mansoura, University , Egypt, & College of Computers and Information Systems, Taif University , Taif , Saudi Arabia 

M. E. ElAlami, Dept. of Computer Science, Faculty of Specific Education, Mansoura, Egypt

Abstract - The rights and duties of both staff members and students are regulated by a large and different numbers of legal regulations and rules. This large number of rules and regulations makes the decision-making process time consuming and error boring. Smart advisory systems could provide rapid and accurate advices to managers and give the arguments for these advices. This paper presents an intelligent advisory system in law to assist the legal educational processes in universities and institutes. The aims of the system are: to provide smart legal advisors in the universities and institutes, to integrate rules and regulations of universities and institutes in the e-government, to ease the burden on the legal advisor and the provision of consulting services to users, to achieve accurate and timely presentation of the legal opinion to a given problem and to assure flexibility for accepting changes in the rules and legal regulations. The system is based on experienced jurists and the rules and regulations of the law organizing Saudi Arabia universities and institutes.

Paper 18060932: A Hop-by-Hop Congestion-Aware Routing Protocol for Heterogeneous Mobile Ad-hoc Networks (Publication Link)

*B.Narasimhan and S.Santhosh Baboo
Bharathiar University

Abstract—In Heterogeneous mobile ad hoc networks (MANETs) congestion occurs with limited resources. Due to the shared wireless channel and dynamic topology, packet transmissions suffer from interference and fading. In heterogeneous ad hoc networks, throughput via a given route is depending on the minimum data rate of all its links. In a route of links with various data rates, if a high data rate node forwards more traffic to a low data rate node, there is a chance of congestion, which leads to long queuing delays in such routes. Since hop count is used as a routing metric in traditional routing, it do not adapt well to mobile nodes. A congestion-aware routing metric for MANETs should incorporate transmission capability, reliability, and congestion around a link. In this paper, we propose to develop a hop-by-hop congestion aware routing protocol which employs a combined weight value as a routing metric, based on the data rate, queuing delay, link quality and MAC overhead. Among the discovered routes, the route with minimum cost index is selected, which is based on the node weight of all the in-network nodes. Simulation results prove that our proposed routing protocol attains high throughput and packet delivery ratio, by reducing the packet drop and delay.

Keywords-MANETs; Routing Protocol; Overhead; Congestion

Paper 18060934: Enhanced Algorithm for Link to System level Interface Mapping (Publication Link)

Shahid Mumtaz, Alitio Gamerio, Rasool Sadeghi

Abstract—The current SINR mechanism does not provide the base station(BS) with any knowledge on the frequency selectivity of channel from mobile service station(MSS). This knowledge is important since, contrary to the AWGN channel, in a frequency selective channel there is no longer a 1 to 1 relation between amount of increase in power and amount of improvement in “effective SINR” 1. Furthermore, the relation is dependent on MCS level. This lack of knowledge in the BS side results in larger fade margins, which translates directly to reduction in capacity. In this paper we propose a enhanced algorithm on the EESM model with weighted beta (β) that provides the BS with sufficient knowledge on the channel-dependent relationship between power increase, MCS change and improvement in effective SINR.

Keywords—SINR, EESM, channel, BS, MSS

Paper 20060937: FPGA-based Controller for a Mobile Robot (Publication Link)

Shilpa Kale, Department of Electronics & Telecommunication Engineering, Nagpur University, Nagpur, Maharashtra

Abstract - With the fast innovation of the hardware and software technologies using rapid prototyping devices, with application in the robotics and automation, more and more it becomes necessary the development of applications based on methodologies that facilitate future modifications, updates and enhancements in the original projected system. This project presents a conception of mobile robots using rapid prototyping, distributing the several control actions in growing levels of complexity and computing proposal oriented to embed systems implementation. This kind of controller can be tested on different platform representing the mobile robots using reprogrammable logic components (FPGA). 
  I would like to construct a mechanically simple robot model, which can measure the distance from obstacle with the aid of sensor and accordingly should able to control the speed of motor.

Keywords: Field Programmable Gate Array (FPGA), mobile robot, L293D Driver, GP2D12 Distance Measurement Sensor.
Paper 21060938: Topological design of minimum cost survivable computer communication networks: Bipartite Graph Method (Publication Link)

Kamalesh V.N, Department of Computer Science and Engineering, Sathyabama University, Chennai, India.

S K Srivatsa, St. Joseph College of Engineering Chennai, India.

Abstract- A good computer network is hard to disrupt. It is desired that the Computer Communication Network remains connected even when some of the links or nodes fail. Since the communication links are expensive, one wants to achieve these goals with fewer links. The Computer Communication Network is fault tolerant if it has alternative paths between vertices, the more disjoint paths, the better is the survivability. This paper presents a method for generating k-connected computer communication network with optimal number of links using bipartite graph concept.

Index Terms-Computer network; Link deficit algorithm, wireless network, k-connected networks, survivable network, bipartite graph.

Paper 24060942: Approach To Solving Cybercrime And Cybersecurity (Publication Link)

N.A Azeez, Department of Maths and Computer Science, Fountain University, Osogbo, Nigeria.

O.O Osunade, Department of Computer Science, University of Ibadan, Nigeria.

Abstract - Cybercrime is becoming ever more serious. Findings from 2002 Computer Crime and Security Survey show an upward trend that demonstrates a need for a timely review of existing approaches to fighting this new phenomenon in the information age. In this paper, we provide an overview of Cybercrime and present an international perspective on fighting Cybercrime. 

This work seeks to define the concept of cyber-crime, identify reasons for cyber-crime, how it can be eradicated, look at those involved and the reasons for their involvement, we would look at how best to detect a criminal mail and in conclusion, proffer recommendations that would help in checking the increasing rate of cyber-crimes and criminals.

Keywords: Cyber security, information, Internet, technology, people  

Paper 25060943: Deterministic Formulization of SNR for Wireless Multiuser DS-CDMA Networks (Publication Link)

Syed S. Rizvi and Khaled M. Elleithy, Computer Science and Engineering Department, University of Bridgeport, Bridgeport 
Aasia Riasat, Department of Computer Science, Institute of Business Management, Karachi, Pakistan 78100

Abstract—Wireless Multiuser receivers suffer from their relatively higher computational complexity that prevents widespread use of this technique. In addition, one of the main characteristics of multi-channel communications that can severely degrade the performance is the inconsistent and low values of SNR that result in high BER and poor channel capacity. It has been shown that the computational complexity of a multiuser receiver can be reduced by using the transformation matrix (TM) algorithm [4]. In this paper, we provide quantification of SNR based on the computational complexity of TM algorithm. We show that the reduction of complexity results high and consistent values of SNR that can consequently be used to achieve a desirable BER performance. In addition, our simulation results suggest that the high and consistent values of SNR can be achieved for a desirable BER performance. The performance measure adopted in this paper is the consistent values of SNR. 

Keywords—Computational complexity, DS-CDMA, wireless multiuser receivers, signal to noise ratio 
Paper 25060944: A New Scheme for Minimizing Malicious Behavior of Mobile Nodes in Mobile Ad Hoc Networks (Publication Link)

Syed S. Rizvi and Khaled M. Elleithy, Computer Science and Engineering Department, University of Bridgeport, Bridgeport, CT, USA

Abstract- The performance of Mobile Ad hoc networks (MANET) depends on the cooperation of all active nodes. However, supporting a MANET is a cost-intensive activity for a mobile node. From a single mobile node perspective, the detection of routes as well as forwarding packets consume local CPU time, memory, network-bandwidth, and last but not least energy. We believe that this is one of the main factors that strongly motivate a mobile node to deny packet forwarding for others, while at the same time use their services to deliver its own data. This behavior of an independent mobile node is commonly known as misbehaving or selfishness. A vast amount of research has already been done for minimizing malicious behavior of mobile nodes. However, most of them focused on the methods/techniques/algorithms to remove such nodes from the MANET. We believe that the frequent elimination of such miss-behaving nodes never allowed a free and faster growth of MANET. This paper provides a critical analysis of the recent research wok and its impact on the overall performance of a MANET. In this paper, we clarify some of the misconceptions in the understating of selfishness and miss-behavior of nodes. Moreover, we propose a mathematical model that based on the time division technique to minimize the malicious behavior of mobile nodes by avoiding unnecessary elimination of bad nodes. Our proposed approach not only improves the resource sharing but also creates a consistent trust and cooperation (CTC) environment among the mobile nodes. We believe, that the proposed mathematical model not only points out the weaknesses of the recent research work but also approximates the optimal values of the critical parameters such as throughput, transmission over head, and channel capacity. The simulation results demonstrate the success of the proposed approach that significantly minimizes the malicious nodes and consequently maximizes the overall throughput of MANET than other well known schemes.  
Keywords- channel capacity, mobile nodes, MANET, throughput analysis.

Paper 28060945: Knowledge Elecitation for Factors Affecting Taskforce Productivity– using a Questionnaire (Publication Link)

Muhammad Sohail* , Institute of Information Technology, Kohat University of Science & Technology (KUST), Kohat, Pakistan 

Abdur Rashid Khan, Institute of Computing & Information Technology, Gomal University
Dera Ismail Khan, Pakistan 

Abstract—In this paper we present the process of Knowledge Elicitation through a structured questionnaire technique. This is an effort to depict a problem domain as “Investigation of factors affecting taskforce productivity”. The problem has to be solved using the expert system technology. This problem is the very first step how to acquire knowledge from the domain experts. Knowledge Elicitation is one of the difficult tasks in knowledge base formation which is a key component of expert system. The questionnaire was distributed among 105 different domain experts of Public and Private Organizations (i.e. Education Institutions, Industries and Research etc) in Pakistan. A total 61 responses from these experts were received. All the experts were well qualified, highly experienced and has been remained the members for selection committees a number of times for different posts. Facts acquired were analyzed from which knowledge was extracted and elicited. A standard shape was given to the questionnaire for further research as a knowledge learning tool. This tool may be used as a standard document for selection and promotion of employees.
Keywords- Expert System; Knowledge Acquisition; Knowledge Elicitation; Questionnaire; Taskforce Productivity; domain experts

Paper 29060947: A Novel Generic Session Based Bit Level Encryption Technique to Enhance Information Security (Publication Link)

Manas Paul, Tanmay Bhattacharya, Suvajit Pal, Ranit Saha, 

Department of Information Technology, JIS College of Engineering, Kalyani, West Bengal 

Abstract - In this paper a session based symmetric key encryption system has been proposed and is termed as Permutated Cipher Technique (PCT). This technique is more fast, suitable and secure for larger files. In this technique the input file is broken down into blocks of various sizes (of 2^n order) and encrypted by shifting the position of each bit by a certain value for a certain number of times. A key is generated randomly wherein the length of each block is determined. Each block length generates a unique value of “number of bits to be skipped”. This value determines the new position of the bits within the block that are to be shifted. After the shifting and inverting each block is XOR’ed with SHA-512 digest of the key. The resultant blocks from the cipher text. The key is generated according to the binary value of the input file size. Decryption is done following the same process as the technique is symmetric.

Keywords- Permutated Cipher Technique (PCT); Session Based; Number of Bits to Skip (NBSk); Maximum Iterations (MaxIter); Iterations done for encrypting (eIter); Iterations done for decrypting (dIter); Symmetric Key.
Paper 29060948: Training Process Reduction Based On Potential Weights Linear Analysis To Accelarate Back Propagation Network (Publication Link)

Roya Asadi, Norwati Mustapha, Nasir Sulaiman,
Faculty of Computer Science and Information Technology, University Putra Malaysia, 43400 Serdang, Selangor, Malaysia.

Abstract—Learning is the important property of Back Propagation Network (BPN) and finding the suitable weights and thresholds during training in order to improve training time as well as achieve high accuracy. Currently, data pre-processing such as dimension reduction input values and pre-training are the contributing factors in developing efficient techniques for reducing training time with high accuracy and initialization of the weights is the important issue which is random and creates paradox, and leads to low accuracy with high training time. One good data preprocessing technique for accelerating BPN classification is dimension reduction technique but it has problem of missing data. In this paper, we study current pre-training techniques and new preprocessing technique called Potential Weight Linear Analysis (PWLA) which combines normalization, dimension reduction input values and pre-training. In PWLA, the first data preprocessing is performed for generating normalized input values and then applying them by pre-training technique in order to obtain the potential weights. After these phases, dimension of input values matrix will be reduced by using real potential weights. For experiment results XOR problem and three datasets, which are SPECT Heart, SPECTF Heart and Liver disorders (BUPA) will be evaluated. Our results, however, will show that the new technique of PWLA will change BPN to new Supervised Multi Layer Feed Forward Neural Network (SMFFNN) model with high accuracy in one epoch without training cycle. Also PWLA will be able to have power of non linear supervised and unsupervised dimension reduction property for applying by other supervised multi layer feed forward neural network model in future work.

Keywords-Preprocessing; Dimension reduction; Pre-training; Supervised Multi-layer Feed Forward Neural Network (SMFFNN); Training; Epoch

Paper 29060949: An Application of Bayesian classification to Interval Encoded Temporal mining with prioritized items (Publication Link)

C. Balasubramanian  
Department of Computer Science and Engineering  
K.S.Rangasamy College of Technology  
Namakkal-Dt., Tamilnadu, India 

Abstract - In real life, media information has time attributes either implicitly or explicitly known as temporal data. This paper investigates the usefulness of applying Bayesian classification to an interval encoded temporal database with prioritized items. The proposed method performs temporal mining by encoding the database with weighted items which prioritizes the items according to their importance from the user’s perspective. Naïve Bayesian classification helps in making the resulting temporal rules more effective. The proposed priority based temporal mining (PBTM) method added with classification aids in solving problems in a well informed and systematic manner. The experimental results are obtained from the complaints database of the telecommunications system, which shows the feasibility of this method of classification based temporal mining.

Keywords: Encoded Temporal Database; Weighted items; Temporal Mining; Priority Based Temporal Mining (PBTM); Naïve Bayesian classification

Paper 29060950: A Proposed Algorithm to improve security & Efficiency of SSL-TLS servers using Batch RSA decryption (Publication Link)

R. K. Pateriya, Faculty of Computer Science & IT Dept., MANIT, Bhopal, 462-051 India
S. C. Shrivastava, Faculty of Computer Science & IT Dept., MANIT, Bhopal, 462-051 India

Jaideep Patel, Dept of Computer Science, MANIT, Bhopal, 462-051 India

Abstract - Today, Internet becomes the essential part of our lives. Over 90% of the e-commerce is developed on the Internet. A security algorithm became very necessary for producer-client transactions assurance and the financial applications safety (credit cards, etc.) The RSA algorithm applicability derives from algorithm properties like: confidentiality, safe authentication, data safety and integrity on the internet. Thus, this kind of networks can have a more easy utilization by practical accessing from short, medium, even long distance and from different public places (Internet Cafe, airports, banks, commercial centers, educational institutes, etc.) the immensity of resources offered by internet. RSA encryption in the client side is relatively cheap, whereas, the corresponding decryption in the server side is expensive because its private exponent is much larger. Thus SSL/TLS servers become swamped to perform public key decryption operations when the simultaneous requests increase quickly .The Batch RSA method is useful for such highly loaded web server .In our proposed algorithm by reducing the response time & client’s tolerable waiting time an improvement in performance of SSL-TLS servers can be done. The proposed algorithm should provide the reasonable response time and optimizes server performance significantly. At Encryption side, to withstand many attacks like brute force attack, subtle attack etc. we also adapted a parameter generation method, which sieve all the parameters strictly, and filter out every insecure parameter.

Keywords: Batch RSA, MiniBatching, Tolerable waiting time, response time.

Paper 30060954: Log Management support for recovery in mobile computing Environment (Publication Link)

J.C. Miraclin Joyce Pamila, CSE & IT Dept, Government College of Technology, Coimbatore, India.

K. Thanushkodi, Akshaya College of Engineering and Technology,  Coimbatore, India.

Abstract - Rapid and innovative improvement in wireless communication technologies has led to an increase in the demand for mobile internet transactions. However, internet access from mobile devices is very expensive due to limited bandwidth available on wireless links and high mobility rate of mobile hosts. When a user executes a transaction with a web portal from a mobile device, the disconnection necessitates failure of the transaction or redoing all the steps after reconnection, to get back into consistent application state. Thus considering challenges in wireless mobile networks, a new log management scheme is proposed for recovery of mobile transactions.
 In this proposed approach, the model parameters that affect application state recovery are analyzed. The proposed scheme is compared with the existing Lazy and Pessimistic scheme and a trade off analysis between the cost invested to manage log and the return of investment in terms of improved failure recoverability is made. From the analysis, the best checkpoint interval period that yields the best return of investment is identified.

Keywords – log, recovery, mobile environment.

Paper 30060956: Complete Security Framework for Wireless Sensor Networks (Publication Link)
Kalpana Sharma and Kuldeep, M.K. Ghose
Sikkim Manipal Institute of Technology, Majitar-737136, Sikkim, India, 

Abstract— Security concerns for a sensor Networks and level of security desired may differ according to application specific needs, where the sensor networks are deployed. Till now, all the security solutions proposed for sensor networks are layer wise i.e a particular solution is applicable to single layer itself .So, to integrate them will also produces a new research challenge. We took up the challenge and propose an integrated comprehensive security framework that will provide security services for all services of sensor network. We have added one extra component i.e. Intelligent Security Agent (ISA) to assess level of security and cross layer interactions. Although this framework has many components like Intrusion Detection System, Trust Framework, Key Management scheme and Link layer communication protocol. We have also tested it on three different application scenarios in Castalia and Omnet++ simulator.
Keywords:- Security, sensor networks, key management; application specific security.
Paper 30060957: Dynamic Bandwidth Management in Distributed VoD based on the User Class Using Agents (Publication Link)

H S Guruprasad, Research Scholar, Dr MGR University, Asst Prof & HOD, Dept of ISE BMSCE, Bangalore

Dr. H D Maheshappa, Director East Point Group of Institutions, Bangalore

Abstract - This paper proposes a dynamic bandwidth management algorithm in which more bandwidth is allocated for higher class users and also higher priority is given to the videos with higher popularity within a class using agent technology. The popularity and weight profile of the videos which is used for efficiently allocating bandwidth is periodically updated by a mobile agent. The proposed approach allocates more bandwidth for higher class users and gives higher priority for higher weight videos [popular videos] so that they can be served with high QoS, reduces the load on the central multimedia server and maximizes the channel utilization between the neighboring proxy servers and the central multimedia server and lower video rejection ratio. The simulation results prove the reduction of load on central multimedia server by load sharing among the neighboring proxy servers, maximum bandwidth utilization, and more bandwidth allocation for higher class users.

Keywords: Bandwidth management, user class, mobile agent, Distributed VoD

Paper 30060959: Modelling of IEEE 802.11e EDCA: presentation and application in an admission control algorithm (Publication Link)


Abstract—We propose in this paper a Markov chain model that describes the behavior of an EDCA (Enhanced Distributed Channel Access) access category under saturation. Compared to previous work [1], [2], [3], the model explicitly integrates the behavior of an access category when submitted to a virtual collision. We give in this paper two views of the model : a general one explicitly representing the different states an access category goes through ; the second one is an abstract model with only three useful states. The model was used in several applications spanning from the performance evaluation to its use within an admission control algorithm. The latter application will be presented in this paper.

Paper 01070962: A multidimensional approach for context-aware recommendation in mobile commerce (Publication Link)

Maryam Hosseini-Pozveh, Mohamadali Nematbakhsh, Naser Movahhedinia
Department of Computer Engineering, University Of Isfahan, Isfahan, Iran 

Abstract: Context as the dynamic information describing the situation of items and users and affecting the user’s decision process is essential to be used by recommender systems in mobile commerce to guarantee the quality of recommendation. This paper proposes a novel multidimensional approach for context-aware recommendation in mobile commerce. The approach represents users, items, context information and the relationship between them in a multidimensional space. It then determines the usage patterns of each user under different contextual situations and creates a new 2-dimensional recommendation space and does the final recommendation in that space. This paper also represents an evaluation process by implementing the proposed approach in a restaurant food recommendation system considering day, time, weather and companion as the contextual information and comparing the approach with the traditional 2-dimensional one. The results of comparison illustrates that the multidimensional approach increases the recommendation quality. 

Keywords: context-awareness; multidimensional recommendation approach; mobile commerce; self-organizing maps; collaborative filtering

Paper 01070963: Applicability of a Novel Integer Programming Model for Wireless Sensor Networks (Publication Link)

Alexei Barbosa de Aguiar, Alvaro de M. S. Neto, Placido Rogerio Pinheiro, Andre L. V. Coelho 
Graduate in Applied Informatics, University of Fortaleza, Brasil.

Abstract—This paper presents an applicability analysis over a novel integer programming model devoted to optimize power consumption efficiency in heterogeneous wireless sensor networks. This model is based upon a schedule of sensor allocation plans in multiple time intervals subject to coverage and connectivity constraints. By turning off a specific set of redundant sensors in each time interval, it is possible to reduce the total energy consumption in the network and, at the same time, avoid partitioning the whole network by losing some strategic sensors too prematurely. Since the network is heterogeneous, sensors can sense different phenomena from different demand points, with different sample rates. As the problem instances grows the time spent to the execution turns impracticable. 

Index Terms—Integer Linear Programming, Wireless Sensor Network, Consumption Optimization

IJCSIS Editor,
Aug 13, 2009, 2:22 PM
IJCSIS Editor,
Aug 8, 2009, 10:19 AM
IJCSIS Editor,
Aug 10, 2009, 10:26 PM