2025-02-23T13:27:02-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-84947%22&qt=morelikethis&rows=5
2025-02-23T13:27:02-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-84947%22&qt=morelikethis&rows=5
2025-02-23T13:27:02-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-23T13:27:02-05:00 DEBUG: Deserialized SOLR response
О непараметрическом критерии Неймана – Пирсона для проверки сложной гипотезы об одном среднем
The Neyman−Pearson’s problem of developing composit one sample mean test is considered. It is shown that this problem is reduced to the linear programming. The resulting test is general enough, since it does not require knowledge of underlying distribution, nor independence of observations.
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
Інститут кібернетики ім. В.М. Глушкова НАН України
2006
|
| Series: | Теорія оптимальних рішень |
| Online Access: | http://dspace.nbuv.gov.ua/handle/123456789/84947 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The Neyman−Pearson’s problem of developing composit one sample mean test is considered. It is shown that this problem is reduced to the linear programming. The resulting test is general enough, since it does not require knowledge of underlying distribution, nor independence of observations. |
|---|