Enhanced depth imaging optical coherence tomography of congenital cavitary optic disc anomaly (CODA).

AIM To report the finding of extension of the 4th hyper-reflective band and retinal tissue into the optic disc in patients with cavitary optic disc anomalies (CODAs). METHODS In this observational study, 10 patients (18 eyes) with sporadic or autosomal dominant CODA were evaluated with enhanced depth imaging optical coherence tomography (EDI-OCT) and colour fundus images for the presence of 4th hyper-reflective band extension into the optic disc. RESULTS Of 10 CODA patients (18 eyes), five patients (8 eyes) showed a definite 4th hyper-reflective band (presumed retinal pigment epithelium (RPE)) extension into the optic disc. In these five patients (seven eyes), the inner retinal layers also extended with the 4th hyper-reflective band into the optic disc. Best corrected visual acuity ranged from 20/20 to 20/200. In three patients (four eyes), retinal splitting/schisis was present and in two patients (two eyes), the macula was involved. In all cases, the 4th hyper-reflective band extended far beyond the termination of the choroid into the optic disc. The RPE extension was found either temporally or nasally in areas of optic nerve head excavation, most often adjacent to peripapillary pigment. Compared with eyes without RPE extension, eyes with RPE extension were more myopic (mean dioptres -0.9±2.6 vs -8.8±5, p=0.043). CONCLUSIONS The RPE usually stops near the optic nerve border separated by a border tissue. With CODA, extension of this hyper-reflective band and retinal tissue into the disc is possible and best evaluable using EDI-OCT or analogous image modalities. Whether this is a finding specific for CODA, linked to specific gene loci or is also seen in patients with other optic disc abnormalities needs further evaluation.

Firm dynamics in the Cambodian garment industry: firm turnover, productivity growth, and wage profile under trade liberalization

The international garment trade was liberalized in 2005 following the termination of the MFA (Multifibre Arrangement) and ever since then, price competition has intensified. Employing a unique firm dataset collected by the authors, this paper examines the changes in the performance of Cambodian garment firms between 2002/03 and 2008/09. During the period concerned, frequent firm turnover led to an improvement of the industry’s productivity, and the study found that the average total-factor productivity (TFP) of new entrants was substantially higher than that of exiting firms. Furthermore, we observed that thanks to productivity growth, an improvement in workers’ welfare, including a rise in the relative wages of the low-skilled, was taking place. These industrial dynamics differ considerably from those indicated by the “race to the bottom” argument as applied to labor-intensive industrialization in low income countries.

Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)

The technique of Abstract Interpretation has allowed the development of very sophisticated global program analyses which are at the same time provably correct and practical. We present in a tutorial fashion a novel program development framework which uses abstract interpretation as a fundamental tool. The framework uses modular, incremental abstract interpretation to obtain information about the program. This information is used to validate programs, to detect bugs with respect to partial specifications written using assertions (in the program itself and/or in system libraries), to generate and simplify run-time tests, and to perform high-level program transformations such as multiple abstract specialization, parallelization, and resource usage control, all in a provably correct way. In the case of validation and debugging, the assertions can refer to a variety of program points such as procedure entry, procedure exit, points within procedures, or global computations. The system can reason with much richer information than, for example, traditional types. This includes data structure shape (including pointer sharing), bounds on data structure sizes, and other operational variable instantiation properties, as well as procedure-level properties such as determinacy, termination, nonfailure, and bounds on resource consumption (time or space cost). CiaoPP, the preprocessor of the Ciao multi-paradigm programming system, which implements the described functionality, will be used to illustrate the fundamental ideas.

Structural Analysis of Thin Tile Vaults and Domes: The Inner Oval Dome of the Basilica de los Desamparados in Valencia

The inner oval dome of the Basílica de la Virgen los Desamparados, built in 1701, is one of the most slender masonry vaults ever built. It is a tile dome with a total thickness of 80 mm and a main span of 18.50 m. It was built without centering with great ingenuity and economy of means, thirty three years after the termination of the building in 1667. The dome is in contact with the external dome only in the inferior part with the projecting ribs of the intrados, the lunettes of the windows, and, in the upper part, through 126 inclined iron bars. This unique construction was revealed in the 1990's in the studies previous to the restoration of the Basílica, and has given rise to different theories about the mode of construction and the structural behaviour and safety of the dome. The present contribution aims to provide a plausible hypothesis about the mode of construction and to explain the safety of the inner dome which has stood, without need of repairs or reinforcement, for 300 hundred years.

