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

6th International Conference on Electrical, Control and Instrumentation engineering, ICECIE 2024

作者： Ma, Xuesen Li, Jingqi Li, Dacheng Li, Yangyu Qiao, Yan School of Computer Science and Information Engineering Hefei University of Technology Hefei China Hefei University of Technology Intelligent Interconnected Systems Laboratory of Anhui Province Hefei230009 China Hefei Institutes of Physical Science Chinese Academy of Sciences Hefei China Hefei University of Technology Hefei China

ISBN: (纸本)9798350380040

Implementing precise network traffic prediction is essential for optimizing base station strategies, allocating network resources effectively, reducing costs, and ensuring service quality in network management. Currently, most mainstream forecasting methods primarily focus on either the time domain or the frequency domain, attempting to capture and express time series data features from a one-dimensional perspective. This one-dimensional approach can be limiting, as relying solely on a single dimension may lead to incomplete or suboptimal modeling, it fails to fully capture the intricate interactions between time-domain and frequency-domain that define network traffic behaviors. To address this, we propose a novel Multi-Scale Attention-Fusion (MSAF) model. The key module in MSAF, named Attention-Fusion, integrates both time-domain and frequency-domain features of network traffic data. This effectively addresses the limitations of previous attention mechanisms in simultaneously identifying frequency components and temporal patterns, providing enhanced modeling capabilities for complex network traffic data. Additionally, the Attention-Fusion module utilizes a DSConv module combined with the attention mechanism to identify correlations between sequences of different lengths. Evaluation of MSAF on two real-world network traffic datasets demonstrates that MSAF outperforms other mainstream methods in terms of forecasting performance. © 2024 IEEE.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

Crowdsourced Requirements engineering Challenges and Solutions:A software Industry Perspective

引用

computer systems Science & engineering 2021年第11期39卷 221-236页

作者： Huma Hayat Khan Muhammad Noman Malik Youseef Alotaibi Abdulmajeed Alsufyani Saleh Alghamdi Department of Software Engineering National University of Modern LanguagesIslamabadPakistan Department of Computer Science National University of Modern LanguagesIslamabadPakistan Department of Computer Science College of Computer and Information SystemsUmm Al-Qura UniversityMakkahSaudi Arabia Department of Computer Science College of Computers and Information TechnologyTaif UniversityPO Box 11099TaifSaudi Arabia Department of Information Technology College of Computers and Information TechnologyTaif UniversityTaifSaudi Arabia

software crowdsourcing(SW CS)is an evolving software development paradigm,in which crowds of people are asked to solve various problems through an open call(with the encouragement of prizes for the top solutions).Because of its dynamic nature,SW CS has been progressively accepted and adopted in the software ***,issues pertinent to the understanding of requirements among crowds of people and requirements engineers are yet to be clarified and *** the requirements are not clear to the development team,it has a significant effect on the quality of the software *** study aims to identify the potential challenges faced by requirements engineers when conducting the SW–CS based requirements engineering(RE)***,solutions to overcome these challenges are also *** data analysis is performed on the interview data collected from software industry ***,20 SW–CS based RE challenges and their subsequent proposed solutions are devised,which are further grouped under seven *** study is beneficial for academicians,researchers and practitioners by providing detailed SW–CS based RE challenges and subsequent solutions that could eventually guide them to understand and effectively implement RE in SW CS.

关键词： software crowdsourced requirements engineering software industry software development survey challenges

来源：评论

学校读者我要写书评

暂无评论

Self-representation-based Generative Graph Neural Networks for End-to-End Link Prediction

引用

IEEE Transactions on Big Data 2025年

作者： Xian, Xingping Wu, Tao Qiao, Shaojie Wang, Chao Yuan, Lin Liu, Yanbing School of Cyber Security and Information Law Chongqing University of Posts and Telecommunications Chongqing China School of Software Engineering Chengdu University of Information Technology Chengdu China School of Computer and Information Science Chongqing Normal University Chongqing China Chongqing Engineering Laboratory of Internet and Information Security Chongqing University of Posts and Telecommunications Chongqing400065 China

