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

Rubric-based holistic review: A promising route to equitable graduate admissions in physics

Physical Review Physics Education Research 2022年第2期18卷 020140-020140页

作者： Nicholas T. Young K. Tollefson Remco G. T. Zegers Marcos D. Caballero Department of Physics and Astronomy Michigan State University East Lansing Michigan 48824 USA Department of Computational Mathematics Science and Engineering Michigan State University East Lansing Michigan 48824 USA National Superconducting Cyclotron Laboratory Michigan State University East Lansing Michigan 48824 USA Joint Institute for Nuclear Astrophysics Michigan State University East Lansing Michigan 48824 USA Center for Computing in Science Education and Department of Physics University of Oslo N-0316 Oslo Norway CREATE for STEM Institute Michigan State University East Lansing Michigan 48824 USA

As systematic inequities in higher education and society have been brought to the forefront, graduate programs are interested in increasing the diversity of their applicants and enrollees. Yet, structures in place to evaluate applicants may not support such aims. One potential solution to support those aims is rubric-based holistic review. Starting in 2018, our physics department implemented a rubric-based holistic review process for all applicants to our graduate program. The rubric assessed applicants on 18 metrics covering their grades, test scores, research experiences, noncognitive competencies, and fit with the program. We then compared faculty’s ratings of applicants by admission status, sex, and undergraduate program over a three-year period. We find that the rubric scores show statistically significant differences between admitted and nonadmitted students as hoped. We also find that differences in rubric scores based on sex or undergraduate program reflected known systematic inequities such as applicants from smaller and less prestigious undergraduate universities scoring lower on the physics GRE and women performing more volunteer work in academia. Our results then suggest rubric-based holistic review as a possible route to making graduate admissions in physics more equitable.

关键词： Diversity & inclusion Educational policy Graduate students

来源：评论

学校读者我要写书评

暂无评论

Toward a Comparison Framework for Interactive Ontology Enrichment Methodologies 7

Toward a Comparison Framework for Interactive Ontology Enric...

引用

7th International Workshop on the Visualization and Interaction for Ontologies and Linked Data, VOILA! 2022

作者： Vrolijk, Jarno Reklos, Ioannis Vafaie, Mahsa Massari, Arcangelo Mohammadi, Maryam Rudolph, Sebastian Plantage Muidergracht 12 Amsterdam1018 TV Netherlands Department of Informatics King's College London Bush House 30 Aldwych LondonWC2B 4BG United Kingdom FIZ Karlsruhe - Leibniz Institute for Information Infrastructure Hermann-von-Helmholtz-Platz 1 Eggenstein-Leopoldshafen76344 Germany Research Centre for Open Scholarly Metadata Department of Classical Philology and Italian Studies University of Bologna Bologna Italy Department of Advanced Computing Sciences Faculty of Science and Engineering Maastricht University Minderbroedersberg 4-6 Maastricht6211 LK Netherlands Computational Logic Group TU Dresden Dresden01062 Germany

The growing demand for well-modeled ontologies in diverse application areas increases the need for intuitive interaction techniques that support human domain experts in ontology modeling and enrichment tasks, such that quality expectations are met. Beyond the correctness of the specified information, the quality of an ontology depends on its (relative) completeness, i.e., whether the ontology contains all the necessary information to draw expected inferences. On an abstract level, the Ontology Enrichment problem consists of identifying and filling the gap between information that can be logically inferred from the ontology and the information expected to be inferable by the user. To this end, numerous approaches have been described in the literature, providing methodologies from the fields of Formal Semantics and Automated Reasoning targeted at eliciting knowledge from human domain experts. These approaches vary greatly in many aspects and their applicability typically depends on the specifics of the concrete modeling scenario at hand. Toward a better understanding of the landscape of methodological possibilities, this position paper proposes a framework consisting of multiple performance dimensions along which existing and future approaches to interactive ontology enrichment can be characterized. We apply our categorization scheme to a selection of methodologies from the literature. In light of this comparison, we address the limitations of the methods and propose directions for future work. © 2022 Copyright for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

