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

arXiv 2025年

作者： Ozbulak, Utku Anzaku, Esla Timothy Kang, Solha De Neve, Wesley Vankerschaver, Joris Center for Biosystems and Biotech Data Science Ghent University Global Campus Korea Republic of Department of Electronics and Information Systems Ghent University Belgium Department of Applied Mathematics Computer Science and Statistics Ghent University Belgium

Machine learning (ML) research strongly relies on benchmarks in order to determine the relative effectiveness of newly proposed models. Recently, a number of prominent research effort argued that a number of models that improve the state-of-the-art by a small margin tend to do so by winning what they call a "benchmark lottery". An important benchmark in the field of machine learning and computer vision is the ImageNet where newly proposed models are often showcased based on their performance on this dataset. Given the large number of self-supervised learning (SSL) frameworks that has been proposed in the past couple of years each coming with marginal improvements on the ImageNet dataset, in this work, we evaluate whether those marginal improvements on ImageNet translate to improvements on similar datasets or not. To do so, we investigate twelve popular SSL frameworks on five ImageNet variants and discover that models that seem to perform well on ImageNet may experience significant performance declines on similar datasets. Specifically, state-of-the-art frameworks such as DINO and Swav, which are praised for their performance, exhibit substantial drops in performance while MoCo and Barlow Twins displays comparatively good results. As a result, we argue that otherwise good and desirable properties of models remain hidden when benchmarking is only performed on the ImageNet validation set, making us call for more adequate benchmarking. To avoid the "benchmark lottery" on ImageNet and to ensure a fair benchmarking process, we investigate the usage of a unified metric that takes into account the performance of models on other ImageNet variant datasets. Copyright © 2025, The Authors. All rights reserved.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Locating Domination Set in Some Subclasses of B_1-Vpg Graphs and B_1-Epg Graphs

SSRN

引用

SSRN 2025年

作者： Yang, Yu Wang, Cai-Xia Xu, Shou-Jun Gutin, Gregory School of Mathematics and Statistics Gansu Key Laboratory of Applied Mathematics and Complex Systems Lanzhou University Gansu Lanzhou730000 China Department of Computer Science Royal Holloway University of London United Kingdom School of Mathematical Sciences LPMC Nankai University China

A graph G is a B_k-VPG graph if there exists an integer k such that each vertex corresponds to an orthogonal path in the plane with at most k bends. Two vertices $u$ and v in V(G) are adjacent if and only if the corresponding paths intersect.A graph G is said to be a B_k-EPG graph if there exists an integer k such that G has a string representation on a grid where each vertex corresponds to an orthogonal path (string) with at most $k$ bends. Two vertices u and v in V(G) are adjacent if and only if the corresponding paths share at least one grid *** consider the problems of finding optimal locating dominating sets, open locating dominating sets, and identifying codes of B_{k}-VPG (resp., B_{k}-EPG) graphs. We prove that the decision problems associated with these three notions are NP-complete in grid graphs (a subclass of unit B_{0}-VPG graphs). Secondly, we give an O(k^{2})-approximation algorithm for the dominating set problem on unit B_{k}-VPG graphs, improving the previous O(k^{4})-approximation algorithm of Chakraborty et al. \cite{dsj22}. Moreover, we show that the decision problem of locating dominating set is NP-complete on a subclass of B_{1}-EPG graphs, and we also show that the minimum locating dominating set problem is APX-hard on B_{1}-EPG graphs, ruling out the possibility of a PTAS unless P=***, we give a linear-time labeling algorithm for finding optimal locating dominating sets on the cactus graphs, which are a subclass of B_{1}-EPG graphs. © 2025, The Authors. All rights reserved.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

A Survey on Decentralized Identifiers and Verifiable Credentials

引用

IEEE Communications Surveys and Tutorials 2025年

作者： Mazzocca, Carlo Acar, Abbas Uluagac, Selcuk Montanari, Rebecca Bellavista, Paolo Conti, Mauro University of Salerno Department of Information and Electrical Engineering and Applied Mathematics Fisciano84084 Italy Florida International University Cyber-Physical Systems Security Lab School of Computing and Information Science MiamiFL33174 United States University of Bologna Department of Computer Science and Engineering Bologna40136 Italy University of Padua Department of Mathematics Padua35131 Italy

