Vol. 9 No. 1 JAN 2011

Vol. 9 No. 1 January 2011 International Journal of Computer Science and Information Security

Publication January 2011, Volume 9 No. 1 (Download Full Journal) (Archive)

Copyright © 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.

---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

1. Paper 31121008: ANNaBell Island: A 3D Color Hexagonal SOM for Visual Intrusion Detection (pp. 1-7)

Full Text: PDF

Chet Langin, Michael Wainer, and Shahram Rahimi

Computer Science Department, Southern Illinois University Carbondale, Carbondale, Illinois, USA

Abstract — Self-Organizing Maps (SOM) are considered by many to be black boxes because the results are often non-intuitive. Our research takes the multidimensional output from a successful intrusion detecting SOM and displays it in novel full color and 3D formats, with landscape features similar to an island, that assist in understanding the SOM results. This paper describes the visual data mining from the map and explains the methodology in obtaining the full color and 3D maps.

Keywords: Data Mining; Forensics; Intrusion Detection; Modeling; Self-Organizing Map (SOM); Visualization.

.---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

2. Paper 31121009: Multimedia Video Conference Identities Study (pp. 8-12)

Full Text: PDF

Mahmoud Baklizi, Nibras Abdullah, Ali Abdulqader Bin Salem, Sima Ahmadpour, Sureswaran Ramadass

National Advanced IPv6 Centre of Excellence, Universiti Sains Malaysia, Pinang, Malaysia

Abstract— In multimedia conferences there are many Video Conference System (VCS) applications with specific features for each such identity, Support Global Roaming and Support Multiple Client behind NAT. one of the most important features in VCS is the identity, which control and manage the system. The identity feature includes chairman, participants and observers. In this paper we made comparison between the six VCS systems in term of identity feature. At the end we found the NLVC is slightly better than other systems and it is useful for control.

Keywords- NLVC, Eyeball chat, WebEx, Skype, Polycom PVX, Meeting Plaza, Chairman, Participant, Observer.

3. Paper 31121012: A Multi-Purpose Scenario-based Simulator for Smart House Environments (pp. 13-18)

Full Text: PDF

Zahra Forootan Jahromi and Amir Rajabzadeh, Department of Computer Engineering, Razi University, Kermanshah, Iran

Ali Reza Manashty, Department of IT and Computer Engineering, Shahrood University of Technology, Shahrood, Iran

Abstract - Developing smart house systems has been a great challenge for researchers and engineers in this area because of the high cost of implementation and evaluation process of these systems, while being very time consuming. Testing a designed smart house before actually building it is considered as an obstacle towards an efficient smart house project. This is because of the variety of sensors, home appliances and devices available for a real smart environment. In this paper, we present the design and implementation of a multi-purpose smart house simulation system for designing and simulating all aspects of a smart house environment. This simulator provides the ability to design the house plan and different virtual sensors and appliances in a two dimensional model of the virtual house environment. This simulator can connect to any external smart house remote controlling system, providing evaluation capabilities to their system much easier than before. It also supports detailed adding of new emerging sensors and devices to help maintain its compatibility with future simulation needs. Scenarios can also be defined for testing various possible combinations of device states; so different criteria and variables can be simply evaluated without the need of experimenting on a real environment.

Keywords- smart house simulator; scenario-based smart house; virtual smart house; sensor simulator.

4. Paper 31121032: Carrier Offset Estimation for MIMO-OFDM Based on CAZAC Sequences (pp. 19-23)

Full Text: PDF

Dina Samaha, Sherif Kishk , Fayez Zaki

Department of electronics and communications engineering, Mansoura University, Egypt

Abstract— The combination of Multi-Input Multi-Output (MIMO) with Orthogonal Frequency Division Multiplexing (OFDM) is regarded as a winning technology for future broadband communication. However, its sensitivity to Carrier Frequency Offset (CFO) is a major contributor to the Inter-Carrier Interference (ICI), this effect becomes more severe by the presence of multipath fading in wireless channels. This paper is concerned with CFO estimation for MIMO-OFDM system. The presented algorithm uses a two-step strategy. In the proposed method a preamble structure is used which made up of repeated orthogonal polyphase sequences such as Zadoff and Chu sequences. Both of them belong to the class of Constant Amplitude Zero Auto-Correlation (CAZAC) sequences. The repeated preambles that are constructed using a CAZAC code are simultaneously transmitted from all transmit antennas to accomplish frequency offset estimation. Simulation results show the robustness, accuracy and time-efficiency of the proposed algorithm compared to existing similar algorithms that use PN codes especially in multi-path channel.

