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

A method for correcting characteristic X-ray net peak count from drifted shadow peak

Nuclear Science and Techniques 2023年第11期34卷 155-167页

作者： Lin Tang Xing‑Ke Ma Kai‑Bo Shi Yeng‑Chai Soh Hong‑Tao Shen College of Electronic Information and Electrical Engineering Chengdu UniversityChengdu 610106China Guangxi Key Laboratory of Nuclear Physics and Nuclear Technology Guangxi Normal UniversityGuilin 541004China National Engineering Research Center for Agro-Ecological Big Data Analysis and Application Anhui UniversityHefei 230039China School of Electrical and Electronic Engineering Nanyang Technological UniversitySingapore 639798Singapore College of Nuclear Technology and Automation Engineering Chengdu University of TechnologyChengdu 610059China

To correct spectral peak drift and obtain more reliable net counts,this study proposes a long short-term memory(LSTM)model fused with a convolutional neural network(CNN)to accurately estimate the relevant parameters of a nuclear pulse signal by learning of samples.A predefined mathematical model was used to train the CNN-LSTM model and generate a dataset composed of distorted pulse *** trained model was validated using simulated *** relative errors in the amplitude estimation of pulse sequences with different degrees of distortion were obtained using triangular shaping,CNN-LSTM,and LSTM *** a result,for severely distorted pulses,the relative error of the CNN-LSTM model in estimating the pulse parameters was reduced by 14.35%compared with that of the triangular shaping *** slightly distorted pulses,the relative error of the CNN-LSTM model was reduced by 0.33%compared with that of the triangular shaping *** model was then evaluated considering two performance indicators,the correction ratio and the efficiency ratio,which represent the proportion of the increase in peak area of the two characteristic peak regions of interest(ROIs)to the peak area of the corrected characteristic peak ROI and the proportion of the increase in peak area of the two characteristic peak ROIs to the peak areas of the two shadow peak ROI,*** measurement results of the iron ore samples indicate that approximately 86.27%of the decreased peak area of the shadow peak ROI was corrected to the characteristic peak ROI,and the proportion of the corrected peak area to the peak area of the characteristic peak ROI was approximately 1.72%.The proposed CNN-LSTM model can be applied to X-ray energy spectrum correction,which is of great significance for X-ray spectroscopy and elemental content analyses.

关键词： Peak correction Triangular shaping Deep learning Long short-term memory Convolutional neural network X-ray fluorescence spectroscopy Silicon drift detector

来源：评论

学校读者我要写书评

暂无评论

Improved Demonstration-Knowledge Utilization in Reinforcement Learning

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第5期5卷 2139-2150页

作者： Liu, Yanyu Zeng, Yifeng Ma, Biyang Pan, Yinghui Gao, Huifan Zhang, Yuting Xiamen University Xiamen Key Laboratory of Big Data Intelligent Analysis and Decision Department of Automation Xiamen361102 China Northumbria University Department of Computer and Information Sciences NewcastleNE1 8ST United Kingdom Minnan Normal University Department of Computer Science Zhangzhou363000 China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China

Reinforcement learning (RL) has made great success in recent years. Generally, the learning process requires a huge amount of interaction with the environment before an agent can achieve acceptable performance. This motivates many techniques, such as incorporating prior knowledge which is usually presented as experts' demonstration, and using a probability distribution to represent state-and-action values, to accelerate the learning process. The methods perform well when the prior knowledge is genuinely correct and no much change occurs to the learning environment. However, the requirement is not perfectly realistic in many complex applications. The demonstration knowledge may not reflect the true environment and even be full of noise. In this article, we introduce a dynamic distribution merging method to improve knowledge utilization in a general RL algorithm, namely Q-learning. The new method adapts a normal distribution to represent state-action values and merges the prior and learned knowledge in a discriminative way. We theoretically analyze the new learning method and demonstrate its empirical performance over multiple problem domains. © 2020 IEEE.

关键词： Merging

来源：评论

学校读者我要写书评

暂无评论

Framework for Fuzzy Temporal Association Rule Mining Based on Density Clustering Optimization 9

Framework for Fuzzy Temporal Association Rule Mining Based o...

