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

The development of public relations for school of computer and information technology chiangrai rajabhat university using virtual reality technology 22

The development of public relations for school of computer a...

引用

22nd International computer Science and Engineering Conference, ICSEC 2018

作者： Chaikhamwang, Sumran Montri, Wijitra Anantasomboon, Konlachan Department of Computer Science Chiangrai Rajabhat University School of Computer and Information Technology Chiangrai Thailand

ISBN: (纸本)9781538681640

This research aims to 1) to study in the Development of public relations for school of computer and information technology Chiangrai Rajabhat University Using Virtual Reality technology 2) to design the Development of public relations for school of computer and information technology Chiangrai Rajabhat University Using Virtual Reality technology and 3) to Development of public relations for school of computer and information technology Chiangrai Rajabhat University Using Virtual Reality technology. This system provided continuously to developed school of computer and information technology environment 3D model, then created applications to promote information and activities with 3D glasses. © 2018 IEEE.

关键词： Public relations

来源：评论

学校读者我要写书评

暂无评论

Federated local causal structure learning

引用

Science China(information Sciences) 2025年第3期68卷 110-124页

作者： Kui YU Chen RONG Hao WANG Fuyuan CAO Jiye LIANG School of Computer and Information Hefei University of Technology School of Computer and Information Technology Shanxi University

Local causal structure learning(LCS) efficiently identifies a set of direct neighbors of a specified variable from observational data. Additionally, it distinguishes direct causes and direct effects of this variable without learning the entire causal structure. While many LCS algorithms have been proposed, they do not consider the data privacy-preserving problem,which has attracted extensive attention from academia and industry. To address this issue, we propose a federated local causal structure learning(FedLCS) algorithm to learn local causal structures in privacy-preserving data in a federated ***, FedLCS introduces a layer-wise federated local skeleton learning algorithm to construct the local skeleton. Based on this skeleton, it introduces a federated local skeleton orientation algorithm and an extension-and-backtracking orientation algorithm to orient the edges. Finally, FedLCS uses a federated local extension-and-backtracking orientation algorithm to orient the remaining edges. Extensive experiments on benchmark, synthetic, and real datasets demonstrate that FedLCS can learn the local causal structure of a given variable in a federated setting.

关键词： local causal structure learning federated learning directed acyclic graph privacy-preserving data federated layer-wise strategy

来源：评论

学校读者我要写书评

暂无评论

Witness encryption with updatable ciphertexts

引用

Science China(information Sciences) 2025年第3期68卷 181-196页

作者： Yuzhu WANG Mingwu ZHANG School of Computer Science and Information Security Guilin University of Electronic Technology School of Computer Science Hubei University of Technology

Witness encryption(WE) is a novel type of cryptographic primitive that enables a message to be encrypted via an NP instance. Anyone who possesses a solution to this instance(i.e., a witness) can then recover the message from the *** introduce a variant of WE that allows ciphertext updates, referred to as ciphertext updateable WE(CUWE). With CUWE,a user can encrypt a message using an instance x and a tag t, and those who possess a valid witness w for x and match the access policy defined by tag t can decrypt the message. Furthermore, CUWE allows for the use of an update token to change the tag t of ciphertext to a different tag. This feature enables fine-grained access control, even after the ciphertext has been created, thereby significantly increasing the usefulness of the WE scheme. We demonstrate that such a WE framework with an updatable ciphertext scheme can be constructed using our puncturable instance-based deterministic encryption(PIDE) and indistinguishability obfuscation(iO). We also propose an instantiation of PIDE utilizing puncturable pseudorandom functions(PRFs) that provide(selectively) indistinguishable security. Finally, we expand our CUWE to ciphertext-updatable functional WE(CUFWE), which offers enhanced data access control.

关键词： witness encryption NP relation updatable ciphertext access control indistinguishable obfuscation

来源：评论

学校读者我要写书评

暂无评论