Keywords-— CFO, MIMO, OFDM, Zadoff-Chu sequences.

5. Paper 31121042: A New Approach to Prevent Black Hole Attack in AODV (pp. 24-29)

Full Text: PDF

M. R. Khalili Shoja, Department of Electrical Engineering, Amirkabir University of Technology, Tehran, Iran

Hasan Taheri, Department of Electrical Engineering, Amirkabir University of Technology, Tehran, Iran

Shahin Vakilinia, Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran

Abstract— Ad-hoc networks are a collection of mobile hosts that communicate with each other without any infrastructure. These networks are vulnerable against many types of attacks including black hole. In this paper, we analyze the effect of this attack on the performance of ad-hoc networks using AODV as a routing protocol. Furthermore, we propose an approach based on hash chain to prevent this type of attack. Simulation results using OPNET simulator depicts that packet delivery ratio, in the presence of attacker nodes, reduces remarkably. On the other hand, applying proposed approach can reduce the effect of black hole attacks.

Keywords: AODV; black hole; hash chain; OPNET

6. Paper 31121047: Application of Web Server Benchmark using Erlang/OTP R11 and Linux (pp. 30-34)

Full Text: PDF

A. Suhendra, A.B. Mutiara,

Faculty of Computer Science and Information Technology, Gunadarma University, Jl. Margonda Raya No.100, Depok 16464, Indonesia

Abstract— As the web grows and the amount of traffics on the web server increase, problems related to performance begin to appear. Some of the problems, such as the number of users that can access the server simultaneously, the number of requests that can be handled by the server per second (requests per second) to bandwidth consumption and hardware utilization like memories and CPU. To give better quality of service (QoS), web hosting providers and also the system administrators and network administrators who manage the server need a benchmark application to measure the capabilities of their servers. Later, the application intends to work under Linux/Unix – like platforms and built using Erlang/OTP R11 as a concurrent oriented language under Fedora Core Linux 5.0. It is divided into two main parts, the controller section and the launcher section. Controller is the core of the application. It has several duties, such as read the benchmark scenario file, configure the program based on the scenario, initialize the launcher section, gather the benchmark results from local and remote Erlang node where the launcher runs and write them in a log file (later the log file will be used to generate a report page for the sysadmin). Controller also has function as a timer which act as timing for user inters arrival to the server. Launcher generates a number of users based on the scenario, initialize them and start the benchmark by sending requests to the web server. The clients also gather the benchmark result and send them to the controller.

Key words— Erlang, QoS, Network Management, Concurrent Programming, Distribution

7. Paper 31121021: Advanced Virus Monitoring and Analysis System (pp. 35-38)

Full Text: PDF

Fauzi Adi Rafrastara, Faculty of Information and Communication Technology, University of Technical Malaysia Melaka, Melaka, Malaysia

Faizal M. A, Faculty of Information and Communication Technology, University of Technical Malaysia Melaka, Melaka, Malaysia

Abstract — This research proposed an architecture and a system which able to monitor the virus behavior and classify them as a traditional or polymorphic virus. Preliminary research was conducted to get the current virus behavior and to find the certain parameters which usually used by virus to attack the computer target. Finally, “test bed environment” is used to test our system by releasing the virus in a real environment, and try to capture their behavior, and followed by generating the conclusion that the tested or monitored virus is classified as a traditional or polymorphic virus.

Keywords-Computer virus, polymorphic virus, traditional virus, VMAS.

8. Paper 23121004: A New Approach for Clustering Categorical Attributes (pp. 39-43)

Full Text: PDF

Parul Agarwal, Department Of Computer Science, Jamia Hamdard (Hamdard University), New Delhi =110062 ,India

M. Afshar Alam, Department Of Computer Science, Jamia Hamdard (Hamdard University), Jamia Hamdard (Hamdard University), New Delhi =110062 ,India

Ranjit Biswas, Manav Rachna International University, Green Fields Colony, Faridabad, Haryana 121001

Abstract— Clustering is a process of grouping similar objects together and placing the object in a cluster which is most similar to it. In this paper we provide a new measure for calculation of similarity between 2 clusters for categorical attributes and the approach used is agglomerative hierarchical clustering.

Keywords- Agglomerative hierarchical clustering, Categorical Attributes, Number of Matches.

9. Paper 31121007: Position based Routing Scheme using Concentric Circular Quadrant Routing Protocol in mobile ad hoc network (pp. 44-47)

Full Text: PDF

Upendra Verma, M.E. (Research Scholor), Shri Vaishnav Institute Of Science and Technology Indore (Madhya Pradesh), India

Mr. Vijay Prakash, Asst. Prof., Shri Vaishnav Institute Of Science and Technology Indore (Madhya Pradesh), India

