Ki-67 expression in non-tumour epithelium adjacent to oral cancer as risk marker for multiple oral tumours

Objective: The aim of this study was to determine whether the differential assessment of epithelial proliferation is useful to diagnose premalignant fields and assess the risk of multiple tumours. Material and methods: We analysed 83 oral carcinomas with associated non-tumour epithelium classified as distant or close according to its distance (> or < 1 cm) from the invasion point, and as squamous hyperplasia, mild, moderate, severe dysplasia or carcinoma in situ. Twenty-five healthy oral mucosa samples were used as controls. An immunohistochemical technique was applied using Mib-1. Ki-67 in premalignant epithelium was assessed in basal layer, parabasal layer, medium and upper third. Results: Parabasal expression was significantly higher or showed a tendency to be higher in close and distant epithelia with any histological grade than in the controls. Parabasal Ki-67 significantly differed between distant epithelia associated with multiple vs single tumours (P < 0.001) and between distant epithelia associated with multiple tumours vs controls (P < 0.001). This difference was not observed between distant epithelia associated with single tumours and controls (P = 0.175). The cut-off point that differentiated epithelia associated with multiple tumours was > 50% of Ki-67 + parabasal cells in distant epithelia, which yielded 0.88 sensitivity and 0.79 specificity. Conclusions: The concept of a precancerous field may be linked to an increase in the proliferative activity of parabasal cells.

Extensive multiple test centre evaluation of the VecTest malaria antigen panel assay

To determine which species and populations of Anopheles transmit malaria in any given situation, immunological assays for malaria sporozoite antigen can replace traditional microscopical examination of freshly dissected Anopheles. We developed a wicking assay for use with mosquitoes that identifies the presence or absence of specific peptide epitopes of circumsporozoite (CS) protein of Plasmodium falciparum and two strains of Plasmodium vivax (variants 210 and 247). The resulting assay (VecTest(TM) Malaria) is a rapid, one-step procedure using a 'dipstick' test strip capable of detecting and distinguishing between P. falciparum and P. vivax infections in mosquitoes. The objective of the present study was to test the efficacy, sensitivity, stability and field-user acceptability of this wicking dipstick assay. In collaboration with 16 test centres world-wide, we evaluated more than 40 000 units of this assay, comparing it to the standard CS ELISA. The 'VecTest(TM) Malaria' was found to show 92% sensitivity and 98.1% specificity, with 97.8% accuracy overall. In accelerated storage tests, the dipsticks remained stable for >15 weeks in dry conditions up to 45degreesC and in humid conditions up to 37degreesC. Evidently, this quick and easy dipstick test performs at an acceptable level of reliability and offers practical advantages for field workers needing to make rapid surveys of malaria vectors.

Multiple centroid method to evaluate the adaptability of alfalfa genotypes

This study aimed to evaluate the efficiency of multiple centroids to study the adaptability of alfalfa genotypes (Medicago sativa L.). In this method, the genotypes are compared with ideotypes defined by the bissegmented regression model, according to the researcher's interest. Thus, genotype classification is carried out as determined by the objective of the researcher and the proposed recommendation strategy. Despite the great potential of the method, it needs to be evaluated under the biological context (with real data). In this context, we used data on the evaluation of dry matter production of 92 alfalfa cultivars, with 20 cuttings, from an experiment in randomized blocks with two repetitions carried out from November 2004 to June 2006. The multiple centroid method proved efficient for classifying alfalfa genotypes. Moreover, it showed no unambiguous indications and provided that ideotypes were defined according to the researcher's interest, facilitating data interpretation.

The importance of quality of life in patients with multiple sclerosis: do they need auxiliary walking devices?

Objective: To describe the importance of training multiple sclerosis (MS) patients with auxiliary walking devices (walking stick, crutch, or wheelchair) in a way that achieves a better quality of life (QOL). Design: Exploratory and descriptive. Setting: General hospital in Portugal.

Multiple-choice tests: a tool in assessing knowledge

The purpose of this paper is to analyse if Multiple-Choice Tests may be considered an interesting alternative for assessing knowledge, particularly in the Mathematics area, as opposed to the traditional methods, such as open questions exams. In this sense we illustrate some opinions of the researchers in this area. Often the perception of the people about the construction of this kind of exams is that they are easy to create. But it is not true! Construct well written tests it’s a hard work and needs writing ability from the teachers. Our proposal is analyse the construction difficulties of multiple - choice tests as well some advantages and limitations of this type of tests. We also show the frequent critics and worries, since the beginning of this objective format usage. Finally in this context some examples of Multiple-Choice Items in the Mathematics area are given, and we illustrate as how we can take advantage and improve this kind of tests.

Nano-CF: a Coordination Framework for macro-programming in wireless sensor networks

