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

arXiv 2025年

作者： Tsangko, Iosif Triantafyllopoulos, Andreas Müller, Michael Schröter, Hendrik Schuller, Björn W. EIHW – Chair of Embedded Intelligence for Health Care and Wellbeing University of Augsburg Germany CHI – Chair of Health Informatics Technical University of Munich Germany MCML – Munich Center for Machine Learning Munich Germany WS Audiology Research and Development Erlangen Germany GLAM – Group on Language Audio & Music Imperial College London United Kingdom MDSI – Munich Data Science Institute Munich Germany

The DeepFilterNet (DFN) architecture was recently proposed as a deep learning model suited for hearing aid devices. Despite its competitive performance on numerous benchmarks, it still follows a ‘one-size-fits-all’ approach, which aims to train a single, monolithic architecture that generalises across different noises and environments. However, its limited size and computation budget can hamper its generalisability. Recent work has shown that in-context adaptation can improve performance by conditioning the denoising process on additional information extracted from background recordings to mitigate this. These recordings can be offloaded outside the hearing aid, thus improving performance while adding minimal computational overhead. We introduce these principles to the DFN model, thus proposing the DFingerNet (DFiN) model, which shows superior performance on various benchmarks inspired by the DNS Challenge. Copyright © 2025, The Authors. All rights reserved.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

Preface

Cognitive Technologies

引用

Cognitive Technologies 2025年 Part F287卷 v-vi页

作者： Schulz, Daniel Bauckhage, Christian Research Center Machine Learning Fraunhofer Institute for Intelligent Analysis and Information Systems IAIS Sankt Nordrhein-Westfalen Augustin Germany Fraunhofer Institute for Intelligent Analysis and Information Systems Sankt Nordrhein-Westfalen Augustin Germany

来源：评论

学校读者我要写书评

暂无评论

Evaluating the Impact of Special Characters on Password Security: a Comparative analysis

引用

IEEE Network 2025年

作者： He, Daojing Liu, Zhiyong Chan, Sammy Zhou, Beibei Guizani, Mohsen Harbin Institute of Technology School of Computer Science and Technology Shenzhen China Guizhou University State Key Laboratory of Public Big Data Guizhou China Research and Development Center Guangzhou Jingyuan Security Technology Co. Ltd Guangzhou China City University of Hong Kong Kowloon Department of Electrical Engineering Hong Kong Hong Kong Shanghai Urban Construction Vocational College School of Artificial Intelligence Application Shanghai China Machine Learning Department Abu Dhabi United Arab Emirates

Text-based password authentication remains essential for identity verification on internet platforms and blockchain systems. However, as computational power advances, security threats to user passwords have intensified, raising concerns about their effectiveness. While special characters (i.e., non-alphanumeric symbols, which include punctuation marks, mathematical symbols, and other non-letter/number characters like '.', '@', '#', '$', and similar) are often recommended to enhance password strength, the National Institute of Standards and Technology (NIST) prioritizes length over complexity, challenging their necessity. This study fills a critical gap in understanding user behavior regarding special character usage. By analyzing 15 datasets from Chinese, English, and German languages, we examined patterns of special character incorporation and their impact on password strength. Our findings indicate that users frequently employ predictable methods for including special characters, potentially compromising security, especially under stringent policies. We present three key contributions: (1) an analysis of special character usage patterns, (2) a quantitative assessment of strength differences using the PCFGv4.1 model, and (3) actionable recommendations for stakeholders to enhance password security practices. This research further advocates for aligning password policies with user behavior for more effective security. © 1986-2012 IEEE.

关键词： Authentication Protocol

来源：评论

学校读者我要写书评

暂无评论

IRIS: A Bayesian Approach for Image Reconstruction in Radio Interferometry with expressive Score-Based priors

arXiv

引用

arXiv 2025年

作者： Dia, Noé Yantovski-Barth, M.J. Adam, Alexandre Bowles, Micah Perreault-Levasseur, Laurence Hezaveh, Yashar Scaife, Anna Université de Montréal Montréal Canada Mila - Quebec Artificial Intelligence Institute Montréal Canada Ciela - Montreal Institute for Astrophysical Data Analysis and Machine Learning Montréal Canada Department of Astrophysics University of Oxford Oxford United Kingdom Flatiron Institute Center for Computational Astrophysics New York United States Perimeter Institute Waterloo Canada Trottier Space Institute McGill University Montréal Canada University of Manchester Manchester United Kingdom The Alan Turing Institute United Kingdom

