Minority government is defined by the relationship between the legislative and executive branches of government in parliamentary democracies; it means single-party cabinet or coalition cabinet, which are not supported by a parliamentary majority in Parliamentary and Semi-Presidential countries. For instance, in Taiwan, Chen Shui-bian won the Presidential Election in 2000, but he just garnered 39.3¢Mof the popular vote, so he was a minority president. After election, the president Chen Shui-bian appointed Chang Chun-hsiung as Premier (Executive Yuan); therefore, ¡§Chen Shui-bian government¡¨ indeed was a minority government. Because the ¡§regime turnover¡¨ happened in Taiwan is the first time, as a ruling party, Democratic Progressive Party (DPP) didn¡¦t deal with very well in cabinet portfolios, policy concession or policy implementation. On the other hand, the political disturbance has been existed in the executive-legislative relations since 2000. Under this context, to understand why minority governments form and how they operate become an important issue. As we noted, there is not rich literature on minority governments, so this is why the study focus on initially exploring minority government. This essay includes two research subjects: The first point is to analyze theory of minority government. By following the documents of the scholars¡¦ comparison and research, I try to explain why a minority government form from the part of the institution and strategy; I also introduce the operation and performance of minority government briefly. The second point is to do the studies of cases of minority government and performance in Norway and Fourth Republic France: From the two empirical cases, I expect to find a suitable solution for the constitutional deadlock at present in Taiwan.

Regularity is a shared memory consistency condition that has received considerable attention, notably in connection with quorum-based shared memory. Lamport's original definition of regularity assumed a single-writer model, however, and is not well defined when each shared variable may have multiple writers. In this thesis, we address this need by formally extending the notion of regularity to a multi-writer model. We have shown that the extension is not trivial. While there exist various ways to extend the single-writer definition, the resulting definitions will have different strengths. Specifically, we give several possible definitions of regularity in the presence of multiple writers. We then present a quorum-based algorithm to implement each of the proposed definitions and prove them correct. We study the relationships between these definitions and a number of other well-known consistency conditions, and give a partial order describing the relative strengths of these consistency conditions. Finally, we provide a practical context for our results by studying the correctness of two well-known algorithms for mutual exclusion under each of our proposed consistency conditions.

<p>To achieve better scalability, a fully replicated, distributed, main-memory database is divided into subparts, called segments. Segments may have individual degrees of redundancy and other properties that can be used for replication control. Segmentation is examined for the opportunity of decreasing replication effort, lower memory requirements and decrease node recovery times. Typical usage scenarios are distributed databases with many nodes where only a small number of the nodes share information. We present a framework for virtual full replication that implements segments with scheduled replication of updates between sharing nodes.</p><p>Selective replication control needs information about the application semantics that is specified using segment properties, which includes consistency classes and other properties. We define a syntax for specifying the application semantics and segment properties for the segmented database. In particular, properties of segments that are subject to hard real-time constraints must be specified. We also analyze the potential improvements for such an architecture.</p>

<p>Distributed real-time database systems demand consistency and timeliness. One approach for this problem is eventual consistency which guarantees local consistency within predictable time. Global consistency can be reached by best effort mechanisms but for some scenarios, e.g. an alarm signal, this may not be suffcient. Bounded delay replication, which provides global consistency in bounded time, ensures that after the local commit of a transaction updates are propagated to and integrated at any remote node within bounded time. The DRTS group at the University of Skövde is working on a project called DeeDS, which is a distributed real-time database prototype. In this prototype, eventual consistency with as</p><p>soon as possible (ASAP) replication is implemented. The goal of this dissertation is to further develop replication in this prototype in coexistence to the existing eventual consistency which implies the extension of both the theory and the implementation.</p><p>The main issue with bounded time replication is to make all parts, which are involved in the replication process predictable and simultaneously support eventual consistency with as soon as possible replication.</p>

