Técnicas baseadas em etnografia e prototipagem no Design de interface de aplicativo mobile para gerenciamento acadêmico

Baseado na metodologia de design participativo, este artigo relata o processo de pesquisa e desenvolvimento de uma versão mobile de um sistema já existente para desktop e amplamente utilizado para o compartilhamento de informações acadêmicas em uma universidade federal do Brasil. A pesquisa foi realizada em duas etapas. Na ‘Etapa I’ foram realizados estudos baseados em etnografia envolvendo docentes e discentes: Grupo de Foco, Análise Contextual, Avaliação Heurística Participativa e Avaliação Cooperativa. Por meio dos resultados foi possível identificar funcionalidades e requisitos desejáveis, problemas de usabilidade de uma versão mobile já em processo inicial de desenvolvimento, bem como e elaboração de uma nova interface gráfica. Na ‘Etapa II’ foram avaliados modelos de interação por meio de protótipos especificamente projetados para testes no mecanismo de lançamento de frequência do sistema mobile que, em seguida, foram avaliados através de testes de usabilidade e questionário de satisfação do usuário.

Uma ferramenta didática para ajudar na fixação dos conceitos introdutórios de análise combinatória

Humans, as well as some animals are born gifted with the ability to perceive quantities. The needs that came from the evolution of societies and technological resources make the the optimization of such counting methods necessary. Although necessary and useful, there are a lot of diculties in the teaching of such methods.In order to broaden the range of available tools to teach Combinatorial Analysis, a owchart is presented in this work with the goal of helping the students to x the initial concepts of such subject via pratical exercises

O problema do caixeiro alugador com coleta de bonus: um estudo algoritmico

This paper introduces a new variant of the Traveling Car Renter Problem, named Prizecollecting Traveling Car Renter Problem. In this problem, a set of vertices, each associated with a bonus, and a set of vehicles are given. The objective is to determine a cycle that visits some vertices collecting, at least, a pre-defined bonus, and minimizing the cost of the tour that can be traveled with different vehicles. A mathematical formulation is presented and implemented in a solver to produce results for sixty-two instances. The proposed problem is also subject of an experimental study based on the algorithmic application of four metaheuristics representing the best adaptations of the state of the art of the heuristic programming.We also provide new local search operators which exploit the neighborhoods of the problem, construction procedures and adjustments, created specifically for the addressed problem. Comparative computational experiments and performance tests are performed on a sample of 80 instances, aiming to offer a competitive algorithm to the problem. We conclude that memetic algorithms, computational transgenetic and a hybrid evolutive algorithm are competitive in tests performed

The fish zonation of the Itanha,m river basin in the Atlantic Forest of southeast Brazil

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

A simple method for estimating global DNA methylation using bisulfite PCR of repetitive DNA elements

We report a method for studying global DNA methylation based on using bisulfite treatment of DNA and simultaneous PCR of multiple DNA repetitive elements, such as Alu elements and long interspersed nucleotide elements (LINE). The PCR product, which represents a pool of approximately 15000 genomic loci, could be used for direct sequencing, selective restriction digestion or pyrosequencing, in order to quantitate DNA methylation. By restriction digestion or pyrosequencing, the assay was reproducible with a standard deviation of only 2% between assays. Using this method we found that almost two-thirds of the CpG methylation sites in Alu elements are mutated, but of the remaining methylation target sites, 87% were methylated. Due to the heavy methylation of repetitive elements, this assay was especially useful in detecting decreases in DNA methylation, and this assay was validated by examining cell lines treated with the methylation inhibitor 5-aza-2'deoxycytidine (DAC), where we found a 1-16% decrease in Alu element and 18-60% LINE methylation within 3 days of treatment. This method can be used as a surrogate marker of genome-wide methylation changes. In addition, it is less labor intensive and requires less DNA than previous methods of assessing global DNA methylation.

Um novo método para quantificar mercúrio orgânico (Hg orgânico) empregando a espectrometria de fluorescência atômica do vapor frio

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

O problema de corte de estoque em indústrias de móveis de pequeno e médio portes

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Abordagens complementares para problemas de p-medianas

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Métodos de geração de colunas para problemas de atribuição

