An aim of the research is to improve validity of the Moshkov test in relation to the body dimensions of young patients. This short report presents a new research that adds to previous studies about validity of the Moshkov test regarding a spine asymmetry in young patients. Because children body's dimensions are smaller than adults' ones, results indices of the Moshkov test are less as well. These results have been corrected proportionally to a half sum of rhombus sides' lengths. Mechanical and mathematical modeling using Wolfram Mathematica computer package has been done during Moshkov rhombus modification. The modified rhombus model made it possible to improve validity of the test regarding smaller dimension of young patients' bodies. The results are presented in a graph nomogram that is comprehensive for practical specialists which are not familiar with using of mathematical methods.
Download full-text PDF |
Source |
|---|---|
| http://www.ncbi.nlm.nih.gov/pmc/articles/PMC11342318 | PMC |
| http://dx.doi.org/10.1177/11795972241272381 | DOI Listing |
Publication Analysis
Top Keywords
Similar Publications
Validity of the Moshkov Test Regarding a Spine Asymmetry in Young Patients.
Biomed Eng Comput Biol
August 2024
Department of Informatics and Kinesiology, Lviv State University of Physical Culture Named After Ivan Boberskyj, Ukraine.
An aim of the research is to improve validity of the Moshkov test in relation to the body dimensions of young patients. This short report presents a new research that adds to previous studies about validity of the Moshkov test regarding a spine asymmetry in young patients. Because children body's dimensions are smaller than adults' ones, results indices of the Moshkov test are less as well.
View Article and Find Full Text PDFSelected Data Mining Tools for Data Analysis in Distributed Environment.
Entropy (Basel)
October 2022
Doctoral School, University of Silesia in Katowice, Bankowa 14, 40-007 Katowice, Poland.
In this paper, we deal with distributed data represented either as a finite set T of decision tables with equal sets of attributes or a finite set I of information systems with equal sets of attributes. In the former case, we discuss a way to the study decision trees common to all tables from the set T: building a decision table in which the set of decision trees coincides with the set of decision trees common to all tables from T. We show when we can build such a decision table and how to build it in a polynomial time.
View Article and Find Full Text PDFOn the Depth of Decision Trees with Hypotheses.
Entropy (Basel)
January 2022
Computer, Electrical and Mathematical Sciences & Engineering Division, King Abdullah University of Science and Technology (KAUST), Thuwal 23955-6900, Saudi Arabia.
In this paper, based on the results of rough set theory, test theory, and exact learning, we investigate decision trees over infinite sets of binary attributes represented as infinite binary information systems. We define the notion of a problem over an information system and study three functions of the Shannon type, which characterize the dependence in the worst case of the minimum depth of a decision tree solving a problem on the number of attributes in the problem description. The considered three functions correspond to (i) decision trees using attributes, (ii) decision trees using hypotheses (an analog of equivalence queries from exact learning), and (iii) decision trees using both attributes and hypotheses.
View Article and Find Full Text PDFRecent advancements in deep learning have revolutionized the way microscopy images of cells are processed. Deep learning network architectures have a large number of parameters, thus, in order to reach high accuracy, they require a massive amount of annotated data. A common way of improving accuracy builds on the artificial increase of the training set by using different augmentation techniques.
View Article and Find Full Text PDFWant AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!