Digital identity has always been one of the keystones for implementing secure and trustworthy communications among parties. The ever-evolving digital landscape has undergone numerous technological transformations that have profoundly reshaped digital identity management, leading to a major shift from centralized to decentralized identity models. The latest stage of this evolution is represented by the emerging paradigm of Self-Sovereign Identity (SSI), which gives identity owners full control over their data. SSI leverages Decentralized Identifiers (DIDs) and Verifiable Credentials (VCs), which have been recently standardized by theWorldWideWeb Consortium (W3C). These technologies have the potential to build more secure and decentralized digital identity systems, significantly strengthening communication security in scenarios involving many distributed participants. It is worth noting that use of DIDs and VCs is not limited to individuals but extends to a wide range of entities including cloud, edge, and Internet of Things (IoT) resources. However, due to their novelty, existing literature lacks a comprehensive survey on DIDs and VCs beyond the scope of SSI. This paper fills this gap by providing a comprehensive overview of DIDs and VCs from multiple perspectives. It identifies key security threats and mitigation strategies, analyzes available implementations to guide practitioners in making informed decisions, and reviews the adoption of these technologies across various application domains. Moreover, it also examines related regulations, projects, and consortiums emerging worldwide. Finally, it discusses the primary challenges hindering their real-world adoption and outlines future research directions. © 1998-2012 IEEE.

关键词： Decentralized control

来源：评论

学校读者我要写书评

暂无评论

On the -differential spectra of two classes of power functions over finite fields

引用

Applicable Algebra in Engineering, Communication and Computing 2025年 1-30页

作者： Liu, Qian Huang, Zhiwei Chen, Zhixiong Jiang, Rong Zhang, Liupiao Key Laboratory of Information Security of Network Systems College of Computer and Data Science Fuzhou University Fuzhou China Hubei Key Laboratory of Applied Mathematics Faculty of Mathematics and Statistics Hubei University Wuhan China Yunnan Key Laboratory of Service Computing Yunnan University of Finance and Economics Kunming China Fujian Key Laboratory of Financial Information Processing Putian University Putian China School of Computer Science and Technology Dongguan University of Technology Dongguan China

Recently, a new concept called multiplicative differential was introduced by Ellingsen et al. [7]. As an extension of the differential uniformity, it is theoretically appealing to determine the properties of c-differential uniformity and the corresponding c-differential spectrum. In this paper, based on certain quadratic character sums and two special elliptic curves over $$\mathbb {F}_p$$ , the $$(-1)$$ -differential spectra of the following two classes of power functions over $$\mathbb {F}_{p^n}$$ is completely determined: (1) $$f_1(x)=x^{\frac{p^n+3}{2}}$$ , where $$p>3$$ and $$p\equiv 3\pmod 4$$ ; (2) $$f_2(x)=x^{p^n-3}$$ , where $$p>3$$ . The obtained result shows that the $$(-1)$$ -differential spectra of $$f_1(x)$$ and $$f_2(x)$$ can be expressed explicitly in terms of n. Moreover, an upper bound of the c-differential uniformity of $$f_2(x)$$ is given.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Joint Optimization of Wireless Charging Station Location and Operation Scheduling for Electric Buses under Uncertain Demand

引用

IEEE Access 2025年 13卷 91765-91776页

作者： Li, Jiacheng Noto, Masato Zhang, Yang Guo, Jia Kanagawa University Department of Applied Systems and Mathematics Yokohama Japan Kanagawa University Department of Computer Science Yokohama Japan Hubei Key Laboratory of Digital Finance Innovation Hubei University of Economics Wuhan China Hosei University Graduate School of Computer and Information Sciences Tokyo Japan Hubei University of Economics Japan School of Information Engineering Hubei Wuhan430205 China

