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

arXiv 2024年

作者： Liu, Chanjuan Ge, Shike Chen, Zhihan Pei, Wenbin Zhu, Enqiang Mei, Yi Ishibuchi, Hisao The School of Computer Science and Technology Dalian University of Technology 116024 China The Institute of Software Chinese Academy of Science Beijing100190 China The Institute of Computing Science and Technology Guangzhou University Guangzhou510006 China The School of Engineering and Computer Science Victoria University of Wellington Wellington6012 New Zealand The Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent Computation Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen518055 China

The Critical Node Problem (CNP) is concerned with identifying the critical nodes in a complex network. These nodes play a significant role in maintaining the connectivity of the network, and removing them can negatively impact network performance. CNP has been studied extensively due to its numerous real-world applications. Among the different versions of CNP, CNP-1a has gained the most popularity. The primary objective of CNP-1a is to minimize the pair-wise connectivity in the remaining network after deleting a limited number of nodes from a network. Due to the NP-hard nature of CNP-1a, many heuristic/metaheuristic algorithms have been proposed to solve this problem. However, most existing algorithms start with a random initialization, leading to a high cost of obtaining an optimal solution. To improve the efficiency of solving CNP-1a, a knowledge-guided genetic algorithm named K2GA has been proposed. Unlike the standard genetic algorithm framework, K2GA has two main components: a pretrained neural network to obtain prior knowledge on possible critical nodes, and a hybrid genetic algorithm with local search for finding an optimal set of critical nodes based on the knowledge given by the trained neural network. The local search process utilizes a cut node-based greedy strategy. The effectiveness of the proposed knowledge-guided genetic algorithm is verified by experiments on 26 real-world instances of complex networks. Experimental results show that K2GA outperforms the state-of-the-art algorithms regarding the best, median, and average objective values, and improves the best upper bounds on the best objective values for eight real-world instances. Copyright © 2024, The Authors. All rights reserved.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

CLDG: Contrastive Learning on Dynamic Graphs 39

CLDG: Contrastive Learning on Dynamic Graphs

引用

39th IEEE International Conference on Data Engineering, ICDE 2023

作者： Xu, Yiming Shi, Bin Ma, Teng Dong, Bo Zhou, Haoyi Zheng, Qinghua Xi'an Jiaotong University Department of Computer Science and Technology China Xi'an Jiaotong University Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering China Xi'an Jiaotong University Department of Distance Education China Beihang University School of Software China Beihang University Advanced Innovation Center for Big Data and Brain Computing China

ISBN: (纸本)9798350322279

The graph with complex annotations is the most potent data type, whose constantly evolving motivates further exploration of the unsupervised dynamic graph representation. One of the representative paradigms is graph contrastive learning. It constructs self-supervised signals by maximizing the mutual information between the statistic graph's augmentation views. However, the semantics and labels may change within the augmentation process, causing a significant performance drop in downstream tasks. This drawback becomes greatly magnified on dynamic graphs. To address this problem, we designed a simple yet effective framework named CLDG. Firstly, we elaborate that dynamic graphs have temporal translation invariance at different levels. Then, we proposed a sampling layer to extract the temporally-persistent signals. It will encourage the node to maintain consistent local and global representations, i.e., temporal translation invariance under the timespan views. The extensive experiments demonstrate the effectiveness and efficiency of the method on seven datasets by outperforming eight unsupervised state-of-the-art baselines and showing competitiveness against four semi-supervised methods. Compared with the existing dynamic graph method, the number of model parameters and training time is reduced by an average of 2,001.86 times and 130.31 times on seven datasets, respectively. The code and data are available at: https://***/yimingxu24/CLDG. © 2023 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

INNSE: Invertible neural network-based DNA image storage with self-correction encoding

引用

Computational and Structural Biotechnology Journal 2025年 27卷 2492-2502页

