Road Profile Adjustment Computer Program, HR-143, 1969

A computer program to adjust roadway profiles has been developed to serve as an aid to the county engineers of the State of Iowa. Many hours are spent reducing field notes and calculating adjusted roadway profiles to prepare an existing roadway for paving that will produce a high quality ride and be as maintenance free as possible. Since the computer is very well adapted to performing long tedious tasks; programming this work for a computer would result in freeing the engineer of these tasks. Freed from manual calculations, the engineer is able to spend more time in solving engineering problems. The type of roadway that this computer program is designed to adjust is a road that at sometime. in its history was graded to a finished subgrade. After a period of time, this road is to receive a finished paved surface. The problem then arises whether to bring the existing roadway up to the de signed grade or to make profile adjustments and comprise between the existing and the design profiles. In order to achieve the latter condition using this program, the engineer needs to give the computer only a minimum amount of information.

Disseny i implementació d'una base de dades relacional per a la gestió d'un videojoc

El projecte ha consistit en el disseny, implementació i desenvolupament d'un videojoc en el qual s'ha d'incorporat un sistema per obtenir dades d'ús dels usuaris. En aquest treball s'ha utilitzat el llenguatge PL/SQL i l'eina Oracle, versió 10, que és un modern SGBD. En aquest TFC s'han exposat els passos que s'han dut a terme per a l'elaboració del projecte.

Disseny i implementació d'una base de dades relacional per a la gestió d'un videojoc

Disseny i implementació d'una base de dades relacional per a la gestió d'ús d'un videojoc.

Report on selected computer systems operated by the State of Iowa for the period July 1, 1999 through June 30, 2014

Report on selected computer systems operated by the State of Iowa for the period July 1, 1999 through June 30, 2014

Education on Urban Corridor Issues Through Computer Animation, TR-419, 2003

This project was undertaken in coordination with the Environmental Assessment process on the Mt. Vernon Road Improvements project in Cedar Rapids, Iowa. The goal of the research was to determine the cost effectiveness of combined photo-imaging and computer animation as a presentation tool describing public road improvements. The Public Hearing, in combination with the involvement of a Citizen's Resource Group, afforded an opportunity to have an evaluation of the processes by interested citizens who were not familiar with engineering drawings or the construction industry. After the initial viewing of a draft version of the video, the Resource Group made recommendations to the staff developing the video. Discussion of these recommendations led to the development of an animated composite section that showed a combination of situations typically encountered throughout the project corridor, as well as critical considerations. The composite section did not show specific locations and therefore, individuals were not distracted by looking for the details pertaining to their properties. Concentration on the concepts involved rather than specifics provided the opportunity for a more thorough understanding by the citizens. The development of the composite concept was the primary discovery of the research.

Positron Emission Tomography and Computer Tomography (PET/CT) in Prostate, Bladder, and Testicular Cancers.

Positron emission computed tomography (PET) is a functional, noninvasive method for imaging regional metabolic processes that is nowadays most often combined to morphological imaging with computed tomography (CT). Its use is based on the well-founded assumption that metabolic changes occur earlier in tumors than morphologic changes, adding another dimension to imaging. This article will review the established and investigational indications and radiopharmaceuticals for PET/CT imaging for prostate cancer, bladder cancer and testicular cancer, before presenting upcoming applications in radiation therapy.

Computer Aided Detection and measurement of peripheral artery disease.

Computer-Aided Tomography Angiography (CTA) images are the standard for assessing Peripheral artery disease (PAD). This paper presents a Computer Aided Detection (CAD) and Computer Aided Measurement (CAM) system for PAD. The CAD stage detects the arterial network using a 3D region growing method and a fast 3D morphology operation. The CAM stage aims to accurately measure the artery diameters from the detected vessel centerline, compensating for the partial volume effect using Expectation Maximization (EM) and a Markov Random field (MRF). The system has been evaluated on phantom data and also applied to fifteen (15) CTA datasets, where the detection accuracy of stenosis was 88% and the measurement accuracy was with an 8% error.

A biophysical model of atrial fibrillation ablation: what can a surgeon learn from a computer model?

