International Journal of Computer Science and Information Security

Vol. 12 No. 1 JAN 2014

Vol. 12 No. 1 JANUARY 2014 International Journal of Computer Science and Information Security

Publication JANUARY 2014, Volume 12 No. 1 (Download Full Journal) (Archive) (Download 2)

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 31121313: An Enhanced Multi-Pager Environment Support for Second Generation Microkernels (pp. 1-7)

Full Text: PDF

Yauhen Klimiankou

Department of Information Technologies Software, Belarusian State University of Informatics and Radioelectronics Minsk 220 113, Belarus

Abstract —The main objective of this paper is to present a mechanism of enhanced paging support for the second generation microkernels in the form of explicit support of multi-pager environment for the tasks running in the system. Proposed mechanism is based on the intra-kernel high granularity pagers assignments per virtual address space, which allow efficient and simple dispatching of page faults to the appropriate pagers. The paging is one of the major features of the virtual memory, which is extensively used by advanced operating systems to provide an illusion of elastic memory. Original and present second generation microkernels provide only limited, inflexible and unnatural support for paging. Furthermore, facilities provided by current solutions for multi-pager support on the runtime level introduce an overhead in terms of mode switches and thread context switches which can be significantly reduced. Limited paging support limits the attractiveness of the second generation microkernel based systems use in real-life applications, in which processes usually have concurrent servicing of multiple paging servers. The purpose of this paper is to present a facilities for the efficient and flexible support of multi-pager environments for the second generation microkernels. A comparison of the proposed solution to the present architecture L4 + L4Re has been made and overhead of the page fault handling critical path has been evaluated. Proposed solution is simple enough and provides a natural and flexible support of multi-pager environments for second generation microkernels in efficient way. It introduces a third less overhead in terms of the mode switches and thread context switches in comparison to the present L4 + L4Re solution implemented in the Fiasco.OC.

Index Terms—memory management, page fault, second generation microkernel, multi-pager environment

2. Paper 31121318: Model Performance Indicators ERP Systems (pp. 8-14)

Full Text: PDF

Setare Yaghubi, student, Department of computer, Zanjan Branch, Islamic Azad University, Zanjan, Iran

Nasser modiri, Assoc. Prof, Department of computer, Zanjan Branch, Islamic Azad University, Zanjan, Iran

Masoud Rafighi, PHD Student, Department of computer, Qom University, Qom, Iran

Abstract - Implementation process ERP is complex and expensive process. Typically always be faced with many failures. Successfully implemented in an organization has many challenges. Organizations in the deployment and success of the system depends on several factors. One of the key factors in the successful deployment of systems methodology is the implementation process. Methodology has several indicators for successful implementation of ERP systems, we have examined. And indicators for each of the methodologies have identified. The proposed method is also an important indicator of the success of security controls and indicators to be monitored and controlled.

Keywords: Methodologies Implementation, critical success factors, ERP, AIM, ASAP, Signature.

3. Paper 31121322: RFID Technology: Analytical Study using SWOT and STEEPLE Approach (pp. 15-17)

Full Text: PDF

Rana Ibrahim Alabdan, Information Systems Department, Majmaah University, Riyadh, Saudi Arabia

Abstract — The benefits of RFID technology cannot be denied and the new evolution in retails, supply chain management and companies when using this technology is really relevant and make the operation of production smoothie and easy. However, RFID also has some negative issues such as violation to the people’s privacy and violation to the data protection. Even though, these security issues RFID has changed the way dealing with products and people. Thus, let’s take this opportunity, improve the life, use new technology even if there is a little fair do not hesitate to take the benefit from every new technology that change our life to the best.

Keywords-component; RFID; IT technology; Networks; RFID issues; tags; SWOT Introduction

4. Paper 31121323: Two Phase K-Nearest Neighbors Approach (pp. 18-25)

Full Text: PDF

Siddhartha Kumar Arjaria, Deepak Singh Tomar, Devshri Roy

Department of computer science & Engg., Maulana Azad National Institute of Technology, Bhopal, (M.P.), India

Abstract — K-nearest neighbors approach is the popular algorithm for classification. The majority of votes of neighbors of testing sample decide the class of in K-nearest neighbors approach. It only utilizes the information stored in the first few samples while it considers the remaining samples unimportant. The classification result of K-nearest neighbors approach highly depends on the single criteria, due to this classifier many times produces the wrong result. The paper presents a novel idea to deal with the classification problem in two Phases. First phase deals with the extraction of useful information from the training space regarding the occurrence behavior of each training sample in the neighbor list of other training samples. This occurring behavior decides each training sample to be part of one of the three classes namely important, unimportant, and neutral. In the second phase, On the basis of this collected information the training samples in the neighbors of testing sample are rearranged by removing the unimportant samples. Now classification decision totally omitted the unimportant training samples and considers only the important & neutral class training samples. Algorithm is designed to provide the extra weights to the important samples on the basis of its position in neighbor list, it's occurrence frequency as a neighbors of other training samples and the number of training samples of that class used for training. Performance is tested on three database seven most frequent categories of Reuters-21578, four most frequent categories of RCV1, seven most frequent categories of TDT2 corpus. Our approach outperforms K-nearest neighbors approach in terms of F1 value in almost each case.

Keywords- K-nearest neighbors approach;Two Phase KNN;Classification;

5. Paper 31121327: Developing Extracting Association Rules System from Textual Documents (pp. 26-36)

Full Text: PDF

Arabi Keshk and Hany Mahgoub

Faculty of Computers and Information, Menoufia University, Shebin El-Kom, Egypt