Wireless Sensor Networks (WSN) are being used for a number of applications involving infrastructure monitoring, building energy monitoring and industrial sensing. The difficulty of programming individual sensor nodes and the associated overhead have encouraged researchers to design macro-programming systems which can help program the network as a whole or as a combination of subnets. Most of the current macro-programming schemes do not support multiple users seamlessly deploying diverse applications on the same shared sensor network. As WSNs are becoming more common, it is important to provide such support, since it enables higher-level optimizations such as code reuse, energy savings, and traffic reduction. In this paper, we propose a macro-programming framework called Nano-CF, which, in addition to supporting in-network programming, allows multiple applications written by different programmers to be executed simultaneously on a sensor networking infrastructure. This framework enables the use of a common sensing infrastructure for a number of applications without the users having to worrying about the applications already deployed on the network. The framework also supports timing constraints and resource reservations using the Nano-RK operating system. Nano- CF is efficient at improving WSN performance by (a) combining multiple user programs, (b) aggregating packets for data delivery, and (c) satisfying timing and energy specifications using Rate- Harmonized Scheduling. Using representative applications, we demonstrate that Nano-CF achieves 90% reduction in Source Lines-of-Code (SLoC) and 50% energy savings from aggregated data delivery.

A parallel programming model for ada

Over the last three decades, computer architects have been able to achieve an increase in performance for single processors by, e.g., increasing clock speed, introducing cache memories and using instruction level parallelism. However, because of power consumption and heat dissipation constraints, this trend is going to cease. In recent times, hardware engineers have instead moved to new chip architectures with multiple processor cores on a single chip. With multi-core processors, applications can complete more total work than with one core alone. To take advantage of multi-core processors, parallel programming models are proposed as promising solutions for more effectively using multi-core processors. This paper discusses some of the existent models and frameworks for parallel programming, leading to outline a draft parallel programming model for Ada.

A multi-objective approach for the motion planning of redundant manipulators

Kinematic redundancy occurs when a manipulator possesses more degrees of freedom than those required to execute a given task. Several kinematic techniques for redundant manipulators control the gripper through the pseudo-inverse of the Jacobian, but lead to a kind of chaotic inner motion with unpredictable arm configurations. Such algorithms are not easy to adapt to optimization schemes and, moreover, often there are multiple optimization objectives that can conflict between them. Unlike single optimization, where one attempts to find the best solution, in multi-objective optimization there is no single solution that is optimum with respect to all indices. Therefore, trajectory planning of redundant robots remains an important area of research and more efficient optimization algorithms are needed. This paper presents a new technique to solve the inverse kinematics of redundant manipulators, using a multi-objective genetic algorithm. This scheme combines the closed-loop pseudo-inverse method with a multi-objective genetic algorithm to control the joint positions. Simulations for manipulators with three or four rotational joints, considering the optimization of two objectives in a workspace without and with obstacles are developed. The results reveal that it is possible to choose several solutions from the Pareto optimal front according to the importance of each individual objective.

A framework for programming sensor networks with scheduling and resource-sharing optimizations

Several projects in the recent past have aimed at promoting Wireless Sensor Networks as an infrastructure technology, where several independent users can submit applications that execute concurrently across the network. Concurrent multiple applications cause significant energy-usage overhead on sensor nodes, that cannot be eliminated by traditional schemes optimized for single-application scenarios. In this paper, we outline two main optimization techniques for reducing power consumption across applications. First, we describe a compiler based approach that identifies redundant sensing requests across applications and eliminates those. Second, we cluster the radio transmissions together by concatenating packets from independent applications based on Rate-Harmonized Scheduling.

Direct search optimization application programming interface with remote access

Search Optimization methods are needed to solve optimization problems where the objective function and/or constraints functions might be non differentiable, non convex or might not be possible to determine its analytical expressions either due to its complexity or its cost (monetary, computational, time,...). Many optimization problems in engineering and other fields have these characteristics, because functions values can result from experimental or simulation processes, can be modelled by functions with complex expressions or by noise functions and it is impossible or very difficult to calculate their derivatives. Direct Search Optimization methods only use function values and do not need any derivatives or approximations of them. In this work we present a Java API that including several methods and algorithms, that do not use derivatives, to solve constrained and unconstrained optimization problems. Traditional API access, by installing it on the developer and/or user computer, and remote API access to it, using Web Services, are also presented. Remote access to the API has the advantage of always allow the access to the latest version of the API. For users that simply want to have a tool to solve Nonlinear Optimization Problems and do not want to integrate these methods in applications, also two applications were developed. One is a standalone Java application and the other a Web-based application, both using the developed API.

A Java expression evaluator for nonlinear programming

