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

Power Optimization for Low Transmission Delay in software Defined Data Center Networks

IEEE Transactions on Mobile computing 2025年第7期24卷 5716-5730页

作者： Zhao, Yong Cao, Jiannong Wang, Xingwei Li, Fuliang He, Qiang Liu, Xiaojie University of Electronic Science and Technology of China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Laboratory of Intelligent Collaborative Computing Chengdu611731 China Hong Kong Polytechnic University Department of Computing Hung Hom Hong Kong Northeastern University College of Computer Science and Engineering Shenyang110819 China Northeastern University College of Medicine and Biological Information Engineering Shenyang110819 China Pengcheng Laboratory Shenzhen518066 China

software-Defined Data Center Networks (SDDCNs) utilizes software Defined Networking (SDN) as a network architecture to achieve highly flexible, programmable, and automated management of Data Center Networks (DCNs). The high energy consumption of DCNs remains a persistent and significant challenge. Thus, the energy saving is crucial and imperative for DCNs. Current energy-efficient solutions primarily rely on flow consolidation and dynamic device sleeping techniques to reduce energy consumption. However, these approaches often yield long Flow Completion Time (FCT), potentially resulting in violations of service-level agreements, particularly for delay-sensitive applications. In this paper, we formulate the problem of minimizing the power consumption in SDDCNs as key objective while ensuring timely FCT for delay-sensitive applications. To solve this problem, we first introduce the Active Network Generation (ANG) approach, which generates a minimal active subnet with the least number of active devices while meeting the current traffic demand. Subsequently, we propose two algorithms based on the type of applications: the Delay-Tolerant Flow Route (DTFR) algorithm for delay-tolerant applications and the Delay-Sensitive Flow Route (DSFR) algorithm for delay-sensitive applications. Simulation results demonstrate that our propose solution achieves an energy-saving rate of up to 67.77% and significantly reduces FCT compared to benchmark solutions. © 2002-2012 IEEE.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

A prompt-based approach to adversarial example generation and robustness enhancement

引用

Frontiers of computer science 2024年第4期18卷 85-96页

作者： Yuting YANG Pei HUANG Juan CAO Jintao LI Yun LIN Feifei MA Key Lab of Intelligent Information Processing of Chinese Academy of Sciences(CAS) Institute of Computing TechnologyCASBeijing 100190China School of Computer Science and Technology University of Chinese Academy of SciencesBeijing 100049China Department of Computer Science Stanford UniversityCA 94305USA School of Computing National University of SingaporeSingapore 119077Singapore Laboratory of Parallel Software and Computational Science Institute of SoftwareChinese Academy of SciencesBeijing 100190China

Recent years have seen the wide application of natural language processing(NLP)models in crucial areas such as finance,medical treatment,and news media,raising concerns about the model robustness and *** find that prompt paradigm can probe special robust defects of pre-trained language *** prompt texts are first constructed for inputs and a pre-trained language model can generate adversarial examples for victim models via *** results show that prompt paradigm can efficiently generate more diverse adversarial examples besides synonym ***,we propose a novel robust training approach based on prompt paradigm which incorporates prompt texts as the alternatives to adversarial examples and enhances robustness under a lightweight minimax-style optimization *** on three real-world tasks and two deep neural models show that our approach can significantly improve the robustness of models to resist adversarial attacks.

关键词： robustness adversarial example prompt learning pre-trained language model

来源：评论

学校读者我要写书评

暂无评论

A survey on graph neural network-based next POI recommendation for smart cities

引用

Journal of Reliable Intelligent Environments 2024年第3期10卷 299-318页

作者： Yu, Jian Guo, Lucas Zhang, Jiayu Wang, Guiling Department of Computer Science and Soft Engineering Auckland University of Technology Auckland New Zealand School of Information Science and Technology Beijing Key Laboratory on Integration and Analysis of Large-Scale Stream Data North China University of Technology Beijing China

