检索结果-内蒙古大学图书馆

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Weiqi Dai Wenhao Zhao Xia Xie Song Wu Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Computer Science and Technology Hainan University Haikou China

The phenomenon of unbalanced regional medical resources has led to large differences in the implementation experience of clinical pathways in hospitals with different medical levels. However, due to the fear of privacy leakage and the lack of sharing motivation, there is a lack of effective collaborative communication channels for clinical pathways among medical institutions. In response to these problems, we propose a blockchain-based sharing incentive scheme for clinical pathway experience, which uses the clinical pathway implementation effect evaluation system to evaluate the quality of clinical pathway experience data. Specifically, we designe a two-phase cross-domain shared transaction model for the transaction of clinical pathway experience data. Moreover, we introduce the shared transaction alliance committee to verify and review the transaction, and solve the problems in the transaction in the arbitration phase. Finally, the functional test results show that the system meets the experience sharing incentive requirements, and the performance test results show that the TPS of sharing clinical pathway experience read and writed can reach around 600 and 1000, and the transaction latency of each phase is within 3 s.

关键词： Privacy Hospitals Collaboration Communication channels Data models Security Incentive schemes

来源：评论

学校读者我要写书评

暂无评论

MVC-VPR: Mutual Learning of Viewpoint Classification and Visual Place Recognition

arXiv

引用

arXiv 2024年

作者： Gu, Qiwen Wang, Xufei Zhang, Fenglin Zhao, Junqiao Tao, Siyue Ye, Chen Feng, Tiantian Jiang, Changjun Department of Computer Science and Technology School of Electronics and Information Engineering Tongji University Shanghai China The Shanghai Research Institute for Intelligent Autonomous System Tongji University Shanghai China The MOE Key Lab of Embedded System and Service Computing Tongji University Shanghai China School of Surveying and Geo-Informatics Tongji University Shanghai China

Visual Place Recognition (VPR) aims to robustly identify locations by leveraging image retrieval based on descriptors encoded from environmental images. However, drastic appearance changes of images captured from different viewpoints at the same location pose incoherent supervision signals for descriptor learning, which severely hinder the performance of VPR. Previous work proposes classifying images based on manually defined rules or ground truth labels for viewpoints, followed by descriptor training based on the classification results. However, not all datasets have ground truth labels of viewpoints and manually defined rules may be suboptimal, leading to degraded descriptor performance. To address these challenges, we introduce the mutual learning of viewpoint self-classification and VPR. Starting from coarse classification based on geographical coordinates, we progress to finer classification of viewpoints using simple clustering techniques. The dataset is partitioned in an unsupervised manner while simultaneously training a descriptor extractor for place recognition. Experimental results show that this approach almost perfectly partitions the dataset based on viewpoints, thus achieving mutually reinforcing effects. Our method even excels state-of-the-art (SOTA) methods that partition datasets using ground truth labels. Copyright © 2024, The Authors. All rights reserved.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Secure Relay Selection for UAV-empowered Two Way Untrusted Relaying Networks

Secure Relay Selection for UAV-empowered Two Way Untrusted R...

引用

Mobile Internet, Cloud Computing and Information Security (MICCIS), International Conference on

作者： Kan Yu Zhiyong Feng Lin Yang Dianxia Chen Dong Li Xiaoshan Ma The School of Computer Science and Engineering Macau University of Science and Technology Taipa P. R. China The Key Laboratory of Universal Wireless Communications Ministry of Education Beijing University of Posts and Telecommunications Beijing P.R. China School of Computer Science and Engineering Macau University of Science and Technolog China The National Key Laboratory of Science and Technology on Information System Security Systems Engineering Institute AMS PLA Beijing P.R. China The Education Tianjin Ren’ai College Tianjin P.R. China The School of Computer Science and Engineering Macau University of Science and Technology P. R. China The Academy of Military Sciences of PLA Beijing P.R. China

ISBN: (数字)9798350389906

ISBN: (纸本)9798350389913

