D. Gour, R. Jain, Rashmi Tikar, R. Bhatia, Umesh Barahdiya
A Wireless Adhoc Network is a group of wireless mobile nodes is an autonomous system of mobile nodes connected by wireless links. Each node operates not only as an end system, but also as a router to forward packets. In this paper mainly focused on MAC layer because this layer is most important for data communication to control the packet loss and error, we analyze MAC layer 802.16 and 802.11 networks using Ad hoc on-demand Distance Vector Routing Protocol under MANET by varying pause time and maximum speed. These simulations are carried out using the Network simulator version-2. From the results it is seen that end to end delay is less, PDF is more packet loss is minimum on varying maximum speed and pause time of 802.16 when compared with 802.11. hence 802.16 shows better performance as compared with 802.11.
{"title":"Performance Analysis of MAC802.11 and MAC802.16 for AODV Routing Protocol in MANET","authors":"D. Gour, R. Jain, Rashmi Tikar, R. Bhatia, Umesh Barahdiya","doi":"10.1109/CICN.2013.37","DOIUrl":"https://doi.org/10.1109/CICN.2013.37","url":null,"abstract":"A Wireless Adhoc Network is a group of wireless mobile nodes is an autonomous system of mobile nodes connected by wireless links. Each node operates not only as an end system, but also as a router to forward packets. In this paper mainly focused on MAC layer because this layer is most important for data communication to control the packet loss and error, we analyze MAC layer 802.16 and 802.11 networks using Ad hoc on-demand Distance Vector Routing Protocol under MANET by varying pause time and maximum speed. These simulations are carried out using the Network simulator version-2. From the results it is seen that end to end delay is less, PDF is more packet loss is minimum on varying maximum speed and pause time of 802.16 when compared with 802.11. hence 802.16 shows better performance as compared with 802.11.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116769729","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}
Energy efficiency is one critical issue for sensor networks because many sensors are equipped with batteries that have limited life time. This paper is focused on Opportunistic routing which is a recent technique that achieves high throughput in the face of lossy wireless links. The existing opportunistic routing protocol, ExOR (ties the MAC with routing) and MORE (MAC-independent) did not explore the benefit of selecting the appropriate forwarding list to minimize the energy cost. In this paper we intend to propose a new protocol called OFETR (Selecting Optimal Forwarder based on Energy and Trust, for Routing) to address the problems of selecting and prioritizing forwarder list based on energy and trust value such that the network performance is optimized. We show how our approach maximizes the network life time in comparison with existing protocols. Saving the nodes energy leads to an increase in the node life in the network in comparison with the other protocols (EXOR and MORE). Furthermore, the protocol increase the security by using trustworthiness routing, reduces propagation delay and loss of packets. Experimental results show that the energy consumption of routing using OFETR is significantly lower than ExOR with random forwarder list and traditional distance vector routing protocols. Simulation results have been obtained by using NS2 simulator. From the results, the performance of OFETR is better compared to the other protocols as EXOR and MORE.
{"title":"Selecting Optimal Forwarder Based on Energy and Trust for Routing in WSN","authors":"S. Maqbool, N. Chandra, S. Dagadi","doi":"10.1109/CICN.2013.82","DOIUrl":"https://doi.org/10.1109/CICN.2013.82","url":null,"abstract":"Energy efficiency is one critical issue for sensor networks because many sensors are equipped with batteries that have limited life time. This paper is focused on Opportunistic routing which is a recent technique that achieves high throughput in the face of lossy wireless links. The existing opportunistic routing protocol, ExOR (ties the MAC with routing) and MORE (MAC-independent) did not explore the benefit of selecting the appropriate forwarding list to minimize the energy cost. In this paper we intend to propose a new protocol called OFETR (Selecting Optimal Forwarder based on Energy and Trust, for Routing) to address the problems of selecting and prioritizing forwarder list based on energy and trust value such that the network performance is optimized. We show how our approach maximizes the network life time in comparison with existing protocols. Saving the nodes energy leads to an increase in the node life in the network in comparison with the other protocols (EXOR and MORE). Furthermore, the protocol increase the security by using trustworthiness routing, reduces propagation delay and loss of packets. Experimental results show that the energy consumption of routing using OFETR is significantly lower than ExOR with random forwarder list and traditional distance vector routing protocols. Simulation results have been obtained by using NS2 simulator. From the results, the performance of OFETR is better compared to the other protocols as EXOR and MORE.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"213 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123505278","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 presents a method for automatic hand gesture recognition of 'Bharatanatyam' dance using Fuzzy L membership function based approach. Here, a 3-stage system has been designed. In the first stage, the hand of the dancer from background is isolated using Texture based segmentation and thus the contour of the hand is extracted by using Sobel edge detection technique. In the next stage, centre point of the boundary is located and based on this eight spatial distances are calculated. These distances are normalized by dividing the maximum distance value. In the final stage, fuzzy L Membership values are calculated for each distance and matching of an unknown hand gesture is done with the known hand gestures from the database based on L fuzzy membership function. The proposed algorithm gives overall an accuracy of 85.1% and timing complexity is 2.563 sec in an Intel Pentium Dual Core processor running Mat lab R011b for each hand gesture. This simple yet effective code is very useful for e-learning of 'Bharatanatyam' dance.
{"title":"Fuzzy L Membership Function Based Hand Gesture Recognition for Bharatanatyam Dance","authors":"S. Saha, Lidia Ghosh, A. Konar, R. Janarthanan","doi":"10.1109/CICN.2013.75","DOIUrl":"https://doi.org/10.1109/CICN.2013.75","url":null,"abstract":"This paper presents a method for automatic hand gesture recognition of 'Bharatanatyam' dance using Fuzzy L membership function based approach. Here, a 3-stage system has been designed. In the first stage, the hand of the dancer from background is isolated using Texture based segmentation and thus the contour of the hand is extracted by using Sobel edge detection technique. In the next stage, centre point of the boundary is located and based on this eight spatial distances are calculated. These distances are normalized by dividing the maximum distance value. In the final stage, fuzzy L Membership values are calculated for each distance and matching of an unknown hand gesture is done with the known hand gestures from the database based on L fuzzy membership function. The proposed algorithm gives overall an accuracy of 85.1% and timing complexity is 2.563 sec in an Intel Pentium Dual Core processor running Mat lab R011b for each hand gesture. This simple yet effective code is very useful for e-learning of 'Bharatanatyam' dance.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"255 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124197785","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 on 'COLOR IMAGE STEGANOGRAPHY IN DCT DOMAIN' portrays a new arena in steganography in color images in frequency domain or more precisely that in Discrete Cosine Transform (DCT) domain. In this paper the authors have proposed the exploration of a deft method for image-secret data-steg pass based sampling along with encryption and embedding in frequency domain with a variable bit retrieval function where the secret data becomes more secure by hiding with the steg password, so that without knowing the steg password one cannot get the secret data explored. The strong adhesion amongst the color images, secret data and steg password, varied with a pixel dependant embedding in DCT domain yields a highly protected and reliable substitution. A group of 8×8 quantized DCT Coefficient (QDC) is selected as our secret data carrier for the color image. The variable bit operation is applied to the proper QDCs to embed a byte of secret data, where the variable bit operation is dependent on the pixel value. Assiduous statistical analysis has been done and provided to emphasize the strong security of the algorithm to the various steganalysis methods. This will also help to reveal its huge carrier capacity and stego image quality.
{"title":"DCT Domain Encryption in LSB Steganography","authors":"R. Biswas, Sayantan Mukherjee, S. Bandyopadhyay","doi":"10.1109/CICN.2013.89","DOIUrl":"https://doi.org/10.1109/CICN.2013.89","url":null,"abstract":"This paper on 'COLOR IMAGE STEGANOGRAPHY IN DCT DOMAIN' portrays a new arena in steganography in color images in frequency domain or more precisely that in Discrete Cosine Transform (DCT) domain. In this paper the authors have proposed the exploration of a deft method for image-secret data-steg pass based sampling along with encryption and embedding in frequency domain with a variable bit retrieval function where the secret data becomes more secure by hiding with the steg password, so that without knowing the steg password one cannot get the secret data explored. The strong adhesion amongst the color images, secret data and steg password, varied with a pixel dependant embedding in DCT domain yields a highly protected and reliable substitution. A group of 8×8 quantized DCT Coefficient (QDC) is selected as our secret data carrier for the color image. The variable bit operation is applied to the proper QDCs to embed a byte of secret data, where the variable bit operation is dependent on the pixel value. Assiduous statistical analysis has been done and provided to emphasize the strong security of the algorithm to the various steganalysis methods. This will also help to reveal its huge carrier capacity and stego image quality.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127844893","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}
Owing to the dynamic nature of the web, it is difficult for search engine to find the relevant documents to serve a user query. For this purpose, search engine maintains the index of downloaded documents stored in the local repository. Whenever a query comes search engine searches the index in order to find the relevant matched results to be presented to the user. The quality of the matched result depends on the information stored in the index. The more efficient is the structure of index, more efficient the performance of search engine. Generally, inverted index are based solely on the frequency of keywords present in number of documents. In order to improve the efficiency of the search engine, an improved indexing mechanism to index the web documents is being proposed that keeps the context related information integrated with the frequency of the keyword. The structure is implemented using Trie. The implementation results on various documents show that proposed index efficiently stores the documents and search is fast.
{"title":"An Improved Indexing Mechanism to Index Web Documents","authors":"Pooja Mudgil, A. Sharma, Pooja Gupta","doi":"10.1109/CICN.2013.101","DOIUrl":"https://doi.org/10.1109/CICN.2013.101","url":null,"abstract":"Owing to the dynamic nature of the web, it is difficult for search engine to find the relevant documents to serve a user query. For this purpose, search engine maintains the index of downloaded documents stored in the local repository. Whenever a query comes search engine searches the index in order to find the relevant matched results to be presented to the user. The quality of the matched result depends on the information stored in the index. The more efficient is the structure of index, more efficient the performance of search engine. Generally, inverted index are based solely on the frequency of keywords present in number of documents. In order to improve the efficiency of the search engine, an improved indexing mechanism to index the web documents is being proposed that keeps the context related information integrated with the frequency of the keyword. The structure is implemented using Trie. The implementation results on various documents show that proposed index efficiently stores the documents and search is fast.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117029758","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}
Cloud is the kind of distributed computing which disperses and processes data distributed by virtualized manner. Cloud provides resources and computing infrastructure on demand basis to cloud consumers. The combination of cloud computing into the mobile computing environment is developed as a capable technology for mobile services. In this paper we emphasis on scenarios for availability of cloud resources and services on mobile devices. Further need of mobile cloud computing, real time mobile cloud applications, a comparative analysis on mobile cloud enablement technologies and role of middleware system are discussed as counter part of this research.
{"title":"Mobile Cloud Computing: A Needed Shift from Cloud to Mobile Cloud","authors":"Rishabh Sharma, Sanjay Kumar, M. Trivedi","doi":"10.1109/CICN.2013.116","DOIUrl":"https://doi.org/10.1109/CICN.2013.116","url":null,"abstract":"Cloud is the kind of distributed computing which disperses and processes data distributed by virtualized manner. Cloud provides resources and computing infrastructure on demand basis to cloud consumers. The combination of cloud computing into the mobile computing environment is developed as a capable technology for mobile services. In this paper we emphasis on scenarios for availability of cloud resources and services on mobile devices. Further need of mobile cloud computing, real time mobile cloud applications, a comparative analysis on mobile cloud enablement technologies and role of middleware system are discussed as counter part of this research.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124400931","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}
With the development of communication technology, every industry has change lot. The medical industry has the same trend at this time. In order to create an environment for different social department, this paper presents a new solution which PaaS is used for mobile health. In the PaaS-Platform, distributed storage and cluster technology have been used for providing better service. The PaaS-Platform gives some permission for some departments to develop their own SaaSPlatform. And different mobile clients will be developed based on different departments' needs. Means of communication take Web Service which is the idea of SOA so that the platform is compatible with a variety of platforms. As a validation of our framework, a mobile client is presented in this paper.
{"title":"PaaS-Platform for Mobile Health","authors":"Long Chang, Cong Guan, Jihui Xu, Huaiyu Xu","doi":"10.1109/CICN.2013.119","DOIUrl":"https://doi.org/10.1109/CICN.2013.119","url":null,"abstract":"With the development of communication technology, every industry has change lot. The medical industry has the same trend at this time. In order to create an environment for different social department, this paper presents a new solution which PaaS is used for mobile health. In the PaaS-Platform, distributed storage and cluster technology have been used for providing better service. The PaaS-Platform gives some permission for some departments to develop their own SaaSPlatform. And different mobile clients will be developed based on different departments' needs. Means of communication take Web Service which is the idea of SOA so that the platform is compatible with a variety of platforms. As a validation of our framework, a mobile client is presented in this paper.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121032064","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 a broadband monopole antenna with half u slot cut in rectangular patch on coplanar wave guide (CPW) feed is presented. The antenna composed of a planar rectangular patch element embedded with half U slot cut with good impedance matching. The parametric study is performed to understand the characteristics of the proposed antenna. The overall size of the antenna is 62 mm X 47 mm X 1.6 mm including the finite ground CPW feeding mechanism and total volume of the antenna is 4.66 cm3. The antenna operates in broad frequency bands from 2.4 GHz to 5.9 GHz covering wireless Local area networks (WLAN) and worldwide interoperability for microwave access (WIMAX) bands. Also good antenna performances such as radiation patterns and antenna gain over the operating band have been observed and simulated peak gain of the antenna is 2.8 dBi at resonant frequency of 4.15GHz.
本文提出了一种在共面波导馈电上采用矩形补片切割半u型槽的宽带单极天线。该天线由平面矩形贴片单元嵌入半U型槽切组成，具有良好的阻抗匹配。进行参数化研究以了解所提出天线的特性。天线的整体尺寸为62 mm X 47 mm X 1.6 mm，包括有限地CPW馈电机构，天线的总体积为4.66 cm3。该天线工作在2.4 GHz到5.9 GHz的宽频段，覆盖无线局域网(WLAN)和全球微波接入(WIMAX)频段的互操作性。在4.15GHz谐振频率下，天线的模拟峰值增益为2.8 dBi。
{"title":"Wideband CPW-Fed Monopole Antenna with Half U Slot Cut in Rectangular Patch","authors":"S. N. Ather, P. Singhal","doi":"10.1109/CICN.2013.13","DOIUrl":"https://doi.org/10.1109/CICN.2013.13","url":null,"abstract":"In this paper a broadband monopole antenna with half u slot cut in rectangular patch on coplanar wave guide (CPW) feed is presented. The antenna composed of a planar rectangular patch element embedded with half U slot cut with good impedance matching. The parametric study is performed to understand the characteristics of the proposed antenna. The overall size of the antenna is 62 mm X 47 mm X 1.6 mm including the finite ground CPW feeding mechanism and total volume of the antenna is 4.66 cm3. The antenna operates in broad frequency bands from 2.4 GHz to 5.9 GHz covering wireless Local area networks (WLAN) and worldwide interoperability for microwave access (WIMAX) bands. Also good antenna performances such as radiation patterns and antenna gain over the operating band have been observed and simulated peak gain of the antenna is 2.8 dBi at resonant frequency of 4.15GHz.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117101667","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}
Ankur Kumar Shrivastava, Nitisha Payal, A. Rastogi, A. Tiwari
The arena of computer forensics investigation is a relatively new field of study. Many of the methods used in digital forensics have not been formally outlined. Digital Forensics is looked as part of art and part of science. This paper discussed breaking down the digital forensic investigation and their progression into an investigation development model so that an examiner can easily grip the problem and challenges during preparing and processing investigations. After going through various system and case analyses key issues, resulting in the documentation of role of computer examiner to gather evidence from a suspect computer terminal and determine whether the suspect committed a crime or violated a organization policies. As an outcome Digital forensic investigation development model (DFIDM) is introduced as a tailored approach for computer examiner or investigators for gathering and preserving the necessary digital evidence from different computer terminals or resources.
{"title":"Digital Forensic Investigation Development Model","authors":"Ankur Kumar Shrivastava, Nitisha Payal, A. Rastogi, A. Tiwari","doi":"10.1109/CICN.2013.115","DOIUrl":"https://doi.org/10.1109/CICN.2013.115","url":null,"abstract":"The arena of computer forensics investigation is a relatively new field of study. Many of the methods used in digital forensics have not been formally outlined. Digital Forensics is looked as part of art and part of science. This paper discussed breaking down the digital forensic investigation and their progression into an investigation development model so that an examiner can easily grip the problem and challenges during preparing and processing investigations. After going through various system and case analyses key issues, resulting in the documentation of role of computer examiner to gather evidence from a suspect computer terminal and determine whether the suspect committed a crime or violated a organization policies. As an outcome Digital forensic investigation development model (DFIDM) is introduced as a tailored approach for computer examiner or investigators for gathering and preserving the necessary digital evidence from different computer terminals or resources.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116065838","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 projected technique is based on the utilization of customized three-level resonant converter topology to increase their power ratings to be in several kilowatts levels. In this technique low voltage stress on switches, made possibility of operation with high frequency, possibility of zero voltage switching, can be applied under a wide range of input and output conditions including high flexibility in operation and control can be achieved using the principle of combined control of frequency and asymmetrical pulse width modulation. In proposed technique the output voltage is regulated through the variation of frequency and input power factor correction are obtained through pulse width modulation control. The proposed topology of converter has been implemented and investigated in the MATLAB/Simulink and the various results are provided to validate the proposed concepts.
{"title":"Modeling and Performance Analysis of Single Stage Power Factor Corrected Resonant Converter Using MATLAB/Simulink","authors":"J. S. Soni, Smita Pareek, H. Agrawal","doi":"10.1109/CICN.2013.144","DOIUrl":"https://doi.org/10.1109/CICN.2013.144","url":null,"abstract":"The projected technique is based on the utilization of customized three-level resonant converter topology to increase their power ratings to be in several kilowatts levels. In this technique low voltage stress on switches, made possibility of operation with high frequency, possibility of zero voltage switching, can be applied under a wide range of input and output conditions including high flexibility in operation and control can be achieved using the principle of combined control of frequency and asymmetrical pulse width modulation. In proposed technique the output voltage is regulated through the variation of frequency and input power factor correction are obtained through pulse width modulation control. The proposed topology of converter has been implemented and investigated in the MATLAB/Simulink and the various results are provided to validate the proposed concepts.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124086493","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
扫码关注我们
求助内容：
应助结果提醒方式：