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

作者： Luo, Qiuming Liu, Senhong Huang, Jinke Li, Jinrong College of Computer Science and Software Engineering Shenzhen University Shenzhen China SKT Group Guangdong Province Key Laboratory of Popular High-Performance Computers Shenzhen China SKT Group Guangdong Province Engineering Center of China-made High Performance Data Computing System Shenzhen China

This article designs and implements a runtime library for general dataflow programming, DFCPP (Luo Q, Huang J, Li J, Du Z. Proceedings of the 52nd International Conference on Parallel Processing Workshops. ACM;2023:145-152.), and builds upon it to design and implement a multi-machine C++ dataflow library, M-DFCPP. In comparison to existing dataflow programming environments, DFCPP features a user-friendly interface and richer expressive capabilities (Luo Q, Huang J, Li J, Du Z. Proceedings of the 52nd International Conference on Parallel Processing Workshops. ACM;2023:145-152.), enabling the representation of various types of dataflow actor tasks (static, dynamic and conditional task). Besides that, DFCPP addresses the memory management and task scheduling for non-uniform memory access architectures, while other dataflow libraries lack attention to these issues. M-DFCPP extends the capability of current dataflow runtime libraries (DFCPP, taskflow, openstream, etc.) and capable of multi-machine computing, while maintains the API compatible with DFCPP. M-DFCPP adopts the concepts of master and follower (Dean J, Ghemawat S. Commun ACM. 2008;51(1):107-113;Ghemawat S, Gobioff H, Leung ST. ACM SIGOPS Operating Systems Review. ACM;2003:29-43.), which form a worksharing framework as many multi-machine system. To shift to the M-DFCPP framework, a filtering layer is inserted to the original DFCPP, transforming it into followers that can cooperate with each other. The master is made of modules for scheduling, data processing, graph partition, state management and so forth. In benchmark tests with workload with directed acyclic graph topology of binary trees and random graphs, DFCPP demonstrated performance improvements of 20% and 8%, respectively, compared to the second fastest library. M-DFCPP consistently exhibits outstanding performance across varying levels of concurrency and task workloads, achieving a maximum speedup of more than 20 over DFCPP, when the task parallelism e

关键词： Libraries

来源：评论

学校读者我要写书评

暂无评论

Lightweight Operating System Services for Incremental Checkpointing in Speculative Discrete Event Simulation on Linux Platforms

Lightweight Operating System Services for Incremental Checkp...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Federica Montesano Romolo Marotta Francesco Quaglia DICII Tor Vergata University of Rome Centro Nazionale di Ricerca in High Performance Computing Big Data e Quantum Computing

ISBN: (数字)9798331515966

ISBN: (纸本)9798331515973

One way for supporting incremental checkpointing is the exploitation of classical memory protection services—in particular the mprotect (…) system call offered by Posix compliant operating systems—for intercepting memory-writes and identifying dirty pages in the address space. However, this solution involves Inter-Processor-Interrupt (IPI) and the associated handling mechanisms, which show costs that increase when scaling up the level of parallelism in the underlying hardware architecture. For HPC contexts like speculative (aka optimistic) parallel discrete event simulation, where checkpointing and state restore massively take place in order to maintain causality among the concurrent simulation objects, these costs may impact performance in a non-negligible manner. In this work, we present the design of operating system services that enable write-protection and the tracing of dirtied pages via per CPU setup of the MMU (Memory Management Unit), completely avoiding the usage of IPI and their management. Hence, we provide a solution where the cost for setting up the incremental checkpointing support of a simulation object processed by a specific thread at a given time is definitely limited, compared to the aforementioned classical case. Our design has been devised for Linux, although it can be ported to other operating systems, and has been integrated for its testing in the USE (Ultimate Share Everything) open source parallel simulation environment.

关键词： Checkpointing Context Costs Operating systems Linux Instruction sets Scalability Memory management Discrete event simulation Testing

来源：评论

学校读者我要写书评

暂无评论

Mining Top-k Frequent Patterns over Streaming Graphs 28th

Mining Top-k Frequent Patterns over Streaming Graphs

引用

28th International Conference on database Systems for Advanced Applications, DASFAA 2023

作者： Wang, Xi Zhang, Qianzhen Guo, Deke Zhao, Xiang Institute for Quantum Information and State Key Laboratory of High Performance Computing National University of Defense Technology Changsha China Science and Technology on Information Systems Engineering Laboratory National University of Defense Technology Changsha China Laboratory for Big Data and Decision National University of Defense Technology Changsha China

