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

International Conference on Guidance, Navigation and Control, ICGNC 2020

作者： Zhang, Jin Quan, Weihong Li, Haoran Wang, Lizhi Gong, Xiaoli Wu, Qian College of Computer Science Nankai University Tianjin China College of Cyber Science Nankai University Tianjin China Tianjin Key Laboratory of Network and Data Security Technology Tianjin China Tianjin University of Science and Technology Tianjin China

ISBN: (纸本)9789811581540

In order to figure out the solutions to difficulties facing the university online education platform in the expansion of the question bank, this paper proposes a teaching method of student independent proposition that allows students to create exercises independently based on the content of the textbook. In view of the high cost of manual review of these student-created exercises, natural language processing and deep learning technologies are used to achieve automatic correctness checking. For the key issues encountered in the actual construction of the independent proposition system, a feasible solution is proposed. The research is of great significance to the construction and subsequent application of the question bank of the online education platform of universities. © 2022, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

A Triangular Stable Node network based on Self-supervised Learning for personalized prediction

A Triangular Stable Node Network based on Self-supervised Le...

引用

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

作者： Liu, Qing Gao, Qian Fan, Jun Zhang, Zhiqiang Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Qilu University of Technology Shandong Academy of Sciences Jinan250014 China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology Shandong Academy of Sciences Jinan250353 China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan250014 China China Telecom Digital Intelligence Techonology Co Ltd. No.1999 Shunhua road Shandong Jinan250101 China

ISBN: (纸本)9798350368741

In recent years, research has illuminated the potency of implicit data processing in enhancing user preferences. Nevertheless, barriers remain in breaking through the constraints of implicit information. This study aims to bridge this gap by firstly constructing a triangular stable node network model, tailored to manage implicit information with precision. Recognizing the challenge of pinpointing novel structures within large-scale graphs, we propose SLTSNN-a triangular stable node network based on self-supervised learning for personalized prediction. SLTSNN innovates by maximizing mutual information between graph-level and patch-level representations, while augmenting graph representations through extended enhanced representations. Additionally, it incorporates triangular data associations and introduces a triangular allocation attention network, which emphasizes strongly correlated preference features among similar users. Furthermore, SLTSNN employs contrastive learning to maximize mutual information between graph vectors and hidden representations, distinguishing between high-order global and local representations. The model's effectiveness in enhancing user preferences and capturing new graph structures is evidenced by its performance on hit rate and normalized discounted cumulative gain metrics across three datasets. © 2025 IEEE.

关键词： graph contrastive learning graph neural networks recommender systems self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Triple-Fault-Tolerant Binary MDS Array Codes with Lower Encoding Complexity 18

Triple-Fault-Tolerant Binary MDS Array Codes with Lower Enco...

引用

18th International Symposium on Problems of Redundancy in Information and Control Systems, REDUNDANCY 2023

作者： Hou, Hanxu Song, Linqi Dongguan University of Technology Dongguan Key Lab of Artificial Information Network School of Electrical Engineering & Intelligentization China City University of Hong Kong Department of Computer Science Hong Kong

ISBN: (纸本)9798350381528

In this paper, we present a new construction of maximal distance separable (MDS) array codes with three parity columns. We present an efficient encoding algorithm for our new codes and show that our new codes have lower encoding complexity than all the existing MDS codes under the same parameters. The essential reasons of obtaining lower encoding complexity for our codes are of two-folds: (i) our codes are well-designed in a cyclic polynomial ring with only cyclic shifts and XORs being involved in the operations;(ii) our codes are designed based on the efficient schedule algorithm that can minimize the number of operations in the coding procedure. Moreover, our codes can support much more parameters compared with the existing MDS array codes, such as the EVENODD codes and STAR codes. We also present an efficient decoding method for the proposed codes. © 2023 IEEE.

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

PPA: Preference Profiling Attack Against Federated Learning 30

PPA: Preference Profiling Attack Against Federated Learning

