Some techniques are presented to permit the implementation of asynchronous sequential circuits using standard flip-flops. An algorithm is presented for the RS flip-flop, and it is shown that any flow table may be realized using the algorithm (the flow table is assumed to be realizable using standard logic gates). The approach is shown to be directly applicable to synchronous circuits, and transition flip-flops (JK, D, and T) are analyzed using the ideas developed. Constraints are derived for the flow tables to meet to be realizable using transition flip-flops in asynchronous situations, and upper and lower bounds on the number of transition flip-flops required to implement a given flow table are stated.

Diese Arbeit liefert, in den ersten beiden Kapiteln einen allgemeinen Überblick über die klassischen Ansätze zur Optimierung unter Unsicherheit mit einem Schwerpunkt auf probabilistischen Randbedingung. Anschließend wird im dritten Kapitel eine neue Klasse von sogenannten Probust Randbedingungen beim Auftreten von Modellen mit unsicheren Parametern mit teilweise stochastischem und teilweise nicht-stochastischem Charakter eingeführt. Wir zeigen dabei die Relevanz dieser Aufgabentypen für zwei Problemstellungen in einem stationären Gasnetz auf. Erstens liegen beim Gastransport probabilistische Randbedingungen bezüglich der Gasnachfrage vor sowie auch robuste Randbedin- gungen bezüglich der Rauheitskoeffizienten in den Rohren, welche in der Regel unbekannt sind, da es keine zuverlässigen Messmöglichkeiten gibt. Zweitens lösen wir ein Problem für einen Netzbetreiber, der zum Ziel hat, die angebotene Kapazität für alte und neue Kunden zu maximieren. In diesem Fall ist man mit einer ungewis- sen Gesamtnachfrage konfrontiert, die sich aus der probabilistischen Nachfrage für Altkunden und der robusten Nachfrage für Neukunden zusammensetzt. Für beide Fälle zeigen wir, wie mit probusten Randbedingungen im Rahmen der sogenannten sphärisch-radialen Zerlegung multivariater Gauß-Verteilungen umgegangen werden kann. Starke und schwache Halbstetigkeitsergebnisse werden für den allgemeinen Fall, in Abhängigkeit davon ob Strategien in Lebesgue oder Sobolev Räumen angenommen werden, erstellt. Für ein ein- faches zweistufiges Modell werden überprüfbare Bedingungen für die Lipschitz- Stetigkeit und die Differenzierbarkeit dieser Wahrscheinlichkeitsfunktion abgeleitet und mit expliziten Ableitungsformeln unterstützt. Diese Werkzeuge werden dann verwendet, um das Problem des Bäckers und zwei Probleme des Wasserkraftmanagements zu lösen. / This thesis offers, in the first and second chapter, a general overview of the classical approaches to solving optimization under uncertainty, with a focus on probabilistic constraints. Then, in the third chapter, a new class of so-called Probust constraints is introduced in the presence of models with uncertain parameters having partially stochastic and partially non-stochastic character. We show the relevance of this class of approach and solve two problems in a stationary gas network. First, in the context of gas transportation, one ends up with a constraint, which is probabilistic with respect to the load of gas and robust with respect to the roughness coefficients of the pipes (which are uncertain due to a lack of attainable measurements). Secondly, we solve a problem for a network operator, who would like to maximize the offered capacity for old and new customers. In this case, one is faced with an uncertain total demand which is probabilistic for old clients and robust for new clients. In both problems, we demonstrate how probust constraints can be dealt within the framework of the so-called spheric-radial decomposition of multivariate Gaussian distributions. Furthermore, in chapter four, we present novel structural and numerical results for optimization problems under a dynamic joint probabilistic constraint. Strong and weak semicontinuity results are obtained for the general case depending on whether policies are supposed to be in Lebesgue or Sobolev spaces. For a simple two-stage model, verifiable conditions for Lipschitz continuity and differentiability of this probability function are derived and endowed with explicit derivative formulae. These tools are then used to solve the Baker's problem and two hydro-power management problems.