In this paper, we examine the security aspects of two-way untrusted relaying networks (TWURNs) through the lens of physical layer security (PLS). These networks involve the exchange of confidential information between two multiple-antenna base stations (BSs) with the aid of unmanned aerial vehicle (UAV)-enabled untrusted relays equipped with a single antenna. Given the shortcomings observed in existing single untrusted relay selection methods, we introduce an enhanced approach grounded in the min-min criterion (MMC) based on received signal strength. Additionally, we present a novel closed-form expression for the secrecy outage probability (SOP), a fundamental metric within the domain of PLS, derived from the cumulative distribution function (CDF) and probability density function (PDF) of received signal strengths. Through simulations, we substantiate the validity of our analytical findings, demonstrating the superior efficacy of the proposed MMC compared to prevailing schemes.

关键词： Measurement Probability density function Probability Physical layer security Minimax techniques Power system reliability Relays

来源：评论

学校读者我要写书评

暂无评论

Dynamic Random Route Mutation Mechanism for Moving Target Defense in SDN 6

Dynamic Random Route Mutation Mechanism for Moving Target De...

引用

6th International Symposium on computer and Information Processing Technology, ISCIPT 2021

作者： Zhang, Bofeng Han, Li Sun, Shimin Tianjin University of Technology School of Computer Science and Engineering Tianjin China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology National Engineering Laboratory for Computer Virus Prevention and Control Technology Tianjin China Tiangong University Tianjin Key Laboratory of Autonomous Intelligent Technology and System School of Computer Science and Technology Tianjin China

ISBN: (纸本)9781665441377

Moving Target Defense (MTD) is commonly used in changing the asymmetric situation between attack and defense in cyberspace. Route mutation is a vital branch of MTD. Current route mutation methods still have some limitations on unpredictability of mutating routing paths and time overhead. In this paper, we propose a Dynamic Random Route Mutation (DRRM) mechanism in order to maximize the unpredictability of mutation and reduce the time overhead. First, we adopt Jaccard distance matrix and temporal constraint to improve mutation space. Mutation space can be dynamically shifted to enhance the unpredictability. Then, we weaken attackers' capabilities of launching effective eavesdropping at a certain node by using route weight. Finally, we construct a pre-distribution strategy to reduce the transmission latency caused by route mutation. Simulation results show that DRRM not only raises the difficulty of network eavesdropping, but also ensures low mutation time overhead. © 2021 IEEE.

关键词： Dynamics

来源：评论

学校读者我要写书评

暂无评论

AOCC-FL: Federated Learning with Aligned Overlapping via Calibrated Compensation

AOCC-FL: Federated Learning with Aligned Overlapping via Cal...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Haozhao Wang Wenchao Xu Yunfeng Fan Ruixuan Li Pan Zhou School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Department of Computing The Hong Kong Polytechnic University Hong Kong Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China

Federated Learning enables collaboratively model training among a number of distributed devices with the coordination of a centralized server, where each device alternatively performs local gradient computation and communication to the server. FL suffers from significant performance degradation due to the excessive communication delay between the server and devices, especially when the network bandwidth of these devices is limited, which is common in edge environments. Existing methods overlap the gradient computation and communication to hide the communication latency to accelerate the FL training. However, the overlapping can also lead to an inevitable gap between the local model in each device and the global model in the server that seriously restricts the convergence rate of learning process. To address this problem, we propose a new overlapping method for FL, AOCC-FL, which aligns the local model with the global model via calibrated compensation such that the communication delay can be hidden without deteriorating the convergence performance. Theoretically, we prove that AOCC-FL admits the same convergence rate as the non-overlapping method. On both simulated and testbed experiments, we show that AOCC-FL achieves a comparable convergence rate relative to the non-overlapping method while outperforming the state-of-the-art overlapping methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient Module-Lattice-based Certificateless Online/Offline Signcryption Scheme for Internet of Medical Things

引用

IEEE Internet of Things Journal 2025年

作者： Bai, Ye He, Debiao Yang, Zhichao Luo, Min Peng, Cong Wuhan University Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan430072 China Wuhan University School of Cyber Science and Engineering Wuhan430072 China Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250014 China Naval University of Engineering Department of Information Security Wuhan430000 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan250014 China

