发布求助
文献互助 智能选刊 最新文献

2021 IEEE 18th India Council International Conference (INDICON)最新文献

筛选
英文 中文
Particle Swarm Optimization based Task Offloading in Vehicular Edge Computing 基于粒子群优化的车辆边缘计算任务卸载
2021 IEEE 18th India Council International Conference (INDICON) Pub Date : 2021-12-19 DOI: 10.1109/INDICON52576.2021.9691758
Niharika Keshari, T. Gupta, Dinesh Singh
{"title":"Particle Swarm Optimization based Task Offloading in Vehicular Edge Computing","authors":"Niharika Keshari, T. Gupta, Dinesh Singh","doi":"10.1109/INDICON52576.2021.9691758","DOIUrl":"https://doi.org/10.1109/INDICON52576.2021.9691758","url":null,"abstract":"Recent development in the field of Internet-of-Things (IoT) enhancing various safety and non-safety services of Vehicular Ad-Hoc networks (VANET). These applications execute on cloud or Mobile Edge server (MES) due to resource restriction of IoT devices. MES is limited in-network because of higher installation costs. Hence, some applications are unable to get service within the deadline. To resolve this, a new evaluation has been introduced named Vehicular Edge Computing (VEC) which utilizes idle vehicles as an edge server to fulfill upcoming demands of IoT. The challenge in VEC is to offload the task to the appropriate vehicle according to available resources, position and speed in order to improve resource utilization and makespan. Hence in this paper, we have proposed an offloading mechanism that offloads tasks using Particle Swarm optimization (PSO). Here the PSO assigns the best fit task to the vehicle according to position and speed of the vehicle for completing the computation within time. Simulation using OMNET++, Veins, and Sumo, shows that the proposed PSO-based offloading improves makespan, resource utilization and offloading ratio around 28.1%, 17.43% and 47.75% compared to Branch and Bound offloading technique.","PeriodicalId":106004,"journal":{"name":"2021 IEEE 18th India Council International Conference (INDICON)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134460632","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
A Study of Kidney Exchange Problem and its Recent Challenges 肾脏交换问题及其近期挑战的研究
2021 IEEE 18th India Council International Conference (INDICON) Pub Date : 2021-12-19 DOI: 10.1109/INDICON52576.2021.9691524
Sanjeev Kumar, Bhabendu Kumar Mohanta
{"title":"A Study of Kidney Exchange Problem and its Recent Challenges","authors":"Sanjeev Kumar, Bhabendu Kumar Mohanta","doi":"10.1109/INDICON52576.2021.9691524","DOIUrl":"https://doi.org/10.1109/INDICON52576.2021.9691524","url":null,"abstract":"A person whose both kidneys have been damaged can hardly survive. One early idea in this situation is to have kidneys from a deceased person. Further medical probe reveals that one healthy person whose two kidneys are functioning well can survive with only one kidney and thereby the fact is that the person who is healthy can donate one of the kidneys. This creates an interesting market with living donors and is very popular in many countries. However, a living donor can’t exchange his/her kidneys with the patient whose two kidneys have been damaged because of the medical issues. But, this type of donor may have a match with some other patient and this patient’s living donor can have a match with the former one. This situation can be modeled with house allocation problem where someone having a house(donor) has some other house as his/her preference (other donor) and vice versa. In this paper, a study is carried out in this direction and simultaneous kidney transplantation issue is simulated with largescale implementation. A current research challenge of the kidney exchange problem, namely the incentive issues of the hospitals, is explored next and a budget feasible mechanism is proposed.","PeriodicalId":106004,"journal":{"name":"2021 IEEE 18th India Council International Conference (INDICON)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133378620","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}
引用次数: 0
Huffman Coding based ECG Processing For Compression-Distortion Tradeoff 基于霍夫曼编码的心电压缩失真权衡处理
2021 IEEE 18th India Council International Conference (INDICON) Pub Date : 2021-12-19 DOI: 10.1109/INDICON52576.2021.9691675
Debarpan Bhattacharya
{"title":"Huffman Coding based ECG Processing For Compression-Distortion Tradeoff","authors":"Debarpan Bhattacharya","doi":"10.1109/INDICON52576.2021.9691675","DOIUrl":"https://doi.org/10.1109/INDICON52576.2021.9691675","url":null,"abstract":"ECG is a fundamental cardiac signal which finds rigorous use in diagnosis of several cardio-respiratory diseases. Therefore, compression techniques, that are associated with high distortion upon reconstruction, are not acceptable in maximum cases. In our proposed approach, a noble huffman coding based compression technique for ECG signal is proposed. It offers high compression ratio (CR) with minimal percentage mean square difference (PRD). Upon testing on MIT-BIH recordings, it exhibits maximum PRD of only 0.445% while offering CR of 5.914. Additionally, the algorithm offers flexibility to decrease PRD value at the cost of CR, obtained by tuning a single parameter. This makes the setup even appropriate for applications where CR is of uttermost importance, even with some accepted distortion.","PeriodicalId":106004,"journal":{"name":"2021 IEEE 18th India Council International Conference (INDICON)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131689069","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}
引用次数: 0
Design Considerations for Low Spur Charge Pump in High Performance Phase Locked Loops 高性能锁相环中低杂散电荷泵的设计考虑
2021 IEEE 18th India Council International Conference (INDICON) Pub Date : 2021-12-19 DOI: 10.1109/INDICON52576.2021.9691703
A. Choudhary, Aniruddha Khade, R. Zele
{"title":"Design Considerations for Low Spur Charge Pump in High Performance Phase Locked Loops","authors":"A. Choudhary, Aniruddha Khade, R. Zele","doi":"10.1109/INDICON52576.2021.9691703","DOIUrl":"https://doi.org/10.1109/INDICON52576.2021.9691703","url":null,"abstract":"This paper presents the analysis and design of a low-current mismatch charge pump for a high-performance Fractional-N Phase-Locked Loop (PLL). A charge pump is one of the significant contributors of frequency spurs in Fractional-N PLL. In this paper, conventional charge pump topologies gate switched, drain switched, and source switched are studied and designed. Nonidealities associated with conventional charge pump topologies - current mismatch, Up & Down skew, and clock feedthrough are analyzed. Improved charge pump topologies are explored and designed for each case in 65nm CMOS technology to reduce the current mismatch. Improved topologies utilize the negative feedback using an operational amplifier (OPAMP) to reduce the current mismatch. DC simulations show the current mismatch reduction from 20% to less than 0.06%.","PeriodicalId":106004,"journal":{"name":"2021 IEEE 18th India Council International Conference (INDICON)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127815611","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}
引用次数: 1
PRFL: Predicate Rank based Fault Localization PRFL:基于谓词秩的故障定位
2021 IEEE 18th India Council International Conference (INDICON) Pub Date : 2021-12-19 DOI: 10.1109/INDICON52576.2021.9691646
Sangharatna Godboley, A. Dutta
{"title":"PRFL: Predicate Rank based Fault Localization","authors":"Sangharatna Godboley, A. Dutta","doi":"10.1109/INDICON52576.2021.9691646","DOIUrl":"https://doi.org/10.1109/INDICON52576.2021.9691646","url":null,"abstract":"Fault localization (FL) is one of the most tedious, time consuming and effort-intensive task during the complete process of software debugging. Any improvement in this task leads to a reduction in total software development cost. For effective fault localization, we require a sufficient test suite comprised of the balanced pass and fail test cases. However, many times we don’t have access to these types of test suites. To solve this problem, we introduce a verification-based fault-localization technique, which prioritizes the program statements at predicate-level granularity. We use CBMC a Bounded Model Checker tool for the verification of buggy C-programs. We also consider the comprehensibility of the conditions presents a predicate to decide their suspiciousness scores. The input to our proposed approach is a buggy C-program and final outcome is a prioritized list of predicates and the executable statements using suspiciousness scores for a fault.","PeriodicalId":106004,"journal":{"name":"2021 IEEE 18th India Council International Conference (INDICON)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129019250","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}
引用次数: 1
Malicious URL Classification Using Deep Neural Network 基于深度神经网络的恶意URL分类
2021 IEEE 18th India Council International Conference (INDICON) Pub Date : 2021-12-19 DOI: 10.1109/INDICON52576.2021.9691762
Mainak Sen, K. Ray, A. Chakrabarti
{"title":"Malicious URL Classification Using Deep Neural Network","authors":"Mainak Sen, K. Ray, A. Chakrabarti","doi":"10.1109/INDICON52576.2021.9691762","DOIUrl":"https://doi.org/10.1109/INDICON52576.2021.9691762","url":null,"abstract":"One of the most serious cybersecurity threats has been discovered as malicious URL classification. People are duped into believing they are visiting a respectable website, and they are persuaded to provide their credentials by malicious websites. Many cyber crimes, such as phishing, cyberbullying, spamming, and malware, are founded on the hosting of dangerous URLs. The existing methods are slow and rely on manual feature engineering. In this research, we look at Convolutional Neural Networks, Long Short Term Memory, and a hybrid model of CNN followed by LSTM, and we propose a new strategy based on the results. Character embedding, in which each character is treated as a token, and word embedding, in which each word is treated as a token, are both used in our technique. In comparison to the word embedded hybrid mode1(0.988), the character embedded hybrid model has a higher accuracy (.996).","PeriodicalId":106004,"journal":{"name":"2021 IEEE 18th India Council International Conference (INDICON)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129204576","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}
引用次数: 1
Exploiting Web Snippets for Multi-label Anime Genre Prediction 利用Web片段进行多标签动漫类型预测
2021 IEEE 18th India Council International Conference (INDICON) Pub Date : 2021-12-19 DOI: 10.1109/INDICON52576.2021.9691726
Joyeta Sharma, Abu Nowshed Chy
{"title":"Exploiting Web Snippets for Multi-label Anime Genre Prediction","authors":"Joyeta Sharma, Abu Nowshed Chy","doi":"10.1109/INDICON52576.2021.9691726","DOIUrl":"https://doi.org/10.1109/INDICON52576.2021.9691726","url":null,"abstract":"Anime is a type of animation film attributed with highly stylized, colorful-art, imaginary locations, and mature topics that follow the traditional Japanese 2D animation. It is one of the prominent means of entertainment for the young generation. The widespread use of the Internet has led to large volumes of anime-related data being generated and shared online. But it is difficult to find the proper genres information about particular animes. Though some studies exploited the synopsis for movie genre prediction, very few studies focused on anime genres. Therefore, it is a formidable task to design an effective system regarding this to meet the viewers’ satisfaction. In this paper, we exploit the web-search snippets to distill the anime genres information. Upon extracting a set of web snippets for each anime, we employ the naive preprocessing techniques to remove noises from snippet texts. Next, we make use of the n-gram and embedding-based features for effective data representation. Then, a set of state-of-the-art classifiers are employed in our multilabel anime genre prediction framework. We present a comparative performance analysis among these methods that yields a significant insight of using web snippets on genre prediction. Experimental findings demonstrated the efficacy of deep learning-based approaches for this task.","PeriodicalId":106004,"journal":{"name":"2021 IEEE 18th India Council International Conference (INDICON)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128422521","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}
引用次数: 0
Measurement and Evaluation of Human Vital Sign using 77GHz AWR1642 FMCW Radar Sensor 基于77GHz AWR1642 FMCW雷达传感器的人体生命体征测量与评价
2021 IEEE 18th India Council International Conference (INDICON) Pub Date : 2021-12-19 DOI: 10.1109/INDICON52576.2021.9691483
P. Srihari, G. Vandana, B. S. Raghavendra
{"title":"Measurement and Evaluation of Human Vital Sign using 77GHz AWR1642 FMCW Radar Sensor","authors":"P. Srihari, G. Vandana, B. S. Raghavendra","doi":"10.1109/INDICON52576.2021.9691483","DOIUrl":"https://doi.org/10.1109/INDICON52576.2021.9691483","url":null,"abstract":"This paper proposes vital sign measurements of humans like heart rate (HR) and respiration rate (RR). The Texas Instruments AWR1642, frequency modulated continuous wave (FMCW) mmwave radar sensor, operating as 77-81 GHz frequency with 4GHz as the sweep bandwidth of the linear frequency modulated (LFM) waveform, is deployed to measure the HR and RR vital parameters. Here, twenty subjects (10 male; 10 female) experimental data has been collected using TI AWR1642 radar sensor, personal computer (PC), and DCA1000 data acquisition module. The HR and RR algorithm is applied to the process data to measure the HR and RR of these subjects. The male and female subjects’ average HR is 78.587 and 77.827, respectively. Further, the average RR of the male and female subjects is 19.959 and 19.23, respectively. Furthermore, a pulse oximeter(POM) obtains HR ground truth information to validate the proposed method. The overall absolute mean error percentage(MEP) compared to pulse oximeter data is 4.7935% for 20 volunteers who have participated in the experiment.","PeriodicalId":106004,"journal":{"name":"2021 IEEE 18th India Council International Conference (INDICON)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116676499","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}
引用次数: 1
Full Duplex Relay Assisted Coded Cooperation for Next Generation Wireless Networks 下一代无线网络全双工中继辅助编码合作
2021 IEEE 18th India Council International Conference (INDICON) Pub Date : 2021-12-19 DOI: 10.1109/INDICON52576.2021.9691566
Sagnik Bhattacharyya, Pankaj Kumar, S. Darshi, Omraj Burnwal, Kushal Singhal
{"title":"Full Duplex Relay Assisted Coded Cooperation for Next Generation Wireless Networks","authors":"Sagnik Bhattacharyya, Pankaj Kumar, S. Darshi, Omraj Burnwal, Kushal Singhal","doi":"10.1109/INDICON52576.2021.9691566","DOIUrl":"https://doi.org/10.1109/INDICON52576.2021.9691566","url":null,"abstract":"Wireless networks based on Network Coded Co-operation (NCC) have shown promising results in achieving faster and reliable communication. To make the next-generation wireless systems swifter, the nodes can be equipped to work in Full-Duplex (FD) mode. In this paper, we thus model a multi source-destination NCC scenario with a relay working in FD mode (FD-NCC) and propose a decoding scheme for it. FD schemes have the benefit of an increased achievable rate. Extensive simulations carried out in MATLAB show an improved performance for FD in terms of achievable rate when compared to a Half-Duplex NCC (HD-NCC) scenario. NCC systems aided by a FD relay, also provides higher throughput thus, making it suitable for applications requiring reliable low latency communication (RLLC) in 5G/6G scenarios.","PeriodicalId":106004,"journal":{"name":"2021 IEEE 18th India Council International Conference (INDICON)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116055812","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}
引用次数: 1
Privacy preserving and secure machine learning 隐私保护和安全机器学习
2021 IEEE 18th India Council International Conference (INDICON) Pub Date : 2021-12-19 DOI: 10.1109/INDICON52576.2021.9691706
Akshay Prabhu, Niranjan Balasubramanian, Chinmay Tiwari, R. Deolekar
{"title":"Privacy preserving and secure machine learning","authors":"Akshay Prabhu, Niranjan Balasubramanian, Chinmay Tiwari, R. Deolekar","doi":"10.1109/INDICON52576.2021.9691706","DOIUrl":"https://doi.org/10.1109/INDICON52576.2021.9691706","url":null,"abstract":"Privacy in Machine Learning is a fundamentally important issue that practitioners must keep in mind while developing models. This paper presents the various methods that can be used to defend models against attack that undermine privacy and safety of the data utilized to generate models. These methods help prevent attacks against both the trained model as well as the underlying training data used by the model. The solutions this paper explores include differential privacy and homomorphic encryption which defend the training data while it is being used to train the model while machine unlearning empowers the data scientist to remove training samples post training.","PeriodicalId":106004,"journal":{"name":"2021 IEEE 18th India Council International Conference (INDICON)","volume":"600 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116298666","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}
引用次数: 1
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信