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

11th International Conference on Information science and technology, ICIST 2021

作者： Wang, Zhongqing Yang, Yan Zhong, Yingli Heilongjiang University School of Computer Science Technology Harbin China Key Laboratory of Database and Parallel Computing of Heilongjiang Province Harbin China

ISBN: (纸本)9781665412667

Graph similarity search is an important research problem in many applications, such as finding result graphs that have a similar structure to a given entity in biochemistry, data mining, and pattern recognition. Top-k graph similarity search is one of graph similarity search tasks, which aims to find the top-k graphs that are most similar to the query graph in a given graph database. In this paper, the top-k similarity search problem based on the graph edit distance is studied according to the corollary of the partitioned similarity theorem. Firstly, in order to speed up the online search process and avoid scanning each graph in the database one by one, an offline hierarchical inverted index is constructed to satisfy top-k search. Secondly, the offline hierarchical inverted index is used to filter the candidate graphs online and verify them, which reduces the time of searching the graphs. Finally, the good performance of the algorithm in running time and scalability is verified by running the similarity algorithm on real dataset and synthetic dataset. © 2021 IEEE.

关键词： Graph Databases

来源：评论

学校读者我要写书评

暂无评论

A New Feature Fusion Method Based on Pre-Training Model for Sequence Labeling

A New Feature Fusion Method Based on Pre-Training Model for ...

引用

International Conference on Data Storage and Data Engineering (DSDE)

作者： Shichuan Yu Yan Yang School of computer science and technology Heilongjiang University Harbin China Heilongjiang Key Laboratory of Database and Parallel Computing Heilongjiang University Harbin China

To fuse vocabulary features into the pre-training model is the mainstream data feature processing method for sequence labelling tasks. In general, the feature fusion methods that have been proposed at present are direct fusion outside the pre-training model or fusion of lexical features using attention mechanism. However, the study found that this way of vocabulary enhancement does not conform to the word formation rules of modern Chinese. In the Chinese language, it is easy to fuse irrelevant or even incorrect lexical features into the sequence using the above feature processing methods, which is bad for the experimental results of the Chinese sequence labelling task. To solve these problems, we propose to use Cosine Similarity Adapter to process lexical features in Chinese sequence labelling tasks. CSBERT is a hybrid model using this structure based on BERT, which conforms to the word formation rules of modern Chinese to a certain extent. It can fuse the features of the word into the character or eliminate the features of the word in the character according to the cosine similarity between the character vector and a word vector. The experimental results show that CSBERT has better ability to label Chinese sequences than the benchmark model. CSBERT has achieved the best experimental results such as F1-Score on 7 open datasets and the best ability of multi-label classification, which proves that the model has good practical value.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Signal Detection Method Based on Social Relationship Strength in Vehicular Ad-hoc Networks ⁎

引用

IFAC-PapersOnLine 2024年第10期58卷 176-181页

作者： Yi Li Shuangshuang Han Yongqiang Bai Fei-Yue Wang School of Computer and Communication Engineering University of Science and Technology Beijing Beijing China and Key Laboratory of Ocean Observation Technology MNR Tianjin China School of Computer and Communication Engineering University of Science and Technology Beijing Beijing China and Beijing Huairou Academy of Parallel Sensing Beijing China The State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing China

In the case of scarce communication resources, the importance of different vehicle communication levels is self-evident. They not only affect the efficiency of information exchange between vehicles and driving safety, but also directly affect the rational allocation and utilization of communication resources. Therefore, this paper proposes a signal detection method based on vehicle social relationship strength (SRS) in vehicular ad-hoc networks (VANETs) scenario, and integrates the SRS information into the data to be transmitted. In this method, minimum mean square error (MMSE) signal detection algorithm is selected for simulation, and Rayleigh channel and Rician channel are selected for simulation scenarios. This method makes full use of the intensity of social relationship between vehicles, and realizes the efficient transmission of data and the accurate transmission of communication level. Experimental verification shows that the method performs well in the VANETs scenario, and provides a new communication method for intelligent transportation, social network and other applications, which is expected to promote the technical progress and application development in related fields.