Abstract— Mobile ad hoc network is a self-organizing and self-configuring network in which, mobile host moved freely, due to this disconnection is often occurred between mobile hosts. In mobile ad hoc network location of mobile nodes are frequently changed. Location management is a crucial issue in MANET due to dynamic topologies. In this paper we propose a position based routing scheme called “Concentric Circular Quadrant Routing Scheme (CCQRS)”. In this paper we use single location server region for location update and location query. This strategy reduces the cost associated with location update and location query.

Keywords- mobile adhoc network; routing protocol; Concentric Circular location management; CCQRS.

10. Paper 31121010: Comparative Analysis of Techniques for Eliminating Spam in Fax over IP (pp. 48-52)

Full Text: PDF

Manju Jose, Research Scholar, Mother Teresa Women’s University, Kodaikanal, India

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

Abstract— Fax over PSTN line suffered heavily in terms of high costs, call drops, improper imaging, corrupt messages etc. Fax over IP (FoIP) came as substitute to eliminate costly connection and transmission fees. With growing usage of FoIP, the spam is also rising and ruining business prospects. The approaches from the point of view of regulations and technologies to curb spam have been examined. Three technologies have also been compared to suggest most suitable anti-spam technology.

Keywords- Fax over IP (FoIP), S/Fax, SharePoint, Spam, Filtering Spam Fax, Digital signature

11. Paper 31121011: Resource Estimation And Reservation For Handoff Calls In Wireless Mobile Networks (pp. 53-59)

Full Text: PDF

K. Venkatachalam, Professor - Department of ECE, Velalar College of Engineering and Technology, Thindal post, Erode – 638012 , Tamilnadu, India.

P. Balasubramanie, Professor - Department of CSE, Kongu Engineering College, Erode, Tamilnadu, India

Abstract— The main aim of future wireless multimedia networks is to provide sufficient amount of resource to a multimedia call. Reserving required amount of resource in advance to a future new and handoff call is better than rejecting a call at neck of the moment due to insufficient resource at a particular time. This paper presents an efficient handoff resource management strategy by considering the future resource demands of a wireless multimedia call. Here a novel wiener based resource estimation and reservation method is adopted to estimate the instantaneous resource demands of a mobile user. Cell segmentation technique is introduced and utilized to predict the resource demands more accurately in a real time manner. The performance result shows this synergy of resource reservation using pilot sensing and cell segmentation have been decrease the call dropping probability of the handoff calls and increases the micro and pico cellular system performance in real time environments.

Keywords-component; Handoff(HO), Resource Estimation(RE), Resource Reservation(RR), Cell Segmentation (CS), Call Dropping Probability (CDP), Wireless Multimedia Networks (WMN).

12. Paper 31121015: Low Complexity Scheduling Algorithm for Multiuser MIMO System (pp. 60-67)

Full Text: PDF

Shailendra Mishra, Kumaon Engineering College, Dwarahat, Uttrakhand ,India

D.S. Chauhan, Uttrakhand Technical University, Dehradun,Uttrakhand,India

Abstract— Multiple-input and Multiple-output (MIMO) is one of several forms of smart antenna technology. Multiuser downlink scheduling problem with n receivers and m transmits antennas, where data from different users can be multiplexed is discussed in this paper. Scheduling Algorithm targets to satisfy user’s Qos by allocating number of transmit antennas. Scheduling performance under two different types of traffic modes is also discussed: one is voice or web-browsing and the other one is for data transfer and streaming data. We have proposed scheduling algorithm for MIMO system which targets to satisfy user’s QoS by allocating the number of transmit antennas.

Keywords- MIMO,SM,STC,DIV,SA,STBC,MRC,DPC,IMD

13. Paper 31121020: Email Authorship Identification Using Radial Basis Function (pp. 68-75)

Full Text: PDF

A. Pandian, Asst. Professor (Senior Grade), Department of MCA, SRM University, Chennai, India

Dr. Md. Abdul Karim Sadiq, Ministry of Higher Education, College of Applied Sciences, Sohar, Sultanate of Oman

Abstract - Email authorship identification helps tracking fraudulent emails. This research proposes extraction on unique words from the emails. These unique words will be used as representative features to train Radial Basis function (RBF). Final weights are obtained and subsequently used for testing. The percentage of identification of email authorship depends upon number of RBF centers and the type of functional words used for training RBF. One hundred fifty authors with one hundred files from the sent folder of Enron database are considered. A total of 300 unique words of number of characters in each word ranging from 3 to 7 are considered. Training and Testing RBF are done by taking different length of words. The percentage of authorship identification ranges from 95% to 97%. Simulation shows the effectiveness of the proposed RBF network for email authorship identification.

