In recent year, some popular P2P file-sharing systems have been identified to be polluted by the copyright Industry to control the unauthorized distribution of content. As one of the most common P2P pollution methods, the index poisoning controls the P2P file-sharing by inserting massive numbers of bogus records into the index of the P2P file-sharing system. In this paper, the index poisoning in the structured P2P file-sharing system is introduced firstly. A term “poison multiplication” is defined to describe the level of the poisoning and the probability model that a peer receives valid peer information on the condition of the index poisoning in BitTorrent is proposed. We run index poisoning in BitTorrent and evaluate the effect of it. The result of the evaluation shows that with the poison multiplication increases, the connection time and the randomness of the connection time increases. To our knowledge, this is the first study to employ BitTorrent as the platform to evaluate the effectiveness of the index poisoning.
{"title":"The Evaluation of Index Poisoning in BitTorrent","authors":"Jie Kong, Wandong Cai, Lei Wang","doi":"10.1109/ICCSN.2010.39","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.39","url":null,"abstract":"In recent year, some popular P2P file-sharing systems have been identified to be polluted by the copyright Industry to control the unauthorized distribution of content. As one of the most common P2P pollution methods, the index poisoning controls the P2P file-sharing by inserting massive numbers of bogus records into the index of the P2P file-sharing system. In this paper, the index poisoning in the structured P2P file-sharing system is introduced firstly. A term “poison multiplication” is defined to describe the level of the poisoning and the probability model that a peer receives valid peer information on the condition of the index poisoning in BitTorrent is proposed. We run index poisoning in BitTorrent and evaluate the effect of it. The result of the evaluation shows that with the poison multiplication increases, the connection time and the randomness of the connection time increases. To our knowledge, this is the first study to employ BitTorrent as the platform to evaluate the effectiveness of the index poisoning.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130365115","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}
Yinzi Chen, Yang Deng, Y. Guo, Wendong Wang, Y. Zou, Kongqiao Wang
A temporal video segmentation method is proposed in this paper. This method is based on the detection of shot abrupt transition and gradual transition, and then takes into account the conditions of user terminals, which could generate different video summarization for each user. The experimental results show that the video summarization is able to meet the user's browsing requirements, and allows user to enjoy better browsing experience.
{"title":"A Temporal Video Segmentation and Summary Generation Method Based on Shots' Abrupt and Gradual Transition Boundary Detecting","authors":"Yinzi Chen, Yang Deng, Y. Guo, Wendong Wang, Y. Zou, Kongqiao Wang","doi":"10.1109/ICCSN.2010.58","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.58","url":null,"abstract":"A temporal video segmentation method is proposed in this paper. This method is based on the detection of shot abrupt transition and gradual transition, and then takes into account the conditions of user terminals, which could generate different video summarization for each user. The experimental results show that the video summarization is able to meet the user's browsing requirements, and allows user to enjoy better browsing experience.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134193718","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}
This research aims to develop a new sensor-based localization technique which is exclusively used for forest fire detecting systems. Our algorithm addresses three key criteria of forest fire detecting systems deployed in nature, which are: low complexity, high efficiency and low power consumption, by the 2 features: estimating a grid-based output and adopting an event-triggering mechanism. The algorithm’s low complexity and high efficiency is indicated by its average-case running time of O(N_a ) - where N_a is the number of anchors. Despite of being simple, our proposed technique can achieve a good performance in terms of outputted region’s area, such as: More than 60% of inputs can result in a small-enough region-based output for monitored fields with dimension up to 6 times of sensors’ transmission range.
{"title":"A Simple Grid-Based Localization Technique in Wireless Sensor Networks for Forest Fire Detection","authors":"Thuykhanh Le, P. Chong, Xue Jun Li, W. Y. Leong","doi":"10.1109/ICCSN.2010.108","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.108","url":null,"abstract":"This research aims to develop a new sensor-based localization technique which is exclusively used for forest fire detecting systems. Our algorithm addresses three key criteria of forest fire detecting systems deployed in nature, which are: low complexity, high efficiency and low power consumption, by the 2 features: estimating a grid-based output and adopting an event-triggering mechanism. The algorithm’s low complexity and high efficiency is indicated by its average-case running time of O(N_a ) - where N_a is the number of anchors. Despite of being simple, our proposed technique can achieve a good performance in terms of outputted region’s area, such as: More than 60% of inputs can result in a small-enough region-based output for monitored fields with dimension up to 6 times of sensors’ transmission range.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"135 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123066940","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}
Seong-Yong Choi, Jin-Su Kim, Jung-Hyun Lee, Joong-Kyung Ryu, K. Rim
As a sensor network has a limited node resources and unexpected changes of external environment, its nodes should show energy efficiency, reliable data transmission, and topological adaptation to the change of external environment. However, it is not easy to satisfy these requirements at the same time. This study proposes Robust and Energy efficient Dynamic Single path routing (REDS), a routing mechanism that satisfies the above-mentioned conditions at the same time using a dynamic single path in a multi hop sensor network. In REDS, each node transmits data through the optimal single path using hop count to the sink and average residual energy according to the change of external environment. For reliable data transmission, each node monitors its own transmission process. In case of a topological change, only the changed part is reconstructed instead of the whole network, and this enhances the energy efficiency of the network. The results of experiment showed that REDS proposed in this study is superior in energy efficiency and provide its adaptability to topological changes.
{"title":"REDS: Robust and Energy Efficient Dynamic Single Path Routing in a Multi Hop Sensor Network","authors":"Seong-Yong Choi, Jin-Su Kim, Jung-Hyun Lee, Joong-Kyung Ryu, K. Rim","doi":"10.1109/ICCSN.2010.73","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.73","url":null,"abstract":"As a sensor network has a limited node resources and unexpected changes of external environment, its nodes should show energy efficiency, reliable data transmission, and topological adaptation to the change of external environment. However, it is not easy to satisfy these requirements at the same time. This study proposes Robust and Energy efficient Dynamic Single path routing (REDS), a routing mechanism that satisfies the above-mentioned conditions at the same time using a dynamic single path in a multi hop sensor network. In REDS, each node transmits data through the optimal single path using hop count to the sink and average residual energy according to the change of external environment. For reliable data transmission, each node monitors its own transmission process. In case of a topological change, only the changed part is reconstructed instead of the whole network, and this enhances the energy efficiency of the network. The results of experiment showed that REDS proposed in this study is superior in energy efficiency and provide its adaptability to topological changes.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125087789","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}
Application development security utilizes a list of threats that identify and organize application security classes of attack. The developed system is decomposed into relevant components and then each component is analyzed for threats. Data flow diagrams (DFDs) are typically used to graphically represent a system. In this paper we propose a flow-based model as an alternative methodology for identification and classification of threats.
{"title":"Threat Risk Modeling","authors":"S. Al-Fedaghi, Asad A. Alrashed","doi":"10.1109/ICCSN.2010.29","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.29","url":null,"abstract":"Application development security utilizes a list of threats that identify and organize application security classes of attack. The developed system is decomposed into relevant components and then each component is analyzed for threats. Data flow diagrams (DFDs) are typically used to graphically represent a system. In this paper we propose a flow-based model as an alternative methodology for identification and classification of threats.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130168450","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}
There are a lot of text documents on the Web which contain opinions or sentiments about an object such as software reviews, product reviews, movies reviews, music reviews, and book reviews etc. Opinion mining or sentiment classification aim to extract the features on which the reviewers express their opinions and determine they are positive or negative. In this paper we proposed an ontology based combination approach to enhance the existing approaches of the sentiment classification. We also used the supervised learning techniques for classification of the sentiments in the software reviews. This paper proposed the combination of using Natural Language Processing techniques (NLP), ontology based on Formal Concept Analysis (FCA) design, and Support Vector Machine (SVM) for classifying the software reviews are positive, negative or neutral.
{"title":"Sentiment Classification Based on Ontology and SVM Classifier","authors":"Khin Phyu Phyu Shein, T. Nyunt","doi":"10.1109/ICCSN.2010.35","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.35","url":null,"abstract":"There are a lot of text documents on the Web which contain opinions or sentiments about an object such as software reviews, product reviews, movies reviews, music reviews, and book reviews etc. Opinion mining or sentiment classification aim to extract the features on which the reviewers express their opinions and determine they are positive or negative. In this paper we proposed an ontology based combination approach to enhance the existing approaches of the sentiment classification. We also used the supervised learning techniques for classification of the sentiments in the software reviews. This paper proposed the combination of using Natural Language Processing techniques (NLP), ontology based on Formal Concept Analysis (FCA) design, and Support Vector Machine (SVM) for classifying the software reviews are positive, negative or neutral.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130627615","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}
Guodong Li, Zhen Chen, An'an Luo, Y. Xue, Jun Li, Chuang Lin
In order to provide the service differentiation for various network applications, and guarantee delay and bandwidth requirement, packet scheduling is considered as a hot research topic and a crucial module in network device. In high speed network, it is hard to maintain and schedule a great number of queues for millions of in-progress flows in memory in line speed. In this paper, we propose a scalable per-flow scheduling scheme using a small fast memory to achieve fine-grained service guarantee. A limited number of queues are dynamically shared among concurrent flows based on the interesting fact that the number of simultaneous active flows is only in hundreds whatever the link speed is. The scheduling scheme is in a scalable hierarchical manner, in which the first layer supplies service differentiation and the second guarantees bandwidth and delay. We also implement an instance based on this scheme called DQS-SPQ-DRR (Dynamic Queue Sharing-Strict Priority Queue-Deficit Round Robin). Experiments based on real and synthetic traces are conducted to evaluate the DQS-SPQ-DRR. The results demonstrate that DQS-SPQ-DRR is well held in small memory and supplies per-flow service guarantee.
{"title":"A Scalable Per-flow Priority Scheduling Scheme for High-Speed Network","authors":"Guodong Li, Zhen Chen, An'an Luo, Y. Xue, Jun Li, Chuang Lin","doi":"10.1109/ICCSN.2010.17","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.17","url":null,"abstract":"In order to provide the service differentiation for various network applications, and guarantee delay and bandwidth requirement, packet scheduling is considered as a hot research topic and a crucial module in network device. In high speed network, it is hard to maintain and schedule a great number of queues for millions of in-progress flows in memory in line speed. In this paper, we propose a scalable per-flow scheduling scheme using a small fast memory to achieve fine-grained service guarantee. A limited number of queues are dynamically shared among concurrent flows based on the interesting fact that the number of simultaneous active flows is only in hundreds whatever the link speed is. The scheduling scheme is in a scalable hierarchical manner, in which the first layer supplies service differentiation and the second guarantees bandwidth and delay. We also implement an instance based on this scheme called DQS-SPQ-DRR (Dynamic Queue Sharing-Strict Priority Queue-Deficit Round Robin). Experiments based on real and synthetic traces are conducted to evaluate the DQS-SPQ-DRR. The results demonstrate that DQS-SPQ-DRR is well held in small memory and supplies per-flow service guarantee.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130585516","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}
Gun-Woo Kim, Seung Hoon Lee, Jae Hyung Kim, J. Son
A number of business organizations are beginning to realize the importance of business process management. However, process can often go the way they were initially not designed for or a non-efficient performance process model could be designed. To solve this problem, business process mining which can be used as the basis for the business process re-engineering has been recognized to an important concept. However, current research in the domain of process mining has only focused on extracting a workflow-based process model from completed process logs. Thus, there is a limitation in expressing various types of business processes, and moreover, process discovery and log scanning take a considerable amount of time. In this paper, we present a modified FP-tree algorithm for FP-tree based business processes, which are used for association analysis in data mining. Our modified algorithm supports the discovery of an appropriate level of the process model according to the user's need without re-scanning all the process logs during updating.
{"title":"An Effective Algorithm for Business Process Mining Based on Modified FP-Tree Algorithm","authors":"Gun-Woo Kim, Seung Hoon Lee, Jae Hyung Kim, J. Son","doi":"10.1109/ICCSN.2010.77","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.77","url":null,"abstract":"A number of business organizations are beginning to realize the importance of business process management. However, process can often go the way they were initially not designed for or a non-efficient performance process model could be designed. To solve this problem, business process mining which can be used as the basis for the business process re-engineering has been recognized to an important concept. However, current research in the domain of process mining has only focused on extracting a workflow-based process model from completed process logs. Thus, there is a limitation in expressing various types of business processes, and moreover, process discovery and log scanning take a considerable amount of time. In this paper, we present a modified FP-tree algorithm for FP-tree based business processes, which are used for association analysis in data mining. Our modified algorithm supports the discovery of an appropriate level of the process model according to the user's need without re-scanning all the process logs during updating.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116308016","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}
This paper is intended to present the design procedure for microstrip filters using artificial neural networks to provide better resolution and cutoff characteristics. The design concept has been evaluated with specific design of Low pass filters at the application specific frequencies. In this design procedure, synthesis is defined as the forward side and then analysis as the reverse side of the problem. To achieve results, the neural network is employed as a tool in design of microstrip filters. Neural network Training algorithms are used to train the samples so that error can be minimized and sharpness of slop is improved.
{"title":"Design of Microstrip Filters Using Neural Network","authors":"G. Tomar, V. Kushwah, Shilpam Saxena","doi":"10.1109/ICCSN.2010.103","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.103","url":null,"abstract":"This paper is intended to present the design procedure for microstrip filters using artificial neural networks to provide better resolution and cutoff characteristics. The design concept has been evaluated with specific design of Low pass filters at the application specific frequencies. In this design procedure, synthesis is defined as the forward side and then analysis as the reverse side of the problem. To achieve results, the neural network is employed as a tool in design of microstrip filters. Neural network Training algorithms are used to train the samples so that error can be minimized and sharpness of slop is improved.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121764778","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}
One of the main advantages of new wireless systems is the freedom to make and receive calls anywhere and at any time; handovers are considered a key element for providing this mobility. This paper presents the handoff queuing problem in cellular networks. We propose a model to study three handoff queuing schemes, and provide a performance evaluation of these ones. The paper begin by a presentation of the different handoff queuing scheme to evaluate. Then, gives an evaluation model with the different assumption considered in the simulations. The evaluation concerns the blocking probability for handoff and original calls. These simulations are conducted for each scheme, according to different offered loads, size of call (original and handoff) queue, and number of voice channels. A model is proposed and introduced in this paper for the study of three channel assignment schemes; namely, they are the non prioritized schemes (NPS), the original call queuing schemes, and the handoff call queuing schemes.
{"title":"Performance Evaluation of Handoff Queuing Schemes","authors":"M. Ahmed, Noureddin M. Ibrahim, H.H. El-Tamally","doi":"10.1109/ICCSN.2010.44","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.44","url":null,"abstract":"One of the main advantages of new wireless systems is the freedom to make and receive calls anywhere and at any time; handovers are considered a key element for providing this mobility. This paper presents the handoff queuing problem in cellular networks. We propose a model to study three handoff queuing schemes, and provide a performance evaluation of these ones. The paper begin by a presentation of the different handoff queuing scheme to evaluate. Then, gives an evaluation model with the different assumption considered in the simulations. The evaluation concerns the blocking probability for handoff and original calls. These simulations are conducted for each scheme, according to different offered loads, size of call (original and handoff) queue, and number of voice channels. A model is proposed and introduced in this paper for the study of three channel assignment schemes; namely, they are the non prioritized schemes (NPS), the original call queuing schemes, and the handoff call queuing schemes.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"241 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128402378","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
扫码关注我们
求助内容：
应助结果提醒方式：