ISBN: (纸本)9783031306747

Mining top-k frequent patterns is an important operation on graphs, which is defined as finding k interesting subgraphs with the highest frequency. Most existing work assumes a static graph. However, graphs are dynamic in nature, which is described as streaming graphs. Mining top-k frequent patterns in streaming graphs is challenging due to the streaming nature of the input and the exponential time complexity of the problem. A naive solution is to calculate approximations of the frequent patterns in the streaming graph and then find the top-k answers, which is a memory- and time-consuming method. In this paper, we design a novel auxiliary data structure, FPC, to detect valid subgraph patterns and their frequency in real-time. We first convert each newly produced subgraph into a sequence and then map it into corresponding tracks in FPC based on hash functions. We theoretically prove that FPC can provide unbiased estimation and then give an error bound of our algorithm. In addition, we propose a vertical hashing and candidate buckets sampling technique to further improve FPC with higher space utilization and higher accuracy. Extensive experiments confirm that our approach generates high-quality results compared to the baseline method. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

SLMP: A Scientific Literature Management Platform Based on Large Language Models 15

SLMP: A Scientific Literature Management Platform Based on L...

引用

15th IEEE International Conference on Knowledge Graph, ICKG 2024

作者： Guo, Menghao Jiang, Jinling Wu, Fan Sun, Shanxin Zhang, Chen Li, Wenhui Sun, Zeyi Chen, Guangyong Wu, Xindong Research Center for Life Sciences Computing Zhejiang Lab Hangzhou China Research Center for Data Hub and Security Zhejiang Lab Hangzhou China Research Center for High Efficiency Computing System Zhejiang Lab Hangzhou China Hefei University of Technology Key Laboratory of Knowledge Engineering With Big Data Hefei China

ISBN: (纸本)9798331508821

This paper presents a Scientific Literature Management Platform (SLMP, demo link1 ) based on large language models (LLMs). The platform consists of four modules: literature management, literature extraction, literature retrieval, and question answering. The core techniques used to support the four modules across the platform include a fine-tuned model PaperExtractGPT and a continual pre-training model ChatPaperGPT based on ChatGLM2 using the data from scientific research literature, responsible for information extraction and communication, respectively. Due to their powerful capabilities in natural language understanding and generation, LLMs can understand complex scientific concepts based on the provided contexts, and thus generate high-quality texts and conduct in-depth information retrieval and question answering. Our platform can help researchers manage and utilize literature more effectively and efficiently for finding relevant literature, obtaining required information, and generating new knowledge. © 2024 IEEE.

关键词： Question answering

来源：评论

学校读者我要写书评

暂无评论

Phase equilibria in Co-Ti-Re ternary system

引用

Rare Metals 2023年第8期42卷 2736-2746页

作者： Ling-Ling Li Cui-Ping Wang Shui-Yuan Yang Jia-Jia Han Yong Lu Jin-Bin Zhang Xing-Jun Liu College of Materials and Fujian Provincial Key Laboratory of Materials Genome Xiamen UniversityXiamen 361005China College of Materials Science and Engineering Guangdong Ocean UniversityYangjiang 529500China Xiamen Key Laboratory of High-Performance Metals and Materials Xiamen UniversityXiamen 361005China School of Materials Science and Engineering Institute of Materials Genome and Big DataHarbin Institute of TechnologyShenzhen 518055China

The phase equilibria in the Co-Ti-Re ternary system at 800,1000,1100 and 12000C were studied combined with electron probe microanalyzer(EPMA),X-ray diffraction(XRD),scanning electron microscope(SEM)and transmission electron microscope(TEM).The new phaseτwith a large solubility was discovered at all four isothermal sections,and its structure still needs a further study.A large solubility of Re in the CoTi phase was *** solubility of Re in the Co_(3)Ti phase is6.1%at 800℃,8.7%at 1000℃and 7.7%at 1100℃.The present work could be significant for alloy design of Co-based alloys and thermodynamic analysis of the Co-TiRe ternary system.

关键词： Isothermal section Phase equilibria Co-Ti-Re Co-based supperalloys

来源：评论

学校读者我要写书评

暂无评论

ES-Mask: Evolutionary Strip Mask for Explaining Time Series Prediction 37

ES-Mask: Evolutionary Strip Mask for Explaining Time Series ...

引用

37th AAAI Conference on Artificial Intelligence, AAAI 2023

