Vol. 9 No. 2 FEB 2011

Vol. 9 No. 2 February 2011 International Journal of Computer Science and Information Security

Publication February 2011, Volume 9 No. 2 (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 31011186: Query Data with Fuzzy Information in Object-Oriented Databases an Approach Interval Values (pp. 1-6)

Full Text: PDF

Doan Van Thang, Korea-VietNam Friendship Information Technology College, Department of Information systems, Faculty of Computer Science

Doan Van Ban, Institute of Information Technology, Academy Science and Technology of Viet Nam. Ha Noi City, Viet Nam Country

Abstract— In this paper, we propose methods of handling attributive values of object classes in object oriented database with fuzzy information and uncertainty based on quantitatively semantics based hedge algebraic. In this approach we consider to attributive values (as well as methods) object class is interval values and the interval values are converted into sub interval in [0, 1] respectively. That its the fuzziness of the elements in the hedge algebra is also sub interval in [0,1]. So, we present an algorithm allows the comparison of two sub interval [0,1] helping the requirements of the query data.

Keywords:

2. Paper 28021121: An Information System for controlling the well trajectory (pp. 7-9)

Full Text: PDF

Safarini Osama, IT Department, University of Tabuk, Tabuk, KSA

Abstract—: The well drilling process became very boring, requires a choice of the justified solution from a set possible. Because of major bulk received and treated data, originating vastness of problem situations. The relevant value thus has information supply of drilling process for a possibility of effective human-engine acceptance of a solution. The complexity of operations at boring inclined, horizontal, sectional, on shelf of ocean - all this requires adequate reacting at operating (on-Line) control by well-studying process. The realization of computer- Aided control systems in many aspects depends on progress the applicable computer for conducting conversation in an interactive system of automated control.

Keywords- Decision-Making, drilling process, inclinometric data, automated control, Information System, well trajectory, azimuth and zenith angles, Plane Projection.

3. Paper 28011116: Behavioral Analysis on IPv4 Malware in both IPv4 and IPv6 Network Environment (pp. 10-15)

Full Text: PDF

Zulkiflee M., Faizal M.A., Mohd Fairus I. O., Nur Azman A., Shahrin S.

Faculty of Information and Communication Technology, Universiti Teknikal Malaysia Melaka (UTeM), Malacca, Malaysia

Abstract - Malware is become an epidemic in computer net-work nowadays. Malware attacks are a significant threat to networks. A conducted survey shows malware attacks may result a huge financial impact. This scenario has become worse when users are migrating to a new environment which is Internet Protocol Version 6. In this paper, a real Nimda worm was released on to further understand the worm behavior in real network traffic. A controlled environment of both IPv4 and IPv6 network were deployed as a testbed for this study. The result between these two scenarios will be analyzed and discussed further in term of the worm behavior. The experiment result shows that even IPv4 malware still can infect the IPv6 network environment without any modification. New detection techniques need to be proposed to remedy this problem swiftly.

Keywords- IPv6, malware, IDS.

4. Paper 20011101: Molecular Dynamics Simulation on Protein Using Gromacs (pp. 16-20)

Full Text: PDF

A.D. Astuti, R. Refianti, A.B. Mutiara,

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

Abstract— Development of computer technology in chemistry brings many applications of chemistry, not only the application to visualize the structure of molecule but also to molecular dynamics simulation. One of them is Gromacs. Gromacs is an example of molecular dynamics application developed by Groningen University. This application is a non-commercial and able to work in the operating system Linux. The main ability of Gromacs is to perform molecular dynamics simulation and minimization energy. In this paper, the author discusses about how to work Gromacs in molecular dynamics simulation. In the molecular dynamics simulation, Gromacs does not work alone. Gromacs interacts with Pymol and Grace. Pymol is an application to visualize molecule structure and Grace is an application in Linux to display graphs. Both applications will support analysis of molecular dynamics simulation.

Keywords-molecular dynamics; Gromac; Pymol; Grace

5. Paper 23011108: Examining the Linkage between Information Security and End-user Trust (pp. 21-31)

Full Text: PDF

Ioannis Koskosas, Department of Information Technologies and Telecommunications,University of Western Macedonia, and Department of Finance, Technological, Educational Institute of Western Macedonia, KOZANI, 50100, Greece

Konstantinos Kakoulidis, Department of Finance, Technological Educational Institute of Western Macedonia, KOZANI, 50100, Greece

Christos Siomos, SY.F.FA.S.DY.M (Pharmaceuticals of Western Macedonia), KOZANI, 50100, Greece

Abstract- The main purpose of information security is to protect information and specifically, the integrity, confidentiality, and availability of data through an organization’s network and telecommunication channels. Although information security is critical for organizations to survive, a number of studies continue to report incidents of critical information loss. To this end, there is still an increasing interest to study information security from a non-technical perspective. In doing so, this research focuses on the linkage between information security and end-user trust as a way to better understand and more efficiently manipulate the information security management process. That is, manipulating more effectively information security among end-users. Achieving the required level of information security within organizations usually requires security awareness and control but also a better understanding of end-user behavior in which security measures are tailored, too. In effect, organizations may have a clearer insight into how to behave more effectively to such security measures.

Keywords- Information Security, End-user Trust, Information Technology

6. Paper 28011115: A New Approach of Probabilistic Cellular Automata Using Vector Quantization Learning for Predicting Hot Mudflow Spreading Area (pp. 32-36)

Full Text: PDF

Kohei Arai, Department of Information Science, Saga University, Saga, Japan

Achmad Basuki, 1) Department of Information Science, Saga University, 2) Electronic Engineering Polytechnic Institute of Surabaya (EEPIS), Indonesia

Abstract— In this letter, we propose a Cellular Automata using Vector Quantization Learning for predicting hot mudflow spreading area. The purpose of this study is to determine inundated area in the future. Cellular Automata is an easy approach to describe the complex states of hot mudflow disaster that have some characteristics such as occurring on the urban area, levees and surface thermal changing. Furthermore, the Vector Quantization learning determines mass transport in the surrounding area in accordance with equilibrium state using clustering of landslide. Evaluating of prediction result uses ASTER/DEM and SPOT/HRV imaging. Comparison study shows that this approach obtains better results to show inundated area in this disaster.

Keywords: Probabilistic cellular automata, vector quantization, hot mudflow spreading, prediction, mass transport Introduction

7. Paper 31011177: A Linux Kernel Module for Locking Down Applications on Linux Clients (pp. 37-40)

Full Text: PDF

Noureldien A. Noureldien, Dept. of Computer Science, University of Science and Technology, Khartoum, Sudan

