On Approximate Nonlinear Gaussian Message Passing On Factor Graphs

Factor graphs have recently gained increasing attention as a unified framework for representing and constructing algorithms for signal processing, estimation, and control. One capability that does not seem to be well explored within the factor graph tool kit is the ability to handle deterministic nonlinear transformations, such as those occurring in nonlinear filtering and smoothing problems, using tabulated message passing rules. In this contribution, we provide general forward (filtering) and backward (smoothing) approximate Gaussian message passing rules for deterministic nonlinear transformation nodes in arbitrary factor graphs fulfilling a Markov property, based on numerical quadrature procedures for the forward pass and a Rauch-Tung-Striebel-type approximation of the backward pass. These message passing rules can be employed for deriving many algorithms for solving nonlinear problems using factor graphs, as is illustrated by the proposition of a nonlinear modified Bryson-Frazier (MBF) smoother based on the presented message passing rules

From Product Inspection to Total Quality Management in the Food Supply Chain

The problem of defining, implementing and inspecting quality assurance schemes for all types of primary agricultural products is described and various examples from Denmark and other European countries are mentioned. The trends as to requirements, management and documentation as well as assessment are discussed from a European point of view. The authors suggest Total Quality Management in a form adapted to the food supply chain.Food Consumption/Nutrition/Food Safety,

Scale properties in data envelopment analysis

Recently there has been some discussion in the literature concerning the nature of scale properties in the Data Envelopment Model (DEA). It has been argued that DEA may not be able to provide reliable estimates of the optimal scale size. We argue in this paper that DEA is well suited to estimate optimal scale size, if DEA is augmented with two additional maintained hypotheses which imply that the DEA-frontier is consistent with smooth curves along rays in input and in output space that obey the Regular Ultra Passum (RUP) law (Frisch 1965). A necessary condition for a smooth curve passing through all vertices to obey the RUP-law is presented. If this condition is satisfied then upper and lower bounds for the marginal product at each vertex are presented. It is shown that any set of feasible marginal products will correspond to a smooth curve passing through all points with a monotonic decreasing scale elasticity. The proof is constructive in the sense that an estimator of the curve is provided with the desired properties. A typical DEA based return to scale analysis simply reports whether or not a DMU is at the optimal scale based on point estimates of scale efficiency. A contribution of this paper is that we provide a method which allows us to determine in what interval optimal scale is located.DEA; efficiency

Sculptor

THROUGH his work as artist in residence at Iowa State College, Christian Petersen has, with candor and simplicity, created a permanent monument to the beauty and vitality of the American Mid-West..

Near-optimal adjacency labeling scheme for power-law graphs

An adjacency labeling scheme is a method that assigns labels to the vertices of a graph such that adjacency between vertices can be inferred directly from the assigned label, without using a centralized data structure. We devise adjacency labeling schemes for the family of power-law graphs. This family that has been used to model many types of networks, e.g. the Internet AS-level graph. Furthermore, we prove an almost matching lower bound for this family. We also provide an asymptotically near- optimal labeling scheme for sparse graphs. Finally, we validate the efficiency of our labeling scheme by an experimental evaluation using both synthetic data and real-world networks of up to hundreds of thousands of vertices