Adaptive filters have found applications in many signal processing problems. In some situations, linear constraints are imposed on the filter weights such that the filter is forced to exhibit a certain desired response. Several algorithms for linearly constrained least-squares adaptive filtering have been developed in the literature. When implemented with finite precision arithmetic, these algorithms are inevitably subjected to rounding errors. It is essential to understand how these algorithms react to rounding errors.In this thesis, the numerical properties of three linearly constrained least-squares adaptive filtering algorithms, namely, the linearly constrained fast least algorithm, the linear systolic array for MVDR beamforming and the linearly constrained QRD-RLS algorithm, are studied. It is shown that all these algorithms can be separated into a constrained part and an unconstrained part. The numerical properties of unconstrained least-squares algorithms (i.e., the unconstrained part of the linearly constrained algorithms under study) are reviewed from the perspectives of error propagation, error accumulation and numerical persistency. It is shown that persistent excitation and sufficient numerical resolution are needed to ensure the stability of the CRLS algorithm, while the QRD-RLS algorithm is unconditionally stable. The numerical properties of the constrained algorithms are then examined. Based on the technique of how the constraints are applied, these algorithms can be grouped into two categories. The first two algorithms admit a similar structure in that the unconstrained parts preceed the constrained parts. Error propagation analysis shows that this structure gives rise to unstable error propagation in the constrained part. In contrast, the constrained part of the third algorithm preceeds the unconstrained part. It is shown that this algorithm gives an ++ / exact solution to a linearly constrained least-squares adaptive filtering problem with perturbed constraints and perturbed input data. A minor modification to the constrained part of the linearly constrained QRD-RLS algorithm is proposed to avoid a potential numerical difficulty due to the Gaussian elimination operation employed in the algorithm.

The primary objective of this thesis is to evolve a method for assessing and developing features of a learning organization . To fulfill this, I approached the thesis by examining several research questions and using multiple research methodologies. The research questions were not all established at the outset. Rather, they evolved as features of a journey down a road less traveled. With this journey came the decision to write the thesis in the first person. The first research question was Q1: What will bridge the divide between organizational learning and the learning organization? By reviewing the extant literature on organizational learning and the learning organization, I developed a theoretical framework that linked these two streams. The framework suggests that the extent of divide between the two streams is determined by the extent of learning transfer. The learning transfer is affected by the learning barriers operating at the levels of learning (i.e., individuals, groups, and organizational). This led me to my second research question Q2: What are these barriers to learning transfer and how do they impact the levels of learning in the organization? I cumulated the dispersed literature on learning barriers, and synthesized the learning barriers into five key dimensions: Intrapersonal, relational, cultural, structural, and societal. I then used the Delphi technique on 17 individuals to investigate the impact of the learning barriers on the levels of learning. This generated two additional research questions. The third research question was Q3: How do individuals initiate a double-loop change? This deals with the little researched area of initiation of double-loop change whilst engaging with the interfaces at the levels of learning. I used multiple case studies to examine this question and found that individuals transit through four distinct stages when initiating double-loop change: 'embedded', 'embedded discomfited', 'scripted', and 'unscripted'. Once double-loop learning has been initiated at the individual level, it is important that it is transferred across the organization. Therefore, my fourth research question was Q4: How does a new shared understanding for a double-loop change develop across the organization? I did an in-depth, single case based investigation of an organization. Using Identity and Complexity theory perspectives, I tracked the evolving new shared understanding through four phases: de-identification phase, situated re-identification phase, transition phase, and identification with core ideology phase. The key insights from examining these research questions, particularly insights from examining Q3 and Q4, enabled me to suggest nine key organizational interventions necessary to overcome the learning barriers and develop a learning organization: Identifying, developing, and dispersing double-loop mastery; Enabling constructive contradictions; Creating a superordinate organizational identity; Building emotional intelligence (in individuals and groups); Ambidextrous leadership; Strategic support for experimentation; Promoting 'systems doing'; Accessibility of valid information; Institutionalizing scanning across industry boundaries. When these nine organizational interventions are implemented, they produce five new learning organization orientations: genetic diversity, organizational ideology, organizational dualism, organizational coupling, and strategic play. These five new learning organizational orientations provide the archetypes of the learning organization. I then developed an instrument to assess these five new orientations, and did a preliminary testing of the instrument. While aspects of my work overlaid with previous knowledge, new advances in knowledge were established by: Postulating a link between the streams of organizational learning and learning organization Synthesizing learning barriers into the five key dimensions, and investigating their impact on the levels of learning Understanding the stages of double-loop learning initiation by an individual, whilst engaging with the interfaces at the levels of learning Understanding the process of a new shared understanding evolving Postulating five new orientations of the learning organization