Amid the rise of mobile technologies and Location-Based Social Networks (LBSNs), there’s an escalating demand for personalized Point-of-Interest (POI) recommendations. Especially pivotal in smart cities, these systems aim to enhance user experiences by offering location recommendations tailored to past check-ins and visited POIs. Distinguishing itself from traditional POI recommendations, the next POI approach emphasizes predicting the immediate subsequent location, factoring in both geographical attributes and temporal patterns. This approach, while promising, faces with challenges like capturing evolving user preferences and navigating data biases. The introduction of Graph Neural Networks (GNNs) brings forth a transformative solution, particularly in their ability to capture high-order dependencies between POIs, understanding deeper relationships and patterns beyond immediate connections. This survey presents a comprehensive exploration of GNN-based next POI recommendation approaches, delving into their unique characteristics, inherent challenges, and potential avenues for future research. © The Author(s) 2024.

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

Density estimation-based method to determine sample size for random sample partition of big data

引用

Frontiers of computer science 2024年第5期18卷 57-70页

作者： Yulin HE Jiaqi CHEN Jiaxing SHEN Philippe FOURNIER-VIGER Joshua Zhexue HUANG Guangdong Laboratory of Artificial Intelligence and Digital Economy(SZ) Shenzhen 518107China College of Computer Science and Software Engineering Shenzhen UniversityShenzhen 518060China Department of Computing and Decision Sciences Lingnan UniversityHong Kong 999077China

Random sample partition(RSP)is a newly developed big data representation and management model to deal with big data approximate computation *** research and practical applications have confirmed that RSP is an efficient solution for big data processing and ***,a challenge for implementing RSP is determining an appropriate sample size for RSP data *** a large sample size increases the burden of big data computation,a small size will lead to insufficient distribution information for RSP data *** address this problem,this paper presents a novel density estimation-based method(DEM)to determine the optimal sample size for RSP data ***,a theoretical sample size is calculated based on the multivariate Dvoretzky-Kiefer-Wolfowitz(DKW)inequality by using the fixed-point iteration(FPI)***,a practical sample size is determined by minimizing the validation error of a kernel density estimator(KDE)constructed on RSP data blocks for an increasing sample ***,a series of persuasive experiments are conducted to validate the feasibility,rationality,and effectiveness of *** results show that(1)the iteration function of the FPI method is convergent for calculating the theoretical sample size from the multivariate DKW inequality;(2)the KDE constructed on RSP data blocks with sample size determined by DEM can yield a good approximation of the probability density function(p.d.f);and(3)DEM provides more accurate sample sizes than the existing sample size determination methods from the perspective of *** demonstrates that DEM is a viable approach to deal with the sample size determination problem for big data RSP implementation.

关键词： random sample partition big data sample size Dvoretzky-Kiefer-Wolfowitz inequality kerneldensity estimator probability density function

来源：评论

学校读者我要写书评

暂无评论

Inductive Relation Prediction by Disentangled Subgraph Structure

引用

Tsinghua science and Technology 2024年第5期29卷 1566-1579页

作者： Guiduo Duan Rui Guo Wenlong Luo Guangchun Luo Tianxi Huang Laboratory of Intelligent Collaborative Computing University of Electronic Science and Technology of ChinaChengdu 611731Chinaand also with Trusted Cloud Computing and Big Data Key Laboratory of Sichuan ProvinceChengdu 611731China School of Computer Science and Engineering University of Electronic Science and Technology of ChinaChengdu 611731China Hangzhou NetEase Cloud Music Technology Co. Ltd.Hangzhou 310052China Department of Fundamental Courses Chengdu Textile CollegeChengdu 611700China

Currently,most existing inductive relation prediction approaches are based on subgraph structures,with subgraph features extracted using graph neural networks to predict ***,subgraphs may contain disconnected regions,which usually represent different semantic *** not all semantic information about the regions is helpful in relation prediction,we propose a relation prediction model based on a disentangled subgraph structure and implement a feature updating approach based on relevant semantic *** indirectly achieve the disentangled subgraph structure from a semantic perspective,the mapping of entity features into different semantic spaces and the aggregation of related semantics on each semantic space are *** disentangled model can focus on features having higher semantic relevance in the prediction,thus addressing a problem with existing approaches,which ignore the semantic differences in different subgraph ***,using a gated recurrent neural network,this model enhances the features of entities by sorting them by distance and extracting the path information in the ***,it is shown that when there are numerous disconnected regions in the subgraph,our model outperforms existing mainstream models in terms of both Area Under the Curve-Precision-Recall(AUC-PR)and Hits@*** prove that semantic differences in the knowledge graph can be effectively distinguished and verify the effectiveness of this method.

