We present a meta-learning framework that leverages Long Short-Term Memory (LSTM) neural networks to accelerate parameter initialization in quantum chemical simulations using the Variational Quantum Eigensolver (VQE)....
详细信息
In this study, we explore the classification and prediction capabilities of three models—Genetic programming (GP), Logistic Regression (LR), and the Kolmogorov-Arnold Network (KAN)—on the task of sodium-ion battery ...
ISBN:
(数字)9781837242863
In this study, we explore the classification and prediction capabilities of three models—Genetic programming (GP), Logistic Regression (LR), and the Kolmogorov-Arnold Network (KAN)—on the task of sodium-ion battery life prediction. By leveraging a dataset composed of multiple battery characteristics, we aim to determine the remaining power of sodium-ion batteries using these machine learning models. The KAN model, being a novel approach, demonstrates superior performance across various metrics, including accuracy, precision, recall, and F1 score, when compared to the other two models. This highlights the potential of KAN as a robust model for complex classification tasks in the field of battery life prediction.
Adversarial attacks have become one of the most serious security issues in widely used deep neural networks. Even though real-world datasets usually have large intra-variations or multiple modes, most adversarial defe...
详细信息
As part of the 2023 PhysioNet Challenge, our team FINDING_MEMO utilized Transformer to predict outcomes using patient EEG data since it excels at dealing with sequential data like EEG. We mainly used the Transformer e...
As part of the 2023 PhysioNet Challenge, our team FINDING_MEMO utilized Transformer to predict outcomes using patient EEG data since it excels at dealing with sequential data like EEG. We mainly used the Transformer encoder block's multi-head self-attention to generate representations from the input and leverage several hidden layers to form the final prediction. Using the latest EEG from every patient, our team achieved the challenge score of 0.42 with the hidden validation set (ranked 36th out of 73 invited teams) and obtained a result of 0.37 (ranked 29th out of 36 qualified teams). Our results show a consistent performance across varying EEG recording durations in both the validation and test set. Our team also had the second-best score when evaluated, with only 12 hours of available recordings in the test set. Such promising results showcase the models' generalizability and clinical potential in predicting outcomes for comatose patients, especially for limited available EEG recordings.
作者:
Juan ZuluagaMichael CastilloDivya SyalAndres CalleNavid ShaghaghiDepartment of Bioengineering (BIOE)
Computer Science & Engineering (CSEN) Ethical Pragmatic & Intelligent Computing (EPIC) Laboratory in collaboration with the Healthcare Innovation & Design (HID) Program Information Systems & Analytics (ISA) and Mathematics & Computer Science (MCS) Santa Clara University Santa Clara California USA
Humanity has battled tuberculosis for all of recorded history. Some studies estimate that Mycobacterium tuberculosis may have been around as long as 3 million years but it was only in 1834 when Johann Schonlein offici...
Humanity has battled tuberculosis for all of recorded history. Some studies estimate that Mycobacterium tuberculosis may have been around as long as 3 million years but it was only in 1834 when Johann Schonlein officially presented the characteristics of it. Even though the TB epidemic has touched all corners of the world, Africa and Asia are the regions that currently suffer the worst consequences. The purpose of this study is to construct a model within the eVision forecasting environment, capable of forecasting the trend of Tuberculosis cases in India, as India is the country that accounts for the largest percentage of TB cases and deaths worldwide. And being able to make predictions for India may also lead to successful results for other regions in Asia and Africa. In order to do so, this study presents different test cases that show the effectiveness of the model, varying the number of steps for each one of the data sets created. It's important to note, that these data sets are combinations of data gathered from the states with the most TB cases in India in the last years, as well as the total data for India, and supplemental data from Google Trends, as a way to facilitate the machine learning model. Even though the final results were respectable compared to past research done on India and other countries, the model nevertheless has a limitation on the number of weeks ahead which the predictions are still considered to be good; with 7 weeks being the optimal result.
Postdoctoral training positions are becoming more common in the human factors and ergonomics (HFE) discipline. However, conversations related to training in the HFE discipline have largely focused on undergraduate and...
详细信息
Postdoctoral training positions are becoming more common in the human factors and ergonomics (HFE) discipline. However, conversations related to training in the HFE discipline have largely focused on undergraduate and graduate education. This panel assembles both postdoctoral mentors and former trainees who collectively have a diverse set of HFE-related postdoctoral experiences. By panelists discussing their experiences, observations, and recommendations related to postdoctoral training with the audience, the panel session will support HFE faculty and students in making more informed decisions about if and how a postdoctoral experience (either as a mentor or trainee) could be a part of their career development in HFE.
This is the first paper in a series on hyper-realist rendering. In this paper, we introduce the concept of hyper-realist rendering and present a theoretical framework to obtain hyper-realist images. We are using the t...
详细信息
Dynamic programming is a fundamental algorithm that can be found in our daily lives easily. One of the dynamic programming algorithm implementations consists of solving the 0/1 knapsack problem. A 0/1 knapsack problem...
Dynamic programming is a fundamental algorithm that can be found in our daily lives easily. One of the dynamic programming algorithm implementations consists of solving the 0/1 knapsack problem. A 0/1 knapsack problem can be seen from industrial production cost. It is prevalent that a production cost has to be as efficient as possible, but the expectation is to get the proceeds of the products higher. Thus, the dynamic programming algorithm can be implemented to solve the diverse knapsack problem, one of which is the 0/1 knapsack problem, which would be the main focus of this paper. The implementation was implemented using C language. This paper was created as an early implementation algorithm using a Dynamic program algorithm applied to an Automatic Identification System (AIS) dataset.
In one-dimensional quantum emitter systems, the dynamics of atomic excitations are influenced by the collective coupling between emitters through photon-mediated dipole-dipole interactions. By introducing positional d...
详细信息
A nanophotonic waveguide coupled with an atomic array forms one of the strongly-coupled quantum interfaces to showcase many fascinating collective features of quantum dynamics. In particular for a dissimilar array of ...
详细信息
暂无评论