No description available.

This thesis focuses mainly on the Maximum Independent Set (MIS) problem. Some related graph theoretical combinatorial problems are also considered. As these problems are generally NP-hard, we study their complexity in hereditary graph classes, i.e. graph classes defined by a set F of forbidden induced subgraphs. We revise the literature about the issue, for example complexity results, applications, and techniques tackling the problem. Through considering some general approach, we exhibit several cases where the problem admits a polynomial-time solution. More specifically, we present polynomial-time algorithms for the MIS problem in: + some subclasses of $S_{2;j;k}$-free graphs (thus generalizing the classical result for $S_{1;2;k}$-free graphs); + some subclasses of $tree_{k}$-free graphs (thus generalizing the classical results for subclasses of P5-free graphs); + some subclasses of $P_{7}$-free graphs and $S_{2;2;2}$-free graphs; and various subclasses of graphs of bounded maximum degree, for example subcubic graphs. Our algorithms are based on various approaches. In particular, we characterize augmenting graphs in a subclass of $S_{2;k;k}$-free graphs and a subclass of $S_{2;2;5}$-free graphs. These characterizations are partly based on extensions of the concept of redundant set [125]. We also propose methods finding augmenting chains, an extension of the method in [99], and finding augmenting trees, an extension of the methods in [125]. We apply the augmenting vertex technique, originally used for $P_{5}$-free graphs or banner-free graphs, for some more general graph classes. We consider a general graph theoretical combinatorial problem, the so-called Maximum -Set problem. Two special cases of this problem, the so-called Maximum F-(Strongly) Independent Subgraph and Maximum F-Induced Subgraph, where F is a connected graph set, are considered. The complexity of the Maximum F-(Strongly) Independent Subgraph problem is revised and the NP-hardness of the Maximum F-Induced Subgraph problem is proved. We also extend the augmenting approach to apply it for the general Maximum Π -Set problem. We revise on classical graph transformations and give two unified views based on pseudo-boolean functions and αff-redundant vertex. We also make extensive uses of α-redundant vertices, originally mainly used for $P_{5}$-free graphs, to give polynomial solutions for some subclasses of $S_{2;2;2}$-free graphs and $tree_{k}$-free graphs. We consider some classical sequential greedy heuristic methods. We also combine classical algorithms with αff-redundant vertices to have new strategies of choosing the next vertex in greedy methods. Some aspects of the algorithms, for example forbidden induced subgraph sets and worst case results, are also considered. Finally, we restrict our attention on graphs of bounded maximum degree and subcubic graphs. Then by using some techniques, for example ff-redundant vertex, clique separator, and arguments based on distance, we general these results for some subclasses of $S_{i;j;k}$-free subcubic graphs.

This thesis focuses mainly on the Maximum Independent Set (MIS) problem. Some related graph theoretical combinatorial problems are also considered. As these problems are generally NP-hard, we study their complexity in hereditary graph classes, i.e. graph classes defined by a set F of forbidden induced subgraphs. We revise the literature about the issue, for example complexity results, applications, and techniques tackling the problem. Through considering some general approach, we exhibit several cases where the problem admits a polynomial-time solution. More specifically, we present polynomial-time algorithms for the MIS problem in: + some subclasses of $S_{2;j;k}$-free graphs (thus generalizing the classical result for $S_{1;2;k}$-free graphs); + some subclasses of $tree_{k}$-free graphs (thus generalizing the classical results for subclasses of P5-free graphs); + some subclasses of $P_{7}$-free graphs and $S_{2;2;2}$-free graphs; and various subclasses of graphs of bounded maximum degree, for example subcubic graphs. Our algorithms are based on various approaches. In particular, we characterize augmenting graphs in a subclass of $S_{2;k;k}$-free graphs and a subclass of $S_{2;2;5}$-free graphs. These characterizations are partly based on extensions of the concept of redundant set [125]. We also propose methods finding augmenting chains, an extension of the method in [99], and finding augmenting trees, an extension of the methods in [125]. We apply the augmenting vertex technique, originally used for $P_{5}$-free graphs or banner-free graphs, for some more general graph classes. We consider a general graph theoretical combinatorial problem, the so-called Maximum -Set problem. Two special cases of this problem, the so-called Maximum F-(Strongly) Independent Subgraph and Maximum F-Induced Subgraph, where F is a connected graph set, are considered. The complexity of the Maximum F-(Strongly) Independent Subgraph problem is revised and the NP-hardness of the Maximum F-Induced Subgraph problem is proved. We also extend the augmenting approach to apply it for the general Maximum Π -Set problem. We revise on classical graph transformations and give two unified views based on pseudo-boolean functions and αff-redundant vertex. We also make extensive uses of α-redundant vertices, originally mainly used for $P_{5}$-free graphs, to give polynomial solutions for some subclasses of $S_{2;2;2}$-free graphs and $tree_{k}$-free graphs. We consider some classical sequential greedy heuristic methods. We also combine classical algorithms with αff-redundant vertices to have new strategies of choosing the next vertex in greedy methods. Some aspects of the algorithms, for example forbidden induced subgraph sets and worst case results, are also considered. Finally, we restrict our attention on graphs of bounded maximum degree and subcubic graphs. Then by using some techniques, for example ff-redundant vertex, clique separator, and arguments based on distance, we general these results for some subclasses of $S_{i;j;k}$-free subcubic graphs.