A simple low-degree optimal finite element scheme for the elastic transmission eigenvalue problem

arXiv

引用

arXiv 2021年

作者： Xi, Yingxia Ji, Xia Zhang, Shuo School of Science Nanjing University of Science and Technology Nanjing210094 China School of Mathematics and Statistics Beijing Institute of Technology Beijing100081 China Beijing Key Laboratory on MCAACI Beijing Institute of Technology Beijing100081 China LSEC Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and System Sciences Chinese Academy of Sciences Beijing100190 China

The paper presents a finite element scheme for the elastic transmission eigenvalue problem written as a fourth order eigenvalue problem. The scheme uses piecewise cubic polynomials and obtains optimal convergence rate. Compared with other low-degree and nonconforming finite element schemes, the scheme inherits the continuous bilinear form which does not need extra stabilizations and is thus simple to *** Codes 31A30, 65N30, 47B07 Copyright © 2021, The Authors. All rights reserved.

关键词： Eigenvalues and eigenfunctions

来源：评论

学校读者我要写书评

暂无评论

Cross-subject Brain Functional Connectivity Analysis for Multi-task Cognitive State Evaluation

arXiv

引用

arXiv 2024年

作者： Chen, Jun Chen, Anqi Jiang, Bingkun Obaidat, Mohammad S. Li, Ni Zhang, Xinyu School of Electronics and Information Northwestern Polytechnical University Shaanxi Xi’an710072 China School of Electronics and Information Northwestern Polytechnical University Xi’an710072 China Chongqing Institute for Brain and Intelligence Guangyang Bay Laboratory Chongqing400064 China King Abdullah II School of Information Technology The University of Jordan Amman11942 Jordan School of Computer and Communication Engineering University of Science and Technology Beijing Beijing100083 China Department of Computational Intelligence School of Computing SRM University SRM Nagar TN Kattankulathur603203 India School of Engineering The Amity University UP Noida201301 India School of Aeronautics Northwestern Polytechnical University Xi’an710072 China

Cognition refers to the function of information perception and processing, which is the fundamental psychological essence of human beings. It is responsible for reasoning and decision-making, while its evaluation is significant for the aviation domain in mitigating potential safety risks. Existing studies tend to use varied methods for cognitive state evaluation yet have limitations in timeliness, generalisation, and interpretability. Accordingly, this study adopts brain functional connectivity with electroencephalography signals to capture associations in brain regions across multiple subjects for evaluating real-time cognitive states. Specifically, a virtual reality-based flight platform is constructed with multi-screen embedded. Three distinctive cognitive tasks are designed and each has three degrees of difficulty. Thirty subjects are acquired for analysis and evaluation. The results are interpreted through different perspectives, including inner-subject and cross-subject for task-wise and gender-wise underlying brain functional connectivity. Additionally, this study incorporates questionnaire-based, task performance-based, and physiological measure-based approaches to fairly label the trials. A multi-class cognitive state evaluation is further conducted with the active brain connections. Benchmarking results demonstrate that the identified brain regions have considerable influences in cognition, with a multi-class accuracy rate of 95.83% surpassing existing studies. The derived findings bring significance to understanding the dynamic relationships among human brain functional regions, cross-subject cognitive behaviours, and decision-making, which have promising practical application values. © 2024, CC BY.

关键词： Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

A block-based triangle counting algorithm on heterogeneous environments

arXiv

引用

arXiv 2020年

作者： Yaşar, Abdurrahman Rajamanickam, Sivasankaran Berry, Jonathan Çatalyürek, Ümit V. School of Computational Science and Engineering Georgia Institute of Technology Georgia Center for Computing Research at Sandia National Laboratories AlbuquerqueNM United States