Abu-Bakr A. Abdulgadir, Dept. of Computer Engineering, University of Gezira, Madani, Sudan

Abstract— Preventing the installation and execution of unauthorized software should be a high priority for any organization. Allowing users to install and execute unauthorized software can expose an organization to a variety of security risks. In this paper we present a graylisting solution to control application execution on Linux clients using a loadable kernel module. Our developed kernel based solution, Locking Applications on Linux Clients or LALC is a new Linux subsystem which adds a graylisting application lockdown capability to Linux kernel. The restriction policy applied by LALC to specific client is based on the preconfigured security level of the client’s group and on the application the client desire to execute or to install. LALC is flexible enough to support the business needs as well as new applications and new versions of existing applications. And it is so secure that no end user can circumvent its configuration.

Keywords-Application Lockdown; Linux Kernel Module; Restriction Policy; Whitelisting; Blacklisting; Graylisting

8. Paper 30011141: Multiresolution Wavelet And Locally Weighted Projection Regression Method For Surface Roughness Measurements (pp. 41-46)

Full Text: PDF

Chandra Rao Madane, Research Scholar, Vinayaka Missions University, Salem, Tamilnadu,

Dr. S. Purushothaman, Principal , Sun College of Engineering and Technology, Sun Nagar, Erachakulum, Kanyakumari district-629902

Abstract--This paper presents the benefits of using coiflet wavelet for feature extraction from the surface roughness image. The features extracted are learnt by the Locally weighted projection regression network (LWPR) method. The image captured through Charge coupled device (CCD) camera undergoes preprocessing to remove noise and enhance the quality of image to make the details of the pixels more clear. The image is decomposed by using coiflet wavelet. Four level of decomposition is done to obtain detailed information, Entropy measure is applied and subsequently Locally weighted projection regression network method (LWPR) is used for training the entropy calculated. The target values labeled are with surface roughness within the limits or not. The values are trained using LWPR and a set of final weights are obtained. Using this final weight values, different portion of the image is analyzed to verify, if the roughness is within the limit or not

Keywords- Locally weighted projection regression network method (LWPR), discrete wavelet (DWT)

9. Paper 28011122: PIFS Code Base for Biometric Palmprint Verification (pp. 47-52)

Full Text: PDF

I Ketut Gede Darma Putra, Departement of Electrical Engineering, Faculty of Engineering, Udayana University, Bukit Jimbaran, Bali - Indonesia

Abstract — This paper proposes a new technique to extract the palmprint features based on some fractal codes. The palmprint features representation is formed based on position of range blocks and direction between the position of range and domain blocks of fractal codes. Each palmprint representation is divided into a set n blocks and the mean value of each block are used to form the feature vector. The normalized correlation metrics are used to measure the degree of similarity of two feature vectors of palmprint images. We collected 1050 palmprint images, 5 samples from each of 210 persons. Experiment results show that our proposed method can achieve an acceptable accuracy rate with FRR = 1.754, and FAR= 0.699.

Keyword; biometrics, fractal codes, fractal dimension, feature extraction, palmprint recognition

10. Paper 30011125: Breast Contour Extraction and Pectoral Muscle Segmentation in Digital Mammograms (pp. 53-59)

Full Text: PDF

Arun Kumar M.N, Research Scholar, Department of Electronics and Communication Engineering, P.E.S. College of Engneering, Mandya, India

H.S. Sheshadri, Department of Electronics and Communication Engineering, P.E.S. College of Enginering, Mandya, India

Abstract— Breast cancer is one of the major causes of fatality among women aged above 40. Digital mammography is used by radiologists for analysis and interpretation of cancer. Visual reading and interpretation of mammograms is a very demanding and expensive job. Even well-trained experts may have an interobserve variation rate of 65-75 percent. Extraction of the breast contour and pectoral muscle segmentation is necessary in order to limit the search for abnormalities by Computer Aided Diagnosis (CAD). A new technique for breast border extraction and pectoral muscle segmentation is explored in this paper. The technique is applied to 250 MIAS mammograms. This method has given about 98% in segmenting the pectoral muscle.

Keywords –Image Processing, mammography, morphology, filter, edge detection.

11. Paper 30011126: Improved Shape Content Based Image Retrieval Using Multilevel Block Truncation Coding (pp. 60-64)

Full Text: PDF

Dr. H. B. Kekre, Sudeep D. Thepade, Miti Kakaiya, Priyadarshini Mukherjee, Satyajit Singh, Shobhit Wadhwa

Computer Engineering Department, MPSTME, SVKM’s NMIMS (Deemed-to-be University), Mumbai, India

Abstract— This paper presents improved content based image retrieval (CBIR) techniques based on multilevel Block Truncation Coding (BTC) using multiple threshold values. Block Truncation Coding based feature is one of the CBIR methods proposed using shape features of image. The shape averaging methods used here are BTC Level – 1, BTC Level – 2, BTC Level – 3 and BTC Level – 4. Here the feature vector size per image is greatly reduced by using mean of each plane and finding out the threshold value. Then divide each plane using the threshold value. In order to find out the performance of the algorithm, shape averaging is applied to calculate precision and recall values. Instead of using all pixel data of image as feature vector for image retrieval these six, twelve, twenty – four and forty – eight feature vectors for BTC Level – 1, Level – 2, Level – 3 and Level – 4 respectively, can be used. This results in better performance. The proposed CBIR techniques are tested on generic image database having 1000 images spread across 11 categories. For each proposed CBIR technique 55 queries (5 per category) are fired on the generic image database To compare the performance of image retrieval techniques average precision and recall are computed of all queries. The results have shown the performance improvement (higher precision and recall values) with proposed methods compared to BTC Level-1.

Keywords- Content Based Image Retrieval (CBIR), BTC Level-1, BTC Level-2, BTC Level-3, BTC Level - 4.

12. Paper 30011127: An Enhanced Time Space Priority Scheme to Manage QoS for Multimedia Flows transmitted to an end user in HSDPA Network (pp. 65-69)

Full Text: PDF

Mohamed HANINI (1,4), Abdelali EL BOUCHTI (1,4), Abdelkrim HAQIQ (1,4) , Amine BERQIA (2,3,4)

(1) Computer, Networks, Mobility and Modeling laboratory, Department of Mathematics and Computer, FST, Hassan 1st University, Settat, Morocco

(2) ENSIAS, Mohammed V Souissi University, Rabat, Morocco

(3) Universiy Algarve, LG, Portugal

(4) e-NGN Research group, Africa and Middle East