<p>This paper addresses the need to review the modern presentation of textile archaeology in museums. It is time to look at textiles in archaeology with new eyes. The reality behind archaeological textilestudy is holistic, embracing many different aspects of society. The presentation of textiles has in my opinion become old-fashioned. I will show in my paper that Jonathan Adams’ `seven constraints´ model, developed for research on ancient ships, can also be applied to textile research. I will also show that it is obvious that all seven constraints or`aspects´ as I call them - namely purpose, technology, traditions,material resources, economy, environment and ideology - and the connections between them should be taken up in museum displays. It is first then that we can obtain a holistic view of what textiles have meant to people over time.</p>

Traditionally, the compilation of long-term timetables for high-density rail service with multiple classes of trains on the same track is a job for expert people, not computers. We propose an algorithm that uses the range-constriction search technique to schedule the timing and pass-through relations of trains smoothly and efficiently. The program determines how the timing of certain trains constrains the timing of others, finds possible time regions and pass-through relations and then evaluates the efficiency of train movement for each pass-through relation.

No description available.

This dissertation contains four essays and is focused on evaluating, and to a lesser degree, extending, theories on monopoly and oligopoly pricing. The data in all of the essays originates from the Swedish daily newspaper markets."Pricing Contracts With Different Duration: The Role of Switching Costs" analyzes how prices of contracts with different duration are affected by the degree of "lock-in". We extend a model by Glazer and Hassin (1982) by adding switching cost. We use the daily newspaper data to test propositions from the model. The essay also analyzes the use of second-degree price discrimination, in the form of different contract durations, by newspapers, and finds that more competition yields more  discrimination. "Prices, Margins and Liquidity Constraints: Swedish Newspapers 1990-1996" analyzes an example of how the financial situation of firms may affect their product market pricing decisions. When consumers have switching costs, they are to some extent "locked in" and can be exploited. If a firm finds itself in financial distress it may have to resort to raising prices to cover short run expenses, thus sacrificing long run profits. This effect is found in subscription markets but not in advertising markets where consumers do not have switching costs. "Pricing Pre-Announcements and Price Leadership in the Swedish Daily Newspaper Industry" analyzes the publication of prices and price-setting behavior in the advertising markets. We find that large price increases and price cuts are published earlier. Duopolies exhibit publication behavior that differs from monopolies. Price leadership is prevalent in many of the duopoly markets and the price leadership observed in these markets is likely to be barometric. "Third-Degree Price Discrimination in Oligopoly: Evidence from Swedish Newspapers" addresses the question of how competition affects the use of third-degree price discrimination. We study the discounting behavior in subscription markets and find that duopolies and firms with weak market positions use more third-degree price discrimination. There is some indication that large immigration to the market and the firm being present in a large number of markets increases the use of discounts. / <p>Diss. (sammanfattning) Stockholm : Handelshögskolan, 2001</p>

No description available.

As an expressive knowledge representation language for Semantic Web, Web Ontology Language (OWL) plays an important role in areas like science and commerce. The problem of maintaining integrity constraints arises because OWL employs the Open World Assumption (OWA) as well as the Non-Unique Name Assumption (NUNA). These assumptions are typically suitable for representing knowledge distributed across the Web, where the complete knowledge about a domain cannot be assumed, but make it challenging to use OWL itself for closed world integrity constraint validation. Integrity constraints (ICs) on ontologies have to be enforced; otherwise conflicting results would be derivable from the same knowledge base (KB). The current trends of incorporating ICs into OWL are based on its query language SPARQL, alternative semantics, or logic programming. These methods usually suffer from limited types of constraints they can handle, and/or inherited computational expensiveness. This dissertation presents a comprehensive and efficient approach to maintaining integrity constraints. The design enforces data consistency throughout the OWL life cycle, including the processes of OWL generation, maintenance, and interactions with other ontologies. For OWL generation, the Paraconsistent model is used to maintain integrity constraints during the relational database to OWL translation process. Then a new rule-based language with set extension is introduced as a platform to allow users to specify constraints, along with a demonstration of 18 commonly used constraints written in this language. In addition, a new constraint maintenance system, called Jena2Drools, is proposed and implemented, to show its effectiveness and efficiency. To further handle inconsistencies among multiple distributed ontologies, this work constructs a framework to break down global constraints into several sub-constraints for efficient parallel validation.