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

Integrated Vocal Deviation Index (IVDI): A Machine Learning Model to Classifier of the General Grade of Vocal Deviation

学校读者我要写书评

暂无评论

Journal of Voice 2024年

作者： Lima-Filho, Luiz Medeiros Araujo Lopes, Leonardo Wanderley Filho, Telmo de Menezes e Silva Department of Statistics Member of the Graduate Program in Decision Models and Health Universidade Federal da Paraíba - UFPB Paraíba João Pessoa Brazil Department of Communication Science Disorders Member of the Graduate Program in Decision Models and Health Universidade Federal da Paraíba - UFPB Paraíba João Pessoa Brazil School of Engineering Mathematics and Technology University of Bristol Bristol United Kingdom

Objective: To develop a multiparametric index based on machine learning (ML) to predict and classify the overall degree of vocal deviation (GG). Method: The sample consisted of 300 dysphonic and non-dysphonic participants of both sexes. Two speech tasks were sustained vowel [a] and connected speech (counting numbers from 1 to 10). Five speech-language pathologists performed the auditory-perceptual judgment (APJ) of the GG and the degrees of roughness (GR), breathiness (GB), instability (GI), and strain (GS). We extracted 47 acoustic measurements from these tasks. The APJ result and the acoustic measurements were used to develop the multiparametric index. We used mean absolute error, root mean square error, and coefficient of determination (R²) to select the best model of ML to predict GG and feature importance to select the best set of variables for the index. After classifying the GG between nondysphonic, mild, moderate, and severe, the final model was validated using accuracy, sensitivity, specificity, predictive values, likelihood ratios, F1-Score, and weighted kappa. Results: The gradient boost model showed the best performance among the ML models. Eight features were selected in the model, including four acoustic measures (jitterLoc, smoothed cepstral peak prominenc, mean harmonic-to-noise ratio (HNRmean), and correlation) and four APJ measures (GR, GB, GS, and GI). The final model correctly classified 93.75% of participants and obtained a weighted kappa index of 0.9374, demonstrating the model's excellent performance. Conclusion: The Integrated Vocal Deviation Index includes four acoustic measures and four auditory-perceptual measures and showed excellent performance in classifying voices according to GG. © 2024 The Voice Foundation

关键词： Machine learning—Acoustic—Voice disorders—Dysphonia—Automatic diagnosis.

Reconstruction of Fragmented Trajectories of Collective Motion using Hadamard Deep Autoencoders

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Gajamannage, Kelum Park, Yonggi Paffenroth, Randy Jayasumana, Anura P. Department of Mathematics and Statistics Texas A&M University–Corpus Christi Corpus ChristiTX78412 United States Department of Mathematical Sciences Department of Computer Science Data Science Program Worcester Polytechnic Institute WorcesterMA01609 United States Department of Electrical and Computer Engineering Colorado State University Fort CollinsCO80525 United States

Learning dynamics of collectively moving agents such as fish or humans is an active field in research. Due to natural phenomena such as occlusion and change of illumination, the multi-object methods tracking such dynamics might lose track of the agents where that might result fragmentation in the constructed trajectories. Here, we present an extended deep autoencoder (DA) that we train only on fully observed segments of the trajectories by defining its loss function as the Hadamard product of a binary indicator matrix with the absolute difference between the outputs and the labels. The trajectories of the agents practicing collective motion is low-rank due to mutual interactions and dependencies between the agents that we utilize as the underlying pattern that our Hadamard deep autoencoder (HDA) codes during its training. The performance of our HDA is compared with that of a low-rank matrix completion scheme in the context of fragmented trajectory reconstruction. © 2021, CC BY.

关键词： Learning systems

Parallel Approximations for High-Dimensional Multivariate Normal Probability Computation in Confidence Region Detection Applications

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhang, Xiran Abdulah, Sameh Cao, Jian Ltaief, Hatem Sun, Ying Genton, Marc G. Keyes, David E. Computer Electrical and Mathematical Sciences and Engineering Division King Abdullah University of Science and Technology Saudi Arabia Statistics Program King Abdullah University of Science and Technology Saudi Arabia Extreme Computing Research Center King Abdullah University of Science and Technology Thuwal23955-6900 Saudi Arabia Department of Mathematics The University of Houston HoustonTX United States

Addressing the statistical challenge of computing the multivariate normal (MVN) probability in high dimensions holds significant potential for enhancing various applications. For example, the critical task of detecting confidence regions where a process probability surpasses a specific threshold is essential in diverse applications, such as pinpointing tumor locations in magnetic resonance imaging (MRI) scan images, determining hydraulic parameters in groundwater flow issues, and forecasting regional wind power to optimize wind turbine placement, among numerous others. One common way to compute high-dimensional MVN probabilities is the Separation-of- Variables (SOV) algorithm. This algorithm is known for its high computational complexity of O(n3) and space complexity of O(n2), mainly due to a Cholesky factorization operation for an n × n covariance matrix, where n represents the dimensionality of the MVN problem. This work proposes a high-performance computing framework that allows scaling the SOV algorithm and, subsequently, the confidence region detection algorithm. The framework leverages parallel linear algebra algorithms with a task-based programming model to achieve performance scalability in computing process probabilities, especially on largescale systems. In addition, we enhance our implementation by incorporating Tile Low-Rank (TLR) approximation techniques to reduce algorithmic complexity without compromising the necessary accuracy. To evaluate the performance and accuracy of our framework, we conduct assessments using simulated data and a wind speed dataset. Our proposed implementation effectively handles high-dimensional multivariate normal (MVN) probability computations on shared and distributed-memory systems using finite precision arithmetics and TLR approximation computation. Performance results show a significant speedup of up to 20X in solving the MVN problem using TLR approximation compared to the reference dense solution without sacrificing the

