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

arXiv 2024年

作者： Zhiwei, H.A.O. Ding, Xinru Libo, L.I. Weisz, Ferenc School of Mathematics and Computing Science Hunan University of Science and Technology Xiangtan411201 China Department of Numerical Analysis Eötvös L. University Pázmány P. sétány 1/C BudapestH-1117 Hungary

In this paper, we introduce a new class of function spaces, which unify and generalize Lorentz-Karamata spaces, variable Lorentz spaces and other several classical function spaces. Based on the new spaces, we develop the theory of variable martingale Hardy-Lorentz-Karamata spaces and apply it to Fourier analysis. To be precise, we discuss the basic properties of Lorentz-Karamata spaces with variable exponents. We introduce five variable martingale Hardy-Lorentz-Karamata spaces and characterize them via simple atoms as well as via atoms. As applications of the atomic decompositions, dual theorems and the generalized John-Nirenberg theorem for the new framework are presented. Moreover, we obtain the boundedness of σ-sublinear operator defined on variable martingale Hardy-Lorentz-Karamata spaces, which leads to martingale inequalities and the relation of the five variable martingale Hardy-Lorentz-Karamata spaces. Also, we investigate the boundedness of fractional integral operators in this new framework. Finally, we deal with the applications of variable martingale Hardy-Lorentz-Karamata spaces in Fourier analysis by using the previous results. More precisely, we show that the partial sums of the Walsh-Fourier series converge to the function in norm if f ∈ Lp(·),q,b with 1 − ≤ p+ Copyright © 2024, The Authors. All rights reserved.

关键词： Fourier analysis

来源：评论

学校读者我要写书评

暂无评论

Exploration of core concepts required for mid- and domain-level ontology development to facilitate explainable-AI-readiness of data and models 4

Exploration of core concepts required for mid- and domain-le...

引用

4th International Workshop on Data meets Ontologies in Explainable AI, DAO-XAI 2024

作者： Horsch, Martin T. Chiacchiera, Silvia Todorov, Ilian T. Correia, Ana Teresa Dey, Aditya Konchakova, Natalia A. Scholze, Sebastian Stephan, Simon Tøndel, Kristin Sarkar, Arkopaul Karray, M. Hedi Al Machot, Fadi Schembera, Björn Norwegian University of Life Sciences Department of Data Science Postboks 5003 Ås1432 Norway UKRI Science and Technology Facilities Council Scientific Computing Department DaresburyWA4 4AD United Kingdom ATB Institut für Angewandte Systemtechnik Bremen GmbH Wiener Str. 1 Bremen28359 Germany Helmholtz-Zentrum Hereon Institute of Surface Science Max-Planck-Str. 1 Geesthacht21502 Germany RPTU Kaiserslautern Laboratory of Engineering Thermodynamics Kaiserslautern67663 Germany University of Technology Tarbes Occitanie Pyrénées Production Engineering Lab. 47 av. d’Azereix Tarbes France University of Stuttgart Institute of Applied Analysis and Numerical Simulation Stuttgart70569 Germany

This position paper reports on the initial discussions within the Knowledge Graph Alliance’s working group on explainable-AI-ready data and metadata principles, which was created in March 2024. At present, we are taking initial steps toward capturing core concepts related to explanation, grounding, reliance, and trust;the scope also extends to potential dual notions such as explainability, verifiability/reproducibility, reliability, and trustworthiness. These initial steps consist in reviewing core concepts as they are discussed in the literature and exploring what could be practically useful definitions of these most central concepts. One of the conclusions is that the metadata standards will need to be suitable for documenting three kinds of grounding: Grounding of knowledge, grounding of reliance, and grounding of trust. Pre-existing metadata standards at the mid and domain level are presently undergoing a redesign in order to become more modular, computationally tractable, intelligible to humans, and adjustable, which will be needed as we continue our work toward actionable recommendations. The development of this system of lite (OWL 2 EL) ontologies, called MSO-EM: Ontologies for modelling, simulation, optimization (MSO) and epistemic metadata (EM), is carried out on a public repository. © 2024 Copyright for this paper by its authors.

关键词： Applied ontology epistemic metadata explainable-AI-ready (XAIR) ontology redesign reliability reproducibility

来源：评论

学校读者我要写书评

暂无评论

26th Annual Computational Neuroscience Meeting (CNS*2017) of the Organization for Computational Neuroscience Antwerp, Belgium, July 15-20, 2017

引用

BMC NEUROscience 2017年第SUPPL 1期18卷 59-59页