引用

9th International Conference on Intelligent Computing and Signal Processing, ICSP 2024

作者： Cao, Yang Ma, Pengzhi Shenyang China Liaoning Province Big Data Management and Analysis Laboratory of Urban Construction Shenyang China Shenyang Branch of National Special Computer Engineering Technology Research Center Shenyang China

ISBN: (纸本)9798350376548

This paper proposes a framework for fuzzy temporal association rule mining based on density clustering optimization, aimed at improving the fuzzification of continuous attributes and enhancing the efficiency of mining temporal association rules. The first part of the framework effectively handles continuous attribute data and reduces data redundancy by adopting a density peak clustering algorithm and designing an optimized membership function. The second part introduces a fuzzy list ranking structure combined with item lifespan to mine fuzzy temporal association rules. Experimental results demonstrate that the framework exhibits superior performance in mining fuzzy temporal association rules and outperforms advanced algorithms in handling continuous attributes. © 2024 IEEE.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

ABC-DE hybrid evolutionary algorithm based on individual preference population selection 5

ABC-DE hybrid evolutionary algorithm based on individual pre...

引用

5th International Conference on Computer Communication and Network Security, CCNS 2024

作者： Song, XiaoYu Li, Wen Zhao, Ming Shenyang China Liaoning Province Big Data Management and Analysis Laboratory of Urban Construction Shenyang China Shenyang Branch of National Special Computer Engineering Technology Research Center Shenyang China

ISBN: (纸本)9781510681842

To fully leverage the complementary advantages of the Artificial Bee Colony (ABC) and Differential Evolution (DE) algorithms for various optimization problems, this paper introduces an ABC-DE hybrid evolutionary algorithm based on individual preference for population selection. This method divides the population into subpopulations using a preference-based selection mechanism and employs ABC and DE for diverse subpopulation search strategies. Additionally, it implements a new resource allocation mechanism that increases computational efforts for promising solutions. Comparative analysis on the CEC2014 benchmark suite with five other current ABC and DE improved algorithms confirms that the proposed hybrid evolutionary algorithm effectively enhances convergence speed, accuracy, and robustness. © 2024 SPIE.

关键词： Evolutionary algorithms Chromium Analytical research Mathematical optimization Evolutionary optimization Statistical analysis algorithm development Chemical elements Lithium Reflection

来源：评论

学校读者我要写书评

暂无评论

Wind-Bell Index: Towards Ultra-Fast Edge Query for Graph databases 39

Wind-Bell Index: Towards Ultra-Fast Edge Query for Graph Dat...

引用

39th IEEE International Conference on data engineering, ICDE 2023

作者： Qiu, Rui Ming, Yi Hong, Yisen Li, Haoyu Yang, Tong Peking University School of Computer Science National Engineering Laboratory for Big Data Analysis Technology and Application Beijing China Peking University Academy for Advanced Interdisciplinary Studies China Peng Cheng Laboratory Shenzhen China

ISBN: (纸本)9798350322279

Graphs are good at presenting relational and structural information, making it powerful in the representation of various data. For the efficient storage and processing of graph-like data, graph databases have been rapidly developed and extensively studied. However, graph databases mostly use adjacency lists as their basic data structure (e.g., Neo4j), which could result in poor performance of edge due to the skewed degree distribution of *** design the Wind-Bell Index to address this problem. Wind-Bell Index is a memory-efficient index data structure, which can be attached to existing graph databases to speed up the edge. We have fully implemented our data structure in Neo4j, the most popular graph database today, and conduct theoretical and experimental analysis to evaluate the performance. Theoretical results prove the high query efficiency of our algorithm. And experimental results show that the average edge query speed is increased by hundreds of times compared with the original query interface of Neo4j. We believe that the excellent performance and scalability of Wind-Bell Index make it suitable for the application in a variety of graph databases. © 2023 IEEE.

关键词： Graph databases

来源：评论

学校读者我要写书评

暂无评论

A Framework for Multiclass Contour Visualization

引用

IEEE Transactions on Visualization and Computer Graphics 2023年第1期29卷 353-362页

