GE Small world is a new type of GIS software. Based on the fundamental meaning of Geographic Information System (GIS), the important features of GE Small world and the fundamental features of Forest Resources, we discuss the current application in forest resources information management, forest insect pest and disease control, the integration between GPS (global positioning system) and YAN AN RS (remote sensing), resource management in nature reserve. At the same time the further development of GE Small world in forest resources management has been analyzed.
GE小世界是一款新型的GIS软件。从地理信息系统(GIS)的基本含义、GE小世界的重要特征和森林资源的基本特征出发,论述了地理信息系统在森林资源信息管理、森林病虫害防治、全球定位系统(GPS)与遥感(YAN AN RS)集成、自然保护区资源管理等方面的应用现状。同时对GE小世界在森林资源管理方面的进一步发展进行了分析。
{"title":"Forest Resources Management Based on GIS Technology","authors":"Zhongwei Wang, Yan An","doi":"10.1109/CICN.2013.130","DOIUrl":"https://doi.org/10.1109/CICN.2013.130","url":null,"abstract":"GE Small world is a new type of GIS software. Based on the fundamental meaning of Geographic Information System (GIS), the important features of GE Small world and the fundamental features of Forest Resources, we discuss the current application in forest resources information management, forest insect pest and disease control, the integration between GPS (global positioning system) and YAN AN RS (remote sensing), resource management in nature reserve. At the same time the further development of GE Small world in forest resources management has been analyzed.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"130 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":"122016985","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}
Microwave cavity with complicated structure and rubidium gas is studied by mode matching method. By calculating resonant frequencies of TE011 mode, main factors that influence resonant frequency is studied. In addition, the resonant frequency of TE011 mode is compared with commercial software (CST) results. The computed results show good agreement with CST simulations. It can be seen that this method is of high credibility and efficiency. This paper is of great significance for cavity design and theoretical perfection.
{"title":"Study on Resonant Properties of Complicated Microwave Cavity in Rubidium Frequency Standard","authors":"Xiaoxiao Li, Fan Yang","doi":"10.1109/CICN.2013.26","DOIUrl":"https://doi.org/10.1109/CICN.2013.26","url":null,"abstract":"Microwave cavity with complicated structure and rubidium gas is studied by mode matching method. By calculating resonant frequencies of TE011 mode, main factors that influence resonant frequency is studied. In addition, the resonant frequency of TE011 mode is compared with commercial software (CST) results. The computed results show good agreement with CST simulations. It can be seen that this method is of high credibility and efficiency. This paper is of great significance for cavity design and theoretical perfection.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"3 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":"128109282","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. Manekar, Malti Nagle, Pankaj K. Kawadkar, H. Gupta
Geographic Information Systems (GIS) has been prominently working for the designed to sculpt the world. With the growth and data and increasing sophistication of analysis and processing techniques the traditional sequential methods of performing GIS processing on desktop computers is insufficient. This paper is based on analysis and the performance of 3D convex hull algorithm for the three flavors of parallel architecture considering spatial scatter point data using parallel programming. As GIS use huge set of scatter data for processing and development of many product, a Convex Hull of planner scattered point set will useful in the area of planning and grafting the satellite image in GIS. Analysis is based on the parallel algorithm on OpenMP, MPI and Hybrid of HPC (High Performance Computing) architecture also improvement strategy for the huge data point available for computing such as GIS spatial data with respective OpenMP, MPI and Hybrid is stated.
{"title":"Sifting of a Potent Convex Hull Algorithm for Scattered Point Set Using Parallel Programming","authors":"A. Manekar, Malti Nagle, Pankaj K. Kawadkar, H. Gupta","doi":"10.1109/CICN.2013.121","DOIUrl":"https://doi.org/10.1109/CICN.2013.121","url":null,"abstract":"Geographic Information Systems (GIS) has been prominently working for the designed to sculpt the world. With the growth and data and increasing sophistication of analysis and processing techniques the traditional sequential methods of performing GIS processing on desktop computers is insufficient. This paper is based on analysis and the performance of 3D convex hull algorithm for the three flavors of parallel architecture considering spatial scatter point data using parallel programming. As GIS use huge set of scatter data for processing and development of many product, a Convex Hull of planner scattered point set will useful in the area of planning and grafting the satellite image in GIS. Analysis is based on the parallel algorithm on OpenMP, MPI and Hybrid of HPC (High Performance Computing) architecture also improvement strategy for the huge data point available for computing such as GIS spatial data with respective OpenMP, MPI and Hybrid is stated.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"6 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":"114492828","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}
Deepa Singh, B. Pandey, G. Tomar, Bimal Kumar Sarkar
In this paper the effect of back off factor on exponential algorithm is analyzed and binary exponential algorithm is implemented in Mat lab. Binary Exponential Algorithm is widely used as a network congestion avoidance or collision resolution protocol. The detailed analysis of saturation throughput is done in this work. This work also covers packet's medium access delay for a given number of node N. Binary exponential is a special case of exponential back off when r =2, where r is a back off factor and we basically analyse the effect of back off factor r =1.1, 1.2, 1.3, 1.4, 1.5, 1.6, 1.7, 1.8, 1.9, 2.0 on exponential back off algorithm. All the result is obtained through Matlab (Matrix Laboratory) simulation language.
{"title":"Performance Evaluation of Backoff Method -- Effect of Backoff Factor on Exponential Backoff Algorithm","authors":"Deepa Singh, B. Pandey, G. Tomar, Bimal Kumar Sarkar","doi":"10.1109/CICN.2013.27","DOIUrl":"https://doi.org/10.1109/CICN.2013.27","url":null,"abstract":"In this paper the effect of back off factor on exponential algorithm is analyzed and binary exponential algorithm is implemented in Mat lab. Binary Exponential Algorithm is widely used as a network congestion avoidance or collision resolution protocol. The detailed analysis of saturation throughput is done in this work. This work also covers packet's medium access delay for a given number of node N. Binary exponential is a special case of exponential back off when r =2, where r is a back off factor and we basically analyse the effect of back off factor r =1.1, 1.2, 1.3, 1.4, 1.5, 1.6, 1.7, 1.8, 1.9, 2.0 on exponential back off algorithm. All the result is obtained through Matlab (Matrix Laboratory) simulation language.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"1 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":"130131191","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 apply clock gating technique in Global Reset ALU design on 28nm Artix7 FPGA to save dynamic and clock power both. This technique is simulated in Xilinx14.3 tool and implemented on 28nm Artix7 XC7A200T FFG1156-1 FPGA. When clock gating technique is not applied clock power contributes 32.25%, 4.24%, 3.06%, 3.09%, and 3.09% of overall dynamic power on 100 MHz, 1 GHz, 10 GHz, 100GHz and1 THz device frequency respectively. When clock gating technique is applied clock power contributes 0%, 1.02%, 1.06%, 1.06%, and 1.06% of overall dynamic power on 100 MHz, 1 GHz, 10 GHz, and 100GHz and1 THz device frequency respectively. With clock gating, there is 100%, 76.92%, 66.30%, 66.55% and 66.58% reduction in clock power in compare to clock power consumption without clock gate on 100 MHz, 1 GHz, 10 GHz, 100 GHz and 1 THz respectively operating frequency. Clock gating is more effective on 28nm in compare to 40nm and 90nm technology file.
{"title":"Clock Gating Aware Low Power Global Reset ALU and Implementation on 28nm FPGA","authors":"B. Pandey, J. Yadav, J. Kumar, Ravi Kumar","doi":"10.1109/CICN.2013.91","DOIUrl":"https://doi.org/10.1109/CICN.2013.91","url":null,"abstract":"In this paper, we apply clock gating technique in Global Reset ALU design on 28nm Artix7 FPGA to save dynamic and clock power both. This technique is simulated in Xilinx14.3 tool and implemented on 28nm Artix7 XC7A200T FFG1156-1 FPGA. When clock gating technique is not applied clock power contributes 32.25%, 4.24%, 3.06%, 3.09%, and 3.09% of overall dynamic power on 100 MHz, 1 GHz, 10 GHz, 100GHz and1 THz device frequency respectively. When clock gating technique is applied clock power contributes 0%, 1.02%, 1.06%, 1.06%, and 1.06% of overall dynamic power on 100 MHz, 1 GHz, 10 GHz, and 100GHz and1 THz device frequency respectively. With clock gating, there is 100%, 76.92%, 66.30%, 66.55% and 66.58% reduction in clock power in compare to clock power consumption without clock gate on 100 MHz, 1 GHz, 10 GHz, 100 GHz and 1 THz respectively operating frequency. Clock gating is more effective on 28nm in compare to 40nm and 90nm technology file.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"101 8 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":"132186067","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}
Shwetank Shekhar, M. Pandey, G. Agarwal, Nitin Saxena
USB forms the backbone of communication to external world. When a USB device is attached to a USB host, a sequence of interaction happens for establishing the communication channel, known as enumeration. This paper explains the enumeration process of USB2.0 in detail and discusses the challenges faced during post silicon debug of couple of issues related with enumeration. As a case study we will analyze two issues which were found during enumeration. The first issue is related to repeated enumeration in which process hangs and second is related to timeout failure.
{"title":"Post Silicon Debugging Approach for USB2.0: Case Study of Enumeration","authors":"Shwetank Shekhar, M. Pandey, G. Agarwal, Nitin Saxena","doi":"10.1109/CICN.2013.92","DOIUrl":"https://doi.org/10.1109/CICN.2013.92","url":null,"abstract":"USB forms the backbone of communication to external world. When a USB device is attached to a USB host, a sequence of interaction happens for establishing the communication channel, known as enumeration. This paper explains the enumeration process of USB2.0 in detail and discusses the challenges faced during post silicon debug of couple of issues related with enumeration. As a case study we will analyze two issues which were found during enumeration. The first issue is related to repeated enumeration in which process hangs and second is related to timeout failure.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"51 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":"114179628","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 the design and analysis of folded open stub impedance Micro strip Low-pass filters at cutoff frequency 1.4 GHz which gives insertion loss (S21) of -3. 413 dB and return loss of-2.571 dB at cut-off point. Design with making by the micro strip technology, it becomes more practical and widely used in modern Microwave circuits. This filter has less complexity and more compact size rather than other filters. Simulation is performed with the help of IE3D 14.1 Electromagnetic simulator, based on method of moments and results have been fairly good.
{"title":"Designing of Open Stub Low Pass Filter for 1.4 GHz","authors":"Akansha Agrawal, Ritambara Gupta, V. Kushwah","doi":"10.1109/CICN.2013.25","DOIUrl":"https://doi.org/10.1109/CICN.2013.25","url":null,"abstract":"This paper presents the design and analysis of folded open stub impedance Micro strip Low-pass filters at cutoff frequency 1.4 GHz which gives insertion loss (S21) of -3. 413 dB and return loss of-2.571 dB at cut-off point. Design with making by the micro strip technology, it becomes more practical and widely used in modern Microwave circuits. This filter has less complexity and more compact size rather than other filters. Simulation is performed with the help of IE3D 14.1 Electromagnetic simulator, based on method of moments and results have been fairly good.","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":"116726219","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, graph coloring has been done using artificial bee colony (ABC) optimization algorithm. Graph coloring deals with the challenge of coloring the nodes of any graph by least possible number of colors while ensuring on same time that two adjacent nodes does not gain same color. That least possible count of colors used denotes the chromatic number of a graph and to determine this number for any graph is an NP-complete problem hence no existing polynomial time algorithm can solve it. To find the best coloring sequence, a large search space has to be explored. Graph coloring deals with the challenge of coloring the nodes of any graph by least possible number of colors while ensuring on same time that two adjacent nodes does not gain same color and proposed a novel artificial bee colony (ABC) optimization algorithm for graph coloring. In this paper, we analyzed the proposed algorithm and compared it with three other graph coloring algorithms i.e. first fit, largest degree based ordering (LDO) and saturation degree based ordering (SDO). These results also indicate that ABC algorithm converges in a few iterations and is able to optimally allocate colors to vertices of a graph.
{"title":"A Novel ABC Optimization Algorithm for Graph Coloring Problem","authors":"R. S. Tomar, Sonali Singh, S. Verma, G. Tomar","doi":"10.1109/CICN.2013.61","DOIUrl":"https://doi.org/10.1109/CICN.2013.61","url":null,"abstract":"In this paper, graph coloring has been done using artificial bee colony (ABC) optimization algorithm. Graph coloring deals with the challenge of coloring the nodes of any graph by least possible number of colors while ensuring on same time that two adjacent nodes does not gain same color. That least possible count of colors used denotes the chromatic number of a graph and to determine this number for any graph is an NP-complete problem hence no existing polynomial time algorithm can solve it. To find the best coloring sequence, a large search space has to be explored. Graph coloring deals with the challenge of coloring the nodes of any graph by least possible number of colors while ensuring on same time that two adjacent nodes does not gain same color and proposed a novel artificial bee colony (ABC) optimization algorithm for graph coloring. In this paper, we analyzed the proposed algorithm and compared it with three other graph coloring algorithms i.e. first fit, largest degree based ordering (LDO) and saturation degree based ordering (SDO). These results also indicate that ABC algorithm converges in a few iterations and is able to optimally allocate colors to vertices of a graph.","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":"129429794","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 dual-band band stop filter is designed based on a modified stepped impedance hairpin resonator in which, two open stubs are embedded in the structure. There are two transmission zeros in each one of the stop bands. The center frequencies of the stop bands are placed at 2 and 5.92 GHz and their widths are 0.94 and 0.55 GHz, respectively. These stop bands can be adjusted by changing the dimensions of the embedded open stubs. This filter is then transferred to another substrate, fabricated and measured and the results for the two substrates are compared.
{"title":"Dual-Band Bandstop Filter Using Modified Stepped-Impedance Hairpin Resonators","authors":"S. Majidifar, S. Makki, S. Alirezaee, A. Ahmadi","doi":"10.1109/CICN.2013.22","DOIUrl":"https://doi.org/10.1109/CICN.2013.22","url":null,"abstract":"In this paper, a dual-band band stop filter is designed based on a modified stepped impedance hairpin resonator in which, two open stubs are embedded in the structure. There are two transmission zeros in each one of the stop bands. The center frequencies of the stop bands are placed at 2 and 5.92 GHz and their widths are 0.94 and 0.55 GHz, respectively. These stop bands can be adjusted by changing the dimensions of the embedded open stubs. This filter is then transferred to another substrate, fabricated and measured and the results for the two substrates are compared.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"46 47 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":"122068788","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 micro strip patch antenna is the most preferred for low cost and compact design. The proposed antenna design is simulated using FR-4 substrate with dielectric constant of 4.54 and thickness of 1.60mm on electromagnetic (EM) simulation software. The antenna designed has a compact structure with a total size of 60x60mm square. The bandwidth of micro strip patch antenna is enhanced by replacing a conducting ground plane by a high impedance EBG layer. The circular unit cells are placed in a circular pattern and it is found that on increasing the radius of each circular EBG cell, the bandwidth is increased. It is also observed that on increasing the radii of vias, there is a slight decrement in the bandwidth of micro strip patch antennas. The bandwidth of micro strip patch antenna is increased from 13.41% to 18.68% when radius of EBG patches is increased from 2.5mm to 3.5mm which is much wider than the bandwidth of conventional antenna that is calculated to be 4.28%. The simulated results of the integrated antenna for wireless applications shows the good agreement with the proposed scheme.
{"title":"Bandwidth Enhancement of Microstrip Patch Antennas by Implementing Circular Unit Cells in Circular Pattern","authors":"Ruchika Gupta, Mithilesh Kumar","doi":"10.1109/CICN.2013.11","DOIUrl":"https://doi.org/10.1109/CICN.2013.11","url":null,"abstract":"The micro strip patch antenna is the most preferred for low cost and compact design. The proposed antenna design is simulated using FR-4 substrate with dielectric constant of 4.54 and thickness of 1.60mm on electromagnetic (EM) simulation software. The antenna designed has a compact structure with a total size of 60x60mm square. The bandwidth of micro strip patch antenna is enhanced by replacing a conducting ground plane by a high impedance EBG layer. The circular unit cells are placed in a circular pattern and it is found that on increasing the radius of each circular EBG cell, the bandwidth is increased. It is also observed that on increasing the radii of vias, there is a slight decrement in the bandwidth of micro strip patch antennas. The bandwidth of micro strip patch antenna is increased from 13.41% to 18.68% when radius of EBG patches is increased from 2.5mm to 3.5mm which is much wider than the bandwidth of conventional antenna that is calculated to be 4.28%. The simulated results of the integrated antenna for wireless applications shows the good agreement with the proposed scheme.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"35 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":"125034188","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}