2017 International Conference on Intelligent Computing and Control (I2C2)最新文献_第7页

Effects of parasitic fringe capacitance on threshold voltage of underlap DG-MOSFET 寄生条纹电容对下搭接DG-MOSFET阈值电压的影响

2017 International Conference on Intelligent Computing and Control (I2C2) Pub Date : 2017-06-01 DOI: 10.1109/I2C2.2017.8321915

P. Verma, Ashutosh Nandi

引用次数: 0

Trust evaluation in detection of provenance forgery and packet drop attacks in WSNs 基于信任评估的wsn来源伪造和丢包攻击检测

2017 International Conference on Intelligent Computing and Control (I2C2) Pub Date : 2017-06-01 DOI: 10.1109/I2C2.2017.8321838

Henna Thesnim, M. Nithin

引用次数: 0

Manufacturing and mechanical characterization of dual particle reinforced hybrid composites 双颗粒增强混杂复合材料的制备及力学性能研究

2017 International Conference on Intelligent Computing and Control (I2C2) Pub Date : 2017-06-01 DOI: 10.1109/I2C2.2017.8321903

V. Mohanavel, K. Rajan, S. Kumar, P. Ganeshan

引用次数: 1

Semantic search on summarized RDF triples 摘要RDF三元组的语义搜索

2017 International Conference on Intelligent Computing and Control (I2C2) Pub Date : 2017-06-01 DOI: 10.1109/I2C2.2017.8321904

P. Gayathri, V. Rajendran