作者： Li, Sihang Yu, Jiacheng Li, Mingxuan Liu, Le Zhang, Xiaolong Luke Yuan, Xiaoru Laboratory of Machine Perception Ministry of Education School of AI Peking University China Center for Data Science Academy for Advanced Interdisciplinary Studies Peking University China National Engineering Laboratory for Big Data Analysis and Application Peking University China School of Computer Science Northwestern Polytechnical University China College of Information Sciences and Technology Pennsylvania State University United States

Multiclass contour visualization is often used to interpret complex data attributes in such fields as weather forecasting, computational fluid dynamics, and artificial intelligence. However, effective and accurate representations of underlying data patterns and correlations can be challenging in multiclass contour visualization, primarily due to the inevitable visual cluttering and occlusions when the number of classes is significant. To address this issue, visualization design must carefully choose design parameters to make visualization more comprehensible. With this goal in mind, we proposed a framework for multiclass contour visualization. The framework has two components: a set of four visualization design parameters, which are developed based on an extensive review of literature on contour visualization, and a declarative domain-specific language (DSL) for creating multiclass contour rendering, which enables a fast exploration of those design parameters. A task-oriented user study was conducted to assess how those design parameters affect users' interpretations of real-world data. The study results offered some suggestions on the value choices of design parameters in multiclass contour visualization. © 2022 IEEE.

关键词： data visualization

来源：评论

学校读者我要写书评

暂无评论

Research on traffic vehicle target detection method based on improved YOLOv7 24

Research on traffic vehicle target detection method based on...

引用

7th International Conference on Image and Graphics Processing, ICIGP 2024

作者： Zhang, Feng Sun, Quan Yuan, Shuai School of Electrical and Control Engineering Shenyang Jianzhu University China Liaoning Province Big Data Management and Analysis Laboratory of Urban Construction Shenyang Branch of National Special Computer Engineering Technology Research Center China

ISBN: (纸本)9798400716720

With the increase in the number of vehicles in our country, traffic accidents have become frequent. The real-time detection of dense traffic vehicles is particularly important, which can promote the development of autonomous driving and lay a good foundation for intelligent transportation. Aiming at the problems such as high vehicle overlap rate, high small target missing rate and poor real-time detection in traffic vehicle data set, a traffic vehicle target detection method based on improved YOLOv7 was proposed. Firstly, the neck network structure of the original YOLOv7 is lightweight and introduced into the GhostSlimPAN paradigm structure to reduce the number of model parameters and operation cost, and improve the accuracy of detection of small target vehicles. Then, the original loss function CIoU is improved to replusion loss function to reduce the missed and false detection rate caused by mutual occlusion between vehicles. In order to verify the effect of the improved model, the vehicle dataset was selected for testing and verification. The experimental results show that compared with the original YOLOv7 algorithm, the mAP@0.5 of the improved YOLOv7 algorithm on this dataset reaches 88.2%, which is 1.8% higher than that of the benchmark network. The improved algorithm can be applied to vehicle target detection in daily environment, providing key technical support for intelligent transportation and autonomous driving. © 2024 ACM.

关键词： Autonomous vehicles

来源：评论

学校读者我要写书评

暂无评论

KVSAgg: Secure Aggregation of Distributed Key-Value Sets 39

KVSAgg: Secure Aggregation of Distributed Key-Value Sets

引用

39th IEEE International Conference on data engineering, ICDE 2023

作者： Wu, Yuhan Dong, Siyuan Zhou, Yi Zhao, Yikai Fu, Fangcheng Yang, Tong Niu, Chaoyue Wu, Fan Cui, Bin Peking University School of Computer Science National Engineering Laboratory for Big Data Analysis Technology and Application Beijing China Peng Cheng Laboratory Shenzhen China Shanghai Jiao Tong University Department of Computer Science and Engineering Shanghai China

ISBN: (纸本)9798350322279

