Music or audio data digitally sampled contains information about musical clip such as pitch, amplitude etc at multiple points along timeline. This huge data needs to be understood in the form of musical notations for the musicians. Praat is a tool used for acoustic analyses by audio researchers. We have processed the data produced by Praat using our own program to find useful information. We have focused on finding notation, duration of note and amplitude in a flute clip of Hindustani classical music. The clip was an alap clip in which there is no rhythm accompaniment to flute. Our attempt has given us encouraging preliminary results.
{"title":"Exploring Data Analysis in Music Using Tool Praat","authors":"Velankar Makarand Ramesh, H. Sahasrabuddhe","doi":"10.1109/ICETET.2008.83","DOIUrl":"https://doi.org/10.1109/ICETET.2008.83","url":null,"abstract":"Music or audio data digitally sampled contains information about musical clip such as pitch, amplitude etc at multiple points along timeline. This huge data needs to be understood in the form of musical notations for the musicians. Praat is a tool used for acoustic analyses by audio researchers. We have processed the data produced by Praat using our own program to find useful information. We have focused on finding notation, duration of note and amplitude in a flute clip of Hindustani classical music. The clip was an alap clip in which there is no rhythm accompaniment to flute. Our attempt has given us encouraging preliminary results.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131404078","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}
Genetic algorithms have been successfully applied in the area of software testing. The demand for automation of test case generation in object oriented software testing is increasing. Genetic algorithms are well applied in procedural software testing but a little has been done in testing of object oriented software. In this paper, we propose a method to generate test cases for classes in object oriented software using a genetic programming approach. This method uses tree representation of statements in test cases. Strategies for encoding the test cases and using the objective function to evolve them as suitable test case are proposed.
{"title":"Using Genetic Algorithm for Unit Testing of Object Oriented Software","authors":"N. Gupta, Mukesh Kumar Rohil","doi":"10.1109/ICETET.2008.137","DOIUrl":"https://doi.org/10.1109/ICETET.2008.137","url":null,"abstract":"Genetic algorithms have been successfully applied in the area of software testing. The demand for automation of test case generation in object oriented software testing is increasing. Genetic algorithms are well applied in procedural software testing but a little has been done in testing of object oriented software. In this paper, we propose a method to generate test cases for classes in object oriented software using a genetic programming approach. This method uses tree representation of statements in test cases. Strategies for encoding the test cases and using the objective function to evolve them as suitable test case are proposed.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"414 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132381518","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}
The fundamental issue faced by the developers in todaypsilas environment is how to measure the quality of software modularization. In this paper a new set of metrics are proposed which measure the quality of modularization of an object-oriented software (OOS) system. A set of design principles are proposed to capture the notion of modularity and metrics are defined based on the principles. The coupling-based structural metrics measures the function-call traffic through the APIpsilas of the modules in relation to the overall function-call traffic. It is now widely accepted that the overall quality of a large body of software is enhanced when module interactions are restricted to take place through the published APIpsilas for the modules. The metrics can be tested on some large legacy-code business applications. The metrics can be validated from the results obtained on human-modularized versions of the software.
{"title":"Notice of Violation of IEEE Publication PrinciplesMeasuring the Quality of Software Modularization Using Coupling-Based Structural Metrics for an OOS System","authors":"M. Aruna, M. Devi, M. Deepa","doi":"10.1109/ICETET.2008.76","DOIUrl":"https://doi.org/10.1109/ICETET.2008.76","url":null,"abstract":"The fundamental issue faced by the developers in todaypsilas environment is how to measure the quality of software modularization. In this paper a new set of metrics are proposed which measure the quality of modularization of an object-oriented software (OOS) system. A set of design principles are proposed to capture the notion of modularity and metrics are defined based on the principles. The coupling-based structural metrics measures the function-call traffic through the APIpsilas of the modules in relation to the overall function-call traffic. It is now widely accepted that the overall quality of a large body of software is enhanced when module interactions are restricted to take place through the published APIpsilas for the modules. The metrics can be tested on some large legacy-code business applications. The metrics can be validated from the results obtained on human-modularized versions of the software.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"34 Suppl 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124334642","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, performance analysis of handoff algorithms for multihop ad hoc wireless network has been performed. Handover algorithms considered here are based on relative signal strength measurements with hysteresis and combined signal strength measurements. Combined signal strength measurement includes both relative and absolute signal strength measurements. WLAN can be of infrastructure less type i.e., ad hoc type. In such a network, mobile station acts as a relay station in a multihop transmission. Mobile node (MN) has the ability to support base station functionality. In this paper, we considered Ad Hoc type wireless network with access point (AP) that can connect to wired LAN. Average number of handoff and average handoff delay are considered as performance metrics.
{"title":"Performance Analysis of Handoff Algorithms for Multihop Ad Hoc Wireless Network","authors":"Sanjay Dhar Roy","doi":"10.1109/ICETET.2008.10","DOIUrl":"https://doi.org/10.1109/ICETET.2008.10","url":null,"abstract":"In this paper, performance analysis of handoff algorithms for multihop ad hoc wireless network has been performed. Handover algorithms considered here are based on relative signal strength measurements with hysteresis and combined signal strength measurements. Combined signal strength measurement includes both relative and absolute signal strength measurements. WLAN can be of infrastructure less type i.e., ad hoc type. In such a network, mobile station acts as a relay station in a multihop transmission. Mobile node (MN) has the ability to support base station functionality. In this paper, we considered Ad Hoc type wireless network with access point (AP) that can connect to wired LAN. Average number of handoff and average handoff delay are considered as performance metrics.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"162 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114055325","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}
A. Rathinam, V. Natarajan, S. Vanila, A. Viswanath, M. S. Guhan
The ad hoc on demand distance vector (AODV) routing protocol is a dynamic, self starting protocol used in mobile ad hoc networks (MANET)s which is basically a collection of mobile nodes that can communicate with each other. This routing protocol functions without any need for fixed infrastructure or base station. It has the following advantages like low processing rate, memory overhead, and low network utilization. In spite of these advantages, AODV suffers from the limitation of low bandwidth i.e., used for long period when bandwidth is low. The improved AODV routing protocol with route repair scheme overcomes the disadvantages of its predecessor. In the earlier AODV routing protocol, wherever a link breaks an error message is sent to the source stating that a link failure has taken place and further communication is stopped temporarily. Where as in the improved version, nodes in the active path between source and destination act as a virtual source when link breakage occurs and there by the search process is continued till the link is formed to reach the original destination is reached. Comparison between original routing protocol and the improved algorithm is carried out by simulating them in MODELSim, simulation software and the VHDL coding is implemented in FPGA Virtex-IV kit.
{"title":"An FPGA Implementation of Improved AODV Routing Protocol for Route Repair Scheme","authors":"A. Rathinam, V. Natarajan, S. Vanila, A. Viswanath, M. S. Guhan","doi":"10.1109/ICETET.2008.175","DOIUrl":"https://doi.org/10.1109/ICETET.2008.175","url":null,"abstract":"The ad hoc on demand distance vector (AODV) routing protocol is a dynamic, self starting protocol used in mobile ad hoc networks (MANET)s which is basically a collection of mobile nodes that can communicate with each other. This routing protocol functions without any need for fixed infrastructure or base station. It has the following advantages like low processing rate, memory overhead, and low network utilization. In spite of these advantages, AODV suffers from the limitation of low bandwidth i.e., used for long period when bandwidth is low. The improved AODV routing protocol with route repair scheme overcomes the disadvantages of its predecessor. In the earlier AODV routing protocol, wherever a link breaks an error message is sent to the source stating that a link failure has taken place and further communication is stopped temporarily. Where as in the improved version, nodes in the active path between source and destination act as a virtual source when link breakage occurs and there by the search process is continued till the link is formed to reach the original destination is reached. Comparison between original routing protocol and the improved algorithm is carried out by simulating them in MODELSim, simulation software and the VHDL coding is implemented in FPGA Virtex-IV kit.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128760830","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}
The VHDL-AMS based fuzzy logic controller for movement control systems is discussed here. The designs have been carried out in the digital domain with HDL. The basic components of the fuzzy logic controller are designed using VHDL-AMS. The proposed work focuses on control of speed with respect to input parameter such as Alignment & distance with triangular membership functions. This is beneficial for autonomous systems which increases traffic safety and the capacity of a pre-existing road infrastructure. Here distance and tracking control method has been used, which enables a number of autonomous systems to work together. A case study applying this novel method to an movement control system has been investigated to obtain a new type of fuzzy logic membership function with irregular shapes optimized for best performance. This paper presents the movement control of vehicle application, the fuzzy control approach and the design using high-level synthesis.
{"title":"VHDL-AMS Based Fuzzy Logic Controllers","authors":"K. Jajulwar, A. Deshmukh, P. Bajaj, A. Keskar","doi":"10.1109/ICETET.2008.197","DOIUrl":"https://doi.org/10.1109/ICETET.2008.197","url":null,"abstract":"The VHDL-AMS based fuzzy logic controller for movement control systems is discussed here. The designs have been carried out in the digital domain with HDL. The basic components of the fuzzy logic controller are designed using VHDL-AMS. The proposed work focuses on control of speed with respect to input parameter such as Alignment & distance with triangular membership functions. This is beneficial for autonomous systems which increases traffic safety and the capacity of a pre-existing road infrastructure. Here distance and tracking control method has been used, which enables a number of autonomous systems to work together. A case study applying this novel method to an movement control system has been investigated to obtain a new type of fuzzy logic membership function with irregular shapes optimized for best performance. This paper presents the movement control of vehicle application, the fuzzy control approach and the design using high-level synthesis.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115858890","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}
Rashmi Ranjan Rout, K. Shiva Rama Krishna, K. Kant
P2P systems became popular for attaining high performance price ratio by effectively using several desktop computers. These systems can be used to construct a sharing file system which aggregates the storage capacities of several peers. DHT based approaches combined with clustering mechanisms are playing significant role to build scalable wide area P2P systems. In this paper, two-layer hybrid P2P system is presented, in which top layer combines the clusters as virtual nodes in a Chord network. The cluster layer implements a centralized server approach to maintain the nodes within that cluster. This helps to minimize the influence of frequent peer arrivals and departures on the dynamic system. It also reduces look up latency in the whole system. Focus here is to simplify the maintenance of the cluster.
{"title":"A Centralized Server Based Cluster Integrated Protocol in Hybrid P2P Systems","authors":"Rashmi Ranjan Rout, K. Shiva Rama Krishna, K. Kant","doi":"10.1109/ICETET.2008.13","DOIUrl":"https://doi.org/10.1109/ICETET.2008.13","url":null,"abstract":"P2P systems became popular for attaining high performance price ratio by effectively using several desktop computers. These systems can be used to construct a sharing file system which aggregates the storage capacities of several peers. DHT based approaches combined with clustering mechanisms are playing significant role to build scalable wide area P2P systems. In this paper, two-layer hybrid P2P system is presented, in which top layer combines the clusters as virtual nodes in a Chord network. The cluster layer implements a centralized server approach to maintain the nodes within that cluster. This helps to minimize the influence of frequent peer arrivals and departures on the dynamic system. It also reduces look up latency in the whole system. Focus here is to simplify the maintenance of the cluster.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116381385","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}
The use of error-correcting codes has proven to be an effective way to overcome data corruption in digital wireless communication channels, enabling reliable transmission to be achieved over noisy and fading channels. In this paper a novel approach to design a high throughput with reduced bit error probability Viterbi decoder is described and implemented. Low bit error rate (BER) can be achieved by increasing the free distance (dfree) of the Viterbi decoder without increasing complexity. The increase in dfree has been achieved by a proposed non-polynomial convolutional code method. A decoder system with code rate of k/n=frac14, constrain length K=3 has been implemented on Xilinx Spartan-III. The performance of viterbi decoder with the proposed method has been improved from 27% to 75% of errors are detected and corrected. We have also achieved a high speed (84.958 Mbps) and low Bit Error Rate (BER) viterbi decoder. Experimental results shows that the proposed viterbi decoder provides satisfactory Pe performance and high operating speed under various conditions including AWGN, co-channel interference and adjacent channel interference environments.
{"title":"Design and VLSI implementation of a Low Probability of Error Viterbi Decoder","authors":"C. Arun, V. Rajamani","doi":"10.1109/ICETET.2008.180","DOIUrl":"https://doi.org/10.1109/ICETET.2008.180","url":null,"abstract":"The use of error-correcting codes has proven to be an effective way to overcome data corruption in digital wireless communication channels, enabling reliable transmission to be achieved over noisy and fading channels. In this paper a novel approach to design a high throughput with reduced bit error probability Viterbi decoder is described and implemented. Low bit error rate (BER) can be achieved by increasing the free distance (dfree) of the Viterbi decoder without increasing complexity. The increase in dfree has been achieved by a proposed non-polynomial convolutional code method. A decoder system with code rate of k/n=frac14, constrain length K=3 has been implemented on Xilinx Spartan-III. The performance of viterbi decoder with the proposed method has been improved from 27% to 75% of errors are detected and corrected. We have also achieved a high speed (84.958 Mbps) and low Bit Error Rate (BER) viterbi decoder. Experimental results shows that the proposed viterbi decoder provides satisfactory Pe performance and high operating speed under various conditions including AWGN, co-channel interference and adjacent channel interference environments.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115804045","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}
Jayanti's algorithm is one of the best known abortable mutual exclusion algorithms. A randomized approach has been used to overcome an already known limitation of the algorithm while preserving its all important properties and elegance. The limitation is that the token number used to assign process identification number to new incoming processes is unbounded. We have used some suitably adapted alternative data structure, in order to completely eliminate the use of token number, in the algorithm.
{"title":"A Randomized Approach to Bound Jayanti's Mutual Exclusion Algorithm","authors":"Awadhesh Kumar Singh","doi":"10.1109/ICETET.2008.20","DOIUrl":"https://doi.org/10.1109/ICETET.2008.20","url":null,"abstract":"Jayanti's algorithm is one of the best known abortable mutual exclusion algorithms. A randomized approach has been used to overcome an already known limitation of the algorithm while preserving its all important properties and elegance. The limitation is that the token number used to assign process identification number to new incoming processes is unbounded. We have used some suitably adapted alternative data structure, in order to completely eliminate the use of token number, in the algorithm.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116140291","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 present a very simple and yet effective algorithm to generate codebook. The algorithm uses sorting method to generate codebook and the codevectors are obtained by using median approach. The proposed algorithm was experimented on six different images each of size 512 x 512 and four different codebooks of sizes 128, 256, 512 and 1024 are generated. The proposed algorithm is found to be much faster than the LBG and KPE algorithm. The performance of this algorithm is better than LBG and KPE algorithms considering MSE, PSNR and execution time. The proposed algorithm gives less MSE as compared to the LBG for the codebooks of sizes 128, 256, 512 & 1024 respectively. It also gives higher PSNR as compared to LBG for the codebooks of various sizes.
{"title":"An Efficient Fast Algorithm to Generate Codebook for Vector Quantization","authors":"H. B. Kekre, T. Sarode","doi":"10.1109/ICETET.2008.18","DOIUrl":"https://doi.org/10.1109/ICETET.2008.18","url":null,"abstract":"In this paper we present a very simple and yet effective algorithm to generate codebook. The algorithm uses sorting method to generate codebook and the codevectors are obtained by using median approach. The proposed algorithm was experimented on six different images each of size 512 x 512 and four different codebooks of sizes 128, 256, 512 and 1024 are generated. The proposed algorithm is found to be much faster than the LBG and KPE algorithm. The performance of this algorithm is better than LBG and KPE algorithms considering MSE, PSNR and execution time. The proposed algorithm gives less MSE as compared to the LBG for the codebooks of sizes 128, 256, 512 & 1024 respectively. It also gives higher PSNR as compared to LBG for the codebooks of various sizes.","PeriodicalId":269929,"journal":{"name":"2008 First International Conference on Emerging Trends in Engineering and Technology","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114640113","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
扫码关注我们
求助内容：
应助结果提醒方式：