关键词： statistics

On Time Uniform Wong-Zakai Approximation Theorems

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Del Moral, Pierre Hu, Shulan Jasra, Ajay Ruzayqat, Hamza Wang, Xinyu Institut de Mathematiques de Bordeaux Bordeaux33405 France School of Statistics and Mathematics Zhongnan University of Economics and Law China Applied Mathematics and Computational Science Program Computer Electrical and Mathematical Sciences and Engineering Division King Abdullah University of Science and Technology Thuwal23955-6900 Saudi Arabia Wenlan School of Business Zhongnan University of Economics and Law China

We consider the long time behavior of Wong-Zakai approximations of stochastic differential equations. These piecewise smooth diffusion approximations are of great importance in many areas, such as those with ordinary differential equations associated to random smooth fluctuations;e.g. robust filtering problems. In many examples, the mean error estimate bounds that have been derived in the literature can grow exponentially with respect to the time horizon. We show in a simple example that indeed mean error estimates do explode exponentially in the time parameter, i.e. in that case a Wong-Zakai approximation is only useful for extremely short time intervals. Under spectral conditions, we present some quantitative time-uniform convergence theorems, i.e. time-uniform mean error bounds, yielding what seems to be the first results of this type for Wong-Zakai diffusion *** Codes 60H35(Primary), 65C30(Secondary) Copyright © 2023, The Authors. All rights reserved.

关键词： Brownian movement

A Stochastic MPEC Approach for Grid Tariff Design with Demand Side Flexibility

学校读者我要写书评

暂无评论

TechRxiv

TechRxiv 2019年

作者： Askeland, Magnus Burandt, Thorsten Gabriel, Steven A. SINTEF Energy Research Department of Electric Power Engineering Norwegian University of Science and Technology Trondheim Norway Technical University of Berlin The Energy Transportation Environment Department German Institute for Economic Research DIW Berlin Berlin Germany Department of Industrial Economics and Technology Management Norwegian University of Science and Technology Trondheim Norway Department of Mechanical Engineering Applied Math & Statistics Scientific Computation Program University of Maryland College Park Maryland United States

As the end-users increasingly can provide flexibility to the power system, it is important to consider how this flexibility can be activated as a resource for the grid. Electricity network tariffs are one option that can be used to activate this flexibility. Therefore, by designing efficient grid tariffs, it might be possible to reduce the total costs in the power system by incentivizing a change in consumption patterns. This paper provides a methodology for optimal grid tariff design under decentralized decision-making and uncertainty in demand, power prices, and renewable generation. A bilevel model is formulated to adequately describe the interaction between the end-users and a distribution system operator. In addition, a centralized decision-making model is provided for benchmarking purposes. The bilevel model is reformulated as a mixed-integer linear problem solvable by branch-and-cut techniques. Results for a deterministic example and a stochastic case study are presented and discussed. © 2019, CC BY-SA.

关键词： Decision making

Correction to: Enhancing the detection ability of control charts in profile monitoring by adding RBF ensemble model

学校读者我要写书评

暂无评论

Neural Computing and Applications 2022年第23期34卷 21403-21403页

作者： Yeganeh, Ali Shadman, Alireza Abbasi, Saddam Akber Department of Industrial Engineering Faculty of Engineering Ferdowsi University of Mashhad Mashhad Iran Statistics Program Department of Mathematics Statistics and Physics College of Arts and Science Qatar University Doha Qatar Statistical Consulting Unit Department of Mathematics Statistics and Physics College of Arts and Science Qatar University Doha Qatar

Periodicity Scoring of Time Series Encodes Dynamical Behavior of the Tumor Suppressor p53 ⁎ ⁎

学校读者我要写书评

暂无评论

IFAC-PapersOnLine 2021年第9期54卷 488-495页

作者： Caroline Moosmüller Christopher J. Tralie Mahdi Kooshkbaghi Zehor Belkhatir Maryam Pouryahya José Reyes Joseph O. Deasy Allen R. Tannenbaum Ioannis G. Kevrekidis C. Moosmüller and C. Tralie contributed equally to this work Department of Mathematics University of California San Diego La Jolla CA 92093 USA Department of Medical Physics Memorial Sloan-Kettering Cancer Center NY USA Department of Chemical and Biomolecular Engineering Johns Hopkins University Baltimore MD 21218 USA Department of Mathematics and Computer Science Ursinus College Collegeville PA USA Program in Applied and Computational Mathematics Princeton University NJ USA School of Engineering and Sustainable Development De Montfort University Leicester UK Cancer Biology and Genetics Program and Computational and Systems Biology Program Memorial Sloan-Kettering Cancer Center New York NY 10065 USA and Department of Systems Biology Harvard Medical School Boston MA 02115 USA Departments of Computer Science and Applied Mathematics & Statistics Stony Brook University NY USA