Abstract— When different type of packets with different needs of Quality of Service (QoS) requirements share the same network resources, it became important to use queue management and scheduling schemes in order to maintain perceived quality at the end users at an acceptable level. Many schemes have been studied in the literature, these schemes use time priority (to maintain QoS for Real Time (RT) packets) and/or space priority (to maintain QoS for Non Real Time (NRT) packets). In this paper, we study and show the drawback of a combined time and space priority (TSP) scheme used to manage QoS for RT and NRT packets intended for an end user in High Speed Downlink Packet Access (HSDPA) cell, and we propose an enhanced scheme (Enhanced Basic-TSP scheme) to improve QoS relatively to the RT packets, and to exploit efficiently the network resources. A mathematical model for the EB-TSP scheme is done, and numerical results show the positive impact of this scheme.

Keywords: HSDPA; QoS; Queuing; Scheduling; RT and NRT packets; Markov Chain.

13. Paper 31011138: HS-MSA: New Algorithm Based on Meta-heuristic Harmony Search for Solving Multiple Sequence Alignment (pp. 70-85)

Full Text: PDF

Mubarak S. Mohsen, School of Computer Sciences, Universiti Sains Malaysia, Penang, Malaysia,

Rosni Abdullah, School of Computer Sciences, Universiti Sains Malaysia, Penang, Malaysia

Abstract— Aligning multiple biological sequences such as in protein or DNA/RNA is a fundamental task in bioinformatics and sequence analysis. In the functional, structural and evolutionary studies of sequence data the role of multiple sequence alignment (MSA) cannot be denied. It is imperative that there is accurate alignment when predicting the RNA structure. MSA is a major bioinformatics challenge as it is NP-complete. In addition, the lack of a reliable scoring method makes it harder to align the sequences and evaluate the alignment outcomes. Scalability, biological accuracy, and computational complexity must be taken into consideration when solving MSA problem. The harmony search algorithm is a recent meta-heuristic method which has been successfully applied to a number of optimization problems. In this paper, an adapted harmony search algorithm (HS-MSA) methodology is proposed to solve MSA problem. In addition, a hybrid method of finding the conserved regions using the Divide-and-Conquer (DAC) method is proposed to reduce the search space. The proposed method (HS-MSA) is extended to a parallel approach in order to exploit the benefits of the multi-core and GPU system so as to reduce computational complexity and time.

Keyword: RNA, Multiple sequence alignment, Harmony search algorithm.

14. Paper 31011139: A New Approach to Model Reference Adaptive Control using Fuzzy Logic Controller for Nonlinear Systems (pp. 86-93)

Full Text: PDF

R. Prakash, Department of Electrical and Electrnics Engineering, Muthayammal Engineering College, Rasipuram, Tamilnadu, India.

R. Anita, Department of Electrical and Electrnics Engineering, Institute of Road and Transport Technology, Erode, Tamilnadu, India.

Abstract— The aim of this paper is to design a fuzzy logic controller- based model reference adaptive intelligent controller. It consists of fuzzy logic controller along with a conventional Model Reference Adaptive Control (MRAC). The idea is to control the plant by conventional model reference adaptive controller with a suitable single reference model, and at the same time control the plant by fuzzy logic controller. In the conventional MRAC scheme, the controller is designed to realize plant output converges to reference model output based on the plant which is linear. This scheme is for controlling linear plant effectively with unknown parameters. However, using MRAC to control the nonlinear system at real time is difficult. In this paper, it is proposed to incorporate a fuzzy logic controller (FLC) in MRAC to overcome the problem. The control input is given by the sum of the output of conventional MRAC and the output of fuzzy logic controller. The rules for the fuzzy logic controller are obtained from the conventional PI controller. The proposed fuzzy logic controller-based Model Reference Adaptive controller can significantly improve the system’s behavior and force the system to follow the reference model and minimize the error between the model and plant output.

Keywords-Model Reference Adaptive Controller (MRAC), Fuzzy Logic Controller (FLC), Proportional-Integral (PI) controller

15. Paper 31011142: Routing Approach with Immediate Awareness of Adaptive Path While Minimizing the Number of Hops and Maintaining Connectivity of Mobile Terminals Which Move from One to the Others (pp. 94-101)

Full Text: PDF

Kohei Arai, Department of Information Science, Faculty of Science and Engineering, Saga University, Saga, Japan

Lipur Sugiyanta, Department of Electrical Engineering, Faculty of Engineering, State University of Jakarta, Jakarta, Indonesia

Abstract— Wireless Ad-hoc Network (MANET) is a special kind of network, where all of the nodes move in time. The topology of the network changes as the nodes are in the proximity of each other. MANET is generally self-configuring no stable infrastructure takes a place, where each node should help relaying packets of neighboring nodes using multi-hop routing mechanism. This mechanism is needed to reach far destination nodes to solve problem of dead communication. This multiple traffic "hops" within a wireless mesh network caused dilemma. Network that contain multiple hops become increasingly vulnerable to problems such as energy degradation and rapid increasing of overhead packets. In recent years, many routing protocols have been suggested to communicate between mobile nodes. One proposed routing approach is to use multiple paths and transmit clone of the packets on each path (i.e., path redundancy). Another more efficient routing protocol is to selective path redundancy from the multiple paths and sends packets on appropriate path. It can improve delivery efficiency and cut down network overhead, although it also increases processing delays on each layer. This paper provides a generic routing framework that immediately adapts the broken of established main route. The fresh generated route search process is taking place immediately if topology changing is initialized while data is being transmitted. This framework maintains the route paths which consist of selected active next neighbor nodes to participate in the main route. At the time which the main route is broken, the data transmission starts immediately thus data is transmitted continuously through the new route and the broken route is recovered by the route maintenance process. We conduct extensive simulation studies to shows that proposed routing protocol provides the backup route at the time when the main route is loss and analyzed the behavior of packets transmission. Using the framework, the average of successfully generated data transmission at various hops is kept 4.5% higher than the other network without implemented it with about 22% of overhead packets increase. Related with average network speed, the proposed protocol has successfully improved the successful data transmission 10.94% higher (at average network speed between 10 and 40 km/h). In the future research, we will extend this framework in wide area of wireless network and compare it with other multipath routing protocols.

Keywords: Multi-hop; route path; connectivity; metric

16. Paper 31011154: Mining Maximal Dense Intervals from Temporal Interval Data (pp. 102-107)

Full Text: PDF

F. A. Mazarbhuiya, Dept. of Computer Science, College of Computer Science, King Khalid University, Abha Saudi Arabia

