The thesis is a comparison between the business environment in Czech Republic and in France in term of SME's definition, legal forms of enterprise and different steps for a creation of enterprise in both countries. The thesis compares as well the tax and the social insurance in France to the Czech Republic system. The information founded is used by a Czech company to setup a branch office in France. The objective of the thesis is to evaluate the feasibility of this strategic concept of branch creation.

The aim of this thesis is to present a draft model for better planning internal audit engagements of branch network of the bank. The first part deals with the internal audit. It presents and discusses the definition of internal auditing by the Institute of Internal Auditors (IIA). Other relevant disciplines are also included - external audit and assurance. The importance of these disciplines is demonstrated in the example of Enron. The thesis presents the International Professional Practices Framework, especially its key components - standards. The end of this section is devoted to a description of the individual parts of an internal audit project. The second part is dedicated to planning internal audit engagements. Planning is based on the risks, therefore, there is a description of banking risks. The conclusion of this section is devoted to the process of creating the Annual Audit Plan. The final part of this work presents a model created by the author which will help to improve the planning of internal audits of the branch network of banks.

Business of foreign persons through a registered branch Abstract The thesis presents a description and analysis of legal aspects related to the issue of business of foreign persons through a registered branch and identifies related problems, either those purely at the level of legal theory or those that occur in practice. The knowledge gained through the description and analysis is then used to make a comparison between the business of a foreign person through a registered branch and the business of a foreign person through an ownership interest in a limited liability company. In the first part of the thesis, the definition of basic terms is first performed, especially of the term foreign person. Furthermore, this part of the thesis describes a valid legal regulation of conditions of business of foreign persons in the Czech Republic according to public law regulations, with a focus on foreign legal persons. In the last chapter of the first part of the thesis selected ways of doing business of foreign persons in the Czech Republic are presented, especially with the aim of introducing these ways of doing business as alternatives to doing business through a registered branch. The second part of the thesis deals with the institute of the registered branch and does so with the aim of defining its essential...

京都大学 / 0048 / 新制・課程博士 / 博士(医学) / 甲第22119号 / 医博第4532号 / 新制||医||1039(附属図書館) / 京都大学大学院医学研究科医学専攻 / (主査)教授 大森 孝一, 教授 Shohab YOUSSEFIAN, 教授 山下 潤 / 学位規則第4条第1項該当 / Doctor of Medical Science / Kyoto University / DFAM

京都大学 / 新制・課程博士 / 博士(情報学) / 甲第23322号 / 情博第758号 / 新制||情||129(附属図書館) / 京都大学大学院情報学研究科数理工学専攻 / (主査)教授 永持 仁, 教授 太田 快人, 教授 山下 信雄 / 学位規則第4条第1項該当 / Doctor of Informatics / Kyoto University / DFAM

京都大学 / 新制・課程博士 / 博士(情報学) / 甲第23546号 / 情博第776号 / 新制||情||132(附属図書館) / 京都大学大学院情報学研究科数理工学専攻 / (主査)教授 山下 信雄, 教授 太田 快人, 教授 永持 仁 / 学位規則第4条第1項該当 / Doctor of Informatics / Kyoto University / DFAM

The diploma thesis deals with possible option of establishing the branch office of the technology company in Slovakia. The first part is focused on theory related to setting up the business plan. The second part contains analysis describing current status of the company of interest based on the information provided. The proposal of the branch office setting up is included in the last part of the diploma thesis where ways the company could follow when entering new market are described.

This work deals with the way of balancing production-assembly line, which would minimalize set up costs. The production-assembly line shall allow assembling more mutually similar variants of the same product. The time of duration of each operation is constant, but can differs between individual variants of the product. Cycle time is related to the variant of the product.

Étant donné G = (V, E) un graphe non orienté connexe et un entier positif β (n), où n est le nombrede sommets de G, le problème du séparateur (VSP) consiste à trouver une partition de V en troisclasses A, B et C de sorte qu'il n'y a pas d'arêtes entre A et B, max {| A |, | B |} est inférieur ou égal àβ (n) et | C | est minimum. Dans cette thèse, nous considérons une modélisation du problème sous laforme d'un programme linéaire en nombres entiers. Nous décrivons certaines inégalités valides et etdéveloppons des algorithmes basés sur un schéma de voisinage.Nous étudions également le problème du st-séparateur connexe. Soient s et t deux sommets de Vnon adjacents. Un st-séparateur connexe dans le graphe G est un sous-ensemble S de V \ {s, t} quiinduit un sous-graphe connexe et dont la suppression déconnecte s de t. Il s'agit de déterminer un stséparateur de cardinalité minimum. Nous proposons trois formulations pour ce problème et donnonsdes inégalités valides du polyèdre associé à ce problème. Nous présentons aussi une heuristiqueefficace pour résoudre ce problème. / Given G=(V,E) a connected undirected graph and a positive integer β(n), where n is number ofvertices, the vertex separator problem (VSP) is to find a partition of V into three classes A,B and Csuch that there is no edge between A and B, max{|A|,|B|}less than or equal β(n), and |C| isminimum. In this thesis, we consider aninteger programming formulation for this problem. Wedescribe some valid inequalties and using these results to develop algorithms based onneighborhood scheme.We also study st-connected vertex separator problem. Let s and tbe two disjoint vertices of V, notadjacent. A st-connected separator in the graph G is a subset S of V\{s,t} such that there are no morepaths between sand tin G[G\S] and the graph G[S] is connected . The st-connected vertex speratorproblem consists in finding such subset with minimum cardinality. We propose three formulationsfor this problem and give some valid inequalities for the polyhedron associated with this problem.We develop also an efficient heuristic to solve this problem.

In this dissertation, we show two significant applications of combinatorial branch-and-bound as an exact solution methodology in combinatorial optimization problems. In the first problem, we propose a set of new group centrality metrics and show their performance in estimating protein importance in protein-protein interaction networks. The centrality metrics introduced here are extensions of well-known nodal metrics (degree, betweenness, and closeness) for a set of nodes which is required to induce a specific pattern. The structures investigated range from the ``stricter'' induced stars and cliques, to a ``looser'' definition of a representative structure. We derive the computational complexity for each of the newly proposed metrics. Then, we provide mixed integer programming formulations to solve the problems exactly; due to the computational complexity of the problem and the sheer size of protein-protein interaction networks, using a commercial solver with the formulations is not always a viable option. Hence, we also propose a combinatorial branch-and-bound approach to solve the problems introduced. Finally, we conclude this work with a presentation of the performance of the proposed centrality metrics in identifying essential proteins in helicobacter pylori. In the second problem, we introduce the asymmetric probabilistic minimum-cost Hamiltonian cycle problem (APMCHCP) where arcs and vertices in the graph are possible to fail. APMCHCP has applications in many emerging areas, such as post-disaster recovery, electronic circuit design, and security maintenance of wireless sensor networks. For each vertex, we define a chance-constraint to guarantee that the probability of arriving at the vertex must be greater than or equal to a given threshold. Four mixed-integer programming (MIP) formulations are proposed for modeling the problem, including two direct formulations and two recursive formulations. A combinatorial branch-and-bound (CBB) algorithm is proposed for solving the APMCHCP, where data preprocessing steps, feasibility rules, and approaches of finding upper and lower bounds are developed. In the numerical experiments, the CBB algorithm is compared with formulations on a test-bed of two popular benchmark instance sets. The results show that the proposed CBB algorithm significantly outperforms Gurobi solver in terms of both the size of optimally solved instances and the computing time.