The aim of this thesis is to find the best option of the building technology for a house. The thesis is divided into two sections – theoretical and practical. The theoretical section consists of three parts. The first part deals with theory of costs and pricing. Second part specifies types of the budgeting used in Czech Republic and the last part is focused on description of the selected construction systems used for building a house. Second section deals with description and the layout of the house, for which three budgets are set with a respect to the used option of the construction system. Furthermore, a comparison of the technical parameters as well as the costs analysis according to the TSKP is made. Finally, the optimal variant is selected with respect to the price and technical properties.

A modern answer to the question of what an above-standard multifunctional house in the South Center of Brno should look like in the 21st century. First-class urban comfort of living in the countryside on the banks of the river Svratka near the city center with excellent transport links. The design of the building combines various typologies and operations and seeks to ensure maximum efficiency in the use of the plot, its evaluation and benefits for the environment.

The dissemination of new innovative technology requires feasibility and simplicity. The problem with marker-based augmented reality is similar to glove-based hand gesture recognition: they both require an additional component to function. This thesis investigates the possibility of combining markerless augmented reality together with appearance-based hand gesture recognition by implementing a game with good user experience. The methods employed in this research consist of a game implementation and a pre-study meant for measuring interactive accuracy and precision, and for deciding upon which gestures should be utilized in the game. A test environment was realized in Unity using ARKit and Manomotion SDK. Similarly, the implementation of the game used the same development tools. However, Blender was used for creating the 3D models. The results from 15 testers showed that the pinching gesture was the most favorable one. The game was evaluated with a System Usability Scale (SUS) and received a score of 70.77 among 12 game testers, which indicates that the augmented reality game, which interaction method is solely based on bare-hands, can be quite enjoyable.

Leaflet replacement in aortic valve repair (AVr) is associated with increased long-term repair failure. Hemodynamic performance and mechanical stress levels were investigated after porcine AVr with 5 types of clinically relevant replacement materials to ascertain which material(s) would be best suited for repair. Porcine aortic roots with intact aortic valves were placed in a left-heart simulator mounted with a high-speed camera for baseline valve assessment. Then, the non-coronary leaflet was excised and replaced with autologous porcine pericardium (APP), glutaraldehyde-fixed bovine pericardial patch (BPP; Synovis™), extracellular matrix scaffold (CorMatrix™), or collagen-impregnated Dacron (HEMASHIELD™). Hemodynamic parameters were measured over a range of cardiac outputs (2.5–6.5L/min) post-repair. Material properties of the above materials along with St. Jude Medical™ Pericardial Patch with EnCapTM Technology (SJM) were determined using pressurization experiments. Finite element models of the aortic valve and root complex were then constructed to verify the hemodynamic characteristics and determine leaflet stress levels. This study demonstrates that APP and SJM have the closest profiles to normal aortic valves; therefore, use of either replacement material may be best suited. Increased stresses found in BPP, HEMASHIELD™, and CorMatrix™ groups may be associated with late repair failure.

Leaflet replacement in aortic valve repair (AVr) is associated with increased long-term repair failure. Hemodynamic performance and mechanical stress levels were investigated after porcine AVr with 5 types of clinically relevant replacement materials to ascertain which material(s) would be best suited for repair. Porcine aortic roots with intact aortic valves were placed in a left-heart simulator mounted with a high-speed camera for baseline valve assessment. Then, the non-coronary leaflet was excised and replaced with autologous porcine pericardium (APP), glutaraldehyde-fixed bovine pericardial patch (BPP; Synovis™), extracellular matrix scaffold (CorMatrix™), or collagen-impregnated Dacron (HEMASHIELD™). Hemodynamic parameters were measured over a range of cardiac outputs (2.5–6.5L/min) post-repair. Material properties of the above materials along with St. Jude Medical™ Pericardial Patch with EnCapTM Technology (SJM) were determined using pressurization experiments. Finite element models of the aortic valve and root complex were then constructed to verify the hemodynamic characteristics and determine leaflet stress levels. This study demonstrates that APP and SJM have the closest profiles to normal aortic valves; therefore, use of either replacement material may be best suited. Increased stresses found in BPP, HEMASHIELD™, and CorMatrix™ groups may be associated with late repair failure.

