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

arXiv 2025年

作者： Huang, Kaiyang Liu, Yang Sun, Kai Qiu, Feng Department of Electrical Engineering and Computer Science University of Tennessee KnoxvilleTN37996 United States Argonne National Laboratory Lemont IL60439 United States

Dynamic simulation plays a crucial role in power system transient stability analysis, but traditional numerical integration-based methods are time-consuming due to the small time step sizes. Other semi-analytical solution methods, such as the Differential Transformation method, often struggle to select proper orders and steps, leading to slow performance and numerical instability. To address these challenges, this paper proposes a novel adaptive dynamic simulation approach for power system transient stability analysis. The approach adds feedback control and optimization to selecting the step and order, utilizing the Differential Transformation method and a proportional-integral control strategy to control truncation errors. Order selection is formulated as an optimization problem resulting in a variable-step-optimal-order method that achieves significantly larger time step sizes without violating numerical stability. It is applied to three systems: the IEEE 9-bus, 3-generator system, IEEE 39-bus, 10-generator system, and a Polish 2383-bus, 327-generator system, promising computational efficiency and numerical robustness for large-scale power system is demonstrated in comprehensive case studies. Copyright © 2025, The Authors. All rights reserved.

关键词： Transient stability

来源：评论

学校读者我要写书评

暂无评论

A Stealthy Wrongdoer: Feature-Oriented Reconstruction Attack Against Split Learning

A Stealthy Wrongdoer: Feature-Oriented Reconstruction Attack...

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Xiaoyang Xu Mengda Yang Wenzhe Yi Ziang Li Juan Wang Hongxin Hu Yong Zhuang Yaxin Liu Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan University Department of Computer Science and Engineering University at Buffalo SUNY

ISBN: (数字)9798350353006

ISBN: (纸本)9798350353013

Split Learning (SL) is a distributed learning framework renowned for its privacy-preserving features and minimal computational requirements. Previous research consistently highlights the potential privacy breaches in SL systems by server adversaries reconstructing training data. However, these studies often rely on strong assumptions or compromise system utility to enhance attack performance. This paper introduces a new semi-honest Data Reconstruction Attack on SL, named Feature-Oriented Reconstruction Attack (FORA). In contrast to prior works, FORA relies on limited prior knowledge, specifically that the server utilizes auxiliary samples from the public without knowing any client's private information. This allows FORA to conduct the attack stealthily and achieve robust performance. The key vulnerability exploited by FORA is the revelation of the model representation preference in the smashed data output by victim client. FORA constructs a substitute client through feature-level transfer learning, aiming to closely mimic the victim client's representation preference. Leveraging this substitute client, the server trains the attack model to effectively reconstruct private data. Extensive experiments showcase FORA's superior performance compared to state-of-the-art methods. Furthermore, the paper systematically evaluates the proposed method's applicability across diverse settings and advanced defense strategies.

关键词： computer vision computer aided instruction Distance learning Transfer learning Training data Privacy breach Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Game Generation via Large Language Models

Game Generation via Large Language Models

引用

IEEE Symposium on Computational Intelligence and Games, CIG

作者： Chengpeng Hu Yunlong Zhao Jialin Liu Department of Computer Science and Engineering Guangdong Key Laboratory of Brain-inspired Intelligent Computation Southern University of Science and Technology Shenzhen China LightSpeed Studios Tencent Shenzhen China

ISBN: (数字)9798350350678

ISBN: (纸本)9798350350685

Recently, the emergence of large language models (LLMs) has unlocked new opportunities for procedural content generation. However, recent attempts mainly focus on level generation for specific games with defined game rules such as Super Mario Bros. and Zelda. This paper investigates the game generation via LLMs. Based on video game description language, this paper proposes an LLM-based framework to generate game rules and levels simultaneously. Experiments demonstrate how the framework works with prompts considering different combinations of context. Our findings extend the current applications of LLMs and offer new insights for generating new games in the area of procedural content generation.

关键词： Video games Solid modeling Procedural generation Three-dimensional displays Large language models Prototypes Games

来源：评论

学校读者我要写书评

暂无评论

Adjectives and adverbs as stylometric analysis parameters

引用

International Journal of Digital Humanities 2023年第2期5卷 233-245页

作者： Lukin, Eugenia Roberts, James Cooper Berdik, David Mugar, Eliana Juola, Patrick Linguistics Department Boston University Boston USA Computer Science Duquesne University Pittsburgh USA Evaluating Variations in Language Laboratory Duquesne University Pittsburgh USA