关键词： disentangled subgraph structure knowledge graph completion Gated Recurrent Unit(GRU) feature updating

来源：评论

学校读者我要写书评

暂无评论

FedTG: Text-guided Federated Domain Generalization

FedTG: Text-guided Federated Domain Generalization

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Chen, Yiming He, Nan Sun, Lifeng Department of Computer Science and Technology Tsinghua University China Key Laboratory of Pervasive Computing Ministry of Education China

ISBN: (纸本)9798350368741

Federated Domain Generalization is aimed at learning a global model that generalizes well to new clients with domain shift in a privacy-preserving manner. Inspired by the powerful generation capability of Large language models (LLMs), we propose a novel method for this problem, named Text-guided Federated Domain Generalization (FedTG), which utilizes text generated by LLMs to guide the training of visual models. In the client, we align the image embeddings to the text embeddings, which provides strong generalization knowledge. In the server, we generate abundant textual descriptions about different classes, subsequently converting them into embeddings for fine-tuning the global classifier, which helps the global classifier not overfit to a particular domain. Moreover, we utilize the powerful image generation capabilities of LLMs to generate a cross-domain validation dataset to help select the most generalized model. We conduct experiments on several datasets, and the results prove that FedTG outperforms relevant baselines. © 2025 IEEE.

关键词： Data Heterogeneity Domain Shift Federated Domain Generalization Federated Learning

来源：评论

学校读者我要写书评

暂无评论

SV-HaRF: a scene representation method for sparse image view synthesis

SV-HaRF: a scene representation method for sparse image view...

引用

2023 International Conference on computer Graphics, Artificial Intelligence, and Data Processing, ICCAID 2023

作者： Liu, Wei Zhang, Yu Zou, Xuechao Ma, Rui Tao, Pin Department of Computer Technology and Applications Qinghai University China Department of Computer Science and Technology Tsinghua University China Key Laboratory of Pervasive Computing Ministry of Education China

ISBN: (纸本)9781510677685

Existing view synthesis algorithms often require dozens or even hundreds of photographs taken from different angles to capture more intricate details in the resulting 3D model. While increasing the number of angles can yield better model parameters, it also significantly increases the training cost. Therefore, there is a need to reduce the quantity of input images with different angles while maintaining comparable results. In this paper, we propose SV-HaRF, which aims to reconstruct scenes by using a sparse set of angles (typically less than 100 but not less than 10) to ensure scene model integrity, as the original training sets often consist of over 100 angles. To address this issue, SV-HaRF employs hash encoding on the input sparse image resolutions to enhance the spatial constraint of these viewpoint positions during the scene reconstruction process, thereby improving the ability to restore scene information. SV-HaRF not only demonstrates outstanding performance in synthesizing sparse viewpoints for reducing model angles but also exhibits superior enhancement, compared to existing NeRF and its related variants, when the input image viewpoints remain unchanged. We conducted experiments on the NeRF Blender Synthetic dataset, showcasing significant improvements in scene synthesis achieved by SV-HaRF. © 2024 SPIE.

关键词： Image resolution

来源：评论

学校读者我要写书评

暂无评论

Exploring Multiscale Navigation of Homogeneous and Dense Objects with Progressive Refinement in Virtual Reality 32

Exploring Multiscale Navigation of Homogeneous and Dense Obj...

引用

32nd IEEE Conference on Virtual Reality and 3D User Interfaces, VR 2025

作者： Pavanatto, Leonardo Giovannelli, Alexander Giera, Brian Bremer, Timo Miao, Haichao Bowman, Doug A. Virginia Tech Center for Human-Computer Interaction Department of Computer Science United States Lawrence Livermore National Laboratory Center for Applied Scientific Computing United States

ISBN: (纸本)9798331536459

Locating small features in a large, dense object in virtual reality (VR) poses a significant interaction challenge. While existing multiscale techniques support transitions between various levels of scale, they are not focused on handling dense, homogeneous objects with hidden features. We propose a novel approach that applies the concept of progressive refinement to VR navigation, enabling focused inspections. We conducted a user study where we varied two independent variables in our design, navigation style (STRUCTURED vs. UNSTRUCTURED) and display mode (SELECTION vs. EVERYTHING), to better understand their effects on efficiency and awareness during multiscale navigation. Our results showed that unstructured navigation can be faster than structured and that displaying only the selection can be faster than displaying the entire object. However, using an everything display mode can support better location awareness and object understanding. © 2025 IEEE.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