作者： Yanfen Zheng Xiaokang Zhang Lijun Sun Ben Cao Bin Wang Qiang Zhang Pan Zheng School of Computer Science and Technology Dalian University of Technology Dalian Liaoning 116024 China The Key Laboratory of Advanced Design and Intelligent Computing Ministry of Education School of Software Engineering Dalian University Dalian Liaoning 116622 China Department of Accounting and Information Systems University of Canterbury Upper Riccarton Christchurch 8140 New Zealand

DNA storage has become an alternative to silicon-based storage of media. However, when used to store multimodal data such as images, it fails to take full advantage of the characteristics of high correlation and variability present in such data, and currently remains inferior in terms of encoding density and time complexity. It also has the shortcoming of weak performance in terms of error correction methods to address insertion and deletion errors caused by error crosstalk. Therefore, we proposed an invertible neural network-based DNA image storage self-correction encoding method (INNSE) that uses the invertibility of network to perform up-down sampling processing on image and video data, thereby greatly reducing the number of DNA sequences required for data storage. A codebook generator was then designed to encode low-dimensional vectors into DNA sequences that meet various constraints. Finally, a self-correction method was constructed to achieve DNA sequence error correction at the base level without adding any redundant information. Our experimental results showed that, compared to the Yin-Yang algorithm, the encoding density of INNSE was increased by 3×, encoding time complexity was reduced by 95.26%. Under a simulated error rate of 2%, PSNR and SSIM were raised by 80.88% and 63.82%, respectively, proving that INNSE has significant advantages in encoding performance and error correction ability.

关键词： Codebook generator DNA storage Invertible neural network Self-correction

来源：评论

学校读者我要写书评

暂无评论

The Dataflow Runtime Environment of DFC 1

引用

21st International Conference on Parallel and Distributed Computing, Applications, and Technologies, PDCAT 2020

作者： Zhang, Jing Li, Jinrong Du, Zheng Shu, Jiwu Luo, Qiuming NHPCC/Guangdong Key Laboratory of Popular HPC College of Computer Science and Software Engineering Shenzhen University Shenzhen China Department of Computer Science and Technology Tsinghua University Beijing China

ISBN: (数字)9783030692445

ISBN: (纸本)9783030692438

In this paper, we introduce the DFC dataflow language and its runtime environment. DFC runtime library is in charge of constructing the DAG of the dataflow graph, firing the DFC tasks and the synchronizations between the tasks of successive passes. Basing on an elaborately implemented thread pool and queued Active Data, DFC runtime shows an ideal performance comparing with DSPatch. The experiment of a simple dataflow graph shows that DFC has better performance for the cases that the parallelism beneath the core number, while DSPatch shows a better scalability for the cases of the parallelism exceed the core number. As DFC is still a prototype language, it lacks the ability to construct the DAG dynamically, which leads to low efficiency when coding for a well-structured dataflow graph. © 2021, Springer Nature Switzerland AG.

关键词： Data flow analysis

来源：评论

学校读者我要写书评

暂无评论

Analysis and Design of Mobile Model for DTN

引用

Chinese Journal of Electronics 2023年第4期18卷 635-638页

作者： Zhiting Lin Yugui Qu Yusheng Ji Baohua Zhao Department of Computer Science University of Science and Technology of China Hefei China Province Key Laboratory of Software in Computing and Communication Hefei China Information Systems Architecture Science Research Division National Institute of Informatics Tokyo Japan

Delay tolerant networks may become unexpectedly partitioned due to node mobility or variation in signal strength. However, most widely used models in some relative works are generally very simplistic. In order to exploit intelligent forwarding algorithms, a novel nodal mobile model of delay tolerant networks is presented to map reality with more accuracy. And several approaches are introduced to analyze the network structure, such as n-cliques, n-clans, degree, closeness and betweenness. Our research results showed that the centralizations became smaller when the wireless connections were concerned. It meant that quite a number of nodes became potential relays because of the new structure of networks.

