In this paper, we propose a novel approach for the optimal communication spanning tree (OCST) problem. Our algorithm is based on the Particle Swarm Optimization (PSO) technique and take account into node biased encoding (NBE) scheme to find nearly optimal solution. The new algorithm can achieve a result that is better than known heuristic algorithms do, as verified by a set of public benchmark problem instances.
{"title":"A Novel Particle Swarm Optimization-Based Algorithm for the Optimal Communication Spanning Tree Problem","authors":"A. Hoang, V. Le, Nhu Gia Nguyen","doi":"10.1109/ICCSN.2010.111","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.111","url":null,"abstract":"In this paper, we propose a novel approach for the optimal communication spanning tree (OCST) problem. Our algorithm is based on the Particle Swarm Optimization (PSO) technique and take account into node biased encoding (NBE) scheme to find nearly optimal solution. The new algorithm can achieve a result that is better than known heuristic algorithms do, as verified by a set of public benchmark problem instances.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"52 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":"127569327","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}
In this paper, we incorporate an interval type-2 self-organizing neural fuzzy system (IT2SNFS) into decision feedback equalizer (DFE) for time-varying channels. By exploiting the structure and parameter learning algorithms of the IT2SNFS, the proposed DFE is able to obtain the improved performance without the estimation of the channel order. Moreover, the IT2SNFS can set conditions on the increase demand of the fuzzy rules and hence the DFE results in little hardware complexity. We show in simulations that the IT2SNFS-based DFE performs much better than the traditional DFE methods in time-varying channels.
{"title":"Excellent Performance of DFE Based on IT2SNFS in Time-Varying Channels","authors":"Yao-Jen Chang, C. Ho","doi":"10.1109/ICCSN.2010.51","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.51","url":null,"abstract":"In this paper, we incorporate an interval type-2 self-organizing neural fuzzy system (IT2SNFS) into decision feedback equalizer (DFE) for time-varying channels. By exploiting the structure and parameter learning algorithms of the IT2SNFS, the proposed DFE is able to obtain the improved performance without the estimation of the channel order. Moreover, the IT2SNFS can set conditions on the increase demand of the fuzzy rules and hence the DFE results in little hardware complexity. We show in simulations that the IT2SNFS-based DFE performs much better than the traditional DFE methods in time-varying channels.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"51 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":"127643917","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}
as software systems enlarges, software complexity increases and controlling of the software management will be highly important. Systems are decomposed into many components, of which their organization shows new problems in software architecture. Selecting appropriate components for system architecture plays an important role in success or failure of software. This paper reviews the old and present styles of software architecture and presents a survey on classification of the styles. In this survey, advantages and disadvantages of three kinds of classifications are analyzed, and some criterions for choosing a suitable style in different applications are also presented.
{"title":"Software Architecture: A Survey and Classification","authors":"Emad Majidi, M. Alemi, H. Rashidi","doi":"10.1109/ICCSN.2010.94","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.94","url":null,"abstract":"as software systems enlarges, software complexity increases and controlling of the software management will be highly important. Systems are decomposed into many components, of which their organization shows new problems in software architecture. Selecting appropriate components for system architecture plays an important role in success or failure of software. This paper reviews the old and present styles of software architecture and presents a survey on classification of the styles. In this survey, advantages and disadvantages of three kinds of classifications are analyzed, and some criterions for choosing a suitable style in different applications are also presented.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"69 4 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":"122731575","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}
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}
While the event extraction and event based natural language processing system have been extensively studied, very little of the work has been done on the annotation of Chinese event. Annotating Chinese event in the text is a complex task. This paper focuses on the taggability of Chinese event, the pre-requisite of annotating Chinese event. A comprehensive questionnaire for tagging Chinese event is designed. The syntactical and semantic structures of Chinese event in the questionnaire are analyzed, and some rules for tagging the Chinese event are proposed. Experiments on the annotation of two hundreds Chinese emergency news show our guidelines obviously improve the inter-annotator agreement of tagging Chinese event denoters.
{"title":"A Study of Chinese Event Taggability","authors":"Jianfeng Fu, Wei Liu, Zongtian Liu, Sha-sha Zhu","doi":"10.1109/ICCSN.2010.20","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.20","url":null,"abstract":"While the event extraction and event based natural language processing system have been extensively studied, very little of the work has been done on the annotation of Chinese event. Annotating Chinese event in the text is a complex task. This paper focuses on the taggability of Chinese event, the pre-requisite of annotating Chinese event. A comprehensive questionnaire for tagging Chinese event is designed. The syntactical and semantic structures of Chinese event in the questionnaire are analyzed, and some rules for tagging the Chinese event are proposed. Experiments on the annotation of two hundreds Chinese emergency news show our guidelines obviously improve the inter-annotator agreement of tagging Chinese event denoters.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"42 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":"127925468","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}
Md. Amir Ali Hasan, Faiza Nabita, A. Khandakar, I. Ahmed, Farruk Ahmed
This paper proposes an idea of developing a model of estimating timing offset error of OFDM (Orthogonal Frequency Division Multiplexing) system without the use of additional pilots relying on inherent characteristics of the OFDM signal. An analytical expression has been derived and formulated to analyze the effect of bit error rate (BER) due to timing offset introduced by the transmission channel. This will help in determining the exact length of cyclic prefix to be added to each OFDM symbol to avoid misinterpretation by the receiver. The performances have also been evaluated under coded (convolution) and uncoded systems. The introduction of channel coding decreases this basic impairment of OFDM systems significantly. Simulated results show that the symbol error rate (SER) linearly depends on timing offset. It is expected that further works on the proposed estimated method will lead to a standard model so that at the receiving end the effect of timing offset can be eliminated totally.
本文提出了一种基于正交频分复用(OFDM)信号的固有特性，在不使用额外导频的情况下，建立OFDM (Orthogonal Frequency Division Multiplexing)系统时偏误差估计模型的想法。推导并建立了一个解析表达式，用于分析传输信道引入的时序偏移对误码率的影响。这将有助于确定要添加到每个OFDM符号的循环前缀的确切长度，以避免接收器误解。在编码(卷积)和非编码系统下也评估了性能。信道编码的引入大大降低了OFDM系统的这一基本缺陷。仿真结果表明，码元误差率与时序偏移量呈线性关系。期望对所提出的估计方法的进一步研究将产生一个标准模型，以便在接收端完全消除时序偏移的影响。
{"title":"Analytical Evaluation of Timing Offset Error in OFDM System","authors":"Md. Amir Ali Hasan, Faiza Nabita, A. Khandakar, I. Ahmed, Farruk Ahmed","doi":"10.1109/ICCSN.2010.89","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.89","url":null,"abstract":"This paper proposes an idea of developing a model of estimating timing offset error of OFDM (Orthogonal Frequency Division Multiplexing) system without the use of additional pilots relying on inherent characteristics of the OFDM signal. An analytical expression has been derived and formulated to analyze the effect of bit error rate (BER) due to timing offset introduced by the transmission channel. This will help in determining the exact length of cyclic prefix to be added to each OFDM symbol to avoid misinterpretation by the receiver. The performances have also been evaluated under coded (convolution) and uncoded systems. The introduction of channel coding decreases this basic impairment of OFDM systems significantly. Simulated results show that the symbol error rate (SER) linearly depends on timing offset. It is expected that further works on the proposed estimated method will lead to a standard model so that at the receiving end the effect of timing offset can be eliminated totally.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"9 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":"128354149","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}
Shahid Abbas, Waqas Ali Khan, Talha Khan, S. Ahmed
Broadband Wireless Access (BWA) is a promising technology which can offer high speed voice, video and internet connection. The leading candidate for BWA is WiMAX, a technology that complies with the IEEE 802.16 family of standards. This paper is focused towards the hardware Implementation of WirelessMAN-OFDM Physical Layer of IEEE Std 802.16d Transmitter on FPGA. The RTL coding style of Verilog HDL was used which gave a high level design-flow for developing and validating communication system protocols and provides flexibility of modifications in future in order to meet real world performance evaluation. The proposed design is fully supportive to adaptive modulation schemes described in IEEE Std 802.16d and equipped with soft interfaces for MAC layer and RF-front end, so that in future more work could be done in order to deploy complete WiMAX CPE IP core.
{"title":"Implementation of OFDM Baseband Trasmitter Compliant IEEE Std 802.16d on FPGA","authors":"Shahid Abbas, Waqas Ali Khan, Talha Khan, S. Ahmed","doi":"10.1109/ICCSN.2010.83","DOIUrl":"https://doi.org/10.1109/ICCSN.2010.83","url":null,"abstract":"Broadband Wireless Access (BWA) is a promising technology which can offer high speed voice, video and internet connection. The leading candidate for BWA is WiMAX, a technology that complies with the IEEE 802.16 family of standards. This paper is focused towards the hardware Implementation of WirelessMAN-OFDM Physical Layer of IEEE Std 802.16d Transmitter on FPGA. The RTL coding style of Verilog HDL was used which gave a high level design-flow for developing and validating communication system protocols and provides flexibility of modifications in future in order to meet real world performance evaluation. The proposed design is fully supportive to adaptive modulation schemes described in IEEE Std 802.16d and equipped with soft interfaces for MAC layer and RF-front end, so that in future more work could be done in order to deploy complete WiMAX CPE IP core.","PeriodicalId":255246,"journal":{"name":"2010 Second International Conference on Communication Software and Networks","volume":"18 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":"128362068","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
扫码关注我们
求助内容：
应助结果提醒方式：