M. A. Khaleel, Dept. of Computer Science, College of Computer Science, King Khalid University, Abha Saudi Arabia

A. K. Mahanta, Department of Computer Science, Gauhati University, India

H. K. Baruah, Department of Statistics, Gauhati University, India

Abstract- Some real life data are associated with duration of events instead of point events. The most common example of such data is data of cellular industry where each transaction is associated with a time interval. Mining maximal fuzzy intervals from such data allows the user to group the transactions with similar behavior together. Earlier works were devoted to mining frequent as well as maximal frequent non-fuzzy intervals. We propose here a method of mining maximal dense fuzzy intervals where density of an interval quite similar to the frequency of an interval.

Keywords- Frequent intervals, Maximal frequent intervals, Density of a fuzzy interval, Minimum density, Contribution (vote) of a transaction on a fuzzy interval, join of two fuzzy intervals.

17. Paper 31011156: Image Processing: The Comparison of the Edge Detection Algorithms for Images in Matlab (pp. 108-112)

Full Text: PDF

Ehsan Azimirad, Department of electrical and computer engineering, Tarbiat Moallem University of Sabzevar, Sabzevar, Iran

Javad Haddadnia, Department of electrical and computer engineering, Faculty of Electrical Collage, Tarbiat Moallem University of Sabzevar, Sabzevar, Iran

Abstract— Edge detection is the first step in image segmentation. Image Segmentation is the process of partitioning a digital image into multiple regions or sets of pixels. Edge detection is one of the most frequently used techniques in digital image processing. The goal of edge detection is to locate the pixels in the image that correspond to the edges of the objects seen in the image. Filtering, Enhancement and Detection are three steps of Edge detection. Images are often corrupted by random variations in intensity values, called noise. Some common types of noise are salt and pepper noise, impulse noise and Gaussian noise. However, there is a trade-off between edge strength and noise reduction. More filtering to reduce noise results in a loss of edge strength. In order to facilitate the detection of edges, it is essential to determine changes in intensity in the neighborhood of a point. Enhancement emphasizes pixels where there is a significant change in local intensity values and is usually performed by computing the gradient magnitude. Many points in an image have a nonzero value for the gradient, and not all of these points are edges for a particular application. Therefore, some method should be used to determine which points are edge points. Four most frequently used edge detection methods are used for comparison. These are: Roberts Edge Detection, Sobel Edge Detection, Prewitt Edge Detection and Canny Edge Detection. One the other method in edge detection is spatial filtering. This Paper represent a special mask for spatial filtering and compare throughput the standard edge detection algorithms (Sobel, Canny, Prewit & Roberts) with the spatial filtering.

Keywords- Spatial Filtering, Median Filter, Edge Detection, Image Segmentation.

18. Paper 31011157: Improving Cathodic Protection System using SMS-based Notification (pp. 113-117)

Full Text: PDF

Mohd Hilmi Hasan, Computer and Information Sciences Department, Universiti Teknologi PETRONAS, Bandar Seri Iskandar, Tronoh, Malaysia

Nur Hanis Abdul Hamid, Computer and Information Sciences Department, Universiti Teknologi PETRONAS, Bandar Seri Iskandar, Tronoh, Malaysia

Abstract— Mobile service has produced significant impact in various industries. It has also gained growing demands for not only in telecommunication sector, but also numerous other sectors such as banking, business, entertainment, education and many others. The objective of this paper is to present yet another mobile system development to enhance current cathodic protection (CP) system. The developed system is able to send notification to technicians via SMS if there is any fault occurs in gas pipeline. The system has been developed in three-tier architecture and tested with functional testing. It is connected with CP system which functions to monitor CP measurements upon gas pipeline. If there is any fault detected by CP system, it will send instruction to the developed system, which will then invoke SMS notification delivery to technicians. The system has successfully been developed and believed can improve current CP system that requires human to manually perform the monitoring process. This study implies effectiveness and time saving as responsible personnel or technicians will be notified of any faults anytime and anywhere through mobile phones. For future work, it is recommended that the system will also be equipped with proactive notification delivery in which technicians will be notified if any faults are expected to occur.

Keywords-SMS;notification system; SMS-based system; cathodic protection

19. Paper 31011158: Content Based Image Retrieval using Dominant Color and Texture features (pp. 118-123)

Full Text: PDF

M. Babu Rao (1), Dr. B. Prabhakara Rao (2), Dr. A. Govardhan (3)

(1) Associate professor, CSE department, Gudlavalleru Engineering College, Gudlavalleru, A.P, India

(2) Professor&Director of Evaluation, JNTUK, Kakinada, A.P, India

(3) Professor&Principal,JNTUH college of Engineering, Jagtial,A.P,India

Abstract— Nowadays people are interested in using digital images. So the size of the image database is increasing enormously. Lot of interest is paid to find images in the database. There is a great need for developing an efficient technique for finding the images. In order to find an image, image has to be represented with certain features. Color and texture are two important visual features of an image. In this paper we propose an efficient image retrieval technique which uses dominant color and texture features of an image. An image is uniformly divided into 8 coarse partitions as a first step. After the above coarse partition, the centroid of each partition (“color Bin” in MPEG-7) is selected as its dominant color. Texture of an image is obtained by using Gray Level Co-occurrence Matrix (GLCM). Color and texture features are normalized. Weighted Euclidean distance of color and texture features is used in retrieving the similar images. The efficiency of the method is demonstrated with the results.

Keywords- Image retrieval, dominant color, Gray level cooccurrence matrix.

20. Paper 31011159: An Improved Multiperceptron Neural Network Model To Classify Software Defects (pp. 124-128)

Full Text: PDF

M.V.P. Chandra Sekhara Rao, Department of CSE,R.V.R. &J.C. College of Engineering, ANU, GUNTUR, INDIA

Aparna Chaparala, Department of CSE,R.V.R. &J.C. College of Engineering, ANU, GUNTUR, INDIA

Dr. B. Raveendra Babu, Department of CSE,R.V.R. &J.C. College of Engineering, ANU, GUNTUR, INDIA

Dr. A. Damodaram, JNTU, CSE Department, JNTU College of Engineering, Kukatpally, Hyderabad, INDIA

Abstract: Predicting software defects in modules not only helps in maintaining legacy systems but also helps the software development process and ensures higher reliability. Advantage includes planning of resources for the projects and minimization of budget. Research has been carried out using statistical methodology and machine learning techniques which are generic in nature. The dependability on legacy Software systems to meet current demanding requirements is a major challenge for any IT administrator and estimation of costs to maintain the same is a huge challenge. In this paper, it is proposed to modify the existing multi layer perceptron Neural Network which is a popular supervised classification algorithm to predict defects in a given module based on the available software metrics.

