Criminal Liability of Legal Person and Its Influence on the Business Sphere

Bakalářská práce se bude zabývat trestní odpovědností právnických osob a vlivem tohoto zákona na podnikatelské subjekty. Cílem bakalářské práce je pak analyzovat vliv trestní odpovědnosti právnických osob na podnikatelskou sféru, a také zhodnotit novou právní úpravu, kterou s sebou přináší novela č. 183/2016 Sb. První část práce, tedy teoretická část, bude věnována především vymezení základních pojmů, jako je právnická osoba a trestní odpovědnost. Dále zde bude podrobně popsán obsah zákona o trestní odpovědnosti právnických osob, včetně zásadní novely, kterou přinesl zákon č. 183/2016 Sb. Praktická část bakalářské práce pak bude zaměřena především na hodnocení jednotlivých zásadních změn zákona o trestní odpovědnosti spolu se srovnáním daného zákona s právní úpravou trestní odpovědnosti ve Slovenské republice. V této části bude také zhodnocen vliv zákona na podnikatelské subjekty a také zde bude detailně rozebrán konkrétní soudní spor.The bachelor thesis will deal with the criminal liability of legal person and the influence of this Act on legal entity. The aim of the bachelor thesis is to analyze the influence of the criminal liability of legal person on the business sphere as well as to evaluate new legal regulation brought by the amendment No. 183/2016 Coll. The first part of the thesis, the theoretical part, will be devoted mainly to a definition of the basic terms such as the legal person and criminal liability. Further, the content of the Act on Criminal Liability of Legal Person will be described in detail including the fundamental amendment. The practical part of the bachelor thesis will be focused mainly on the evaluation of individual fundamental amendments to the Criminal Liability Act together with the comparison of legal regulation of criminal liability in the Slovak Republic. In this part, the influence of the Act on business sphere will be evaluated as well as a particular criminal litigation will be analyzed in detail.152 - Katedra podnikohospodářskávelmi dobř

The law of vertical territorial and price restraints in the EU and in the USA: a critical analysis of vertical territorial and price restraints - an argument against legalisation

This PhD thesis critically surveys vertical territorial and price restraints in the EU and the USA not just from a legal angle, but also from comparative, economic, theoretical and historical perspectives. Different aspects of such comprehensive research assist with tackling the different issues that have occurred in the law of vertical territorial and price restraints while determining its correct approach. This thesis argues against some existing competition policies and principles, such as the objective of the law of vertical territorial and price restraints. It shows that law of vertical territorial and price restraints should protect effective and free competition. Nevertheless, it follows that the object of effective competition is efficiency which is difficult to determine in situations when RPM or VTR is used. Furthermore, the complexity of vertical competition and vertical chains, including relationships, power and market structures, is surveyed. This thesis advocates the existence of vertical competition and further explains that it is bargaining power which should be assessed in RPM and VTR cases and not horizontal market power, which serves the purpose of horizontal rather than vertical competition. The development of the laws of vertical territorial and price restraints including the analysis of relevant and significant cases both in the EU and the USA within a broader historical framework and relevant theories unveil some inconsistencies and uncertainties. This thesis criticises the formalistic approach within traditional anti-competitive theories and the demagogical approach within the majority of pro-competitive theories offering new suggestions and points of view. Although vertical restraints have been part of US antitrust law and EU competition law almost since the beginning of their existence, this thesis reveals that their approaches have been unsettled and continue to develop with contradictory arguments on this issue across the legal, economical, empirical and theoretical scholarly works, which show lack of understanding of vertical competition. Unfortunately, vertical competition has not been acknowledged as the basic framework for vertical restraints in both the EU and US policies and their legislations. Therefore, this thesis concludes with legislative suggestions which better reflect the nature of vertical restraints

Effectiveness of Marketing Activities in Preparatory Phase of Construction Life Cycle

Disertační práce s názvem Efektivnost marketingových činností v přípravné fázi životního cyklu stavby se zabývá možností zefektivnění marketingových činností v rámci přípravy stavby. Hlavním cílem práce je na základě analýzy současného stavu využití marketingových činností z pohledu dodavatele stavby a uživatele stavby, navrhnout metodiku tvorby ukazatele vhodného pro posouzení efektivnosti marketingových činností v přípravné fázi životního cyklu stavby. Efektivnost je posuzována z pohledu vybraných subjektů působících na českém stavebním trhu – dodavatele stavby a uživatele stavby.This doctoral thesis titled Effectiveness of marketing activities in preparatory phase of construction life cycle deals with the possibility of more effective marketing activities in preparation for construction. The main goal of the thesis is to analyze the current state of the use of marketing activities from the view of a building contractor and building users, to propose a methodology of indicators suitable for assessing the effectiveness of marketing activities in preparatory phase of construction life cycle. Effectiveness is assessed from the perspective of selected entities operating in the Czech construction market - building contractor and building user.