The Internet of Medical Things (IoMT) has achieved remote diagnosis and real-time health monitoring through intelligent sensor devices and Internet of Things (IoT) technology, providing great convenience for analyzing medical conditions between doctors and patients. However, sensitive information such as patient medical data may face security challenges such as data leakage and abuse during transmission in the IoMT. To ensure the confidentiality and unforgeability of medical data transmission, scholars have proposed many cryptographic schemes. With the development of quantum computers, schemes based on traditional cryptographic primitives have become insecure. Existing cryptographic schemes for IoMT cannot simultaneously meet the security requirements of high communication performance, low computational overhead, and resistance to quantum attacks. Therefore, we propose an efficient module-lattice-based certificateless online/offline signcryption (MLCLOOSC) scheme resistant to quantum attacks while meeting the confidentiality and unforgeability requirements under Type I and Type II attacks. Compared with five recent CLOOSC schemes, theoretical analysis, and experimental test results show that the proposed scheme outperforms the other five schemes regarding computational and communication costs and security. Therefore, our scheme is more suitable for application in IoMT scenarios. © 2014 IEEE.

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

Automated Data Visualization from Natural Language via Large Language Models: An Exploratory Study

arXiv

引用

arXiv 2024年

作者： Wu, Yang Wan, Yao Zhang, Hongyu Sui, Yulei Wei, Wucai Zhao, Wei Xu, Guandong Jin, Hai Huazhong University of Science and Technology China Chongqing University China University of New South Wales Australia University of Technology Sydney Australia National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

The Natural Language to Visualization (NL2Vis) task aims to transform natural-language descriptions into visual representations for a grounded table, enabling users to gain insights from vast amounts of data. Recently, many deep learning-based approaches have been developed for NL2Vis. Despite the considerable efforts made by these approaches, challenges persist in visualizing data sourced from unseen databases or spanning multiple tables. Taking inspiration from the remarkable generation capabilities of Large Language Models (LLMs), this paper conducts an empirical study to evaluate their potential in generating visualizations, and explore the effectiveness of in-context learning prompts for enhancing this task. In particular, we first explore the ways of transforming structured tabular data into sequential text prompts, as to feed them into LLMs and analyze which table content contributes most to the NL2Vis. Our findings suggest that transforming structured tabular data into programs is effective, and it is essential to consider the table schema when formulating prompts. Furthermore, we evaluate two types of LLMs: finetuned models (e.g., T5-Small) and inference-only models (e.g., GPT-3.5), against state-of-the-art methods, using the NL2Vis benchmarks (i.e., nvBench). The experimental results reveal that LLMs outperform baselines, with inference-only models consistently exhibiting performance improvements, at times even surpassing fine-tuned models when provided with certain few-shot demonstrations through in-context learning. Finally, we analyze when the LLMs fail in NL2Vis, and propose to iteratively update the results using strategies such as chain-of-thought, role-playing, and code-interpreter. The experimental results confirm the efficacy of iterative updates and hold great potential for future study. © 2024, CC BY.

关键词： Data visualization

来源：评论

学校读者我要写书评

暂无评论

A Dual-Path Framework with Frequency-and-Time Excited Network for Anomalous Sound Detection

A Dual-Path Framework with Frequency-and-Time Excited Networ...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Yucong Zhang Juan Liu Yao Tian Haifeng Liu Ming Li School of Computer Science Wuhan University Wuhan China Suzhou Municipal Key Laboratory of Multimodal Intelligent Systems Duke Kunshan University Kunshan China Oppo Data & AI Engineering System Beijing China University of Science and Technology of China Hefei China

In contrast to human speech, machine-generated sounds of the same type often exhibit consistent frequency characteristics and discernible temporal periodicity. However, leveraging these dual attributes in anomaly detection remains relatively under-explored. In this paper, we propose an automated dual-path framework that learns prominent frequency and temporal patterns for diverse machine types. One pathway uses a novel Frequency-and-Time Excited Network (FTE-Net) to learn the salient features across frequency and time axes of the spectrogram. It incorporates a Frequency-and-Time Chunkwise Encoder (FTC-Encoder) and an excitation network. The other pathway uses a 1D convolutional network for utterance-level spectrum. Experimental results on the DCASE 2023 task 2 dataset show the state-of-the-art performance of our proposed method. Moreover, visualizations of the intermediate feature maps in the excitation network are provided to illustrate the effectiveness of our method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Advanced Data Segmentation and Encryption Approach using Fog Computing