Intelligent Solution System for Cloud Security Based on Equity Distribution:Model and Algorithms

引用

computers, Materials & Continua 2024年第1期78卷 1461-1479页

作者： Sarah Mustafa Eljack Mahdi Jemmali Mohsen Denden Mutasim Al Sadig Abdullah M.Algashami Sadok Turki Department of Computer Science and Information College of Science at ZulfiMajmaah UniversityAl-Majmaah11952Saudi Arabia Department of Computer Science College of Computing and InformaticsUniversity of SharjahSharjahUnited Arab Emirates Higher Institute of Computer Science and Mathematics University of MonastirMonastir5000Tunisia Mars Laboratory University of SousseSousseTunisia Department of Logistic and Maintenance UFR MIM at MetzUniversity of LorraineMetzFrance Department of Computer and Information Technologies College of Telecommunicationand Information Riyadh CTITechnical and Vocational Training Corporation TVTCRiyadh12464Saudi Arabia Department of Computer Science Higher Institute of Applied Sciences of SousseSousse UniversitySousse4000Tunisia

In the cloud environment,ensuring a high level of data security is in high *** planning storage optimization is part of the whole security process in the cloud *** enables data security by avoiding the risk of data loss and data *** development of data flow scheduling approaches in the cloud environment taking security parameters into account is *** our work,we propose a data scheduling model for the cloud *** is made up of three parts that together help dispatch user data flow to the appropriate *** first component is the Collector Agent whichmust periodically collect information on the state of the network *** second one is the monitoring agent which must then analyze,classify,and make a decision on the state of the link and finally transmit this information to the *** third one is the scheduler who must consider previous information to transfer user data,including fair distribution and reliable *** should be noted that each part of the proposedmodel requires the development of its *** this article,we are interested in the development of data transfer algorithms,including fairness distribution with the consideration of a stable link *** algorithms are based on the grouping of transmitted files and the iterative *** proposed algorithms showthe performances to obtain an approximate solution to the studied problem which is an NP-hard(Non-Polynomial solution)*** experimental results show that the best algorithm is the half-grouped minimum excluding(HME),with a percentage of 91.3%,an average deviation of 0.042,and an execution time of 0.001 s.

关键词： Cyber-security cloud computing cloud security algorithms heuristics

来源：评论

学校读者我要写书评

暂无评论

Detecting Double Mixed Compressed Images Based on Quaternion Convolutional Neural Network

引用

Chinese Journal of Electronics 2024年第3期33卷 657-671页

作者： Hao WANG Jinwei WANG Xuelong HU Bingtao HU Qilin YIN Xiangyang LUO Bin MA Jinsheng SUN Department of Automation Nanjing University of Science and Technology Engineering Research Center of Digital Forensics Ministry of Education Department of Computer and Software Nanjing University of Information Science and Technology School of Management Nanjing University of Posts and Telecommunications Department of Computer Science and Engineering Guangdong Province Key Laboratory of Information Security Technology Sun Yat-sen University State Key Laboratory of Mathematical Engineering and Advanced Computing Qilu University of Technology

Detection of color images that have undergone double compression is a critical aspect of digital image *** the existence of various methods capable of detecting double Joint Photographic Experts Group(JPEG) compression,they are unable to address the issue of mixed double compression resulting from the use of different compression *** particular,the implementation of Joint Photographic Experts Group 2000(JPEG2000)as the secondary compression standard can result in a decline or complete loss of performance in existing *** tackle this challenge of JPEG+JPEG2000 compression,a detection method based on quaternion convolutional neural networks(QCNN) is *** QCNN processes the data as a quaternion,transforming the components of a traditional convolutional neural network(CNN) into a quaternion *** relationships between the color channels of the image are preserved,and the utilization of color information is ***,the method includes a feature conversion module that converts the extracted features into quaternion statistical features,thereby amplifying the evidence of double *** results indicate that the proposed QCNN-based method improves,on average,by 27% compared to existing methods in the detection of JPEG+JPEG2000 compression.

关键词： Color image forensics JPEG JPEG2000 Mixed double compression Quaternion convolutional neural network

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：