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

3rd International Conference on Electronic Information engineering, Big Data, and computer Technology, EIBDCT 2024

作者： Li, Weichen Pan, Weimin School of Computer Science National Pilot Software Engineering School Beijing University of Posts and Telecommunications Beijing China

ISBN: (纸本)9781510680449

In order to reduce the impact of public health emergencies on the normal life of residents, at the same time to prevent the secondary spread of diseases caused by improper methods in the management process. On the premise of reducing the overall operation cost as much as possible, based on the basic data such as the number of quarantinable population, the number of daily necessities distribution points, and transportation network of 9 administrative areas in Changchun during the epidemic isolation and prevention period in 2022, this paper uses the entropy weight method to score each community and set the number of delivery points, so as to judge whether the actual plan is reasonable. In order to further optimize, with the minimum service cost of all the selected delivery points and the premise of meeting the distribution demand, save as much as possible, reduce the number of sites, and minimize the site radius of each sorting point as the goal, the total number of selected delivery points should not exceed the set total. A multi-objective site selection planning model was established for constraints. Sensitivity analysis was performed on the number of sites to determine the optimal number of sites, and cluster analysis was used to obtain the optimal site selection coordinates and cell numbers corresponding to the drop points. As a result, the number of sites was greatly reduced and the efficiency of material distribution was improved. Considering that the less people flow in the context of the epidemic, the better, this paper also uses the improved k-means algorithm for the actual plan, and finally gets the following number of delivery points in each district: 168 in Erdao District, 53 in Jingyue District, 239 in Nanguan District, 292 in Kuancheng District, 303 in Chaoyang District, 25 in steam open district, 69 in economic open District, and 222 in Green Park. © COPYRIGHT SPIE. Downloading of the abstract is permitted for personal use only.

关键词： Sensitivity analysis

来源：评论

学校读者我要写书评

暂无评论

PKEST: Public-Key Encryption With Similarity Test for Medical Consortia Cloud Computing

引用

IEEE Transactions on Cloud Computing 2025年第2期13卷 680-693页

作者： Chen, Junsong Zeng, Shengke Han, Song Yin, Jin Chen, Peng Xihua University School of Computer and Software Engineering Chengdu610039 China Hangzhou City University School of Computer and Computing Science Hangzhou310015 China Sichuan University West China Biomedical Big Data Center West China Hospital Chengdu610041 China

Cloud computing eliminates the limitations of local hardware architecture while also enabling rapid data sharing between healthcare institutions. Encryption of electronic medical records (EMRs) before uploading to cloud servers is necessary for privacy. However, encryption brings challenges for computation. Public Key Encryption with Equality Test (PKEET) allows cloud servers to test the underlying message equality without decryption. Therefore, it can be used to classify the encrypted EMRs corresponding to different medical symptoms. However, traditional PKEETs have limitations in testing the similarity between the ciphertexts. Undoubtedly, it can not handle EMR classification with similar medical symptoms efficiently. In this work, we propose a lightweight public key encryption with similarity test (PKEST) for the EMR classification shared in medical consortia. Our scheme can resist offline message recovery attacks, which may be launched by the insider manager, and the traditional paring computation is not necessary. Our experiment simulation shows that the similarity error between ciphertext and plaintext is tiny when the parameters are set properly. Compared to previous works, our scheme not only achieves the classification of similar encrypted EMRs but is also more efficient than traditional PKEETs since our construction does not need paring computation anymore. © 2013 IEEE.

关键词： Ciphertext

来源：评论

学校读者我要写书评

暂无评论

Container-Aware Service Function Chains Placement and Optimization in Vehicular Edge Computing 22

Container-Aware Service Function Chains Placement and Optimi...

引用

22nd IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2024

作者： Zhang, Kaixin Hu, Shihong Qu, Zhihao Ye, Baoliu Hohai University School of Computer Science and Software Engineering China Nanjing University National Key Laboratory for Novel Software Technology China

ISBN: (纸本)9798331509712

