Services PTAs: Lessons from Practice

Presentation given by Pierre Sauvé at the international conference on the political economy of liberalising trade in services at the Hebrew University in Jerusalem

Patent policy and public health in developing countries: lessons from Japan

The introduction of pharmaceutical product patents in India and other developing countries is expected to have a significant effect on public health and local pharmaceutical industries. This paper draws implications from the historical experience of Japan when it introduced product patents in 1976. In Japan, narrow patents and promotion of cross-licensing were effective tools to keep drug prices in check while ensuring the introduction of new drugs. While the global pharmaceutical market surrounding India today differs considerably from that of the 1970's, the Japanese experience offers a policy option that may profitably be considered by India today. The Indian patent system emphasizes the patentability requirement in contrast to the Japanese patent policy which relied on narrow patents and extensive licensing. R&D by local firms and the development of local products may be promoted more effectively under the Japanese model.

The misconception of political lessons : how UMNO perceives the fall of LDP in Japan

2012 marks the thirtieth anniversary of Malaysia’s Look East Policy (LEP). This article argues that the strong relationship between Malaysia and Japan is stimulated by symbiotic ties binding together both countries’ respective major political parties, viz. the United Malays National Organisation (UMNO) and the Liberal Democratic Party (LDP). UMNO, especially under the leadership of Prime Minister Mahathir Mohamad (1981-2003), derived political lessons from developments affecting LDP in Japan. Two forms of lessons may be discerned. First, emulation of Japan’s success in economic development, which become the basis of LEP launched in 1981. Second, on which our article focuses, lessons from the failure of LDP to retain power twice in 1993 and 2009. Since 1993, DP’s defeat has been a poignant reminder for UMNO to be in alert mode in facing any electoral possibility. When LDP was again ousted from power in 2009, UMNO was a most psychologically affected party owing to the unprecedented setback it suffered at Malaysia’s Twelfth General Elections (GE) of 2008. Yet, although LDP’s reversal of fortunes served as a landmark for UMNO in situating changes to its trajectory since 1999, the analogical reasoning and political lessons applied by UMNO leaders were, to a large extent, flawed. Arguably, politicians frequently do misjudge in analogising between different situations which at a glance seem to be comparable.

Parallel execution of Prolog programs: a survey

Since the early days of logic programming, researchers in the field realized the potential for exploitation of parallelism present in the execution of logic programs. Their high-level nature, the presence of nondeterminism, and their referential transparency, among other characteristics, make logic programs interesting candidates for obtaining speedups through parallel execution. At the same time, the fact that the typical applications of logic programming frequently involve irregular computations, make heavy use of dynamic data structures with logical variables, and involve search and speculation, makes the techniques used in the corresponding parallelizing compilers and run-time systems potentially interesting even outside the field. The objective of this article is to provide a comprehensive survey of the issues arising in parallel execution of logic programming languages along with the most relevant approaches explored to date in the field. Focus is mostly given to the challenges emerging from the parallel execution of Prolog programs. The article describes the major techniques used for shared memory implementation of Or-parallelism, And-parallelism, and combinations of the two. We also explore some related issues, such as memory management, compile-time analysis, and execution visualization.

Multidisciplinary Learning, Another way of Teaching Maths in Engineering

Multidisciplinary training is widely appreciated in industry and business, and nevertheless usually is not addressed in the early stages of most undergraduate programs. We outline here a multidisciplinary course for undergraduates studying engineering in which mathematics would be the common language, the transverse tool. The goal is motivating students to learn more mathematics and as a result, improve the quality of engineering education. The course would be structured around projects in four branches in engineering: mechanical, electrical, civil and bio-tech. The projects would be chosen among a wide variety of topics in engineering practice selected with the guidance of professional engineers. In these projects mathematics should interact with at least two other basic areas of knowledge in engineering: chemistry, computers science, economics, design or physics.

Cooperative Task Execution between Modular Robots Based on Tight-Loose Cooperation Strategies

The complexity in the execution of cooperative tasks is high due to the fact that a robot team requires movement coordination at the beginning of the mission and continuous coordination during the execution of the task. A variety of techniques have been proposed to give a solution to this problem assuming standard mobile robots. This work focuses on presenting the execution of a cooperative task by a modular robot team. The complexity of the task execution increases due to the fact that each robot is composed of modules which have to be coordinated in a proper way to successfully work. A combined tight and loose cooperation strategy is presented and a bar-pushing example is used as a cooperative task to show the performance of this type of system.

Refining predictions of iberian plant distribution: lessons from p. nigra and p. sylvestris palaeoecological-based habitat suitability models

