|
|
Psychoacoustical Measurement of Binaural Hearing Characteristics
Novotný, Ota ; Trzos, Michal (referee) ; Schimmel, Jiří (advisor)
This diploma thesis deals with a binaural hearing issues (it means hearing by both of ears), a human hearing ability to locate position of a sound source at three-dimensional space and parameters that affect this ability. In the second part, it focuses on psychoacoustic experiment, its main features and errors that can occur and which affect a results credibility. Method of pair comparisons is described more closely here. The last part of this thesis describes a technical solution of experiment in Java environment. The application should have a graphical interface and should be able to register a new user and perform a psychoacoustical experiment. The process of experiment is following. The aplication selects a random position of defined virtual sound source on the defined range and it plays this sound into headphones on button click. The users task is to set the application controls, representing a virtual sound source position, that way, where the user hear the sound come from. On another button click the application plays the same sound, but this sound comes from application controls set position (set by user). User compares this pair of sounds and modifies the position of second sound source until these two positions are same. The application stores these results for later processing on another button click. Principles of generating testing sound sources (sine wave, narrowband noise and sound file with wav extension) and their 3D positioning by measured head model impulse responses correlation are described thereinafter. An ability of human hearing system to locate a virtual sound source in dependence on sound parameters is discussed in conclusion.
|
|
|
Application of graph theory to the design and optimization data network architectures
Římský, Adam ; Trzos, Michal (referee) ; Novotný, Vít (advisor)
This masters'sthesis deals with graph theory and utilization of this theory for design and optimization of data network structures. Introduction chapter describes graph theory in general view, i.e. fundamental terms used for graph description, graph distinguishing, etc. Next part describes graph algorithms, for example a shortest path finding. After this I write about actual routing protocols where the graph algorithms are used. Last but one part deals with queuing theory and final part describes practical presentation of using graph theory for design and optimization of data network structure in Matlab programme environment.
|
|
| |
guest ::
