Syfte: Syftet med denna studie är att undersöka hur målföretags runup påverkar den premie sombetalas vid företagsförvärv utifrån substitutions- och markup-prissättningshypotesen. Metod: Studien har en deduktiv ansats där en eventstudie har tillämpats för att samla in relevant sekundärdata från databaserna Thomson Reuters Eikon och Zephyr. För att studera sambandet mellan förvärvspremie och målföretagets runup har en enkel regressionsanalys genomförts och för att studera förklarande variablers påverkan på runup har en multipel regressionsanalys tillämpats. Resultat & slutsats: Studiens resultat visar att det förekommer ett samband mellan runup och den förvärvspremie som betalas vid företagsförvärv. Utifrån substitutions- och markup-prissättningshypotesen visar studien att om runup ökar med 1 % ökar förvärvspremien med 0,879% vilket innebär att en ökning av målföretagets runup är en kostnad för det förvärvande företaget. Förslag till fortsatt forskning: Förslag på vidare forskning är att studera fler förklarande variabler för ett målföretags runup samt att studera volymskillnader i handel av målföretagets aktier dagarna före offentliggörande av bud på exempelvis den svenska marknaden för att se huruvida resultatet skiljer sig från tidigare forskning och andra marknader. Uppsatsens bidrag: Studiens resultat bidrar med kunskap som kan förklara den variation i förvärvspremier som förekommer samt kunskap om att ett målföretags runup är en förvärvskostnad för det förvärvande företaget. / Aim: The purpose of this study is to investigate how the target companies’ runup affects thetakeover premium in mergers and acquisitions based on the substitution and markup pricing hypothesis. Method: The study has a deductive approach in which an event study has been applied to collectrelevant secondary data from the databases Thomson Reuters Eikon and Zephyr. To study the relationship between the acquisition premium and the target company’s runup a simple regression analysis has been conducted and to study the influence of explanatory variables on runup a multiple regression analysis has been applied. Result & Conclusions: The study’s results show that there is a relationship between runup and the takeover premiums. Based on the substitution and markup pricing hypothesis, the study shows that if runup increases by 1 % the takeover premium increases by 0.879 % which means that an increase in the target company's runup is a cost to the acquiring company. Suggestions for future research: Suggestions for further research are to study more explanatory variables for a target company's runup and study volume differences in trading of the target company's shares the days prior to bid announcement on the Swedish market to see if the results differ from previous research and other markets. Contribution of the thesis: The study’s results contribute knowledge that can explain the variation in takeover premiums and knowledge that a target company’s runup in an acquisition is a cost for the acquiring company.

No description available.

published_or_final_version / Humanities / Master / Master of Philosophy

No description available.

Approved for public release; distribution is unlimited / The Department of Defense (DoD) is both challenged by the quest for interoperability and capable of the bottom-up development of a solution. The predominant method for achieving interoperability is the development of an intermediate representation that provides a common integration language or data model. An example is Young's Object-Oriented Method for Interoperability (OOMI), which produces a Federation Interoperability Object Model (FIOM) for the resolution of heterogeneities in representation and view of a real-world entity. An FIOM generates a standard for interoperability by associating the non-standard, component system data models into an extensible lattice, which captures translations that resolve data modeling differences. To support the bottom-up creation of an FIOM we; (1) describe a self-similar approach to data storage that allows generic data structures to be manageable, extensible and asynchronously populated, and (2) introduce a lattice concept for facilitating efficient and scalable object inheritance relationships. We assert that DoD's acquisition environment necessitates a distributed approach to solving the interoperability challenge. We present the description of a distributed software system to facilitate the collaborative construction of an FIOM within the existing DoD structure and provide an architecture to guide the development of such a distributed collaborative environment. / Lieutenant, United States Navy