Recently, deep neural networks have revolutionized the field of link prediction, and the state-of-the-art works are typically subgraph-based discriminative methods, which construct features of local subgraphs firstly and predicting potential links via deep learning based binary subgraph classification. However, the discriminative link prediction methods always fail to automatically learn features and perform link prediction, and the performance of them depends on the construction of enclosing subgraphs and the manually-designed features for the subgraphs. To address these issues, we leverage the idea of graph disentangling and propose a novel self-representation-based generative graph neural network framework (GraphLP) for end-to-end link prediction, which learns to extract the latent patterns, i.e., recurring subgraphs, from input graphs via self-supervised learning and reconstruct graphs for link prediction using the subgraphs as structural basis. GraphLP consists of three components: self-representation-based collaborative inference, high-order connectivity computation, and multi-scale pattern fusion. The key idea is to utilize the correlations between the extracted recurring subgraphs on different scales to effectively assist link inference. GraphLP also can effectively exploit the hierarchical organization patterns and incorporate them within the representation procedure, producing robust and accurate results. Compared with traditional methods and state-of-the-art methods, experimental results on public benchmark datasets demonstrate that GraphLP achieves promising performance. Different from the discriminative methods, GraphLP provides a new paradigm for generative neural-network-based link prediction. © 2015 IEEE. All rights reserved.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

A Generalized Binary Tree Mechanism for Differentially Private Approximation of All-Pair Distances

arXiv

引用

arXiv 2025年

作者： Dinitz, Michael Fan, Chenglin Liu, Jingcheng Upadhyay, Jalaj Zou, Zongrui Department of Computer Science Johns Hopkins University United States Department of Computer Science and Engineering Seoul National University Korea Republic of State Key Laboratory for Novel Software Technology New Cornerstone Science Laboratory Nanjing University China Management Science & Information Systems Department Rutgers University United States

We study the problem of approximating all-pair distances in a weighted undirected graph with differential privacy, introduced by Sealfon [Sea16]. Given a publicly known undirected graph, we treat the weights of edges as sensitive information, and two graphs are neighbors if their edge weights differ in one edge by at most one. We obtain efficient algorithms with significantly improved bounds on a broad class of graphs which we refer to as recursively separable. In particular, for any n-vertex Kh-minor-free graph, our algorithm achieve an additive error of Õ(h(nW)1/3), where W represents the maximum edge weight;For grid graphs, the same algorithmic scheme achieve additive error of Õ(n1/4√W). Our approach can be seen as a generalization of the celebrated binary tree mechanism for range queries, as releasing range queries is equivalent to computing all-pair distances on a path graph. In essence, our approach is based on generalizing the binary tree mechanism to graphs that are recursively separable. Copyright © 2025, The Authors. All rights reserved.

关键词： Binary trees

来源：评论

学校读者我要写书评

暂无评论

Keep It Simple: Towards Accurate Vulnerability Detection for Large Code Graphs

arXiv

引用

arXiv 2024年

作者： Peng, Xin Wang, Shangwen Qin, Yihao Lin, Bo Chen, Liqian Mao, Xiaoguang Cheng, Jieren The Key Laboratory of Software Engineering for Complex Systems College of Computer Science and Technology National University of Defense Technology Changsha China The Hainan University Haikou China

software vulnerability detection is crucial for high-quality software development. Recently, some studies utilizing Graph Neural Networks (GNNs) to learn the graph representation of code in vulnerability detection tasks have achieved remarkable success. However, existing graph-based approaches mainly face two limitations that prevent them from generalizing well to large code graphs: (1) the interference of noise information in the code graph;(2) the difficulty in capturing long-distance dependencies within the graph. To mitigate these problems, we propose a novel vulnerability detection method, ANGEL, whose novelty mainly embodies the hierarchical graph refinement and context-aware graph representation learning. The former hierarchically filters redundant information in the code graph, thereby reducing the size of the graph, while the latter collaboratively employs the Graph Transformer and GNN to learn code graph representations from both the global and local perspectives, thus capturing long-distance dependencies. Extensive experiments demonstrate promising results on three widely used benchmark datasets: our method significantly outperforms several other baselines in terms of the accuracy and F1 score. Particularly, in large code graphs, ANGEL achieves an improvement in accuracy of 34.27%-161.93% compared to the state-of-the-art method, AMPLE. Such results demonstrate the effectiveness of ANGEL in vulnerability detection tasks. Copyright © 2024, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

High-Fidelity Editable Portrait Synthesis with 3D GAN Inversion

High-Fidelity Editable Portrait Synthesis with 3D GAN Invers...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Jindong Xie Jiachen Liu Yupei Lin Jinbao Wang Xianxu Hou Linlin Shen Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen University School of Information Engineering Guangdong University of Technology Guangzhou China Guangdong Provincial Key Laboratory of Intelligent Information Processing School of AI and Advanced Computing Xi’an Jiaotong-Liverpool University

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

