The Character of Melting for Simple Molecules Deposited on Graphite

The microscopic character of melting for quasi–two dimensional N ₂ adlayers on graphite is examined for surface densities 0.2 1, where the upper limit corresponds to a complete monolayer. A Monte Carlo method, with the multiple histogram procedure, is employed to determine various thermodynamic quantities. Using the calculated specific heats and selected order parameters, determined at various surface densities, the mechanism for melting is shown to be vacancy mediated. The somewhat unusual behavior of the melting temperature versus density is shown to be entirely due to the vacancy concentration and their topology. Because this is determined by the free energy, our analysis should be general. Preliminary results for Xe on graphite supports this claim.     

Damping of quasiparticles in a layered two-dimensional electron gas: Influence of electron-phonon and electron-electron interaction

Damping of the quasiparticles in a layered two-dimensional electron gas has been calculated including the electron-phonon and electron-electron interaction. The calculations performed atT=0 andT0 show that the non-Fermi behavior can appear as in the case of the electron-plasmon interaction, but it is also enhanced by the presence of the phonons.     

Time Windows Based Dynamic Routing in Multi-AGV Systems

This paper presents a dynamic routing method for supervisory control of multiple automated guided vehicles (AGVs) that are traveling within a layout of a given warehouse. In dynamic routing a calculated path particularly depends on the number of currently active AGVs' missions and their priorities. In order to solve the shortest path problem dynamically, the proposed routing method uses time windows in a vector form. For each mission requested by the supervisor, predefined candidate paths are checked if they are feasible. The feasibility of a particular path is evaluated by insertion of appropriate time windows and by performing the windows overlapping tests. The use of time windows makes the algorithm apt for other scheduling and routing problems. Presented simulation results demonstrate efficiency of the proposed dynamic routing. The proposed method has been successfully implemented in the industrial environment in a form of a multiple AGV control system.     

Maximum throughput of multiple access channels in adversarial environments

We consider deterministic distributed broadcasting on multiple access channels in the framework of adversarial queuing. Packets are injected dynamically by an adversary that is constrained by the injection rate and the number of packets that may be injected simultaneously; the latter we call burstiness. A protocol is stable when the number of packets in queues at the stations stays bounded. The maximum injection rate that a protocol can handle in a stable manner is called the throughput of the protocol. We consider adversaries of injection rate 1, that is, of one packet per round, to address the question if the maximum throughput 1 can be achieved, and if so then with what quality of service. We develop a protocol that achieves throughput 1 for any number of stations against leaky-bucket adversaries. The protocol has O(n²+\textburstiness){\mathcal{O}(n^2+\text{burstiness})} packets queued simultaneously at any time, where n is the number of stations; this upper bound is proved to be best possible. A protocol is called fair when each packet is eventually broadcast. We show that no protocol can be both stable and fair for a system of at least two stations against leaky-bucket adversaries. We study in detail small systems of exactly two and three stations against window adversaries to exhibit differences in quality of broadcast among classes of protocols. A protocol is said to have fair latency if the waiting time of packets is O(\textburstiness){\mathcal{O}(\text{burstiness})}. For two stations, we show that fair latency can be achieved by a full sensing protocol, while there is no stable acknowledgment based protocol. For three stations, we show that fair latency can be achieved by a general protocol, while no full sensing protocol can be stable. Finally, we show that protocols that either are fair or do not have the queue sizes affect the order of transmissions cannot be stable in systems of at least four stations against window adversaries.     

Modified versions of the Bayesian Information Criterion for sparse Generalized Linear Models

The classical model selection criteria, such as the Bayesian Information Criterion (BIC) or Akaike information criterion (AIC), have a strong tendency to overestimate the number of regressors when the search is performed over a large number of potential explanatory variables. To handle the problem of the overestimation, several modifications of the BIC have been proposed. These versions rely on supplementing the original BIC with some prior distributions on the class of possible models. Three such modifications are presented and compared in the context of sparse Generalized Linear Models (GLMs). The related choices of priors are discussed and the conditions for the asymptotic equivalence of these criteria are provided. The performance of the modified versions of the BIC is illustrated with an extensive simulation study and a real data analysis. Also, simplified versions of the modified BIC, based on least squares regression, are investigated.     

Matrix approach to deadlock-free dispatching in multi-class finite buffer flowlines