In the domain of Vehicular Edge Computing (VEC), this paper addresses the complex problem of Service Function Chain (SFC) placement, which is crucial for the efficient deployment of cloud applications in vehicular environments. Our approach leverages Virtual Network Function (VNF) technology, transitioning network services from traditional hardware to more flexible, container-based edge computing frameworks. The primary objective is to organize these VNFs into functional SFCs, thereby minimizing service delays in VEC systems. SFC placement faces two significant challenges. The first is the sequential dependency among VNFs within an SFC, which adds substantial complexity to container deployment. The second challenge is the cold start delay of VNF containers, a critical issue in scenarios requiring swift response times, which negatively impacts service quality in VEC applications. To address these challenges, we propose a comprehensive model for SFC placement that considers the deployment status of VNF containers, acknowledging the complexity of this NP-hard problem. The core of our contribution is the development of the Single SFC Placement Algorithm (SSPA), a sophisticated, greedy-based approach designed for the effective placement of individual SFCs. We enhance this algorithm by incorporating a Particle Swarm Optimization (PSO) technique, making it capable of efficiently handling the placement of multiple SFCs. Our solution aims to improve edge resource utilization and mitigate startup delays associated with the initial activation of containers, thereby reducing service delays. Extensive experimental evaluations demonstrate that our algorithm achieves a 34.3% average reduction in service delay compared to four baselines and a 5.8% average reduction compared to other container-aware algorithms. © 2024 IEEE.

关键词： service function chain SFC placement vehicle edge computing virtual network function

来源：评论

学校读者我要写书评

暂无评论

3DSN-Net: A 3-D Scale-Aware convNet With Nonlocal Context Guidance for Kidney and Tumor Segmentation From CT Volumes

引用

IEEE Transactions on Cybernetics 2024年第5期54卷 3299-3312页

作者： Wu, Huisi Zhang, Baiming Li, Zhuoying Qin, Jing Lee, Tong-Yee Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China The Hong Kong Polytechnic University Centre for Smart Health School of Nursing Hong Kong Hong Kong National Cheng-Kung University Department of Computer Science and Information Engineering Tainan70101 Taiwan

Automatic kidney and tumor segmentation from CT volumes is a critical prerequisite/tool for diagnosis and surgical treatment (such as partial nephrectomy). However, it remains a particularly challenging issue as kidneys and tumors often exhibit large-scale variations, irregular shapes, and blurring boundaries. We propose a novel 3-D network to comprehensively tackle these problems;we call it 3DSN-Net. Compared with existing solutions, it has two compelling characteristics. First, with a new scale-aware feature extraction (SAFE) module, the proposed 3DSN-Net is capable of adaptively selecting appropriate receptive fields according to the sizes of targets instead of indiscriminately enlarging them, which is particularly essential for improving the segmentation accuracy of the tumor with large scale variation. Second, we propose a novel yet efficient nonlocal context guidance (NCG) mechanism to capture global dependencies to tackle irregular shapes and blurring boundaries of kidneys and tumors. Instead of directly harnessing a 3-D NCG mechanism, which makes the number of parameters exponentially increase and hence the network difficult to be trained under limited training data, we develop a 2.5D NCG mechanism based on projections of feature cubes, which achieves a tradeoff between segmentation accuracy and network complexity. We extensively evaluate the proposed 3DSN-Net on the famous KiTS dataset with many challenging kidney and tumor cases. Experimental results demonstrate our solution consistently outperforms state-of-the-art 3-D networks after being equipped with scale aware and NCG mechanisms, particularly for tumor segmentation. © 2013 IEEE.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Efficient-Learning Grasping and Pushing in Dense Stacking via Mask Function and Pixel Overlap Rate 7

Efficient-Learning Grasping and Pushing in Dense Stacking vi...

引用

7th International Symposium on Autonomous Systems, ISAS 2024

作者： Lian, Jie Jiang, Juncheng Qiu, Chaochao Pan, Qinghui Dong, Yongxiang Wang, Zhao Wang, Dong Dalian University of Technology School of Control Science and Engineering Dalian China University of Science and Technology Liaoning Shool of Computer Science and Software Engineering China

ISBN: (纸本)9798350363173

In the field of robotic grasping, grasping tightly stacked objects is a formidable challenge. The presence of non-target objects significantly increases the risk of grasping failure. To solve this problem, the aim is to take action while grasping, reduce clutter, and effectively complete grasping tasks. Based on deep reinforcement learning, the Efficient Learning Grasping(ELG) framework is proposed that integrates pushing actions alongside grasping to efficiently pick up objects from cluttered environments with reduced training time. However, in the process of grasping, the agent is rewarded only when the grasp is successful, so the data collection is extremely inefficient and spends a lot of time on the training of grasping strategy. In our work, two strategies are proposed to improve the training efficiency. First, two mask functions are introduced as prior knowledge to enable the agent to focus on more meaningful regions while ignoring some unnecessary regions, aiming at effective learning. Second, The Pixel Overlap Rate (POR) is introduced to quantify the environment clutter level, and set a new push action reward function based on the POR. The implementation of the above ideas in a simulation environment and transferred the learned models to the real world and verified them in practice. Compared with existing method, our method improves the training efficiency of the initial algorithm while having a higher success rate of grasping. Detailed grasping video at https://***/CqtSvaVl60M. © 2024 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Multi-Keyword Fuzzy Adjacency Search Strategy for Encrypted Graph in Cloud Environment