Keywords: email authorship identification; word frequency; radial basis function;

14. Paper 31121022: Performance of Iterative Concatenated Codes with GMSK over Fading Channels (pp. 76-85)

Full Text: PDF

Labib Francis Gergis, Misr Academy for Engineering and Technology, Mansoura, Egypt

Abstract-Concatenated continuous phase modulation (CCPM) facilitates powerful error correction. CPM also has the advantage of being bandwidth efficient and compatible with non-linear amplifiers. Bandwidth efficient concatenated coded modulation schemes were designed for communication over Additive White Gaussian noise (AWGN), and Rayleigh fading channels. An analytical bounds on the performance of Serial (SCCC), and Parallel convolutional concatenated codes (PCCC) were derived as a base of comparison with the third category known as hybrid concatenated convolution codes scheme (HCCC). An upper bound to the soft-input, soft-output (SISO) maximum a posteriori (MAP) decoding algorithm applied to CC's of the three schemes was obtained. Design rules for the parallel, outer, and inner codes that maximize the interleaver's gain were discussed. Finally, a low complexity iterative decoding algorithm that yields a better performance is proposed.

Keywords: Concatenated codes, continuous phase modulation, GMSK, uniform interleaved coding, convolutional coding, iterative decoding

15. Paper 31121025: Priority Based Mobile Transaction Scheme Using Mobile Agents (pp. 86-91)

Full Text: PDF

J.L. Walter Jeyakumar, R.S.Rajesh, Department of Computer Science and Engineering, Manonmaniam Sundaranar University, Tirunelveli, Tamilnadu, India

Abstract— We define a priority based mobile transaction scheme in which mobile users can share data stored in the cache of a mobile agent which is a special mobile node for coordinating the sharing process. This framework allows mobile affiliation work group to be formed dynamically with a mobile agent and mobile hosts. Using short range wireless communication technology, mobile users can simultaneously access the data from the cache of the mobile agent. Data Access Manager module at the mobile agent enforces concurrency control using cache invalidation technique. Four levels of priority are assigned to the requesting mobile nodes based on available energy and connectivity. This model supports disconnected mobile computing by allowing mobile agent to move along with the Mobile Hosts. The proposed Transaction frame work has been simulated in J2ME and NS2 and performance of this scheme is compared with existing frame works.

Key words – Transaction, concurrency control, mobile database, cache invalidation, mobility

16. Paper 31121027: Design of Content-Oriented Information Retrieval by Semantic Analysis (pp. 92-97)

Full Text: PDF

S. Amudaria, Dept of IT, SSN College of Engineering, Chennai, India

S. Sasirekha, Dept of IT, SSN College of Engineering, Chennai, India

Abstract - The existing Information Retrieval (IR) systems which are based entirely on syntactic (keyword based) contents have serious limitations like irrelevant document retrieval, word sense ambiguity, low precision and recall ratio since the complete semantics of the contents are not represented. To overcome these limitations, from the recent literature it is identified that it is necessary to analyze and determine the semantic features of both the content in document and query. Hence in this paper it is proposed to initially develop a semantic pattern that represents semantic features of the contents in every document in the corpus as a Term Document Matrix (TDM) format. Then to develop a semantic pattern for the contents in the query by incorporating it with Natural Language Processing technique along with Synset (WordNet) for query refinement & expansion. Now the similarity between the semantic pattern of the query and TDM is calculated using Latent Semantic Analysis (LSA) and plotted in Semantic Vector Space. Then by matching against the vector space, contents associated to the query can be identified in the corresponding cluster. Various experimental results are carried on, which shows the increase in document retrieval recall and precision rates, thereby demonstrating the effectiveness of the model.

Keywords: Information retrieval, Semantic extraction, Query extension, Query matching

17. Paper 31121035: Enhanced Load Balanced AODV Routing Protocol (pp. 98-101)

Full Text: PDF

Iftikhar Ahmad and Humaira Jabeen

Department of Computer Science, Faculty of Basic and Applied Sciences, International Islamic University Islamabad, Pakistan

Abstract— Excessive load on the MANET is the main reason for link breakage and performance degradation. A congested node in the network dies more quickly than other nodes. A good load balancing technique share the traffic load evenly among all the nodes those can take part in transmission. Transferring of load from congested nodes to less busy nodes and involvement of other nodes in transmission that can take part in route can improve the overall network life. We proposed a load balancing scheme for AODV that improves overall network life, throughput and reduce average end to end delay.

Keywords: AODV, load balancing, congestion, delay.