关键词： VANETs Social relation strength Image data transmission MMSE detection Intelligent transportation Social networking

来源：评论

学校读者我要写书评

暂无评论

Big Data-aided Study of the Physical Process of Volume Ignition 6

Big Data-aided Study of the Physical Process of Volume Ignit...

引用

2022 6th International Conference on Mechanics, Mathematics and Applied Physics, ICMMAP 2022

作者： Liu, Pan Zhou, Yinzhao Xiong, Wenbin Liu, Chencheng Liu, Jie Liu, Gongjie Tang, Zhangchun Gao, Qiang Tianfu Innovation Energy Establishment Chengdu610000 China Nuclear and Radiation Safety Center MEE Beijing100000 China Central South University of Forestry and Technology Changsha410000 China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China Beijng PARATERA Technology Corp. Ltd Beijing100000 China University of Electronic Science and Technology of China Chengdu610000 China

Volume ignition is a method of igniting a fuel as a whole by simultaneously achieving ignition conditions throughout the fuel zone. The basic criterion for ignition is that the thermonuclear energy is greater than the energy leakage at the fuel boundary, resulting in self-sustaining heating and deep combustion. Deuterium-tritium fuels are wrapped in medium to high Z media to reduce radiative leakage and achieve lower-temperature holistic ignition and non-equilibrium combustion, ultimately allowing the fuel to achieve high combustion efficiency. Volume ignition is the use of energy balance relations under the local thermodynamic equilibrium approximation to establish the energy balance equation for thermonuclear systems, and the system ignition threshold is obtained by solving this equation. By understanding the physical process, we believe that the non-equilibrium process is universal to the volume ignition process. Changes in external factors (density, boundaries, albedo, etc.) at the moment of ignition can have a significant impact on the development direction of the system, and an ignition system with a large surface density can nevertheless withstand a large amount of reverse work and continue to burn. The design of the ignition target tries to avoid these factors through margin design, but conversely, the rational use of these laws can further improve the design margin of the capsule. With the aid of big data, the volume ignition method is easier to calculate and has a shorter iteration time. The traditional way is to propose a model, set the material, and then perform the calculation while using big data can set any model and material for calculation. In this paper, a simple comparison will be made to find out that the efficiency of the physical design of a volume ignition target will be effectively improved with the aid of big data. Volume ignition targets can be used not only in Z-pinch-driven systems but also for laser-driven volume ignition. © Published un

关键词： Ignition

来源：评论

学校读者我要写书评

暂无评论

ST-PINN: A Self-Training Physics-Informed Neural Network for Partial Differential Equations

arXiv

引用

arXiv 2023年

作者： Yan, Junjun Chen, Xinhai Wang, Zhichao Zhoui, Enqiang Liu, Jie Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China Laboratory of Digitizing Software for Frontier Equipment National University of Defense Technology Changsha410073 China

Partial differential equations (PDEs) are an essential computational kernel in physics and engineering. With the advance of deep learning, physics-informed neural networks (PINNs), as a mesh-free method, have shown great potential for fast PDE solving in various applications. To address the issue of low accuracy and convergence problems of existing PINNs, we propose a self-training physics-informed neural network, ST-PINN. Specifically, ST-PINN introduces a pseudo label based self-learning algorithm during training. It employs governing equation as the pseudo-labeled evaluation index and selects the highest confidence examples from the sample points to attach the pseudo labels. To our best knowledge, we are the first to incorporate a self-training mechanism into physics-informed learning. We conduct experiments on five PDE problems in different fields and scenarios. The results demonstrate that the proposed method allows the network to learn more physical information and benefit convergence. The ST-PINN outperforms existing physics-informed neural network methods and improves the accuracy by a factor of 1.33x-2.54x. The code of ST-PINN is available at GitHub: https://***/junjun-yan/ST-PINN. Copyright © 2023, The Authors. All rights reserved.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

parallel Implementation of SHA256 on Multizone Heterogeneous Systems

Parallel Implementation of SHA256 on Multizone Heterogeneous...

引用

IEEE International Conference on Big Data and Cloud Computing (BdCloud)