引用

30th Annual network and Distributed System Security Symposium, NDSS 2023

作者： Zhou, Chunyi Gao, Yansong Fu, Anmin Chen, Kai Dai, Zhiyang Zhang, Zhi Xue, Minhui Zhang, Yuqing School of Computer Science and Engineering Nanjing University of Science and Technology China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Science China Data61 CSIRO Syndey Australia National Computer Network Intrusion Protection Center University of Chinese Academy of Science China

ISBN: (纸本)1891562835

—Federated learning (FL) trains a global model across a number of decentralized users, each with a local dataset. Compared to traditional centralized learning, FL does not require direct access to local datasets and thus aims to mitigate data privacy concerns. However, data privacy leakage in FL still exists due to inference attacks, including membership inference, property inference, and data inversion. In this work, we propose a new type of privacy inference attack, coined Preference Profiling A ttack (PPA), t hat accurately profiles t he p rivate p references o f a l ocal u ser, e .g., m ost liked (disliked) items from the client’s online shopping and most common expressions from the user’s selfies. I n g eneral, P PA can profile t op-k (i.e., k = 1, 2, 3 a nd k = 1 i n p articular) preferences contingent on the local client (user)’s characteristics. Our key insight is that the gradient variation of a local user’s model has a distinguishable sensitivity to the sample proportion of a given class, especially the majority (minority) class. By observing a user model’s gradient sensitivity to a class, PPA can profile the sample proportion of the class in the user’s local dataset, and thus the user’s preference of the class is exposed. The inherent statistical heterogeneity of FL further facilitates PPA. We have extensively evaluated the PPA’s effectiveness using four datasets (MNIST, CIFAR10, RAF-DB and Products-10K). Our results show that PPA achieves 90% and 98% top-1 attack accuracy to the MNIST and CIFAR10, respectively. More importantly, in real-world commercial scenarios of shopping (i.e., Products-10K) and social network (i.e., RAF-DB), PPA gains a top-1 attack accuracy of 78% in the former case to infer the most ordered items (i.e., as a commercial competitor), and 88% in the latter case to infer a victim user’s most often facial expressions, e.g., disgusted. The top-3 attack accuracy and top-2 accuracy is up to 88% and 100% for the Products-10K and RAF-DB, re

关键词：

来源：评论

学校读者我要写书评

暂无评论

Using Depth-Enhanced Spatial Transformation for Student Gaze Target Estimation in Dual-View Classroom Images

Using Depth-Enhanced Spatial Transformation for Student Gaze...

引用

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

作者： Miao, Haonan Zhao, Peizheng Sun, Yuqi Nan, Fang Zhang, Xiaolong Wu, Yaqiang Tian, Feng School of Computer Science and Technology Xi'an Jiaotong University Xi'an710049 China Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi'an Jiaotong University Xi'an710049 China School of Advanced Technology Xi'an Jiaotong-Liverpool University Suzhou215123 China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Xi'an710049 China

ISBN: (纸本)9798350368741

Dual-view gaze target estimation in classroom environments has not been thoroughly explored. Existing methods lack consideration of depth information, primarily focusing on 2D image information and neglecting the latent 3D spatial context, which could lead to suboptimal transformation and cause the gaze cone to intersect with an incorrect object. This paper introduces a novel dual-view gaze target estimation method tailored for classroom settings, leveraging depth-enhanced spatial transformations. By formulating a depth-enhanced 2D space, our method uses depth-enhanced spatial transformation to accurately project students' gaze cones to the teacher-oriented image. Additionally, we collected a dataset named DVSGE, specifically for student gaze target estimation in dual-view classroom images. Experimental results demonstrate significant performance improvements of 9.8% in AUC and 19.9% in L2-Distance for our method, surpassing existing methods. © 2025 IEEE.

关键词： classroom depth-enhanced 2D space dual-view gaze target estimation spatial transformation

来源：评论

学校读者我要写书评