Triangle counting is a fundamental building block in graph algorithms. In this paper, we propose a block-based triangle counting algorithm to reduce data movement during both sequential and parallel execution. Our block-based formulation makes the algorithm naturally suitable for heterogeneous architectures. The problem of partitioning the adjacency matrix of a graph is well-studied. Our task decomposition goes one step further: it partitions the set of triangles in the graph. By streaming these small tasks to compute resources, we can solve problems that do not fit on a device. We demonstrate the effectiveness of our approach by providing an implementation on a compute node with multiple sockets, cores and GPUs. The current state-of-the-art in triangle enumeration processes the Friendster graph in 2.1 seconds, not including data copy time between CPU and GPU. Using that metric, our approach is 20 percent faster. When copy times are included, our algorithm takes 3.2 seconds. This is 5.6 times faster than the fastest published CPU-only time. Copyright © 2020, The Authors. All rights reserved.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

EXPLAINABLE ARTIFICIAL INTELLIGENCE (XAI) 2.0: A MANIFESTO OF OPEN CHALLENGES AND INTERDISCIPLINARY RESEARCH DIRECTIONS

arXiv

引用

arXiv 2023年

作者： Longo, Luca Brcic, Mario Cabitza, Federico Choi, Jaesik Confalonieri, Roberto Ser, Javier Del Guidotti, Riccardo Hayashi, Yoichi Herrera, Francisco Holzinger, Andreas Jiang, Richard Khosravi, Hassan Lecue, Freddy Malgieri, Gianclaudio Páez, Andrés Samek, Wojciech Schneider, Johannes Speith, Timo Stumpf, Simone The Artificial Intelligence and Cognitive Load Research Lab Technological University Dublin Ireland University of Zagreb Faculty of Electrical Engineering and Computing Croatia University of Milano-Bicocca Milan Italy IRCCS Ospedale Galeazzi Sant’Ambrogio Milan Italy Kim Jaechul Graduate School of AI Korea Advanced Institute of Science & Technology Korea Republic of INEEJI Corporation Korea Republic of Department of Mathematics University of Padua Italy Derio Spain Bilbao Spain University of Pisa Pisa Italy Department of Computer Science Meiji University Tokyo Japan Department of Computer Science and Artificial Intelligence DaSCI Andalusian Institute in Data Science & Computational Intelligence University of Granada Granada Spain Human-Centered AI Lab University of Natural Resources and Life Sciences Vienna Austria School of Computing and Communications Lancaster University United Kingdom The University of Queensland Brisbane Australia Sophia Antipolis France eLaw Center for Law and Digital Technologies Leiden University Netherlands Department of Philosophy Universidad de los Andes Bogotá Colombia Center for Research & Formation in Artificial Intelligence Universidad de los Andes Bogotá Colombia Technical University of Berlin Berlin Germany Fraunhofer Heinrich Hertz Institute Berlin Germany Berlin Germany Department of Information Systems and Computer Science University of Liechtenstein Liechtenstein Liechtenstein Department of Philosophy University of Bayreuth Bayreuth Germany Center for Perspicuous Computing Saarland University Saarbrücken Germany School of Computing Science University of Glasgow United Kingdom

As systems based on opaque Artificial Intelligence (AI) continue to flourish in diverse real-world applications, understanding these black box models has become paramount. In response, Explainable AI (XAI) has emerged as a field of research with practical and ethical benefits across various domains. This paper not only highlights the advancements in XAI and its application in real-world scenarios but also addresses the ongoing challenges within XAI, emphasizing the need for broader perspectives and collaborative efforts. We bring together experts from diverse fields to identify open problems, striving to synchronize research agendas and accelerate XAI in practical applications. By fostering collaborative discussion and interdisciplinary cooperation, we aim to propel XAI forward, contributing to its continued success. Our goal is to put forward a comprehensive proposal for advancing XAI. To achieve this goal, we present a manifesto of 27 open problems categorized into nine categories. These challenges encapsulate the complexities and nuances of XAI and offer a road map for future research. For each problem, we provide promising research directions in the hope of harnessing the collective intelligence of interested stakeholders. © 2023, CC BY-SA.

关键词： Ethical technology

来源：评论

学校读者我要写书评

暂无评论

On Minimization of Upper Bound for the Convergence Rate of the QHSS Iteration Method

引用