关键词： Wireless communication Analytical models Wireless sensor networks Protocols Social networking (online) Sensitivity analysis Social network theory

来源：评论

学校读者我要写书评

暂无评论

Attribute-Specific Manipulation Based on Layer-Wise Channels

arXiv

引用

arXiv 2023年

作者： Yan, Yuanjie Zhao, Jian Shen, Furao State Key Laboratory for Novel Software Technology Nanjing University China Department of Computer Science and Technology Nanjing University China School of Electronic Science and Engineering Nanjing University Nanjing China School of Artificial Intelligence Nanjing University Nanjing China

Image manipulation on the latent space of the pre-trained StyleGAN can control the semantic attributes of the generated images. Recently, some studies have focused on detecting channels with specific properties to directly manipulate the latent code, which is limited by the entanglement of the latent space. To detect the attribute-specific channels, we propose a novel detection method in the context of pre-trained classifiers. We analyse the gradients layer by layer on the style space. The intensities of the gradients indicate the channel’s responses to specific attributes. The latent style codes of channels control separate attributes in the layers. We choose channels with the top-k gradients to control specific attributes in the maximum response layer. We implement single-channel and multi-channel manipulations with a certain attribute. Our methods can accurately detect relevant channels for a large number of face attributes. Extensive qualitative and quantitative results demonstrate that the proposed methods outperform state-of-the-art methods in generalization and scalability. © 2023, CC BY.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Isogeometric analysis based on geometric reconstruction models

引用

Frontiers of Mechanical Engineering 2021年第4期16卷 782-797页

作者： Yingjun WANG Liang GAO Jinping QU Zhaohui XIA Xiaowei DENG National Engineering Research Center of Novel Equipment for Polymer Processing The Key Laboratory of Polymer Processing Engineering of the Ministry of EducationGuangdong Provincial Key Laboratory of Technique and Equipment for Macromolecular Advanced ManufacturingSouth China University of TechnologyGuangzhou 510641China State Key Laboratory of Digital Manufacturing Equipment and Technology Huazhong University of Science and TechnologyWuhan 430074China National Enterprise Information Software Engineering Research Center School of Mechanical Science and EngineeringHuazhong University of Science and TechnologyWuhan 430074China Department of Civil Engineering The University of Hong KongHong KongChina

In isogeometric analysis(IGA),the boundary representation of computer-aided design(CAD)and the tensor-product non-uniform rational B-spline structure make the analysis of three-dimensional(3D)problems with irregular geometries *** this paper,an IGA method for complex models is presented by reconstructing analysis-suitable *** CAD model is represented by boundary polygons or point cloud and is embedded into a regular background grid,and a model reconstruction method is proposed to obtain the level set function of the approximate model,which can be directly used in *** 3D examples are used to test the proposed method,and the results demonstrate that the proposed method can deal with complex engineering parts reconstructed by boundary polygons or point clouds.

关键词： isogeometric analysis reconstruction model level set function trimmed element point cloud

来源：评论

学校读者我要写书评

暂无评论

The Compiler of DFC: A Source Code Converter that Transform the Dataflow Code to the Multi-threaded C Code 1

引用

21st International Conference on Parallel and Distributed Computing, Applications, and Technologies, PDCAT 2020

作者： Du, Zheng Zhang, Jing Li, Jinrong Du, Haixin Shu, Jiwu Luo, Qiuming Department of Computer Science and Technology Tsinghua University Beijing China NHPCC/Guangdong Key Laboratory of Popular HPC College of Computer Science and Software Engineering Shenzhen University Shenzhen China

ISBN: (数字)9783030692445

ISBN: (纸本)9783030692438