{"title":"Semantic search on summarized RDF triples","authors":"P. Gayathri, V. Rajendran","doi":"10.1109/I2C2.2017.8321904","DOIUrl":"https://doi.org/10.1109/I2C2.2017.8321904","url":null,"abstract":"Information is for the most part found inside databases of some kind. Coordinating these information would give advantages to the associations that claim these information. RDF is a general recommendation dialect for the Web, binding together information from different sources. SPARQL, a query language for RDF, can join information from various databases. Querying a huge RDF informational collection is to a great degree time consuming. Submitting a SPARQL query to a more promising subgraph will increase speed and reduce search space. For this, RDF summarization is done. Existing systems either use graph-based techniques for summarizing RDF or divide RDF triples simply based on its elements. RDF though possessing a graph like structure, cannot be expected to have every features of graph structure. And simple partitioning based on triple elements is also inefficient. In this paper, RDF dataset is first partitioned based on predicate similarity. These partitions are clustered based on semantic relatedness between predicates, so that more similar triples come in a single cluster. The RDF cluster graphs thus obtained are stored in Jena Tuple DataBase(TDB) as named graphs. SPARQL querying, is done on this named graph collection. A list of models that the SPARQL query require is obtained from index and querying is done on this union of graphs. The proposed algorithm is faster as search space is reduced and is also scalable.","PeriodicalId":288351,"journal":{"name":"2017 International Conference on Intelligent Computing and Control (I2C2)","volume":"42 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114043575","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}

引用次数: 5

Generating analytic insights on human behavior using image processing 使用图像处理生成对人类行为的分析见解

2017 International Conference on Intelligent Computing and Control (I2C2) Pub Date : 2017-06-01 DOI: 10.1109/I2C2.2017.8321802

Namit Juneja, R. Muthu

引用次数: 1

Region based image classification using watershed transform techniques 基于区域的分水岭变换图像分类技术

2017 International Conference on Intelligent Computing and Control (I2C2) Pub Date : 2017-06-01 DOI: 10.1109/I2C2.2017.8321839

M. S. Pawar, Louis Perianayagam, N. Rani

引用次数: 11

Dynamic channel access with asynchronous sleep-wake scheduling to improve energy efficiency in CRSNs 基于异步睡眠-觉醒调度的动态通道接入提高crsn的能量效率

2017 International Conference on Intelligent Computing and Control (I2C2) Pub Date : 2017-06-01 DOI: 10.1109/I2C2.2017.8321843

S. Akhila, K. Priya

{"title":"Dynamic channel access with asynchronous sleep-wake scheduling to improve energy efficiency in CRSNs","authors":"S. Akhila, K. Priya","doi":"10.1109/I2C2.2017.8321843","DOIUrl":"https://doi.org/10.1109/I2C2.2017.8321843","url":null,"abstract":"Wireless sensor network (WSN) suffer uncontrolled interference while using license free spectrum due to the increasing crowd in the band. The cognitive radio (CR) is a promising solution for this problem. CR technology can be applied in WSN to form cognitive radio sensor network (CRSN). With the consideration of energy consumption of channel sensing and switching, when the sensor nodes should sense and switch to a licensed channel due to increased packet loss rate in licensed free channel can be determined. Two dynamic channel accessing schemes are proposed for intra-cluster data transmission and inter-cluster data transmission. The opportunistic channel sensing improves the energy efficiency in CRSNs. And also an asynchronous sleep-wake scheduling mechanism is used for reducing energy consumption. This scheduling mechanism allows the sensor nodes to sleep when the nodes are not participating in data transmission, by that network lifetime can be increased. Simulation results demonstrate that the channel accessing schemes and asynchronous sleep-wake scheduling scheme can significantly reduce the energy consumption and effectively achieves network lifetime extension in CRSNs.","PeriodicalId":288351,"journal":{"name":"2017 International Conference on Intelligent Computing and Control (I2C2)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123695837","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}

引用次数: 2

Design and simulation of multiband fractal antenna with various geometries 不同几何形状多波段分形天线的设计与仿真

2017 International Conference on Intelligent Computing and Control (I2C2) Pub Date : 2017-06-01 DOI: 10.1109/I2C2.2017.8321867

M. Sowmya, P. Nagaraju, Shveta B Totad, K. Rakesh

引用次数: 2

Development of road sign recognition for ADAS using OpenCV 基于OpenCV的ADAS道路标志识别的开发

2017 International Conference on Intelligent Computing and Control (I2C2) Pub Date : 2017-06-01 DOI: 10.1109/I2C2.2017.8321941

Naina P Botekar, M. Mahalakshmi

引用次数: 2

Coverage path planning for an autonomous robot specific to agricultural operations 农业作业专用自主机器人覆盖路径规划

2017 International Conference on Intelligent Computing and Control (I2C2) Pub Date : 2017-06-01 DOI: 10.1109/I2C2.2017.8321955

S. Kalaivanan, R. Kalpana

{"title":"Coverage path planning for an autonomous robot specific to agricultural operations","authors":"S. Kalaivanan, R. Kalpana","doi":"10.1109/I2C2.2017.8321955","DOIUrl":"https://doi.org/10.1109/I2C2.2017.8321955","url":null,"abstract":"Acute labor shortage and an increase in daily wages are forcing farm owners to move towards automated machinery. While the industrial revolution in India has significantly induced the shift towards machinery from indigenous equipment, we are still lagging behind in the field of automated equipment for agriculture. The key component for such systems is the path planning methodology used. A specific class of such an algorithm known as coverage path planning (CPP) is utilized for covering farmlands to perform various operations such as seeding, tilling, ploughing or spraying fertilizers and pesticides. This paper presents a novel CPP algorithm for automated machinery intended for usage in agriculture. In order to reduce the directional constraints, the proposed algorithm utilizes a high-resolution grid map representation of the environment. Free space is covered by distinguishing the grid cells as covered, unexplored, partial obstacle and obstacle cell. A distance transformation function is used to determine the order of covering unexplored cells as well as the shortest path to them, in the given environment. The performance of the proposed algorithm is evaluated with metrics such as completeness of coverage, time efficiency and also robustness to changes in the environment. Robotic Operating System (ROS) and Gazebo were used for simulating the proposed algorithm. The results prove the feasibility of the proposed algorithm to be implemented for automated systems to perform efficient coverage in agricultural operations.","PeriodicalId":288351,"journal":{"name":"2017 International Conference on Intelligent Computing and Control (I2C2)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128684136","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}

引用次数: 3