AIMS: Surgical ablation procedures for treating atrial fibrillation have been shown to be highly successful. However, the ideal ablation pattern still remains to be determined. This article reports on a systematic study of the effectiveness of the performance of different ablation line patterns. METHODS AND RESULTS: This study of ablation line patterns was performed in a biophysical model of human atria by combining basic lines: (i) in the right atrium: isthmus line, line between vena cavae and appendage line and (ii) in the left atrium: several versions of pulmonary vein isolation, connection of pulmonary veins, isthmus line, and appendage line. Success rates and the presence of residual atrial flutter were documented. Basic patterns yielded conversion rates of only 10-25 and 10-55% in the right and the left atria, respectively. The best result for pulmonary vein isolation was obtained when a single closed line encompassed all veins (55%). Combination of lines in the right/left atrium only led to a success rate of 65/80%. Higher rates, up to 90-100%, could be obtained if right and left lines were combined. The inclusion of a left isthmus line was found to be essential for avoiding uncommon left atrial flutter. CONCLUSION: Some patterns studied achieved a high conversion rate, although using a smaller number of lines than those of the Maze III procedure. The biophysical atrial model is shown to be effective in the search for promising alternative ablation strategies.

On learning dynamics underlying the evolution of learning rules.

In order to understand the development of non-genetically encoded actions during an animal's lifespan, it is necessary to analyze the dynamics and evolution of learning rules producing behavior. Owing to the intrinsic stochastic and frequency-dependent nature of learning dynamics, these rules are often studied in evolutionary biology via agent-based computer simulations. In this paper, we show that stochastic approximation theory can help to qualitatively understand learning dynamics and formulate analytical models for the evolution of learning rules. We consider a population of individuals repeatedly interacting during their lifespan, and where the stage game faced by the individuals fluctuates according to an environmental stochastic process. Individuals adjust their behavioral actions according to learning rules belonging to the class of experience-weighted attraction learning mechanisms, which includes standard reinforcement and Bayesian learning as special cases. We use stochastic approximation theory in order to derive differential equations governing action play probabilities, which turn out to have qualitative features of mutator-selection equations. We then perform agent-based simulations to find the conditions where the deterministic approximation is closest to the original stochastic learning process for standard 2-action 2-player fluctuating games, where interaction between learning rules and preference reversal may occur. Finally, we analyze a simplified model for the evolution of learning in a producer-scrounger game, which shows that the exploration rate can interact in a non-intuitive way with other features of co-evolving learning rules. Overall, our analyses illustrate the usefulness of applying stochastic approximation theory in the study of animal learning.

Cooperative games with size-truncated information

[Eng] We study the marginal worth vectors and their convex hull, the socalled Weber set, from the original coalitional game and the transformed one, which is called the Weber set of level k. We prove that the core of the original game is included in each of the Weber set of level k, for any k, and that the Weber sets of consecutive levels form a chain if and only if the original game is 0-monotone. Even if the game is not 0-monotone, the intersection of the Weber sets for consecutive levels is always not empty, what is not the case for non-consecutive ones. Spanish education system.

Cooperative games with size-truncated information

[Eng] We study the marginal worth vectors and their convex hull, the socalled Weber set, from the original coalitional game and the transformed one, which is called the Weber set of level k. We prove that the core of the original game is included in each of the Weber set of level k, for any k, and that the Weber sets of consecutive levels form a chain if and only if the original game is 0-monotone. Even if the game is not 0-monotone, the intersection of the Weber sets for consecutive levels is always not empty, what is not the case for non-consecutive ones. Spanish education system.

Axiomatization of the nucl eolus of assignment games

On the domain of general assignment games (with possible reservation prices) the core is axiomatized as the unique solution satisfying two consistency principles: projection consistency and derived consistency. Also, an axiomatic characterization of the nucleolus is given as the unique solution that satisfies derived consistency and equal maximum complaint between groups. As a consequence, we obtain a geometric characterization of the nucleolus. Maschler et al. (1979) provide a geometrical characterization for the intersection of the kernel and the core of a coalitional game, showing that those allocations that lie in both sets are always the midpoint of certain bargaining range between each pair of players. In the case of the assignment game, this means that the kernel can be determined as those core allocations where the maximum amount, that can be transferred without getting outside the core, from one agent to his / her optimally matched partner equals the maximum amount that he / she can receive from this partner, also remaining inside the core. We now prove that the nucleolus of the assignment game can be characterized by requiring this bisection property be satisfied not only for optimally matched pairs but also for optimally matched coalitions. Key words: cooperative games, assignment game, core, nucleolus