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

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Pedro R. A. S. Bassi Wenxuan Li Yucheng Tang Fabian Isensee Zifu Wang Jieneng Chen Yu-Cheng Chou Saikat Roy Yannick Kirchhoff Maximilian Rokuss Ziyan Huang Jin Ye Junjun He Tassilo Wald Constantin Ulrich Michael Baumgartner Klaus H. Maier-Hein Paul Jaeger Yiwen Ye Yutong Xie Jianpeng Zhang Ziyang Chen Yong Xia Zhaohu Xing Lei Zhu Yousef Sadegheih Afshin Bozorgpour Pratibha Kumari Reza Azad Dorit Merhof Pengcheng Shi Ting Ma Yuxin Du Fan Bai Tiejun Huang Bo Zhao Haonan Wang Xiaomeng Li Hanxue Gu Haoyu Dong Jichen Yang Maciej A. Mazurowski Saumya Gupta Linshan Wu Jiaxin Zhuang Hao Chen Holger Roth Daguang Xu Matthew B. Blaschko Sergio Decherchi Andrea Cavalli Alan L. Yuille Zongwei Zhou Department of Computer Science Johns Hopkins University and Department of Pharmacy and Biotechnology University of Bologna and Center for Biomolecular Nanotechnologies Istituto Italiano di Tecnologia Department of Computer Science Johns Hopkins University NVIDIA Division of Medical Image Computing German Cancer Research Center (DKFZ) and Helmholtz Imaging German Cancer Research Center (DKFZ) ESAT-PSI KU Leuven Division of Medical Image Computing German Cancer Research Center (DKFZ) and Faculty of Mathematics and Computer Science Heidelberg University Division of Medical Image Computing German Cancer Research Center (DKFZ) and Faculty of Mathematics and Computer Science Heidelberg University and HIDSS4Health - Helmholtz Information and Data Science School for Health Shanghai Jiao Tong University Shanghai Artificial Intelligence Laboratory Division of Medical Image Computing German Cancer Research Center (DKFZ) Division of Medical Image Computing German Cancer Research Center (DKFZ) and Pattern Analysis and Learning Group Department of Radiation Oncology Heidelberg University Hospital Helmholtz Imaging German Cancer Research Center (DKFZ) and Interactive Machine Learning Group (IML) DKFZ School of Computer Science and Engineering Northwestern Polytechnical University Australian Institute for Machine Learning The University of Adelaide College of Computer Science and Technology Zhejiang University Hong Kong University of Science and Technology (Guangzhou) Hong Kong University of Science and Technology (Guangzhou) and Hong Kong University of Science and Technology Faculty of Informatics and Data Science University of Regensburg Faculty of Electrical Engineering and Information Technology RWTH Aachen University Faculty of Informatics and Data Science University of Regensburg and Fraunhofer Institute for Digital Medicine MEVIS Electronic & Information Engineering School Harbin Institute of Technology (Shenzhen) Shanghai Jiao Tong University and Beijing Academy of Artificial Intelligence (BAAI) S

ISBN: (纸本)9798331314385

How can we test AI performance? This question seems trivial, but it isn't. Standard benchmarks often have problems such as in-distribution and small-size test sets, oversimplified metrics, unfair comparisons, and short-term outcome pressure. As a consequence, good performance on standard benchmarks does not guarantee success in real-world scenarios. To address these problems, we present Touchstone, a large-scale collaborative segmentation benchmark of 9 types of abdominal organs. This benchmark is based on 5,195 training CT scans from 76 hospitals around the world and 5,903 testing CT scans from 11 additional hospitals. This diverse test set enhances the statistical significance of benchmark results and rigorously evaluates AI algorithms across out-of-distribution scenarios. We invited 14 inventors of 19 AI algorithms to train their algorithms, while our team, as a third party, independently evaluated these algorithms. In addition, we also evaluated pre-existing AI frameworks—which, differing from algorithms, are more flexible and can support different algorithms—including MONAI from NVIDIA, nnU-Net from DKFZ, and numerous other open-source frameworks. We are committed to expanding this benchmark to encourage more innovation of AI algorithms for the medical domain.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Correction to: An investigation of online and offline learning models for online just-in-time software defect prediction

引用

Empirical Software Engineering 2024年第6期29卷 1-2页

作者： Cabral, George G. Minku, Leandro L. Oliveira, Adriano L. I. Pessoa, Dinaldo A. Tabassum, Sadia Department of Computing Federal Rural University of Pernambuco Recife Brazil School of Computer Science University of Birmingham Edgbaston Birmingham UK Center for Informatics Federal University of Pernambuco Recife Brazil Banco Central do Brasil Recife Brazil Department of Informatics King’s College London London UK

