Looking Toward the “New Era” Features and Background of the Japan-Thailand Economic Partnership Agreement

This paper examines Thai-Japanese relations through analysis of EPA. There are two questions. The first involves the features of JTEPA as an EPA. By scrutinizing the features of the EPA, we would like to approach the institutional framework of the “new era” which will be brought about by JTEPA. The second question is how did the governments of Thailand and Japan come to conclude JTEPA? By reviewing the focal points of the negotiations, we will describe the background of the formation and aims of JTEPA. Finally, we conclude that JTEPA is a culmination of the existing Thai-Japanese relations, and was built based upon the existing divergence of economic institutions. At the same time it upgrades the bilateral partnership to a framework for multilateral cooperation by considering assistance toward Cambodia, Laos and Myanmar and Vietnam. The author would like to emphasize that JTEPA was designed based on the idea of a further integration of CLMV and Thailand, an original member of ASEAN.

Re-thinking Argentina's labour and social security reform in the 1990s : agreement on competitive corporatism

This paper will analyze the Menem administration's social policy reforms during the 1990s. Neo-liberal reforms in Argentina are well-known both in the economy and in the social arena, but in the latter we can discern the presence of tripartite negotiations. The form of such negotiations, the type of agreements reached as a result, and the background to those agreements will be discussed. We also pay attention to the concept of competitive corporatism, which was established under the increase in market competition brought about by globalization.

Measuring fixed costs for firms' use of a free trade agreement : threshold regression approach

In this paper, by employing the threshold regression method, we estimate the average tariff equivalent of fixed costs for the use of a free trade agreement (FTA) among all existing FTAs in the world. It is estimated to be 3.2%. This global estimate serves as a reference rate in the evaluation of each FTA’s fixed costs.

Selection and utilization of the early harvest list : evidence from the Free Trade Agreement between China and Taiwan

In this paper, we conducted an empirical investigation into the determinants of FTA utilization in exports from Taiwan to China. To do this, we first estimated the selection equation to see what kinds of products are included in the early harvest list. As a result, we found that Taiwan includes products with a medium magnitude of benefits from tariff removal in the early harvest list. Taiwan also includes products for which ASEAN countries have better access to the China market. We then estimated the equation for the determinants of FTA utilization by introducing an inverse of the Mills ratio estimated in the selection equation. The findings are that, as usual, the FTA rates are more likely to be utilized for products with a larger tariff margin. In addition, some rules of origin are found to be relatively restrictive in terms of discouraging trade.

Some practical guidance for the computation of free trade agreement utilization rates

The literature on the use of free trade agreements (FTAs) has recently been growing because it is becoming more important to encourage the use of current FTAs than to increase the number of FTAs. In this paper, we discuss some practical issues in the computation of FTA utilization rates, which provide a useful measure to discover how much FTA schemes are used in trade. For example, compared with the use of customs data on FTA utilization in imports, when using certificates of origin data on FTA utilization in exports, there are several points about which we should be careful. Our practical guidance on the computation of FTA utilization rates will be helpful when computing such rates and in examining the determinants of those rates empirically.

Distributed orientation agreement in a group of robots

In this article, a method for the agreement of a set of robots on a common reference orientation based on a distributed consensus algorithm is described. It only needs that robots detect the relative positions of their neighbors and communicate with them. Two different consensus algorithms based on the exchange of information are proposed, tested and analyzed. Systematic experiments were carried out in simulation and with real robots in order to test the method. Experimental results show that the robots are able to agree on the reference orientation under certain conditions. Scalability with an increasing number of robots was tested successfully in simulation with up to 49 robots. Experiments with real robots succeeded proving that the proposed method works in reality.

Distributed Orientation Agreement in a Group of Robots

