首页 > 最新文献

2021 International Conference on Information Networking (ICOIN)最新文献

英文 中文
Mobility-Aware Optimal Task Offloading in Distributed Edge Computing 分布式边缘计算中移动性感知的最优任务卸载
Pub Date : 2021-01-13 DOI: 10.1109/ICOIN50884.2021.9334008
Youbin Jeon, Hosung Baek, Sangheon Pack
To cope with limited capabilities of mobile devices, task offloading in distributed edge computing (DEC) environments is perceived as a promising solution. However, the mobility of devices makes the task offloading a more challenging issue. In this paper, we investigate mobility-awareness for optimal task offloading in DEC environments. To this end, we formulate an optimization problem to minimize the response time of offloaded tasks. Simulation results demonstrate that the mobility-aware task offloading scheme can reduce the response time by 14% $sim 21$% compared with the conventional task offloading schemes without any mobility-awareness.
为了应对移动设备有限的能力,分布式边缘计算(DEC)环境中的任务卸载被认为是一个很有前途的解决方案。然而,设备的移动性使得任务卸载成为一个更具挑战性的问题。在本文中,我们研究了移动感知在DEC环境下的最优任务卸载。为此,我们制定了一个优化问题,以最小化卸载任务的响应时间。仿真结果表明,与无机动性感知的传统任务卸载方案相比,机动性感知任务卸载方案的响应时间缩短了14% ~ 21%。
{"title":"Mobility-Aware Optimal Task Offloading in Distributed Edge Computing","authors":"Youbin Jeon, Hosung Baek, Sangheon Pack","doi":"10.1109/ICOIN50884.2021.9334008","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9334008","url":null,"abstract":"To cope with limited capabilities of mobile devices, task offloading in distributed edge computing (DEC) environments is perceived as a promising solution. However, the mobility of devices makes the task offloading a more challenging issue. In this paper, we investigate mobility-awareness for optimal task offloading in DEC environments. To this end, we formulate an optimization problem to minimize the response time of offloaded tasks. Simulation results demonstrate that the mobility-aware task offloading scheme can reduce the response time by 14% $sim 21$% compared with the conventional task offloading schemes without any mobility-awareness.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"60 1","pages":"65-68"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83592095","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}
引用次数: 6
GRGE: Detection of Gliomas Using Radiomics, GA Features and Extremely Randomized Trees GRGE:利用放射组学、遗传特征和极度随机树检测胶质瘤
Pub Date : 2021-01-13 DOI: 10.1109/ICOIN50884.2021.9334021
Rahul Kumar, Ankur Gupta, Harkirat Singh Arora, B. Raman
Gliomas originates in glial cells and recognized as one of the most malignant and dangerous brain tumors and categories into two major classes i.e., High Grade Glioma (HGG) and Low Grade Glioma (LGG). Out of both, HGG tumors are more aggressive. Classification of grade of glioma is a crucial task for deciding the treatment therapy and estimating survival period of patient. In this work, a computational approach based on Radiomics and machine learning algorithms, namely GRGE, is proposed to discriminate between HGG and LGG. The approach, GRGE, has performed better than several state-of-art methods proposed in the literature for glioma classification.
胶质瘤起源于神经胶质细胞,是公认的恶性和危险程度最高的脑肿瘤之一,分为高级别胶质瘤(High Grade Glioma, HGG)和低级别胶质瘤(Low Grade Glioma, LGG)两大类。两者中,HGG肿瘤更具侵袭性。胶质瘤分级是决定治疗方案和估计患者生存期的重要任务。在这项工作中,提出了一种基于放射组学和机器学习算法的计算方法,即GRGE,来区分HGG和LGG。该方法,GRGE,比文献中提出的几种最先进的胶质瘤分类方法表现得更好。
{"title":"GRGE: Detection of Gliomas Using Radiomics, GA Features and Extremely Randomized Trees","authors":"Rahul Kumar, Ankur Gupta, Harkirat Singh Arora, B. Raman","doi":"10.1109/ICOIN50884.2021.9334021","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9334021","url":null,"abstract":"Gliomas originates in glial cells and recognized as one of the most malignant and dangerous brain tumors and categories into two major classes i.e., High Grade Glioma (HGG) and Low Grade Glioma (LGG). Out of both, HGG tumors are more aggressive. Classification of grade of glioma is a crucial task for deciding the treatment therapy and estimating survival period of patient. In this work, a computational approach based on Radiomics and machine learning algorithms, namely GRGE, is proposed to discriminate between HGG and LGG. The approach, GRGE, has performed better than several state-of-art methods proposed in the literature for glioma classification.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"20 1","pages":"379-384"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84445942","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
Implementation of Blockchain based P2P Energy Trading Platform 基于区块链的P2P能源交易平台的实现
Pub Date : 2021-01-13 DOI: 10.1109/ICOIN50884.2021.9333876
Su-keun Kwak, Joohyung Lee
As the development of smart cities, energy management systems have been changing from centralized management systems to distributed energy management systems for better energy efficiency. In the distributed energy management systems, while producing the energy from distributed users, there can be two types of users such that 1) users who have surplus energy generations and 2) users who lack energy generations compared to their demands. In this paper, to alleviate such imbalance of energy generation between distributed users, a peer to peer (P2P) based energy trading platform is proposed. Specifically, blockchain is one of emerging solutions in which transactions can be made reliably to achieve P2P transactions without any centralized broker intervention. Correspondingly, we implement the P2P energy trading platform under Ethereum’s smart contract for reliable trading. The energy generated from distributed users at the proposed platform can be traded by utilizing the characteristics of Decentralize Application. Specifically, we provide the details of implementations of the proposed platform, which includes both hardware platform and software platform. Further, we establish a web page and an mobile application for monitoring the transaction information such as transaction details and energy prices, which can enhance users’ accessibility. Finally, the demonstration of process of energy trading via web interface is represented.
随着智慧城市的发展,能源管理系统正在从集中式管理系统向分布式能源管理系统转变,以提高能源效率。在分布式能源管理系统中,当从分布式用户生产能源时,可以有两种类型的用户,即1)有剩余能量代的用户和2)与需求相比缺乏能量代的用户。为了缓解分布式用户之间的能源生产不平衡,本文提出了一种基于点对点(P2P)的能源交易平台。具体来说,区块链是一种新兴的解决方案,在这种解决方案中,交易可以可靠地实现P2P交易,而无需任何集中的代理干预。相应地,我们在以太坊智能合约下实现P2P能源交易平台,实现可靠交易。利用去中心化应用的特性,该平台上分布式用户产生的能量可以进行交易。具体来说,我们提供了所提出的平台的实现细节,包括硬件平台和软件平台。此外,我们建立了一个网页和一个移动应用程序来监控交易信息,如交易细节和能源价格,这可以增强用户的可访问性。最后,对基于web界面的能源交易过程进行了演示。
{"title":"Implementation of Blockchain based P2P Energy Trading Platform","authors":"Su-keun Kwak, Joohyung Lee","doi":"10.1109/ICOIN50884.2021.9333876","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9333876","url":null,"abstract":"As the development of smart cities, energy management systems have been changing from centralized management systems to distributed energy management systems for better energy efficiency. In the distributed energy management systems, while producing the energy from distributed users, there can be two types of users such that 1) users who have surplus energy generations and 2) users who lack energy generations compared to their demands. In this paper, to alleviate such imbalance of energy generation between distributed users, a peer to peer (P2P) based energy trading platform is proposed. Specifically, blockchain is one of emerging solutions in which transactions can be made reliably to achieve P2P transactions without any centralized broker intervention. Correspondingly, we implement the P2P energy trading platform under Ethereum’s smart contract for reliable trading. The energy generated from distributed users at the proposed platform can be traded by utilizing the characteristics of Decentralize Application. Specifically, we provide the details of implementations of the proposed platform, which includes both hardware platform and software platform. Further, we establish a web page and an mobile application for monitoring the transaction information such as transaction details and energy prices, which can enhance users’ accessibility. Finally, the demonstration of process of energy trading via web interface is represented.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"70 1","pages":"5-7"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83734944","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
Performance Evaluation of Consensus Protocols in Blockchain-based Audit Systems 基于区块链的审计系统共识协议的性能评估
Pub Date : 2021-01-13 DOI: 10.1109/ICOIN50884.2021.9333867
Ashar Ahmad, Muhammad Saad, Joongheon Kim, Daehun Nyang, David A. Mohaisen
Blockchain-based audit systems use “Practical Byzantine Fault Tolerance” (PBFT) consensus protocol which suffers from a high message complexity and low scalability. Alternatives to PBFT have not been tested in blockchain-based audit systems since no blockchain testbed supports the execution and benchmarking of different consensus protocols in a unified testing environment. In this paper, we address this gap by developing a blockchain testbed capable of executing and testing five consensus protocols in a blockchain network; namely PBFT, Proof-of-Work (PoW), Proof-of-Stake (PoS), Proof-of-Elapsed Time (PoET), and Clique. We carry out performance evaluation of those consensus algorithms using data from a real-world audit system. Our results show that the Clique protocol is best suited for blockchain-based audit systems, based on scalability features.
基于区块链的审计系统使用“实用拜占庭容错”(PBFT)共识协议,该协议具有高消息复杂性和低可扩展性。PBFT的替代方案尚未在基于区块链的审计系统中进行测试,因为没有区块链测试平台支持在统一测试环境中执行和对不同共识协议进行基准测试。在本文中,我们通过开发能够在区块链网络中执行和测试五种共识协议的区块链测试平台来解决这一差距;即PBFT、工作量证明(PoW)、权益证明(PoS)、运行时间证明(PoET)和Clique。我们使用来自真实世界审计系统的数据对这些共识算法进行性能评估。我们的研究结果表明,基于可扩展性特性,Clique协议最适合基于区块链的审计系统。
{"title":"Performance Evaluation of Consensus Protocols in Blockchain-based Audit Systems","authors":"Ashar Ahmad, Muhammad Saad, Joongheon Kim, Daehun Nyang, David A. Mohaisen","doi":"10.1109/ICOIN50884.2021.9333867","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9333867","url":null,"abstract":"Blockchain-based audit systems use “Practical Byzantine Fault Tolerance” (PBFT) consensus protocol which suffers from a high message complexity and low scalability. Alternatives to PBFT have not been tested in blockchain-based audit systems since no blockchain testbed supports the execution and benchmarking of different consensus protocols in a unified testing environment. In this paper, we address this gap by developing a blockchain testbed capable of executing and testing five consensus protocols in a blockchain network; namely PBFT, Proof-of-Work (PoW), Proof-of-Stake (PoS), Proof-of-Elapsed Time (PoET), and Clique. We carry out performance evaluation of those consensus algorithms using data from a real-world audit system. Our results show that the Clique protocol is best suited for blockchain-based audit systems, based on scalability features.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"49 1","pages":"654-656"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87612612","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}
引用次数: 13
A Secure Mobile Payment Protocol for Handling Accountability with Formal Verification 一种安全的移动支付协议,用于处理具有正式验证的责任
Pub Date : 2021-01-13 DOI: 10.1109/ICOIN50884.2021.9333957
Chalee Thammarat, Chian Techapanupreeda
Mobile payment protocols have attracted widespread attention over the past decade, due to advancements in digital technology. The use of these protocols in online industries can dramatically improve the quality of online services. However, the central issue of concern when utilizing these types of systems is their accountability, which ensures trust between the parties involved in payment transactions. It is, therefore, vital for researchers to investigate how to handle the accountability of mobile payment protocols. In this research, we introduce a secure mobile payment protocol to overcome this problem. Our payment protocol combines all the necessary security features, such as confidentiality, integrity, authentication, and authorization that are required to build trust among parties. In other words, is the properties of mutual authentication and non-repudiation are ensured, thus providing accountability. Our approach can resolve any conflicts that may arise in payment transactions between parties. To prove that the proposed protocol is correct and complete, we use the Scyther and AVISPA tools to verify our approach formally.
在过去的十年里,由于数字技术的进步,移动支付协议引起了广泛的关注。在在线行业中使用这些协议可以极大地提高在线服务的质量。然而,在使用这些类型的系统时,关注的核心问题是它们的问责制,这确保了参与支付交易的各方之间的信任。因此,研究人员研究如何处理移动支付协议的问责制是至关重要的。在本研究中,我们引入了一种安全的移动支付协议来克服这个问题。我们的支付协议结合了所有必要的安全功能,如机密性、完整性、身份验证和授权,这些都是在各方之间建立信任所必需的。换句话说,它保证了相互认证和不可否认的属性,从而提供了可问责性。我们的方法可以解决各方之间在支付交易中可能出现的任何冲突。为了证明所提出的协议是正确和完整的,我们使用Scyther和AVISPA工具来正式验证我们的方法。
{"title":"A Secure Mobile Payment Protocol for Handling Accountability with Formal Verification","authors":"Chalee Thammarat, Chian Techapanupreeda","doi":"10.1109/ICOIN50884.2021.9333957","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9333957","url":null,"abstract":"Mobile payment protocols have attracted widespread attention over the past decade, due to advancements in digital technology. The use of these protocols in online industries can dramatically improve the quality of online services. However, the central issue of concern when utilizing these types of systems is their accountability, which ensures trust between the parties involved in payment transactions. It is, therefore, vital for researchers to investigate how to handle the accountability of mobile payment protocols. In this research, we introduce a secure mobile payment protocol to overcome this problem. Our payment protocol combines all the necessary security features, such as confidentiality, integrity, authentication, and authorization that are required to build trust among parties. In other words, is the properties of mutual authentication and non-repudiation are ensured, thus providing accountability. Our approach can resolve any conflicts that may arise in payment transactions between parties. To prove that the proposed protocol is correct and complete, we use the Scyther and AVISPA tools to verify our approach formally.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"25 1","pages":"249-254"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80000002","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
ICOIN 2021 Front Matter ico2021前沿问题
Pub Date : 2021-01-13 DOI: 10.1109/icoin50884.2021.9333887
{"title":"ICOIN 2021 Front Matter","authors":"","doi":"10.1109/icoin50884.2021.9333887","DOIUrl":"https://doi.org/10.1109/icoin50884.2021.9333887","url":null,"abstract":"","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"108 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79399566","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
Infrastructure-Assisted Cooperative Multi-UAV Deep Reinforcement Energy Trading Learning for Big-Data Processing 面向大数据处理的基础设施协同多无人机深度强化能源交易学习
Pub Date : 2021-01-13 DOI: 10.1109/ICOIN50884.2021.9333895
Soyi Jung, Won Joon Yun, Joongheon Kim, Jae-Hyun Kim
This paper proposes a cooperative multi-agent deep reinforcement learning (MADRL) algorithm for energy trading among multiple unmanned aerial vehicles (UAVs) in order to perform big-data processing in a distributed manner. In order to realize UAV-based aerial surveillance or mobile cellular services, seamless and robust wireless charging mechanisms are required for delivering energy sources from charging infrastructure (i.e., charging towers) to UAVs for the consistent operations of the UAVs in the sky. For actively and intelligently managing the charging towers, MADRL-based energy management system (EMS) is proposed and designed for energy trading among the energy storage systems those are equipped with charging towers. If the required energy for charging UAVs is not enough, the purchasing energy from utility company is desired which takes high consts. The main purpose of MADRL-based EMS learning is for minimizing purchasing energy from outside utility company for minimizing operational costs. Our data-intensive performance evaluation verifies that our proposed framework achieves desired performance.
提出了一种多智能体深度强化学习(MADRL)算法,用于多无人机间的能源交易,以分布式方式进行大数据处理。为了实现基于无人机的空中监视或移动蜂窝服务,需要无缝和强大的无线充电机制,将充电基础设施(即充电塔)的能量传输给无人机,以保证无人机在空中的一致运行。为实现对充电塔的主动智能管理,提出并设计了基于madrl的储能系统能量管理系统(EMS),用于安装充电塔的储能系统之间的能量交易。如果无人机充电所需的能量不足,则需要从公用事业公司购买能量,这需要较高的成本。基于madrl的EMS学习的主要目的是最小化从外部公用事业公司购买能源,从而最小化运营成本。我们的数据密集型性能评估验证了我们提出的框架达到了期望的性能。
{"title":"Infrastructure-Assisted Cooperative Multi-UAV Deep Reinforcement Energy Trading Learning for Big-Data Processing","authors":"Soyi Jung, Won Joon Yun, Joongheon Kim, Jae-Hyun Kim","doi":"10.1109/ICOIN50884.2021.9333895","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9333895","url":null,"abstract":"This paper proposes a cooperative multi-agent deep reinforcement learning (MADRL) algorithm for energy trading among multiple unmanned aerial vehicles (UAVs) in order to perform big-data processing in a distributed manner. In order to realize UAV-based aerial surveillance or mobile cellular services, seamless and robust wireless charging mechanisms are required for delivering energy sources from charging infrastructure (i.e., charging towers) to UAVs for the consistent operations of the UAVs in the sky. For actively and intelligently managing the charging towers, MADRL-based energy management system (EMS) is proposed and designed for energy trading among the energy storage systems those are equipped with charging towers. If the required energy for charging UAVs is not enough, the purchasing energy from utility company is desired which takes high consts. The main purpose of MADRL-based EMS learning is for minimizing purchasing energy from outside utility company for minimizing operational costs. Our data-intensive performance evaluation verifies that our proposed framework achieves desired performance.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"99 1","pages":"159-162"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79486441","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}
引用次数: 8
Network Completion: Beyond Matrix Completion 网络完成:超越矩阵完成
Pub Date : 2021-01-13 DOI: 10.1109/ICOIN50884.2021.9334012
Cong Tran, Won-Yong Shin
Due to practical reasons such as limited resources and privacy settings specified by users on social media, most network data tend to be only partially observed with both missing nodes and missing edges. Thus, it is of paramount importance to infer the missing parts of the networks since incomplete network data may severely degrade the performance of downstream analyses. In this paper, we provide a comprehensive survey on network completion, which is a more challenging task than the well-studied low-rank matrix completion problem in the sense that a row and a column of an adjacency matrix shall be entirely unobservable when a node is completely missing from the given network. Specifically, we first define the problem of network completion. Then, we review two state-of-the-art algorithms for discovering the missing part of an underlying network, namely KronEM and DeepNC. We also show a performance comparison between the two algorithms via experimental evaluation. Finally, we discuss the potentials and limitations of the two algorithms.
由于资源有限、用户在社交媒体上的隐私设置等现实原因,大多数网络数据往往只被部分观察到,既有缺节点,也有缺边。因此,推断网络的缺失部分是至关重要的,因为不完整的网络数据可能严重降低下游分析的性能。在本文中,我们提供了对网络补全的全面调查,这是一个比研究得很好的低秩矩阵补全问题更具挑战性的任务,因为当给定网络中一个节点完全缺失时,邻接矩阵的一行和一列必须完全不可观察。具体来说,我们首先定义网络完备问题。然后,我们回顾了两种用于发现底层网络缺失部分的最先进算法,即KronEM和DeepNC。我们还通过实验评估了两种算法之间的性能比较。最后,讨论了这两种算法的潜力和局限性。
{"title":"Network Completion: Beyond Matrix Completion","authors":"Cong Tran, Won-Yong Shin","doi":"10.1109/ICOIN50884.2021.9334012","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9334012","url":null,"abstract":"Due to practical reasons such as limited resources and privacy settings specified by users on social media, most network data tend to be only partially observed with both missing nodes and missing edges. Thus, it is of paramount importance to infer the missing parts of the networks since incomplete network data may severely degrade the performance of downstream analyses. In this paper, we provide a comprehensive survey on network completion, which is a more challenging task than the well-studied low-rank matrix completion problem in the sense that a row and a column of an adjacency matrix shall be entirely unobservable when a node is completely missing from the given network. Specifically, we first define the problem of network completion. Then, we review two state-of-the-art algorithms for discovering the missing part of an underlying network, namely KronEM and DeepNC. We also show a performance comparison between the two algorithms via experimental evaluation. Finally, we discuss the potentials and limitations of the two algorithms.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"136 1","pages":"667-670"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75778800","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
Quantum Convolutional Neural Network for Resource-Efficient Image Classification: A Quantum Random Access Memory (QRAM) Approach 面向资源高效图像分类的量子卷积神经网络:量子随机存取存储器(QRAM)方法
Pub Date : 2021-01-13 DOI: 10.1109/ICOIN50884.2021.9333906
Seunghyeok Oh, Jaeho Choi, Jong-Kook Kim, Joongheon Kim
Convolutional Neural Network (CNN) is a breakthrough learning model that shows outstanding performance in computer vision and deep learning applications. However, it is a relatively burdened model in terms of learning speed and resource usage compared to other learning models when the learning scale becomes large. Quantum Convolutional Neural Network (QCNN) is a novel model as a potential solution using quantum computers to handle this problem. Quantum computers with a limited number of usable qubits needs a resource-efficient method to process large-scale data at once. In addition, Quantum Random Access Memory (QRAM) can store the large data to qubits logarithmically using superposition and entanglement. The QRAM algorithm can design a new QCNN model that can efficiently process in massive data. This paper proposes a more resource and depth efficient model for larger-sized input data and the number of output channels using the QRAM algorithm and efficiently extracting features.
卷积神经网络(CNN)是一种突破性的学习模型,在计算机视觉和深度学习应用中表现出色。但是,当学习规模变大时,与其他学习模型相比,它在学习速度和资源使用方面是一个相对负担较大的模型。量子卷积神经网络(QCNN)是利用量子计算机解决这一问题的一种新模型。可用量子比特数量有限的量子计算机需要一种资源高效的方法来一次处理大规模数据。此外,量子随机存取存储器(QRAM)可以利用叠加和纠缠将大数据以对数方式存储到量子位。QRAM算法可以设计一种新的QCNN模型,可以有效地处理海量数据。本文利用QRAM算法和高效的特征提取方法,针对输入数据量大、输出通道数多的情况,提出了一种资源效率更高、深度效率更高的模型。
{"title":"Quantum Convolutional Neural Network for Resource-Efficient Image Classification: A Quantum Random Access Memory (QRAM) Approach","authors":"Seunghyeok Oh, Jaeho Choi, Jong-Kook Kim, Joongheon Kim","doi":"10.1109/ICOIN50884.2021.9333906","DOIUrl":"https://doi.org/10.1109/ICOIN50884.2021.9333906","url":null,"abstract":"Convolutional Neural Network (CNN) is a breakthrough learning model that shows outstanding performance in computer vision and deep learning applications. However, it is a relatively burdened model in terms of learning speed and resource usage compared to other learning models when the learning scale becomes large. Quantum Convolutional Neural Network (QCNN) is a novel model as a potential solution using quantum computers to handle this problem. Quantum computers with a limited number of usable qubits needs a resource-efficient method to process large-scale data at once. In addition, Quantum Random Access Memory (QRAM) can store the large data to qubits logarithmically using superposition and entanglement. The QRAM algorithm can design a new QCNN model that can efficiently process in massive data. This paper proposes a more resource and depth efficient model for larger-sized input data and the number of output channels using the QRAM algorithm and efficiently extracting features.","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"147 1","pages":"50-52"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91448407","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}
引用次数: 13
ICOIN 2021 Organizing Committee Memberse ICOIN 2021组委会成员
Pub Date : 2021-01-13 DOI: 10.1109/icoin50884.2021.9334031
{"title":"ICOIN 2021 Organizing Committee Memberse","authors":"","doi":"10.1109/icoin50884.2021.9334031","DOIUrl":"https://doi.org/10.1109/icoin50884.2021.9334031","url":null,"abstract":"","PeriodicalId":6741,"journal":{"name":"2021 International Conference on Information Networking (ICOIN)","volume":"38 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73456287","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
期刊
2021 International Conference on Information Networking (ICOIN)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1