Ara
Toplam kayıt 37, listelenen: 31-37
A Sound Definitional Interpreter for a Simply Typed Functional Language
(MDPI, 2023)
In this paper, we develop, in the proof assistant Coq, a definitional interpreter and a type-checker for a simply typed functional language, and formally prove that the mentioned type-checker is sound with respect to the ...
A family-centered orthodontic screening approach using a machine learning-based mobile application
(Association for Dental Sciences of the Republic of China, 2023)
Background/purpose: Skeletal orthodontic deformities can have functional and aesthetic consequences, making early detection critical. This study aimed to address the issue of parents bringing their children for routine ...
A correlation coefficient-based feature selection approach for virus-host protein-protein interaction prediction
(Plos, 2023)
Prediction of virus-host protein-protein interactions (PPI) is a broad research area where various machine-learning-based classifiers are developed. Transforming biological data into machine-usable features is a preliminary ...
A selective approach to stemming for minimizing the risk of failure in information retrieval systems
(2023)
Stemming is supposed to improve the average performance of an information retrieval system, but in practice, past experimental results show that this is not always the case. In this article, we propose a selective approach ...
Is ChatGPT Leading Generative AI What is Beyond Expectations?
(Akademik Perspektif Derneği, 2023)
Generative AI has the potential to change the way we do things. The chatbot is one of the most popular implementation areas. Even though companies like Google and Meta had chatbots, ChatGPT became popular as it was made ...
DEVOUR: Deleterious Variants on Uncovered Regions in Whole-Exome Sequencing
(PMC, 2023)
The discovery of low-coverage (i.e. uncovered) regions containing clinically significant variants, especially when they are related to the patient's clinical phenotype, is critical for whole-exome sequencing (WES) based ...
Formal Verification of Bit-Vector Invertibility Conditions in Coq
(Springer Science and Business Media Deutschland GmbH, 2023)
We prove the correctness of invertibility conditions for the theory of fixed-width bit-vectors—used to solve quantified bit-vector formulas in the Satisfiability Modulo Theories (SMT) solver cvc5— in the Coq proof assistant. ...