In this article, a method for the agreement of a set of robots on a common reference orientation based on a distributed consensus algorithm is described. It only needs that robots detect the relative positions of their neighbors and communicate with them. Two different consensus algorithms based on the exchange of information are proposed, tested and analyzed. Systematic experiments were carried out in simulation and with real robots in order to test the method. Experimental results show that the robots are able to agree on the reference orientation under certain conditions. Scalability with an increasing number of robots was tested successfully in simulation with up to 49 robots. Experiments with real robots succeeded proving that the proposed method works in reality.

Agreement in wider environments with weaker assumptions.

The set agreement problem states that from n proposed values at most n?1 can be decided. Traditionally, this problem is solved using a failure detector in asynchronous systems where processes may crash but do not recover, where processes have different identities, and where all processes initially know the membership. In this paper we study the set agreement problem and the weakest failure detector L used to solve it in asynchronous message passing systems where processes may crash and recover, with homonyms (i.e., processes may have equal identities) and without a complete initial knowledge of the membership.

Set agreement and the loneliness failure detector in crash-recovery systems

The set agreement problem states that from n proposed values at most n-1 can be decided. Traditionally, this problem is solved using a failure detector in asynchronous systems where processes may crash but not recover, where processes have different identities, and where all processes initially know the membership. In this paper we study the set agreement problem and the weakest failure detector L used to solve it in asynchronous message passing systems where processes may crash and recover, with homonyms (i.e., processes may have equal identities) and without a complete initial knowledge of the membership.

Optimal safety incentives in road concession contracts

Changes in the roles of the government and the private sector in the provision of public services along with budget constraints are resulting in an increasing use of the concession approach for financing and managing roads. In the last few years, many of these contracts set up incentives linked to bonuses to encourage the concessionaire to render a better service to the users. Road safety is one the aspects on the basis of which concessionaires can be rewarded according to their performance. The goal of this paper is to evaluate whether road safety incentives are being defined in the right way nowadays in different European countries and also identify what incentives would need to be implemented to achieve a socially optimal road safety level. To that end, we develop a specific incentive for road concession contracts that encourages companies to achieve the optimal level. We apply this methodology to three case studies of concessions recently awarded in order to determine to what extend the incentives they set up are closer or farther to the optimum.

An information reconciliation protocol for secret-key agreement with small leakage

We report on a variant of the so-called Cascade protocol that is well-known for its usage as information reconciliation protocol in quantum cryptography. A theoretical analysis of the optimal size of the parity check blocks is provided. We obtain a very small leakage which is for block sizes of 2^16 typically only 2.5% above the Shannon limit, and notably, this holds for a QBER between 1% and 50%. For a QBER between 1% and 6% the leakage is only 2% above the Shannon limit. As comparison, the leakage of the original Cascade algorithm is 20% (40%) above the Shannon limit for a QBER of 10% (35%).

Agreement Abstractions in Anonymous and Homonymous Distributed Systems Prone to Failures

The distributed computing models typically assume every process in the system has a distinct identifier (ID) or each process is programmed differently, which is named as eponymous system. In such kind of distributed systems, the unique ID is helpful to solve problems: it can be incorporated into messages to make them trackable (i.e., to or from which process they are sent) to facilitate the message transmission; several problems (leader election, consensus, etc.) can be solved without the information of network property in priori if processes have unique IDs; messages in the register of one process will not be overwritten by others process if this process announces; it is useful to break the symmetry. Hence, eponymous systems have influenced the distributed computing community significantly either in theory or in practice. However, every thing in the world has its own two sides. The unique ID also has disadvantages: it can leak information of the network(size); processes in the system have no privacy; assign unique ID is costly in bulk-production(e.g, sensors). Hence, homonymous system is appeared. If some processes share the same ID and programmed identically is called homonymous system. Furthermore, if all processes shared the same ID or have no ID is named as anonymous system. In homonymous or anonymous distributed systems, the symmetry problem (i.e., how to distinguish messages sent from which process) is the main obstacle in the design of algorithms. This thesis is aimed to propose different symmetry break methods (e.g., random function, counting technique, etc.) to solve agreement problem. Agreement is a fundamental problem in distributed computing including a family of abstractions. In this thesis, we mainly focus on the design of consensus, set agreement, broadcast algorithms in anonymous and homonymous distributed systems. Firstly, the fault-tolerant broadcast abstraction is studied in anonymous systems with reliable or fair lossy communication channels separately. Two classes of anonymous failure detectors AΘ and AP∗ are proposed, and both of them together with a already proposed failure detector ψ are implemented and used to enrich the system model to implement broadcast abstraction. Then, in the study of the consensus abstraction, it is proved the AΩ′ failure detector class is strictly weaker than AΩ and AΩ′ is implementable. The first implementation of consensus in anonymous asynchronous distributed systems augmented with AΩ′ and where a majority of processes does not crash. Finally, a general consensus problem– k-set agreement is researched and the weakest failure detector L used to solve it, in asynchronous message passing systems where processes may crash and recover, with homonyms (i.e., processes may have equal identities), and without a complete initial knowledge of the membership.