The 3D generative adversarial network (GAN) inversion converts an image into 3D representation to attain high-fidelity reconstruction and facilitate realistic image manipulation within the 3D latent space. However, previous approaches face challenges regarding the trade-off between the reconstruction ability and editability. That is, reversing a real-world image to a low-dimensional latent code would inevitably lead to information loss, and achieving a near-perfect reconstruction using high-rate triplane representation often limits the ability to manipulate the image freely in the latent space. To address these issues, we propose a novel latent conditioning encoder-based framework with the alignment between the low-dimensional latent and high-dimensional triplane. A non-semantic guided editing strategy bridges the intrinsic relation between the latent condition and triplane generation, making it possible to edit the high-dimensional representation by latent manipulation. As a result, our method can achieve high-fidelity reconstruction and editing simultaneously by directly controlling the latent code. Experimental results demonstrate that our approach excels in reconstruction and editing quality compared to previous 3D inversion methods. Furthermore, our method can also edit even real faces with large poses and out-of-domain cases.

关键词： Bridges Three-dimensional displays Codes Signal processing Generative adversarial networks Vectors Acoustics Speech processing Image reconstruction Faces

来源：评论

学校读者我要写书评

暂无评论

Brain-Conditional Multimodal Synthesis: A Survey and Taxonomy

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第5期6卷 1080-1099页

作者： Mai, Weijian Zhang, Jian Fang, Pengfei Zhang, Zhijun South China University of Technology School of Automation Science and Engineering Guangzhou510640 China Southeast University School of Computer Science and Engineering Nanjing210096 China South China University of Technology Key Library of Autonomous Systems and Network Control Ministry of Education The School of Automation Science and Engineering Guangzhou510640 China Institute for Super Robotics Huangpu Guangzhou510555 China Nanchang University Jiangxi Thousand Talents Plan Nanchang330031 China Jishou University College of Computer Science and Engineering Jishou416000 China Guangdong Artificial Intelligence and Digital Economy Laboratory Pazhou Lab Guangzhou510335 China Shaanxi University of Technology Shaanxi Provincial Key Laboratory of Industrial Automation School of Mechanical Engineering Hanzhong723001 China Changsha Normal University School of Information Science and Engineering Changsha410100 China Guangdong University of Petrochemical Technology School of Automation Science and Engineering Institute of Artificial Intelligence and Automation Maoming525000 China

In the era of artificial intelligence generated content (AIGC), conditional multimodal synthesis technologies (e.g., text-to-image) are dynamically reshaping the natural content. Brain signals, serving as potential reflections of how the brain interprets external information, exhibit a distinctive one-to-many correspondence with various external modalities. This correspondence makes brain signals emerge as a promising guiding condition for multimodal synthesis (e.g., image, text, and audio), which is crucial for developing practical brain–computer interface systems and unraveling complex mechanisms underlying human perception. This survey comprehensively examines the emerging field of brain-conditional multimodal synthesis, termed AIGC-brain, to delineate the current landscape and future directions. To begin, related neuroimaging datasets and generative models are introduced as the foundation of AIGC-brain decoding and analysis. Next, we present a comprehensive taxonomy according to AIGC-brain methodologies, followed by task-specific representative work and implementation details to facilitate in-depth comparison and analysis. Quality assessments are then introduced for both qualitative and quantitative evaluation. Finally, this survey explores insights gained, outlining current challenges and prospects of AIGC-brain. As a pioneering survey, this article paves the way for future advances in AIGC-brain research. © 2020 IEEE.

关键词： Taxonomies

来源：评论

学校读者我要写书评

暂无评论

Analysis of converting -circuit into -circuit

引用

EPJ Quantum Technology 2025年第1期12卷 1-14页

作者： Luo, Qing-bin Ding, Lang Yang, Guo-wu Li, Xiao-yu College of Intelligent Systems Science and Engineering Hubei Minzu University Enshi China School of Information and Software Engineering University of Electronic Science and Technology of China Chengdu China Big data research Center & School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China