In this paper we analyze the dynamical behavior of the tumor suppressor protein p53, an essential player in the cellular stress response, which prevents a cell from dividing if severe DNA damage is present. When this response system is malfunctioning, e.g. due to mutations in p53, uncontrolled cell proliferation may lead to the development of cancer. Understanding the behavior of p53 is thus crucial to prevent its failing. It has been shown in various experiments that periodicity of the p53 signal is one of the main descriptors of its dynamics, and that its pulsing behavior (regular vs. spontaneous) indicates the level and type of cellular stress. In the present work, we introduce an algorithm to score the local periodicity of a given time series (such as the p53 signal), which we call Detrended Autocorrelation Periodicity Scoring (DAPS). It applies pitch detection (via autocorrelation) on sliding windows of the entire time series to describe the overall periodicity by a distribution of localized pitch scores. We apply DAPS to the p53 time series obtained from single cell experiments and establish a correlation between the periodicity scoring of a cell’s p53 signal and the number of cell division events. In particular, we show that high periodicity scoring of p53 is correlated to a low number of cell divisions and vice versa. We show similar results with a more computationally intensive state-of-the-art periodicity scoring algorithm based on topology known as Sw1PerS. This correlation has two major implications: It demonstrates that periodicity scoring of the p53 signal is a good descriptor for cellular stress, and it connects the high variability of p53 periodicity observed in cell populations to the variability in the number of cell division events.

关键词： Systems biology cellular systems time series modeling bioinformatics computational biology

BRAIN-TO-TEXT BENCHMARK’24: LESSONS LEARNED

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Willett, Francis R. Li, Jingyuan Le, Trung Fan, Chaofei Chen, Mingfei Shlizerman, Eli Chen, Yue Zheng, Xin Okubo, Tatsuo S. Benster, Tyler Lee, Hyun Dong Kounga, Maxwell Buchanan, E. Kelly Zoltowski, David Linderman, Scott W. Henderson, Jaimie M. Department of Neurosurgery Stanford University United States Department of Electrical & Computer Engineering University of Washington United States Department of Computer Science Stanford University United States Department of Applied Mathematics University of Washington United States China Neurosciences Phd Program Stanford University United States Wu Tsai Neurosciences Institute Department of Statistics Stanford University United States

Speech brain-computer interfaces aim to decipher what a person is trying to say from neural activity alone, restoring communication to people with paralysis who have lost the ability to speak intelligibly. The Brain-to-Text Benchmark’24 and associated competition was created to foster the advancement of decoding algorithms that convert neural activity to text. Here, we summarize the lessons learned from the competition ending on June 1, 2024 (the top 4 entrants also presented their experiences in a recorded webinar). The largest improvements in accuracy were achieved using an ensembling approach, where the output of multiple independent decoders was merged using a fine-tuned large language model (an approach used by all 3 top entrants). Performance gains were also found by improving how the baseline recurrent neural network (RNN) model was trained, including by optimizing learning rate scheduling and by using a diphone training objective. Improving upon the model architecture itself proved more difficult, however, with attempts to use deep state space models or transformers not yet appearing to offer a benefit over the RNN baseline. The benchmark will remain open indefinitely to support further work towards increasing the accuracy of brain-to-text algorithms. © 2024, CC BY.

关键词： Recurrent neural networks

Learning Interface Conditions in Domain Decomposition Solvers

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Taghibakhshi, Ali Nytko, Nicolas Zaman, Tareq MacLachlan, Scott Olson, Luke West, Matthew Mechanical Science and Engineering University of Illinois Urbana-Champaign UrbanaIL61801 United States Computer Science University of Illinois Urbana-Champaign UrbanaIL61801 United States Scientific Computing Program Memorial University of Newfoundland and Labrador St. John'sNL Canada Mathematics and Statistics Memorial University of Newfoundland and Labrador St. John'sNL Canada

Domain decomposition methods are widely used and effective in the approximation of solutions to partial differential equations. Yet the optimal construction of these methods requires tedious analysis and is often available only in simplified, structured-grid settings, limiting their use for more complex problems. In this work, we generalize optimized Schwarz domain decomposition methods to unstructured-grid problems, using Graph Convolutional Neural Networks (GCNNs) and unsupervised learning to learn optimal modifications at subdomain interfaces. A key ingredient in our approach is an improved loss function, enabling effective training on relatively small problems, but robust performance on arbitrarily large problems, with computational cost linear in problem size. The performance of the learned linear solvers is compared with both classical and optimized domain decomposition algorithms, for both structured- and unstructured-grid problems. © 2022, CC BY.

关键词： Domain decomposition methods