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

arXiv 2025年

作者： Martens, David Shmueli, Galit Evgeniou, Theodoros Bauer, Kevin Janiesch, Christian Feuerriegel, Stefan Gabel, Sebastian Goethals, Sofie Greene, Travis Klein, Nadja Kraus, Mathias Kühl, Niklas Perlich, Claudia Verbeke, Wouter Zharova, Alona Zschech, Patrick Provost, Foster University of Antwerp Department of Engineering Management Antwerp2000 Belgium National Tsing Hua University Institute of Service Science Hsinchu30013 Taiwan INSEAD Technology and Business Fontainebleau77300 France Goethe University Frankfurt Department of Information Systems Frankfurt60629 Germany TU Dortmund University Department of Computer Science Dortmund44227 Germany LMU Munich Munich Center for Machine Learning Munich80539 Germany Erasmus University Rotterdam School of Management Rotterdam3062 Netherlands Copenhagen Business School Department of Digitalization Copenhagen2000 Denmark Karlsruhe Institute of Technology Scientific Computing Center Karlsruhe76131 Germany University of Regensburg Faculty of Informatics and Data Science Regensburg93053 Germany University of Bayreuth Faculty of Law Business and Economics Bayreuth95440 Germany New York University Department of Technology Operations and Statistics New YorkNY10012 United States KU Leuven Faculty of Economics and Business Leuven3000 Belgium Humboldt-Universität zu Berlin School of Business and Economics Berlin10099 Germany Leipzig University Faculty of Economics and Management Science Leipzig04109 Germany

Understanding the decisions made and actions taken by increasingly complex AI system remains a key challenge. This has led to an expanding field of research in explainable artificial intelligence (XAI), highlighting the potential of explanations to enhance trust, support adoption, and meet regulatory standards. However, the question of what constitutes a "good" explanation is dependent on the goals, stakeholders, and context. At a high level, psychological insights such as the concept of mental model alignment can offer guidance, but success in practice is challenging due to social and technical factors. As a result of this ill-defined nature of the problem, explanations can be of poor quality (e.g. unfaithful, irrelevant, or incoherent), potentially leading to substantial risks. Instead of fostering trust and safety, poorly designed explanations can actually cause harm, including wrong decisions, privacy violations, manipulation, and even reduced AI adoption. Therefore, we caution stakeholders to beware of explanations of AI: while they can be vital, they are not automatically a remedy for transparency or responsible AI adoption, and their misuse or limitations can exacerbate harm. Attention to these caveats can help guide future research to improve the quality and impact of AI explanations. © 2025, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Sequence Submodular Maximization Meets Streaming 13th

Sequence Submodular Maximization Meets Streaming

引用

13th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2019

作者： Yang, Ruiqi Xu, Dachuan Guo, Longkun Zhang, Dongmei Department of Operations Research and Scientific Computing Beijing University of Technology Beijing100124 China College of Mathematics and Computer Science Fuzhou University Fuzhou350116 China School of Computer Science and Technology Shandong Jianzhu University Jinan250101 China

ISBN: (纸本)9783030364113

In this paper, we consider the streaming sequence submodular maximization problem, in which the utility function is defined on sequences of element instead of element sets. We encode the values of different sequences by a weighted directed acyclic graph (W-DAG), where the weight of vertex reveals the utility value in selecting single element and the weight of an edge proclaims the additional benefit according to a certain selected order. In addition, the edges are revealed in a streaming fashion that one edge is known in one time slot. The aim is to output a sequence of vertices of length bounded by a given constant k, such that the utility function value is maximized. In this work, we first provide the framework of the sequence submodular maximization under streaming. By utilizing an edge-based thresholding principle, we derive a one pass, -approximation algorithm with memory and update time per edge, where and is the maximum in-degree (out-degree) of the constructed W-DAG. At last, we present a further improved streaming algorithm, which also requires one pass over the stream and attains the same approximation ratio but is with a decreased memory complexity of. © 2019, Springer Nature Switzerland AG.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Tree wavelet approximations with applications

引用

science China Mathematics 2005年第5期48卷 680-702页

