A technique for dynamically calibrating pressure transducers at cryogenic temperatures

A technique was developed for the calibration of dynamic pressure transducers at cryogenic temperatures. The calibration system utilizes an 8.9 Newton peak thrust shaker which oscillates a helium-filled bellows to generate a sinusoidal dynamic pressure to calibrate transducers immersed in a cryogenic environment. The system has a dynamic pressure measurement uncertainty of approximately 11% and is capable of producing peak-to-peak dynamic pressure amplitudes of 1.4 kPa over a frequency range of 40 to 100 hertz and a temperature range of 100 to 300 K. It provides an unprecedented capability of both static and dynamic calibration of pressure transducers from ambient to cryogenic temperature

Optimal control of storage for arbitrage, with applications to energy systems

We study the optimal control of storage which is used for arbitrage, i.e. for buying a commodity when it is cheap and selling it when it is expensive. Our particular concern is with the management of energy systems, although the results are generally applicable. We consider a model which may account for nonlinear cost functions, market impact, input and output rate constraints and inefficiencies or losses in the storage process. We develop an algorithm which is maximally efficient in then sense that it incorporates the result that, at each point in time, the optimal management decision depends only a finite, and typically short, time horizon. We give examples related to the management of a real-world system.Comment: 7 pages, 6 figure

An integrated packet/flow model for TCP performance analysis

Processor sharing (PS) models for TCP behavior nicely capture the bandwidth sharing and statistical multiplexing effect of TCP flows on the flow level. However, these ‘rough’ models do not provide insight into the impact of packet-level parameters (such as round trip time and buffer size) on, e.g., throughput and flow transfer times. This paper proposes an integrated packet/flow-level model: it exploits the advantages of PS approach on the flow level and, at the same time, it incorporates the most significant packet-level effects

Livestock trade network: potential for disease transmission and implications for risk-based surveillance on the island of Mayotte

The island of Mayotte is a department of France, an outermost region of the European Union located in the Indian Ocean between Madagascar and the coast of Eastern Africa. Due to its close connection to the African mainland and neighbouring islands, the island is under constant threat of introduction of infectious diseases of both human and animal origin. Here, using social network analysis and mathematical modelling, we assessed potential implications of livestock movements between communes in Mayotte for risk-based surveillance. Our analyses showed that communes in the central region of Mayotte acted as a hub in the livestock movement network. The majority of livestock movements occurred between communes in the central region and from communes in the central region to those in the outer region. Also, communes in the central region were more likely to be infected earlier than those in the outer region when the spread of an exotic infectious disease was simulated on the livestock movement network. The findings of this study, therefore, suggest that communes in the central region would play a major role in the spread of infectious diseases via livestock movements, which needs to be considered in the design of risk-based surveillance systems in Mayotte

Quantitative Assessment of the Risk of Release of Foot-and-Mouth Disease Virus via Export of Bull Semen from Israel

Various foot-and-mouth disease (FMD) virus strains circulate in the Middle East, causing frequent episodes of FMD outbreaks among Israeli livestock. Since the virus is highly resistant in semen, artificial insemination with contaminated bull semen may lead to the infection of the receiver cow. As a non-FMD-free country with vaccination, Israel is currently engaged in trading bull semen only with countries of the same status. The purpose of this study was to assess the risk of release of FMD virus through export of bull semen in order to estimate the risk for FMD-free countries considering purchasing Israeli bull semen. A stochastic risk assessment model was used to estimate this risk, defined as the annual likelihood of exporting at least one ejaculate of bull semen contaminated with viable FMD virus. A total of 45 scenarios were assessed to account for uncertainty and variability around specific parameter estimates and to evaluate the effect of various mitigation measures, such as performing a preexport test on semen ejaculates. Under the most plausible scenario, the annual likelihood of exporting bull semen contaminated with FMD virus had a median of 1.3 * 10(-7) for an export of 100 ejaculates per year. This corresponds to one infected ejaculate exported every 7 million years. Under the worst-case scenario, the median of the risk rose to 7.9 * 10(-5), which is equivalent to the export of one infected ejaculate every 12,000 years. Sensitivity analysis indicated that the most influential parameter is the probability of viral excretion in infected bulls

Computable bounds in fork-join queueing systems

In a Fork-Join (FJ) queueing system an upstream fork station splits incoming jobs into N tasks to be further processed by N parallel servers, each with its own queue; the response time of one job is determined, at a downstream join station, by the maximum of the corresponding tasks' response times. This queueing system is useful to the modelling of multi-service systems subject to synchronization constraints, such as MapReduce clusters or multipath routing. Despite their apparent simplicity, FJ systems are hard to analyze. This paper provides the first computable stochastic bounds on the waiting and response time distributions in FJ systems. We consider four practical scenarios by combining 1a) renewal and 1b) non-renewal arrivals, and 2a) non-blocking and 2b) blocking servers. In the case of non blocking servers we prove that delays scale as O(logN), a law which is known for first moments under renewal input only. In the case of blocking servers, we prove that the same factor of log N dictates the stability region of the system. Simulation results indicate that our bounds are tight, especially at high utilizations, in all four scenarios. A remarkable insight gained from our results is that, at moderate to high utilizations, multipath routing 'makes sense' from a queueing perspective for two paths only, i.e., response times drop the most when N = 2; the technical explanation is that the resequencing (delay) price starts to quickly dominate the tempting gain due to multipath transmissions

Center for Rural Health

This departmental history was written on the occasion of the UND Quasquicentennial in 2008.https://commons.und.edu/departmental-histories/1068/thumbnail.jp