Pub Date : 2011-12-24DOI: 10.1109/ICCSNT.2011.6181923
Lauretha Rura, B. Issac, M. K. Haldar
Good electronic voting system is developed to cater to the user's demand to have an efficient, reliable and secure system. Online voting system should not be a black box to the users. It should be able to assure them that their vote is casted, collected and counted respectively without enabling vote coercion or vote buying. In this paper, we are proposing a combination of both cryptography and steganography approach in online voting's vote verification design.
{"title":"Online voting verification with cryptography and steganography approaches","authors":"Lauretha Rura, B. Issac, M. K. Haldar","doi":"10.1109/ICCSNT.2011.6181923","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6181923","url":null,"abstract":"Good electronic voting system is developed to cater to the user's demand to have an efficient, reliable and secure system. Online voting system should not be a black box to the users. It should be able to assure them that their vote is casted, collected and counted respectively without enabling vote coercion or vote buying. In this paper, we are proposing a combination of both cryptography and steganography approach in online voting's vote verification design.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115536450","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 : 2011-12-24DOI: 10.1109/ICCSNT.2011.6181917
A. M. Shahi, B. Issac, J. R. Modapothala
Machine Learning approach to text classification has been the dominant method in the research and application field since it was first introduced in the 1990s. It has been proven that document classification applications based on Machine Learning produce competitive results to those based on the Knowledge Based approaches. This approach has been widely researched upon as well as applied in various applications to solve various text categorization problems. In this research we have applied such techniques in a novel effort to find out which document classification algorithms perform best on Corporate Sustainability Reports.
{"title":"Analysis of supervised text classification algorithms on corporate sustainability reports","authors":"A. M. Shahi, B. Issac, J. R. Modapothala","doi":"10.1109/ICCSNT.2011.6181917","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6181917","url":null,"abstract":"Machine Learning approach to text classification has been the dominant method in the research and application field since it was first introduced in the 1990s. It has been proven that document classification applications based on Machine Learning produce competitive results to those based on the Knowledge Based approaches. This approach has been widely researched upon as well as applied in various applications to solve various text categorization problems. In this research we have applied such techniques in a novel effort to find out which document classification algorithms perform best on Corporate Sustainability Reports.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116039925","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 : 2011-12-24DOI: 10.1109/ICCSNT.2011.6181918
Kuruvilla Mathew, B. Issac
This paper analyses the methods of intelligent spam filtering techniques in the SMS (Short Message Service) text paradigm, in the context of mobile text message spam. The unique characteristics of the SMS contents are indicative of the fact that all approaches may not be equally effective or efficient. This paper compares some of the popular spam filtering techniques on a publically available SMS spam corpus, to identify the methods that work best in the SMS text context. This can give hints on optimized spam detection for mobile text messages.
{"title":"Intelligent spam classification for mobile text message","authors":"Kuruvilla Mathew, B. Issac","doi":"10.1109/ICCSNT.2011.6181918","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6181918","url":null,"abstract":"This paper analyses the methods of intelligent spam filtering techniques in the SMS (Short Message Service) text paradigm, in the context of mobile text message spam. The unique characteristics of the SMS contents are indicative of the fact that all approaches may not be equally effective or efficient. This paper compares some of the popular spam filtering techniques on a publically available SMS spam corpus, to identify the methods that work best in the SMS text context. This can give hints on optimized spam detection for mobile text messages.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125928126","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182045
Jia Lu, Gang Han, Junhui Wang, Wenhua Dou, Ke Yan
Recently, people have done much research on cooperative diversity techniques in order to enhance the system performance without increasing hardware complexity. However, the prior work may lead to weak compatibility, high probability of collision and so on. In order to improve these cooperative algorithms, we present a novel medium access control protocol for mobile sensor networks, which exploits cooperative communication capability to achieve high bandwidth efficiency, guarantee full diversity order, backward compatibility to the current MAC and minimize the power consumption over each hop as possible. In our proposed protocol, the transmitter and receiver over one hop choose relay nodes collaboratively by extended RTS/CTS and the transmitter employs either direct transmission or relay transmission accordingly. We derive a numerical expression for the probability that relay transmission is adopted. The saturated throughout of our proposed cooperative MAC is calculated and the obtained analytical results are verified through computer simulations.
{"title":"Distributed efficient flexible cooperative MAC for mobile sensor networks","authors":"Jia Lu, Gang Han, Junhui Wang, Wenhua Dou, Ke Yan","doi":"10.1109/ICCSNT.2011.6182045","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182045","url":null,"abstract":"Recently, people have done much research on cooperative diversity techniques in order to enhance the system performance without increasing hardware complexity. However, the prior work may lead to weak compatibility, high probability of collision and so on. In order to improve these cooperative algorithms, we present a novel medium access control protocol for mobile sensor networks, which exploits cooperative communication capability to achieve high bandwidth efficiency, guarantee full diversity order, backward compatibility to the current MAC and minimize the power consumption over each hop as possible. In our proposed protocol, the transmitter and receiver over one hop choose relay nodes collaboratively by extended RTS/CTS and the transmitter employs either direct transmission or relay transmission accordingly. We derive a numerical expression for the probability that relay transmission is adopted. The saturated throughout of our proposed cooperative MAC is calculated and the obtained analytical results are verified through computer simulations.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115139734","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182544
Sui Tao, Sun Pei-gen, Zhang Ze-yang, Wan Zi-geng
With the development of space network technology, Integrated Satellite Information Network (ISIN) is playing more and more important role in national economy and national security and other fields. Integrated Satellite Information Network is the way to realize fusion of satellite communication and traditional network technology. The traditional satellite network management which uses manual configuration is with over workload, low efficiency, and lack of general adaptability. This paper uses traditional policy-based network management as its ground, combined with the characteristics of the ISIN, has designed the ISIN policy-based network management architecture, so that the policy-based network management can successfully be used in integrated satellite information network. This article use PCIM information modal as a reference, defined the XML-based policy description method.
{"title":"A management policy applying to Integrated Satellite Information Network","authors":"Sui Tao, Sun Pei-gen, Zhang Ze-yang, Wan Zi-geng","doi":"10.1109/ICCSNT.2011.6182544","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182544","url":null,"abstract":"With the development of space network technology, Integrated Satellite Information Network (ISIN) is playing more and more important role in national economy and national security and other fields. Integrated Satellite Information Network is the way to realize fusion of satellite communication and traditional network technology. The traditional satellite network management which uses manual configuration is with over workload, low efficiency, and lack of general adaptability. This paper uses traditional policy-based network management as its ground, combined with the characteristics of the ISIN, has designed the ISIN policy-based network management architecture, so that the policy-based network management can successfully be used in integrated satellite information network. This article use PCIM information modal as a reference, defined the XML-based policy description method.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123051097","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182401
Wengang Cheng, Xiaolei Wang
Social tagging on online websites provides users interfaces of describing resources with their own tags, and vast user-provided image tags facilitate image retrieval and management. However, these tags are often not related to the actual image content, affecting the performance of tag related applications. In this paper, a novel approach to automatically refine the image tags is proposed. Firstly, information entropy of the tag is defined to refine tag frequency to predict tag initial relevance. Then, tag correlation is calculated from two sides. One side is to measure semantic similarity of tag pairs using the structured information of the free encyclopedia Wikipedia. The other one is to compute the visual similarity of tag pairs based on the visual representation of the tag. Finally, to re-rank the original tags, a fast random walk with restart is used and the top ones are reserved as the final tags. Experimental results conducted on dataset NUS-WIDE demonstrate the promising effectiveness of our approach.
{"title":"Image tag refinement using tag semantic and visual similarity","authors":"Wengang Cheng, Xiaolei Wang","doi":"10.1109/ICCSNT.2011.6182401","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182401","url":null,"abstract":"Social tagging on online websites provides users interfaces of describing resources with their own tags, and vast user-provided image tags facilitate image retrieval and management. However, these tags are often not related to the actual image content, affecting the performance of tag related applications. In this paper, a novel approach to automatically refine the image tags is proposed. Firstly, information entropy of the tag is defined to refine tag frequency to predict tag initial relevance. Then, tag correlation is calculated from two sides. One side is to measure semantic similarity of tag pairs using the structured information of the free encyclopedia Wikipedia. The other one is to compute the visual similarity of tag pairs based on the visual representation of the tag. Finally, to re-rank the original tags, a fast random walk with restart is used and the top ones are reserved as the final tags. Experimental results conducted on dataset NUS-WIDE demonstrate the promising effectiveness of our approach.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114665600","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182398
Hou A-Lin, Feng Yuan, Geng Ying
In order to improve the practical application property of the two-dimensional barcode Quick Response (QR) code, we investigate the coding and decoding process of the QR code image. Run-length coding is applied to binary QR code image so as to accelerate the identification of QR code image. The QR code is transformed into many runs of data in alternate pixels of black and white. The related runs of data among adjacent rows are formed a unit module. After the whole image has been scanned, all of such modules in binary QR code image can be generated accordingly. With a noisy QR image captured by an industrial camera as an example, the experiments of image binarization, image seeking and localization adjustment are accomplished in sequence. Also the error correction algorithm is discussed in detail. A decoding system of QR code is designed and the online detection experiments are carried out. The satisfied results are achieved.
{"title":"QR code image detection using run-length coding","authors":"Hou A-Lin, Feng Yuan, Geng Ying","doi":"10.1109/ICCSNT.2011.6182398","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182398","url":null,"abstract":"In order to improve the practical application property of the two-dimensional barcode Quick Response (QR) code, we investigate the coding and decoding process of the QR code image. Run-length coding is applied to binary QR code image so as to accelerate the identification of QR code image. The QR code is transformed into many runs of data in alternate pixels of black and white. The related runs of data among adjacent rows are formed a unit module. After the whole image has been scanned, all of such modules in binary QR code image can be generated accordingly. With a noisy QR image captured by an industrial camera as an example, the experiments of image binarization, image seeking and localization adjustment are accomplished in sequence. Also the error correction algorithm is discussed in detail. A decoding system of QR code is designed and the online detection experiments are carried out. The satisfied results are achieved.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"129 18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117340291","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182057
L. Zhang, Yong-hua Han, Gang Zhang
The paper introduces the basic steps to create the UML use case model with the Banking Loans System as an example. On the basis of use case model, capture and analysis the system classes from the use case description by grammar analysis. Then through establishing the associations for any two classes creates the class diagram model of the Banking Loans System. It provides a reference model for the Banking Loans System to achieve.
{"title":"Business modeling of the Banking Loans System based on UML","authors":"L. Zhang, Yong-hua Han, Gang Zhang","doi":"10.1109/ICCSNT.2011.6182057","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182057","url":null,"abstract":"The paper introduces the basic steps to create the UML use case model with the Banking Loans System as an example. On the basis of use case model, capture and analysis the system classes from the use case description by grammar analysis. Then through establishing the associations for any two classes creates the class diagram model of the Banking Loans System. It provides a reference model for the Banking Loans System to achieve.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121259985","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182510
Yincheng Liang, Chanjuan Liu, Hailin Zou
The scale-invariant feature transform algorithm proposed by Lowe has a low efficiency which can not meet the need of real-time. The algorithm based on rounded projection proposed in our paper applies Fast Fourier Transform algorithm (FFT) on the projection local area to compute the first harmonic components which are used to prescreen the feature points that extracted by SIFT algorithm. We carry on the image to match according to the prescreened feature points to calculate the local area descriptors. The experiments show that new algorithm has a less number of feature points than the original, so it improves the efficiency and has a better performance.
{"title":"An improved scale invariant feature transform algorithm based on rounded projection","authors":"Yincheng Liang, Chanjuan Liu, Hailin Zou","doi":"10.1109/ICCSNT.2011.6182510","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182510","url":null,"abstract":"The scale-invariant feature transform algorithm proposed by Lowe has a low efficiency which can not meet the need of real-time. The algorithm based on rounded projection proposed in our paper applies Fast Fourier Transform algorithm (FFT) on the projection local area to compute the first harmonic components which are used to prescreen the feature points that extracted by SIFT algorithm. We carry on the image to match according to the prescreened feature points to calculate the local area descriptors. The experiments show that new algorithm has a less number of feature points than the original, so it improves the efficiency and has a better performance.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"11 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127381497","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182171
J. Liu, Yong Sun, Z. Kang, Xin Tian, Xin Li, Qinghai Yuan, Yan Zhang
Aortic diseases, such as acute intramural hematoma, acute aortic dissection and acute penetrating aortic ulcer are life-threatening disorders. Aortic computed tomography angiography can be helpful not only for pre-surgical planning but also for the follow-up evaluation. The volume-rendering technique (VR) and multiplanar reconstruction technique (MPR) are post-processing techniques within aortic CTA examination. The techniques of axial section and MPR can make accurate diagnosis, and the technique of VR is useful in pre-surgical plan.
{"title":"Post-processing techniques for aortic computed tomography angiography","authors":"J. Liu, Yong Sun, Z. Kang, Xin Tian, Xin Li, Qinghai Yuan, Yan Zhang","doi":"10.1109/ICCSNT.2011.6182171","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182171","url":null,"abstract":"Aortic diseases, such as acute intramural hematoma, acute aortic dissection and acute penetrating aortic ulcer are life-threatening disorders. Aortic computed tomography angiography can be helpful not only for pre-surgical planning but also for the follow-up evaluation. The volume-rendering technique (VR) and multiplanar reconstruction technique (MPR) are post-processing techniques within aortic CTA examination. The techniques of axial section and MPR can make accurate diagnosis, and the technique of VR is useful in pre-surgical plan.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125184699","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
扫码关注我们
求助内容：
应助结果提醒方式：