作者： XU Yuesheng & ZOU Qingsong Department of Mathematics, Syracuse University, Syracuse, NY 13244, USA Institute of Mathematics, Academy of Mathematics and System sciences, Chinese Academy of sciences, Beijing 100080, China Department of scientific computing and computer science, Zhongshan University, Guangzhou 510275, China 1. Department of Mathematics Syracuse University 13244 Syracuse NY USA 2. Institute of Mathematics Academy of Mathematics and System Sciences Chinese Academy of Sciences 100080 Beijing China 3. Department of Scientific Computing and Computer Science Zhongshan University 510275 Guangzhou China

We construct a tree wavelet approximation by using a constructive greedy scheme (CGS). We define a function class which contains the functions whose piecewise polynomial approximations generated by the CGS have a prescribed global convergence rate and establish embedding properties of this class. We provide sufficient conditions on a tree index set and on bi-orthogonal wavelet bases which ensure optimal order of convergence for the wavelet approximations encoded on the tree index set using the bi-orthogonal wavelet bases. We then show that if we use the tree index set associated with the partition generated by the CGS to encode a wavelet approximation, it gives optimal order of convergence.

关键词： greedy algorithms tree wavelet approximations Besov spaces.

来源：评论

学校读者我要写书评

暂无评论

Topology exploration with hierarchical landscapes

Topology exploration with hierarchical landscapes

引用

Workshop at SIGGRAPH Asia 2012, WASA 2012

作者： Demir, Dogan Beketayev, Kenes Weber, Gunther H. Bremer, Peer-Timo Pascucci, Valerio Hamann, Bernd Scientific Computing and Imaging Institute School of Computing University of Utah United States Computational Research Divisition Lawrence Berkeley National Laboratory United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory United States Institute for Data Analysis and Visualization Computer Science Department University of California Davis CA United States

ISBN: (纸本)9781450318358

Topological landscapes have been proposed as a visual metaphor for contour trees that does not require an understanding of the theory involved in defining contour trees. The idea is to create a representative terrain with the same topological structure as a given contour tree. This representation exploits the natural human ability to interpret topography and results in an intuitive visualization of otherwise abstract information. However, topological landscapes still suffer from some of the same limitations as traditional contour tree visualization. Most notable is the fact that for complex functions landscapes can quickly become highly complex, exceeding the limits of human comprehension as well as the available computing resources. To address this challenge, we propose a new framework for the dynamic creation and visualization of hierarchical topological landscapes. Our system provides an interactive visualization of complex functions by utilizing a hierarchical decomposition of the contour tree as well as focus+context type interactions. For three dimensional data, we link the landscape display to flexible isosurface extraction in order to correlate terrain features with their corresponding three dimensional counterparts. We demonstrate the utility and versatility of our approach on a variety of both low and high dimensional data sets. © 2012 ACM.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

Ad Hoc File Systems for High-Performance computing

引用

Journal of computer science & Technology 2020年第1期35卷 4-26页

作者： AndréBrinkmann Kathryn Mohror Weikuan Yu Philip Carns Toni Cortes Scott A.Klasky Alberto Miranda Franz-Josef Pfreundt Robert B.Ross Marc-AndréVef Zentrum für Datenverarbeitung Johannes Gutenberg University MainzMainz 55128Germany Center for Applied Scientific Computing Lawrence Livermore National LaboratoryLivermoreCA 94550U.S.A Department of Computer Science Florida State UniversityTallahasseeFL 32306U.S.A Mathematics and Computer Science Division Argonne National LaboratoryLemontIL 60439U.S.A Department of Computer Architecture Universitat Politecnica de CatalunyaBarcelona 08034Spain Computer Science and Mathematics Division Oak Ridge National LaboratoryOak RidgeTN 37831U.S.A Computer Science Department Barcelona Supercomputing CenterBarcelona 08034Spain Fraunhofer Institute for Industrial Mathematics ITWM Fraunhofer-Platz 1Kaiserslautern 67663Germany

