IEEE Open Journal of the Computer Society最新文献_第9页

Online Identification Method of Tea Diseases in Complex Natural Environments 复杂自然环境下茶叶病害的在线识别方法

IEEE Open Journal of the Computer Society Pub Date : 2023-02-22 DOI: 10.1109/OJCS.2023.3247505

Senlin Xie;Chunwu Wang;Chang Wang;Yifan Lin;Xiaoqing Dong

{"title":"Online Identification Method of Tea Diseases in Complex Natural Environments","authors":"Senlin Xie;Chunwu Wang;Chang Wang;Yifan Lin;Xiaoqing Dong","doi":"10.1109/OJCS.2023.3247505","DOIUrl":"https://doi.org/10.1109/OJCS.2023.3247505","url":null,"abstract":"An intelligent Internet-of-Things (IoT) hardware system in the field tea plantations was built, comprising collection of tea images by HD zoom cameras in a cluster structure and deployment of the detection model by cluster-head edge computing nodes. Data was sent to customer premise equipment through edge nodes and gateways and then to cloud platforms, which provided a hardware platform for identifying remote tea disease online. Field-placed cameras were used as the main acquisition means to study various diseases on Yashixiang, a typical variety of Chaozhou Dancong tea, in different seasons and weather conditions and shooting angles in a natural year period with complex backgrounds. In turn, we constructed a natural environment high-quality dataset covering major diseases e.g., tea anthracnose, tea leaf blight, tea grey blight, Pseudocercospora theae, etc. and explored the feasibility of deep learning algorithms for automatic identification of Chaozhou Dancong tea diseases. Results showed that the recognition rate of Swim Transformer reached 94% in complex natural environments. This paper demonstrated the effectiveness of the dataset and the feasibility of deep learning algorithms applied to the automatic identification of diseases of Chaozhou Dancong tea, laying a foundation for the practical application of the technology in complex natural environments.","PeriodicalId":13205,"journal":{"name":"IEEE Open Journal of the Computer Society","volume":"4 ","pages":"62-71"},"PeriodicalIF":0.0,"publicationDate":"2023-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/8782664/10016900/10049616.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67881007","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Financial Crimes in Web3-Empowered Metaverse: Taxonomy, Countermeasures, and Opportunities Web3赋能元宇宙中的金融犯罪：分类、对策和机遇

IEEE Open Journal of the Computer Society Pub Date : 2023-02-16 DOI: 10.1109/OJCS.2023.3245801

Jiajing Wu;Kaixin Lin;Dan Lin;Ziye Zheng;Huawei Huang;Zibin Zheng

{"title":"Financial Crimes in Web3-Empowered Metaverse: Taxonomy, Countermeasures, and Opportunities","authors":"Jiajing Wu;Kaixin Lin;Dan Lin;Ziye Zheng;Huawei Huang;Zibin Zheng","doi":"10.1109/OJCS.2023.3245801","DOIUrl":"https://doi.org/10.1109/OJCS.2023.3245801","url":null,"abstract":"At present, the concept of metaverse has sparked widespread attention from the public to major industries. With the rapid development of blockchain and Web3 technologies, the decentralized metaverse ecology has attracted a large influx of users and capital. Due to the lack of industry standards and regulatory rules, the Web3-empowered metaverse ecosystem has witnessed a variety of financial crimes, such as scams, code exploit, wash trading, money laundering, and illegal services and shops. To this end, it is especially urgent and critical to summarize and classify the financial security threats on the Web3-empowered metaverse in order to maintain the long-term healthy development of its ecology. In this paper, we first outline the background, foundation, and applications of the Web3 metaverse. Then, we provide a comprehensive overview and taxonomy of the security risks and financial crimes that have emerged since the development of the decentralized metaverse. For each financial crime, we focus on three issues: a) existing definitions, b) relevant cases and analysis, and c) existing academic research on this type of crime. Next, from the perspective of academic research and government policy, we summarize the current anti-crime measurements and technologies in the metaverse. Finally, we discuss the opportunities and challenges in behavioral mining and the potential regulation of financial activities in the metaverse. The overview of this paper is expected to help readers better understand the potential security threats in this emerging ecology, and to provide insights and references for financial crime fighting.","PeriodicalId":13205,"journal":{"name":"IEEE Open Journal of the Computer Society","volume":"4 ","pages":"37-49"},"PeriodicalIF":0.0,"publicationDate":"2023-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/8782664/10016900/10045768.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67881056","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 9

Multi-Robot Systems and Cooperative Object Transport: Communications, Platforms, and Challenges 多机器人系统与协同对象传输：通信、平台和挑战

IEEE Open Journal of the Computer Society Pub Date : 2023-01-20 DOI: 10.1109/OJCS.2023.3238324

Xing An;Celimuge Wu;Yangfei Lin;Min Lin;Tsutomu Yoshinaga;Yusheng Ji

{"title":"Multi-Robot Systems and Cooperative Object Transport: Communications, Platforms, and Challenges","authors":"Xing An;Celimuge Wu;Yangfei Lin;Min Lin;Tsutomu Yoshinaga;Yusheng Ji","doi":"10.1109/OJCS.2023.3238324","DOIUrl":"https://doi.org/10.1109/OJCS.2023.3238324","url":null,"abstract":"Multi-robot systems gain considerable attention due to lower cost, better robustness, and higher scalability as compared with single-robot systems. Cooperative object transport, as a well-known use case of multi-robot systems, shows great potential in real-world applications. The design and implementation of a multi-robot system involve many technologies, specifically, communication, coordination, task allocation methods, experimental platforms, and simulators. However, most of recent multi-robot system studies focus on coordination and task allocation problems, with little focus on communications among multiple robots. In this review, we focus on the communication, validation platform, and simulator of multi-robot systems, and discuss one of the important applications, cooperative object transport. First, we study the multi-robot system fundamentals and comprehensively review the multi-robot system communication technologies. Then, the multi-robot system validating platform, testbed, simulator, and middleware used in academia and industry are investigated. Finally, we discuss recent advances in cooperative object transport, and challenges and possible future research directions for multi-robot systems.","PeriodicalId":13205,"journal":{"name":"IEEE Open Journal of the Computer Society","volume":"4 ","pages":"23-36"},"PeriodicalIF":0.0,"publicationDate":"2023-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/8782664/10016900/10023955.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67881015","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 7

SC-FGCL: Self-Adaptive Cluster-Based Federal Graph Contrastive Learning SC-FGCL：基于自适应聚类的联邦图对比学习

IEEE Open Journal of the Computer Society Pub Date : 2023-01-11 DOI: 10.1109/OJCS.2023.3235593

Tingqi Wang;Xu Zheng;Lei Gao;Tianqi Wan;Ling Tian

{"title":"SC-FGCL: Self-Adaptive Cluster-Based Federal Graph Contrastive Learning","authors":"Tingqi Wang;Xu Zheng;Lei Gao;Tianqi Wan;Ling Tian","doi":"10.1109/OJCS.2023.3235593","DOIUrl":"https://doi.org/10.1109/OJCS.2023.3235593","url":null,"abstract":"As a self-supervised learning method, the graph contrastive learning achieve admirable performance in graph pre-training tasks, and can be fine-tuned for multiple downstream tasks such as protein structure prediction, social recommendation, \u0000<italic>etc.</i>\u0000 One prerequisite for graph contrastive learning is the support of huge graphs in the training procedure. However, the graph data nowadays are distributed in various devices and hold by different owners, like those smart devices in Internet of Things. Considering the non-negligible consumptions on computing, storage, communication, data privacy and other issues, these devices often prefer to keep data locally, which significantly reduces the graph contrastive learning performance. In this paper, we propose a novel federal graph contrastive learning framework. First, it is able to update node embeddings during training by means of a federation method, allowing the local GCL to acquire anchors with richer information. Second, we design a Self-adaptive Cluster-based server strategy to select the optimal embedding update scheme, which maximizes the richness of the embedding information while avoiding the interference of noise. Generally, our method can build anchors with richer information through a federated learning approach, thus alleviating the performance degradation of graph contrastive learning due to distributed storage. Extensive analysis and experimental results demonstrate the superiority of our framework.","PeriodicalId":13205,"journal":{"name":"IEEE Open Journal of the Computer Society","volume":"4 ","pages":"13-22"},"PeriodicalIF":0.0,"publicationDate":"2023-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/8782664/10016900/10015148.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67881016","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

An Efficient Connected-Component Labeling Algorithm for 3-D Binary Images 一种高效的三维二值图像连通分量标注算法

IEEE Open Journal of the Computer Society Pub Date : 2022-12-30 DOI: 10.1109/OJCS.2022.3233088

Xiao Zhao;Yuyan Chao;Hui Zhang;Bin Yao;Lifeng He

引用次数: 0

Optimized UAV Trajectory and Transceiver Design for Over-the-Air Computation Systems 用于空中计算系统的无人机轨迹优化和收发器设计

IEEE Open Journal of the Computer Society Pub Date : 2022-12-21 DOI: 10.1109/OJCS.2022.3230948

Xiang Zeng;Xiao Zhang;Feng Wang

{"title":"Optimized UAV Trajectory and Transceiver Design for Over-the-Air Computation Systems","authors":"Xiang Zeng;Xiao Zhang;Feng Wang","doi":"10.1109/OJCS.2022.3230948","DOIUrl":"https://doi.org/10.1109/OJCS.2022.3230948","url":null,"abstract":"This article investigates a multi-slot unmanned aerial vehicle (UAV) assisted over-the-air computation (AirComp) system, where the UAV is deployed as a flying base station to compute functional values of data distributed at multiple ground sensors via AirComp. Subject to the power constraints of the UAV and ground sensors, we minimize the computational mean-squared error (MSE) of AirComp, by optimizing UAV's trajectory, the ground sensors' transmit coefficients, and the de-noising factors within multiple slots. As a low-complexity design solution, we decompose the formulated non-convex multi-slot UAV-assisted AirComp design problem into two low-dimensional sub-problems, one for optimizing the sensor groups and the energy-minimal UAV trajectory design, and the other for jointly optimizing the ground sensors' transmit coefficients and the UAV's receive de-noising factors for AirComp. First, we use the K-means algorithm to cluster the ground sensors, and then optimize the energy-minimal UAV trajectory for visiting the sensor groups. Next, based on the Lagrange duality method, we obtain the optimal AirComp transceiver design solution in a closed form. Numerical results show that the proposed design solution achieves a significant computational MSE performance gain compared with the existing benchmark schemes.","PeriodicalId":13205,"journal":{"name":"IEEE Open Journal of the Computer Society","volume":"3 ","pages":"313-322"},"PeriodicalIF":0.0,"publicationDate":"2022-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/8782664/9682503/09996123.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67948298","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Local Differential Privacy for Person-to-Person Interactions 人与人交互的局部差异隐私

IEEE Open Journal of the Computer Society Pub Date : 2022-12-14 DOI: 10.1109/OJCS.2022.3228999

Yuichi Sei;Akihiko Ohsuga

{"title":"Local Differential Privacy for Person-to-Person Interactions","authors":"Yuichi Sei;Akihiko Ohsuga","doi":"10.1109/OJCS.2022.3228999","DOIUrl":"https://doi.org/10.1109/OJCS.2022.3228999","url":null,"abstract":"Currently, many global organizations collect personal data for marketing, recommendation system improvement, and other purposes. Some organizations collect personal data securely based on a technique known as \u0000<inline-formula><tex-math>$epsilon$</tex-math></inline-formula>\u0000-local differential privacy (LDP). Under LDP, a privacy budget is allocated to each user in advance. Each time the user's data are collected, the user's privacy budget is consumed, and their privacy is protected by ensuring that the remaining privacy budget is greater than or equal to zero. Existing research and organizations assume that each individual's data are completely unrelated to other individuals' data. However, this assumption does not hold in a situation where interaction data between users are collected from them. In this case, each user's privacy is not sufficiently protected because the privacy budget is actually overspent. In this study, the issue of local differential privacy for person-to-person interactions is clarified. We propose a mechanism that satisfies LDP in a person-to-person interaction scenario. Mathematical analysis and experimental results show that the proposed mechanism can maintain high data utility while ensuring LDP compared to existing methods.","PeriodicalId":13205,"journal":{"name":"IEEE Open Journal of the Computer Society","volume":"3 ","pages":"304-312"},"PeriodicalIF":0.0,"publicationDate":"2022-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/8782664/9682503/09984836.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67949500","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Towards Efficient and Privacy-Preserving Versatile Task Allocation for Internet of Vehicles 车联网中高效且隐私保护的多功能任务分配

IEEE Open Journal of the Computer Society Pub Date : 2022-11-29 DOI: 10.1109/OJCS.2022.3222363

Zihan Li;Mingyang Zhao;Guanyu Chen;Chuan Zhang;Tong Wu;Liehuang Zhu

{"title":"Towards Efficient and Privacy-Preserving Versatile Task Allocation for Internet of Vehicles","authors":"Zihan Li;Mingyang Zhao;Guanyu Chen;Chuan Zhang;Tong Wu;Liehuang Zhu","doi":"10.1109/OJCS.2022.3222363","DOIUrl":"https://doi.org/10.1109/OJCS.2022.3222363","url":null,"abstract":"Nowadays, task allocation has attracted increasing attention in the Internet of Vehicles. To efficiently allocate tasks to suitable workers, users usually need to publish their task interests to the service provider, which brings a serious threat to users' privacy. Existing task allocation schemes either cannot comprehensively preserve user privacy (i.e., requester privacy and worker privacy) or introduce tremendous resource overhead. In this paper, we propose an efficient and privacy-preserving versatile task allocation scheme (PPVTA) for the Internet of vehicles. Specifically, we utilize the randomizable matrix multiplication technique to preserve requester privacy and worker privacy. Then, the polynomial fitting technique is leveraged to enrich the randomizable matrix multiplication to support versatile task allocation functions, such as threshold-based task allocation (PPVTA-I), conjunctive task allocation (PPVTA-II), and task allocation with bilateral access control (PPVTA-III). We formally analyze the security of our constructions to prove the security under the chosen-plain attack. Based on a prototype, experimental results demonstrate that our constructions have acceptable efficiency in practice.","PeriodicalId":13205,"journal":{"name":"IEEE Open Journal of the Computer Society","volume":"3 ","pages":"295-303"},"PeriodicalIF":0.0,"publicationDate":"2022-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/8782664/9682503/09966517.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67949501","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Towards Efficient and Delay-Aware NFV-Enabled Unicasting With Adjustable Service Function Chains 具有可调服务功能链的高效和延迟感知NFV单播

IEEE Open Journal of the Computer Society Pub Date : 2022-11-10 DOI: 10.1109/OJCS.2022.3221213

Longqu Li;Pengxin Zheng;Quan Chen;Tao Wang;Feng Wang;Yongchao Tao;Jizhou Sun

{"title":"Towards Efficient and Delay-Aware NFV-Enabled Unicasting With Adjustable Service Function Chains","authors":"Longqu Li;Pengxin Zheng;Quan Chen;Tao Wang;Feng Wang;Yongchao Tao;Jizhou Sun","doi":"10.1109/OJCS.2022.3221213","DOIUrl":"https://doi.org/10.1109/OJCS.2022.3221213","url":null,"abstract":"Network Function Virtualization (NFV) has becoming an emerging technology for ensuring the reliability, security and scalability of data flows. The Virtual Network Function (VNF) embedding problem, which tries to minimize the embedding cost and link connection cost toward customers or maximize network throughput for a given set of NFV-enabled requests, has attracted extensive interests recently. However, the existing works always assume the fixed execution order of VNFs, which limits their application. Thus, we investigate the VNF embedding problem without such limitations in this paper. Firstly, we propose a general transformation framework for the NFV-enabled unicast routing problem with arbitrary order of service function chains, and an optimal algorithm is proposed for the unicast VNF embedding problem without delay constraint. Secondly, an efficient algorithm with theoretical guarantee is also proposed for such a problem with delay constraint. Thirdly, the throughput maximization problem where there exists a set of unicast requests with delay constraints is also investigated, and an efficient algorithm is also proposed to maximize the number of admitted requests while the total traffic delivery cost is minimized. Finally, we evaluate the proposed algorithms via extensive simulations, which demonstrates the high efficiency of the proposed algorithms.","PeriodicalId":13205,"journal":{"name":"IEEE Open Journal of the Computer Society","volume":"3 ","pages":"281-294"},"PeriodicalIF":0.0,"publicationDate":"2022-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/8782664/9682503/09945885.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68100596","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Towards Capacity-Adjustable and Scalable Quotient Filter Design for Packet Classification in Software-Defined Networks 面向容量可调和可扩展的软件定义网络分组分类商滤波器设计

IEEE Open Journal of the Computer Society Pub Date : 2022-11-04 DOI: 10.1109/OJCS.2022.3219631

Minghao Xie;Quan Chen;Tao Wang;Feng Wang;Yongchao Tao;Lianglun Cheng

{"title":"Towards Capacity-Adjustable and Scalable Quotient Filter Design for Packet Classification in Software-Defined Networks","authors":"Minghao Xie;Quan Chen;Tao Wang;Feng Wang;Yongchao Tao;Lianglun Cheng","doi":"10.1109/OJCS.2022.3219631","DOIUrl":"https://doi.org/10.1109/OJCS.2022.3219631","url":null,"abstract":"Software defined networking (SDN), which can provide a dynamic and configurable network architecture for resource allocation, have been widely employed for efficient massive data traffic management. To accelerate the packet classification process in SDN, the hash-based filters which can support fast approximate membership query have been widely employed. However, the existing Quotient Filters are limited to fixed size and the number of elements has to be provided in advance. Thus, in this paper, we investigate the first capacity adjustable and scalable quotient filter for dynamic packet classification in SDN. Firstly, a novel Index Independent Quotient Filter (IIQF) is designed, which can adjust its capacity in a more precise level to support dynamic set representation. The algorithms for the operations of insertion, querying, deletion and capacity adjustment of IIQF are also given. Secondly, on the basis of IIQF, a Scalable Index Independent Quotient Filter (SIIQF) is designed to ensure the consistency of the designed quotient filter when adjusting its size. The theoretical performance of the proposed SIIQF, including the error rate, probability of collisions, and the time and space complexity are all analyzed. An instance of employing SIIQF for packet classification with tuple space searching algorithm is also introduced. Finally, the extensive simulations demonstrate the performance gains achieved by the proposed SIIQF compared with the baseline methods.","PeriodicalId":13205,"journal":{"name":"IEEE Open Journal of the Computer Society","volume":"3 ","pages":"246-259"},"PeriodicalIF":0.0,"publicationDate":"2022-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/8782664/9682503/09939040.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67792126","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1