On pseudo-conservation laws for the cyclic server system with compound Poisson arrivals

Boxma and Groenendijk obtain the pseudo-conservation laws for cyclic server systems, for both the continuous-time system with simple Poisson arrivals, and for the discrete-time system. We extend these laws to the continuous-time cyclic server system with compound Poisson arrivals. In the process we identify an error in Boxma and Groenendijk's analysis of the semi-exhaustive service strategy in the discrete-time cyclic server system.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/29064/1/0000097.pd

Tandem AGV systems: A partitioning algorithm and performance comparison with conventional AGV systems

In an earlier paper, Bozer and Srinivasan introduced the tandem concept for automated guided vehicle (AGV) systems and presented an analytical model to evaluate the throughput performance of a basic component of the system; namely, a single vehicle serving a set of workstations under the First-Encountered-First-Served rule. In this study, using the above analytical model and certain column generation techniques, we present a heuristic partitioning scheme to configure tandem AGV systems. The partitioning scheme is based on a variation of the well-known set partitioning problem. It is aimed at evenly distributing the workload among all the AGVs in the system. We demonstrate the procedure with two numerical examples. Using simulation, the performance of the tandem configuration obtained for each example is compared to that of the corresponding conventional AGV system.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/29686/1/0000013.pd

NetMod: A Design Tool for Large-Scale Heterogeneous Campus Networks

The Network Modeling Tool (NetMod) uses simple analytical models to provide the designers of large interconnected local area networks with an in-depth analysis of the potential performance of these systems. This tool can be used in either a university, industrial, or governmental campus networking environment consisting of thousands of computer sites. NetMod is implemented with a combination of the easy-to-use Macintosh software packages HyperCard and Excel. The objectives of NetMod, the analytical models, and the user interface are described in detail along with its application to an actual campus-wide network.http://deepblue.lib.umich.edu/bitstream/2027.42/107971/1/citi-tr-90-1.pd

User Profile and Workload Analysis for Local Area Networks

Performance analysis tools for computer networks need accurate and comprehensive estimates of user workload. An approach is presented that estimates network impact for a wide variety of end user types and applications that are typical on local area networks. Fourteen user types and nine generic application types are defined, and data is collected to determine the average network bandwidth needed to accommodate the output of individual and aggregate user/application combinations. Workload is estimated using a combination of data obtained from live test experiments, and data collected from the literature. Finally, the implementation of this data in a highly interactive network modeling tool (NetMod) is illustrated with screen images generated during tool execution.http://deepblue.lib.umich.edu/bitstream/2027.42/107870/1/citi-tr-90-3.pd

Characteristics of optimal workload allocation for closed queueing networks

We consider the problem of allocating a given workload among the stations in a multi-server product-form closed queueing network to maximize the throughput. We first investigate properties of the throughput function and prove that it is pseudoconcave for some special cases. Some other characteristics of the optimal workload and its physical interpretation are also provided. We then develop two computational procedures to find the optimum workload allocation under the assumption that the throughput function is pseudoconcave in general. The primary advantage of assuming pseudoconcavity is that, under this assumption, satisfaction of first order necessary conditions is sufficient for optimality. Computational experience with these algorithms provides additional support for the validity of this assumption. Finally, we generalize the solution procedure to accommodate bounds on the workloads at each station.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/29251/1/0000308.pd

The optimal configuration and workload allocation problem in flexible manufacturing systems

In this article we consider the problem of determining the minimum cost configuration (number of machines and pallets) for a flexible manufacturing system with the constraint of meeting a prespecified throughput, while simultaneously allocating the total workload among the machines (or groups of machines). Our procedure allows consideration of upper and lower bounds on the workload at each machine group. These bounds arise as a consequence of precedence constraints among the various operations and/or limitations on the number or combinations of operations that can be assigned to a machine because of constraints on tool slots or the space required to store assembly components. Earlier work on problems of this nature assumes that the workload allocation is given. For the single-machine-type problem we develop an efficient implicit enumeration procedure that uses fathoming rules to eliminate dominated configurations, and we present computational results. We discuss how this procedure can be used as a building block in solving the problem with multiple machine types.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/45516/1/10696_2004_Article_BF00170207.pd

Edge Detection in Landing Budgerigars (Melopsittacus undulatus)

Background: While considerable scientific effort has been devoted to studying how birds navigate over long distances, relatively little is known about how targets are detected, obstacles are avoided and smooth landings are orchestrated. Here we examine how visual features in the environment, such as contrasting edges, determine where a bird will land. Methodology/Principal Findings: Landing in budgerigars (Melopsittacus undulatus) was investigated by training them to fly from a perch to a feeder, and video-filming their landings. The feeder was placed on a grey disc that produced a contrasting edge against a uniformly blue background. We found that the birds tended to land primarily at the edge of the disc and walk to the feeder, even though the feeder was in the middle of the disc. This suggests that the birds were using the visual contrast at the boundary of the disc to target their landings. When the grey level of the disc was varied systematically, whilst keeping the blue background constant, there was one intermediate grey level at which the budgerigar's preference for the disc boundary disappeared. The budgerigars then landed randomly all over the test surface. Even though this disc is (for humans) clearly distinguishable from the blue background, it offers very little contrast against the background, in the red and green regions of the spectrum. Conclusions: We conclude that budgerigars use visual edges to target and guide landings. Calculations of photoreceptor excitation reveal that edge detection in landing budgerigars is performed by a color-blind luminance channel that sums the signals from the red and green photoreceptors, or, alternatively, receives input from the red double-cones. This finding has close parallels to vision in honeybees and primates, where edge detection and motion perception are also largely color-blind

Large expert-curated database for benchmarking document similarity detection in biomedical literature search

Document recommendation systems for locating relevant literature have mostly relied on methods developed a decade ago. This is largely due to the lack of a large offline gold-standard benchmark of relevant documents that cover a variety of research fields such that newly developed literature search techniques can be compared, improved and translated into practice. To overcome this bottleneck, we have established the RElevant LIterature SearcH consortium consisting of more than 1500 scientists from 84 countries, who have collectively annotated the relevance of over 180 000 PubMed-listed articles with regard to their respective seed (input) article/s. The majority of annotations were contributed by highly experienced, original authors of the seed articles. The collected data cover 76% of all unique PubMed Medical Subject Headings descriptors. No systematic biases were observed across different experience levels, research fields or time spent on annotations. More importantly, annotations of the same document pairs contributed by different scientists were highly concordant. We further show that the three representative baseline methods used to generate recommended articles for evaluation (Okapi Best Matching 25, Term Frequency-Inverse Document Frequency and PubMed Related Articles) had similar overall performances. Additionally, we found that these methods each tend to produce distinct collections of recommended articles, suggesting that a hybrid method may be required to completely capture all relevant articles. The established database server located at https://relishdb.ict.griffith.edu.au is freely available for the downloading of annotation data and the blind testing of new methods. We expect that this benchmark will be useful for stimulating the development of new powerful techniques for title and title/abstract-based search engines for relevant articles in biomedical research.Peer reviewe

Waiting time variances in continuous-time polling systems Mandyam M. Srinivasan.

http://deepblue.lib.umich.edu/bitstream/2027.42/7769/5/bbl2274.0001.001.pdfhttp://deepblue.lib.umich.edu/bitstream/2027.42/7769/4/bbl2274.0001.001.tx