Storage backends of parallel compute clusters are still based mostly on magnetic disks,while newer and faster storage technologies such as flash-based SSDs or non-volatile random access memory(NVRAM)are deployed within compute *** these new storage technologies into scientific workflows is unfortunately today a mostly manual task,and most scientists therefore do not take advantage of the faster storage *** approach to systematically include nodelocal SSDs or NVRAMs into scientific workflows is to deploy ad hoc file systems over a set of compute nodes,which serve as temporary storage systems for single applications or longer-running *** paper presents results from the Dagstuhl Seminar 17202"Challenges and Opportunities of User-Level File Systems for HPC"and discusses application scenarios as well as design strategies for ad hoc file systems using node-local storage *** discussion includes open research questions,such as how to couple ad hoc file systems with the batch scheduling environment and how to schedule stage-in and stage-out processes of data between the storage backend and the ad hoc file *** presented are strategies to build ad hoc file systems by using reusable components for networking and how to improve storage device *** interfaces and semantics are presented,for example those used by the three ad hoc file systems BeeOND,GekkoFS,and *** presentation covers a range from file systems running in production to cutting-edge research focusing on reaching the performance limits of the underlying devices.

关键词： parallel architectures distributed file system high-performance computing burst buffer POSIX(portable operating system interface)

来源：评论

学校读者我要写书评

暂无评论

Improving gaming experience in zonal MMOGs

Improving gaming experience in zonal MMOGs

引用

15th ACM International Conference on Multimedia, MM'07

作者： Ahmed, Dewan Tanvir Shirmohammadi, Shervin Oliveira, Jauvane DISCOVER Laboratory School of Information Technology and Engineering University of Ottawa Canada ACiMA Laboratory Computer Science Department National Laboratory of Scientific Computing Petrópolis RJ Brazil

ISBN: (纸本)9781595937025

Synchronous communication is a primary concern for multi-user virtual environments like Massively Multiplayer Online Games (MMOGs). Most of the MMOGs offer discrete view for the avatars and follow logical zone layout for easy state management. The avatar movement, from one logical zone to another, causes reorganization at the P2P overlay structure. Its recurrent nature along with unintelligent zone crossing approaches eventually hampers synchronous communication. In this paper, we present performance enhancement mechanisms to reduce P2P overlay reorganization penalties based on avatars' physical characteristics. Avatars' unpredictable movement around the zone boundaries also incur repeated connections and disconnections either among the zone masters or among the multiple peers in the overlay networks. Interest driven zone crossing, dynamic shared region between adjacent zones, and clustering of the entities based on their attributes significantly alleviates these problems and also provides continuous view and seamless region crossing to players. The technical contribution of this paper is to present the effectiveness of object clustering mechanism and interest driven zone crossing with dynamic shared region between each adjacent zones to enhance the gaming experience of MMOG players or users of other types of networked virtual environments (VE). Copyright 2007 ACM.

关键词： Multimedia systems

来源：评论

学校读者我要写书评

暂无评论

DynamicPVM: Dynamic load balancing on parallel systems

DynamicPVM: Dynamic load balancing on parallel systems

引用

International Conference and Exhibition on High-Performance computing and Networking, HPCN 1994

作者： Dikken, Leen van der Linden, Frank Vesseur, Joep Sloot, Peter Shell Nederland Informatieverwerking Rijswijk Netherlands Parallel Scientific Computing and Simulation Group Faculty of Mathematics and Computer Science University of Amsterdam Kruislaan 403 Amsterdam1098 SJ Netherlands

ISBN: (纸本)9783540579816

This paper describes DynamicPVM, an extension to PVM (Parallel Virtual Machine) [1]. PVM enables users to write parallel applications using message passing primitives and statically places the parallel tasks on a collection of nodes. System schedulers schedule atomic jobs over a predefined number of nodes. DynamicPVM addresses the problem of scheduling parallel tasks over a set of nodes. It therefore has to integrate a process checkpointing, migration and restart restart mechanism with the PVM runtime support system. DynamicPVM facilitates an efficient use of existing computational resources for computational jobs consisting of parallel subtasks. Typical target HPC platforms for DynamicPVM are multi user, multi tasking, loosely coupled processors. © 1994, Springer Verlag. All rights reserved.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Towards detailed material deformation patterns in the hypervelocity impacts of laminated plates with smoothed particle hydrodynamics