Keywords— Legacy software, Software metrics, Software reliability, Classification, Multilayer Perceptron Neural network, Fault-proneness.

21. Paper 31011160: An Interactive Visualization Methodology For Association Rules (pp. 129-135)

Full Text: PDF

Mohammad Kamran, Research Scholar, Integral University, Kursi Road, Lucknow, India

Dr. S. Qamar Abbas, Professor, Ambalika Institute of Technology & Management, Lucknow, India

Dr. Mohammad Rizwan Baig, Associate Professor, Department of Information Technology, Integral University, Lucknow, India

Abstract- The task of the knowledge discovery and data mining process is to extract knowledge from data such that the resulting knowledge is useful in a given application. Obviously, only the user can determine whether the resulting knowledge satisfies this requirement. Moreover, what one user may find useful is not necessarily useful to another user. Visual data mining tackles the data mining tasks from this perspective enabling human involvement and incorporating the perceptivity of humans. The objective of this paper is to present the students performance through visualization mining method on data coming from educational institute. Such method together with the novel visualization technique described here allows the analyst to explore data and view significant differences among performance values of students. The results are immediately presented in a graphical form and the user is allowed to change settings in order to allow him or her to iteratively explore the data and find some useful knowledge.

Keywords:

22. Paper 31011161: Video Delivery based on Multi-Constraint Genetic and Tabu Search Algorithms (pp. 136-140)

Full Text: PDF

Nibras Abdullah, Mahmoud Baklizi, Ola Al-wesabi, Ali Abdulqader, Sureswaran Ramadass, Sima Ahmadpour

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

Abstract— The rapid growth of wireless communication and networking protocols, such as H802.11 and cellular mobile networks, is bringing video into our lives anytime and anywhere on any device. The video delivery over a wireless network faces several challenges going forward such as limitation, bandwidth variation, and high error rate so on. This paper proposed a new approach to improve the performance of video delivery, called Video Delivery based on Multi-Constraint Genetic and Tabu Search algorithms. In this paper, GA is used to find the faceable paths and Tabu search is used to select the best path from those paths that help to enhance the bandwidth delay and to improve the packet loss for wireless video content delivery.

Keywords-; GA, Tabu Search, Multi-hop network, and Video delivery.

23. Paper 31011166: An Efficient Hybrid Honeypot Framework for Improving Network Security (pp. 141-149)

Full Text: PDF

Omid Mahdi Ebadati E., Dept. of Computer Science, Hamdard University, New Delhi, India

Harleen Kaur, Dept. of Computer Science, Hamdard University, New Delhi, India

M. Afshar Alam, Dept. of Computer Science, Hamdard University, New Delhi, India

Abstract– Honeypots provide a system that can lure the attackers and hackers and response to various security frameworks to control the globe and its environment and examine and analysis network activities. We try to employ and develop a honeypot framework to propose a hybrid approach that improves the current security.In this paper, we proposed hybrid honeypots based network assuming initiative and enterprise security scheme strategies. The proposed model has more advantages that can response accurately and swiftly to unknown attacks and lifetime safer for the network security.

Keywords-Intrusion Detection System; User Datagram Protocol; Simple Mail Transfer Protocol; De-Militarized Zone; Secure Shell; Secure Sockets Layer; Internet Protocol Security; Network Traffic Monitoring; Network Address Translation; Dynamic Host Configuration Protocol

24. Paper 31011171: Optimization of ACC using Soft Computing Technique (pp. 150-154)

Full Text: PDF

S.Paul Sathiyan, EEE Department, Karunya University, Coimbatore, India

A.Wisemin Lins, EEE Department, Karunya University, Coimbatore, India

Dr. S. Suresh Kumar, EEE Department, Karunya University, Coimbatore, India

Abstract— The important feature of the Adaptive Cruise Control (ACC) system is the ability to maintain a proper inter-vehicle gap based on the speed of leading vehicle and the desired distance. Adaptive Cruise Control operates in two modes (i) Velocity Control mode, (ii) Distance Control mode. ACC acts like a conventional Cruise Controller (CC) under velocity control mode. In the case of the distance control mode, the speed of the host vehicle is reduced according to the surrounding environment to maintain the safe distance between the leading vehicle and the host vehicle. 25 rules have been used in Fuzzy logic Controller (FLC) with the knowledge base of the system. The inputs of the FLC are distance error and the speed error. The host vehicle adapts to the lead vehicle speed changes and tries to maintain a proper distance between them. The performance of the FLC based ACC is improved by Genetic Algorithm to tune the fuzzy rule base. Genetic Programming is used to select the best rule out of the 25 for a corresponding input. The result showed a better improvement over the Fuzzy Controlled System.

Keywords - Adaptive Cruise Control; Genetic Algorithm; Fuzzy Logic Control

25. Paper 31011174: A Fuzzy Approach to Prevent Headlight Glare (pp. 155-161)

Full Text: PDF

Mrs. Niraimathi. S, P.G.Department of computer applications, N.G.M College, Pollachi-642001, TamilNadu, India

Dr. M. Arthanari, Director, Bharathidasan School of computer applications, Ellispettai-638116, TamilNadu, India

Mr. M. Sivakumar, Doctoral Research Scholar, Anna University, Coimbatore, TamilNadu, India

Abstract: This paper proposes a fuzzy rule based design approach to prevent the Headlight glare emitted by the oncoming vehicles on the Highways. This gradually reduces accidents on the Highways as the driver of the oncoming vehicle is put on a comfortable zone which might otherwise blind the oncoming driver’s visibility. In the conventional vehicles the illumination is adjusted manually by the driver. This fuzzy based approach has the fuzzy sensor and the controller embedded inside the windshield or fit on to it, generates ambient illumination to the oncoming driver, there by not ruining the vision of the driver during night. This setup has to be embedded on to all the vehicles, so that it prevents the happening of accidents. Fuzzy sensor and the controller makes use of the fuzzy rules. The light intensity emitted by the oncoming vehicle received by the fuzzy sensor, is fuzzified using triangular membership function and checked for the tolerance limit. If not of acceptable limit; the fuzzy sensor forwards it to the fuzzy controller which converts the light intensity to an ambient light source thereby defuzzifying the output.

Keywords- Fuzzy logic; fuzzy rules; fuzzy sensor; fuzzy controllers; fuzzification; defuzzification; Headlight glare

