REFLECTIONS ON THE REFORM OF ANTIDUMPING LAW A CASE STUDY OF ANTI-DUMPING LAW IN THE UNITED STATES

As of the end of 1997, 29 of the 132 member countries of the WTO had some form of the antidumping regime in operation. Most of the antidumping measures were taken by developed countries, with the United States leading in the number of measures invocated, which lends support to the criticism that the United States has wielded the antidumping law for the purpose of protecting its noncompetitive domestic industry. Attendant to this criticism, and taking the United States antidumping law as a typical model law embodying the Antidumping Agreement, this thesis first looks at the evolution of antidumping law in the United States and its operational scheme. Then it analyzes the United States antidumping law in substantive matters examining whether and how unfair the United States antidumping policy is. Then, this thesis next analyzes the necessity of maintaining the antidumping regime and an appropriate alternative to the antidumping law under the international trade order governed by the World Trade Organization

An analysis of wealth effect to shareholders of the lodging industry in mergers and acquisitions

This study originated from the question of whether additional wealth gains from merger and acquisition activities accrued to shareholders of both acquiring and target hotel firms since there is no enough evidence related to the hospitality industry; The result indicated that corporate takeovers generate, on average, significant positive additional gains to shareholders of acquiring firms of non-casino hotel firms and shareholders of target firms of both non-casino and casino hotel firms. Shareholders of acquiring firms of non-casino hotel firms, on the other hand, earn normal returns from the takeover proposals. Furthermore, the results showed that there is a difference in the size of additional gains between acquiring firms of non-casino hotel and casino hotel firms, and that there is a difference in size of additional gains between target firms of non-casino hotel and casino hotel firms

Simple Order-Isomorphic Matching Index with Expected Compact Space

In this paper, we present a novel indexing method for the order-isomorphic pattern matching problem (also known as order-preserving pattern matching, or consecutive permutation matching), in which two equal-length strings are defined to match when X[i] < X[j] iff Y[i] < Y[j] for 0 ? i,j < |X|. We observe an interesting relation between the order-isomorphic matching and the insertion process of a binary search tree, based on which we propose a data structure which not only has a concise structure comprised of only two wavelet trees but also provides a surprisingly simple searching algorithm. In the average case analysis, the proposed method requires ?(R(T)) bits, and it is capable of answering a count query in ?(R(P)) time, and reporting an occurrence in ?(lg |T|) time, where T and P are the text and the pattern string, respectively; for a string X, R(X) is the total time taken for the construction of the binary search tree by successively inserting the keys X[|X|-1],?,X[0] at the root, and its expected value is ?(|X|lg?) where ? is the alphabet size. Furthermore, the proposed method can be viewed as a generalization of some other methods including several heuristics and restricted versions described in previous studies in the literature

A Compact Index for Cartesian Tree Matching

Cartesian tree matching is a recently introduced string matching problem in which two strings match if their corresponding Cartesian trees are the same. It is considered appropriate to find patterns regarding their shapes especially in numerical time series data. While many related problems have been addressed, developing a compact index has received relatively less attention. In this paper, we present a 3n+o(n)-bit index that can count the number of occurrences of a Cartesian tree pattern in ?(m) time where n and m are the text and pattern length. To the best of our knowledge, this work is the first ?(n)-bit compact data structure for indexing for this problem

Indexing Isodirectional Pointer Sequences

Many sequential and temporal data have dependency relationships among their elements, which can be represented as a sequence of pointers. In this paper, we introduce a new string matching problem with a particular type of strings, which we call isodirectional pointer sequence, in which each entry has a pointer to another entry. The proposed problem is not only a formalization of real-world dependency matching problems, but also a generalization of variants of the string matching problem such as parameterized pattern matching and Cartesian tree matching. We present a 2nlg?+2n+o(n)-bit index that preprocesses the text T[1:n] so as to count the number of occurrences of pattern P[1:m] in ?(mlg?) where ? is the number of distinct lengths of pointers in T. Our index is also easily implementable in practice because it consists of wavelet trees and range maximum query index, which are widely used building blocks in many other compact data structures. By compressing the wavelet trees, the index can also be stored into 2nH^*?(T)+2n+o(n) bits where H^*?(T) is the 0-th order empirical entropy of the distribution of pointer lengths of T

Polymer-Based Delivery of Glucagon-Like Peptide-1 for the Treatment of Diabetes

The incretin hormones, glucagon-like peptide-1 (GLP-1) and its receptor agonist (exendin-4), are well known for glucose homeostasis, insulinotropic effect, and effects on weight loss and food intake. However, due to the rapid degradation of GLP-1 by dipeptidylpeptidase-IV (DPP-IV) enzyme and renal elimination of exendin-4, their clinical applications have been restricted. Although exendin-4 has longer half-life than GLP-1, it still requires frequent injections to maintain efficacy for the treatment of diabetes. In recent decades, various polymeric delivery systems have been developed for the delivery of GLP-1 and exendin-4 genes or peptides for their long-term action and the extra production in ectopic tissues. Herein, we discuss the modification of the expression cassettes and peptides for long-term production and secretion of the native peptides. In addition, the characteristics of nonviral or viral system used for a delivery of a modified GLP-1 or exendin-4 are described. Furthermore, recent efforts to improve the biological half-life of GLP-1 or exendin-4 peptide via chemical conjugation with various smart polymers via chemical conjugation compared with native peptide are discussed

Classification of Equivariant Complex Vector Bundles over a Circle

In this paper we characterize the fiber representations of equivariant complex vector bundles over a circle and classify these bundles. We also treat the triviality of equivariant complex vector bundles over a circle by investigating the extensions of representations. As a corollary of our results, we calculate the reduced equivariant K-group of a circle for any compact Lie group.Comment: 15 pages, AMS-LaTeX v1.