CM-CaFE: A Clustering Method with Causality-based Feature Embedding

引用

ACM Transactions on Knowledge Discovery from Data 2025年第3期19卷 1-23页

作者： Jing, Xuechun Cao, Fuyuan Yu, Kui Liang, Jiye The School of Computer and Information Technology Shanxi University Taiyuan China The School of Computer and Information Hefei University of Technology Hefei China

Clustering is a fundamental technique widely used for exploring the inherent data structure. Many studies indicate that an appropriate feature representation can effectively improve clustering performance. However, the existing feature representation methods are based on correlation to select or extract features, which makes it hard to deal with spurious correlations. The spurious correlations mislead the correlation-based methods to consider features that have no causal relationship as being correlative, which limits the clustering performance and feature interpretability. To tackle this issue, inspired by causal learning, we propose a new joint optimization Clustering Method with Causal Feature Embedding (CM-CaFE), which utilizes the causality of features to learn more discriminative representation for clustering. Specifically, to eliminate spurious correlations among features, we first employ any state-of-the-art Markov blanket learning method to learn an undirected causal graph. Next, we extract the maximal fully connected causal subgraphs from the learned undirected causal graph and propose an approach to merge them to generate the causal matrix. Based on the causal matrix, we present an objective function that consists of a clustering loss term and a causal matrix fitting term to learn a causal transformation matrix. The causal transformation matrix is utilized to map the original data into a new space for clustering. Finally, we comprehensively compare the proposed method with some state-of-the-art clustering approaches on several datasets to demonstrate the effectiveness and interpretability of the proposed method. © 2025 Copyright held by the owner/author(s). Publication rights licensed to ACM.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Detection accuracy of target accelerations based on vortex electromagnetic wave in keyhole space

引用

Chinese Physics B 2024年第2期33卷 283-290页

作者：郭凯雷爽雷艺周红平郭忠义 School of Computer and Information Hefei University of TechnologyHefei 230009China

The influence of the longitudinal acceleration and the angular acceleration of detecting target based on vortex electromagnetic waves in keyhole space are *** spectrum spreads of different orbital angular momentum(OAM)modes in different non-line-of-sight situations are *** errors of target accelerations in detection are calculated and compared based on the OAM spectra spreading by using two combinations of composite OAM modes in the keyhole *** to the research,the effects about spectrum spreads of higher OAM modes are more *** error in detection is mainly affected by OAM spectrum spreading,which can be reduced by reasonably using different combinations of OAM modes in different practical *** above results provide a reference idea for investigating keyhole effect when vortex electromagnetic wave is used to detect accelerations.

关键词： vortex electromagnetic waves detect accelerations keyhole space spectrum spread

来源：评论

学校读者我要写书评

暂无评论

Coarse-to-fine lightweight meta-embedding for ID-based recommendations

引用

Science China(information Sciences) 2025年第4期68卷 82-97页

作者： Yang WANG Haipeng LIU Zeqian YI Biao QIAN Meng WANG School of Computer Science and Information Engineering Hefei University of Technology College of Information and Intelligence Hunan Agricultural University

State-of-the-art recommender systems are increasingly focused on optimizing implementation efficiency, such as enabling on-device recommendations under memory constraints. Current methods commonly use lightweight embeddings for users and items or employ compact embeddings to enhance reusability and reduce memory usage. However, these approaches consider only the coarse-grained aspects of embeddings, overlooking subtle semantic nuances. This limitation results in an adversarial degradation of meta-embedding performance, impeding the system's ability to capture intricate relationships between users and items, leading to suboptimal recommendations. To address this, we propose a novel approach to efficiently learn meta-embeddings with varying grained and apply fine-grained meta-embeddings to strengthen the representation of their coarse-grained counterparts. Specifically, we introduce a recommender system based on a graph neural network, where each user and item is represented as a node. These nodes are directly connected to coarse-grained virtual nodes and indirectly linked to fine-grained virtual nodes, facilitating learning of multi-grained semantics. Fine-grained semantics are captured through sparse meta-embeddings, which dynamically balance embedding uniqueness and memory constraints. To ensure their sparseness, we rely on initialization methods such as sparse principal component analysis combined with a soft thresholding activation function. Moreover, we propose a weight-bridging update strategy that aligns coarse-grained meta-embedding with several fine-grained meta-embeddings based on the underlying semantic properties of users and items. Comprehensive experiments demonstrate that our method outperforms existing baselines. The code of our proposal is available at https://***/htyjers/C2F-MetaEmbed.