暂无评论

A Unified Causal View of Instruction Tuning

arXiv

引用

arXiv 2024年

作者： Chen, Lu Huang, Wei Zhang, Ruqing Chen, Wei Guo, Jiafeng Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China

Instruction tuning on a mixture of tasks has improved zero-shot capabilities in natural language processing (NLP) . Nevertheless, existing methods often learn features that exhibit correlations between instruction-formatted samples and target labels, rather than causal relationships. Termed as "spurious correlation" in statistics, such a correlation may change drastically in a new task, making the effect from the learned features to be misleading. To this end, we develop a meta Structural Causal Model (meta-SCM) to integrate different NLP tasks under a single causal structure of the data. Specifically, the meta-SCM introduces multiple latent factors that represent properties of source context, only some of which causally influence the target labels for a specific task. The key idea is to learn task-required causal factors and only use those to make predictions for a given task. Theoretically, we prove the causal factor can be identified without mixing information from others. Guided by the identifiability, we propose a Structural Instruction Tuning (SIT) method to learn the task-required causal representations that can mimic the causal factors for each task. The utility of our approach is verified by improvements of zero-shot ability on a range of unseen datasets and tasks. Copyright © 2024, The Authors. All rights reserved.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

data-Driven Active Power Dispatch for Wind Farms 13

Data-Driven Active Power Dispatch for Wind Farms

引用

13th IEEE data Driven Control and Learning Systems Conference, DDCLS 2024

作者： Jiao, Xuguo Zhang, Daoyuan Wang, Xin Ma, Zhaoxing Zhang, Zhenyong Liu, Wenfeng School of Information and Control Engineering Qingdao University of Technology Qingdao266520 China College of Control Science and Engineering Zhejiang University State Key Laboratory of Industrial Control Technology Hangzhou310027 China Ministry of Education Shandong Computer Science Center Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Jinan250014 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan250014 China College of Computer Science and Technology Guizhou University State Key Laboratory of Public Big Data Guiyang550025 China School of Civil Engineering Qingdao University of Technology Qingdao266520 China

ISBN: (纸本)9798350361674

Active power dispatch of wind farms plays an important role in power grid scheduling. In this paper, a data-driven active power dispatch strategy for wind farms is proposed, which uses the key point of minimizing the standard deviation of wind turbines' output power series to reduce their fluctuations. First, to build the optimization problem, the historical active power output data of each wind turbine is collected from the Supervisory Control And data Acquisition (SCADA) system. Then, the objective function is developed based on the idea of minimizing the standard deviation of the output power time series. Meanwhile, considering the constraints of wind turbines' output power and active power balance of the grid, the feasible domain of the cost function is constructed. Further, to solve the proposed nonlinear optimization problem with equality and inequality constraints, the trust region interior point method (TRIPM) is employed to explore optimal solution within the feasible domain. Finally, actual data collected from wind farms is used to test effectiveness of the designed approach and experimental results show that our method can achieve better output power smoothing performance than conventional Proportional Dispatch (PD) method. © 2024 IEEE.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Learning Time Slot Preferences via Mobility Tree for Next POI Recommendation

arXiv

引用

arXiv 2024年

作者： Huang, Tianhao Pan, Xuan Cai, Xiangrui Zhang, Ying Yuan, Xiaojie College of Computer Science Nankai University China Tianjin Key Laboratory Network and Data Security Technology Tianjin China Key Laboratory of Data and Intelligent System Security Ministry of Education China Science and Technology on Communication Networks Laboratory Shijiazhuang China