作者： [Anonymous] Indiana University Purdue University Indianapolis Indianapolis IN 46032 USA Stark Neurosciences Research Institute Indiana University School of Medicine Indianapolis IN 46032 USA Department of Mathematics East Carolina University Greenville NC 27858 USA Jülich Supercomputing Centre Forschungszentrum Jülich 52425 Jülich Germany Future Systems Swiss National Supercomputing Centre 8092 Zurich Switzerland User Engagement and Support Swiss National Supercomputing Centre 6900 Lugano Switzerland Institut de Neurosciences des Systèmes Aix Marseille Univ 13005 Marseille France Simulation Lab Neuroscience Forschungszentrum Jülich Jülich Germany Department of Experimental Psychology Ghent University 9000 Ghent Belgium Donders Center for Cognitive Neuroimaging Radboud University 6525HR Nijmegen The Netherlands Department of Electrical Computer and Energy Engineering University of Colorado Boulder CO 80309 USA Department of Neurosurgery Johns Hopkins School of Medicine Baltimore MD 21287 USA Department of Neurology Johns Hopkins School of Medicine Baltimore MD 21287 USA Department of Otolaryngology Johns Hopkins School of Medicine Baltimore MD 21287 USA INSERM U968 Paris France Sorbonne Universités UPMC University Paris 06 UMR_S 968 Institut de la Vision Paris France CNRS UMR_7210 Paris France Department of Computer Architecture and Technology University of Granada (CITIC) Granada Spain Sorbonne Universités UPMC Univ Paris 06 INSERM CNRS Institut de la Vision Paris France Department of Adaptive Machine Systems Osaka University Osaka Japan Department of Computer Science University of Cergy-Pontoise Cergy-Pontoise France Department of Physics and Astronomy College of Charleston Charleston SC 29424 USA School of Physics Faculty of Science University of Sydney Sydney NSW 2006 Australia Center of Excellence for Integrative Brain Function Australian Research Council Sydney Australia Max Planck Institute for Human Cognitive and Brain Sciences Saxony Lei

来源：评论

学校读者我要写书评

暂无评论

Discontinuous element approximation for dynamic fracture

Discontinuous element approximation for dynamic fracture

引用

8th International Conference on Computational Plasticity: Fundamentals and Applications, COMPLAS VIII

作者： Arranz, A. Petrinic, N. Suli, E. Oxford University Computing Laboratory Numerical Analysis Group Oxford University Parks Road Oxford OX1 3QD United Kingdom Department of Engineering Science Solid Mechanics Group Oxford University Parks Road Oxford OX1 3PJ United Kingdom

ISBN: (纸本)8495999781

A new set of numerical methods for predictive modeling of crack propagation on aircraft structures based on discontinuous interpolation is introduced. These methods solve many shortcomings and limitations of classical FEMs, in particular in terms of accuracy and stability of the numerical approximation. The combination of these methods with appropriate adaptive local re-meshing can circumvent the unreliability and high mesh-dependency of classical approaches, and can effectively model fracture onset and propagation. Some results are presented on the simulation of fracture of ductile and brittle materials.

关键词： Airframes

来源：评论

学校读者我要写书评

暂无评论

Vibrational properties of the one-component σ phase

引用

Physical Review B 2000年第5期62卷 3223-3223页

作者： S. I. Simdyankin S. N. Taraskin M. Dzugutov S. R. Elliott Department of Numerical Analysis and Computing Science Royal Institute of Technology SE–100 44 Stockholm Sweden Department of Chemistry University of Cambridge Lensfield Road Cambridge CB2 1EW United Kingdom

A structural model of a one-component σ-phase crystal has been constructed by means of molecular dynamics simulation. The phonon dispersion curves and the vibrational density of states were computed for this model. The dependence of the vibrational properties on the thermodynamical parameters was investigated. The vibrational density of states of the σ-phase structure is found to be similar to that of a one-component glass with icosahedral local order. On the basis of this comparison it is concluded that the σ phase can be considered to be a good crystalline reference structure for this glass.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Equivalent definitions of recognizability for sets of graphs of bounded tree-width

引用

Mathematical Structures in Computer science 1996年第2期6卷 141-165页

作者： Courcelle, Bruno Lagergren, Jens Université Bordeaux-1 LaBRI 351 cours de la Libération Talence33405 France Department of Numerical Analysis and Computing Science Royal Institute of Technology StockholmS-100 44 Sweden

We show that a set of finite graphs of tree-width at most k is recognizable (with respect to the algebra of graphs with an unbounded number of sources) if and only if it is recognizable with respect to the algebra of ... 详细信息

关键词： Algebra

来源：评论

学校读者我要写书评

暂无评论

Portability, predictability and performance for parallel computing: BSP in practice

引用

Concurrency and Computation: Practice and Experience 1996年第10期8卷

作者： Joy Reed Kevin Parrott Tim Lanfear Department of Computing Science Oxford Brookes University UK Numerical Analysis Group Oxford University Computing Laboratory Wolfson Building Parks Road Oxford OX1 3QD UK Sowerby Research Centre BAe (Operations) Ltd. UK