关键词： lightweight meta-embedding coarse-to-fine learning ID-based recommendations

来源：评论

学校读者我要写书评

暂无评论

Intelligent integrated sensing and communication:a survey

引用

Science China(information Sciences) 2025年第3期68卷 5-46页

作者： Jifa ZHANG Weidang LU Chengwen XING Nan ZHAO Naofal AL-DHAHIR George K.KARAGIANNIDIS Xiaoniu YANG School of Information and Communication Engineering Dalian University of Technology College of Information Engineering Zhejiang University of Technology School of Information and Electronics Beijing Institute of Technology Department of Electrical and Computer Engineering The University of Texas at Dallas Department of Electrical and Computer Engineering Aristotle University of Thessaloniki

Integrated sensing and communication (ISAC) is a promising technique to increase spectral efficiency and support various emerging applications by sharing the spectrum and hardware between these functionalities. However, the traditional ISAC schemes are highly dependent on the accurate mathematical model and suffer from the challenges of high complexity and poor performance in practical scenarios. Recently, artificial intelligence (AI) has emerged as a viable technique to address these issues due to its powerful learning capabilities, satisfactory generalization capability, fast inference speed, and high adaptability for dynamic environments, facilitating a system design shift from model-driven to data-driven. Intelligent ISAC, which integrates AI into ISAC, has been a hot topic that has attracted many researchers to investigate. In this paper, we provide a comprehensive overview of intelligent ISAC, including its motivation, typical applications, recent trends, and challenges. In particular, we first introduce the basic principle of ISAC, followed by its key techniques. Then, an overview of AI and a comparison between model-based and AI-based methods for ISAC are provided. Furthermore, the typical applications of AI in ISAC and the recent trends for AI-enabled ISAC are reviewed. Finally, the future research issues and challenges of intelligent ISAC are discussed.

关键词： artificial intelligence deep learning deep reinforcement learning federated learning generative artificial intelligence integrated sensing and communication machine learning transfer learning

来源：评论

学校读者我要写书评

暂无评论

Privacy-preserving explainable AI: a survey

引用

Science China(information Sciences) 2025年第1期68卷 23-56页

作者： Thanh Tam NGUYEN Thanh Trung HUYNH Zhao REN Thanh Toan NGUYEN Phi Le NGUYEN Hongzhi YIN Quoc Viet Hung NGUYEN School of Information and Communication Technology Griffith University School of Computer and Communication Sciences Ecole Polytechnique Federale de Lausanne Faculty of Mathematics and Computer Science University of Bremen Faculty of Information Technology HUTECH University Department of Computer Science Hanoi University of Science and Technology School of Electrical Engineering and Computer Science The University of Queensland

As the adoption of explainable AI(XAI) continues to expand, the urgency to address its privacy implications intensifies. Despite a growing corpus of research in AI privacy and explainability, there is little attention on privacy-preserving model explanations. This article presents the first thorough survey about privacy attacks on model explanations and their countermeasures. Our contribution to this field comprises a thorough analysis of research papers with a connected taxonomy that facilitates the categorization of privacy attacks and countermeasures based on the targeted explanations. This work also includes an initial investigation into the causes of privacy leaks. Finally, we discuss unresolved issues and prospective research directions uncovered in our analysis. This survey aims to be a valuable resource for the research community and offers clear insights for those new to this domain. To support ongoing research, we have established an online resource repository, which will be continuously updated with new and relevant findings.