18. Paper 31121037: Comparative Analysis of Speaker Identification using row mean of DFT, DCT, DST and Walsh Transforms (pp. 102-107)

Full Text: PDF

Dr. H B Kekre, Senior Professor, Computer Department, MPSTME, NMIMS University, Mumbai, India

Vaishali Kulkarni. Associate Professor, Electronics & Telecommunication, MPSTME, NMIMS University, Mumbai, India

Abstract— In this paper we propose Speaker Identification using four different Transform Techniques. The feature vectors are the row mean of the transforms for different groupings. Experiments were performed on Discrete Fourier Transform (DFT), Discrete Cosine Transform (DCT), Discrete Sine Transform (DST) and Walsh Transform (WHT). All the Transform give an accuracy of more than 80% for the different groupings considered. Accuracy increases as the number of samples grouped is increased from 64 onwards. But for groupings more than 1024 the accuracy again starts decreasing. The results show that DST performs best. The maximum accuracy obtained for DST is 96% for a grouping of 1024 samples while taking the transform.

Keywords - Euclidean distance, Row mean, Speaker Identification, Speaker Recognition

19. Paper 31121041: Performance Evaluation of Space-Time Turbo Code Concatenated With Block Code MC-CDMA Systems (pp. 108-115)

Full Text: PDF

Lokesh Kumar Bansal, Department of Electronics & Comm. Engg., N.I.E.M., Mathura, India

Aditya Trivedi, Department of Information and Comm. Technology, ABV-IIITM, Gwalior, India

Abstract— In this paper, performance of a space-time turbo code (STTuC) in concatenation with space-time block code (STBC) in multi-carrier code-division multiple-access (MCCDMA) system with multi-path fading channel is considered. The performance in terms of bit error rate (BER) is evaluated through simulations. The corresponding BER of the concatenated STTuC-STBC-MC-CDMA system is compared with STTuC-MC-CDMA system and STBC-MC-CDMA system. The simulation results show that the STTuC-MCCDMA system performance is better the STBC-MC-CDMA system and it can be further improved by employing concatenation technique i.e. STTuC-STBC-MC-CDMA system.

Keywords-MMSE; Multi-path channel; MAP Decoder; MIMO; Space-time code; Space-time turbo-code; Space-time trellis-code; Viterbi Decoder

20. Paper 31121046: An Unsupervised Feature Selection Method Based On Genetic Algorithm (pp. 116-120)

Full Text: PDF

Nasrin Sheikhi, Amirmasoud Rahmani, Mehran Mohsenzadeh, Department of computer engineering, Islamic Azad University of Iran research and science branch, Ahvaz, Iran

Reza Veisisheikhrobat, National Iranian South Oil Company(NISOC), Ahvaz, Iran

Abstract— In this paper we describe a new unsupervised feature selection method for text clustering. In this method we introduce a new kind of features that we called multi term features. Multi-term feature is the combination of terms with different length. So we design a genetic algorithm to find the multi term features that have maximum discriminating power.

Keywords -multi term feature; discriminating power; genetic algorithm; fitness function

21. Paper 31121050: A PCA Based Feature Extraction Approach for the Qualitative Assessment of Human Spermatozoa (pp. 121-126)

Full Text: PDF

V. S. Abbiramy, Department of Computer Applications, Velammal Engineering College, Chennai, India

Dr. V. Shanthi, Department of Computer Applications, St. Joseph’s Engineering College, Chennai, India

Abstract— Feature extraction is often applied in machine learning to remove distracting variance from a large and complex dataset, so that downstream classifiers or regression estimators can perform better. The computational expense of subsequent data processing can be reduced with a lower dimensionality. Reducing data to two or three dimensions facilitates visualization and further analysis by domain experts. The data components (parameters) measured in computer assisted semen analysis have complicated correlations and their total number is also large. This paper presents Principal Component Analysis to decorrelate components, reduce dimensions and to extract relevant features for classification. It also compares the computation of Principal Component Analysis using the Covariance method and Correlation method. Covariance based Principal Component Analysis was found to be more efficient in reducing the dimensionality of the feature space.

Keywords- Covariance based PCA; Correlation based PCA; Dimensionality Reduction; Eigen Values; Eigen Vectors Feature Extraction; Principal Component Analysis.

22. Paper 31121053: Analysis of Error Metrics of Different Levels of Compression on Modified Haar Wavelet Transform (pp. 127-133)

Full Text: PDF

T. Arumuga Maria Devi, Assistant Professor,Centre for Information Technology and Engineering, Manonmaniam Sundaranar University, Tirunelveli . TamilNadu.