Communications on Applied Mathematics and Computation 2019年第2期1卷 263-282页

作者： Wen-Ting Wu State Key Laboratory of Scientific/Engineering Computing Institute of Computational Mathematics and Scientific/Engineering ComputingAcademy of Mathematics and Systems ScienceChinese Academy of Sciences. P.O. Box 2719. Beijing 100190China School of Mathematical Sciences University of Chinese Academy of SciencesBeijing 100049China

For an upper bound of the spectral radius of the QHSS (quasi Hermitian and skew-Hermitian splitting) iteration matrix which can also bound the contraction factor of the QHSS iteration method,we give its minimum point under the conditions which guarantee that the upper bound is strictly less than one. This provides a good choice of the involved iteration parameters,so that the convergence rate of the QHSS iteration method can be significantly improved.

关键词： System of linear equations Non-Hermitian matrix QHSS iteration method Convergence rate

来源：评论

学校读者我要写书评

暂无评论

DeePMD-kit v3: A Multiple-Backend Framework for Machine Learning Potentials

arXiv

引用

arXiv 2025年

作者： Zeng, Jinzhe Zhang, Duo Peng, Anyang Zhang, Xiangyu He, Sensen Wang, Yan Liu, Xinzijian Bi, Hangrui Li, Yifan Cai, Chun Zhang, Chengqian Du, Yiming Zhu, Jia-Xin Mo, Pinghui Huang, Zhengtao Zeng, Qiyu Shi, Shaochen Qin, Xuejian Yu, Zhaoxi Luo, Chenxing Ding, Ye Liu, Yun-Pei Shi, Ruosong Wang, Zhenyu Bore, Sigbjørn Løland Chang, Junhan Deng, Zhe Ding, Zhaohan Han, Siyuan Jiang, Wanrun Ke, Guolin Liu, Zhaoqing Lu, Denghui Muraoka, Koki Oliaei, Hananeh Singh, Anurag Kumar Que, Haohui Xu, Weihong Xu, Zhangmancang Zhuang, Yong-Bin Dai, Jiayu Giese, Timothy J. Jia, Weile Xu, Ben York, Darrin M. Zhang, Linfeng Wang, Han School of Artificial Intelligence and Data Science Unversity of Science and Technology of China Hefei China AI for Science Institute Beijing100080 China DP Technology Beijing100080 China Academy for Advanced Interdisciplinary Studies Peking University Beijing100871 China State Key Lab of Processors Institute of Computing Technology Chinese Academy of Sciences Beijing100871 China University of Chinese Academy of Sciences Beijing China Baidu Inc. Beijing China Department of Computer Science University of Toronto TorontoON Canada Department of Chemistry Princeton University PrincetonNJ08540 United States University of Chinese Academy of Sciences Beijing100871 China State Key Laboratory of Physical Chemistry of Solid Surfaces iChEM College of Chemistry and Chemical Engineering Xiamen University Xiamen361005 China College of Integrated Circuits Hunan University Changsha410082 China State Key Laboratory of Advanced Technology for Materials Synthesis and Processing Center for Smart Materials and Device Integration School of Material Science and Engineering Wuhan University of Technology Wuhan430070 China College of Science National University of Defense Technology Changsha410073 China Hunan Key Laboratory of Extreme Matter and Applications National University of Defense Technology Changsha410073 China ByteDance Research Beijing100098 China Ningbo Institute of Materials Technology and Engineering Chinese Academy of Sciences Ningbo315201 China College of Materials Science and Opto-Electronic Technology University of Chinese Academy of Sciences Beijing100049 China Key Laboratory of Theoretical and Computational Photochemistry of Ministry of Education College of Chemistry Beijing Normal University Beijing100875 China Department of Geosciences Princeton University PrincetonNJ08544 United States Department of Applied Physics and Applied Mathematics Columbia University New YorkNY10027 United States IKKEM Fujian Xiamen361005 China Graduate