作者： Sun, Yifei Song, Cheng Lu, Feng Li, Wei Jin, Hai Zomaya, Albert Y. National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China Centre for Distributed and High Performance Computing School of Computer Science University of Sydney Australia

ISBN: (纸本)9781577358800

Machine learning models are increasingly used in time series prediction with promising results. The model explanation of time series prediction falls behind the model development and makes less sense to users in understanding model decisions. This paper proposes ES-Mask, a post-hoc and model-agnostic evolutionary strip mask-based saliency approach for time series applications. ES-Mask designs the mask consisting of strips with the same salient value in consecutive time steps to produce binary and sustained feature importance scores over time for easy understanding and interpretation of time series. ES-Mask uses an evolutionary algorithm to search for the optimal mask by manipulating strips in rounds, thus is agnostic to models by involving no internal model states in the search. The initial experiments on MIMIC-III data set show that ES-Mask outperforms state-of-the-art methods. Copyright © 2023, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

One-step synthesis of novel core-shell bimetallic hexacyanoferrate for high performance sodium-storage cathode

引用

Journal of Materials Science & Technology 2022年第19期114卷 180-190页

作者： Daxian Zuo Cuiping Wang Jiajia Han Qinghao Han Yanan Hu Junwei Wu Huajun Qiu Qian Zhang Xingjun Liu College of Materials and Fujian Key Laboratory of Materials Genome and Xiamen Key Laboratory of High Performance Metals and Materials Xiamen UniversityXiamen 361005China Institute of Materials Genome and Big Data Harbin Institute of TechnologyShenzhen 518055China State Key Laboratory of Advanced Welding and Joining Harbin Institute of TechnologyShenzhen 518055China

Recently, the design of core-shell hierarchical architecture plays an important role in improving the electrochemical performance of Prussian blue analogue cathodes(PBAs). Unfortunately, the inconvenient stepwise preparation and the strict lattice-matching requirement have restricted the development of coreshell PBAs. Herein, we demonstrate a one-step synthesis strategy to synthesize core-shell manganese hexacyanoferrate(MnFeHCF@MnFeHCF) for the first time. And the formation mechanism of the core-shell hierarchical architecture is investigated by first-principles calculations. It is found that the as-obtained Mn FeHCF@MnFeHCF act out the superior intrinsic natures, which not only can obtain a larger specific surface area and lower Fe(CN)_(6) vacancies but also can activate more Na-storage sites. Compared with the manganese hexacyanoferrate(MnHCF), the iron hexacyanoferrate(FeHCF), and even the traditional coreshell nickel hexacyanoferrate(FeHCF@NiHCF) prepared by a stepwise method, the Mn Fe HCF@MnFeHCF demonstrates a superior rate performance, which achieves a high capacity of 131 mAh g^(−1) at 50 mA g^(−1) and delivers a considerable discharge capacity of about 100 mAh g^(−1) even at 1600 mA g^(−1). Meantime, the capacity retention can reach up to nearly 80% after 500 cycles. The improved performances could be mainly originated from two aspects: on the one hand, Mn substitution is helpful to enhance the material conductivity;on the other hand, the core-shell structure with matched lattice parameters is more favorable to enhance the diffusion coefficient of sodium ions. Beside, the structural transformation of MnFeHCF@MnFeHCF upon the extraction/insertion of sodium ions is instrumental in releasing the interior stress and effectively maintaining the integrity of the crystal structure.

关键词： Cathode Prussian blue analogue Core-shell structure First-principles calculations Electrochemical performance

来源：评论

学校读者我要写书评

暂无评论

Efficient simulation of discrete galaxy populations and associated radiation fields during the first billion years

arXiv

引用

arXiv 2025年

作者： Davies, James E. Mesinger, Andrei Murray, Steven Scuola Normale Superiore di Pisa Piazza dei Cavallieri 7 Pisa56126 Italy Centro Nazionale"High Performance Computing Big Data and Quantum Computing" Italy