S. S. Vinsley, Student IEEE Member, Guest Lecturer, Manonamaniam Sundaranar University, Centre for Information Technology and Engg, Manonmaniam Sundaranar University, Tirunelveli. TamilNadu.

Abstract— Lossy compression techniques are more efficient in terms of storage and transmission needs. In the case of Lossy compression, image characteristics are usually preserved in the coefficients of the domain space in which the original image is transformed. For transforming the original image, a simple but efficient wavelet transform used for image compression is called Haar Wavelet Transform. The goal of this paper is to achieve high compression ratio in images using 2 D Haar Wavelet Trnasform by applying different compression thresholds for the wavelet coefficients and these results are obtained in fraction of seconds and thus to improve the quality of the reconstructed image ie., to arrive at an approximation of our original image. Another approach for lossy compression is, instead of transforming the whole image, to separately apply the same transformation to the regions of interest in which the image could be devided according to a predetermined characteristic. The Objective of the paper deals to get the coefficients is nearly closer to zero. More specifically, the aim of the thesis is to exploit the correlation characteristics of the wavelet coefficients as well as second order characteristics of images in the design of improved lossy compression systems for medical images. Here a modified simple but efficient calculation schema for Haar Wavelet Transform.

Index Terms—Haar Wavelet Transform – Linear Algebra Technique – Lossy Compression Technique – MRI

23. Paper 31121056: Information Security and Ethics in Educational Context: Propose a Conceptual Framework to Examine Their Impact (pp. 134-138)

Full Text: PDF

Hamed Taherdoost, Islamic Azad University, Islamshahr Branch, Department of Computer, Tehran, Iran

Meysam Namayandeh, Islamic Azad University, Islamshahr Branch, Department of Computer, Tehran, Iran

Neda Jalaliyoon, Islamic Azad University, Semnan Branch, Department of Management, Semnan, Iran

Abstract— Information security and ethics are viewed as major areas of interest by many academic researchers and industrial experts. They are defined as an all-encompassing term that refers to all activities needed to secure information and systems that supports it in order to facilitate its ethical use. In this research, the important parts of current studies introduced. To accomplish the goals of information security and ethics, suggested framework discussed from educational level to training phase in order to evaluate computer ethics and its social impacts. Using survey research, insight is provided regarding the extent to which and how university student have dealt with issues of computer ethics and to address the result of designed computer ethics framework on their future career and behavioral experience.

Keywords-component; information security; ethics; framework

. ---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

24. Paper 31121038: Finding Fuzzy Locally Frequent Itemsets (pp. 139-146)

Full Text: PDF

Fokrul Alom Mazarbhuiya, College of Computer Science, King Khalid University, Abha, Saudi Arabia

Md. Ekramul Hamid, College of Computer Science, King Khalid University, Abha, Saudi Arabia

Abstract— The problem of mining temporal association rules from temporal dataset is to find association between items that hold within certain time intervals but not throughout the dataset. This involves finding frequent sets that are frequent at certain time intervals and then association rules among the items present in the frequent sets. In fuzzy temporal datasets as the time of transaction is imprecise, we may find set of items that are frequent in certain fuzzy time intervals. We call these as fuzzy locally frequent sets and the corresponding associated association rules as fuzzy local association rules. These association rules cannot be discovered in the usual way because of fuzziness involved in temporal features. In this paper, we propose a modification to the well-known A-priori algorithm to compute fuzzy locally frequent sets. Finally we have shown manually with the help of an example that the algorithm works.

Keywords- Temporal Data mining, Fuzzy number, Fuzzy time-stamp, Core length of a fuzzy interval, Fuzzified interval

25. Paper 31121039: An Extensible Cloud Architecture Model for Heterogeneous Sensor Services (pp. 147-155)

Full Text: PDF

R.S. Ponmagal, Dept of CSE, Anna University of Technology, Tiruchirappalli, India

J. Raja, Dept of ECE, Anna University of Technology, Tiruchirappalli, India

Abstract— This paper aims to examine how the sensor information can be shared, through a new resource called “cloud”. The recent research issue in integrating Wireless sensor Networks with Cloud is to establish a faster communication link between the two. The wireless sensor networks are used to sense and collect information required. The sensor information is deployed into the cloud through the sensor profile for web services. The Sensor Profile for Web Services specifies a lightweight subset of the overall Web services protocol suite that is appropriate for network-connected sensors. Cloud generally offers resources on demand. Since wireless sensor networks are limited in their processing power, battery life and communication speed, cloud computing usually offers the opposite, which makes it attractive for long term observations, analysis and use in different kinds of environments. In this paper a model is presented, which combines the concept of wireless sensor networks with the cloud computing paradigm, and show how both can benefit from this combination. Sensor data access is thus moved from loosely managed system to a well managed cloud. The integration of sensor information into the cloud through the sensor as a service paradigm proves the faster communication establishment. The scalability of this approach seems to be unlimited, since wireless sensor networks operate independently, and are connected to the cloud computing environment through a scalable number of wireless sensor network communication gateways. The cloud computing environment itself offers a scalable infrastructure, which makes it very attractive. The main goal is to design a flexible architecture in which sensor network’s information can be accessed by applications efficiently.