Abstract — A new algorithm is proposed for generating association rules based on concepts and it used a data structure of hash table for the mining process. The mathematical formula of weighting schema is presented for labeling the documents automatically and its named fuzzy weighting schema. The experiments are applied on a collection of scientific documents that selected from MEDLINE for breast cancer treatments and side effects. The performance of the proposed system is compared with the previous Apriori-concept system for the execution time and the evaluation of the extracted association rules. The results show that the number of extracted association rules in the proposed system is always less than that in Apriori-concept system. Moreover, the execution time of proposed system is much better than Apriori-concept system in all cases.

Keywords- data mining; association rules; fuzzy system; apriori-concept system

6. Paper 30111336: A novel congestion control mechanism for Traffic management in Wireless Sensor Networks (pp. 37-41)

Full Text: PDF

Nasrin Azizi, Solmaz Abdollahi Zad

Department of Computer, College of Computer, Sardroud Branch, Islamic Azad University, Sardroud, Iran

Abstract - Due to the nature of wireless sensor networks the higher amount of traffic is observed when the monitored event takes place. Exactly at this instance, there is a higher probability of congestion appearance in the network. Congestion can cause missing packets, low energy efficiency, and long delay. Moreover, some applications, e.g. multimedia and image, need to transmit large volumes of data concurrently from several sensors. These applications have different delay and QoS requirements. Congestion problem is more urgent in such applications. Therefore congestion in WSNs needs to be controlled for high energy-efficiency, to prolong system lifetime, improve fairness, and improve quality of service in terms of throughput and packet loss ratio along with the packet delay. To achieve this objective, a novel congestion control protocol for traffic management is proposed in this paper. Proposed protocol can control congestion in the node and adjusts every upstream traffic rate with its node dynamic priority to mitigate congestion. Proposed protocol can broadcast traffic on the entire network fairly. Simulation results show that the performance of proposed protocol is more efficient than previous algorithms in terms of throughput.

Keywords-wireless sensor network; congestion mitigation; traffic distribution; throughput

7. Paper 31121308: Email Security Using Clustering Algorithms (pp. 42-48)

Full Text: PDF

Tarushi Sharma, M-Tech(Information Technology), CGC Landran Mohali, Punjab, India

Abstract — Recent use of email analysis and data mining of email contents has proven to be useful in some sensitive places like national security agency to detect threats and fraud determination from terrorists. Moreover, it has been proved to be helpful for decision making, future team co-ordination, fraud detection and tracing the behavior of an employee. Using different clustering algorithms, we can find out similar patterns in emails for fraud detection. In this paper, we demonstrate how the popular k-means clustering algorithm can be profitably modified to make use of this information.

Index Terms — Data mining, Email mining, Clustering algorithm, K-mean clustering algorithm, National Security Agency and Fraud Detection

8. Paper 31121309: Email Security Using Weka Tool Results Of K-Mean Clustering Algorithm (pp. 49-54)

Full Text: PDF

Tarushi Sharma, M-Tech(Information Technology), CGC Landran Mohali, Punjab,India

Abstract — Generally, data mining is the process of analyzing data from different perspectives and summarizing it into useful information. Data mining software is one of a number of analytical tools for analyzing data. It allows users to analyze data from many different dimensions or angles, categorize it, and summarize the relationships identified. Weka is a type of data mining tools. It is contain the many machine leaning algorithms. It provides the facility to classify our data through various algorithms. In this paper we are studying the various clustering algorithms. Cluster analysis or clustering is the task of assigning a set of objects into groups (called clusters) so that the objects in the same cluster are more similar to each other than to those in other clusters. The K-means algorithm is a popular data-clustering algorithm. However, one of its drawbacks is the requirement for the number of clusters, K, to be specified before the algorithm is applied. This paper first reviews existing methods for selecting the number of clusters for the algorithm. Our main aim to show the comparison of the different samples of data like we are using different Emails with similar text through different clustering algorithms of Weka and find out which parameter of Weka tool is effective for the users for data mining or email mining.

Keywords— Data mining algorithms, Weka tools, K-means algorithms, Clustering methods E-mail mining etc

9. Paper 311213699: Exploring Ground Water Possibility in Case Based Recommendation System using Honey Bee Optimization (pp. 55-64)

Full Text: PDF

Sheetal Jethi (1), Harsh Sadawarti (2)

(1) Ph.D Research Scholar, Punjab Technical University, Jalandhar, India

(2) Regional Institute of Management and Technology, Punjab, India

Abstract — Groundwater is a precious natural resource for the growth and development of human civilization on the surface of the earth and holding a key role on the economy of any country. But the groundwater level and resources decreases day by day due to increasing population and their daily demands. There is the need to find more possible resources of the groundwater as per the increasing human usage. In this paper, we have proposed a novel approach to detect the ground water potential using honey bees foraging metaphor and case based reasoning. Our algorithm finds out the ground water potentiality in terms of high, medium and low possibility based on the user’s query. The experts provided us with the case base having six attributes namely: landform, soil, lineament, geology, landuse, and slope. A stored case in the case base is the preselected combination of these attributes and a solution class as given by the expert. In nature, this metaphor is used to find the best nectar patch by the honey bees. In the similar way it is used in our algorithm to retrieve the most similar case to the user’s query from the case base. This metaphor is applied to the retrieval step of the CBR life cycle. The validation of the results is done by calculating the values of accuracy, specificity and sensitivity.

Keywords— Ground Water Detection, Honey Bees Foraging Metaphor, Cosine Similarity Function, Case based Recommendation System

Page updated

Google Sites

Report abuse