Finding the optimal value for a problem is usual in many areas of knowledge where in many cases it is needed to solve Nonlinear Optimization Problems. For some of those problems it is not possible to determine the expression for its objective function and/or its constraints, they are the result of experimental procedures, might be non-smooth, among other reasons. To solve such problems it was implemented an API contained methods to solve both constrained and unconstrained problems. This API was developed to be used either locally on the computer where the application is being executed or remotely on a server. To obtain the maximum flexibility both from the programmers’ and users’ points of view, problems can be defined as a Java class (because this API was developed in Java) or as a simple text input that is sent to the API. For this last one to be possible it was also implemented on the API an expression evaluator. One of the drawbacks of this expression evaluator is that it is slower than the Java native code. In this paper it is presented a solution that combines both options: the problem can be expressed at run-time as a string of chars that are converted to Java code, compiled and loaded dynamically. To wide the target audience of the API, this new expression evaluator is also compatible with the AMPL format.

Web-based application programming interface to solve nonlinear optimization problems

Nonlinear Optimization Problems are usual in many engineering fields. Due to its characteristics the objective function of some problems might not be differentiable or its derivatives have complex expressions. There are even cases where an analytical expression of the objective function might not be possible to determine either due to its complexity or its cost (monetary, computational, time, ...). In these cases Nonlinear Optimization methods must be used. An API, including several methods and algorithms to solve constrained and unconstrained optimization problems was implemented. This API can be accessed not only as traditionally, by installing it on the developer and/or user computer, but it can also be accessed remotely using Web Services. As long as there is a network connection to the server where the API is installed, applications always access to the latest API version. Also an Web-based application, using the proposed API, was developed. This application is to be used by users that do not want to integrate methods in applications, and simply want to have a tool to solve Nonlinear Optimization Problems.

Multiple skin neoplasms in subjects under 40 years of age in Goiania, Brazil

OBJECTIVE To describe the trend for malignant skin neoplasms in subjects under 40 years of age in a region with high ultraviolet radiation indices.METHODS A descriptive epidemiological study on melanoma and nonmelanoma skin cancers that was conducted in Goiania, Midwest Brazil, with 1,688 people under 40 years of age, between 1988 and 2009. Cases were obtained fromRegistro de Câncer de Base Populacional de Goiânia(Goiania’s Population-Based Cancer File). Frequency, trends, and incidence of cases with single and multiple lesions were analyzed; transplants and genetic skin diseases were found in cases with multiple lesions.RESULTS Over the period, 1,995 skin cancer cases were observed to found, of which 1,524 (90.3%) cases had single lesions and 164 (9.7%) had multiple lesions. Regarding single lesions, incidence on men was observed to have risen from 2.4 to 3.1/100,000 inhabitants; it differed significantly for women, shifting from 2.3 to 5.3/100,000 (Annual percentage change – [APC] 3.0%, p = 0.006). Regarding multiple lesions, incidence on men was observed to have risen from 0.30 to 0.98/100,000 inhabitants; for women, it rose from 0.43 to 1.16/100,000 (APC 8.6%, p = 0.003). Genetic skin diseases or transplants were found to have been correlated with 10.0% of cases with multiple lesions – an average of 5.1 lesions per patient. The average was 2.5 in cases without that correlation.CONCLUSIONS Skin cancer on women under 40 years of age has been observed to be increasing for both cases with single and multiple lesions. It is not unusual to find multiple tumors in young people – in most cases, they are not associated with genetic skin diseases or transplants. It is necessary to avoid excessive exposure to ultraviolet radiation from childhood.

Modelling an e-learning environment for learning programming languages

It is widely accepted that solving programming exercises is fundamental to learn how to program. Nevertheless, solving exercises is only effective if students receive an assessment on their work. An exercise solved wrong will consolidate a false belief, and without feedback many students will not be able to overcome their difficulties. However, creating, managing and accessing a large number of exercises, covering all the points in the curricula of a programming course, in classes with large number of students, can be a daunting task without the appropriated tools working in unison. This involves a diversity of tools, from the environments where programs are coded, to automatic program evaluators providing feedback on the attempts of students, passing through the authoring, management and sequencing of programming exercises as learning objects. We believe that the integration of these tools will have a great impact in acquiring programming skills. Our research objective is to manage and coordinate a network of eLearning systems where students can solve computer programming exercises. Networks of this kind include systems such as learning management systems (LMS), evaluation engines (EE), learning objects repositories (LOR) and exercise resolution environments (ERE). Our strategy to achieve the interoperability among these tools is based on a shared definition of programming exercise as a Learning Object (LO).

PETCHA: a Programming Exercises Teaching Assistant

This paper presents a tool called Petcha that acts as an automated Teaching Assistant in computer programming courses. The ultimate objective of Petcha is to increase the number of programming exercises effectively solved by students. Petcha meets this objective by helping both teachers to author programming exercises and students to solve them. It also coordinates a network of heterogeneous systems, integrating automatic program evaluators, learning management systems, learning object repositories and integrated programming environments. This paper presents the concept and the design of Petcha and sets this tool in a service oriented architecture for managing learning processes based on the automatic evaluation of programming exercises. The paper presents also a case study that validates the use of Petcha and of the proposed architecture.