Pub Date : 2014-01-01DOI: 10.47893/ijcns.2014.1096
Akshata B. Angadi, Karuna C. Gull, Padmashri Desai
For The World-Wide Web has become the most important information source for most of us. As different websites often provide conflicting information there is no guarantee for the correctness of the data. Among multiple conflict results, can we automatically identify which one is likely the true fact?, In this paper our experiments show that Fact finder, a supporter for user to resolve the problem, successfully finds true facts among conflicting information, and identifies Trust worthy websites better than the popular search engines. In our paper we give ratings based on two things- popularity or the hits & number of occurrences of same data. As we can’t give preference only to popularity, we have considered another rating i.e. about number of occurrences of same data in several other websites, which are less popular. This paper helps user to get resolved by conflicting facts from multiple websites on two basis. Further by considering few more relations we can develop a search engine that truly helps the user to resolve the Veracity problem.
{"title":"EXTRACTING ACCURATE DATA FROM MUL A FROM MULTIPLE CONFLIC TIPLE CONFLICTING\u0000INFORMATION ON WEB SOURCES","authors":"Akshata B. Angadi, Karuna C. Gull, Padmashri Desai","doi":"10.47893/ijcns.2014.1096","DOIUrl":"https://doi.org/10.47893/ijcns.2014.1096","url":null,"abstract":"For The World-Wide Web has become the most important information source for most of us. As different websites often provide conflicting information there is no guarantee for the correctness of the data. Among multiple conflict results, can we automatically identify which one is likely the true fact?, In this paper our experiments show that Fact finder, a supporter for user to resolve the problem, successfully finds true facts among conflicting information, and identifies Trust worthy websites better than the popular search engines. In our paper we give ratings based on two things- popularity or the hits & number of occurrences of same data. As we can’t give preference only to popularity, we have considered another rating i.e. about number of occurrences of same data in several other websites, which are less popular. This paper helps user to get resolved by conflicting facts from multiple websites on two basis. Further by considering few more relations we can develop a search engine that truly helps the user to resolve the Veracity problem.","PeriodicalId":38851,"journal":{"name":"International Journal of Communication Networks and Information Security","volume":"4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88429829","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-01-01DOI: 10.47893/ijcns.2014.1091
K. Rahul, S. K. Bhattacharya, Rohit Agrawal
Color image quantization is the most widely used techniques in the field of image compression. DBSCAN is a density based data clustering technique. However DBSCAN is widely used for data clustering but not very popular for color image quantization due to some of issues associated with it. One of the problems associated with DBSCAN is that it becomes expensive when used on whole image data and also the noise points been unmapped. In this paper we are proposing a new color image quantization scheme which overcomes these problems. Our proposed algorithm is GDBSCAN (Grid Based DBSCAN) where we first decompose the image data in grids and then apply DBSCAN algorithm on each grids
彩色图像量化是图像压缩领域中应用最广泛的技术。DBSCAN是一种基于密度的数据聚类技术。然而，DBSCAN被广泛用于数据聚类，但由于其相关的一些问题，在彩色图像量化方面不太流行。与DBSCAN相关的一个问题是，当对整个图像数据使用时，它会变得昂贵，而且噪声点也会被取消映射。本文提出了一种新的彩色图像量化方案，克服了这些问题。我们提出的算法是GDBSCAN (Grid Based DBSCAN)，我们首先将图像数据分解成网格，然后在每个网格上应用DBSCAN算法
{"title":"COLOR IMAGE QUANTIZATION USING GDBSCAN","authors":"K. Rahul, S. K. Bhattacharya, Rohit Agrawal","doi":"10.47893/ijcns.2014.1091","DOIUrl":"https://doi.org/10.47893/ijcns.2014.1091","url":null,"abstract":"Color image quantization is the most widely used techniques in the field of image compression. DBSCAN is a density based data clustering technique. However DBSCAN is widely used for data clustering but not very popular for color image quantization due to some of issues associated with it. One of the problems associated with DBSCAN is that it becomes expensive when used on whole image data and also the noise points been unmapped. In this paper we are proposing a new color image quantization scheme which overcomes these problems. Our proposed algorithm is GDBSCAN (Grid Based DBSCAN) where we first decompose the image data in grids and then apply DBSCAN algorithm on each grids","PeriodicalId":38851,"journal":{"name":"International Journal of Communication Networks and Information Security","volume":"2013 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86276417","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-01-01DOI: 10.47893/ijcns.2014.1088
T. Saikumar, S. Amit, Y. Dinesh
Using thresholding method to segment an image, a fixed threshold is not suitable if the background is rough Here, we propose a new adaptive thresholding method using level set theory. The method requires only one parameter to be selected and the adaptive threshold surface can be found automatically from the original image. An adaptive thresholding scheme using adaptive tracking and morphological filtering. The Improved Kernel fuzzy c-means (IKFCM) was used to generate an initial contour curve which overcomes leaking at the boundary during the curve propagation. IKFCM algorithm computes the fuzzy membership values for each pixel. On the basis of IKFCM the edge indicator function was redefined. Using the edge indicator function of a image was performed to extract the boundaries of objects on the basis of the presegmentation. Therefore, the proposed method is computationally efficient. Our method is good for detecting large and small images concurrently. It is also efficient to denoise and enhance the responses of images with low local contrast can be detected. The efficiency and accuracy of the algorithm is demonstrated by the experiments on the images. The above process of segmentation showed a considerable improvement in the evolution of the level set function.
{"title":"IMPROVED KERNEL FUZZY ADAPTIVE THRESHOLD ALGORITHM ON LEVEL SET METHOD FOR IMAGE SEGMENTATION","authors":"T. Saikumar, S. Amit, Y. Dinesh","doi":"10.47893/ijcns.2014.1088","DOIUrl":"https://doi.org/10.47893/ijcns.2014.1088","url":null,"abstract":"Using thresholding method to segment an image, a fixed threshold is not suitable if the background is rough Here, we propose a new adaptive thresholding method using level set theory. The method requires only one parameter to be selected and the adaptive threshold surface can be found automatically from the original image. An adaptive thresholding scheme using adaptive tracking and morphological filtering. The Improved Kernel fuzzy c-means (IKFCM) was used to generate an initial contour curve which overcomes leaking at the boundary during the curve propagation. IKFCM algorithm computes the fuzzy membership values for each pixel. On the basis of IKFCM the edge indicator function was redefined. Using the edge indicator function of a image was performed to extract the boundaries of objects on the basis of the presegmentation. Therefore, the proposed method is computationally efficient. Our method is good for detecting large and small images concurrently. It is also efficient to denoise and enhance the responses of images with low local contrast can be detected. The efficiency and accuracy of the algorithm is demonstrated by the experiments on the images. The above process of segmentation showed a considerable improvement in the evolution of the level set function.","PeriodicalId":38851,"journal":{"name":"International Journal of Communication Networks and Information Security","volume":"40 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86567270","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-01-01DOI: 10.47893/ijcns.2014.1089
B. Sirisha, T. Sraddha, K. Vijayanand
Mobile Multi patient monitoring device has become increasingly important in Hospital wards to record real-time data during normal activity for better treatment. However, the current quality and reliability have not been satisfactory due to the size, weight, distance of coverage and also high power consumption. This paper provides a solution for enhancing the reliability, flexibility by improving the performance and power management of the real-time multi-patient monitoring system (MPMS). In the current proposed system the patient health is continuously monitored by the MPMS and the acquired data is transmitted to a centralized ARM server using Wireless Sensor Networks. A ZigBee node is connected to every patient monitor system which will send the patient's vital information .Upon system boot up, the mobile patient monitor system will continuously monitor the patients vital parameters like Heart Beat, body temperature etc and will periodically send those parameters to a centralized server using ZigBee node configured as co-coordinator. If a particular patient’s health parameter falls below the threshold value, a buzzer alert is triggered by the ARM server. Along with a buzzer an automated SMS is posted to the pre-configured Doctors mobile number using a standard GSM module interfaced to the ARM server. The Doctor is continuously connected to the ARM server using GSM Module and he/she can get a record of a particular patient’s information by just posting a SMS message to the centralized ARM server. This will reduce treatment time, cost and power consumption to a greater extent. At the same time, the efficiency of examining ward will be improved by making the system more real-time and robust.
{"title":"REAL-TIME MULTI-PATIENT MONITORING SYSTEM USING ARM AND WIRELESS SENSOR NETWORK","authors":"B. Sirisha, T. Sraddha, K. Vijayanand","doi":"10.47893/ijcns.2014.1089","DOIUrl":"https://doi.org/10.47893/ijcns.2014.1089","url":null,"abstract":"Mobile Multi patient monitoring device has become increasingly important in Hospital wards to record real-time data during normal activity for better treatment. However, the current quality and reliability have not been satisfactory due to the size, weight, distance of coverage and also high power consumption. This paper provides a solution for enhancing the reliability, flexibility by improving the performance and power management of the real-time multi-patient monitoring system (MPMS). In the current proposed system the patient health is continuously monitored by the MPMS and the acquired data is transmitted to a centralized ARM server using Wireless Sensor Networks. A ZigBee node is connected to every patient monitor system which will send the patient's vital information .Upon system boot up, the mobile patient monitor system will continuously monitor the patients vital parameters like Heart Beat, body temperature etc and will periodically send those parameters to a centralized server using ZigBee node configured as co-coordinator. If a particular patient’s health parameter falls below the threshold value, a buzzer alert is triggered by the ARM server. Along with a buzzer an automated SMS is posted to the pre-configured Doctors mobile number using a standard GSM module interfaced to the ARM server. The Doctor is continuously connected to the ARM server using GSM Module and he/she can get a record of a particular patient’s information by just posting a SMS message to the centralized ARM server. This will reduce treatment time, cost and power consumption to a greater extent. At the same time, the efficiency of examining ward will be improved by making the system more real-time and robust.","PeriodicalId":38851,"journal":{"name":"International Journal of Communication Networks and Information Security","volume":"21 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82455877","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-01-01DOI: 10.47893/ijcns.2014.1098
B. Lakshimibhargavi, V. MARUTI PRASAD
Advent of many emerging computing technologies became very catchy to users. So, usage of technology increasing very rapidly day by day. Security became major issue. People who are working through the internet suffer from unintended security leakages by unauthorised actions in an organization and also problems created by hackers through the malicious codes. To overcome the security issues we have a concept called “firewall” .Network fire alls guard an internal computer network (home, school, business intranet) against malicious access from the outside. Network firewalls may also be configured to limit access to the outside from internal users. In this paper, we elaborate FAME(firewall anomaly management environment) and we will have a glance on firewall anomalies and resolving techniques. In addition we are going explain few concepts practically and also representing diagrammatically.
{"title":"“FAME”: FSPYING & SOLVING FIREWALL ANOMALIES","authors":"B. Lakshimibhargavi, V. MARUTI PRASAD","doi":"10.47893/ijcns.2014.1098","DOIUrl":"https://doi.org/10.47893/ijcns.2014.1098","url":null,"abstract":"Advent of many emerging computing technologies became very catchy to users. So, usage of technology increasing very rapidly day by day. Security became major issue. People who are working through the internet suffer from unintended security leakages by unauthorised actions in an organization and also problems created by hackers through the malicious codes. To overcome\u0000the security issues we have a concept called “firewall” .Network fire alls guard an internal computer network (home, school, business\u0000intranet) against malicious access from the outside. Network firewalls may also be configured to limit access to the outside from internal users. In this paper, we elaborate FAME(firewall anomaly management environment) and we will have a glance on firewall anomalies and resolving techniques. In addition we are going explain few concepts practically and also representing diagrammatically.","PeriodicalId":38851,"journal":{"name":"International Journal of Communication Networks and Information Security","volume":"66 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75045247","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-01-01DOI: 10.47893/ijcns.2014.1087
Suman Kumar Bhattacharyya, K. Rahul
Linear Discriminant Analysis (LDA) has been successfully applied to face recognition which is based on a linear projection from the image space to a low dimensional space by maximizing the between class scatter and minimizing the within-class scatter. LDA allows objective evaluation of the significance of visual information in different features of the face for identifying the human face. The LDA also provides us with a small set of features that carry the most relevant information for classification purposes. LDA method overcomes the limitation of Principle Component Analysis method by applying the linear discriminant criterion. This criterion tries to maximize the ratio of determinant of the between-class scatter matrix of the projected samples to the determinant of the within-class scatter matrix of the projected samples. Linear discriminant groups the images of the same class and separate images of different classes. Here to identify an input test image, the projected test image is compared to each projected training, and the test image is identified as the closest training image. The experiments in this paper we present to use LDA for face recognition. The experiments in this paper are performed with the ORL face database. The experimental results show that the correct recognition rate of this method is higher than that of previous techniques.
{"title":"FACE RECOGNITION BY LINEAR DISCRIMINANT ANALYSIS","authors":"Suman Kumar Bhattacharyya, K. Rahul","doi":"10.47893/ijcns.2014.1087","DOIUrl":"https://doi.org/10.47893/ijcns.2014.1087","url":null,"abstract":"Linear Discriminant Analysis (LDA) has been successfully applied to face recognition which is based on a linear projection from the image space to a low dimensional space by maximizing the between class scatter and minimizing the within-class scatter. LDA allows objective evaluation of the significance of visual information in different features of the face for identifying the human face. The LDA also provides us with a small set of features that carry the most relevant information for classification purposes. LDA method overcomes the limitation of Principle Component Analysis method by applying the linear discriminant criterion. This criterion tries to maximize the ratio of determinant of the between-class scatter matrix of the projected samples to the determinant of the within-class scatter matrix of the projected samples. Linear discriminant groups the images of the same class and separate images of different classes. Here to identify an input test image, the projected test image is compared to each projected training, and the test image is identified as the closest training image. The experiments in this paper we present to use LDA for face recognition. The experiments in this paper are performed with the ORL face database. The experimental results show that the correct recognition rate of this method is higher than that of previous techniques.","PeriodicalId":38851,"journal":{"name":"International Journal of Communication Networks and Information Security","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76717595","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-01-01DOI: 10.47893/ijcns.2014.1090
S. More, Umarfarooque Jahagirdar
In wireless communication, Mobile Ad Hoc network (MANET) is a group of mobile nodes that are dynamically and randomly located in such a way that the wireless link among nodes are often change due to MANET dynamic features. In this MANET environment, if a device wants to connect to Internet, it must establish a communication with an Internet Gateway. The performance of system is evaluated using simulation. In this paper we propose approximated solutions and new algorithm that helps in QoS routing which can be adaptive, flexible, and intelligent.
{"title":"AN INTELLIGENT OPTIMIZATION TECHNIQUE FOR MANET USING GENETIC ALGORITHM","authors":"S. More, Umarfarooque Jahagirdar","doi":"10.47893/ijcns.2014.1090","DOIUrl":"https://doi.org/10.47893/ijcns.2014.1090","url":null,"abstract":"In wireless communication, Mobile Ad Hoc network (MANET) is a group of mobile nodes that are dynamically and randomly located in such a way that the wireless link among nodes are often change due to MANET dynamic features. In this MANET environment, if a device wants to connect to Internet, it must establish a communication with an Internet Gateway. The performance of system is evaluated using simulation. In this paper we propose approximated solutions and new algorithm that helps in QoS routing which can be adaptive, flexible, and intelligent.","PeriodicalId":38851,"journal":{"name":"International Journal of Communication Networks and Information Security","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83628221","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-01-01DOI: 10.47893/ijcns.2014.1097
Srikanth Bethu
This research is aimed to explore each of these two Parallel Virtual Machine (PVM) and Message Passing Interface(MPI) vehicles for DPP (Distributed Parallel Processing) considering capability, ease of use, and availability, and compares their distinguishing features and also explores programmer interface and their utilization for solving real world parallel processing applications. This work recommends a potential research issue, that is, to study the feasibility of creating a programming environment that allows access to the virtual machine features of PVM and the message passing features of MPI. PVM and MPI, two systems for programming clusters, are often compared. Each system has its unique strengths and this will remain so in to the foreseeable future. The comparisons usually start with the unspoken assumption that PVM and MPI represent different solutions to the same problem. In this paper we show that, in fact, the two systems often are solving different problems. In cases where the problems do match but the solutions chosen by PVM and MPI are different, we explain the reasons for the differences. Usually such differences can be traced to explicit differences in the goals of the two systems, their origins, or the relationship between their specifications and their implementations. This paper also compares PVM and MPI features, pointing out the situations where one may be favored over the other; it explains the deference’s between these systems and the reasons for such deference’s.
{"title":"COMPARATIVE ANALYSIS OF PVM AND MPI FOR THE DEVELOPMENT OF PHYSICAL APPLICATIONS IN PARALLEL AND DISTRIBUTED SYSTEMS","authors":"Srikanth Bethu","doi":"10.47893/ijcns.2014.1097","DOIUrl":"https://doi.org/10.47893/ijcns.2014.1097","url":null,"abstract":"This research is aimed to explore each of these two Parallel Virtual Machine (PVM) and Message Passing Interface(MPI) vehicles for DPP (Distributed Parallel Processing) considering capability, ease of use, and availability, and compares their distinguishing features and also explores programmer interface and their utilization for solving real world parallel processing applications. This work recommends a potential research issue, that is, to study the feasibility of creating a programming environment that allows access to the virtual machine features of PVM and the message passing features of MPI. PVM and MPI, two systems for programming clusters, are often compared. Each system has its unique strengths and this will remain so in to the foreseeable future. The comparisons usually start with the unspoken assumption that PVM and MPI represent different solutions to the same problem. In this paper we show that, in fact, the two systems often are solving different problems. In cases where the problems do match but the solutions chosen by PVM and MPI are different, we explain the reasons for the differences. Usually such differences can be traced to explicit differences in the goals of the two systems, their origins, or the relationship between their specifications and their implementations. This paper also compares PVM and MPI features, pointing out the situations where one may be favored over the other; it explains the deference’s between these systems and the reasons for such deference’s.","PeriodicalId":38851,"journal":{"name":"International Journal of Communication Networks and Information Security","volume":"25 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76815677","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：