|
|
Floristic and phytogeographical study of the southernmost part of the Plánický hřeben phytogeographical district
BENEDIKTOVÁ, Jitka
A pilot survey of contemporary state of flora of vascular plants in the southernmost part of the Plánický hřeben uplands (western Bohemia, district Klatovy) was carried out during the vegetation season 2007. In total, 476 taxa of vascular plants were recorded in the year 2007, 18 of these taxa are mentioned in the Red List of the vascular plants of the Czech Republic {--} 13 as {\clqq}endangered`` (cathegory C3) and 5 as {\clqq}rare or scattered, requiring further study and monitoring`` (cathegory C4). On the other hand, presence of 6 species of invasive neophytes was revealed. All records of taxa and detailed descriptions of their localities are stored in the Microsoft Access database. The data with potential importance for conservation of nature and biodiversity (localities of rare and endangered plant species or vegetation types, occurences of invasive neophytes) were also converted to the set of layers in geographical information system (GIS).
|
|
|
Multiprocessor Randomized On-line Scheduling
Tichý, Tomáš
This paper studies randomized on-line non-preemptive scheduling in multiprocessor systems. In this problem each task is specified by its processing time andscheduled on any of $m$ identical processors. The objective is to minimize theexpected mekespan. We prove lemmas and theorems describing $sigma_m$-competitive randomized algorithms on $m$ processors. The main result is an........
|
|
|
Online competitive algorithms for maximizing weighzed throughput of unit jobs. ITI Series 2003-172
Bartal, Y. ; Chin, F. Y. L. ; Chrobak, M. ; Fung, S. P. Y. ; Jawor, W. ; Lavi, R. ; Sgall, Jiří ; Tichý, Tomáš
We study an online buffer management problem for networks supporting Quality-of-Service (QoS) applications, equivalently as an online scheduling problem forunit-length jobs, where each job is specified by its release time, deadline, and a nonnegative weight (QoS value). The goal is to maximize the emph{weighted throughput}, that is the total weight of scheduled jobs.
|
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
Dolní odhad pro omezené pravděpodobnostní online algoritmy pro rozvrhování
Tichý, Tomáš
This paper studies a restricted class of randomized on-line non-preemptive algorithms for scheduling in multiprocessor systems. In this class each task is specified by its processing time and scheduled to a processor with the smallest or $h$th biggest load for a fixed $h$. The competitive ratio is the maximum of the ratios of the expected makespan and the optimal makespan over all.
|
|
|
Odpisování dlouhodobých aktiv a jeho vztah k daním z příjmů
Honzíková, Klára ; Strouhal, Jiří (advisor)
Tato práce je zaměřená na problematiku odpisování dlouhodobých aktiv a ovlivnění daní z příjmů. V jednotlivých kapitolách čtenář najde vymezení dlouhodobých aktiv ? hmotná, nehmotná, oceňování dlouhodobého majetku, daňové odpisy, účetní odpisy, ukázky výpočtu odpisů jednotlivými metodami jak pro účely účetní, tak i pro účely daňové. V závěru je vyjádřeno několik myšlenek, jak prostřednictvím odpisů snížit daňové zatížení podnikatelského subjektu.
|
guest ::