In the context of electric bus route operations, the introduction of wireless charging facilities significantly impacts the operational scheduling of bus fleets. This study focuses on a single bus route and proposes a joint optimization model for determining departure frequencies and charging station locations under uncertain demand conditions. The model aims to minimize both user travel costs and transit operation costs by jointly optimizing departure schedules across different time periods, electric bus assignments, and wireless charging station placement. An adaptive genetic algorithm (AGA) is developed to solve the model efficiently. A case study based on a real-world bus route in China demonstrates that the proposed strategy not only improves system performance but also yields tangible benefits—reducing the required number of electric buses by 29.4%, shortening departure intervals by 12.5%, and lowering daily operational costs by 10.5%. © 2013 IEEE.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Towards Improved Cervical Cancer Screening: Vision Transformer-Based Classification and Interpretability

Towards Improved Cervical Cancer Screening: Vision Transform...

引用

IEEE International Symposium on Biomedical Imaging

作者： Khoa Tuan Nguyen Ho-Min Park Gaeun Oh Joris Vankerschaver Wesley De Neve Department of Environmental Technology Food Technology and Molecular Biotechnology Center for Biosystems and Biotech Data Science Ghent University Global Campus Incheon Korea Department of Electronics and Information Systems IDLab Ghent University Ghent Belgium Department of Applied Mathematics Computer Science and Statistics Ghent University Ghent Belgium

ISBN: (数字)9798331520526

ISBN: (纸本)9798331520533

We propose a novel approach to cervical cell image classification for cervical cancer screening using the EVA-02 transformer model. We developed a four-step pipeline: fine-tuning EVA-02, feature extraction, selecting important features through multiple machine learning models, and training a new artificial neural network with optional loss weighting for improved generalization. With this design, our best model achieved an F1-score of 0.85227, outperforming the baseline EVA-02 model (0.84878). We also utilized Kernel SHAP analysis and identified key features correlating with cell morphology and staining characteristics, providing interpretable insights into the decision-making process of the fine-tuned model. Our code is available at https://***/Khoa-NT/isbi2025_ps3c.

关键词： Training Pipelines Decision making Artificial neural networks Feature extraction Transformers Kernel Cervical cancer Image classification Biomedical imaging

来源：评论

学校读者我要写书评

暂无评论

Local Thermal Non-Equilibrium Models in Porous Media: A Comparative Study of Conduction Effects

arXiv

引用

arXiv 2025年

作者： Kostelecky, Anna Mareike Stefansson, Ivar Bringedal, Carina Ghosh, Tufan Dahle, Helge K. Helmig, Rainer Institute for Modelling Hydraulic and Environmental Systems Univeristy of Stuttgart Stuttgart Germany Department of Mathematics University of Bergen Bergen Norway Center for Modeling of Coupled Subsurface Dynamics Department of Mathematics University of Bergen Bergen Norway Department of Computer science Electrical engineering and Mathematical sciences Western Norway University of Applied Sciences Bergen Norway

Instantaneous heat transfer between different phases is a common assumption for modeling heat transfer in porous media, known as Local Thermal Equilibrium (LTE). This assumption may not hold in certain technical and environmental applications, especially in systems with large temperature gradients, large differences in thermal properties, or high velocities. Local Thermal Non-Equilibrium (LTNE) models aim to describe heat transfer processes when the LTE assumption may fail. In this work, we compare three continuum-scale models from the pore to the representative elementary volume (REV) scale. Specifically, dual-network and REV-scale models are evaluated against a pore-resolved model, which we perceive as a reference in the absence of experimental results. Different effective models are used to obtain upscaled properties on the REV scale and to compare resulting temperature profiles. The systems investigated are fully saturated, consisting of one fluid and one solid phase. This study focuses on purely conductive systems without significant differences in thermal properties. Results show that LTE holds then for low interfacial resistances. However, for large interfacial resistances, solid and fluid temperatures differ. The REV-scale model with effective parameters obtained by homogenization leads to similar results as the pore-resolved model, whereas the dual-network model shows greater deviation due to its fixed spatial resolution. Among the evaluated effective parameter formulations for the REV-scale model, only the homogenization-based approach captures the LTNE behavior, as it incorporates the interfacial heat transfer coefficient. Convection is relevant for most practical applications, and its impact will be addressed in a follow-up article. © 2025, CC BY.