In recent years, machine learning potentials (MLPs) have become indispensable tools in physics, chemistry, and materials science, driving the development of software packages for molecular dynamics (MD) simulations and related applications. These packages, typically built on specific machine learning frameworks such as TensorFlow, PyTorch, or JAX, face integration challenges when advanced applications demand communication across different frameworks. The previous TensorFlow-based implementation of DeePMD-kit exemplified these limitations. In this work, we introduce DeePMD-kit version 3, a significant update featuring a multi-backend framework that supports TensorFlow, PyTorch, JAX, and PaddlePaddle backends, and demonstrate the versatility of this architecture through the integration of other MLPs packages and of Differentiable Molecular Force Field. This architecture allows seamless backend switching with minimal modifications, enabling users and developers to integrate DeePMD-kit with other packages using different machine learning frameworks. This innovation facilitates the development of more complex and interoperable workflows, paving the way for broader applications of MLPs in scientific research. Copyright © 2025, The Authors. All rights reserved.

关键词： Molecular dynamics

来源：评论

学校读者我要写书评

暂无评论

LANDSCAPE APPROXIMATION OF THE GROUND STATE EIGENVALUE FOR GRAPHS AND RANDOM HOPPING MODELS

arXiv

引用

arXiv 2022年

作者： Shou, Laura Wang, Wei Zhang, Shiwen School of Mathematics University of Minnesota 206 Church St SE MinneapolisMN55455 United States LSEC Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China Department of Mathematical Sciences University of Massachusetts Lowell South-wick Hall 11 University Ave. LowellMA01854 United States

We consider the localization landscape function u and ground state eigenvalue λ for operators on graphs. We first show that the maximum of the landscape function is comparable to the reciprocal of the ground state eigenvalue if the operator satisfies certain semigroup kernel upper bounds. This implies general upper and lower bounds on the landscape product λu∞ for several models, including the Anderson model and random hopping (bond-disordered) models, on graphs that are roughly isometric to d, as well as on some fractal-like graphs such as the Sierpinski gasket graph. Next, we specialize to a random hopping model on , and show that as the size of the chain grows, the landscape product λu∞ approaches π2/8 for Bernoulli off-diagonal disorder, and has the same upper bound of π2/8 for Uniform([0,1]) off-diagonal disorder. We also numerically study the random hopping model when the band width (hopping distance) is greater than one, and provide strong numerical evidence that a similar approximation holds for low-lying energies in the spectrum. © 2022, CC BY-NC-ND.

关键词： Ground state

来源：评论

学校读者我要写书评

暂无评论

User grouping and reflective beamforming for IRS-aided URLLC

arXiv

引用

arXiv 2021年

作者： Xie, Hailiang Xu, Jie Liu, Ya-Feng Liu, Liang Ng, Derrick Wing Kwan School of Information Engineering Guangdong University of Technology Guangzhou510006 China Shenzhen518172 China Shenzhen518172 China State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China Department of Electronic and Information Engineering Hong Kong Polytechnic University Hong Kong School of Electrical Engineering and Telecommunications University of New South Wales Australia

This paper studies an intelligent reflecting surface (IRS)-aided downlink ultra-reliable and low-latency communication (URLLC) system, in which an IRS is dedicatedly deployed to assist a base station (BS) to send individual short-packet messages to multiple users. To enhance the URLLC performance, the users are divided into different groups and the messages for users in each group are encoded into a single codeword. By considering the time division multiple access (TDMA) protocol among different groups, our objective is to minimize the total latency for all users subject to their individual reliability requirements, via jointly optimizing the user grouping and block-length allocation at the BS together with the reflective beamforming at the IRS. We solve the latency minimization problem via the alternating optimization, in which the blocklengths and the reflective beamforming are optimized by using the techniques of successive convex approximation (SCA) and semi-definite relaxation (SDR), while the user grouping is updated by K-means and greedy-based methods. Numerical results show that the proposed designs can significantly reduce the communication latency, as compared to various benchmark schemes, which unveil the importance of user grouping and reflective beamforming optimization for exploiting the joint encoding gain and enhancing the worst-case user performance. Copyright © 2021, The Authors. All rights reserved.

关键词： Beamforming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：