Pub Date : 2012-12-01DOI: 10.1109/ICOAC.2012.6416840
V. Subramanian, S. Murugesan
In this paper, the effectiveness of the soft switching control strategies for the Three Phase Inverter based Solar Energy Conversion system with boost converter was explained. The solar irradiation and temperature are mainly depends on the output power produced from the PV conversion process. The Boost Converter is used to obtain the maximum power and is controlled by the Fuzzy logic controller. The Sinusoidal Pulse Width Modulation (SPWM) produces the soft switching control strategy for the proposed topology. The proposed system involves a Stand-Alone Photovoltaic System, Boost converters, Fuzzy Logic Controller, Three Phase inverter and a load. The regulated voltage and current from the boost converter is fed to the inverter circuit which is connected to the load with a continuous maximum power. The fuzzy logic controller is used to improve the boost converter efficiency and the sinusoidal PWM is used to give pulses for the inverter circuit. The inverter output current for driving a load should be noted such that it does not carry the harmonic content. However since disturbed sine wave is unavoidable under various factors it is necessary to reduce the harmonic level to obtain a highly effective output. The results are generated in MATLABSIMULINK and are shown.
{"title":"An artificial intelligent controller for a Three Phase Inverter based Solar PV system using boost converter","authors":"V. Subramanian, S. Murugesan","doi":"10.1109/ICOAC.2012.6416840","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416840","url":null,"abstract":"In this paper, the effectiveness of the soft switching control strategies for the Three Phase Inverter based Solar Energy Conversion system with boost converter was explained. The solar irradiation and temperature are mainly depends on the output power produced from the PV conversion process. The Boost Converter is used to obtain the maximum power and is controlled by the Fuzzy logic controller. The Sinusoidal Pulse Width Modulation (SPWM) produces the soft switching control strategy for the proposed topology. The proposed system involves a Stand-Alone Photovoltaic System, Boost converters, Fuzzy Logic Controller, Three Phase inverter and a load. The regulated voltage and current from the boost converter is fed to the inverter circuit which is connected to the load with a continuous maximum power. The fuzzy logic controller is used to improve the boost converter efficiency and the sinusoidal PWM is used to give pulses for the inverter circuit. The inverter output current for driving a load should be noted such that it does not carry the harmonic content. However since disturbed sine wave is unavoidable under various factors it is necessary to reduce the harmonic level to obtain a highly effective output. The results are generated in MATLABSIMULINK and are shown.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123800576","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416809
S. Pal, Puneet Sardana, Kamlesh Yadav
Efficient keyword search in electronic documents has been an important problem in computer science for the last many decades. With the popularity of cloud services, some applications require searching in multilingual environment. Other applications require data to be stored in the cloud in encrypted form and outsourced to a third party for processing. This paper proposes an algorithm using bloom filters to perform efficient multilingual search on data stored in the cloud in plain or encrypted form. When the user sends in a keyword to be searched, its language is first determined and its corresponding language list bloom filters are checked for presence of the keyword. To make the algorithm more efficient and accurate, we have created two categories of bloom filters namely primary and secondary bloom filter. The list of documents having the keyword is returned to the user. For secure applications, the encrypted documents and its corresponding bloom filters are stored in the server. When user wants to perform a search in stored encrypted documents it sends the keyword to the server. The server applies similar technique to return the encrypted documents having the keyword and the client uses the key to decrypt the documents if required. While searching for keywords, we test the word against the bloom filter of documents which enables these to be stored in encrypted form. Checking of a word against the bloom filter of its documents takes constant time. Experimental results show that searching for a word in encrypted documents can be performed quite efficiently using this scheme even if the environment is multilingual.
{"title":"Efficient multilingual keyword search using bloom filter for cloud computing applications","authors":"S. Pal, Puneet Sardana, Kamlesh Yadav","doi":"10.1109/ICOAC.2012.6416809","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416809","url":null,"abstract":"Efficient keyword search in electronic documents has been an important problem in computer science for the last many decades. With the popularity of cloud services, some applications require searching in multilingual environment. Other applications require data to be stored in the cloud in encrypted form and outsourced to a third party for processing. This paper proposes an algorithm using bloom filters to perform efficient multilingual search on data stored in the cloud in plain or encrypted form. When the user sends in a keyword to be searched, its language is first determined and its corresponding language list bloom filters are checked for presence of the keyword. To make the algorithm more efficient and accurate, we have created two categories of bloom filters namely primary and secondary bloom filter. The list of documents having the keyword is returned to the user. For secure applications, the encrypted documents and its corresponding bloom filters are stored in the server. When user wants to perform a search in stored encrypted documents it sends the keyword to the server. The server applies similar technique to return the encrypted documents having the keyword and the client uses the key to decrypt the documents if required. While searching for keywords, we test the word against the bloom filter of documents which enables these to be stored in encrypted form. Checking of a word against the bloom filter of its documents takes constant time. Experimental results show that searching for a word in encrypted documents can be performed quite efficiently using this scheme even if the environment is multilingual.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133506234","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416795
I. J. Jingle, E. Rajsingh
Wireless broadband networks are most vulnerable to denial-of-service attacks where attackers can disrupt legitimate communication between hosts in a network by flooding unwanted traffic between legitimate hosts. This paper proposes DDDOST, a novel approach for filtering flooding attack, the most severe denial-of-service attack that occurs at the transport layer of the internet. Flooding attack at the transport layer affects the transmission control protocol's three-way handshake process, thereby denying the services of TCP. It also denies the services of user datagram protocol. The main objective of this approach is to install local and global monitoring agents at various points in the network in order to monitor and filter real-time TCP traffic and UDP traffic thereby allowing legitimate traffic to flow in the network during attack traffic filtration process and to avoid buffer overflow at the monitoring agents. DDDOST consists of a novel agreement mechanism and a novel detection algorithm and it works taking the clock values of each node into account for effective detection of the attack which has not been used in the existing defense mechanisms. All nodes within a network are permitted to have a synchronized clock value. In the agreement mechanism, the IP address spoofing is prevented which forms the gateway for flooding attacks and once IP spoofing is prevented, the detection mechanism is carried out in detecting and filtering flooding attacks. This distributed defense mechanism reduces the burden on a single global monitoring agent thereby introducing local monitoring agents at various points in the network. The performance results show that this approach effectively and accurately detects and filters DOS attacks within a short period. The performance of this proposed mechanism has been measured in terms of time delay and false positive ratio and it is compared with existing defense mechanisms and it is found to be effective over existing defense mechanisms.
{"title":"DDDOST: Distributed detection of DOS attack using timers in wireless broadband networks","authors":"I. J. Jingle, E. Rajsingh","doi":"10.1109/ICOAC.2012.6416795","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416795","url":null,"abstract":"Wireless broadband networks are most vulnerable to denial-of-service attacks where attackers can disrupt legitimate communication between hosts in a network by flooding unwanted traffic between legitimate hosts. This paper proposes DDDOST, a novel approach for filtering flooding attack, the most severe denial-of-service attack that occurs at the transport layer of the internet. Flooding attack at the transport layer affects the transmission control protocol's three-way handshake process, thereby denying the services of TCP. It also denies the services of user datagram protocol. The main objective of this approach is to install local and global monitoring agents at various points in the network in order to monitor and filter real-time TCP traffic and UDP traffic thereby allowing legitimate traffic to flow in the network during attack traffic filtration process and to avoid buffer overflow at the monitoring agents. DDDOST consists of a novel agreement mechanism and a novel detection algorithm and it works taking the clock values of each node into account for effective detection of the attack which has not been used in the existing defense mechanisms. All nodes within a network are permitted to have a synchronized clock value. In the agreement mechanism, the IP address spoofing is prevented which forms the gateway for flooding attacks and once IP spoofing is prevented, the detection mechanism is carried out in detecting and filtering flooding attacks. This distributed defense mechanism reduces the burden on a single global monitoring agent thereby introducing local monitoring agents at various points in the network. The performance results show that this approach effectively and accurately detects and filters DOS attacks within a short period. The performance of this proposed mechanism has been measured in terms of time delay and false positive ratio and it is compared with existing defense mechanisms and it is found to be effective over existing defense mechanisms.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133921884","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416818
R. Kumar, P. Kamalakkannan
Mobile ad hoc networks is a self organizing wireless networks for mobile devices. It does not require any fixed infrastructure due to no wired backbone. It is suitable to use in environment that have a need of on the fly set-up. Every host is a router and packet forwarder. Each node may be mobile, and topology changes frequently and unpredictably due to the arbitrary mobility of mobile nodes. This aspect leads to frequent path failure and route rebuilding. Routing protocol development depends on mobility management, efficient bandwidth and power usage which are critical in ad hoc networks. In this paper, personalized Ad hoc On demand Distance Vector (RAODV) algorithm to reduce the link break scheme for mobile ad hoc networks. This present approach reduces packet loss and finds optimized route by taking into consideration of bandwidth, delay which results by improvement of quality of service. The performance analysis and simulation are carried out to evaluate network performance using network simulator NS-2 based on the quantitative basic parameters like throughput, delay in term of number of nodes and various mobility rates. A simulation result was during the comparison of AODV protocol with RAODV the probability of link break has been decreases in RAODV considering when various pause times and increases number of nodes.
{"title":"Personalized RAODV algorithm for reduce link break in mobile ad hoc networks","authors":"R. Kumar, P. Kamalakkannan","doi":"10.1109/ICOAC.2012.6416818","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416818","url":null,"abstract":"Mobile ad hoc networks is a self organizing wireless networks for mobile devices. It does not require any fixed infrastructure due to no wired backbone. It is suitable to use in environment that have a need of on the fly set-up. Every host is a router and packet forwarder. Each node may be mobile, and topology changes frequently and unpredictably due to the arbitrary mobility of mobile nodes. This aspect leads to frequent path failure and route rebuilding. Routing protocol development depends on mobility management, efficient bandwidth and power usage which are critical in ad hoc networks. In this paper, personalized Ad hoc On demand Distance Vector (RAODV) algorithm to reduce the link break scheme for mobile ad hoc networks. This present approach reduces packet loss and finds optimized route by taking into consideration of bandwidth, delay which results by improvement of quality of service. The performance analysis and simulation are carried out to evaluate network performance using network simulator NS-2 based on the quantitative basic parameters like throughput, delay in term of number of nodes and various mobility rates. A simulation result was during the comparison of AODV protocol with RAODV the probability of link break has been decreases in RAODV considering when various pause times and increases number of nodes.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"349 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133141126","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416838
Utkarsh, Mukesh Mishra, S. Chinara
Mobile ad hoc networks (MANET) support multi hop routing in the absence of central base station. The change in network topology due to the node movement associated with the link failure and creation, scarce in radio resources and bandwidth, limited battery power and computing capability pose challenges in packet routing in MANET. The proposed Energy Saving Ad hoc Routing (ESAR) algorithm targets to achieve better energy efficient with a longer network life time. The algorithm selects a path for routing by considering the actual distance between the source and destination along with the minimum available energy of a node in the path. This selected path is chosen as the best path for packet transmission till any node in the path exhausts battery power beyond a threshold value. At this point of time, a backup path is selected as an alternate path for packet transmission. The process is repeated till all the paths from the same source to destination are exhausted with their battery power. The simulation result of the proposed algorithm ESAR indicates that the network life time is improved upon the existing routing algorithms.
移动自组织网络(MANET)在没有中心基站的情况下支持多跳路由。由于节点移动导致的网络拓扑结构的变化、无线资源和带宽的稀缺、有限的电池电量和计算能力等，都给MANET中的分组路由带来了挑战。提出的ESAR (Energy Saving Ad hoc Routing)算法的目标是在更长的网络寿命下实现更高的能源效率。该算法通过考虑源和目的之间的实际距离以及路径上节点的最小可用能量来选择路由路径。选择该路径作为数据包传输的最佳路径，直到路径上任何节点的电池电量耗尽超过阈值。此时，选择一条备份路径作为分组传输的备选路径。这个过程不断重复，直到从同一源到目的地的所有路径都耗尽了电池电量。ESAR算法的仿真结果表明，与现有的路由算法相比，该算法的网络生存时间得到了改善。
{"title":"ESAR: An energy saving ad hoc routing algorithm for MANET","authors":"Utkarsh, Mukesh Mishra, S. Chinara","doi":"10.1109/ICOAC.2012.6416838","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416838","url":null,"abstract":"Mobile ad hoc networks (MANET) support multi hop routing in the absence of central base station. The change in network topology due to the node movement associated with the link failure and creation, scarce in radio resources and bandwidth, limited battery power and computing capability pose challenges in packet routing in MANET. The proposed Energy Saving Ad hoc Routing (ESAR) algorithm targets to achieve better energy efficient with a longer network life time. The algorithm selects a path for routing by considering the actual distance between the source and destination along with the minimum available energy of a node in the path. This selected path is chosen as the best path for packet transmission till any node in the path exhausts battery power beyond a threshold value. At this point of time, a backup path is selected as an alternate path for packet transmission. The process is repeated till all the paths from the same source to destination are exhausted with their battery power. The simulation result of the proposed algorithm ESAR indicates that the network life time is improved upon the existing routing algorithms.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133891493","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416826
K. Suganthi, Vinayaga B. Sundaram
One of the major issue in wireless sensor network in recent years is how to maximize the network life time and fault tolerant capabilities. Sensors used in wide range of applications such as area monitoring, environmental sensing, industrial monitoring, etc. tend to be heterogeneous and requires a fault tolerant network to minimize connectivity failure. In this paper, we address a suitable solution for maximizing lifetime by the optimal placement and usage of minimal relay nodes. Energy consumption intensity of relay nodes is used and the algorithm proposed ensures a fault tolerant network by developing a k-connected graph. Minimal numbers of relay and sensor nodes are used by scheduling them appropriately. A local search procedure is used for scheduling sensors and sinks separately to avoid redundancy and ensure optimal usage covering the entire target area without any coverage hole. Thus we minimize the overall deployment cost and enhance the network lifetime.
{"title":"A constraint based relay node deployment in heterogeneous wireless sensor networks for lifetime maximization","authors":"K. Suganthi, Vinayaga B. Sundaram","doi":"10.1109/ICOAC.2012.6416826","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416826","url":null,"abstract":"One of the major issue in wireless sensor network in recent years is how to maximize the network life time and fault tolerant capabilities. Sensors used in wide range of applications such as area monitoring, environmental sensing, industrial monitoring, etc. tend to be heterogeneous and requires a fault tolerant network to minimize connectivity failure. In this paper, we address a suitable solution for maximizing lifetime by the optimal placement and usage of minimal relay nodes. Energy consumption intensity of relay nodes is used and the algorithm proposed ensures a fault tolerant network by developing a k-connected graph. Minimal numbers of relay and sensor nodes are used by scheduling them appropriately. A local search procedure is used for scheduling sensors and sinks separately to avoid redundancy and ensure optimal usage covering the entire target area without any coverage hole. Thus we minimize the overall deployment cost and enhance the network lifetime.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115081949","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416831
K. Sujatha, M. E. Student, M. Kumarasamy, Mr C M E Nandagopal
The WiMAX Forum has defined a two-tiered mobility management to minimize handover delay and packet loss. In the existing solution they have used the admission control algorithm which incorporates both admission control and the wiener process based prediction algorithm to carry out the performance of Access service network gateway relocation. This algorithm improves the performance in terms of blocking probability, dropping probability, average serving rate, and average signaling overhead. In the proposed system we have increased the capacity and threshold value so that more number of packets can be accommodated in the network without the blocking and dropping of packets. Hence we compared the performance of the proposed and existing systems.
{"title":"Realization of gateway relocation using admission control algorithm in mobile WiMAX networks","authors":"K. Sujatha, M. E. Student, M. Kumarasamy, Mr C M E Nandagopal","doi":"10.1109/ICOAC.2012.6416831","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416831","url":null,"abstract":"The WiMAX Forum has defined a two-tiered mobility management to minimize handover delay and packet loss. In the existing solution they have used the admission control algorithm which incorporates both admission control and the wiener process based prediction algorithm to carry out the performance of Access service network gateway relocation. This algorithm improves the performance in terms of blocking probability, dropping probability, average serving rate, and average signaling overhead. In the proposed system we have increased the capacity and threshold value so that more number of packets can be accommodated in the network without the blocking and dropping of packets. Hence we compared the performance of the proposed and existing systems.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114112017","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 : 2012-12-01DOI: 10.1109/ICoAC.2012.6416845
P. Srinivasan, P. Kamalakkannan
Providing quality-of-service (QoS) support for Ad Hoc networks is a challenging task due to dynamicity, lack of centralized control, constrained resources and unreliable nature of radio channels and in Mobile Ad hoc networks. Finding a path that remains valid for sufficiently longer period is also a critical task in MANET. In this paper, we propose a novel, stability and energy based QoS routing protocol which is an extension of our route stability and energy based routing (RSEA), to support applications with throughput and delay constraints. In this model, we compute the reliability factor based on the route stability and the residual energy of the intermediate nodes satisfying the admission control. The route with the highest reliability factor is selected for data transfer from source to destination among all the feasible routes. The proposed model has shown better results in terms of packet delivery ratio, control overhead and end-to-end delay in comparison with RSQR, LEAR.
{"title":"REAQ-AODV: Route stability and energy aware QoS routing in mobile Ad Hoc networks","authors":"P. Srinivasan, P. Kamalakkannan","doi":"10.1109/ICoAC.2012.6416845","DOIUrl":"https://doi.org/10.1109/ICoAC.2012.6416845","url":null,"abstract":"Providing quality-of-service (QoS) support for Ad Hoc networks is a challenging task due to dynamicity, lack of centralized control, constrained resources and unreliable nature of radio channels and in Mobile Ad hoc networks. Finding a path that remains valid for sufficiently longer period is also a critical task in MANET. In this paper, we propose a novel, stability and energy based QoS routing protocol which is an extension of our route stability and energy based routing (RSEA), to support applications with throughput and delay constraints. In this model, we compute the reliability factor based on the route stability and the residual energy of the intermediate nodes satisfying the admission control. The route with the highest reliability factor is selected for data transfer from source to destination among all the feasible routes. The proposed model has shown better results in terms of packet delivery ratio, control overhead and end-to-end delay in comparison with RSQR, LEAR.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"s1-10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127191752","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416833
J. Manikandan, B. Venkataramani
Many consumer and industrial applications require fast and lightweight real-time speech recognition systems with limited vocabulary, such as hands-free control for portable music players, car audio systems, cordless phones, wheel chairs, washing machines, micro-wave ovens, air conditioners and domestic appliances. In this paper, design and development of a Texas Instruments TMS320C6713 DSP based real-time voice operated robot using Support Vector Machine (SVM) classifier is proposed. Details about different ways to reduce the execution time of the prototype are reported in this paper. The proposed system as well as approaches can be easily employed by designers for various other SVM based multi-class pattern recognition applications.
{"title":"Hardware implementation of voice operated robot using Support Vector Machine classifier","authors":"J. Manikandan, B. Venkataramani","doi":"10.1109/ICOAC.2012.6416833","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416833","url":null,"abstract":"Many consumer and industrial applications require fast and lightweight real-time speech recognition systems with limited vocabulary, such as hands-free control for portable music players, car audio systems, cordless phones, wheel chairs, washing machines, micro-wave ovens, air conditioners and domestic appliances. In this paper, design and development of a Texas Instruments TMS320C6713 DSP based real-time voice operated robot using Support Vector Machine (SVM) classifier is proposed. Details about different ways to reduce the execution time of the prototype are reported in this paper. The proposed system as well as approaches can be easily employed by designers for various other SVM based multi-class pattern recognition applications.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125727821","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 : 2012-12-01DOI: 10.1109/ICOAC.2012.6416842
N. Nagarathna, M. Indiramma
Grid computing systems provide a virtual framework for sharing resources across organizational boundaries. The merging of Service Oriented Architecture (SOA) with the original Grid technology has resulted in the emergence of the Service Oriented Grid (SOG). The resources from various virtual organizations (VO) are packaged as “services” and offered to users in the form of Grid services. With the increasing use of SOG, service user is in a fix when having to make a choice from a set of services offering the same functionality. Hence service selection is one of the challenges to be addressed in Service Oriented Grid. In this paper we propose a framework for a recommendation system based on trust, reputation and QoS for the SOG with multi-VOs. This novel approach uses computation of trustworthiness of services by the mechanism of taking feedback directly from the service consumers and recommendations from other service providers.
{"title":"Recommendation framework for Service-Oriented Grid","authors":"N. Nagarathna, M. Indiramma","doi":"10.1109/ICOAC.2012.6416842","DOIUrl":"https://doi.org/10.1109/ICOAC.2012.6416842","url":null,"abstract":"Grid computing systems provide a virtual framework for sharing resources across organizational boundaries. The merging of Service Oriented Architecture (SOA) with the original Grid technology has resulted in the emergence of the Service Oriented Grid (SOG). The resources from various virtual organizations (VO) are packaged as “services” and offered to users in the form of Grid services. With the increasing use of SOG, service user is in a fix when having to make a choice from a set of services offering the same functionality. Hence service selection is one of the challenges to be addressed in Service Oriented Grid. In this paper we propose a framework for a recommendation system based on trust, reputation and QoS for the SOG with multi-VOs. This novel approach uses computation of trustworthiness of services by the mechanism of taking feedback directly from the service consumers and recommendations from other service providers.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131337047","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
扫码关注我们
求助内容：
应助结果提醒方式：