引用

computers, Materials & Continua 2024年第3期78卷 3177-3194页

作者： Bin Wu Xianyi Chen Jinzhou Huang Caicai Zhang Jing Wang Jing Yu Zhiqiang Zhao Zhuolin Mei School of Computer and Big Data Science Jiujiang UniversityJiujiang332005China Jiujiang Key Laboratory of Network and Information Security Jiujiang332005China School of Computer and Software Nanjing University of Information Science&TechnologyNanjing210044China School of Computer Engineering Hubei University of Arts and ScienceXiangyang441053China School of Modern Information Technology Zhejiang Institute of Mechanical and Electrical EngineeringHangzhou310053China Information Center Jiangxi Changjiang Chemical Co.Ltd.Jiujiang332005China School of Mathematics and Computer Science Ningxia Normal UniversityGuyuan756099China

In a cloud environment,outsourced graph data is widely used in companies,enterprises,medical institutions,and so *** owners and users can save costs and improve efficiency by storing large amounts of graph data on cloud *** on cloud platforms usually have some subjective or objective attacks,which make the outsourced graph data in an insecure *** issue of privacy data protection has become an important obstacle to data sharing and *** to query outsourcing graph data safely and effectively has become the focus of *** query is a basic and frequently used operation in graph,and it will effectively promote the query range and query ability if multi-keyword fuzzy search can be supported at the same *** work proposes to protect the privacy information of outsourcing graph data by encryption,mainly studies the problem of multi-keyword fuzzy adjacency query,and puts forward a *** our scheme,we use the Bloom filter and encryption mechanism to build a secure index and query token,and adjacency queries are implemented through indexes and query tokens on the cloud *** proposed scheme is proved by formal analysis,and the performance and effectiveness of the scheme are illustrated by experimental *** research results of this work will provide solid theoretical and technical support for the further popularization and application of encrypted graph data processing technology.

关键词： Privacy-preserving adjacency query multi-keyword fuzzy search encrypted graph

来源：评论

学校读者我要写书评

暂无评论

Efficient Federated Learning Using Dynamic Update and Adaptive Pruning with Momentum on Shared Server Data

引用

ACM Transactions on Intelligent Systems and Technology 2024年第6期15卷 1-28页

作者： Liu, Ji Jia, Juncheng Zhang, Hong Yun, Yuhui Wang, Leye Zhou, Yang Dai, Huaiyu Dou, Dejing Hithink RoyalFlush Information Network Co. Ltd. Hangzhou China School of Computer Science and Technology Soochow University Suzhou China Collaborative Innovation Center of Novel Software Technology and Industrialization Nanjing China Baidu Research Beijing China Key Lab of High Confidence Software Technologies Ministry of Education and Software Institute Peking University Beijing China Department of Computer Science and Software Engineering Auburn University AuburnAL United States Department of Electrical and Computer Engineering North Carolina State University RaleighNC United States Bedi Cloud and School of Computer Science Fudan University Beijing China

Despite achieving remarkable performance, Federated Learning (FL) encounters two important problems, i.e., low training efficiency and limited computational resources. In this article, we propose a new FL framework, i.e., FedDUMAP, with three original contributions, to leverage the shared insensitive data on the server in addition to the distributed data in edge devices so as to efficiently train a global model. First, we propose a simple dynamic server update algorithm, which takes advantage of the shared insensitive data on the server while dynamically adjusting the update steps on the server in order to speed up the convergence and improve the accuracy. Second, we propose an adaptive optimization method with the dynamic server update algorithm to exploit the global momentum on the server and each local device for superior accuracy. Third, we develop a layer-adaptive model pruning method to carry out specific pruning operations, which is adapted to the diverse features of each layer so as to attain an excellent tradeoff between effectiveness and efficiency. Our proposed FL model, FedDUMAP, combines the three original techniques and has a significantly better performance compared with baseline approaches in terms of efficiency (up to 16.9 times faster), accuracy (up to 20.4% higher), and computational cost (up to 62.6% smaller). © 2024 Copyright held by the owner/author(s). Publication rights licensed to ACM.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

ICCG:low-cost and efficient consistency with adaptive synchronization for metadata replication

引用

Frontiers of computer science 2025年第1期19卷 53-70页

作者： Chenhao ZHANG Liang WANG Jing SHANG Zhiwen XIAO Limin XIAO Meng HAN Bing WEI Runnan SHEN Jinquan WANG State Key Laboratory of Software Development Environment Beihang UniversityBeijing 100191China School of Computer Science and Engineering Beihang UniversityBeijing 100191China School of Cyberspace Security Hainan UniversityHaikou 570228China China Mobile Information Technology Center Beijing 100033China