Inferring sky surface brightness distributions from noisy interferometric data in a principled statistical framework has been a key challenge in radio astronomy. In this work, we introduce Imaging for Radio Interferometry with Score-based models (IRIS). We use score-based models trained on optical images of galaxies as an expressive prior in combination with a Gaussian likelihood in the uv-space to infer images of protoplanetary disks from visibility data of the DSHARP survey conducted by ALMA. We demonstrate the advantages of this framework compared with traditional radio interferometry imaging algorithms, showing that it produces plausible posterior samples despite the use of a misspecified galaxy prior. Through coverage testing on simulations, we empirically evaluate the accuracy of this approach to generate calibrated posterior samples. Our code is open source and freely available at https://***/EnceladeCandy/IRIS. © 2025, CC BY.

关键词： Gaussian distribution

来源：评论

学校读者我要写书评

暂无评论

learning Counterfactual Outcomes Under Rank Preservation

arXiv

引用

arXiv 2025年

作者： Wu, Peng Li, Haoxuan Zheng, Chunyuan Zeng, Yan Chen, Jiawei Liu, Yang Guo, Ruocheng Zhang, Kun School of Mathematics and Statistics Beijing Technology and Business University China Center for Data Science Peking University China School of Mathematical Sciences Peking University China College of Computer Science and Technology Zhejiang University China Computer Science and Engineering University of California Santa Cruz Bolivia ByteDance Research China Department of Philosophy Carnegie Mellon University United States Machine Learning Department Mohamed bin Zayed University of Artificial Intelligence United Arab Emirates

Counterfactual inference aims to estimate the counterfactual outcome at the individual level given knowledge of an observed treatment and the factual outcome, with broad applications in fields such as epidemiology, econometrics, and management science. Previous methods rely on a known structural causal model (SCM) or assume the homogeneity of the exogenous variable and strict monotonicity between the outcome and exogenous variable. In this paper, we propose a principled approach for identifying and estimating the counterfactual outcome. We first introduce a simple and intuitive rank preservation assumption to identify the counterfactual outcome without relying on a known structural causal model. Building on this, we propose a novel ideal loss for theoretically unbiased learning of the counterfactual outcome and further develop a kernel-based estimator for its empirical estimation. Our theoretical analysis shows that the rank preservation assumption is not stronger than the homogeneity and strict monotonicity assumptions, and shows that the proposed ideal loss is convex, and the proposed estimator is unbiased. Extensive semi-synthetic and real-world experiments are conducted to demonstrate the effectiveness of the proposed method. Copyright © 2025, The Authors. All rights reserved.

关键词： Contrastive learning

来源：评论

学校读者我要写书评

暂无评论

WiViPose: A Video-aided Wi-Fi Framework for Environment-Independent 3D Human Pose Estimation

引用

IEEE Transactions on Multimedia 2025年

作者： Zhang, Lei Ning, Haoran Tang, Jiaxin Chen, Zhenxiang Zhong, Yaping Han, Yahong Tianjin University College of Intelligence and Computing the Tianjin Key Laboratory of Advanced Network Technology and Application Tianjin300050 China Key Laboratory of Computing Power Network and Information Security Ministry of Education China University of Jinan Shandong Provincial Key Laboratory of Ubiquitous Intelligent Computing the School of Information Science and Engineering Jinan250022 China Wuhan Sports University Sports Big-data Research Center Wuhan430079 China Tianjin University College of Intelligence and Computing the Tianjin Key Laboratory of Machine Learning Tianjin300350 China

The inherent complexity of Wi-Fi signals makes video-aided Wi-Fi 3D pose estimation difficult. The challenges include the limited generalizability of the task across diverse environments, its significant signal heterogeneity, and its inadequate ability to analyze local and geometric information. To overcome these challenges, we introduce WiViPose, a video-aided Wi-Fi framework for 3D pose estimation, which attains enhanced cross-environment generalization through cross-layer optimization. Bilinear temporal-spectral fusion (BTSF) is initially used to fuse the time-domain and frequency-domain features derived from Wi-Fi. Video features are derived from a multiresolution convolutional pose machine and enhanced by local self-attention. Cross-modality data fusion is facilitated through an attention-based transformer, with the process further refined under a supervisory mechanism. WiViPose demonstrates effectiveness by achieving an average percentage of correct keypoints (PCK)@50 of 91.01% across three typical indoor environments. © 2025 IEEE.