来源：评论

学校读者我要写书评

暂无评论

A Review in E-Learning Context: Gamification Elements for Language Learning 1

A Review in E-Learning Context: Gamification Elements for La...

引用

1st International Conference on Technology, Engineering, and computing Applications, ICTECA 2023

作者： Zamahsari, Gamal Kusuma Romadhon, Sahrul Amalia, Mufidah Nur Rifah, Lailatul Prihatini, Arti Saputra, Ardi Wina Faculty of Humanities Bina Nusantara University Digital Language Learning Center Communication Science Department Jakarta Indonesia Indonesian Language Education Study Program Institute of Islamic Religion Madura Pamekasan Indonesia Bina Nusantara University Faculty of Humanities Digital Language Learning Center Computer Science Department Jakarta Indonesia Bina Nusantara University Digital Language Learning Center Visual Communication Design Faculty of Humanities Jakarta Indonesia Unversity of Muhammadiyah Malang Indonesian Language Education Faculty of Teacher Training and Education Malang Indonesia Widya Mandala Catholic University Indonesian Language Education Study Program Surabaya Indonesia

ISBN: (纸本)9798350360554

Recent advancements in e-learning have highlighted the significance of incorporating gamification into language acquisition processes. It is essential to examine the application of learning game features within classroom settings. The foremost goal of this systematic review of literature is to ascertain and thoroughly delineate the elements of gamification considered suitable for incorporation into environments for language learning. This investigation focuses on two main objectives: firstly, to examine the influence of diverse elements of gamification on the enhancement of language abilities, and secondly, to comprehend how these elements shape the educational approaches and experiences of students in a gamified learning environment. The review methodology employed in this study is a systematic literature review of the current literature to comprehensively analyze and map out the effective utilization of gamification in the context of language teaching. The results of our study demonstrate that the deliberate integration of game features can have a substantial impact on student motivation and engagement. Nevertheless, the efficacy of these components is contingent upon the individual attributes of students and the educational goals in question. The paper finishes by providing advice for customizing gamification tactics to accommodate the varying learner profiles in language teaching. Additionally, it suggests potential areas of future research that can contribute to the ongoing development and enhancement of this pedagogical approach. © 2023 IEEE.

关键词： computer aided instruction

来源：评论

学校读者我要写书评

暂无评论

Dynamic network embedding via incremental skip-gram with negative sampling

引用

science China(Information sciences) 2020年第10期63卷 89-107页

作者： Hao PENG Jianxin LI Hao YAN Qiran GONG Senzhang WANG Lin LIU Lihong WANG Xiang REN Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University State Key Laboratory of Software Development Environment Beihang University Collage of Computer Science and Technology Nanjing University of Aeronautics and Astronautics National Computer Network Emergency Response Technical Team/Coordination Center of China Department of Computer Science University of Southern California

Network representation learning, as an approach to learn low dimensional representations of vertices, has attracted considerable research attention recently. It has been proven extremely useful in many machine learning tasks over large graph. Most existing methods focus on learning the structural representations of vertices in a static network, but cannot guarantee an accurate and efficient embedding in a dynamic network scenario. The fundamental problem of continuously capturing the dynamic properties in an efficient way for a dynamic network remains unsolved. To address this issue, we present an efficient incremental skip-gram algorithm with negative sampling for dynamic network embedding, and provide a set of theoretical analyses to characterize the performance guarantee. Specifically, we first partition a dynamic network into the updated, including addition/deletion of links and vertices, and the retained networks over time. Then we factorize the objective function of network embedding into the added, vanished and retained parts of the network. Next we provide a new stochastic gradient-based method, guided by the partitions of the network, to update the nodes and the parameter vectors. The proposed algorithm is proven to yield an objective function value with a bounded difference to that of the original objective function. The first order moment of the objective difference converges in order of O（1/n;）, and the second order moment of the objective difference can be stabilized in order of O（1）. Experimental results show that our proposal can significantly reduce the training time while preserving the comparable performance. We also demonstrate the correctness of the theoretical analysis and the practical usefulness of the dynamic network embedding. We perform extensive experiments on multiple real-world large network datasets over multi-label classification and link prediction tasks to evaluate the effectiveness and efficiency of the proposed framework, and up to

关键词： dynamic network embedding bound and convergence analysis multi-label classification link prediction

来源：评论

学校读者我要写书评

暂无评论

Reverse Engineering of Mobile Banking Applications

引用

computer Systems science & Engineering 2021年第9期38卷 265-278页

