Pub Date : 2013-03-25DOI: 10.1109/ICE-CCN.2013.6528584
I. Khan, R. Kumari, S. Behera
Design of four element rectangular shaped dielectric resonator antenna (RDRA) array is presented for wireless applications. The RDRA array is excited by rectangular conformal patch (RCP) connected to microstrip line which is an effective feed mechanism and more efficient in energy coupling. Simulation result shows that the proposed antenna achieves an impedance bandwidth from 4 GHz to 7.1 GHz covering wireless bands. Parametric studies have been carried out by varying the RCP and the ground plane of the final design. The proposed antenna gives the appreciable gain and better radiation pattern at the resonant frequencies.
{"title":"A four element rectangular dielectric resonator antenna array for wireless applications","authors":"I. Khan, R. Kumari, S. Behera","doi":"10.1109/ICE-CCN.2013.6528584","DOIUrl":"https://doi.org/10.1109/ICE-CCN.2013.6528584","url":null,"abstract":"Design of four element rectangular shaped dielectric resonator antenna (RDRA) array is presented for wireless applications. The RDRA array is excited by rectangular conformal patch (RCP) connected to microstrip line which is an effective feed mechanism and more efficient in energy coupling. Simulation result shows that the proposed antenna achieves an impedance bandwidth from 4 GHz to 7.1 GHz covering wireless bands. Parametric studies have been carried out by varying the RCP and the ground plane of the final design. The proposed antenna gives the appreciable gain and better radiation pattern at the resonant frequencies.","PeriodicalId":286830,"journal":{"name":"2013 IEEE International Conference ON Emerging Trends in Computing, Communication and Nanotechnology (ICECCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128530551","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 : 2013-03-25DOI: 10.1109/ICE-CCN.2013.6528513
T. Deepa, R. Kumar
Orthogonal Frequency Division Multiplexing (OFDM) is an efficient transmission technique for high data rate communication systems. The major problem of OFDM system is Peak to Average Power Ratio (PAPR) which reduces the efficiency of the system and increases the system complexity. In this paper, logarithmic based companding (i.e, mu law) and Square rooting companding (SQRT) have been suggested as simple and effective PAPR reduction techniques for OFDM. This paper analyzes mu law and SQRT companding OFDM signal on M ary QAM modulation technique. Simulation results show that the SQRT OFDM system is an effective technique in reducing PAPR and improved BER performance than OFDM system with mu-law companding transform. Comparison among mu law and SQRT companding techniques is made for the best suited companding technique for PAPR reduction in OFDM system. The Simulation result also shows that by modulating a signal at a fixed subcarriers for different modulation technique, the error in the transmitted data increases rapidly whereas in case of fixed modulation techniques, increasing the number of subcarriers the PAPR increases at the transmit, the bit error rate (BER) in the transmitted data is constant and varies by a small fraction.
{"title":"Performance analysis of μ-law companding & SQRT techniques for M-QAM OFDM systems","authors":"T. Deepa, R. Kumar","doi":"10.1109/ICE-CCN.2013.6528513","DOIUrl":"https://doi.org/10.1109/ICE-CCN.2013.6528513","url":null,"abstract":"Orthogonal Frequency Division Multiplexing (OFDM) is an efficient transmission technique for high data rate communication systems. The major problem of OFDM system is Peak to Average Power Ratio (PAPR) which reduces the efficiency of the system and increases the system complexity. In this paper, logarithmic based companding (i.e, mu law) and Square rooting companding (SQRT) have been suggested as simple and effective PAPR reduction techniques for OFDM. This paper analyzes mu law and SQRT companding OFDM signal on M ary QAM modulation technique. Simulation results show that the SQRT OFDM system is an effective technique in reducing PAPR and improved BER performance than OFDM system with mu-law companding transform. Comparison among mu law and SQRT companding techniques is made for the best suited companding technique for PAPR reduction in OFDM system. The Simulation result also shows that by modulating a signal at a fixed subcarriers for different modulation technique, the error in the transmitted data increases rapidly whereas in case of fixed modulation techniques, increasing the number of subcarriers the PAPR increases at the transmit, the bit error rate (BER) in the transmitted data is constant and varies by a small fraction.","PeriodicalId":286830,"journal":{"name":"2013 IEEE International Conference ON Emerging Trends in Computing, Communication and Nanotechnology (ICECCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116925941","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 : 2013-03-25DOI: 10.1109/ICE-CCN.2013.6528526
M. Baskar, T. Gnanasekaran, S. Saravanan
Distributed Denial of Service (DDoS) attacks is measured to be a vital threat to the net. Because of memory less feature of the net routing mechanism, it's extraordinarily onerous to trace back to the supply of those attacks. Ancient packet marking techniques are not any longer applied because of its high memory consumption and poor measurability. During this paper, we have a tendency to build use of entropy variation to observe the attack that differentiates between traditional and DDoS attack traffic. However it will solely be applied to observe the attack during which rate of the traffic flow is incredibly high. There are also many attacks during which the strength of the attack is also meager, however the results of those attacks might be still severe. So it's essential to observe such attacks that square measure in lower order in terms of information rate. We have a tendency to propose an Adaptive Attack Detection System (AADS) that is capable of detection DDoS attacks regardless of the attack strength.
{"title":"Adaptive IP traceback mechanism for detecting low rate DDoS attacks","authors":"M. Baskar, T. Gnanasekaran, S. Saravanan","doi":"10.1109/ICE-CCN.2013.6528526","DOIUrl":"https://doi.org/10.1109/ICE-CCN.2013.6528526","url":null,"abstract":"Distributed Denial of Service (DDoS) attacks is measured to be a vital threat to the net. Because of memory less feature of the net routing mechanism, it's extraordinarily onerous to trace back to the supply of those attacks. Ancient packet marking techniques are not any longer applied because of its high memory consumption and poor measurability. During this paper, we have a tendency to build use of entropy variation to observe the attack that differentiates between traditional and DDoS attack traffic. However it will solely be applied to observe the attack during which rate of the traffic flow is incredibly high. There are also many attacks during which the strength of the attack is also meager, however the results of those attacks might be still severe. So it's essential to observe such attacks that square measure in lower order in terms of information rate. We have a tendency to propose an Adaptive Attack Detection System (AADS) that is capable of detection DDoS attacks regardless of the attack strength.","PeriodicalId":286830,"journal":{"name":"2013 IEEE International Conference ON Emerging Trends in Computing, Communication and Nanotechnology (ICECCN)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127046669","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 : 2013-03-25DOI: 10.1109/ICE-CCN.2013.6528508
S. Suganya, P. Shanmugapriya, T. R. Priyadharshini
The feasibility of physical layer security approach for communication in the presence of one or more eavesdroppers. In the previous scheme, the one-way cooperative networks can be used for transferring information from source to destination. At present this technique is implemented without the eavesdroppers and it becomes ineffective due to sometimes attackers can hack the file. In future this work is carried out in two-way cooperative networks using two-stage cooperative protocol and the objective is to design the system for secrecy capacity maximization or transmit power minimization. The information can be divided into two halves then transferred into intermediate nodes and then merge the files to the destination. By implementing two-stage cooperative protocol will maximize the secrecy capacity in the presence of eavesdroppers by selecting relay and jamming nodes.
{"title":"Improving security in two-way relay networks by optimal relay and jammer selection","authors":"S. Suganya, P. Shanmugapriya, T. R. Priyadharshini","doi":"10.1109/ICE-CCN.2013.6528508","DOIUrl":"https://doi.org/10.1109/ICE-CCN.2013.6528508","url":null,"abstract":"The feasibility of physical layer security approach for communication in the presence of one or more eavesdroppers. In the previous scheme, the one-way cooperative networks can be used for transferring information from source to destination. At present this technique is implemented without the eavesdroppers and it becomes ineffective due to sometimes attackers can hack the file. In future this work is carried out in two-way cooperative networks using two-stage cooperative protocol and the objective is to design the system for secrecy capacity maximization or transmit power minimization. The information can be divided into two halves then transferred into intermediate nodes and then merge the files to the destination. By implementing two-stage cooperative protocol will maximize the secrecy capacity in the presence of eavesdroppers by selecting relay and jamming nodes.","PeriodicalId":286830,"journal":{"name":"2013 IEEE International Conference ON Emerging Trends in Computing, Communication and Nanotechnology (ICECCN)","volume":"199 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123034297","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 : 2013-03-25DOI: 10.1109/ICE-CCN.2013.6528592
A. Kumar, S. Kansal, M. Hanmandlu
We have presented a simple two equation model which produces the rich behavior of biological neurons, including tonic spiking, tonic bursting, mixed mode firing, spike frequency adaptation, resonator, integrator etc. Our model is capable of producing 19 different kinds of dynamics of real biological neuron. We have illustrated the richness and complexity of spiking behavior of individual neuron in response to simple pulses of dc current.
{"title":"Classification of different neuron behavior by designing spiking neuron model","authors":"A. Kumar, S. Kansal, M. Hanmandlu","doi":"10.1109/ICE-CCN.2013.6528592","DOIUrl":"https://doi.org/10.1109/ICE-CCN.2013.6528592","url":null,"abstract":"We have presented a simple two equation model which produces the rich behavior of biological neurons, including tonic spiking, tonic bursting, mixed mode firing, spike frequency adaptation, resonator, integrator etc. Our model is capable of producing 19 different kinds of dynamics of real biological neuron. We have illustrated the richness and complexity of spiking behavior of individual neuron in response to simple pulses of dc current.","PeriodicalId":286830,"journal":{"name":"2013 IEEE International Conference ON Emerging Trends in Computing, Communication and Nanotechnology (ICECCN)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131583703","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 : 2013-03-25DOI: 10.1109/ICE-CCN.2013.6528531
Sarabjot Singh, N. Mishra, S. Sharma
Into the bloggers or a blog network, there are some users who cause a great influence over other users of the network. In this paper we refer these kinds of users as Influential Users (IU). IUs are those users that cause the other users to do some actions on the documents and contents published by him or her. The IU is being used by different organizations for viral marketing by using blogging sites. The organization wants to market a new product by using a small group of potential users to get profit. In this paper, we focus on the various approaches that helps in determination of IUs, some of them are based on the topology of the social network and some are based on hyperlink and later we discuss the new approach to finding the influential user which is based on the activities that the users performs in social networks, utilizing their diffusion history.
{"title":"Survey of various techniques for determining influential users in social networks","authors":"Sarabjot Singh, N. Mishra, S. Sharma","doi":"10.1109/ICE-CCN.2013.6528531","DOIUrl":"https://doi.org/10.1109/ICE-CCN.2013.6528531","url":null,"abstract":"Into the bloggers or a blog network, there are some users who cause a great influence over other users of the network. In this paper we refer these kinds of users as Influential Users (IU). IUs are those users that cause the other users to do some actions on the documents and contents published by him or her. The IU is being used by different organizations for viral marketing by using blogging sites. The organization wants to market a new product by using a small group of potential users to get profit. In this paper, we focus on the various approaches that helps in determination of IUs, some of them are based on the topology of the social network and some are based on hyperlink and later we discuss the new approach to finding the influential user which is based on the activities that the users performs in social networks, utilizing their diffusion history.","PeriodicalId":286830,"journal":{"name":"2013 IEEE International Conference ON Emerging Trends in Computing, Communication and Nanotechnology (ICECCN)","volume":"12 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132467295","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 : 2013-03-25DOI: 10.1109/ICE-CCN.2013.6528478
P. Jayakrishnan, R. Niyas, K. H. Maillikarjun
By the arrival of latest video standards viz. MPEG-4 part 10 and H.264/H.26L, the usages of Advanced Video Coding (AVC) especially in the part of Variable Block Size (VBS) Motion Estimation (ME) are rising. A new architecture is developed for variable block size motion estimation using full search algorithm in this paper. There are two calculations carried out in this paper block size, which is variable, and another is the Sum of Absolute Differences (SAD), which are presented by recycling the outputs of reduced sub-block calculations. Mechanism that is incorporated by every processing element is shuffling mechanism. HDL verification is done through ModelSim simulator to verify the functionality. The design is implemented using TSMC 90nm CMOS technology. The frequency of the motion estimation block is 323.20 MHz, which can treat up to 41 Motion Vectors (MV).
由于最新视频标准的到来，即MPEG-4 part 10和H.264/H。26L中，高级视频编码(AVC)特别是可变块大小(VBS)运动估计(ME)部分的应用越来越多。本文提出了一种基于全搜索算法的可变块大小运动估计新架构。本文进行了两种块大小的计算，一种是可变的，另一种是绝对差和(Sum of Absolute difference, SAD)，它是通过回收减少子块计算的输出来表示的。每个处理要素所结合的机制是洗牌机制。HDL验证通过ModelSim模拟器来验证功能。该设计采用台积电90nm CMOS技术实现。运动估计块的频率为323.20 MHz，最多可处理41个运动矢量(MV)。
{"title":"High speed architecture for Variable Block Size Motion Estimation in H.264","authors":"P. Jayakrishnan, R. Niyas, K. H. Maillikarjun","doi":"10.1109/ICE-CCN.2013.6528478","DOIUrl":"https://doi.org/10.1109/ICE-CCN.2013.6528478","url":null,"abstract":"By the arrival of latest video standards viz. MPEG-4 part 10 and H.264/H.26L, the usages of Advanced Video Coding (AVC) especially in the part of Variable Block Size (VBS) Motion Estimation (ME) are rising. A new architecture is developed for variable block size motion estimation using full search algorithm in this paper. There are two calculations carried out in this paper block size, which is variable, and another is the Sum of Absolute Differences (SAD), which are presented by recycling the outputs of reduced sub-block calculations. Mechanism that is incorporated by every processing element is shuffling mechanism. HDL verification is done through ModelSim simulator to verify the functionality. The design is implemented using TSMC 90nm CMOS technology. The frequency of the motion estimation block is 323.20 MHz, which can treat up to 41 Motion Vectors (MV).","PeriodicalId":286830,"journal":{"name":"2013 IEEE International Conference ON Emerging Trends in Computing, Communication and Nanotechnology (ICECCN)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121846841","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 : 2013-03-25DOI: 10.1109/ICE-CCN.2013.6528470
A. Prakash, S. Kirubaveni
Recently digital signal processing has received high attention due to the advancement in multimedia and wireless communication. Accordingly Orthogonal Frequency Division Multiple Access (OFDM) technique based on Time Division Duplex (TDD) is an attractive technology for high data rate wireless access in multichannel communication. The modulation and demodulation of OFDM are done by Fast Fourier Transform (FFT) and Inverse Fast Fourier Transform (IFFT) respectively. In this paper we propose a Vedic algorithm for the implementation of multiplier that is to be used in radix 25 512-point FFT processor. The multipliers based on Vedic mathematics are one of the fastest and low power multiplier. It enables parallel generation of partial product and eliminates unwanted multiplication steps. Thus Vedic multipliers ensure substantial reduction of propagation delay in FFT processor. The FFT processor employing Vedic multiplier reduces hardware complexity in area and power in FPGA implementation. The proposed processor has been designed in Xilinx and implemented using Spartan 3E FPGA kit with a supply voltage of 1.2 V. The delay and power obtained using the Vedic multiplier are 173.60ns and 11×10-2 W respectively.
近年来，随着多媒体和无线通信技术的发展，数字信号处理受到了人们的高度重视。因此，基于时分双工(TDD)的正交频分多址(OFDM)技术是实现多信道通信中高数据速率无线接入的一种有吸引力的技术。OFDM的调制和解调分别由快速傅立叶变换(FFT)和反快速傅立叶变换(IFFT)完成。本文提出了一种用于基数为25的512点FFT处理器的乘法器的Vedic算法。基于吠陀数学的乘法器是最快和低功率的乘法器之一。它可以并行生成部分乘积，并消除不必要的乘法步骤。因此，韦达乘法器确保了FFT处理器中传播延迟的大幅减少。采用Vedic乘法器的FFT处理器在FPGA实现中降低了硬件的面积和功耗复杂度。该处理器由赛灵思公司设计，采用电源电压为1.2 V的Spartan 3E FPGA套件实现。使用韦达乘法器获得的延迟和功率分别为173.60ns和11×10-2 W。
{"title":"Performance evaluation of FFT processor using conventional and Vedic algorithm","authors":"A. Prakash, S. Kirubaveni","doi":"10.1109/ICE-CCN.2013.6528470","DOIUrl":"https://doi.org/10.1109/ICE-CCN.2013.6528470","url":null,"abstract":"Recently digital signal processing has received high attention due to the advancement in multimedia and wireless communication. Accordingly Orthogonal Frequency Division Multiple Access (OFDM) technique based on Time Division Duplex (TDD) is an attractive technology for high data rate wireless access in multichannel communication. The modulation and demodulation of OFDM are done by Fast Fourier Transform (FFT) and Inverse Fast Fourier Transform (IFFT) respectively. In this paper we propose a Vedic algorithm for the implementation of multiplier that is to be used in radix 25 512-point FFT processor. The multipliers based on Vedic mathematics are one of the fastest and low power multiplier. It enables parallel generation of partial product and eliminates unwanted multiplication steps. Thus Vedic multipliers ensure substantial reduction of propagation delay in FFT processor. The FFT processor employing Vedic multiplier reduces hardware complexity in area and power in FPGA implementation. The proposed processor has been designed in Xilinx and implemented using Spartan 3E FPGA kit with a supply voltage of 1.2 V. The delay and power obtained using the Vedic multiplier are 173.60ns and 11×10-2 W respectively.","PeriodicalId":286830,"journal":{"name":"2013 IEEE International Conference ON Emerging Trends in Computing, Communication and Nanotechnology (ICECCN)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127726044","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 : 2013-03-25DOI: 10.1109/ICE-CCN.2013.6528536
A. Priyanka, K. Balasubramanian
Anonymous web browsing is an emerging research topic that allows anyone to surf the web privately and securely. However, research on low latency anonymity application including web browsing has received greater attention in order to preserve anonymity but it is quite impractical due to the enormous delay and extra bandwidth demand caused by the current dummy packet padding strategy against traffic analysis attacks. To overcome this problem, we propose a new packet padding strategy to replace the current dominant dummy packet padding strategy for anonymous web browsing systems. The proposed method uses prefetched pages as the cover traffic rather than the dummy packets. With the proposed model, we compared our proposal and the previous scheme in terms of the metric Anonymization Effectiveness (AE) theoretically. Moreover, we defined a metric to measure the efficiency of different padding strategies and established a mathematical model for the traffic analysis attack. Finally, the experimental results have shown that the proposed method is efficient in reducing the delay and bandwidth waste compared to that of dummy packet padding method which confirmed the potentials of the proposed strategy.
{"title":"Efficient anonymous web browsing preventing traffic analysis attacks","authors":"A. Priyanka, K. Balasubramanian","doi":"10.1109/ICE-CCN.2013.6528536","DOIUrl":"https://doi.org/10.1109/ICE-CCN.2013.6528536","url":null,"abstract":"Anonymous web browsing is an emerging research topic that allows anyone to surf the web privately and securely. However, research on low latency anonymity application including web browsing has received greater attention in order to preserve anonymity but it is quite impractical due to the enormous delay and extra bandwidth demand caused by the current dummy packet padding strategy against traffic analysis attacks. To overcome this problem, we propose a new packet padding strategy to replace the current dominant dummy packet padding strategy for anonymous web browsing systems. The proposed method uses prefetched pages as the cover traffic rather than the dummy packets. With the proposed model, we compared our proposal and the previous scheme in terms of the metric Anonymization Effectiveness (AE) theoretically. Moreover, we defined a metric to measure the efficiency of different padding strategies and established a mathematical model for the traffic analysis attack. Finally, the experimental results have shown that the proposed method is efficient in reducing the delay and bandwidth waste compared to that of dummy packet padding method which confirmed the potentials of the proposed strategy.","PeriodicalId":286830,"journal":{"name":"2013 IEEE International Conference ON Emerging Trends in Computing, Communication and Nanotechnology (ICECCN)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120946676","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 : 2013-03-25DOI: 10.1109/ICE-CCN.2013.6528492
Annie Ratna Priya, M. Mythily
Formal Specifications plays a vital role in several dimensions of software engineering such as testing, optimizing, refactoring, documenting, debugging and repair. Formal Specifications are generally descriptions for legal program behavior. In Conventional approaches, specifications are constructed manually and later automatic mining techniques emerges with mining rules focusing on temporal logic and language specifications. Addition of metrics in mining leads to improvement in performance and thereby providing a step towards the support for real world applications. This paper focuses on giving a detailed overview of specification mining techniques, thereby stating the need for specifications utility in industrial perspective. This paper also serves as a guide to gain additional knowledge and the impact of metrics over specification miners.
{"title":"A qualitative analysis on the specification mining techniques","authors":"Annie Ratna Priya, M. Mythily","doi":"10.1109/ICE-CCN.2013.6528492","DOIUrl":"https://doi.org/10.1109/ICE-CCN.2013.6528492","url":null,"abstract":"Formal Specifications plays a vital role in several dimensions of software engineering such as testing, optimizing, refactoring, documenting, debugging and repair. Formal Specifications are generally descriptions for legal program behavior. In Conventional approaches, specifications are constructed manually and later automatic mining techniques emerges with mining rules focusing on temporal logic and language specifications. Addition of metrics in mining leads to improvement in performance and thereby providing a step towards the support for real world applications. This paper focuses on giving a detailed overview of specification mining techniques, thereby stating the need for specifications utility in industrial perspective. This paper also serves as a guide to gain additional knowledge and the impact of metrics over specification miners.","PeriodicalId":286830,"journal":{"name":"2013 IEEE International Conference ON Emerging Trends in Computing, Communication and Nanotechnology (ICECCN)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116797925","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
扫码关注我们
求助内容：
应助结果提醒方式：