We report on practical experience using the Oxford BSP Library to parallelize a large electromagnetic code, the British Aerospace finite-difference time-domain code EMMA T:FD3D. The Oxford BS Library is one of the first realizations of the Bulk Synchronous Parallel computational model to be targeted at numerically intensive scientific (typically Fortran) computing. The BAe EMMA code is one of the first large-scale applications to be parallelized using this library, and it is an important demonstration of the cost effectiveness of the BSP approach. We illustrate how BSP cost-modelling techniques can be used to predict and optimize performance for single-source programs across different parallel platforms. We provide predicted and observed performance figures for an industrial-strength, single-source parallel code for a variety of real parallel architectures: shared memory multiprocessors, workstation clusters and massively parallel platforms.

关键词：

来源：评论

学校读者我要写书评

暂无评论

DETECTING SALIENT BLOB-LIKE IMAGE STRUCTURES AND THEIR SCALES WITH A SCALE-SPACE PRIMAL SKETCH - A METHOD FOR FOCUS-OF-ATTENTION

引用

INTERNATIONAL JOURNAL OF COMPUTER VISION 1993年第3期11卷 283-318页

作者： LINDEBERG, T 1. Computational Vision and Active Perception Laboratory (CVAP) Department of Numerical Analysis and Computing Science Royal Institute of Technology S-100 44 Stockholm Sweden

This article presents: (i) a multiscale representation of grey-level shape called the scale-space primal sketch, which makes explicit both features in scale-space and the relations between structures at different scales, (ii) a methodology for extracting significant blob-like image structures from this representation, and (iii) applications to edge detection, histogram analysis, and junction classification demonstrating how the proposed method can be used for guiding later-stage visual processes. The representation gives a qualitative description of image structure, which allows for detection of stable scales and associated regions of interest in a solely bottom-up data-driven way. In other words, it generates coarse segmentation cues, and can hence be seen as preceding further processing, which can then be properly tuned. It is argued that once such information is available, many other processing tasks can become much simpler. Experiments on real imagery demonstrate that the proposed theory gives intuitive results.

关键词： Dermal denticles Explicit Sketches BALANCES images Scale squama visual processing Imagery (Psychotherapy) Image IMAGE STRUCTURE scales

来源：评论

学校读者我要写书评

暂无评论

Integrating task-directed plaiming with reactive object recognition 12

Integrating task-directed plaiming with reactive object reco...

引用

Intelligent Robots and Computer Vision XII: Algorithms and Techniques 1993

作者： Dickinson, Sven Stevenson, Suzanne Amdur, Eugene Tsotsos, John Olsson, Lars Department of Computer Science University of Toronto 6 King's College Rd. TorontoONM5S1A4 Canada Computational Vision and Active Perception Laboratory Dept. of Numerical Analysis and Computing Science Royal Institute of Tecimology StockholmS-10044 Sweden

We describe a robot vision system that achieves complex object recognition with two layers of behaviors, performing the tasks of planning and object recognition, respectively. The recognition layer is a pipeline in which successive stages take in images from a stereo head, recover relevant features, build intermediate representations, and deposit 3-D objects into a world model. Each stage is an independent process that reacts automatically to output from the previous stage. This reactive system operates continuously and autonomously to construct the robot's 3-D model of the environment. Sitting above the recognition pipeline is the planner which is responsible for populating the world model with objects that satisfy the high-level goals of the system. For example, upon examination of the world model, the planner can decide to direct the head to another location, gating new images into the recognition pipeline, causing new objects to be deposited into the world model. Alternatively, the planner can alter the recognition behavior of the pipeline so that objects of a certain type or at a certain location appear in the world model. © 1993 SPIE.

关键词： Pipelines

来源：评论

学校读者我要写书评

暂无评论

Majority gates vs. general weighted threshold gates

引用

Computational Complexity 1992年第4期2卷 277-300页

作者： Goldmann, Mikael Håstad, Johan Razborov, Alexander Department of Numerical Analysis and Computing Science Royal Institute of Technology Stockholm S-100 44 Sweden Steklov Mathematical Institute Moscow 117966 GSP-1 Vavilova 42 Russian Federation

In this paper we study small depth circuits that contain threshold gates (with or without weights) and parity gates. All circuits we consider are of polynomial size. We prove several results which complete the work on characterizing possible inclusions between many classes defined by small depth circuits. These results are the following: 1. A single threshold gate with weights cannot in general be replaced by a polynomial fan-in unweighted threshold gate of parity gates. 2. On the other hand it can be replaced by a depth 2 unweighted threshold circuit of polynomial size. An extension of this construction is used to prove that whatever can be computed by a depth d polynomial size threshold circuit with weights can be computed by a depth d+1 polynomial size unweighted threshold circuit, where d is an arbitrary fixed integer. 3. A polynomial fan-in threshold gate (with weights) of parity gates cannot in general be replaced by a depth 2 unweighted threshold circuit of polynomial size. © 1992 Birkhäuser Verlag.

关键词： circuit complexity lower bounds majority circuits Subject classifications: 68Q15 threshold circuits

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：