Agreement Abstractions in Anonymous and Homonymous Distributed Systems Prone to Failures

The distributed computing models typically assume every process in the system has a distinct identifier (ID) or each process is programmed differently, which is named as eponymous system. In such kind of distributed systems, the unique ID is helpful to solve problems: it can be incorporated into messages to make them trackable (i.e., to or from which process they are sent) to facilitate the message transmission; several problems (leader election, consensus, etc.) can be solved without the information of network property in priori if processes have unique IDs; messages in the register of one process will not be overwritten by others process if this process announces; it is useful to break the symmetry. Hence, eponymous systems have influenced the distributed computing community significantly either in theory or in practice. However, every thing in the world has its own two sides. The unique ID also has disadvantages: it can leak information of the network(size); processes in the system have no privacy; assign unique ID is costly in bulk-production(e.g, sensors). Hence, homonymous system is appeared. If some processes share the same ID and programmed identically is called homonymous system. Furthermore, if all processes shared the same ID or have no ID is named as anonymous system. In homonymous or anonymous distributed systems, the symmetry problem (i.e., how to distinguish messages sent from which process) is the main obstacle in the design of algorithms. This thesis is aimed to propose different symmetry break methods (e.g., random function, counting technique, etc.) to solve agreement problem. Agreement is a fundamental problem in distributed computing including a family of abstractions. In this thesis, we mainly focus on the design of consensus, set agreement, broadcast algorithms in anonymous and homonymous distributed systems. Firstly, the fault-tolerant broadcast abstraction is studied in anonymous systems with reliable or fair lossy communication channels separately. Two classes of anonymous failure detectors AΘ and AP∗ are proposed, and both of them together with a already proposed failure detector ψ are implemented and used to enrich the system model to implement broadcast abstraction. Then, in the study of the consensus abstraction, it is proved the AΩ′ failure detector class is strictly weaker than AΩ and AΩ′ is implementable. The first implementation of consensus in anonymous asynchronous distributed systems augmented with AΩ′ and where a majority of processes does not crash. Finally, a general consensus problem– k-set agreement is researched and the weakest failure detector L used to solve it, in asynchronous message passing systems where processes may crash and recover, with homonyms (i.e., processes may have equal identities), and without a complete initial knowledge of the membership.

Lack of agreement between tonometric and gastric juice partial carbon dioxide tension

Our goal was to compare measurement of tonometered saline and gastric juice partial carbon dioxide tension (PCO2). In this prospective observational study, 112 pairs of measurements were simultaneously obtained under various hemodynamic conditions, in 15 critical care patients. Linear regression analysis showed a significant correlation between the two methods of measuring PCO2 (r 2 = 0.43; P < 0.0001). However, gastric juice PCO2 was systematically higher (mean difference 51 mmHg). The 95% limits of agreement were 315 mmHg and the dispersion increased as the values of PCO2 increased. Tonometric and gastric juice PCO2 cannot be used interchangeably. Gastric juice PCO2 measurement should be interpreted with caution.