Non-Destructive Evaluation of Iowa Pavements Phase 2: Development of a Fully Automated Software System for Rapid Analysis/Processing of the Falling Weight Deflectometer Data, 2009

The Office of Special Investigations at Iowa Department of Transportation (DOT) collects FWD data on regular basis to evaluate pavement structural conditions. The primary objective of this study was to develop a fully-automated software system for rapid processing of the FWD data along with a user manual. The software system automatically reads the FWD raw data collected by the JILS-20 type FWD machine that Iowa DOT owns, processes and analyzes the collected data with the rapid prediction algorithms developed during the phase I study. This system smoothly integrates the FWD data analysis algorithms and the computer program being used to collect the pavement deflection data. This system can be used to assess pavement condition, estimate remaining pavement life, and eventually help assess pavement rehabilitation strategies by the Iowa DOT pavement management team. This report describes the developed software in detail and can also be used as a user-manual for conducting simulation studies and detailed analyses. *********************** Large File ***********************

Revisión: tecnologia de agentes de software

Los agentes de software en la era de las redes globales son una herramienta vital para superar el fenómeno llamado "sobrecarga de información". El grado de madurez alcanzado en esta tecnología permite que hoy se puedan ver aplicaciones concretas funcionado en organizaciones, como así también en el escritorio del usuario hogareño. El objetivo de este trabajo es presentar una revisión bibliográfica sobre la tecnología de agentes de software, con orientación a los modelos que permiten gerenciar la sobrecarga de información.

EADock: docking of small molecules into protein active sites with a multiobjective evolutionary optimization.

In recent years, protein-ligand docking has become a powerful tool for drug development. Although several approaches suitable for high throughput screening are available, there is a need for methods able to identify binding modes with high accuracy. This accuracy is essential to reliably compute the binding free energy of the ligand. Such methods are needed when the binding mode of lead compounds is not determined experimentally but is needed for structure-based lead optimization. We present here a new docking software, called EADock, that aims at this goal. It uses an hybrid evolutionary algorithm with two fitness functions, in combination with a sophisticated management of the diversity. EADock is interfaced with the CHARMM package for energy calculations and coordinate handling. A validation was carried out on 37 crystallized protein-ligand complexes featuring 11 different proteins. The search space was defined as a sphere of 15 A around the center of mass of the ligand position in the crystal structure, and on the contrary to other benchmarks, our algorithm was fed with optimized ligand positions up to 10 A root mean square deviation (RMSD) from the crystal structure, excluding the latter. This validation illustrates the efficiency of our sampling strategy, as correct binding modes, defined by a RMSD to the crystal structure lower than 2 A, were identified and ranked first for 68% of the complexes. The success rate increases to 78% when considering the five best ranked clusters, and 92% when all clusters present in the last generation are taken into account. Most failures could be explained by the presence of crystal contacts in the experimental structure. Finally, the ability of EADock to accurately predict binding modes on a real application was illustrated by the successful docking of the RGD cyclic pentapeptide on the alphaVbeta3 integrin, starting far away from the binding pocket.

Proposta de um método para escolha de software de automação de bibliotecas

Apresenta um método para avaliação e seleção de softwares de automação de bibliotecas. Consiste na atribuição de critérios e cálculos estatísticos em uma lista elaborada para a seleção e avaliação deste tipo de software. Este método pretender servir como instrumento de apoio à tomada de decisão no processo de escolha do software mais adequado às necessidades de cada instituição. Este trabalho foi motivado por uma demanda do Instituto Brasileiro de Informação em Ciência e Tecnologia (IBICT) para automatizar a sua biblioteca.

Tecnologias da informação e da comunicação e a polêmica sobre direito autoral: o caso Google Book Search

Anotamos, neste trabalho, reflexões sobre as conseqüências das Tecnologias da Informação e da Comunicação (TICs) para o direito autoral e sobre os atores do processo informativo. Partimos da lei do direito autoral vigente no Brasil, perguntando-nos como tais normas protegem as obras intelectuais no contexto digital e até que ponto há legalidade e legitimidade na digitalização de livros protegidos, disponibilizados on-line, tomando como exemplo o caso "Google Book Search". Constatamos que a lei atual pouco defende os direitos dos autores e dos leitores, pois se volta para a proteção dos interesses privados comerciais, e que a sociedade civil encontra formas de ampliar o fluxo comunicativo em decorrência da facilidade de reprodução e distribuição de cópias de obras intelectuais proporcionada pelas TICs.

Social reciprocity measures based on dyadic discrepancies: Methodological review and software development

This paper examines statistical analysis of social reciprocity at group, dyadic, and individual levels. Given that testing statistical hypotheses regarding social reciprocity can be also of interest, a statistical procedure based on Monte Carlo sampling has been developed and implemented in R in order to allow social researchers to describe groups and make statistical decisions.

Calculation of wood volume and stem taper using terrestrial single-image close-range photogrammetry and contemporary software tools

Abstract

Disseny i desenvolupament d'una aplicació Andriod "CercaJam"

El projecte vol desenvolupar un programari per Android destinat als usuaris que els interessin les jam sessions. El programa sera capaç de visualitzar les sales, cercar-les per nom o ciutat i afegir-ne una de nova. L'idea principal és que l'usuari pugui inscriure's, si queden places lliures, a la jam session de la sala. On també podrà ubicar-la, mitjançant l'API de Google Maps.

Line search multilevel optimization as computational methods for dense optical flow

We evaluate the performance of different optimization techniques developed in the context of optical flow computation with different variational models. In particular, based on truncated Newton methods (TN) that have been an effective approach for large-scale unconstrained optimization, we de- velop the use of efficient multilevel schemes for computing the optical flow. More precisely, we evaluate the performance of a standard unidirectional mul- tilevel algorithm - called multiresolution optimization (MR/OPT), to a bidrec- tional multilevel algorithm - called full multigrid optimization (FMG/OPT). The FMG/OPT algorithm treats the coarse grid correction as an optimiza- tion search direction and eventually scales it using a line search. Experimental results on different image sequences using four models of optical flow com- putation show that the FMG/OPT algorithm outperforms both the TN and MR/OPT algorithms in terms of the computational work and the quality of the optical flow estimation.

mGPT: a probabilistic planner based on heuristic search

We describe the version of the GPT planner to be used in the planning competition. This version, called mGPT, solves mdps specified in the ppddllanguage by extracting and using different classes of lower bounds, along with various heuristic-search algorithms. The lower bounds are extracted from deterministic relaxations of the mdp where alternativeprobabilistic effects of an action are mapped into different, independent, deterministic actions. The heuristic-search algorithms, on the other hand, use these lower bounds for focusing the updates and delivering a consistent value function over all states reachable from the initial state with the greedy policy.

A comparison of one- and two-compartment neighbourhoods in heuristic search with spatial forest management goals

Abstract