Advanced Data Segmentation and Encryption Approach using Fog...

引用

Automation and Computation (AUTOCOM), International Conference on

作者： Kamred Udham Singh Neeraj Varshney Pushpendra Kumar Pradeep Kumar Sharma Umang Deep Mishra Teekam Singh School of Computing Graphic Era Hill University Dehradun India Department of Computer Engineering & Applications GLA University Mathura UP India Scanno System Greater Noida HCL Technology UP Unique Institute of Management & Technology Muradnagar Department of Computer Science and Engineering Graphic Era Deemed to be University Dehradun

Data security in conventional applications was only available at the application layer. Within the scope of the intended research, the safety of the merchandise is ensured. The deficiencies that are present in the security systems that are already in place have led to the realisation that a new security system is required. Considering that authentication is not present, the likelihood of decryption should be reduced. Establishing a decentralised security system is essential in order to protect against threats coming from a variety of digital networks. The new encryption standard is said to improve multilayer security, according to the claims. The material is split into two halves using this method, which also provides a reliable transmission mechanism. Because of the technology, hackers are unable to create vulnerabilities in the security system. There was a need for security in both the cloud and the edge environment in order to prevent intruders. Increasing the reliability and security of data transmission over a variety of networks was the motivation for the development of the two fish approach. Because of its security mechanism, it has been able to survive assaults from crackers and hackers. The paper that is being presented advises doing research on the safety of edge transmissions that are based on slicing. In order to prevent attackers from launching attacks from several networks, it is necessary to establish decentralised security. Layered security will help increase encryption standards, which is a significant benefit. Over the course of various investigations, computer security edge generators have been the focus of attention. Quite a few of them have already been extensively discussed. For the purpose of developing a reliable method of transmission, the proposed research splits the data into two parts, each of which is further encrypted at a different level. As a result of the development of multilayer encryption, the reliability and safety of data transm

关键词：

来源：评论

学校读者我要写书评

暂无评论

MAGIC: Detecting Advanced Persistent Threats via Masked Graph Representation Learning

arXiv

引用

arXiv 2023年

作者： Jia, Zian Xiong, Yun Nan, Yuhong Zhang, Yao Zhao, Jinjing Wen, Mi Shanghai Key Laboratory of Data Science School of Computer Science Fudan University China School of Software Engineering Sun Yat-sen University China National Key Laboratory of Science and Technology on Information System Security China Shanghai University of Electric Power China

Advance Persistent Threats (APTs), adopted by most delicate attackers, are becoming increasing common and pose great threat to various enterprises and institutions. Data provenance analysis on provenance graphs has emerged as a common approach in APT detection. However, previous works have exhibited several shortcomings: (1) requiring attack-containing data and a priori knowledge of APTs, (2) failing in extracting the rich contextual information buried within provenance graphs and (3) becoming impracticable due to their prohibitive computation overhead and memory consumption. In this paper, we introduce MAGIC, a novel and flexible self-supervised APT detection approach capable of performing multi-granularity detection under different level of supervision. MAGIC leverages masked graph representation learning to model benign system entities and behaviors, performing efficient deep feature extraction and structure abstraction on provenance graphs. By ferreting out anomalous system behaviors via outlier detection methods, MAGIC is able to perform both system entity level and batched log level APT detection. MAGIC is specially designed to handle concept drift with a model adaption mechanism and successfully applies to universal conditions and detection scenarios. We evaluate MAGIC on three widely-used datasets, including both real-world and simulated attacks. Evaluation results indicate that MAGIC achieves promising detection results in all scenarios and shows enormous advantage over state-of-the-art APT detection approaches in performance overhead. Copyright © 2023, The Authors. All rights reserved.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：