For finite-buffer manufacturing systems, the major stability issue is "deadlock," rather than "bounded-buffer-length stability." The paper introduces the concept of "system deadlock," defined rigorously in Petri net terms, and system operation with uninterrupted part-flow is characterized in terms of the absence of this condition. For a large class of finite-buffer multiclass re-entrant flowline systems, an analysis of "circular waits" yields necessary and sufficient conditions for the occurrence of "system deadlock." This allows the formulation of a maximally permissive one-step-look-ahead deadlock-avoidance control policy for dispatching jobs, while maximizing the percent utilization of resources. The result is a generalized kanban dispatching strategy, which is more general than the standard multiclass last buffer first serve (LBFS) dispatching strategies for finite buffer flowlines that typically under-utilize the resources. The problem of computational complexity associated with Petri net (PN) applications is overcome by using certain sub-matrices of the PN incidence matrix. Computationally efficient matrix techniques are given for implementing the deadlock-free dispatching policy.     

Automatic cluster detection in Kohonen's SOM.

Kohonen's self-organizing map (SOM) is a popular neural network architecture for solving problems in the field of explorative data analysis, clustering, and data visualization. One of the major drawbacks of the SOM algorithm is the difficulty for nonexpert users to interpret the information contained in a trained SOM. In this paper, this problem is addressed by introducing an enhanced version of the Clusot algorithm. This algorithm consists of two main steps: 1) the computation of the Clusot surface utilizing the information contained in a trained SOM and 2) the automatic detection of clusters in this surface. In the Clusot surface, clusters present in the underlying SOM are indicated by the local maxima of the surface. For SOMs with 2-D topology, the Clusot surface can, therefore, be considered as a convenient visualization technique. Yet, the presented approach is not restricted to a certain type of 2-D SOM topology and it is also applicable for SOMs having an n-dimensional grid topology.     

Robust gossiping with an application to consensus

We study deterministic gossiping in synchronous systems with dynamic crash failures. Each processor is initialized with an input value called rumor. In the standard gossip problem, the goal of every processor is to learn all the rumors. When processors may crash, then this goal needs to be revised, since it is possible, at a point in an execution, that certain rumors are known only to processors that have already crashed. We define gossiping to be completed, for a system with crashes, when every processor knows either the rumor of processor v or that v has already crashed, for any processor v. We design gossiping algorithms that are efficient with respect to both time and communication. Let t<n be the number of failures, where n is the number of processors. If , then one of our algorithms completes gossiping in O(log²t) time and with O(npolylogn) messages. We develop an algorithm that performs gossiping with O(n^1.77) messages and in O(log²n) time, in any execution in which at least one processor remains non-faulty. We show a trade-off between time and communication in gossiping algorithms: if the number of messages is at most O(npolylogn), then the time has to be at least . By way of application, we show that if n−t=Ω(n), then consensus can be solved in O(t) time and with O(nlog²t) messages.     

ArcFVS:An integration of a Geographic Information System and Forest Vegetation Simulator

This paper presents the design and implementation of an integrated application program called ArcFVS that links the Forest Vegetation Simulator (FVS) and a Geographic Information System (GIS) to realize spatial selection of input files and graphic display of modeling output. Data for testing and running the model came from the U.S. Forest Service's Forest Inventory and Analysis (FIA) Database and were also collected in field surveys in north-central Indiana. ArcFVS 1.0 is designed using the ArcGIS software from the Environmental Systems Research Institute (ESRI) and the Visual Basic for Applications (VBA) programming environment to manipulate ESRI's ArcObjects. The resulting product offers custom functions as commands in a new menu or as tools on a new toolbar. They are used to: select spatially or by attribute the forest plots to be projected by FVS, create the FVS input files for the selected plots and display in a geospatial environment different types of FVS output (text output files, tables with variables of interest and visualization image files). Advantages of ArcFVS 1.0 include the new GIS capabilities, enhanced format translation functions and the standardized programming environment.     

ArcFVS: An integration of a Geographic Information System and Forest Vegetation Simulator

This paper presents the design and implementation of an integrated application program called ArcFVS that links the Forest Vegetation Simulator (FVS) and a Geographic Information System (GIS) to realize spatial selection of input files and graphic display of modeling output. Data for testing and running the model came from the U.S. Forest Service’s Forest Inventory and Analysis (FIA) Database and were also collected in field surveys in north-central Indiana. ArcFVS 1.0 is designed using the ArcGIS software from the Environmental Systems Research Institute (ESRI) and the Visual Basic for Applications (VBA) programming environment to manipulate ESRI’s ArcObjects. The resulting product offers custom functions as commands in a new menu or as tools on a new toolbar. They are used to: select spatially or by attribute the forest plots to be projected by FVS, create the FVS input files for the selected plots and display in a geospatial environment different types of FVS output (text output files, tables with variables of interest and visualization image files). Advantages of ArcFVS 1.0 include the new GIS capabilities, enhanced format translation functions and the standardized programming environment.