<p>Individual level factors related to the successor have a central role to play in the succession process of the business. When these factors are viewed in relation to succession planning models, these factors have a direct relation to the succession models in terms of success or failure of the succession process. The major contributing factor to the success or failure of the succession process is that of the leadership provided to the organization by the predecessor. These leadership qualities change from one form to another during different phases of the succession planning models.</p>

Individual level factors related to the successor have a central role to play in the succession process of the business. When these factors are viewed in relation to succession planning models, these factors have a direct relation to the succession models in terms of success or failure of the succession process. The major contributing factor to the success or failure of the succession process is that of the leadership provided to the organization by the predecessor. These leadership qualities change from one form to another during different phases of the succession planning models.

We study two data structuring problems under the bit probe model: the dynamic predecessor problem and integer representation in a manner supporting basic updates in as few bit operations as possible. The model of computation considered in this paper is the bit probe model. In this model, the complexity measure counts only the bitwise accesses to the data structure. The model ignores the cost of computation. As a result, the bit probe complexity of a data structuring problem can be considered as a fundamental measure of the problem. Lower bounds derived by this model are valid as lower bounds for any realistic, sequential model of computation. Furthermore, some of the problems are more suitable for study in this model as they can be solved using less than $w$ bit probes where $w$ is the size of a computer word. The predecessor problem is one of the fundamental problems in computer science with numerous applications and has been studied for several decades. We study the colored predecessor problem, a variation of the predecessor problem, in which each element is associated with a symbol from a finite alphabet or color. The problem is to store a subset $S$ of size $n,$ from a finite universe $U$ so that to support efficient insertion, deletion and queries to determine the color of the largest value in $S$ which is not larger than $x,$ for a given $x \in U.$ We present a data structure for the problem that requires $O(k \sqrt[k]{{\log U} \over {\log \log U}})$ bit probes for the query and $O(k^2 {{\log U} \over {\log \log U}})$ bit probes for the update operations, where $U$ is the universe size and $k$ is positive constant. We also show that the results on the colored predecessor problem can be used to solve some other related problems such as existential range query, dynamic prefix sum, segment representative, connectivity problems, etc. The second structure considered is for integer representation. We examine the problem of integer representation in a nearly minimal number of bits so that increment and decrement (and indeed addition and subtraction) can be performed using few bit inspections and fewer bit changes. In particular, we prove a new lower bound of $\Omega(\sqrt{n})$ for the increment and decrement operation, where $n$ is the minimum number of bits required to represent the number. We present several efficient data structures to represent integers that use a logarithmic number of bit inspections and a constant number of bit changes per operation.

We study two data structuring problems under the bit probe model: the dynamic predecessor problem and integer representation in a manner supporting basic updates in as few bit operations as possible. The model of computation considered in this paper is the bit probe model. In this model, the complexity measure counts only the bitwise accesses to the data structure. The model ignores the cost of computation. As a result, the bit probe complexity of a data structuring problem can be considered as a fundamental measure of the problem. Lower bounds derived by this model are valid as lower bounds for any realistic, sequential model of computation. Furthermore, some of the problems are more suitable for study in this model as they can be solved using less than $w$ bit probes where $w$ is the size of a computer word. The predecessor problem is one of the fundamental problems in computer science with numerous applications and has been studied for several decades. We study the colored predecessor problem, a variation of the predecessor problem, in which each element is associated with a symbol from a finite alphabet or color. The problem is to store a subset $S$ of size $n,$ from a finite universe $U$ so that to support efficient insertion, deletion and queries to determine the color of the largest value in $S$ which is not larger than $x,$ for a given $x \in U.$ We present a data structure for the problem that requires $O(k \sqrt[k]{{\log U} \over {\log \log U}})$ bit probes for the query and $O(k^2 {{\log U} \over {\log \log U}})$ bit probes for the update operations, where $U$ is the universe size and $k$ is positive constant. We also show that the results on the colored predecessor problem can be used to solve some other related problems such as existential range query, dynamic prefix sum, segment representative, connectivity problems, etc. The second structure considered is for integer representation. We examine the problem of integer representation in a nearly minimal number of bits so that increment and decrement (and indeed addition and subtraction) can be performed using few bit inspections and fewer bit changes. In particular, we prove a new lower bound of $\Omega(\sqrt{n})$ for the increment and decrement operation, where $n$ is the minimum number of bits required to represent the number. We present several efficient data structures to represent integers that use a logarithmic number of bit inspections and a constant number of bit changes per operation.

abstract: Human resources have always been the most critical factor in the construction industry, and now, with a historic generation entering the age of retirement, the construction industry needs to place greater effort in preparing for the succession of their most important of human resource, their leaders. A significant body of research has shown that succession planning minimizes the negative effects that come with leadership transition; however, little research has focused specifically on the construction industry. The majority of construction companies are family owned or have small pools of potential successors, which make them more susceptible to the negative impacts that occur with poor planning for succession. The objective of this research focuses on developing a methodology that will assist construction companies plan and prepare for a leadership transition. Data is gathered from case studies of twelve construction companies that have recently experienced leadership succession. The data is analyzed for practices and characteristics that correlate to successful leadership transitions. Through the findings in the literature review and data analysis of the case studies, the research successfully achieves the objective of developing a potential methodology for increasing the effectiveness of succession planning in a construction company. / Dissertation/Thesis / M.S. Construction 2012