The rapid growth in the storage scale of wide-area distributed file systems (DFS) calls for fast and scalable metadata management. Metadata replication is the widely used technique for improving the performance and scalability of metadata management. Because of the POSIX requirement of file systems, many existing metadata management techniques utilize a costly design for the sake of metadata consistency, leading to unacceptable performance overhead. We propose a new metadata consistency maintenance method (ICCG), which includes an incremental consistency guaranteed directory tree synchronization (ICGDT) and a causal consistency guaranteed replica index synchronization (CCGRI), to ensure system performance without sacrificing metadata consistency. ICGDT uses a flexible consistency scheme based on the state of files and directories maintained through the conflict state tree to provide an incremental consistency for metadata, which satisfies both metadata consistency and performance requirements. CCGRI ensures low latency and consistent access to data by establishing a causal consistency for replica indexes through multi-version extent trees and logical time. Experimental results demonstrate the effectiveness of our methods. Compared with the strong consistency policies widely used in modern DFSes, our methods significantly improve the system performance. For example, in file creation, ICCG can improve the performance of directory tree operations by at least 36.4 times.

关键词： metadata management metadata replication consistency directory tree replica index

来源：评论

学校读者我要写书评

暂无评论

Multi-Objective Equilibrium Optimizer for Feature Selection in High-Dimensional English Speech Emotion Recognition

引用

computers, Materials & Continua 2024年第2期78卷 1957-1975页

作者： Liya Yue Pei Hu Shu-Chuan Chu Jeng-Shyang Pan Fanli Business School Nanyang Institute of TechnologyNanyang473004China School of Computer and Software Nanyang Institute of TechnologyNanyang473004China College of Computer Science and Engineering Shandong University of Science and TechnologyQingdao266590China Department of Information Management Chaoyang University of TechnologyTaichung413310Taiwan

Speech emotion recognition(SER)uses acoustic analysis to find features for emotion recognition and examines variations in voice that are caused by *** number of features acquired with acoustic analysis is extremely high,so we introduce a hybrid filter-wrapper feature selection algorithm based on an improved equilibrium optimizer for constructing an emotion recognition *** proposed algorithm implements multi-objective emotion recognition with the minimum number of selected features and maximum ***,we use the information gain and Fisher Score to sort the features extracted from ***,we employ a multi-objective ranking method to evaluate these features and assign different importance to *** with high rankings have a large probability of being ***,we propose a repair strategy to address the problem of duplicate solutions in multi-objective feature selection,which can improve the diversity of solutions and avoid falling into local *** random forest and K-nearest neighbor classifiers,four English speech emotion datasets are employed to test the proposed algorithm(MBEO)as well as other multi-objective emotion identification *** results illustrate that it performs well in inverted generational distance,hypervolume,Pareto solutions,and execution time,and MBEO is appropriate for high-dimensional English SER.

关键词： Speech emotion recognition filter-wrapper high-dimensional feature selection equilibrium optimizer multi-objective

来源：评论

学校读者我要写书评

暂无评论

LLMaaS: Serving Large-Language Models on Trusted Serverless Computing Platforms

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第2期6卷 405-415页

作者： Cai, Zinuo Ma, Rongbo Fu, Yicheng Zhang, Weishan Ma, Ruhui Guan, Haibing Shanghai Jiao Tong University School of Electronic Information and Electrical Engineering Shanghai200240 China Qingdao Institute of Software College of Computer Science and Technology Qingdao266555 China

In recent years, the emergence of large-language models (LLMs) has profoundly transformed our production and lifestyle. These models have shown tremendous potential in fields, such as natural language processing, speech recognition, and recommendation systems, and are increasingly playing crucial roles in applications such as human-computer interaction and intelligent customer service. Efficient inference solutions for LLMs in data centers have been extensively researched, with a focus on meeting users' quality of service requirements. In this article, we focus on two additional requirements that responsible LLM inference should meet under QoS conditions: security throughout the model execution process and low maintenance requirements for the inference system. Therefore, we propose LLMaaS, a trusted model inference platform based on a serverless computing platform aimed at providing inference as a service for LLMs. First, we design a trusted serverless computing platform based on software guard extension (SGX), which includes distributed identity verification and SGX device plugins to ensure the security and trustworthiness of the inference process. Additionally, to reduce the maintenance requirements of the system, we enhance the SGX-based deep learning computing framework, including replacing PyTorch and using a greedy algorithm for graph partitioning. We conduct tests on four typical large models, and the experimental results demonstrate that, with minimal overhead and user code modifications, we can ensure the security of model execution. © 2020 IEEE.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：