Social Network with Elements of Semantic Web

Tato práce se zabývá internetovými sociálními sítěmi a trendy v aktuálním vývoji sémantického webu. Popisuje vývoj webové aplikace - komunitního portálu, vystavěného na PHP. Aplikace obsahuje moduly pro prezentaci organizací a událostí strojově čitelným způsobem, s napojením na mapovací systém Google Maps.This thesis concerns Internet social network and trends in evolution of Semantic Web. It describes development of a web application - community portal, built on PHP. Application contains modules providing machine readable presentation of organizations profiles and events and is connected to Google Maps web mapping service.

Characterization of sweet thaumatin proteins by liquid chromatography and mass spectrometry

V této diplomové práci jsem se zabývala vývojem separační metody LC-MS pro stanovení thaumatinů. Dále jsem se zabývala izolací a stanovením thaumatinu v modelovém potravinovém vzorku.In this diploma thesis I dealt with developing of separation technique LC-MS for determination of thaumatin. I dealt with isolation and determination of thaumatin in model food sample.

List homomorphism problems for signed graphs

We consider homomorphisms of signed graphs from a computational perspective. In particular, we study the list homomorphism problem seeking a homomorphism of an input signed graph $(G,\sigma)$, equipped with lists $L(v) \subseteq V(H), v \in V(G)$, of allowed images, to a fixed target signed graph $(H,\pi)$. The complexity of the similar homomorphism problem without lists (corresponding to all lists being $L(v)=V(H)$) has been previously classified by Brewster and Siggers, but the list version remains open and appears difficult. We illustrate this difficulty by classifying the complexity of the problem when $H$ is a tree (with possible loops). The tools we develop will be useful for classifications of other classes of signed graphs, and we illustrate this by classifying the complexity of irreflexive signed graphs in which the unicoloured edges form some simple structures, namely paths or cycles. The structure of the signed graphs in the polynomial cases is interesting, suggesting they may constitute a nice class of signed graphs analogous to the so-called bi-arc graphs (which characterize the polynomial cases of list homomorphisms to unsigned graphs).Comment: various changes + rewritten section on path- and cycle-separable graphs based on a new conference submission (split possible in future

Ballads and Legends: Media Transformations of Canonical Narratives in Polish and Czech Culture

The paper presents a comparative interpretation of recent Czech and Polish transmediations of canonical literary texts and architexts: ballads by K. J. Erben and Polish legends and folk tales, which are generally regarded as representations of both timeless and historical national values. The theoretical framework is built upon the theory of intermediality introduced by W. Wolf and I. O. Rajewsky, the concept of media modalities developed by L. Elleström, and current multimodal research represented by J. Bruhn and others. The transmediations (a film, a crowdfunded comic book, a series of short films employed as online advertisements) are not only subject to analysis of media-specific strategies involved in the artistic transformations; the authors´ motivations, the economic conditions under which the examined media products were made, and the modes of their distribution and participation in cultural communication are taken into account as well. The results of the analysis illuminate the strong influence of the multimedia environment, of the generic frames of individual media and the strategies that authors of the transmediations use to attain success with audience

Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number

A Hamiltonian path (a Hamiltonian cycle) in a graph is a path (a cycle, respectively) that traverses all of its vertices. The problems of deciding their existence in an input graph are well-known to be NP-complete, in fact, they belong to the first problems shown to be computationally hard when the theory of NP-completeness was being developed. A lot of research has been devoted to the complexity of Hamiltonian path and Hamiltonian cycle problems for special graph classes, yet only a handful of positive results are known. The complexities of both of these problems have been open even for $4K_1$-free graphs, i.e., graphs of independence number at most $3$. We answer this question in the general setting of graphs of bounded independence number. We also consider a newly introduced problem called \emph{Hamiltonian-$\ell$-Linkage} which is related to the notions of a path cover and of a linkage in a graph. This problem asks if given $\ell$ pairs of vertices in an input graph can be connected by disjoint paths that altogether traverse all vertices of the graph. For $\ell=1$, Hamiltonian-1-Linkage asks for existence of a Hamiltonian path connecting a given pair of vertices. Our main result reads that for every pair of integers $k$ and $\ell$, the Hamiltonian-$\ell$-Linkage problem is polynomial time solvable for graphs of independence number not exceeding $k$. We further complement this general polynomial time algorithm by a structural description of obstacles to Hamiltonicity in graphs of independence number at most $k$ for small values of $k$