A simulation-based algorithm for solving the resource-assignment problem in satellite telecommunication networks

This paper proposes an heuristic for the scheduling of capacity requests and the periodic assignment of radio resources in geostationary (GEO) satellite networks with star topology, using the Demand Assigned Multiple Access (DAMA) protocol in the link layer, and Multi-Frequency Time Division Multiple Access (MF-TDMA) and Adaptive Coding and Modulation (ACM) in the physical layer.

ERPN Enterprise Resource Planning Newsletter, February 2001, Vol.1, no.1

Newsletter for Information Technology Department

ERPN, Enterprise Resource Planning Newsletter, March 2001, Vol.1, no.2

Newsletter for Information Technology Department

ERPN, Enterprise Resource Planning Newsletter, April 2001, Vol.1, no.3

Newsletter for Information Technology Department

ERPN, Enterprise Resource Planning Newsletter, July/August 2001, Vol.1, no.5

Newsletter for Information Tehcnology Department

ERPN, Enterprise Resource Planning Newsletter, May/June 2001, Vol.1, no.4

Newsletter for Information Technology Department

Report of Recommendations to the Iowa Department of Transportation on the Review of Selected General and Application Controls over the Human Resource Information System, May 27, 2003 - June 30, 2003

State Agency Audit Report

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.

Ongoing and future developments at the Universal Protein Resource.

The primary mission of Universal Protein Resource (UniProt) is to support biological research by maintaining a stable, comprehensive, fully classified, richly and accurately annotated protein sequence knowledgebase, with extensive cross-references and querying interfaces freely accessible to the scientific community. UniProt is produced by the UniProt Consortium which consists of groups from the European Bioinformatics Institute (EBI), the Swiss Institute of Bioinformatics (SIB) and the Protein Information Resource (PIR). UniProt is comprised of four major components, each optimized for different uses: the UniProt Archive, the UniProt Knowledgebase, the UniProt Reference Clusters and the UniProt Metagenomic and Environmental Sequence Database. UniProt is updated and distributed every 4 weeks and can be accessed online for searches or download at http://www.uniprot.org.

Report on Special Investigation of the Glenwood Resource Center, For the period June 21, 2002 through December 24, 2003

State Agency Audit Report

The E3 ubiquitin ligase Itch regulates sorting nexin 9 through an unconventional substrate recognition domain.

The level of intracellular proteins is mainly regulated through modifications by ubiquitin ligases that target them for degradation. Members of the NEDD4 family of E3 ubiquitin ligases, such as Itch (atrophin-1 interacting protein 4), possess up to four WW domains for specific association with PY motif-containing substrates. We have identified sorting nexin 9 (SNX9), a protein involved in endocytic processes, as a new substrate of Itch. Itch ubiquitylates SNX9 and regulates intracellular SNX9 levels. Using truncated proteins, we found that the interaction with SNX9 is mediated by the proline-rich domain (PRD) of Itch, a domain distinct from the conventional WW recognition domain, and the SH3 domain of SNX9. Interaction with the PRD of Itch is essential for SNX9 ubiquitylation and degradation. Furthermore, this effect is specific for Itch, as NEDD4, a related PRD-containing E3 ligase, does not bind SNX9. SNX18, a second member of the SNX family containing an SH3 domain, was also found to bind to Itch. Our results indicate that the pool of substrates of NEDD4 family E3 ubiquitin ligases extends beyond proteins containing PY motifs.

The Larned A. Waterman Iowa Nonprofit Resource Center eNewsletter, July 2004

Newsletter produced by Iowa Nonprofit Resource Center

The Larned A. Waterman Iowa Nonprofit Resource Center eNewsletter, May 2005

Newsletter produced by Iowa Non Profit Resource Center

The Larned A. Waterman Iowa Nonprofit Resource Center eNewsletter, February 2003

Newsletter produced by Iowa Nonprofit Resource Center