Next Point-of-Interests (POIs) recommendation task aims to provide a dynamic ranking of POIs based on users’ current check-in trajectories. The recommendation performance of this task is contingent upon a comprehensive understanding of users’ personalized behavioral patterns through Location-based Social networks (LBSNs) data. While prior studies have adeptly captured sequential patterns and transitional relationships within users’ check-in trajectories, a noticeable gap persists in devising a mechanism for discerning specialized behavioral patterns during distinct time slots, such as noon, afternoon, or evening. In this paper, we introduce an innovative data structure termed the "Mobility Tree", tailored for hierarchically describing users’ check-in records. The Mobility Tree encompasses multi-granularity time slot nodes to learn user preferences across varying temporal periods. Meanwhile, we propose the Mobility Tree network (MTNet), a multitask framework for personalized preference learning based on Mobility Trees. We develop a four-step node interaction operation to propagate feature information from the leaf nodes to the root node. Additionally, we adopt a multitask training strategy to push the model towards learning a robust representation. The comprehensive experimental results demonstrate the superiority of MTNet over ten state-of-the-art next POI recommendation models across three real-world LBSN datasets, substantiating the efficacy of time slot preference learning facilitated by Mobility Tree. Copyright © 2024, The Authors. All rights reserved.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

A Time-Domain Carrier Frequency Offset Estimation Algorithm Based on the Power of Zero-Subcarriers for CO-OFDM Systems

A Time-Domain Carrier Frequency Offset Estimation Algorithm ...

引用

2023 Asia Communications and Photonics Conference/2023 International Photonics and Optoelectronics Meetings, ACP/POEM 2023

作者： Yan, Jiaxin Jin, Taowei Du, Xinwei Zhang, Jing Yang, Qi Qiu, Kun Key Lab. of Optical Fiber Sensing and Communications University of Electronic Science and Technology of China Chengdu China Guangdong Provincial Key Laboratory of Interdisciplinary Research and Application for Data Science BNU-HKBU United International College Zhuhai China School of Optical and Electronic Information Huazhong University of Science and Technology Wuhan China

We propose a simple, full-range, and low-latency frequency offset estimation method based on the moving average filter bank in the time domain for CO-OFDM transmission systems. Simulation results validate its feasibil... 详细信息

ISBN: (纸本)9798350312614

关键词： Carrier frequency offset orthogonal frequency division multiplexing

来源：评论

学校读者我要写书评

暂无评论

Modeling of unsupervised knowledge graph of events based on mutual information among neighbor domains and sparse representation

引用

Defence technology（防务技术） 2022年第12期18卷 2150-2159页

作者： Jing-Tao Sun Jing-Ming Li Qiu-Yu Zhang School of Computer Science and Technology Xi'an University of Posts and TelecommunicationsXi'anShaanxi710121China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi'an University of Posts and TelecommunicationsXi'anShaanxi710121China School of Management Science and Engineering Anhui University of Finance and EconomicsBengbuAnhui230030China School of Computer and Communication Lanzhou University of TechnologyLanzhouGansu730050China

Text event mining,as an indispensable method of text mining processing,has attracted the extensive attention of researchers.A modeling method for knowledge graph of events based on mutual information among neighbor domains and sparse representation is proposed in this paper,***,UKGE-MS can improve the existing text mining technology's ability of understanding and discovering high-dimensional unmarked information,and solves the problems of traditional unsupervised feature selection methods,which only focus on selecting features from a global perspective and ignoring the impact of local connection of ***,considering the influence of local information of samples in feature correlation evaluation,a feature clustering algorithm based on average neighborhood mutual information is proposed,and the feature clusters with certain event correlation are obtained;Secondly,an unsupervised feature selection method based on the high-order correlation of multi-dimensional statistical data is designed by combining the dimension reduction advantage of local linear embedding algorithm and the feature selection ability of sparse representation,so as to enhance the generalization ability of the selected feature ***,the events knowledge graph is constructed by means of sparse representation and l1 *** experiments are carried out on five real datasets and synthetic datasets,and the UKGE-MS are compared with five corresponding *** experimental results show that UKGE-MS is better than the traditional method in event clustering and feature selection,and has some advantages over other methods in text event recognition and discovery.

关键词： Text event mining Knowledge graph of events Mutual information among neighbor domains Sparse representation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：