• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 16
  • 7
  • 7
  • 3
  • 2
  • 2
  • 2
  • 2
  • 1
  • Tagged with
  • 46
  • 46
  • 25
  • 12
  • 7
  • 7
  • 6
  • 5
  • 5
  • 5
  • 5
  • 4
  • 4
  • 4
  • 4
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
41

Automatic State Construction using Decision Trees for Reinforcement Learning Agents

Au, Manix January 2005 (has links)
Reinforcement Learning (RL) is a learning framework in which an agent learns a policy from continual interaction with the environment. A policy is a mapping from states to actions. The agent receives rewards as feedback on the actions performed. The objective of RL is to design autonomous agents to search for the policy that maximizes the expectation of the cumulative reward. When the environment is partially observable, the agent cannot determine the states with certainty. These states are called hidden in the literature. An agent that relies exclusively on the current observations will not always find the optimal policy. For example, a mobile robot needs to remember the number of doors went by in order to reach a specific door, down a corridor of identical doors. To overcome the problem of partial observability, an agent uses both current and past (memory) observations to construct an internal state representation, which is treated as an abstraction of the environment. This research focuses on how features of past events are extracted with variable granularity regarding the internal state construction. The project introduces a new method that applies Information Theory and decision tree technique to derive a tree structure, which represents the state and the policy. The relevance, of a candidate feature, is assessed by the Information Gain Ratio ranking with respect to the cumulative expected reward. Experiments carried out on three different RL tasks have shown that our variant of the U-Tree (McCallum, 1995) produces a more robust state representation and faster learning. This better performance can be explained by the fact that the Information Gain Ratio exhibits a lower variance in return prediction than the Kolmogorov-Smirnov statistical test used in the original U-Tree algorithm.
42

Statistické metody pro popis provozu restaurace / Statistical Methods for Description of Running a Restaurant

Novotná, Lenka January 2010 (has links)
The diploma thesis is written with a view to illustrate application of statistical methods describing progress of economical processes in company. The thesis is divided into two separated parts. First part focuses on theoretical pieces of knowledge about control charts and time series. Second part is composed from chapters that are focused on its practical usage. As simple application for control chart making is enclosed.
43

Využití regulačních diagramů pro kontrolu jakosti / Use of Contol Charts in Quality Control

Ječmínková, Michaela January 2014 (has links)
This diploma thesis deals with use of Shewhart Control Charts in quality control. The thesis describes the currently used process of quality control in the enterprise. Afterwards practical guidance for implementation of the statistical process control of the selected component and evaluation of capability is provided. An application for creating control charts and monitoring the quality of the product is included.
44

兩母體生存函數比較之研究 / To study about the comparing two population's survival functions

傅鼎傑, Ting,Chieh Fu Unknown Date (has links)
對於生存時間的資料而言,通常我們所想要研究瞭解的是,至少存活到某特定時間點的機率,而這個機率亦即生存分析中的生存函數(survival function)。當有兩個不同的母體存在時,為了要知道這兩個母體的生存函數是否相同,在統計方法上,我們將進行一些檢定,常用的有Gehan-Wilcoxon和Cox-Mantel之兩樣本檢定,後來又有修飾型的Kolmogorov-Smirnov檢定。但是,前兩種檢定方法,只對此兩組生存函數呈現某特殊型式時,具有好的檢定力。因此,透過一些實證的研究,將上述檢定方法做有系統的整理,進而發展出一套簡單又有效率的檢定程序。再者,若檢定得此兩個母體之生存函數不相等時,如何利用Bootstrap方法,進一步對兩組生存函數之特定生存機率點或生存時間點所分別對應之生存時間或生存機率差距做推論與比較,本文將有詳細她說明;以提供研究人員更多有效的資訊,不再僅止於檢定虛無假設是否拒絕而已。最後,我們又藉由推廣上述Bootstrap方法,將其運用到檢定方法上,而另外發展出一種新的兩母體生存函數之檢定方法。 / When two different populations exist, we will take some tests by Cehan-Wilcoxon, Cox-Mantel or Modified Kolmogorov- Smirnov in satistical way. Therefore we develope a simple and efficient test process from arranging above test ways system- atically through some real study. How to use Bootstrap way to infer the difference of survival time or survival probability of specular point. We infer Bootstrap way on test work and then develope a new two populations survival function test way.
45

Sledování spektra a optimalizace systémů s více nosnými pro kognitivní rádio / Spectrum sensing and multicarrier systems optimization for cognitive radio

Povalač, Karel January 2012 (has links)
The doctoral thesis deals with spectrum sensing and subsequent use of the frequency spectrum by multicarrier communication system, which parameters are set on the basis of the optimization technique. Adaptation settings can be made with respect to several requirements as well as state and occupancy of individual communication channels. The system, which is characterized above is often referred as cognitive radio. Equipments operating on cognitive radio principles will be widely used in the near future, because of frequency spectrum limitation. One of the main contributions of the work is the novel usage of the Kolmogorov – Smirnov statistical test as an alternative detection of primary user signal presence. The new fitness function for Particle Swarm Optimization (PSO) has been introduced and the Error Vector Magnitude (EVM) parameter has been used in the adaptive greedy algorithm and PSO optimization. The dissertation thesis also incorporates information about the reliability of the frequency spectrum sensing in the modified greedy algorithm. The proposed methods are verified by the simulations and the frequency domain energy detection is implemented on the development board with FPGA.
46

Modélisation et simulation d'une chambre réverbérante à brassage de modes à l'aide de la méthode des différences finies dans le domaine temporel

Petit, Frédéric 10 December 2002 (has links) (PDF)
Le développement des moyens de communications par l'intermédiaire des ondes<br /> électromagnétiques connaît une croissance sans précédent depuis quelques années, grâce<br /> notamment au développement de la téléphonie mobile. La chambre réverbérante est un<br /> moyen d'essais qui permet d'étudier l'influence de ces ondes électromagnétiques sur un<br /> appareil électronique particulier. Cependant, le fonctionnement d'une chambre<br /> réverbérante étant complexe, il est primordial de procéder à des simulations afin de<br /> déterminer quels sont les paramètres cruciaux entrant en jeu.<br /> <br /> Le travail de cette thèse consiste à modéliser et à simuler le fonctionnement d'une<br /> chambre réverbérante à l'aide de la méthode des différences finies dans le domaine<br /> temporel. Après une brève étude portant sur quelques résultats de mesures de champ et<br /> de puissances effectuées dans une chambre réverbérante, le chapitre~2 aborde les<br /> différents problèmes liés à la modélisation de la chambre. La notion de pertes étant<br /> déterminante pour évaluer le fonctionnement d'une chambre réverbérante, deux méthodes<br /> implémentant ces pertes sont aussi exposées dans ce chapitre. L'étude menée dans le<br /> chapitre~3 consiste à analyser l'influence du brasseur sur les premiers modes propres<br /> de la chambre, ceux-ci pouvant être décalés de plusieurs MHz. Le chapitre~4 présente<br /> des résultats de simulations en hautes fréquences comparés à des résultats<br /> statistiques théoriques. Le cas de la présence d'un objet au sein de la chambre<br /> pouvant perturber le champ est aussi abordé. Enfin, le chapitre~5 montre une<br /> comparaison des résultats statistiques dans le cas où l'on considère plusieurs formes<br /> de brasseurs.

Page generated in 0.0271 seconds