作者： Yongtao Luo Jie Liu Tiaojie Xiao Chunye Gong Science and Technology on Parallel and Distributed Processing Laboratory Laboratory of Digitizing program for Frontier Equipment National University of Defense Technology Changsha China National Supercomputer Center in Tianjin Tianjin China

SHA-256 plays an important role in widely used applications, such as data security, data integrity, digital signatures, and cryptocurrencies. However, most of the current optimized implementations of SHA-256 are based on CPUs or dedicated hardware, such as ASICs and FPGAs. Consequently, there is a need to explore whether new heterogeneous parallel framework can improve the computational performance of the hash function. To address this issue, we conducted a study on the MT-3000 platform, which is a special architecture processor for the next-generation exascale prototype supercomputer. We proposed MT-SHA256, a heterogeneous multistage parallel implementation for hashing multiple messages on the MT-3000. Combining the architectural features of this processor, we developed an effective solution that significantly improved the computational performance of SHA-256. As a result, MT-SHA256 achieved a maximum throughput of 1045.68 MB/s on a single acceleration core of MT-3000. This is 9.84x higher than the C code implementation on one CPU core of MT-3000. We also performed a scalability test and found that MT-SHA256 achieved a throughput of 98.04 GB/s on a computing node, and extended to 512 nodes (2048 acceleration clusters) on this system with good scalability.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Software Component Library Management Mechanism for Equipment Parts Service Value-Net 6th

Software Component Library Management Mechanism for Equipmen...

引用

6th International Conference on Human Centered Computing, HCC 2020

作者： Tian, Zhuo Zhang, Changyou Cai, Xiaofeng Xiao, Jiaojiao Laboratory of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences Beijing China School of Computer and Communication Engineering University of Science and Technology Beijing Beijing China

ISBN: (纸本)9783030706258

Software reuse realizes the sharing of software resources, and component-based reuse is the main form of software reuse. The classification, storage, retrieval, and release of a large number of component resources require efficient component library management methods. This paper proposes an open software component library management mechanism based on microservices. Taking manufacturing product service life cycle value chain collaboration as a case, it realizes a domain-oriented microservice granularity division mechanism and forms a domain-oriented software component representation, warehousing, discovery, selection, arrangement, filing, and other compatible open software component library management mechanisms;realization of the design of an open software component management system for manufacturing product operation and maintenance reengineering value chain collaboration, The simulation verifies the open ability and management efficiency of the management mechanism. © 2021, Springer Nature Switzerland AG.

关键词： Computer software reusability

来源：评论

学校读者我要写书评

暂无评论

WBA: A Warping-based Approach to Generating Imperceptible Adversarial Examples

WBA: A Warping-based Approach to Generating Imperceptible Ad...

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Chengyao Hua Shigeng Zhang Weiping Wang Zhankai Li Jian Zhang School of Computer Science and Engineering Central South University Changsha China Science and Technology on Parallel and Distributed Processing Laboratory (PDL)

The human can easily recognize the incongruous parts of an image, for example, perturbations unrelated to the image itself, but are poor at spotting the small geometric transformations. However, in terms of the robustness of deep neural networks (DNNs), the ability to properly recognize objects with small geometric transformations is still a challenge. In this work, we investigate the problem from the perspective of adversarial attacks: does the performance of DNNs degrade even when small geometric transformations are applied to images? To this end, we propose a novel adversarial attack method, called WBA, a Warping-Based Adversarial attack method, which does not introduce information independent of the original images but manipulates the existing pixels of the images by elastic warping transformations to generate adversarial examples that are imperceptible to the human eye. At the same time, existing adversarial attacks typically generate adversarial examples by modifying pixels in the spatial domain of the image, the addition of such perturbations introduces extra information unrelated to the image itself and is easily detected by the naked eyes. We demonstrate the effectiveness of WBA by extensive experiments on commonly used datasets, including MNIST, CIFAR10, and ImageNet. The results show that WBA can quickly generate adversarial examples with the highest adversarial strength, consumes less time, and can be comparable to optimization-based adversarial attack methods in image perception evaluation metrics such as LPIPS, SSIM, and far more than gradient direction-based iterative methods.