26. Paper 31011176: Web-Object Rank Algorithm For Efficient Information Computing (pp. 162-167)

Full Text: PDF

Dr. Pushpa R. Suri, Department of Computer Science and Applications, Kurukshetra University, Kurukshetra, Haryana- 136119, India.

Harmunish Taneja, Department of Information Technology, Maharishi Markendeshwar University, Mullana, Haryana- 133203, India

Abstract - In recent years there has been considerable interest in analyzing relative trust level of the web objects. As the web contain facts and the assumptions on the global scale resulting on various criterions for trusting web page. In this paper an algorithm is proposed which assigns a rank to every web object like a requested document on the web that specify the quality of that object or the relative level of trust one can make on that web page. It is used for object level information extraction for ranking search results and is implemented in C++. In this paper the behavior of object rank for different values of moister factor in a domain is analyzed. The results emphasize that the moister factor can be useful in rank computation and further explore more web pages in alignment with the user’s requirements.

Keywords- Random Surfer Model, Information Computing, Web Objects, Information Retrieval System, Web Graph, Ranking, Object Rank.

27. Paper 31011179: Concurrency Control In CAD Using Functional Back Propagation Neural Network (pp. 168-174)

Full Text: PDF

A. Muthukumaravel, Research Scholar, Department of MCA, Vels university, Chennai-600117

Dr. S. Purushothaman, Principal, Sun College of Engineering and Technology, Sun Nagar, Erachakulum, Kanyakumari District-629902, India

Dr. A. Jothi, Dean, School of Computing Sciences, Vels university, Chennai-600117, India

Abstract-- This paper presents artificial neural network method using functional back propagation algorithm (FUBPA) for implementing concurrency Control while developing dial of a fork using Autodesk inventor 2008. Initially, the various parts are decided and the sequence in which they have to be drawn. While implementing concurrency control, this work ensures that associated parts cannot be accessed by more than one person due to locking. The FUBPA learns the objects and the type of transactions to be done based on which node in the output layer of the network exceeds a threshold value. Learning stops once all the objects are exposed to FUBPA. During testing performance, metrices are analyzed.

Keywords- Concurrency Control, Functional Back Propagation Network, Transaction Locks, Time Stamping.

28. Paper 31011185: Computer Modelling of 3D Geological Surface (pp. 175-179)

Full Text: PDF

Kodge B. G., Department of Computer Science, S. V. College, Udgir, District Latur, Maharashtra state, India

Hiremath P. S., Department of Computer Science, Gulbarga University, Gulbarga, Karnataka state, India

Abstract— The geological surveying presently uses methods and tools for the computer modeling of 3D-structures of the geographical subsurface and geotechnical characterization as well as the application of geoinformation systems for management and analysis of spatial data, and their cartographic presentation. The objectives of this paper are to present a 3D geological surface model of Latur district in Maharashtra state of India. This study is undertaken through the several processes which are discussed in this paper to generate and visualize the automated 3D geological surface model of a projected area.

Keywords-; 3D Visualization, Geographical Information System, Digital Terrain Data Processing, Cartography.

29. Paper 20011104: Sectorization of Haar and Kekre’s Wavelet for Feature Extraction of color images in Image Retrieval (pp. 180-188)

Full Text: PDF

H. B. Kekre Sr. Professor MPSTME, SVKM’s NMIMS (Deemed-to be-University) Vile Parle West, Mumbai -56, INDIA

Dhirendra Mishra Associate Professor & PhD Research Scholar MPSTME, SVKM’s NMIMS (Deemed-to be-University) Vile Parle West, Mumbai -56, INDIA

Abstract- This paper presents the Innovative idea of Sectorization of Haar Wavelet transformed images and Kekre’s Wavelet Transformed images to extract features for image retrieval. Transformed images have been sectored into 4,8,12 and 16 sectors. Each sector produces the feature vector component in particular sector size. Thus the feature vector size increases with the increase in the sector size. The experiment of augmenting the feature vectors with extra components performed .The performance of proposed method of sectorization checked with respect to increase in sector sizes, effect of augmentation of extra components in both Haar and Kekre’s Wavelet sectorization .The retrieval rate checked with crossover of average precision and recall. LIRS and LSRR are calculated for average of randomly selected 5 images of all 12 classes and compared with the overall average of LIRS/LSRR. The work experimented over the image database of 1055 images and the performance of image retrieval with respect to two similarity measures namely Euclidian distance (ED) and sum of absolute difference (AD) are measured.

Keywords- CBIR, Haar Wavelet, Kekre’s Wavelet Euclidian Distance, Sum of Absolute Difference, LIRS, LSRR, Precision and Recall.

30. Paper 24111024: A Survey on Joint and Distributed Routing for 802.16 WiMAX Networks (pp. 189-194)

Full Text: PDF

N. Ananthi, Easwari Engineering College, Chennai.

Dr. J. Raja, Anna University, Trichy.

Abstract---The growing demand for last mile broadband access is resulted from the increased growth of speedy multimedia services for mobile, residential and little business customers. Technologies based on 802.16 WiMAX (Worldwide Interoperability Microwave Access) ensures to offer high data rates in long distance and afford multimedia services and are expected to act as key issue for high speed broadband services. The technique for building multi-hop mesh is provided by IEEE 802.16 WiMAX standard. This can be act as high speed wide-area wireless network and can afford better wireless coverage up to 5 miles with Line of Sight (LOS) transmission inside the bandwidth of around 70 Mbps. As the wireless environment varies unexpectedly, routing in wireless network is challenging work. There are several demands for IEEE 802.16 WiMAX routing like delay, long transmission scheduling, increasingly stringent Quality of Service (QoS) support, load balance and fairness restrictions. The aim of this survey is to analyze some of the routing protocols proposed by various authors for IEEE 802.16 WiMAX networks.

Keywords---IEEE 802.16, Routing Algorithm, Wireless mesh networks, Scheduling.

31. Paper 31011140: A New Secure Approach for Message Transmission by Godelization and FCE (pp. 195-198)

Full Text: PDF

Dr. Ch. Rupa, Associate Professor, Dept of CSE, VVIT, Guntur (dt).

P. S. Avadhani, Professor, Dept of CS&SE, Andhra University, Vizag.

Dr. D. Lalitha Bhaskari, Associate Professor, Dept of CS&SE, Andhra University, Vizag.

Abstract - In this paper, we devised a novel algorithmic approach for transmitting information through Fast Comparison Encryption (FCE) algorithm. The proposed scheme uses an algorithm name it as FCE which transforms the information into an encoded Godel Number Sequence (GNS) which results in a text. It will be reconstructed at the other end using the inverse process.

