M.A.M. (Mobile Applications Management)

L'objectiu fonamental d'aquest treball és implementar un sistema de base de dades per donar resposta a la necessitat dels desenvolupadors d'aplicacions mòbils a nivell mundial per unificar i millorar l'experiència dels seus usuaris a l'hora de descarregar les seves aplicacions.

SAP Web Applications

Debido a la importancia y el incremento del uso de internet y de la expansión de los programas de la compañia alemana SAP, decidimos hacer el TFC de manera que pudieramos combinar ambos campos. Hemos creado un paquete de software par el control, almacenamiento y estudio del tiempo invertido por los trabajadores de una empresa en los proyectos que esta desarrolla. Hemos utilizado SAP con acceso web.

SAP web applications

This project report has been writen by four international students studying at the university of Vitus Bering Denmark. Its purpose is to provide a closer view on the establishment of a new company, producing software applications, in particular SAP applications. We started our work from a problem, that was finding a new way to manage projects and for this reason our focus has been on a particular kind of program, enabling the companies and the workers to control their projects and the hours spent by each employee on each project.

A-7 Statistical Report On FIP Applications And Cases Discontinued, December 2003

Monthly statistical report on FIP by Iowa Department of Human Services

A-7 Statistical Report On FIP Applications And Cases Discontinued, January 2004

Monthly statistical report on FIP by the Iowa Department of Human Services

Tree-based message diffusion for managing replicated data in unreliable and resource-constrained peer-to-peer environment

Abstract This thesis proposes a set of adaptive broadcast solutions and an adaptive data replication solution to support the deployment of P2P applications. P2P applications are an emerging type of distributed applications that are running on top of P2P networks. Typical P2P applications are video streaming, file sharing, etc. While interesting because they are fully distributed, P2P applications suffer from several deployment problems, due to the nature of the environment on which they perform. Indeed, defining an application on top of a P2P network often means defining an application where peers contribute resources in exchange for their ability to use the P2P application. For example, in P2P file sharing application, while the user is downloading some file, the P2P application is in parallel serving that file to other users. Such peers could have limited hardware resources, e.g., CPU, bandwidth and memory or the end-user could decide to limit the resources it dedicates to the P2P application a priori. In addition, a P2P network is typically emerged into an unreliable environment, where communication links and processes are subject to message losses and crashes, respectively. To support P2P applications, this thesis proposes a set of services that address some underlying constraints related to the nature of P2P networks. The proposed services include a set of adaptive broadcast solutions and an adaptive data replication solution that can be used as the basis of several P2P applications. Our data replication solution permits to increase availability and to reduce the communication overhead. The broadcast solutions aim, at providing a communication substrate encapsulating one of the key communication paradigms used by P2P applications: broadcast. Our broadcast solutions typically aim at offering reliability and scalability to some upper layer, be it an end-to-end P2P application or another system-level layer, such as a data replication layer. Our contributions are organized in a protocol stack made of three layers. In each layer, we propose a set of adaptive protocols that address specific constraints imposed by the environment. Each protocol is evaluated through a set of simulations. The adaptiveness aspect of our solutions relies on the fact that they take into account the constraints of the underlying system in a proactive manner. To model these constraints, we define an environment approximation algorithm allowing us to obtain an approximated view about the system or part of it. This approximated view includes the topology and the components reliability expressed in probabilistic terms. To adapt to the underlying system constraints, the proposed broadcast solutions route messages through tree overlays permitting to maximize the broadcast reliability. Here, the broadcast reliability is expressed as a function of the selected paths reliability and of the use of available resources. These resources are modeled in terms of quotas of messages translating the receiving and sending capacities at each node. To allow a deployment in a large-scale system, we take into account the available memory at processes by limiting the view they have to maintain about the system. Using this partial view, we propose three scalable broadcast algorithms, which are based on a propagation overlay that tends to the global tree overlay and adapts to some constraints of the underlying system. At a higher level, this thesis also proposes a data replication solution that is adaptive both in terms of replica placement and in terms of request routing. At the routing level, this solution takes the unreliability of the environment into account, in order to maximize reliable delivery of requests. At the replica placement level, the dynamically changing origin and frequency of read/write requests are analyzed, in order to define a set of replica that minimizes communication cost.

A-7 Statistical Report On FIP Applications And Cases Discontinued, February 2004

Monthly statistical report on FIP by Iowa Department of Human Services

A-7 Statistical Report On FIP Applications And Cases Discontinued, March 2004

Monthly statistical report on FIP by Iowa Department of Human Services

A-7 Statistical Report On FIP Applications And Cases Discontinued, May 2004

Monthly statistical report on FIP by the Iowa Department of Human Services

Iterative image reconstruction techniques: cardiothoracic computed tomography applications.

Iterative image reconstruction algorithms provide significant improvements over traditional filtered back projection in computed tomography (CT). Clinically available through recent advances in modern CT technology, iterative reconstruction enhances image quality through cyclical image calculation, suppressing image noise and artifacts, particularly blooming artifacts. The advantages of iterative reconstruction are apparent in traditionally challenging cases-for example, in obese patients, those with significant artery calcification, or those with coronary artery stents. In addition, as clinical use of CT has grown, so have concerns over ionizing radiation associated with CT examinations. Through noise reduction, iterative reconstruction has been shown to permit radiation dose reduction while preserving diagnostic image quality. This approach is becoming increasingly attractive as the routine use of CT for pediatric and repeated follow-up evaluation grows ever more common. Cardiovascular CT in particular, with its focus on detailed structural and functional analyses, stands to benefit greatly from the promising iterative solutions that are readily available.

A-7 Statistical Report On FIP Applications And Cases Discontinued, July 2002

Monthly statistical report on FIP by Iowa Department of Human Services

A-7 Statistical Report On FIP Applications And Cases Discontinued, September 2003

Monthly statistical report on FIP by Iowa Department of Human Services

A-7 Statistical Report On FIP Applications And Cases Discontinued, November 2001

Monthly statistical report on FIP by Iowa Department of Human Services