The Trans-Pacific Partnership: Negotiations and Issues for Congress

[Excerpt] The Trans-Pacific Partnership (TPP) is a potential free trade agreement (FTA) among 11, and perhaps more, countries. The United States and 10 other countries of the Asia-Pacific region— Australia, Brunei, Canada, Chile, Malaysia, Mexico, New Zealand, Peru, Singapore, and Vietnam—are negotiating the text of the FTA. Canada and Mexico participated for the first time in the Auckland round of negotiations in December 2012, and Japan recently announced it would seek to participate in the negotiations. With 29 chapters under negotiation, the TPP partners envision the agreement to be “comprehensive and high-standard,” in that they seek to eliminate tariffs and non-tariff barriers to trade in goods, services, and agriculture, and to establish rules on a wide range of issues including foreign direct investment and other economic activities. They also strive to create a “21st-century agreement” that addresses new and cross-cutting issues presented by an increasingly globalized economy. The TPP draws congressional interest on a number of fronts. Congress would have to approve implementing legislation for U.S. commitments under the agreement to enter into force. In addition, under long-established executive-legislative practice, the Administration notifies and consults with congressional leaders, before, during, and after trade agreements have been negotiated. Furthermore, the TPP will likely affect a range of sectors and regions of the U.S. economy of direct interest to Members of Congress and could influence the shape and path of U.S. trade policy for the foreseeable future. This report examines the issues related to the proposed TPP, the state and substance of the negotiations (to the degree that the information is publically available), the specific areas under negotiation, the policy and economic contexts in which the TPP would fit, and the issues for Congress that the TPP presents. The report will be revised and updated as events warrant

Three photometric methods tested on ground-based data of Q 2237+0305

The Einstein Cross, Q~2237+0305, has been photometrically observed in four bands on two successive nights at NOT (La Palma, Spain) in October 1995. Three independent algorithms have been used to analyse the data: an automatic image decomposition technique, a CLEAN algorithm and the new MCS deconvolution code. The photometric and astrometric results obtained with the three methods are presented. No photometric variations were found in the four quasar images. Comparison of the photometry from the three techniques shows that both systematic and random errors affect each method. When the seeing is worse than 1.0", the errors from the automatic image decomposition technique and the Clean algorithm tend to be large (0.04-0.1 magnitudes) while the deconvolution code still gives accurate results (1{sigma} error below 0.04) even for frames with seeing as bad as 1.7". Reddening is observed in the quasar images and is found to be compatible with either extinction from the lensing galaxy or colour dependent microlensing. The photometric accuracy depends on the light distribution used to model the lensing galaxy. In particular, using a numerical galaxy model, as done with the MCS algorithm, makes the method less seeing dependent. Another advantage of using a numerical model is that eventual non-homogeneous structures in the galaxy can be modeled. Finally, we propose an observational strategy for a future photometric monitoring of the Einstein Cross.Comment: 9 pages, accepted for publication in A&

Depressive symptoms and quality of life in people with age-related macular degeneration

Purpose: To examine quality of life and associated factors in people with Age-Related Macular Degeneration (AMD). Methods: One hundred and forty-five AMD participants (mean age 78.0 +/- 7.7 years) and 104 age- and gender- matched controls (mean age 78.1 +/- 5.8 years) comprised the study populations for this case-control study. Depressive symptoms were measured with the Goldberg Anxiety and Depression (GAD) scale; general health and daily functioning was assessed with the Medical Outcomes Study Short Form 36 (SF-36) and questions relating to assistance required for daily living activities. Results: People with AMD performed more poorly than controls on the GAD depression scale, and physical functioning subscale of SF-36. 44.4% of people with AMD had clinically significant depressive symptoms compared to 17.5% of controls (p < 0.001). Multiple regression analysis revealed that AMD was independently associated with depressive symptoms and a path model indicated that AMD led to depressive symptoms both directly and indirectly via reduced general health and social functioning. Conclusion: Psychological and functional outcome measures are reduced in people with AMD. Earlier recognition and treatment of depressive symptoms in people with AMD may be crucial to maintaining quality of life in this group

Influence of coating on the thermal resistance of a Ni-Based superalloy

In this paper, the influence of M-CrAlY polycrystalline coating on the thermal fatigue behavior of a Nickel-base superalloy has been investigated. A special device using a rotating bending machine and two thermal sources has been used to perform thermo-mechanical tests. The two thermal sources have been set to obtain temperature variations between 750 and 1120 °C in the central part of the specimens, with a frequency of 0.1 Hz. The results showed a deleterious effect of the coating on the fatigue resistance. Numerical simulations have been carried out on SAMCEF to determine the thermo-mechanical field of the so-tested specimens. Calculated thermo-mechanical cycles of critical sites are associated with microstructure evolution and damage by cracking observed on the specimens. Damage mechanisms related to the presence of coating are discussed

A branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem

This paper presents a branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem (TWAVRP), the problem of assigning time windows for delivery before demand volume becomes known. A novel set of valid inequalities, the precedence inequalities, is introduced and multiple separation heuristics are presented. In our numerical experiments the branch-and-cut algorithm is 3.8 times faster when separating precedence inequalities. Furthermore, in our experiments, the branch-and-cut algorithm is 193.9 times faster than the best known algorithm in the literature. Finally, using our algorithm, instances of the TWAVRP are solved which are larger than the small scale instances previously presented in the literature

Bias and consistency in time delay estimation methods: case of the double quasar HE 1104-1805

We present a short re-evaluation of a recently published time delay estimate for the gravitational lens system HE 1104-1805 with emphasis on important methodological aspects: bias of the statistics, inconsistency of the methods and use of the purposeful selection of data points(or so-called "cleaning") at the preprocessing stage. We show how the inadequate use of simple analysis methods can lead to too strong conclusions. Our analysis shows that there are indications for the time delay in HE 1104-1805 to be between -0.9 and -0.7 years, but still with a large uncertainty.Comment: 5 pages, 5 figures, accepted as a Letter to the Editor in A&

The Time Window Assignment Vehicle Routing Problem

In many distribution networks, it is vital that time windows in which deliveries are made are assigned to customers for the long term. However, at the moment of assigning time windows demand is not known. In this paper we introduce the time window assignment vehicle routing problem, the TWAVRP. In this problem time windows have to be assigned before demand is known. Next the realization of demand is revealed and an optimal vehicle routing schedule has to be made that satisfies the time window constraints. We assume that different scenarios of demand realizations are known, as well as their probability distribution. The TWAVRP is the problem of assigning time windows such that the expected traveling costs are minimized. We propose a formulation of the TWAVRP and develop two variants of a column generation algorithm to solve the LP relaxation of this formulation. Numerical experiments show that these algorithms provide us with very tight LP-bounds to instances of moderate size in reasonable computation time. We incorporate the column generation algorithm in a branch and price algorithm and find optimal integer solutions to small instances of the TWAVRP. In our numerical experiments, the branch and price algorithm typically finds the optimal solution very early in the branching procedure and spends most time on proving optimality