TERAHERTZ QUALITY CONTROL OF POLYMERIC PRODUCTS

We report on experiments that evaluate the potential of terahertz (THz) time-domain spectroscopy (TDS) for quality control of polymeric compounds. We investigate specimens out of a polyethylene compound with silver-coated titanium dioxide nanospheres and a glass-fiber reinforced epoxy composite. We further examine an industrial polymer product produced by injection molding. Our data demonstrates that THz imaging is a powerful tool for contactless quality control in the polymer industry.     

Global Optimal Image Reconstruction from Blurred Noisy Data by a Bayesian Approach

In this paper, a procedure is presented which allows the optimal reconstruction of images from blurred noisy data. The procedure relies on a general Bayesian approach, which makes proper use of all the available information. Special attention is devoted to the informative content of the edges; thus, a preprocessing phase is included, with the aim of estimating the jump sizes in the gray level. The optimization phase follows; existence and uniqueness of the solution is secured. The procedure is tested against simple simulated data and real data.     

Testing Extreme Value Conditions

A test statistic is developed that checks the validity of the extreme value conditions without specifiying the shape parameter of the limiting extreme value distribution.     

Coloring mixed hypertrees

A mixed hypergraph is a triple (V,C,D) where V is its vertex set and C and D are families of subsets of V, called C-edges and D-edges, respectively. For a proper coloring, we require that each C-edge contains two vertices with the same color and each D-edge contains two vertices with different colors. The feasible set of a mixed hypergraph is the set of all k's for which there exists a proper coloring using exactly k colors. A hypergraph is a hypertree if there exists a tree such that the edges of the hypergraph induce connected subgraphs of the tree.We prove that feasible sets of mixed hypertrees are gap-free, i.e., intervals of integers, and we show that this is not true for precolored mixed hypertrees. The problem to decide whether a mixed hypertree can be colored by k colors is NP-complete in general; we investigate complexity of various restrictions of this problem and we characterize their complexity in most of the cases.