The paper deals with the use of unmanned aircraft of the American national security policy. It examines the history of unmanned aviation, its military use, and cost- efficiency. It then examines the main obstacles and problems with their use in national security that this technology meets and will meet in the future after a higher level of autonomy is developed. These problems involve legal issues, international and domestic American law, the issue of civilian casualties, the role of the media, and public opinion. The final chapter focuses on the problems of technical, strategic and operational issues. In this section the research paper comes to the first conclusion which claims that the introduction of more autonomous systems to war will radically change its structure and, consequently, standard procedures and strategies. Case studies are included to illustrate how successful the drone strategy is applied in the five countries where the United States leads a war on terror. The research using the theory of the revolution in military affairs concludes that these UAVs pose the greatest challenge in history and it goes well beyond military matters. UAVs in national security affect the understanding of the basic principles of war in relation to the concepts of warrior ethos and just war.

This dissertation is a focused analysis of the origins, organization, training, politics, and combat capability of the Army of the Republic of Viet Nam (ARVN) from 1954 to 1963, the leading military instrument in the national counterinsurgency plan of the government of the Republic of Viet Nam (RVN). Other military and paramilitary forces that complemented the army in the ground war included the Viet Nam Marine Corps (VNMC), the Civil Guard (CG), the Self-Defense Corps (SDC) and the Civil Irregular Defense Groups (CIDG) which was composed mainly of the indigenous populations in the Central Highlands of South Vietnam. At sea and in the air, the Viet Nam Air Force (VNAF) and the Viet Nam Navy (VNN) provided additional layers of tactical, strategic and logistical support to the military and paramilitary forces. Together, these forces formed the Republic of Viet Nam Armed Forces (RVNAF) designed to counter the communist insurgency plaguing the RVN. This thesis argues the following. First, the origin of the ARVN was rooted in the French Indochina War (1946-1954). Second, the ARVN was an amalgamation of political and military forces born from a revolution that encompassed three overlapping wars: a war of independence between the Vietnamese and the French; a civil war between the Vietnamese of diverse social and political backgrounds; and a proxy war as global superpowers and regional powers backed their own Vietnamese allies who, in turn, exploited their foreign supporters for their own purposes. Lastly, the ARVN failed not because it was organized, equipped, and trained for conventional instead of counterinsurgency warfare. Rather, it failed to assess, adjust, and adapt its strategy and tactics quickly enough to meet the war’s changing circumstances. The ARVN’s slowness to react resulted from its own institutional weaknesses, military and political problems that were beyond its control, and the powerful and dangerous enemies it faced. The People’s Army of Viet Nam (PAVN) and the People’s Liberation Armed Forces (PLAF) were formidable adversaries. Not duplicated in any other post-colonial Third World country and led by an experienced and politically tested leadership, the Democratic Republic of Viet Nam (DRVN) and the National Front for the Liberation of Southern Viet Nam (NFLSVN) exploited RVN failures effectively. Hypothetically, there was no guarantee that had the US dispatched land forces into Cambodia and Laos or invaded North Vietnam that the DRVN and NFLSVN would have quit attacking the RVN. The French Far East Expeditionary Corps (FFEEC)’ occupation of the Red River Delta did not bring peace to Cochinchina, only a military stalemate between it and the Vietnamese Liberation Army (VLA). Worse yet, a US invasion potentially would have unnerved the People’s Republic of China (PRC) which might have sent the PLAF to fight the US in Vietnam as it had in Korea. Inevitably, such unilateral military action would certainly provoke fierce criticism and opposition amongst the American public at home and allies abroad. At best, the war’s expansion might have bought a little more time for the RVN but it could never guarantee South Vietnam’s survival. Ultimately, RVN’s seemingly endless political, military, and social problems had to be resolved by South Vietnam’s political leaders, military commanders, and people but only in the absence of constant PAVN and PLAF attempts to destroy whatever minimal progress RVN made politically, militarily, and socially. The RVN was plagued by many problems and the DRVN and NFLSVN, unquestionably, were amongst those problems.