A $\mathfrak{C^{*}}$ -circuit, which was proposed in Asiacypt 2022 by Huang and Sun (Advances in cryptology – ASIACRYPT 2022, pp. 614–644, 2022), can directly perform calculations with the existing quantum states, thereby reducing the use of quantum resources in quantum logic synthesis. We theoretically prove how to convert a $\mathfrak{C^{0}}$ -circuit into the corresponding $\mathfrak{C^{*}}$ -circuit through two lemmas and one theorem. The first lemma proves the interchangeability of CNOT gates and NOT gates by using the equivalence of quantum circuits. The second lemma proves that adding CNOT gates to the front of a quantum circuit whose initial states are all $|0\rangle $ s will not change the output states of the circuit. The theorem is used to describe what kind of $\mathfrak{C^{0}}$ -circuit can be transformed into $\mathfrak{C^{*}}$ -circuit, and the correctness of this transformation is proved. Our work will provide a theoretical basis for converting $\mathfrak{C^{0}}$ -circuit to $\mathfrak{C^{*}}$ -circuit. Then applying the theoretical analysis results to the multiplication over $\text{GF}(2^{8})$ , the constructed quantum circuit needs 27 Toffoli gates and 118 CNOT gates, which is 15 fewer Toffoli gates and 43 CNOT gates than the current best result. This shows that the method of constructing quantum circuits by using the conversion of $\mathfrak{C^{0}}$ -circuit to $\mathfrak{C^{*}}$ -circuit is very efficient.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Time series classification based on Unet with 2D transformation

Time series classification based on Unet with 2D transformat...

引用

International Conference on Identification, information and Knowledge in the Internet of Things (IIKI)

作者： Mingsen Du Yunxia Wang Yanxuan Wei Xiaona Wu Cun Ji School of Information Science and Engineering Shandong Normal University Jinan China Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology Jinan China

ISBN: (数字)9798331510633

ISBN: (纸本)9798331510640

Time series classification has gained significant attention in the data mining field in recent years. Despite the proposal of numerous methods over the past decades, most of these approaches focus on feature extraction in one-dimensional space, which often results in lower classification accuracy. To address this issue, this paper proposes a Time Series Classification method based on U-Net with 2D transformation (TSC-Unet). This method first transforms univariate time series into 2D space and augments the data, effectively enhancing the diversity of the dataset. Subsequently, features are extracted from the 2D space using a fully convolutional network, fully exploiting multi-scale feature information. U-Netwith skip connections, effectively retains and transmits high-resolution features, significantly reducing information loss and improving segmentation performance. Additionally, the ability to learn multi-scale features enables the model to capture details at different levels, thereby enhancing its understanding of complex data. Experimental results demonstrate that TSC-Unet achieves high classification accuracy on the UCR datasets, validating the effectiveness and superiority of the proposed method.

关键词： Accuracy Time series analysis Transforms Feature extraction Propagation losses Data models Data mining Convolutional neural networks Proposals Internet of Things

来源：评论

学校读者我要写书评

暂无评论

Control of Multipath Transmissions in the Nodes of Switching Segments of Reserved Paths 6

Control of Multipath Transmissions in the Nodes of Switching...

引用

6th International Scientific Conference on information, Control, and Communication Technologies, ICCT 2022

作者： Bogatyrev, Vladimir A. Bogatyrev, Stanislav V. Bogatyrev, Anatoly V. Saint-Petersburg State University of Aerospace Instrumentation Department Information Systems Security Saint Petersburg Russia Itmo University Faculty of Software Engineering and Computer Systems Saint Petersburg Russia Yadro Cloud Storage Development Center Saint Petersburg Russia

ISBN: (数字)9781665493673

ISBN: (纸本)9781665493673

The options for ensuring timely delivery of packages to the addressee in networks with duplication of communication paths with the addressee for some subscribers are analyzed. Connecting subscribers to two communication routes with the addressee allows you to load-balance routes and carry out duplicated transmissions aimed at increasing the probability of delivering at least one copy of the transmitted packet in the required time. The possibilities of using route switch nodes for traffic management and replication of transmitted packets are analyzed. At the same time, two variants of duplicated transmissions are considered. For the first option, new replicas and ways of their transmission to the addressee are formed in one of the nodes connecting the existing paths by the first accepted replica. The replica coming in second is destroyed. For the second option, changing the transmission paths of replicas generated from the source in the nodes linking the paths is not carried out. The area of effectiveness of the proposed variants of duplicated transmissions is shown. The influence of the location of route switches on the timeliness of package delivery from subscribers connected to one or two communication paths with the addressee is investigated. The existence of an optimal arrangement of route switches is shown. © 2022 IEEE.

关键词： Real time control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：