作者： Syeda Warda Asher Sadeeq Jan George Tsaramirsis Fazal Qudus Khan Abdullah Khalil Muhammad Obaidullah National Center for Cyber Security Department of Computer Science&Information TechnologyUniversity of Engineering&TechnologyPeshawar25120Pakistan Higher Colleges of Technology Abu Dhabi Women’s CollegeAbu DhabiUAE Department of Information Technology Faculty of Computing and Information TechnologyKing Abdulaziz UniversityJeddah21589Saudi Arabia Department of Computer Software Engineering University of Engineering&TechnologyMardan23200Pakistan

Software reverse engineering is the process of analyzing a software system to extract the design and implementation *** engineering provides the source code of an application,the insight view of the architecture and the third-party *** a security perspective,it is mostly used for finding vulnerabilities and attacking or cracking an *** process is carried out either by obtaining the code in plaintext or reading it through the binaries or ***,reverse engineering is widely used for mobile applications and is considered a security *** Open Web Application Security Project(OWASP),a leading security research forum,has included reverse engineering in its top 10 list of mobile application *** applications are used in many sectors,e.g.,banking,education,*** particular,the banking applications are critical in terms of security as they are used for financial transactions.A security breach of such applications can result in huge financial losses for the customers as well as the *** exist various tools for reverse engineering of mobile applications,however,they have deficiencies,e.g.,complex configurations,lack of detailed analysis *** this research work,we perform an analysis of the available tools for reverse engineering of mobile *** dataset consists of the mobile banking applications of the banks providing services in *** results indicate that none of the existing tools can carry out the complete reverse engineering process as a standalone *** addition,we observe significant differences in terms of the execution time and the number of files generated by each tool for the same file.

关键词： Reverse engineering mobile banking applications security analysis

来源：评论

学校读者我要写书评

暂无评论

SETTP: Style Extraction and Tunable Inference via Dual-level Transferable Prompt Learning

arXiv

引用

arXiv 2024年

作者： Jin, Chunzhen Huang, Yongfeng Wang, Yaqi Cao, Peng Zaiane, Osmar Computer Science and Engineering Northeastern University Shenyang China Key Laboratory of Intelligent Computing in Medical Image of Ministry of Education Northeastern University Shenyang China Department of Computer Science and Engineering The Chinese University of Hong Kong Hong Kong National Frontiers Science Center for Industrial Intelligence and Systems Optimization Shenyang China Amii University of Alberta EdmontonAB Canada

Text style transfer, an important research direction in natural language processing, aims to adapt the text to various preferences but often faces challenges with limited resources. In this work, we introduce a novel method termed Style Extraction and Tunable Inference via Dual-level Transferable Prompt Learning (SETTP) for effective style transfer in low-resource scenarios. First, SETTP learns source style-level prompts containing fundamental style characteristics from high-resource style transfer. During training, the source style-level prompts are transferred through an attention module to derive a target style-level prompt for beneficial knowledge provision in low-resource style transfer. Additionally, we propose instance-level prompts obtained by clustering the target resources based on the semantic content to reduce semantic bias. We also propose an automated evaluation approach of style similarity based on alignment with human evaluations using ChatGPT-4. Our experiments across three resourceful styles show that SETTP requires only 1/20th of the data volume to achieve performance comparable to state-of-the-art (SOTA) methods. In tasks involving scarce data like writing style and role style, SETTP outperforms previous methods by 16.24%. Copyright © 2024, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Generalized representative structures for atomistic systems

arXiv

引用

arXiv 2024年

作者： Goff, James M. Mullen, Coreen Yang, Shizhong Starovoytov, Oleg N. Wood, Mitchell A. Center for Computing Research Sandia National Laboratories AlbuquerqueNM87185 United States Department of Mathematics Computer Science and Engineering Technology Elizabeth City State University Elizabeth CityNC27909 United States Computer Science Department Southern University Baton RougeLA70807 United States Center for Computation and Technology Louisiana State University Baton RougeLA70803 United States

A new method is presented to generate atomic structures that reproduce the essential characteristics of arbitrary material systems, phases, or ensembles. Previous methods allow one to reproduce the essential characteristics (e.g., the chemical disorder) of a large random alloy within a small crystal structure. The ability to generate small representations of random alloys, along with the restriction to crystal systems, results from using the fixed-lattice cluster correlations to describe structural characteristics. A more general description of the structural characteristics of atomic systems is obtained using complete sets of atomic environment descriptors. These are used within for generating representative atomic structures without restriction to fixed lattices. A general data-driven approach is provided here utilizing the atomic cluster expansion (ACE) basis. The N-body ACE descriptors are a complete set of atomic environment descriptors that span both chemical and spatial degrees of freedom and are used within for describing atomic structures. The generalized representative structure (GRS) method presented within generates small atomic structures that reproduce ACE descriptor distributions corresponding to arbitrary structural and chemical complexity. It is shown that systematically improvable representations of crystalline systems on fixed parent lattices, amorphous materials, liquids, and ensembles of atomic structures may be produced efficiently through optimization algorithms. With the GRS method, we highlight reduced representations of atomistic machine-learning training datasets that contain similar amounts of information and small 40-72 atom representations of liquid phases. The ability to use GRS methodology as a driver for informed novel structure generation is also demonstrated. The advantages over other data-driven methods and state-of-the-art methods restricted to high-symmetry systems are highlighted. © 2024, CC BY.

