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.     

Operations on logic functions and variables through sign Haar spectra

A non-linear transform, called “sign Haar transform” has recently been introduced. The transform is unique and converts binary/ternary vectors into ternary spectral domain. Recursive definitions for the calculation of sign Haar transform are developed. Essential properties of logic functions and variables in the spectral domain of a quantized transform based on Haar functions are presented. Sign Haar transform has the smallest computational cost of all the quantized transforms. The properties of logic functions are listed for two different codings of incompletely specified functions.     

Active elements on a basis of ZnO nanorods for energy harvesting devices

It is represented the research of piezoelectric properties of nanorods and their application in energy harvesting devices. According to the simulation results with method of finite elements the value of electromechanic coupling coefficient of monolayer from ZnO nanorods is greater than one in compare to uniform film application. The sample manufacturing method consists of application of traditional microelectronic technique for shaping of top and bottom electrodes and also application of two-steps low-temperature chemical synthesis for ZnO nanorods. To provide acoustic perturbation of the sample the piezoceramic element is used in multilayer structure fixed on the glassceramic substrate. The results are obtained for two measurement modes, providing oscillations perturbation by rectangular pulses source and by harmonic generator. Obtained results demonstrate high efficiency of piezoelectric transformation for monolayer, which consists of ZnO nanorods that is possible to be used in different self-powered devices.     

Texture-independent recognition of facial expressions in image snapshots and videos

This paper addresses the static and dynamic recognition of basic facial expressions. It has two main contributions. First, we introduce a view- and texture-independent scheme that exploits facial action parameters estimated by an appearance-based 3D face tracker. We represent the learned facial actions associated with different facial expressions by time series. Second, we compare this dynamic scheme with a static one based on analyzing individual snapshots and show that the former performs better than the latter. We provide evaluations of performance using three subspace learning techniques: linear discriminant analysis, non-parametric discriminant analysis and support vector machines.     

Visual Target Localization with the Spincopter

The goal of the Spincopter project was to design an energy efficient aircraft capable of autorotation glide that could be used for both indoor and outdoor surveillance. This paper demonstrates how to utilize the self-rotating capability of the Spincopter in order to acquire a 3D image of its environment and localize predefined object(s). The omnidirectional capabilities of such an UAV extends the otherwise very limited field of view of conventional cameras usually used for aerial photography and surveillance. The paper presents the theoretical background and the actual implementation of such a system. It presents the resulting images and offers a brief survey of the image quality.