Key Words: GNS, FCE.

32. Paper 31011149: Rapid Prototyping Model Coordinate Estimation Using Radial Basis Function (pp. 199-203)

Full Text: PDF

Anantmurty S. Shastry, Research Scholar, Vinayaka Missions University, Salem, Tamilnadu, India

Dr.S.Purushothaman, Principal, Sun College of Engineering and Technology, Sun Nagar, Erachakulum, Kanyakumari district-629902,India

Abstract: This paper discusses the methods for getting proper geometric coordinates of a sample object that has to be rapid prototyped. The coordinates of the objects is obtained by using Radial Basis Function (RBF). The training is done with many sample objects. It is expected to have minimum distance traveled by the Rapid prototyping machine when the software follows the geometric coordinates produced by the RBF.

Key words: Rapid Prototyping, Artificial Neural Network, Radial Basis Function.

33. Paper 31011151: Heschl's Gyrus Auditory Cortex Slice Registration Using Echo State Neural Network (ESNN) (pp. 204-211)

Full Text: PDF

R. Rajeswari, Research Scholar, Department of Computer Science Mother Theresa Women’s University, Kodaikanal, India.

Dr. Anthony Irudhayaraj, Dean, Computer Science and Engineering, VMRU, Chennai, India.

Abstract—This paper presents Herschel’s gyrus auditory cortex slice registration using Echo state neural network (ESNN). Training the network is done with translation and rotational values of the selective points (feature points) from two images at a time (source and target images). The input layer is given with coordinates of the selective points of the source image and in the output layer; the labeling is the translation and rotational values of the selective points of the target image. ESNN is an estimation network which estimates the required registration information from the selective points of target and source image. The output of ESNN is compared with radial basis function (RBF).

Keywords-Echo state neural network, functional magnetic resonance imaging (fMRI), Heschl's gyrus, auditory cortex

34. Paper 04031100: Brain Computer Interaction of Indian Facial Expressions Recognition Through Digital Electroencephalography (pp. 212-215)

Full Text: PDF

Mr. Dinesh Chandra Jain, Univ. of RGPV, Dept. Of Computer-Sc & Engineering, Shri Vaishnav Inst. of Technology, Indore, India

Dr. V. P Pawar, Univ. of Pune, Dept. of Computer App., Director of Siddhant Inst. of Comp-App, Pune, India

Abstract— The brain computer interaction could be the interface medium of the future, instead of using peripheral input output devices .So The brain computer interaction is a path way in which through digital EEG technique the brain signals of human subject have been recorded under different poses by using Digital Electroencephalograph (EEG) 2400NP instrument. Under experimental setup The subjects have given different expressions corresponding brain signals that have been recorded through a popular technique Digital EEG. An attempt has been done to correlate these results to the facial action coding System (FACS).

Keywords:

35. Paper 23011109: Performance Evaluation Of Co-Operative Game Theory Approach For Intrusion Detection In MANET (pp. 216-220)

Full Text: PDF

S. Thirumal M.C.A., M.Phil., Assistant professor, Department of computer science, Arignar anna government arts college, cheyyar, tiruvannamalai district -604 407

Dr. V. Saravanan M.C.A.,M.Phil., Ph.D., Professor and Director, department of computer applications

Dr.N.G.P institute of technology, Dr.N.G.P-Kallapatti road,coimbatore-641 048.

Abstract— Mobile Adhoc Network (MANET) is a collection of independent mobile nodes that can communicate to each other via radio waves. The mobile nodes that are in range of each other can directly communicate, whereas others need the aid of intermediate nodes to route their packets. These networks are fully distributed and can work at any place without the help of any infrastructure. This property makes these networks highly exible and robust. Intrusion Detection System (IDS) is an integral part of any Mobile Ad-hoc Network (MANET). It is very important for IDS to function properly for the efficient functioning of a MANET. In this paper I evaluate the Co-Operative game theory approach for intrusion detection in MANET by comparing it with the existing other approaches. My evaluation is concentrated both on Intrusion in Application layer and network layer. Network simulator NS-2.34 is used for the simulation of the intrusions in grid network.

Keywords: -

36. Paper 30011130: Hierarchical Route Optimization By Using Memetic Algorithm In A Mobile Networks (pp. 221-224)

Full Text: PDF

K .K. Gautam, Department of Computer Science & Engineering, K.P. Engineering College, Agra-283202- India

Dileep kumar singh, Department of Computer Science & Engineering, Dehradun Institue of Technology, Dehraun-India

Abstract- The networks Mobility (NEMO) Protocol is a way of managing the mobility of an entire network, and mobile internet protocol is the basic solution for networks Mobility. A hierarchical route optimization system for mobile network is proposed to solve management of hierarchical route optimization problems. In present paper we study hierarchical Route Optimization scheme using memetic algorithm(HROSMA) The concept of optimization- finding the extreme of a function that maps candidate ‘solution’ to scalar values of ‘quality’ – is an extremely general and useful idea. For solving this problem, we use a few salient adaptations, and we also extend HROSMA perform routing between the mobile networks.

Keywords-Route Optimization, Memetic algorithm personal area networks, NEMO, IP.

37. Paper 30011136: Performance of Call admission Control for Multi Media Mobile Network with Multi beam Access Point (pp. 225-228)

Full Text: PDF

K .K. Gautam, Department of Computer Science & Engineering, K.P. Engineering College, Agra-283202- India

Dileep kumar singh, Department of Computer Science & Engineering, Dehradun Institue of Technology, Dehraun-India

Abstract- A performance of call admission control scheme in different classes of calls may have different bandwidth requirement, different request call holding timings and residence times. At any time, each call of the network has the capability to provide service to at least a given number of calls for each call of calls. When the multi beam directional antennas are introduced in this system, then we shall have many challenging problems. In this system, then we have many challenging problems. In this paper we propose a noble network protocol to carefully examine performance of call admission control for multimedia network, for each class of new and handoff this mobile network.

Keywords-Call admission control. Directional antennas, Multibeam Access point, Multimedia Network, Multiple input multiple outputs (MEMO)

38. Paper 31011187: Multi-party Supportive Symmetric Encryption (pp. 229-232)

Full Text: PDF

V. Nandakumar, Assistant Professor, Computer Centre, Alagappa University, Karaikudi, Tamilnadu, INDIA

Dr. E. R. Naganathan, Professor, Department of Computer Applications, Velammal, College of Engineering, Chennai, Tamilnadu, INDIA