In recent years, challenged by the climate scenarios put forward by the IPCC and its potential impact on plant distribution, numerous predictive techniques -including the so called habitat suitability models (HSM)- have been developed. Yet, as the output of the different methods produces different distribution areas, developing validation tools are strong needs to reduce uncertainties. Focused in the Iberian Peninsula, we propose a palaeo-based method to increase the robustness of the HSM, by developing an ecological approach to understand the mismatches between the palaeoecological information and the projections of the HSMs. Here, we present the result of (1) investigating causal relationships between environmental variables and presence of Pinus sylvestris L. and P. nigra Arn. available from the 3rd Spanish Forest Inventory, (2) developing present and past presence-predictions through the MaxEnt model for 6 and 21 kyr BP, and (3) assessing these models through comparisons with biomized palaeoecological data available from the European Pollen Database for the Iberian Peninsula.

The state of semantic technology today - overview of the first SEALS evaluation campaigns

This paper describes the first five SEALS Evaluation Campaigns over the semantic technologies covered by the SEALS project (ontology engineering tools, ontology reasoning tools, ontology matching tools, semantic search tools, and semantic web service tools). It presents the evaluations and test data used in these campaigns and the tools that participated in them along with a comparative analysis of their results. It also presents some lessons learnt after the execution of the evaluation campaigns and draws some final conclusions.

Concept of project: learning lessons

The concept of Project encompasses a semantic disparity that involves all areas of professional and nonprofessional activity. In the engineering projects domain, and starting by the etymological roots of the terms, a review of the definitions given by different authors and their relation with sociological trends of the last decades is carried out. The engineering projects began as a tool for the development of technological ideas and have been improved with legal, economic and management parameters and recently with environmental aspects. However, the engineering projects involve people, groups, agents, organizations, companies and institutions. Nowadays, the social implications of projects are taken into consideration but the technology for social integration is not consolidated. This communication provides a new framework based on the experience for the development of engineering projects in the context of "human development", placing people in the center of the project

FPGA Acceleration of Monte Carlo-based Financial Simulation: Design Challenges and Lessons Learnt

The simulation of interest rate derivatives is a powerful tool to face the current market fluctuations. However, the complexity of the financial models and the way they are processed require exorbitant computation times, what is in clear conflict with the need of a processing time as short as possible to operate in the financial market. To shorten the computation time of financial derivatives the use of hardware accelerators becomes a must.

Towards execution time estimation in abstract machine-based languages

Abstract machines provide a certain separation between platformdependent and platform-independent concerns in compilation. Many of the differences between architectures are encapsulated in the speciflc abstract machine implementation and the bytecode is left largely architecture independent. Taking advantage of this fact, we present a framework for estimating upper and lower bounds on the execution times of logic programs running on a bytecode-based abstract machine. Our approach includes a one-time, programindependent proflling stage which calculates constants or functions bounding the execution time of each abstract machine instruction. Then, a compile-time cost estimation phase, using the instruction timing information, infers expressions giving platform-dependent upper and lower bounds on actual execution time as functions of input data sizes for each program. Working at the abstract machine level makes it possible to take into account low-level issues in new architectures and platforms by just reexecuting the calibration stage instead of having to tailor the analysis for each architecture and platform. Applications of such predicted execution times include debugging/veriflcation of time properties, certiflcation of time properties in mobile code, granularity control in parallel/distributed computing, and resource-oriented specialization.

Combining static analysis and profiling for estimating execution times

Effective static analyses have been proposed which infer bounds on the number of resolutions. These have the advantage of being independent from the platform on which the programs are executed and have been shown to be useful in a number of applications, such as granularity control in parallel execution. On the other hand, in distributed computation scenarios where platforms with different capabilities come into play, it is necessary to express costs in metrics that include the characteristics of the platform. In particular, it is specially interesting to be able to infer upper and lower bounds on actual execution times. With this objective in mind, we propose an approach which combines compile-time analysis for cost bounds with a one-time profiling of a given platform in order to determine the valúes of certain parameters for that platform. These parameters calibrate a cost model which, from then on, is able to compute statically time bound functions for procedures and to predict with a significant degree of accuracy the execution times of such procedures in that concrete platform. The approach has been implemented and integrated in the CiaoPP system.

Using combined static analysis and profiling for logic program execution time estimation

Predicting statically the running time of programs has many applications ranging from task scheduling in parallel execution to proving the ability of a program to meet strict time constraints. A starting point in order to attack this problem is to infer the computational complexity of such programs (or fragments thereof). This is one of the reasons why the development of static analysis techniques for inferring cost-related properties of programs (usually upper and/or lower bounds of actual costs) has received considerable attention.

Flexible scheduling for non-deterministic, and-parallel execution of logic programs

Abstract is not available.