In global data analysis, the central server needs the global statistic of the user data stored in local clients. In such cases, an Honest-but-Curious central server might put user privacy at risk in trying to collect individual statistics of each user. In response, the secure aggregation provides a solution for calculating global statistics without revealing users' privacy data. However, existing secure aggregation protocols only focus on the data in the form of vectors or common sets, which limits their application scope. We formalize a general problem - key-value set secure aggregation - that not only includes secure vector aggregation and private set union but also supports more applications. To address the proposed problem, we devise our solution (called the KVSAgg framework) that promises satisfactory performance in security, efficiency, and accuracy. Our key technique is a homomorphic transform algorithm (called HyperIBLT) that is not only capable of bidirectionally transforming data between key-value sets and vectors, but also able to transform sum operation of sets to addition of vectors. We implement KVSAgg on both CPU and GPU platforms and perform the evaluation on three use cases including federated learning, distributed data counting, and finding global hot items. Compared with our baselines, KVSAgg simultaneously achieves the best security, efficiency higher by orders of magnitude, and zero-error in nearly all cases. All codes are open-source anonymously. © 2023 IEEE.

关键词： Vectors

来源：评论

学校读者我要写书评

暂无评论

A Graph Sequence Generator and Multi-head Self-attention Mechanism based Knowledge Graph Reasoning Architecture 26

A Graph Sequence Generator and Multi-head Self-attention Mec...

引用

26th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2023

作者： Wu, Yuejia Zhou, Jian-Tao College of Computer Science Inner Mongolia University Hohhot China National & Local Joint Engineering Research Center Intelligent Info. Proc. Technology for Mongolian Engineering Research Center of Ecological Big Data Ministry of Education Hohhot China Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing Hohhot China Inner Mongolia Key Laboratory of Discipline Inspection and Supervision Big Data Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Hohhot China

ISBN: (纸本)9798350331684

Knowledge Graph (KG) is an essential research direction that involves storing and managing knowledge data, but its incompleteness and sparsity hinder its development in various applications. Knowledge Graph Reasoning (KGR) is an effective method to solve this limitation via reasoning missing knowledge based on existing knowledge. The graph Convolution Network (GCN) based method is one of the state-of-the-art approaches to this work. However, there are still some problems, such as the insufficient ability to perceive graph structure and the poor effect of learning data features which may limit the reasoning accuracy. This paper proposes a KGR architecture based on a graph sequence generator and multi-head self-attention mechanism, named GaM-KGR, to improve the above problems and enhance prediction accuracy. Specifically, the GaM-KGR first introduces the graph generation model into the field of KGR for graph representation learning to obtain the hidden features in the data so that enhancing the reasoning effect and then embeds the generated graph sequence into the multi-head self-attention mechanism for subsequent processing to improve the graph structure perception ability of the proposed architecture, so that it can process the graph structure data more appropriately. Extensive experimental results show that the GaM-KGR architecture can achieve the state-of-the-art prediction results of current GCN-based models. © 2023 IEEE.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

REncoder: A Space-Time Efficient Range Filter with Local Encoder 39

REncoder: A Space-Time Efficient Range Filter with Local Enc...

引用

39th IEEE International Conference on data engineering, ICDE 2023

作者： Wang, Ziwei Zhong, Zheng Guo, Jiarui Wu, Yuhan Li, Haoyu Yang, Tong Tu, Yaofeng Zhang, Huanchen Cui, Bin Peking University School of Computer Science National Engineering Laboratory for Big Data Analysis Technology and Application Beijing China Peng Cheng Laboratory Shenzhen China Zte Corporation Beijing China Tsinghua University Beijing China

ISBN: (纸本)9798350322279

A range filter is a data structure to answer range membership queries. Range queries are common in modern applications, and range filters have gained rising attention for improving the performance of range queries by ruling out empty range queries. However, state-of-the-art range filters, such as SuRF and Rosetta, suffer either high false positive rate or low throughput. In this paper, we propose a novel range filter, called REncoder. It organizes all prefixes of keys into a segment tree, and locally encodes the segment tree into a Bloom filter to accelerate queries. REncoder supports diverse workloads by adaptively choosing how many levels of the segment tree to store. We theoretically prove that the error of REncoder is bounded and derive the asymptotic space complexity under the bounded error. We conduct extensive experiments on both synthetic datasets and real datasets. The experimental results show that REncoder outperforms all state-of-the-art range filters. © 2023 IEEE.

关键词： data structures

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：