by Yan, Men-Hin. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2001. / Includes bibliographical references (leaves 114-119). / Abstracts in English and Chinese. / Abstract --- p.ii / Acknowledgments --- p.iv / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Storing XML in Database Systems --- p.2 / Chapter 1.2 --- Outline of the Thesis --- p.4 / Chapter 2 --- Related Work --- p.5 / Chapter 2.1 --- Overview of XML --- p.5 / Chapter 2.1.1 --- Extensible Markup Language (XML) --- p.5 / Chapter 2.1.2 --- Data Type Definition (DTD) --- p.6 / Chapter 2.1.3 --- "ID, IDREF and IDREFS" --- p.9 / Chapter 2.2 --- Using Special-Purpose Database to Store XML Data --- p.10 / Chapter 2.3 --- Using Relational Databases to Store XML Data --- p.11 / Chapter 2.3.1 --- Extracting Schemas with STORED --- p.11 / Chapter 2.3.2 --- Using Simple Schemes Based on Labeled Graph --- p.12 / Chapter 2.3.3 --- Generating Schemas from DTDs --- p.12 / Chapter 2.3.4 --- Commercial Approaches --- p.13 / Chapter 2.4 --- Discovering Functional Dependencies --- p.14 / Chapter 2.4.1 --- Functional Dependency --- p.14 / Chapter 2.4.2 --- Finding Functional Dependencies --- p.14 / Chapter 2.4.3 --- TANE and Partition Refinement --- p.15 / Chapter 2.5 --- Multivalued Dependencies --- p.17 / Chapter 2.5.1 --- Example of Multivalued Dependency --- p.18 / Chapter 3 --- Using RDBMS to Store XML Data --- p.20 / Chapter 3.1 --- Global Schema Extraction Algorithm --- p.22 / Chapter 3.1.1 --- Step 1: Simplify DTD --- p.22 / Chapter 3.1.2 --- Step 2: Construct Schema Prototype Trees --- p.24 / Chapter 3.1.3 --- Step 3: Generate Relational Schema Prototype --- p.29 / Chapter 3.1.4 --- Step 4: Discover Functional Dependencies and Candidate Keys --- p.31 / Chapter 3.1.5 --- Step 5: Normalize the Relational Schema Prototypes --- p.32 / Chapter 3.1.6 --- Discussion --- p.32 / Chapter 3.2 --- DTD-splitting Schema Extraction Algorithm --- p.34 / Chapter 3.2.1 --- Step 1: Simplify DTD --- p.35 / Chapter 3.2.2 --- Step 2: Construct Schema Prototype Trees --- p.36 / Chapter 3.2.3 --- Step 3: Generate Relational Schema Prototype --- p.45 / Chapter 3.2.4 --- Step 4: Discover Functional Dependencies and Candidate Keys --- p.46 / Chapter 3.2.5 --- Step 5: Normalize the Relational Schema Prototypes --- p.47 / Chapter 3.2.6 --- Discussion --- p.49 / Chapter 3.3 --- Experimental Results --- p.50 / Chapter 3.3.1 --- Real Life XML Data: SIGMOD Record XML --- p.50 / Chapter 3.3.2 --- Synthetic XML Data --- p.58 / Chapter 3.3.3 --- Discussion --- p.68 / Chapter 4 --- Finding Multivalued Dependencies --- p.75 / Chapter 4.1 --- Validation of Multivalued Dependencies --- p.77 / Chapter 4.2 --- Search Strategy and Pruning --- p.80 / Chapter 4.2.1 --- Search Strategy for Left-hand Sides Candidates --- p.81 / Chapter 4.2.2 --- Search Strategy for Right-hand Sides Candidates --- p.82 / Chapter 4.2.3 --- Other Pruning --- p.85 / Chapter 4.3 --- Computing with Partitions --- p.87 / Chapter 4.3.1 --- Computing Partitions --- p.88 / Chapter 4.4 --- Algorithm --- p.89 / Chapter 4.4.1 --- Generating Next Level Candidates --- p.92 / Chapter 4.4.2 --- Computing Partitions --- p.93 / Chapter 4.5 --- Experimental Results --- p.94 / Chapter 4.5.1 --- Results of the Algorithm --- p.95 / Chapter 4.5.2 --- Evaluation on the Results --- p.96 / Chapter 4.5.3 --- Scalability of the Algorithm --- p.98 / Chapter 4.5.4 --- Using Multivalued Dependencies in Schema Extraction Al- gorithms --- p.101 / Chapter 5 --- Conclusion --- p.108 / Chapter 5.1 --- Discussion --- p.108 / Chapter 5.2 --- Future Work --- p.110 / Chapter 5.2.1 --- Translate Semistructured Queries to SQL --- p.110 / Chapter 5.2.2 --- Improve the Multivalued Dependency Discovery Algorithm --- p.112 / Chapter 5.2.3 --- Incremental Update of Resulting Schema --- p.113 / Bibliography --- p.113 / Appendix --- p.120 / Chapter A --- Simple Proof for Minimality in Multivalued Dependencies --- p.120 / Chapter B --- Third and Fourth Normal Form Decompositions --- p.122 / Chapter B.1 --- 3NF Decomposition Algorithm --- p.123 / Chapter B.2 --- 4NF Decomposition Algorithm --- p.124

Experiments were conducted to show the effectiveness of our approaches. / The security of the XML data draws as much attention as the efficiency problem. In this thesis, we study a promising approach to store the accessibility information, which is based on the Compressed Accessibility Map (CAM). We make two advancements in this direction. (1) Previous work suggests that for each user group and each operation type, a different CAM is built. We observe that the performance and storage requirements can be further improved by combining multiple CAMs into an Integrated CAM (ICAM). We explore this possibility and propose an integration mechanism. (2) If the change in structure of the XML data is not frequent, we suggest an efficient lookup method, which can be applied to CAMS or ICAMs, with a much lower time complexity compared to the previous approach. / We take into consideration ID/IDREF attributes, which are common in XML documents. Most related works model an XML document with ID/IDREF attributes as a graph. We retain a tree model, called extended XML tree, in which the IDREF attribute is regarded as an IDREF node, instead of an IDREF edge to the corresponding node. Based on this model, we propose a B+-tree style index (PIN-tree) integrating the essence of the path index and the inverted list approach. A query evaluation algorithm, PINE, based on the model and the indexing is proposed. PINE handles efficiently queries with/without IDREF requests, and IDREF requests can be stated explicitly or implicitly. We prove that PINE is near optimal for twig queries without IDREF requests under the assumption that the number of distinct tag paths to a label is limited. The assumption is proven to be reasonable by experiments. The complexity of PINE for queries with IDREF requests is also given. / XML is emerging as a widely-used platform-independent data representation language. With increasing interests in XML data, techniques concerning XML evolve rapidly. In this thesis, we study two important issues when querying XML data, efficiency and security, which are essential to an XML searching engine. / Jiang Mingfei. / "January 2006." / Adviser: Ada Wai-Chee Fu. / Source: Dissertation Abstracts International, Volume: 67-11, Section: B, page: 6509. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2006. / Includes bibliographical references (p. 136-143). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [200-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstracts in English and Chinese. / School code: 1307.

Thesis (M.S.)--University of Florida, 2001. / Title from first page of PDF file. Document formatted into pages; contains x, 54 p.; also contains graphics. Vita. Includes bibliographical references (p. 50-53).

Thesis (Ph. D.)--Worcester Polytechnic Institute. / Keywords: XML; XQuery; incremental view maintenance. Includes bibliographical references (leaves 256-263).

Thesis (M.S.)--University of Florida, 2001. / Title from first page of PDF file. Document formatted into pages; contains x, 54 p.; also contains graphics. Vita. Includes bibliographical references (p. 50-53).