关键词： Frequency domain analysis

来源：评论

学校读者我要写书评

暂无评论

Pitfalls of Epistemic Uncertainty Quantification through Loss Minimisation 36

Pitfalls of Epistemic Uncertainty Quantification through Los...

引用

36th Conference on Neural Information Processing Systems, NeurIPS 2022

作者： Bengs, Viktor Hüllermeier, Eyke Waegeman, Willem Germany Munich Center for Machine Learning Germany Department of Data Analysis and Mathematical Modeling Ghent University Belgium

ISBN: (纸本)9781713871088

Uncertainty quantification has received increasing attention in machine learning in the recent past. In particular, a distinction between aleatoric and epistemic uncertainty has been found useful in this regard. The latter refers to the learner's (lack of) knowledge and appears to be especially difficult to measure and quantify. In this paper, we analyse a recent proposal based on the idea of a second-order learner, which yields predictions in the form of distributions over probability distributions. While standard (first-order) learners can be trained to predict accurate probabilities, namely by minimising suitable loss functions on sample data, we show that loss minimisation does not work for second-order predictors: The loss functions proposed for inducing such predictors do not incentivise the learner to represent its epistemic uncertainty in a faithful way. © 2022 Neural information processing systems foundation. All rights reserved.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

Method for Finding an Investment Strategy in the Case of a Sparse Covariance Matrix 17

Method for Finding an Investment Strategy in the Case of a S...

引用

17th International Conference on Management of Large-Scale System Development, MLSD 2024

作者： Gorelik, Victor Zolotova, Tatiana Federal Research Center 'Computer Science and Control' of the Russian Academy of Sciences Department of Simulation Systems and Operations Research Moscow Russia Financial University under the Government of the Russian Federation Department of Data Analysis and Machine Learning Moscow Russia

An optimality principle is proposed for making investment decisions based on efficiency and risk assessments with a sparse covariance matrix. The method is implemented as a program with a graphical interface and demon... 详细信息

ISBN: (纸本)9798350375718

关键词： Marketplaces

来源：评论

学校读者我要写书评

暂无评论

Investor Risk Profile Determination Model 16

Investor Risk Profile Determination Model

引用

16th International Conference Management of Large-Scale System Development, MLSD 2023

ISBN: (纸本)9798350337907

An assessment of the investor's risk profile is proposed as a risk coefficient in a model with a linear convolution of expected return and variance. The value of the risk coefficient is found from solving the optimization problem of the model with a limitation on profitability. The proposed method is implemented in the form of a software package using the example of the stock market. © 2023 IEEE.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Support vector novelty detection in hidden space

引用

Journal of Computational Information Systems 2011年第15期7卷 5581-5590页

作者： Zhang, Li Wang, Bangjun Li, Fanzhang He, Shuping Research Center of Machine Learning and Data Analysis School of Computer Science and Technology Soochow University Suzhou 215006 China

In this paper, a family of support vector novelty detection (or SVND) in hidden space is presented. Firstly a hidden-space SVND (or HSVND) algorithm is proposed. The data in an input space is mapped into a hidden space by using some hidden function. In the hidden space, we can perform the SVND with linear kernel. The advantage of HSVND over SVND is that a hidden function can be an arbitrary real-valued function including Mercer kernels and their combination. In SVND algorithm, only Mercer kernels can be used. Unfortunately, the mapped data may be non-spherical distributed data. In this case, HSVND works badly. Secondly a whitening HSVND (WHSVND) is proposed. We perform whitening method on the mapped data and then the SVND with linear kernel. The whitened data is spherical approximately. We prove that WHSVND is identical to whitening SVND (WSVND) if a single and same Mercer kernel is taken as a mapping function. In fact, above algorithms cannot work well if the data locates a subspace of input sample space or is rank deficiency. In this case, a mapping function only maps data from one subspace to another subspace and cannot make data spanning whole sample space. Thus noised and whitening HSVND (NWHSVND) is present for kernel mapping function. Before the data is mapped, some small randomly noise is put on it. Based on the noised data, the data is mapped into the hidden space. Next we whiten the mapped data, and perform the SVND with linear kernel. Experiments are performed on artificial and real-world data. © 2011 Binary Information Press December, 2011.

关键词： Vectors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：