Valstybių teisių perėmimo ir pareigos atlyginti tarptautiniu pažeidimu padarytą žalą tema yra aktuali Lietuvai ir kitoms Baltijos valstybėms dėl to, kad pastaruoju metu itin aktyviai Lietuva pradėjo reikalauti Rusijos Federacijos atlyginti tarptautiniais pažeidimais, įvykdytais SSRS, padarytą žalą. Šios žalos Rusijos Federacija atlyginti nesiima, motyvuodama tuo, kad Rusijos Federacija yra skirtingas subjektas nuo SSRS, ir, esą, tokia padėtis ją atleidžia nuo atsakomybės bei iš jos išplaukiančių pareigų. Valstybių pareigos atlyginti tarptautiniu pažeidimu padarytą žalą klausimas valstybių teisių perėmimo kontekste taip pat nėra nei reguliuojamas universalių tarptautinių dokumentų, nei gausiai pagrįstas vieninga tarptautine praktika, nei išsamiai nagrinėtas tarptautinės teisės doktrinoje. Dėl šios priežasties būtina išnagrinėti tiek tarp valstybių susiklosčiusią praktiką, tarptautinius teisinius santykius, kylančius tiek atskirai valstybių teisių perėmimo bei tarptautinio pažeidimo atveju, tiek situacijos, kuriomis šie du institutai sprendžiami drauge. Tad šio tiriamojo darbo tikslas – atskirai išnagrinėti ir aptarti valstybių teisių perėmimo bei atsakomybės už tarptautinius teisės pažeidimus praktiką ir teisinį reguliavimą, kartu doktrinos pateikiamas išvadas; taip pat atskleisti, kokios taisyklės taikomos šiuo metu valstybių atsakomybei už tarptautinės teisės pažeidimus valstybių teisių perėmimo kontekste. Šio tikslo siekiama įgyvendinant konkrečius uždavinius: išnagrinėti... [toliau žr. visą tekstą] / The subject of state succession and obligation to make reparation for the injury caused by internationally wrongful act is a matter of great relevance to Lithuania and other Baltic states because recently Lithuania began to require from Russian Federation to make reparation for the internationally wrongful acts committed by the USSR very actively. Russian Federation refuses to make reparation motivating that Russian Federation is a separate subject from USSR and that this is the reason why it is not responsible for the wrongful acts committed by the USSR. The question of the obligation to make reparation in the context of state succession is not under regulation of universal treaties, nor multiplicitly founded on judicial practice, also is not a subject of wide analysis in doctrinal level. That is why it is necessary to analyze practice of the states, international relations, arising in the area of state succession and internationally wrongful acts as well as the situations were these two institutes are to be dealt together. Therefore the aim of this master’s work is to analyze and discuss the cases and legal regulation as well as the doctrinal conclusions on state succession and obligation to make reparation; also to reveal the rules which are applied on the state responsibility in the context of state succession. This aim is to be pursued through particular tasks: to analyze the concept, scope, variants of state succession, to describe internationally wrongful act, it’s... [to full text]

The purposes of this thesis are probing into the change of Chinese Oil Painting in art market. By means of this study, we will able to understand the development processes of the art markets in China, on the other hand, to gather the data from the auction market of different age artists and analysis them. Furthermore, it¡¦s the way to clarify how strong the art market in China is, or just the strategy to sensationalize the whole market to get high attention. But, it¡¦s obvious to find out that the environment affects the artists¡¦ creation a lot, but the works in the art market will go by chance. Therefore, to conclude that the Chinese art market is immature because the position of Chinese oil paintings is not fixed by Chinese government, Chinese artists and Chinese art market, but the art market in the world. Consequently, the Chinese art market needs to connect with the international art market.

Given a geometric graph G = (V,E), where V is the set of vertices and E is the set of edges and a source-target pair {s,t} is a subset of V, a local geometric routing algorithm seeks a route from s to t using only local neighborhood relationships. This thesis proposes a local geometric routing algorithm that uses only a single state bit as message overhead and guarantees delivery of messages in three different classes of edge-augmented planar graphs: convex subdivisions, quasi planar convex subdivisions (allow some augmented edges on a spanning convex subdivision) and 2-augmented triangulations (allow some augmented edges on a spanning triangulation). The proposed algorithm is origin oblivious (does not require the knowledge of the origin vertex s) and predecessor oblivious (does not require the knowledge of the predecessor vertex).

Given a geometric graph G = (V,E), where V is the set of vertices and E is the set of edges and a source-target pair {s,t} is a subset of V, a local geometric routing algorithm seeks a route from s to t using only local neighborhood relationships. This thesis proposes a local geometric routing algorithm that uses only a single state bit as message overhead and guarantees delivery of messages in three different classes of edge-augmented planar graphs: convex subdivisions, quasi planar convex subdivisions (allow some augmented edges on a spanning convex subdivision) and 2-augmented triangulations (allow some augmented edges on a spanning triangulation). The proposed algorithm is origin oblivious (does not require the knowledge of the origin vertex s) and predecessor oblivious (does not require the knowledge of the predecessor vertex).

This paper deals with problem of procedurally generated city. There are described steps of creation of city. These steps are: road generation, extraction of minimal cycles in graph, division of lots and generation of buildings. Road and buildings are generated by L-system. Our system generate a city from input images, such as height map, map of population density and map of water areas. Proposed approaches are used for implementation of application for generation of city.