Efficient bulk-loading on dynamic metric access methods

This paper presents a new technique and two algorithms to bulk-load data into multi-way dynamic metric access methods, based on the covering radius of representative elements employed to organize data in hierarchical data structures. The proposed algorithms are sample-based, and they always build a valid and height-balanced tree. We compare the proposed algorithm with existing ones, showing the behavior to bulk-load data into the Slim-tree metric access method. After having identified the worst case of our first algorithm, we describe adequate counteractions in an elegant way creating the second algorithm. Experiments performed to evaluate their performance show that our bulk-loading methods build trees faster than the sequential insertion method regarding construction time, and that it also significantly improves search performance. (C) 2009 Elsevier B.V. All rights reserved.

A pointcut-based coverage analysis approach for aspect-oriented programs

Aspect-oriented programming (AOP) is a promising technology that supports separation of crosscutting concerns (i.e., functionality that tends to be tangled with, and scattered through the rest of the system). In AOP, a method-like construct named advice is applied to join points in the system through a special construct named pointcut. This mechanism supports the modularization of crosscutting behavior; however, since the added interactions are not explicit in the source code, it is hard to ensure their correctness. To tackle this problem, this paper presents a rigorous coverage analysis approach to ensure exercising the logic of each advice - statements, branches, and def-use pairs - at each affected join point. To make this analysis possible, a structural model based on Java bytecode - called PointCut-based Del-Use Graph (PCDU) - is proposed, along with three integration testing criteria. Theoretical, empirical, and exploratory studies involving 12 aspect-oriented programs and several fault examples present evidence of the feasibility and effectiveness of the proposed approach. (C) 2010 Elsevier Inc. All rights reserved.

Computer-aided Structure Elucidation of Neolignans

This paper describes a new module of the expert system SISTEMAT used for the prediction of the skeletons of neolignans by (13)C NMR, (1)H NMR and botanical data obtained from the literature. SISTEMAT is composed of MACRONO, SISCONST, C13MACH, H1MACH and SISOCBOT programs, each analyzing data of the neolignan in question to predict the carbon skeleton of the compound. From these results, the global probability is computed and the most probable skeleton predicted. SISTEMAT predicted the skeletons of 75% of the 20 neolignans tested, in a rapid and simple procedure demonstrating its advantage for the structural elucidation of new compounds.

Computer-Assisted Approach to Structural Elucidation of Lignans

This paper reports an expert system (SISTEMAT) developed for structural determination of diverse chemical classes of natural products, including lignans, based mainly on 13C NMR and 1H NMR data of these compounds. The system is composed of five programs that analyze specific data of a lignan and shows a skeleton probability for the compound. At the end of analyses, the results are grouped, the global probability is computed, and the most probable skeleton is exhibited to the user. SISTEMAT was able to properly predict the skeletons of 80% of the 30 lignans tested, demonstrating its advantage during the structural elucidation course in a short period of time.

The Use of On-Line Computer adaptive Testing to raise Standardized Test Scores

Nursing school graduates are under pressure to pass the RN-NCLEX Exam on the first attempt since New York State monitors the results and uses them to evaluate the school’s nursing programs. Since the RN-NCLEX Exam is a standardized test, we sought a method to make our students better test takers. The use of on-line computer adaptive testing has raised our student’s standardized test scores at the end of the nursing course.

Fred: An approach to generating real, correct, reusable programs from proofs

In this paper we describe our system for automatically extracting "correct" programs from proofs using a development of the Curry-Howard process. Although program extraction has been developed by many authors, our system has a number of novel features designed to make it very easy to use and as close as possible to ordinary mathematical terminology and practice. These features include 1. the use of Henkin's technique to reduce higher-order logic to many-sorted (first-order) logic; 2. the free use of new rules for induction subject to certain conditions; 3. the extensive use of previously programmed (total, recursive) functions; 4. the use of templates to make the reasoning much closer to normal mathematical proofs and 5. a conceptual distinction between the computational type theory (for representing programs)and the logical type theory (for reasoning about programs). As an example of our system we give a constructive proof of the well known theorem that every graph of even parity, which is non-trivial in the sense that it does not consist of isolated vertices, has a cycle. Given such a graph as input, the extracted program produces a cycle as promised.

Targeting the poor: a macroeconomic analysis of cash transfer programs

This paper introduces cash transfers targeting the poor in an incomplete markets model with heterogeneous agents facing idiosyncratic risk. These transfers change the degree of insurance in the economy and affect precautionary motives asymmetrically, leading the poorest households to decrease savings proportionally more than their richer counterparts. In a model economy calibrated to Brazil, once the cash transfer program is adopted, wealth inequality and social welfare increase, poverty decreases, while employment and income inequality remain about the same. Imperfect access to financial markets is important for these results, whereas whether the program is funded with lump sum or distortive taxes is not.

Temporary exchange rate-based stabilization programs under asset market segmentation

This paper analyses the welfare consequences of temporary exchange rate-based stabilization programs. Differently than previous papers, however, here we assume that only a fraction of households participates in asset market transactions. With this asset market segmentation assumption, the effects of temporary programs on welfare may change drastically. Households with access to the bonds market are able to protect themselves better from the changes in the inflation rate – although at the cost of a distortion in their consumption path. As a consequence, they may decrease their inflation tax burden – which would increase for the other group of households. By the other side, when these agents that lack the access to the asset markets are credit constrained, they may welcome the program, since the government Is temporally reducing the inflation tax they have to pay. The temporary program could end up benefiting both groups, what could help to understand their popularity.

Design and Analysis of Optical Interconnection Networks for a Dataflow Parallel Computer

This work shows the design, simulation, and analysis of two optical interconnection networks for a Dataflow parallel computer architecture. To verify the optical interconnection network performance on the Dataflow architecture, we have analyzed the load balancing among the processors during the parallel programs executions. The load balancing is a very important parameter because it is directly associated to the dataflow parallelism degree. This article proves that optical interconnection networks designed with simple optical devices can provide efficiently the dataflow requirements of a high performance communication system.

Comparative study of 2 software programs for predicting profile changes in Class III patients having double-jaw orthognathic surgery

Introduction: Computer software can be used to predict orthognathic surgery outcomes. The aim of this study was to subjectively compare the soft-tissue surgical simulations of 2 software programs. Methods: Standard profile pictures were taken of 10 patients with a Class III malocclusion and a concave facial profile who were scheduled for double-jaw orthognathic surgery. The patients had horizontal maxillary deficiency or horizontal mandibular excess. Two software programs (Dentofacial Planner Plus [Dentofacial Software, Toronto, Ontario, Canada] and Dolphin Imaging [version 9.0, Dolphin Imaging Software, Canoga Park, Calif]) were used to predict the postsurgical profiles. The predictive images were compared with the actual final photographs. One hundred one orthodontists, oral-maxillofacial surgeons, and general dentists evaluated the images and were asked whether they would use either software program to plan treatment for, or to educate, their patients. Results: Statistical analyses showed differences between the groups when each point was judged. Dolphin Imaging software had better prediction of nasal tip, chin, and submandibular area. Dentofacial Planner Plus software was better in predicting nasolabial angle, and upper and lower lips. The total profile comparison showed no statistical difference between the softwares. Conclusions: The 2 types of software are similar for obtaining 2-dimensional predictive profile images of patients with Class III malocclusion treated with orthognathic surgery. (Am J Orthod Dentofacial Orthop 2010; 137: 452.e1-452.e5)