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

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

来源：评论

学校读者我要写书评

暂无评论

Clause-level Relationship-aware Math Word Problems Solver

引用

Machine Intelligence Research 2022年第5期19卷 425-438页

作者： Chang-Yang Wu Xin Lin Zhen-Ya Huang Yu Yin Jia-Yu Liu Qi Liu Gang Zhou Anhui Province Key Laboratory of Big Data Analysis and Application School of Data ScienceUniversity of Science and Technology of ChinaHefei 230026China Institute of Artificial Intelligence Hefei Comprehensive National Science CenterHefei 230088China Laboratory of Mathematical Engineering and Advanced Computing Information Engineering UniversityZhengzhou 450001China

Automatically solving math word problems,which involves comprehension,cognition,and reasoning,is a crucial issue in artificial intelligence *** math word problem solvers mainly work on word-level relationship extraction and the generation of expression solutions while lacking consideration of the clause-level *** this end,inspired by the theory of two levels of process in comprehension,we propose a novel clause-level relationship-aware math solver(CLRSolver)to mimic the process of human comprehension from lower level to higher ***,in the lower-level processes,we split problems into clauses according to their natural division and learn their *** the higher-level processes,following human′s multi-view understanding of clause-level relationships,we first apply a CNN-based module to learn the dependency relationships between clauses from word relevance in a local ***,we propose two novel relationship-aware mechanisms to learn dependency relationships from the clause semantics in a global ***,we enhance the representation of clauses based on the learned clause-level dependency *** expression generation,we develop a tree-based decoder to generate the mathematical *** conduct extensive experiments on two datasets,where the results demonstrate the superiority of our framework.

关键词： Artificial intelligence(AI) artificial neural network(ANN) computational mathematics machine intelligence machine learning

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Graph Condensation for Inductive Node Representation Learning 40

Graph Condensation for Inductive Node Representation Learnin...

引用

40th IEEE International Conference on data engineering, ICDE 2024

作者： Gao, Xinyi Chen, Tong Zang, Yilong Zhang, Wentao Hung Nguyen, Quoc Viet Zheng, Kai Yin, Hongzhi The University of Queensland Brisbane Australia Kaiserslautern Germany Peking University Beijing China National Engineering Laboratory for Big Data Analysis and Applications Beijing China Griffith University Gold Coast Australia University of Electronic Science and Technology of China Chengdu China

ISBN: (纸本)9798350317152

Graph neural networks (GNNs) encounter significant computational challenges when handling large-scale graphs, which severely restricts their efficacy across diverse applications. To address this limitation, graph condensation has emerged as a promising technique, which constructs a small synthetic graph for efficiently training GNNs while retaining performance. However, due to the topology structure among nodes, graph condensation is limited to condensing only the observed training nodes and their corresponding structure, thus lacking the ability to effectively handle the unseen data. Consequently, the original large graph is still required in the inference stage to perform message passing to inductive nodes, resulting in substantial computational demands. To overcome this issue, we propose mapping-aware graph condensation (MCond), explicitly learning the one-to-many node mapping from original nodes to synthetic nodes to seamlessly integrate new nodes into the synthetic graph for inductive representation learning. This enables direct information propagation on the synthetic graph, which is much more efficient than on the original large graph. Specifically, MCond employs an alternating optimization scheme with innovative loss terms from transductive and inductive perspectives, facilitating the mutual promotion between graph condensation and node mapping learning. Extensive experiments demonstrate the efficacy of our approach in inductive inference. On the Reddit dataset, MCond achieves up to 121.5× inference speedup and 55.9× reduction in storage requirements compared with counterparts based on the original graph. © 2024 IEEE.

关键词： Condensation

来源：评论

学校读者我要写书评

暂无评论

Image Recognition of Concrete Electromagnetic Flaw Detection Based on Improved YOLOv7 24

Image Recognition of Concrete Electromagnetic Flaw Detection...

引用

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

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

ISBN: (纸本)9798400716720

Owing to the invisibility characteristics of the interiors of concrete structures, nondestructive testing technologies are commonly employed to detect internal damage. Electromagnetic flaw detection technology, as a prominent nondestructive testing method, offers capabilities of strong penetration and precise imaging. However, the output images produced by this detection technology are usually reliant on subjective human judgment, and existing automatic detection algorithms have limitations in terms of accuracy. To enhance the accuracy of electromagnetic flaw detection images, this paper proposes improved YOLOv7 based detection method. First of all, the ACBlock convolution module is introduced to replace the original 3×3 convolution kernel for alleviating the loss of edge feature information caused by the sampling operation of the backbone network MP module. Next, in order to have more focus on the semantic features of small targets, a global attention mechanism (GAMAttention) is incorporated into the algorithm. Then, the FReLU activation function is adopted to enhance the algorithm sensitivity to image space. Finally, experiments are conducted on a self-created concrete flaw detection image dataset to illustrate the efficiency of the proposed algorithm. The results show that the mean Average Precision (mAP) value achieved by the improved algorithm is 95.85%. which has a significant improvement of 13.89% in comparison with the pre-improved YOLOv7 algorithm and surpasses other algorithms in the same domain. These findings represent that the proposed algorithm effectively enhances the accuracy of concrete electromagnetic flaw detection image detection. © 2024 ACM.

关键词： Nondestructive examination

来源：评论

学校读者我要写书评

暂无评论

Understanding transitions in animated bar charts

引用

Visual Intelligence 2023年第1期1卷 1-15页

作者： Wei, Datong Liu, Can Zhang, Xiaolong Yuan, Xiaoru Key Laboratory of Machine Perception (Ministry of Education) and the School of Intelligence Science and Technology Peking University Beijing China College of Information Sciences and Technology Pennsylvania State University University Park United States National Engineering Laboratory for Big Data Analysis and Application Peking University Beijing China

Animated bar charts have gained popularity on the Internet for their ability to display historical rankings through smooth animated transitions that clearly show the rankings over time. To investigate the usage scenarios of these charts, we analyzed the pop-up comments to understand viewers’ focus. Our findings suggest that animated transitions play a key role in viewers’ perception of ranking changes. We summarized various transition methods and evaluated their impact on user perception and memory through user experiments. We also conducted a detailed analysis of each transition method’s implementation. Our research sheds light on the effectiveness of different transition strategies for animated bar charts. © The Author(s) 2023.

关键词： Animation Quantitative evaluation Transition Visualization for the masses

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：