Solving Large Location-Allocation problems by Clustering and Simulated Annealing

Globalization involves several facility location problems that need to be handled at large scale. Location Allocation (LA) is a combinatorial problem in which the distance among points in the data space matter. Precisely, taking advantage of the distance property of the domain we exploit the capability of clustering techniques to partition the data space in order to convert an initial large LA problem into several simpler LA problems. Particularly, our motivation problem involves a huge geographical area that can be partitioned under overall conditions. We present different types of clustering techniques and then we perform a cluster analysis over our dataset in order to partition it. After that, we solve the LA problem applying simulated annealing algorithm to the clustered and non-clustered data in order to work out how profitable is the clustering and which of the presented methods is the most suitable

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

Household Hazardous Materials Programs, January 2004

Household hazardous materials annual report for the Iowa Department of Natural Resources.

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

Do plants adjust their sex allocation and secondary sexual morphology in response to their neighbours?

BACKGROUND AND AIMS: Changes in the sex allocation (i.e. in pollen versus seed production) of hermaphroditic plants often occur in response to the environment. In some homosporous ferns, gametophytes choose their gender in response to chemical cues sent by neighbours, such that spores develop as male gametophytes if they perceive a female or hermaphrodite nearby. Here it is considered whether a similar process might occur in the androdioecious angiosperm species Mercurialis annua, in which males co-occur with hermaphrodites; previous work on a Spanish population of M. annua found that individuals were more likely to develop as males at high density. METHODS: Using a novel approach to treat plants with leachate from pots containing males or hermaphrodites of M. annua, the hypothesis that individuals assess their mating opportunities, and adjust their sex expression accordingly, was tested through an exchange of chemical cues through the soil. KEY RESULTS: For the population under study, from Morocco, no evidence was found for soil-signal-dependent sex expression: neither sex ratios nor sex allocation differed among experimental treatments. CONCLUSIONS: The results imply either that the Moroccan population under study behaves differently from that previously studied in Spain (pointing to potential geographical variation in plasticity for sex expression), or that our method failed to capture the signals used by M. annua for adjustment of sex expression.