Dr. S. S. Dhenakaran, Assistant Professor, Computer Centre, Alagappa University, Karaikudi, Tamilnadu, INDIA

Abstract— Business data is a valuable asset for many Organizations. Organizations need security mechanisms that provide confidentiality for outsourcing their data services. Encrypting sensitive data is the normal approach in such a situation. Applications typically use Symmetric keys for encryption, or Asymmetric keys for their transmissions. In case of Asymmetric encryptions they use the public keys of the signers along with files sent. Since these identity strings are likely to be much shorter than generated public keys, the identity based key generation is an appealing option. A multi-signature scheme enables a group of signers to produce a compact, joint signature on a common document, and has many potential uses. Existing schemes with multi signers impose requirements that make them impractical, such as requiring a dedicated, distributed key generation protocol amongst potential users. These requirements limit the use of the schemes. Multi-Party or co-operative authentication on information is a trusted source of security. In this paper, we propose an encryption scheme where each authorized user’s information is used to encrypt and decrypt data. This paper, presents a multi-party yet supportive, secure and identity-based scheme based on symmetric encryption, Multi-party Supportive Symmetric Encryption (MSSE). This paper takes an effort to resolve the security issues and also report on the results of the implementation

Keywords: Symmetric Encryption, Sub-key, Key Management, Key generation, Multi-party

39. Paper 31011172: High Efficiency QoS Guarantee, Channel Aware scheduling scheme For Polling Services in WiMAX (pp. 233-240)

Full Text: PDF

Reza Hashemi, Mohammad Ali Pourmina, Farbod Razzazi

Department of Electronics and Communication Engineering, Islamic Azad University, Science and Research Branch, Tehran, Iran

Abstract—This Paper offers an efficient channel aware scheduling scheme for IEEE 802.16e WiMAX Mobile, real-time and non-real-time polling service. Compared to a similar scheduling approach, our considered scheduler can guarantee and achieve lower delay with a good average throughput. In order to achieve this object, we introduce a scheduling scheme with four different segments in a decision making process. The first part, a time dependent function that considers the time when packets wait in queues and in a jitter area to prevent packet deadline. Buffer utility function, as the second part, considers buffer size in scheduling to prevent overflow, specifically in nrtPS class with large size packets. The third part, retrieved from proportional fairness algorithms, which in normal conditions gives a fair share to users. Channel SNR and service class weight are also involved in this part. The final section of scheduling relationship, channel condition, is defined more accurately by RSSI and CINR parameters. The simulation results in OPNET show that our proposed scheme has a very good delay and packet loss ratio accompanied by a high throughput. In another scenario, with different number of users and limit resources, we show relationship between admission control and scheduling.

Keywords-component; IEEE 802.16e; WiMAX; Scheduling; QoS; Resource Allocation; OPNET

40. Paper 20011103: A Quantization based blind and Robust Image Watermarking Algorithm (pp. 241-247)

Full Text: PDF

Mohamed M. Fouad

Electronics and Communication Department- Faculty of Engineering- Zagazig University- Egypt

Abstract— Security and privacy issues of the transmitted data have become an important concern in multimedia technology. Watermarking which belong to the field of information hiding has seen a lot of research interest recently. Watermarking is used for a variety of reasons including security, content protection, copyright management, trust management, content authentication, tamper detection and privacy. Recently many watermarking techniques have been proposed to support these applications but one major issue with most of the watermarking techniques is that these techniques fail in the presence of severe attacks. This has been a major threat to content providers because if the digital content is dramatically changed then it would be difficult to prove the existence of a watermark in it and consequently its ownership. To tackle this security threat towards ownership issues in this paper, we propose a computationally efficient and secure two quantization based watermarking algorithms which offer incredible performance in presence of malicious attacks which try to remove ownership information. The performance of the proposed techniques is compared with that of other watermarking techniques and it gives a very good perceptual quality especially at lower bit rates. We present experimental results which show that the proposed techniques outperform many techniques for multimedia over wireless applications. The proposed schemes are backed up with excellent results.

Keywords-component; Watermark Detection; Watermarking; DCT; DWT; Quantization

41. Paper 31011143: Robust Techniques of Web Watermarking (pp. 248-252)

Full Text: PDF

Nighat Mir

College of Engineering, Effat University, Jeddah, Saudi Arabia

Abstract—Internet is an attractive, rapid and economical way of electronic information distribution. With advent and tremendous growth of Internet, information is going paperless and is transforming into electronic information over the paper distribution. But it also makes protection of its intellectual property very difficult. Once the information is available on the Internet, it’s open to any threats like illegal copying, distribution, tampering and authentication. Intellectual rights for the information available on web are a serious issue. In this paper natural language digital watermarks are proposed for the web based electronic data. And a problem of investigating the authorship of web based text/data is investigated with a improved security. Several robust techniques of web page imperceptible digital watermarking using Verbs, Articles and Prepositions are studied for the protection of content available on www. On this basis, web watermarking algorithm is designed and implemented. A key consisting of natural watermarks along with a unique author id (issued by the CA) is integrated to any content to be published on the web. The key to be integrated is further encrypted suing AES (Advanced Encryption Standard) to add another layer of security. And it is also tested with different web sites to see its functionality and robustness.

Keywords- Digital Watermarking, Verbs, Articles, Prepositions, encryption, HTML, AES, CA.

42 . Paper 31011155: Performance Evaluation of Improved Routing Algorithm for Irregular Network-on-Chip (pp. 253-259)

Full Text: PDF

Ladan Momeni, Department of Computer Engineering Science and Research Branch, Azad University of Ahvaz, Ahvaz, Iran

Arshin Rezazadeh, Mahmood Fathy, Department of Computer Engineering, Iran University of Science and Technology, Tehran, Iran

Abstract— In this paper, a new wormhole-switched routing algorithm for irregular 2-dimensional (2-D) mesh interconnection Network-on-Chip is proposed, where not only no virtual channel is used for routing but also no virtual channel is used to pass oversized nodes (ONs). We also improve message passing parameters of ONs as well as comparing simulation results of our algorithm and several state of art algorithms. Simulation results show that our proposed algorithm, i-xy (improved/irregular-xy), has a higher saturation point in comparison with extended-xy and OAPR algorithms. Furthermore, it has less blocked messages and higher routed/switched messages in the network. Moreover, the network uses i-xy has higher utilization compared to other networks which uses e-xy and OAPR from 35 percent to 100 percent, for the irregular 2-D mesh NoC.

Keywords-Network-on-Chip, performance, wormhole switching, irregular 2-D mesh, routing, utilization