Understanding the epochs of cosmic dawn and reionisation requires us to leverage multi-wavelength and multi-tracer observations, with each dataset providing a complimentary piece of the puzzle. To interpret such data, we update the public simulation code, 21cmFASTv4, to include a discrete source model based on stochastic sampling of conditional mass functions and semi-empirical galaxy relations. We demonstrate that our new galaxy model, which parametrizes the means and scatters of well-established scaling relations, is flexible enough to characterize very different predictions from hydrodynamic cosmological simulations of high-redshift galaxies. Combining a discrete galaxy population with approximate, efficient radiative transfer allows us to self-consistently forward-model galaxy surveys, line intensity maps (LIMs), and observations of the intergalactic medium (IGM). Not only does each observable probe different scales and physical processes, but cross-correlation will maximise the information gained from each measurement by probing the galaxy-IGM connection at high-redshift. We find that a stochastic source field produces significant shot-noise in 21cm and LIM power spectra. Scatter in galaxy properties can be constrained using UV luminosity functions and/or 21cm power spectra, especially if astrophysical scatter is higher than expected (as might be needed to explain recent JWST observations). Our modelling pipeline is both flexible and computationally efficient, facilitating high-dimensional, multi-tracer, field-level Bayesian inference of cosmology and astrophysics during the first billion years. © 2025, CC BY.

关键词： Dark Matter

来源：评论

学校读者我要写书评

暂无评论

Detecting galaxy – 21-cm cross-correlation during reionization

arXiv

引用

arXiv 2025年

作者： Gagnon-Hartman, Samuel Davies, James Mesinger, Andrei Scuola Normale Superiore di Pisa Piazza dei Cavallieri 7 Pisa56126 Italy Centro Nazionale "High Performance Computing Big Data and Quantum Computing" Italy

The cosmic 21-cm signal promises to revolutionize studies of the Epoch of Reionization (EoR). Radio interferometers are aiming for a preliminary, low signal-to-noise (S/N) detection of the 21-cm power spectrum. Cross-correlating 21-cm with galaxies will be especially useful in these efforts, providing both a sanity check for initial 21-cm detection claims and potentially increasing the S/N due to uncorrelated residual systematics. Here we self-consistently simulate large-scale (1 Gpc3) galaxy and 21-cm fields, computing their cross-power spectra for various choices of instruments as well as survey properties. We use 1080h observations with SKA-low AA* and HERA-350 as our benchmark 21-cm observations. We create mock Lyman alpha narrow-band, slitless and slit spectroscopic surveys, using benchmarks from instruments such as Subaru HyperSupremeCam, Roman grism, VLT MOONS, ELT MOSAIC, and JWST NIRCam. We forecast the resulting S/N of the galaxy–21-cm cross-power spectrum, varying the galaxy survey area, depth and level of 21-cm foreground contamination for each pair of instruments. We find that the highest S/N is achievable through slitless, wide-area spectroscopic surveys, with the proposed Roman HLS survey resulting in a ∼ 55σ (∼ 13σ) detection of the cross power with 21-cm as observed with SKA-low AA* (HERA-350), for our fiducial model and assuming ∼500 sq. deg. of overlap. Narrow-band dropout surveys are unlikely to result in a detectable cross-power, due to their poor redshift localization. Slit spectroscopy can provide a high S/N detection of the cross power for SKA-low AA* observations. Specifically, the planned MOONRISE survey with MOONS on the VLT can result in a ∼ 3σ detection, while a survey of comparable observing time using MOSAIC on the ELT can result in a ∼ 4σ detection. Our results can be used to guide survey strategies, facilitating the detection of the galaxy–21-cm cross-power spectrum. © 2025, CC BY.

关键词： Signal to noise ratio

来源：评论

学校读者我要写书评

暂无评论

Incremental Checkpointing of Large State Simulation Models with Write-Intensive Events via Memory Update Correlation on Buddy Pages

Incremental Checkpointing of Large State Simulation Models w...

引用

International Workshop/Symposium on Distributed Simulation and Real-Time Applications (DS-RT)

作者： Romolo Marotta Federica Montesano Alessandro Pellegrini Francesco Quaglia DICII Tor Vergata University of Rome Centro Nazionale di Ricerca in High Performance Computing Big Data e Quantum Computing

Checkpointing techniques for speculative parallel simulation of discrete event models have been widely studied in the literature. However, there has been a very marginal attempt to exploit operating system page-protection services, which have instead been largely exploited in the context of checkpointing for fault tolerance. In this article, we discuss how these services can effectively manage simulation models with large states and write-intensive events in zones of the state layout. In particular, we present a solution where the correlation of write operations on buddy pages in the state layout can be exploited to achieve effective incremental checkpointing support, which allows scaling down the costs of operating system services. Our solution does not require any instrumentation of the simulation application code and is usable on any Posix-compliant operating system. We also discuss its integration within the USE (Ultimate-Share-Everything) open-source speculative simulation package and report some experimental data for its assessment.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：