The present study considers the role of adjectives and adverbs in stylometric analysis and authorship attribution. Adjectives and adverbs allow both for variations in placement and order (adverbs) and variations in type (adjectives). This preliminary study examines a collection of 25 English-language blogs taken from the Schler Blog corpus, and the Project Gutenberg corpus with specific emphasis on 3 works. Within the blog corpora, the first and last 100 lines were extracted for the purpose of analysis. Project Gutenberg corpora were used in full. All texts were processed and part-of-speech tagged using the Python NLTK package. All adverbs were classified as sentence-initial, preverbal, interverbal, postverbal, sentence-final, or none-of-the-above. The adjectives were classified into types according to the universal English type hierarchy (Cambridge Dictionary Online, 2021; Annear, 1964) manually by one of the authors. Ambiguous adjectives were classified according to their context. For the adverbs, the initial samples were paired and used as training data to attribute the final samples. This resulted in 600 trials under each of five experimental conditions. We were able to attribute authorship with an average accuracy of 9.7% greater than chance across all five conditions. Confirmatory experiments are ongoing with a larger sample of English-language blogs. This strongly suggests that adverbial placement is a useful and novel idiolectal variable for authorship attribution (Juola et al., 2021). For the adjective, differences were found in the type of adjective used by each author. Percent use of each type varied based upon individual preference and subject-matter (e.g. Moby Dick had a large number of adjectives related to size and color). While adverbial order and placement are highly variable, adjectives are subject to rigid restrictions that are not violated across texts and authors. Stylometric differences in adjective use generally involve the type and category o

关键词：

来源：评论

学校读者我要写书评

暂无评论

UnoAPI: Balancing Performance, Portability, and Productivity (P3) in HPC Education

UnoAPI: Balancing Performance, Portability, and Productivity...

引用

Workshop on Education for High Performance Computing (EduHPC)

作者： Konstantin Läufer George K. Thiruvathukal Department of Computer Science Software and Systems Laboratory Loyola University Chicago

ISBN: (纸本)9781665473675

oneAPI is a major initiative by Intel aimed at making it easier to program heterogeneous architectures used in high-performance computing using a unified application programming interface (API). While raising the abstraction level via a unified API represents a promising step for the current generation of students and practitioners to embrace high-performance computing, we argue that a curriculum of well-developed software engineering methods and well-crafted exem-plars will be necessary to ensure interest by this audience and those who teach them. We aim to bridge the gap by developing a curriculum-codenamed UnoAPI-that takes a more holistic approach by looking beyond language and framework to include the broader development ecosystem, similar to the experience found in popular HPC languages such as Python. We hope to make parallel programming a more attractive option by making it look more like general application development in modern languages being used by most students and educators today. Our curriculum emanates from the perspective of well-crafted exemplars from the foundations of computer systems-given that most HPC architectures of interest begin from the systems tradition-with an integrated treatment of essential principles of distributed systems, programming languages, and software engineering. We argue that a curriculum should cover the essence of these topics to attract students to HPC and enable them to confidently solve computational problems using oneAPI. By the time of this submission, we have shared our materials with a small group of undergraduate sophomores, and their responses have been encouraging in terms of self-reported comprehension and ability to reproduce the compilation and execution of exemplars on their personal systems. We plan a follow-up study with a larger cohort by incorporating some of our materials in our existing course on High-Performance Computing.

关键词： Productivity Parallel programming High performance computing Education Ecosystems computer architecture Software

来源：评论

学校读者我要写书评

暂无评论

Spatial Heterophily Aware Graph Neural Networks

arXiv

引用

arXiv 2023年

作者： Xiao, Congxi Zhou, Jingbo Huang, Jizhou Xu, Tong Xiong, Hui School of Computer Science and Technology University of Science and Technology of China Baidu Research China Business Intelligence Lab Baidu Research Baidu Inc School of Computer Science and Technology University of Science and Technology of China State Key Laboratory of Cognitive Intelligence China The Department of Computer Science and Engineering The Hong Kong University of Science and Technology Hong Kong

Graph Neural Networks (GNNs) have been broadly applied in many urban applications upon formulating a city as an urban graph whose nodes are urban objects like regions or points of interest. Recently, a few enhanced GNN architectures have been developed to tackle heterophily graphs where connected nodes are dissimilar. However, urban graphs usually can be observed to possess a unique spatial heterophily property;that is, the dissimilarity of neighbors at different spatial distances can exhibit great diversity. This property has not been explored, while it often exists. To this end, in this paper, we propose a metric, named Spatial Diversity Score, to quantitatively measure the spatial heterophily and show how it can influence the performance of GNNs. Indeed, our experimental investigation clearly shows that existing heterophilic GNNs are still deficient in handling the urban graph with high spatial diversity score. This, in turn, may degrade their effectiveness in urban applications. Along this line, we propose a Spatial Heterophily Aware Graph Neural Network (SHGNN), to tackle the spatial diversity of heterophily of urban graphs. Based on the key observation that spatially close neighbors on the urban graph present a more similar mode of difference to the central node, we first design a rotation-scaling spatial aggregation module, whose core idea is to properly group the spatially close neighbors and separately process each group with less diversity inside. Then, a heterophily-sensitive spatial interaction module is designed to adaptively capture the commonality and diverse dissimilarity in different spatial groups. Extensive experiments on three real-world urban datasets demonstrate the superiority of our SHGNN over several its competitors. © 2023, CC BY-NC-ND.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

SLAM algorithm based on bounding box and deep continuity in dynamic scene

引用

International Journal of Wireless and Mobile Computing 2021年第4期21卷 349-364页