Keywords- cloud, sensor profiles, web services, sensors, resources, information, scalability.

26. Paper 31121045: Computer Simulation tool for Learning Brownian Motion (pp. 156-158)

Full Text: PDF

Dr Anwar Pasha Abdul Gafoor Deshmukh

Lecturer, College of Computer and Information Technology, University of Tabuk , Tabuk., Saudi Arabia

Abstract— With advancement of computers and Internet, there has been an increasing trend in utilizing computers and Internet for teaching and Education. Advanced topics and High Tech experiments demand for lot of infrastructure. There are areas in living sciences and other subjects where the magnitude of information is so huge that it is more convenient to do the experiment by simulation using computers. The present work relates to development of computer based learning resource that can be used as an online teaching aid or an offline tool to study the Brownian motion in two dimensions. It is an interactive tool where the learner can change the parameters of interest to study the Brownian motion and actually see the effect by way of simulated graphics. Quantitative values of the parameters arising from the simulation study are also available to the learner. The Brownian motion is a phenomenon occurring at microscopic scale and thus actual study of the experiment requires real time monitoring of microscopic development and progress of the Brownian motion which is a tedious task and very difficult to implement in laboratory. To this effect, to carry out the experiment under different desired conditions, a computer based tool is developed that enables the learner to conduct experiment using simulation and see the results quantitatively. It is being uploaded on internet as an online e-learning material.

Keywords- Computer Simulation; CBT; Brownian Motion

27. Paper 31121052: Mobility Management Techniques To Improve QoS In Mobile Networks Using Intelligent Agent Decision Making Protocol (pp. 159-165)

Full Text: PDF

Selvan C, Department of Computer Science and Engineering Government College of Technology, Coimbatore, Tamil Nadu, India

Dr. R. Shanmugalakshmi, Department of Computer Science and Engineering, Government College of Technology, Coimbatore, Tamil Nadu, India

Abstract—Mobility Management (MM) is one of the major issues of Mobile networks that should be taken into account for providing Quality of Service (QoS) and to meet the subscribers demand (satisfaction). Mobility management techniques are divided into two types (i) Location Management (LM) and (ii) Handoff Management (HM). The LM is used for tracking where the subscribers are locate, and based on that permitting calls, Short Message Service (SMS) and other mobile phone services are delivered to them with the assistance of Intelligent Agent Decision Making Protocol (IADMP). The Redundant Update Remove Algorithm (RURA) which is used for reducing the updation between BSC and MSC. Enhanced Temporal Updation (ETU) reduces the location updates between Mobile Node (MN) and MSC using IADMP. To provide ubiquitous communication for subscribers without any break in the communication, HM protocols play main role in Mobile Networks. In HM process there are four protocols, (i) Double Threshold Protocol (DTP) (ii) Better Base Station Selection Protocol (BBSSP) using Relative Signal Strength (RSS) (iii) IADMP and (iv) Hybrid Decision Making Protocol (HDMP) are used. The Performances of these protocols are analysed. The HDMP and ETU provide QoS in Mobile Networks.

Keywords-component; Location Management; Handoff Management; Intelligent Agent; Enhanced Temporal Updation; RUR Algorithm; IADMP

28. Paper 31121060: Security Risks and Modern Cyber Security Technologies for Corporate Networks (pp. 166-170)

Full Text: PDF

Wajeb Gharibi, College of Computer Science and Information Systems, Jazan University, Jazan, Saudi Arabia.

Abdulrahman Mirza, Center of Excellence in Information Assurance (CoEIA), King Saud University, KSA.

Abstract—This article aims to highlight current trends on the market of corporate antivirus solutions. Brief overview of modern security threats that can destroy IT environment is provided as well as a typical structure and features of antivirus suits for corporate users presented on the market. The general requirements for corporate products are determined according to the last report from av-comparatives.org [1]. The detailed analysis of new features is provided based on an overview of products available on the market nowadays. At the end, an enumeration of modern trends in antivirus industry for corporate users completes this article. Finally, the main goal of this article is to stress an attention about new trends suggested by AV vendors in their solutions in order to protect customers against newest security threats.