Towards detailed material deformation patterns in the hyperv...

引用

ASME 2016 Pressure Vessels and Piping Conference, PVP 2016

作者： Zisis, Iason Van Der Linden, Bas Giannopapa, Christina Koren, Barry Dam, Jacques Centre for Analysis Scientific Computing and Applications Department of Mathematics and Computer Science TU Eindhoven Eindhoven Netherlands Energy Technology Department of Mechanical Engineering TU Eindhoven Eindhoven Netherlands

ISBN: (纸本)9780791850404

Hypervelocity impacts onto the outer structure of spacecraft induce shock waves, which in case of multimaterial structures interact with the material interfaces. This interaction is expected to produce different deformation patterns for laminates compared to the patterns appearing for materials with homogeneous density. In order to exhibit these different features and to show that the Smoothed Particle Hydrodynamics computational method is capable of describing them, a numerical hypervelocity impact experiment is performed for three plates. The first one is a laminate, with discontinuous density and material parameters, the second is a simple homogenized version of the laminate and the last is a monolithic metal plate. Copyright © 2016 by ASME.

关键词： Shock waves

来源：评论

学校读者我要写书评

暂无评论

Scalable compression and replay of communication traces in massively parallel environments

Scalable compression and replay of communication traces in m...

引用

21st International Parallel and Distributed Processing Symposium, IPDPS 2007

作者： Noeth, Michael Mueller, Frank Schulz, Martin De Supinski, Bronis R. North Carolina State University Department of Computer Science Raleigh NC 27695-7534 Lawrence Livermore National Laboratory Center for Applied Scientific Computing Livermore CA 94551

ISBN: (纸本)1424409101

Characterizing the communication behavior of large-scale applications is a difficult and costly task due to code/system complexity and their long execution times. An alternative to running actual codes is to gather their communication traces and then replay them, which facilitates application tuning and future procurements. While past approaches lacked lossless scalable trace collection, we contribute an approach that provides orders of magnitude smaller, if not near constant-size, communication traces regardless of the number of nodes while preserving structural information. We introduce intra- and inter-node compression techniques of MPI events and present results of our implementation for BlueGene/L. Given this novel capability, we discuss its impact on communication tuning and beyond. To the best of our knowledge, such a concise representation of MPI traces in a scalable manner combined with deterministic MPI call replay are without any precedence. ©2007 IEEE.

关键词： Parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Pseudo complementary measurement for traditional single-pixel cameras

引用

Chinese Physics B 2020年第11期29卷 315-322页

作者： Qian Dong Xu-Ri Yao Xin Liu Bing Liu Guang-Jie Zhai State Key Laboratory of Computer Science Institute of SoftwareChinese Academy of SciencesBeijing 100190China Key Laboratory of Electronics and Information Technology for Space Systems National Space Science CenterChinese Academy of SciencesBeijing 100190China State Key Laboratory of Scientific and Engineering Computing Academy of Mathematics and Systems ScienceChinese Academy of SciencesBeijing 100190China University of Chinese Academy of Sciences Beijing 100049China

A traditional single-pixel camera needs a large number of measurements to reconstruct the object with compressive sensing *** with the 1/0 matrices in classical measurement,the 1/-1 matrices in the complementary measurement has better property for reconstruction computation and returns better reconstruction ***,each row of the 1/-1 matrices needs two measurements with the traditional single-pixel camera which results into double measurements compared with the 1/0 *** this paper,we consider the pseudo complementary measurement which only takes the same amount of measurements with the row number of some properly designed 1/0 matrix to compute the total luminous flux of the objective and derives the measurement data of the corresponding 1/-1 matrix in a mathematical *** numerical simulation and experimental result show that the pseudo complementary measurement is an efficient tool for the traditional single-pixel camera imaging under low measurement rate,which can combine the advantages of the classical and complementary measurements and significantly improve the peak signal-to-noise ratio.

关键词： computational imaging single-pixel camera

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：