Este trabalho apresenta métodos de geração de colunas para dois importantes problemas de atribuição: o Problema Generalizado de Atribuição (PGA) e o Problema de Atribuição de Antenas a Comutadores (PAAC). O PGA é um dos mais representativos problemas de Otimização Combinatória e consiste em otimizar a atribuição de n tarefas a m agentes, de forma que cada tarefa seja atribuída a exatamente um agente e a capacidade de cada agente seja respeitada. O PAAC consiste em atribuir n antenas a m comutadores em uma rede de telefonia celular, de forma a minimizar os custos de cabeamento entre antenas e comutadores e os custos de transferência de chamadas entre comutadores. A abordagem tradicional de geração de colunas é comparada com as propostas neste trabalho, que utilizam a relaxação lagrangeana/surrogate. São apresentados testes computacionais que demonstram a efetividade dos algoritmos propostos.

Um modelo de otimização inteira mista e heurísticas relax and fix para a programação da produção de fábricas de refrigerantes de pequeno porte

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Um problema de programação da produção numa fundição automatizada

Este trabalho apresenta a modelagem de um problema particular de Programação da Produção numa Fundição Automatizada e sua resolução por um algoritmo de busca heurística, que explora a estrutura do problema.

Economic design of two-stage (X)over-bar charts: the Markov chain approach

When the (X) over bar chart is in use, samples are regularly taken from the process, and their means are plotted on the chart. In some cases, it is too expensive to obtain the X values, but not the values of a correlated variable Y. This paper presents a model for the economic design of a two-stage control chart, that is. a control chart based on both performance (X) and surrogate (Y) variables. The process is monitored by the surrogate variable until it signals an out-of-control behavior, and then a switch is made to the (X) over bar chart. The (X) over bar chart is built with central, warning. and action regions. If an X sample mean falls in the central region, the process surveillance returns to the (Y) over bar chart. Otherwise. The process remains under the (X) over bar chart's surveillance until an (X) over bar sample mean falls outside the control limits. The search for an assignable cause is undertaken when the performance variable signals an out-of-control behavior. In this way, the two variables, are used in an alternating fashion. The assumption of an exponential distribution to describe the length of time the process remains in control allows the application of the Markov chain approach for developing the cost function. A study is performed to examine the economic advantages of using performance and surrogate variables. (C) 2003 Elsevier B.V. All rights reserved.

A column generation approach to capacitated p-median problems

The Capacitated p-median problem (CPMP) seeks to solve the optimal location of p facilities, considering distances and capacities for the service to be given by each median. In this paper we present a column generation approach to CPMP. The identified restricted master problem optimizes the covering of 1-median clusters satisfying the capacity constraints, and new columns are generated considering knapsack subproblems. The Lagrangean/surrogate relaxation has been used recently to accelerate subgradient like methods. In this work the Lagrangean/surrogate relaxation is directly identified from the master problem dual and provides new bounds and new productive columns through a modified knapsack subproblem. The overall column generation process is accelerated, even when multiple pricing is observed. Computational tests are presented using instances taken from real data from Sao Jose dos Campos' city.

Modeling hourly diffuse solar-radiation in the city of São Paulo using a neural-network technique

dIn this work, a perceptron neural-network technique is applied to estimate hourly values of the diffuse solar-radiation at the surface in São Paulo City, Brazil, using as input the global solar-radiation and other meteorological parameters measured from 1998 to 2001. The neural-network verification was performed using the hourly measurements of diffuse solar-radiation obtained during the year 2002. The neural network was developed based on both feature determination and pattern selection techniques. It was found that the inclusion of the atmospheric long-wave radiation as input improves the neural-network performance. on the other hand traditional meteorological parameters, like air temperature and atmospheric pressure, are not as important as long-wave radiation which acts as a surrogate for cloud-cover information on the regional scale. An objective evaluation has shown that the diffuse solar-radiation is better reproduced by neural network synthetic series than by a correlation model. (C) 2004 Elsevier Ltd. All rights reserved.

Reappraisal of immunohistochemical profiling of special histological types of breast carcinomas: a study of 121 cases of eight different subtypes

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)