关键词： Electric heating

来源：评论

学校读者我要写书评

暂无评论

A Regularized Newton Method for Nonconvex Optimization with Global and Local Complexity Guarantees

arXiv

引用

arXiv 2025年

作者： Zhou, Yuhao Xu, Jintao Bao, Chenglong Ding, Chao Zhu, Jun Department of Computer Science and Technology Tsinghua AI Insitute BNList Lab Tsinghua-Bosch Joint Center for ML Tsinghua University China Department of Applied Mathematics The Hong Kong Polytechnic University Hong Kong Yau Mathematical Sciences Center Tsinghua University Beijing Institute of Mathematical Sciences and Applications China Academy of Mathematics and Systems Science Chinese Academy of Sciences China

We consider the problem of finding an ϵ-stationary point of a nonconvex function with a Lipschitz continuous Hessian and propose a quadratic regularized Newton method incorporating a new class of regularizers constructed from the current and previous gradients. The method leverages a recently developed linear conjugate gradient approach with a negative curvature monitor to solve the regularized Newton equation. Notably, our algorithm is adaptive, requiring no prior knowledge of the Lipschitz constant of the Hessian, and achieves a global complexity of O(ϵ−3 2 ) + Õ(1) in terms of the second-order oracle calls, and Õ(ϵ−7 4 ) for Hessian-vector products, respectively. Moreover, when the iterates converge to a point where the Hessian is positive definite, the method exhibits quadratic local convergence. Preliminary numerical results illustrate the competitiveness of our algorithm. Copyright © 2025, The Authors. All rights reserved.

关键词： Newton-Raphson method

来源：评论

学校读者我要写书评

暂无评论

Theory of phase reduction for systems with higher-order interactions: a route to Kuramoto models on hypergraphs

arXiv

引用

arXiv 2025年

作者： León, Iván Muolo, Riccardo Hata, Shigefumi Nakao, Hiroya Department of Applied Mathematics and Computer Science Universidad de Cantabria Santander39005 Spain Department of Systems and Control Engineering Tokyo Institute of Technology Tokyo152-8552 Japan Graduate School of Science and Engineering Kagoshima University Kagoshima890-0065 Japan Research Center for Autonomous Systems Materialogy Institute of Innovative Research Tokyo Institute of Technology Yokohama226-8501 Japan

Phase reduction is a powerful technique in the study of nonlinear oscillatory systems. Under certain assumptions, it allows us to describe each multidimensional oscillator by a single phase variable, giving rise to simple phase models such as the Kuramoto model. Classically, the method has been applied in the case where the interactions are only pairwise (two-body). However, increasing evidence shows that interactions in real-world systems are not pairwise but higher-order, i.e., many-body. Although synchronization in higher-order systems has received much attention, analytical results are scarce because of the highly nonlinear nature of the framework. In this paper, we fill the gap by presenting a general theory of phase reduction for the case of higher-order interactions. We show that the higher-order topology is preserved in the phase reduced model at the first order and that only odd couplings have an effect on the dynamics when certain symmetries are present. Additionally, we show the power and ductility of the phase reduction approach by applying it to a population of Stuart-Landau oscillators with an all-to-all configuration and with a ring-like hypergraph topology;in both cases, only the analysis of the phase model can provide insights and analytical results. © 2025, CC BY-NC-ND.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Context Preservation Through Eye Tracking: Adaptive Reading Application Design for an Optimal Reading Experience 25

Context Preservation Through Eye Tracking: Adaptive Reading ...

引用

Proceedings of the 2025 Symposium on Eye Tracking Research and Applications

作者： Helena Eschricht Jensen Chaudhary Muhammad Aqdus Ilyas Ashkan Tashk Bart Cooreman Sofie Beier Per Bækgaard Denmark Technical University Kgs. Lyngby Denmark Department of Applied Mathematics and Computer Science Section for Cognitive Systems Denmark Technical University Kgs. Lyngby Denmark Centre for Visibility Design Royal Danish Academy Copenhagen Denmark Royal Danish Academy Copenhagen Denmark

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：