The working principle of DFC compiler is introduced in this article. DFC is a grammatical extension of standard C language, with special DF function which describe the dependence of computing DAG. DFC compiler, dfcc, is used to convert the DFC source codes to standard C codes with the assistance of multi-threaded library. The lexical rules and grammatical rules are used to setup the AST of DFC codes, and then it is converted to the AST of standard C without DF function nodes. The derived AST is printed into a text file, a normal C file, and finally is processed by GCC to obtain the executable file. The experiment gives some demonstration of that converting details, and the memory footprint is studied to show an ideal scalability. © 2021, Springer Nature Switzerland AG.

关键词： Program compilers

来源：评论

学校读者我要写书评

暂无评论

Homophily-enhanced Structure Learning for Graph Clustering

arXiv

引用

arXiv 2023年

作者： Gu, Ming Yang, Gaoming Zhou, Sheng Ma, Ning Chen, Jiawei Tan, Qiaoyu Liu, Meihan Bu, Jiajun College of Computer Science and Technology Zhejiang University China School of Software Technology Zhejiang University China Zhejiang Provincial Key Laboratory of Service Robot Zhejiang University China Department of Computer Science New York University Shanghai China

Graph clustering is a fundamental task in graph analysis, and recent advances in utilizing graph neural networks (GNNs) have shown impressive results. Despite the success of existing GNN-based graph clustering methods, they often overlook the quality of graph structure, which is inherent in real-world graphs due to their sparse and multifarious nature, leading to subpar performance. Graph structure learning allows refining the input graph by adding missing links and removing spurious connections. However, previous endeavors in graph structure learning have predominantly centered around supervised settings, and cannot be directly applied to our specific clustering tasks due to the absence of ground-truth labels. To bridge the gap, we propose a novel method called homophily-enhanced structure learning for graph clustering (HoLe). Our motivation stems from the observation that subtly enhancing the degree of homophily within the graph structure can significantly improve GNNs and clustering outcomes. To realize this objective, we develop two clustering-oriented structure learning modules, i.e., hierarchical correlation estimation and cluster-aware sparsification. The former module enables a more accurate estimation of pairwise node relationships by leveraging guidance from latent and clustering spaces, while the latter one generates a sparsified structure based on the similarity matrix and clustering assignments. Additionally, we devise a joint optimization approach alternating between training the homophily-enhanced structure learning and GNN-based clustering, thereby enforcing their reciprocal effects. Extensive experiments on seven benchmark datasets of various types and scales, across a range of clustering metrics, demonstrate the superiority of HoLe against state-of-the-art baselines. Copyright © 2023, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Predicted Robustness as QoS for Deep Neural Network Models

引用

Journal of computer science & technology 2020年第5期35卷 999-1015页

作者： Yue-Huan Wang Ze-Nan Li Jing-Wei Xu Ping Yu Taolue Chen Xiao-Xing Ma State Key Laboratory for Novel Software Technology Nanjing UniversityNanjing 210023China Department of Computer Science University of SurreyGuilfordGU27XHU.K.

The adoption of deep neural network(DNN)model as the integral part of real-world software systems necessitates explicit consideration of their quality-of-service(QoS).It is well-known that DNN models are prone to adversarial attacks,and thus it is vitally important to be aware of how robust a modeFs prediction is for a given input instance.A fragile prediction,even with high confidence,is not trustworthy in light of the possibility of adversarial *** propose that DNN models should produce a robustness value as an additional QoS indicator,along with the confidence value,for each prediction they *** approaches for robustness computation are based on adversarial searching,which are usually too expensive to be excised in real *** this paper,we propose to predict,rather than to compute,the robustness measure for each input ***,our approach inspects the output of the neurons of the target model and trains another DNN model to predict the *** focus on convolutional neural network(CNN)models in the current *** show that our approach is accurate,with only 10%-34%additional errors compared with the offline heavy-weight robustness *** also significantly outperforms some alternative *** further validate the effectiveness of the approach when it is applied to detect adversarial attacks and out-of-distribution *** approach demonstrates a better performance than,or at least is comparable to,the state-of-the-art techniques.

关键词： deep neural network quality of service robustness prediction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：