The objective of this Thesis research is to develop algorithms for temporally consistent semantic segmentation in videos. Though many different forms of semantic segmentations exist, this research is focused on the problem of temporally-consistent holistic scene understanding in outdoor videos. Holistic scene understanding requires an understanding of many individual aspects of the scene including 3D layout, objects present, occlusion boundaries, and depth. Such a description of a dynamic scene would be useful for many robotic applications including object reasoning, 3D perception, video analysis, video coding, segmentation, navigation and activity recognition. Scene understanding has been studied with great success for still images. However, scene understanding in videos requires additional approaches to account for the temporal variation, dynamic information, and exploiting causality. As a first step, image-based scene understanding methods can be directly applied to individual video frames to generate a description of the scene. However, these methods do not exploit temporal information across neighboring frames. Further, lacking temporal consistency, image-based methods can result in temporally-inconsistent labels across frames. This inconsistency can impact performance, as scene labels suddenly change between frames. The objective of our this study is to develop temporally consistent scene descriptive algorithms by processing videos efficiently, exploiting causality and data-redundancy, and cater for scene dynamics. Specifically, we achieve our research objectives by (1) extracting geometric context from videos to give broad 3D structure of the scene with all objects present, (2) Detecting occlusion boundaries in videos due to depth discontinuity, (3) Estimating depth in videos by combining monocular and motion features with semantic features and occlusion boundaries.

ITC/USA 2014 Conference Proceedings / The Fiftieth Annual International Telemetering Conference and Technical Exhibition / October 20-23, 2014 / Town and Country Resort & Convention Center, San Diego, CA / This paper reflects the principal results of a study performed internally by Airbus's flight test centers. The purpose of this study was to share the body of knowledge concerning data consistency checks between all Airbus business units. An analysis of the test process is followed by the identification of the process stakeholders involved in ensuring data consistency. In the main part of the paper several different possibilities for improving data consistency are listed; it is left to the discretion of the reader to determine the appropriateness these methods.

No description available.

Process models support the transition from business requirements to IT implementations. An organization that adopts process modeling often maintain several co-existing models of the same business process. These models target different abstraction levels and stakeholder perspectives. Maintaining consistency among these models has become a major challenge for such an organization. For instance, propagating changes requires identifying tacit correspondences among the models, which may be only in the memories of their original creators or may be lost entirely. Although different tools target specific needs of different roles, we lack appropriate support for checking whether related models maintained by different groups of specialists are still consistent after independent editing. As a result, typical consistency management tasks such as tracing, differencing, comparing, refactoring, merging, conformance checking, change notification, and versioning are frequently done manually, which is time-consuming and error-prone. This thesis presents the Shared Model, a framework designed to improve support for consistency management and impact analysis in process modeling. The framework is designed as a result of a comprehensive industrial study that elicited typical correspondence patterns between Business and IT process models and the meaning of consistency between them. The framework encompasses three major techniques and contributions: 1) matching heuristics to automatically discover complex correspondences patterns among the models, and to maintain traceability among model parts---elements and fragments; 2) a generator of edit operations to compute the difference between process models; 3) a process model synchronizer, capable of consistently propagating changes made to any model to its counterpart. We evaluated the Shared Model experimentally. The evaluation shows that the framework can consistently synchronize Business and IT views related by correspondence patterns, after non-simultaneous independent editing.

Physical property data was used to test two hypotheses pertaining to the impact of a chemical pre-treatment on the qualities of low consistency refined pulp. The first objective was to determine whether the addition of a chemical treatment would effectively accelerate the refining process when compared to a regular pulp. This involved the measurement of the physical property data and how it changed with increased refining energy. The second objective was to determine how the chemical treatment affected fibre development during refining, and whether its implementation could result in enhancement of inter-fibre bondability. Theoretical models for the physical properties of paper were used to study the fibre-to-fibre bonding properties of the tested paper samples. Additionally, SEM images were obtained to study the deferences in morphology of the tested pulp samples.

Physical property data was used to test two hypotheses pertaining to the impact of a chemical pre-treatment on the qualities of low consistency refined pulp. The first objective was to determine whether the addition of a chemical treatment would effectively accelerate the refining process when compared to a regular pulp. This involved the measurement of the physical property data and how it changed with increased refining energy. The second objective was to determine how the chemical treatment affected fibre development during refining, and whether its implementation could result in enhancement of inter-fibre bondability. Theoretical models for the physical properties of paper were used to study the fibre-to-fibre bonding properties of the tested paper samples. Additionally, SEM images were obtained to study the deferences in morphology of the tested pulp samples.