Amplificador de potencia clase F a 1.64 ghz con control de armónicos

This paper presents a high-power high efficiency PA design method using load pull technique. Harmonic impedance control at the virtual drain is accomplished through the use of tunable pre-matching circuits and modeling of package parasitics. A 0.5 µm GaN high electron mobility transistor (HEMT) is characterized using the method, and loadpull measurements are simulated illustrating the impact of varying 2nd and 3rd harmonic termination. These harmonic terminations are added to satisfy conditions for class-F load pull. The method is verified by design and simulation of a 40-W class-F PA prototype at 1.64 GHz with 76% drain efficiency and 10 dB gain (70% PAE).

Efficient local unfolding with ancestor stacks

The most successful unfolding rules used nowadays in the partial evaluation of logic programs are based on well quasi orders (wqo) applied over (covering) ancestors, i.e., a subsequence of the atoms selected during a derivation. Ancestor (sub)sequences are used to increase the specialization power of unfolding while still guaranteeing termination and also to reduce the number of atoms for which the wqo has to be checked. Unfortunately, maintaining the structure of the ancestor relation during unfolding introduces significant overhead. We propose an efficient, practical local unfolding rule based on the notion of covering ancestors which can be used in combination with a wqo and allows a stack-based implementation without losing any opportunities for specialization. Using our technique, certain non-leftmost unfoldings are allowed as long as local unfolding is performed, i.e., we cover depth-first strategies. To deal with practical programs, we propose assertion-based techniques which allow our approach to treat programs that include (Prolog) built-ins and external predicates in a very extensible manner, for the case of leftmost unfolding. Finally, we report on our mplementation of these techniques embedded in a practical partial evaluator, which shows that our techniques, in addition to dealing with practical programs, are also significantly more efficient in time and somewhat more efficient in memory than traditional tree-based implementations. To appear in Theory and Practice of Logic Programming (TPLP).

CLP Projection for Constraint Handling Rules

This paper introduces and studies the notion of CLP projection for Constraint Handling Rules (CHR). The CLP projection consists of a naive translation of CHR programs into Constraint Logic Programs (CLP). We show that the CLP projection provides a safe operational and declarative approximation for CHR programs. We demónstrate moreover that a confluent CHR program has a least model, which is precisely equal to the least model of its CLP projection (closing henee a ten year-old conjecture by Abdenader et al.). Finally, we illustrate how the notion of CLP projection can be used in practice to apply CLP analyzers to CHR. In particular, we show results from applying AProVE to prove termination, and CiaoPP to infer both complexity upper bounds and types for CHR programs.

Program development using abstract interpretation (and the ciao system preprocessor)

The technique of Abstract Interpretation has allowed the development of very sophisticated global program analyses which are at the same time provably correct and practical. We present in a tutorial fashion a novel program development framework which uses abstract interpretation as a fundamental tool. The framework uses modular, incremental abstract interpretation to obtain information about the program. This information is used to validate programs, to detect bugs with respect to partial specifications written using assertions (in the program itself and/or in system librarles), to genérate and simplify run-time tests, and to perform high-level program transformations such as múltiple abstract specialization, parallelization, and resource usage control, all in a provably correct way. In the case of validation and debugging, the assertions can refer to a variety of program points such as procedure entry, procedure exit, points within procedures, or global computations. The system can reason with much richer information than, for example, traditional types. This includes data structure shape (including pointer sharing), bounds on data structure sizes, and other operational variable instantiation properties, as well as procedure-level properties such as determinacy, termination, non-failure, and bounds on resource consumption (time or space cost). CiaoPP, the preprocessor of the Ciao multi-paradigm programming system, which implements the described functionality, will be used to illustrate the fundamental ideas.

A program transformation for continuation call-based tabled execution

The advantages of tabled evaluation regarding program termination and reduction of complexity are well known —as are the significant implementation, portability, and maintenance efforts that some proposals (especially those based on suspensión) require. This implementation effort is reduced by program transformation-based continuation cali techniques, at some eñrciency cost. However, the traditional formulation of this proposal by Ramesh and Cheng limits the interleaving of tabled and non-tabled predicates and thus cannot be used as-is for arbitrary programs. In this paper we present a complete translation for the continuation cali technique which, using the runtime support needed for the traditional proposal, solves these problems and makes it possible to execute arbitrary tabled programs. We present performance results which show that CCall offers a useful tradeoff that can be competitive with state-of-the-art implementations.