关键词： Crystal lattices

来源：评论

学校读者我要写书评

暂无评论

Strong Current in Carbon Nanoconductors: Mechanical and Magnetic Stability

SSRN

引用

SSRN 2024年

作者： Brandbyge, Mads Leitherer, Susanne Papior, Nick Department of Chemistry University of Copenhagen CopenhagenDK-2100 Denmark DTU Computing Center Department of Applied Mathematics and Computer Science Technical University of Denmark Kongens LyngbyDK-2800 Denmark Department of Physics Technical University of Denmark Kongens LyngbyDK-2800 Denmark

Carbon nanoconductors are known to have extraordinary mechanical strength and interestingmagnetic properties. Moreover, nanoconductors based on one- or two-dimensional carbon allotropesdisplay a very high current-carrying capacity and ballistic transport. Here, we employa recent, simple approach based on density functional theory to analyze the impact of strongcurrent on the mechanical and magnetic properties of carbon nanoconductors. We find that theinfluence of the current itself on the bond-strength of carbon in general is remarkably low comparedto e.g. typical metals. This is demonstrated for carbon chains, carbon nanotubes, grapheneand polyacetylene. We can trace this to the strong binding and electronic bandstructure. On theother hand, we find that the current significanly change the magnetic properties. In particular, wefind that currents in graphene zig-zag edge states quench the magnetism. © 2024, The Authors. All rights reserved.

关键词： Density functional theory

来源：评论

学校读者我要写书评

暂无评论

Heuristic Elastic Scaling for Kubernetes Heterogeneous Microservices

Heuristic Elastic Scaling for Kubernetes Heterogeneous Micro...

引用

IEEE International Conference on Networking, Sensing and Control

作者： Song Wang Sheng He Yishuang Ning Xiang Gao Zhijun Ding Department of Computer Science and Technology Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Tongji University Shanghai China Kingdee Research Kingdee International Software Group Co. Ltd Shenzhen China Intelligent Computing Facility Innovation Center ZhejiangLab Hangzhou China

ISBN: (数字)9798350365221

ISBN: (纸本)9798350365238

Kubernetes has become the basic platform for building cloud native applications. However, existing horizontal scaling methods based on Kubernetes have problems with resource redundancy. Furthermore, the combined horizontal and vertical scaling based on Kubernetes takes a long time. Regarding the issue above, first, we describe the execution processes of three scaling techniques and compare them in different dimensions; second, we construct a formal elastic scaling model for expansion scenarios, with the goal of minimizing the total cost; and third, we introduce a heuristic expansion algorithm after balancing resource redundancy and execution time as the heuristic information. The experiment results show that the elastic scaling algorithm proposed in this paper achieves better performance than other algorithms.

关键词： Costs Heuristic algorithms Redundancy Buildings Microservice architectures Sensors

来源：评论

学校读者我要写书评

暂无评论

Strong current in carbon nanoconductors: Mechanical and magnetic stability

arXiv

引用

arXiv 2024年

作者： Leitherer, Susanne Papior, Nick R. Brandbyge, Mads Department of Chemistry University of Copenhagen CopenhagenDK-2100 Denmark DTU Computing Center Department of Applied Mathematics and Computer Science Technical University of Denmark Kongens LyngbyDK-2800 Denmark Department of Physics Technical University of Denmark Kongens LyngbyDK-2800 Denmark

Carbon nanoconductors are known to have extraordinary mechanical strength and interesting magnetic properties. Moreover, nanoconductors based on one- or two-dimensional carbon allotropes display a very high current-carrying capacity and ballistic transport. Here, we employ a recent, simple approach based on density functional theory to analyze the impact of strong current on the mechanical and magnetic properties of carbon nanoconductors. We find that the influence of the current itself on the bond-strength of carbon in general is remarkably low compared to e.g. typical metals. This is demonstrated for carbon chains, carbon nanotubes, graphene and polyacetylene. We can trace this to the strong binding and electronic bandstructure. On the other hand, we find that the current significanly change the magnetic properties. In particular, we find that currents in graphene zig-zag edge states quench the magnetism. © 2024, CC BY.

关键词： Magnetic properties

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：