Index Terms—Antivirus technologies, corporate security, corporate network, malicious software, protection, threats, trojan.

29. Paper 31121068: Analysis of Data Mining Visualization Techniques Using ICA AND SOM Concepts (pp. 171-180)

Full Text: PDF

K. S. Rathnamala, Research Scholar of Mother Teresa Women’s University, Kodaikanal

Dr. R. S. D. Wahida Banu, Professor& Head, Dept. of Electronics& Communication Engg., GCE.

Abstract - This research paper is about data mining (DM) and visualization methods using independent component analysis and self organizing map for gaining insight into multidimensional data. A new method is presented for an interactive visualization of cluster structures in a self-organizing Map. By using a contraction model, the regular grid of selforganizing map visualization is smoothly changed toward a presentation that shows better the proximities in the data space. A Novel Visual Data Mining method is proposed for investigating the reliability of estimates resulting from a Stochastic independent component analysis (ICA) algorithm. There are two algorithms presented in this paper that can be used in a general context. Fast ICA for independent binary sources is described. The model resembles the ordinary ICA model but the summation is replaced by the Boolean Operator OR and the multiplication by AND. A heuristic method for estimating the binary mixing matrix is also proposed. Furthermore, the differences on the results when using different objective function in the FastICA estimation algorithm is also discussed.

Keywords: Independent component analysis, Self organizing map, Vector quantization, patterns, Agglomerative hierarchical methods, Time series segmentation, Finding patterns by proximity, Clustering validity indices, Feature selection and weighing Fast ICA.

30. Paper 31121017: Mobile Agent Computing (pp. 181-187)

Full Text: PDF

Mrigank Rajya, Software Engineer, HCL Technologies Ltd. Gurgaon, India

Abstract - In a broad sense, an agent is any program that acts on behalf of a (human) user. A mobile agent then is a program which represents a user in a computer network, and is capable of migrating autonomously from node to node, to perform some computation on behalf of the user. In computer science, a mobile agent is a composition of computer software and data which is able to migrate (move) from one computer to another autonomously and continue its execution on the destination computer. Mobile Agent, namely, is a type of software agent, with the feature of autonomy, social ability, learning, and most important, mobility. Mobile agent is an agent that migrates from machine to machine in a heterogeneous network at times of its own choosing. An agent is “an independent software program which runs on behalf of a network user”. A mobile agent is a program which, once it is launched by a user, can travel from node to node autonomously, and can continue to function even if the user is disconnected from the network. Examples can be Personal assistant (mail filter, scheduling), Information agent (tactical picture agent), E-commerce agent (stock trader, bidder) and Recommendation agent (Firefly, Amazon.com).

Keywords: Mobile Agent (M.A), agent, paradigm, life cycle.

31. Paper 31121034: Map Reduce for DC4.5 and Ensemble Learning In Distributed Data Mining (pp.188-192)

Full Text: PDF

Dr. E. Chandra, Research Supervisor and Director, Department Of Computer Science, D J Academy for Managerial Excellence, Coimbatore, Tamilnadu, India.

P. Ajitha, Research Scholar and Assistant Professor, Department Of Computer Science, D J Academy for Managerial Excellence, Coimbatore, Tamilnadu, India

Abstract— MapReduce one of the distributed computing techniques is integrated with decision tree classifier C4.5 in the distributed environment and ensemble learning with its classifier. This paper proposes an algorithm to classify, predict data using MapReduce for DC4.5 with ensemble learning. Proposed algorithm increases the accuracy and scalability of the data. Noise handling in the decision trees with respect to the distributed data is also handled here.

Keywords C4.5, Distributed Decision Trees, MapReduce, Ensemble learning

32. Paper 31121058: A Novel E-Service for E-Government (pp. 193-200)

Full Text: PDF

A. M. Riad, Hazem M. El-Bakry, and Gamal H. El-Adl

Dept. of Information Systems, Faculty of Computer Science and Information Systems, Mansoura University, Mansoura, Egypt

Abstract — Egyptian e-government facilitates and introduces eservices for its partnerships such as citizens, businesses, employees and government itself. The combination of geographic information systems (GIS) as Egyptian new e-service with decision support systems (DSS) is used to help the ministry of finance. Our proposed e-service appears the important geographical criterions that affect the value of tax rates. The committee of tax rates determination for housing units used new e-service in order to reduce the time required to manually check all buildings in the country. So the estimation of the housing tax rates is based on the spatial data from the novel GIS e-service.

Keywords- E-government, E-services, GIS, GPS, Housing Tax Rates.