On the problem of probabilistic optimization of time-limited testing.
Saved in:
| Title: | On the problem of probabilistic optimization of time-limited testing. |
|---|---|
| Authors: | Naumov, A.1 naumovav@mail.ru, Mkhitaryan, G.1 grgmkn@mail.ru |
| Source: | Automation & Remote Control. Sep2016, Vol. 77 Issue 9, p1612-1621. 10p. |
| Subjects: | Probabilistic inference, Algorithms, Stochastic programming, Linear programming, Automatic control systems |
| Abstract: | For the distance learning systems, consideration was given to generation of individual tasks with limited performance time, and an algorithm was suggested to solve it. Such problem comes to that of integer stochastic programming with probabilistic constraints. Considered were the distributions of the random student's time of response to the task such as the Van der Linden lognormal model and the discrete model based on empirical data. It was assumed that task complexities are estimated either by an expert or by using corresponding algorithms. For the case of continuous distribution, an algorithm was proposed based on the branch-and-bound principle. Results of the numerical experiments were presented. [ABSTRACT FROM AUTHOR] |
| Copyright of Automation & Remote Control is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 117956400 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: On the problem of probabilistic optimization of time-limited testing. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Naumov%2C+A%2E%22">Naumov, A.</searchLink><relatesTo>1</relatesTo><i> naumovav@mail.ru</i><br /><searchLink fieldCode="AR" term="%22Mkhitaryan%2C+G%2E%22">Mkhitaryan, G.</searchLink><relatesTo>1</relatesTo><i> grgmkn@mail.ru</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Automation+%26+Remote+Control%22">Automation & Remote Control</searchLink>. Sep2016, Vol. 77 Issue 9, p1612-1621. 10p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Probabilistic+inference%22">Probabilistic inference</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Stochastic+programming%22">Stochastic programming</searchLink><br /><searchLink fieldCode="DE" term="%22Linear+programming%22">Linear programming</searchLink><br /><searchLink fieldCode="DE" term="%22Automatic+control+systems%22">Automatic control systems</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: For the distance learning systems, consideration was given to generation of individual tasks with limited performance time, and an algorithm was suggested to solve it. Such problem comes to that of integer stochastic programming with probabilistic constraints. Considered were the distributions of the random student's time of response to the task such as the Van der Linden lognormal model and the discrete model based on empirical data. It was assumed that task complexities are estimated either by an expert or by using corresponding algorithms. For the case of continuous distribution, an algorithm was proposed based on the branch-and-bound principle. Results of the numerical experiments were presented. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Automation & Remote Control is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=117956400 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1134/S0005117916090083 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 10 StartPage: 1612 Subjects: – SubjectFull: Probabilistic inference Type: general – SubjectFull: Algorithms Type: general – SubjectFull: Stochastic programming Type: general – SubjectFull: Linear programming Type: general – SubjectFull: Automatic control systems Type: general Titles: – TitleFull: On the problem of probabilistic optimization of time-limited testing. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Naumov, A. – PersonEntity: Name: NameFull: Mkhitaryan, G. IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 09 Text: Sep2016 Type: published Y: 2016 Identifiers: – Type: issn-print Value: 00051179 Numbering: – Type: volume Value: 77 – Type: issue Value: 9 Titles: – TitleFull: Automation & Remote Control Type: main |
| ResultId | 1 |