关键词： Measurement Deep learning Privacy Image recognition Perturbation methods Neural networks Robustness

来源：评论

学校读者我要写书评

暂无评论

FedNAT: Byzantine-robust Federated Learning through Activation-based Attention Transfer

FedNAT: Byzantine-robust Federated Learning through Activati...

引用

IEEE International Conference on Data Mining Workshops (ICDM Workshops)

作者： Mengxin Wang Liming Fang Kuiqi Chen College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China Nanjing University of Aeronautics and Astronautics Shenzhen Research Institute Shenzhen China Science and Technology on Parallel and Distributed Processing Laboratory (PDL) Changsha China

Federated learning (FL) is a decentralized machine learning framework that prioritizes privacy by allowing clients to train statistical models without sharing their private data, thus eliminating the impact of data fortresses. However, the presence of Byzantine attacks, such as data poisoning and backdoor attack, threatens the robustness of FL schemes. Currently, existing mainstream defense methods are susceptible to multiple adaptive attacks, some of which even violate the privacy principle of FL. Furthermore, these defense schemes become less robust when subjected to targeted poisoning attacks with highly non-IID data distributions. In this work, we propose FedNAT, a novel Byzantine-robust FL framework for whittling away these limitations mentioned above. Specifically, FedNAT first performs a privacy-respecting attention refinement on the activation layer outputs of the local uploads. Then, the server scores the local attentions by calculating their Wasserstein distances and clusters them through the k-median algorithm for global attention aggregation, thus rejecting poisoned local attentions for untargeted attacks. After this process, the global attention is transferred to local attention through the FedNAT loss function, which erases backdoors through the distillation concept. We conduct a comprehensive experimental evaluation to demonstrate that FedNAT significantly outperforms existing robust FL schemes in defending against Byzantine poisoning attacks under both IID and highly non-IID data proportions.

关键词：

来源：评论

学校读者我要写书评

暂无评论

F3A: Fairness-Aware AI-Workloads Allocation Considering Multidimensional User Demands in JointCloud

F3A: Fairness-Aware AI-Workloads Allocation Considering Mult...

引用

IEEE International Conference on Joint Cloud Computing (JCC)

作者： Jiacheng Yang Guodong Yi Fei Gao Peichang Shi Huaimin Wang National Key Laboratory of Parallel and Distributed Processing College of Computer Science National University of Defense Technology Changsha China Xiangjiang Lab Changsha China School of Advanced Interdisciplinary Studies Hunan University Of Technology and Business Changsha China

ISBN: (数字)9798350387339

ISBN: (纸本)9798350387346

With the rapid growth of large language models, cloud computing has become an indispensable component of the AI industry. Cloud service providers(CSPs) are establishing AI data centers to service AI workloads. In the face of this surging need for AI computing power, building a connected computing environment across various clouds and forming a JointCloud presents an attractive solution. However, scheduling AI tasks across multiple AI data centers within a JointCloud environment presents a significant challenge: how to balance users’ demands while ensuring CSPs’ fairness in scheduling. Existing research primarily focuses on optimizing scheduling quality with limited consideration for fairness. Therefore, this paper proposes a Fairness-Aware AI-Workloads Allocation method (F3A), a fair cross-cloud allocation technique for AI tasks. F3A utilizes Point and Token to reflect both the resource status and historical task allocations of AI data centers, enabling the consideration of users’ multidimensional demands and facilitating fair task allocation across multiple centers. In order to better assess the fairness of scheduling, we also devised a fairness indicator(FI), based on the Gini coefficient to measure the fairness of task allocation. The experimental results demonstrate that F3A consistently maintains FI within 0.1 across various cluster sizes and different task quantities, representing an improvement of 76.45% compared to classical fair scheduling algorithms round-robin. F3A exhibits commendable performance in ensuring fairness in task allocation while also demonstrating effectiveness in cost reduction and enhancing user satisfaction.

关键词： Industries Data centers Cloud computing Job shop scheduling Costs Scheduling algorithms Large language models

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：