关键词： privacy-preserving explainable AI privacy attacks privacy defences PrivEx PPXAI

来源：评论

学校读者我要写书评

暂无评论

Robust video question answering via contrastive cross-modality representation learning

引用

Science China(information Sciences) 2024年第10期67卷 211-226页

作者： Xun YANG Jianming ZENG Dan GUO Shanshan WANG Jianfeng DONG Meng WANG School of Information Science and Technology University of Science and Technology of China Institute of Artificial Intelligence Hefei Comprehensive National Science Center School of Computer Science and Information Engineering Hefei University of Technology Institutes of Physical Science and Information Technology Anhui University School of Computer Science and Technology Zhejiang Gongshang University

Video question answering(VideoQA) is a challenging yet important task that requires a joint understanding of low-level video content and high-level textual semantics. Despite the promising progress of existing efforts, recent studies revealed that current VideoQA models mostly tend to over-rely on the superficial correlations rooted in the dataset bias while overlooking the key video content, thus leading to unreliable results. Effectively understanding and modeling the temporal and semantic characteristics of a given video for robust VideoQA is crucial but, to our knowledge, has not been well investigated. To fill the research gap, we propose a robust VideoQA framework that can effectively model the cross-modality fusion and enforce the model to focus on the temporal and global content of videos when making a QA decision instead of exploiting the shortcuts in datasets. Specifically, we design a self-supervised contrastive learning objective to contrast the positive and negative pairs of multimodal input, where the fused representation of the original multimodal input is enforced to be closer to that of the intervened input based on video perturbation. We expect the fused representation to focus more on the global context of videos rather than some static keyframes. Moreover, we introduce an effective temporal order regularization to enforce the inherent sequential structure of videos for video representation. We also design a Kullback-Leibler divergence-based perturbation invariance regularization of the predicted answer distribution to improve the robustness of the model against temporal content perturbation of videos. Our method is model-agnostic and can be easily compatible with various VideoQA backbones. Extensive experimental results and analyses on several public datasets show the advantage of our method over the state-of-the-art methods in terms of both accuracy and robustness.

关键词： video question answering cross-modality fusion contrastive learning cross-media reasoning

来源：评论

学校读者我要写书评

暂无评论

QoS-Aware Computation Offloading in LEO Satellite Edge Computing for IoT:A Game-Theoretical Approach

引用

Chinese Journal of Electronics 2024年第4期33卷 875-885页

作者： Ying CHEN Jintao HU Jie ZHAO Geyong MIN School of Computer Science Beijing Information Science and Technology University University of Exeter

Low earth orbit(LEO) satellite edge computing can overcome communication difficulties in harsh environments, which lack the support of terrestrial communication infrastructure. It is an indispensable option for achieving worldwide wireless communication coverage in the future. To improve the quality-of-service(QoS) for Internet-of-things(IoT) devices, we combine LEO satellite edge computing and ground communication systems to provide network services for IoT devices in harsh environments. We study the QoS-aware computation offloading(QCO) problem for IoT devices in LEO satellite edge computing. Then we investigate the computation offloading strategy for IoT devices that can minimize the total QoS cost of all devices while satisfying multiple constraints, such as the computing resource constraint, delay constraint, and energy consumption constraint. We formulate the QoSaware computation offloading problem as a game model named QCO game based on the non-cooperative competition game among IoT devices. We analyze the finite improvement property of the QCO game and prove that there is a Nash equilibrium for the QCO game. We propose a distributed QoS-aware computation offloading(DQCO) algorithm for the QCO game. Experimental results show that the DQCO algorithm can effectively reduce the total QoS cost of IoT devices.

关键词： Satellites Costs Computational modeling Low earth orbit satellites Quality of service Games Nash equilibrium

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：