作者： Fang, Baofu Han, Xiumeng Wang, Zaijun Yuan, Xiaohui School of Computer Science and Information Engineering Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Anhui Hefei230009 China Key Laboratory of Flight Techniques and Flight Safety Civil Aviation Flight University of China Sichuan Guanghan618307 China Department of Computer Science and Engineering University of North Texas DentonTX311277 United States

To solve the problems of low positioning accuracy and poor robustness caused by the inability of Simultaneous Localisation and Mapping (SLAM) algorithm to deal with dynamic targets in dynamic scenes, a SLAM algorithm based on bounding box and depth continuity in dynamic scenes is proposed. Firstly, the pixel random search filling process is carried out in combination with the depth and the bounding box to obtain the pixel-level segmentation result of the prior dynamic target. Then, the dynamic features are screened to eliminate the influence of dynamic targets. According to the screening results, relative static features which can be used for posture optimisation are selected. Posture optimisation is carried out by combining the static features to obtain the optimised camera posture. All experimental results show that the proposed algorithm significantly improves the positioning accuracy and real-time performance of SLAM algorithm in complex dynamic scenes. Copyright © 2021 Inderscience Enterprises Ltd.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

reAnalyst: Scalable Annotation of Reverse Engineering Activities

arXiv

引用

arXiv 2024年

作者： Zhang, Tab Taylor, Claire Coppens, Bart Mebane, Waleed Collberg, Christian De Sutter, Bjorn Computer Systems Lab Ghent University Technologiepark-Zwijnaarde 126 Gent9052 Belgium Department of Computer Science The University of Arizona Tucson85721 United States Lawrence Livermore National Laboratory Livermore94550 United States

This paper introduces reAnalyst, a framework designed to facilitate the study of reverse engineering (RE) practices through the semi-automated annotation of RE activities across various RE tools. By integrating tool-agnostic data collection of screenshots, keystrokes, active processes, and other types of data during RE experiments with semi-automated data analysis and generation of annotations, reAnalyst aims to overcome the limitations of traditional RE studies that rely heavily on manual data collection and subjective analysis. The framework enables more efficient data analysis, which will in turn allow researchers to explore the effectiveness of protection techniques and strategies used by reverse engineers more comprehensively and efficiently. Experimental evaluations validate the framework’s capability to identify RE activities from a diverse range of screenshots with varied complexities. Observations on past experiments with our framework as well as a survey among reverse engineers provide further evidence of the acceptability and practicality of our approach. © 2024, CC BY-NC-ND.

关键词： Reverse engineering

来源：评论

学校读者我要写书评

暂无评论

Semantic-Preserving Adversarial Code Comprehension 29

Semantic-Preserving Adversarial Code Comprehension

引用

29th International Conference on Computational Linguistics, COLING 2022

作者： Li, Yiyang Wu, Hongqiu Zhao, Hai Department of Computer Science and Engineering Shanghai Jiao Tong University China Key Laboratory of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Shanghai Jiao Tong University China

Based on the tremendous success of pre-trained language models (PrLMs) for source code comprehension tasks, current literature studies either ways to further improve the performance (generalization) of PrLMs, or their robustness against adversarial attacks. However, they have to compromise on the trade-off between the two aspects and none of them consider improving both sides in an effective and practical way. To fill this gap, we propose Semantic-Preserving Adversarial Code Embeddings (SPACE) to find the worst-case semantic-preserving attacks while forcing the model to predict the correct labels under these worst cases. Experiments and analysis demonstrate that SPACE can stay robust against state-of-the-art attacks while boosting the performance of PrLMs for code © 2022 Proceedings - International Conference on Computational Linguistics, COLING. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Enhancing Code Representation Learning for Code Search with Abstract Code Semantics

Enhancing Code Representation Learning for Code Search with ...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Shaojie Zhang Yiwei Ding Enrui Hu Yue Yu Yu Zhang Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China Peng Cheng Laboratory Shenzhen China Distributed and Parallel Software Lab Huawei Shenzhen China

ISBN: (数字)9798350359312

ISBN: (纸本)9798350359329

Code representation learning is an important way to encode the semantics of source code through pre-training. The learned representation supports a variety of downstream tasks, such as natural language code search and code defect detection. Inspired by pre-trained models for natural language representation learning, existing approaches often treat the source code or its structural information (e.g., Abstract Syntax Tree or AST) as a plain token sequence. Unlike natural language, programming language has its unique code unit information (e.g., identifiers and expressions) and logic information (e.g., the functionality of a code snippet). To further explore those properties, we propose Abstract Code Embedding (AbCE), a self-supervised learning method that considers the abstract semantics of code logic. Instead of scattered tokens, AbCE treats an entire node or a subtree in an AST as a basic code unit during pre-training, which preserves the entirety of a coding unit. Moreover, AbCE learns the abstract semantics of AST nodes via a self-distillation way. Experimental results show that it achieves significant improvements over state-of-the-art baselines on code search tasks and comparable performance on code clone detection and defect detection tasks even without using contrastive learning or curriculum learning.

关键词： Representation learning Codes Source coding Semantics Natural languages Cloning Syntactics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：