Zein-based anti-browning cling wraps for fresh-cut apple slices

The usage of cling wraps is emerging as an easy and cost-effective approach to protect fresh-cut fruits and vegetables from dust, whilst improving visual appeal on retail counters. This study focused on developing an alternate, protein-based packaging material as a food grade cling wrap for food packaging applications. Zein-based cling wraps were produced, and their physical and mechanical characteristics were evaluated and compared with conventionally used chitosan biopolymer films and commercial synthetic polymer films. Antioxidant potential of the prepared films was studied, and the effectiveness of the developed films as anti-browning cling wraps was evaluated using studies conducted on fresh-cut apple slices at ambient conditions. Anti-browning effects were in par with polymeric counterparts; however, zein cling wraps could better prevent weight loss in apple slices. Zein-based films can be adopted as biodegradable food grade cling wraps as an alternative to chitosan and synthetic polymeric materials.     

The Two-Dimensional Clifford-Fourier Transform

Recently several generalizations to higher dimension of the Fourier transform using Clifford algebra have been introduced, including the Clifford-Fourier transform by the authors, defined as an operator exponential with a Clifford algebra-valued kernel. In this paper an overview is given of all these generalizations and an in depth study of the two-dimensional Clifford-Fourier transform of the authors is presented. In this special two-dimensional case a closed form for the integral kernel may be obtained, leading to further properties, both in the L ₁ and in the L ₂ context. Furthermore, based on this Clifford-Fourier transform Clifford-Gabor filters are introduced. AMS subject classification numbers: 42B10, 30G35 Fred Brackx received a diploma degree in mathematics from Ghent University, Belgium, in 1970 and a Ph.D. degree in mathematics from the same university in 1973. Since 1984 he is professor for mathematical analysis at Ghent University and currently he is leading the Clifford Research Group. His main interests are function theory and functional analysis for functions with values in quaternion and Clifford algebras. The research covers Clifford distributions, generalized Fourier, Radon and Hilbert transforms, orthogonal polynomials and multi-dimensional wavelets. Nele De Schepper received a diploma degree in mathematics from Ghent University, Belgium, in 2001. Since then she holds an assistantship at the Department of Mathematical Analysis of Ghent University and is a member of the Clifford Research Group. Her main interests are function theory and functional analysis for functions with values in Clifford algebras. The research covers generalized Fourier transforms, orthogonal polynomials and multi-dimensional wavelets. Frank Sommen received a diploma degree in mathematics from Ghent University, Belgium, in 1978, a Ph.D. degree in mathematics from the same university in 1980, and a habilitation degree in mathematical analysis in 1984. From 1978 until 1999 he was at the National Fund for Scientific Research (Flanders). Since 2000 he holds a Research professorship at Ghent University. His main interests are function theory and functional analysis for functions with values in quaternion and Clifford algebras. The research covers Clifford distributions, generalized Fourier, Radon and Hilbert transforms, orthogonal polynomials and multi-dimensional wavelets, algebraic analysis, hyperfunctions and radial algebra.     

End‐Capping as a Method for Improving Carrier Injection in Electrophosphorescent Light‐Emitting Diodes

The electronic properties, carrier injection, and transport into poly(9,9‐dioctylfluorene) (PFO), PFO end‐capped with hole‐transporting moieties (HTM), PFO–HTM, and PFO end‐capped with electron‐transporting moieties (ETM), PFO–ETM, were investigated. The data demonstrate that charge injection and transport can be tuned by end‐capping with HTM and ETM, without significantly altering the electronic properties of the conjugated backbone. End‐capping with ETM resulted in more closely balanced charge injection and transport. Single‐layer electrophosphorescent light‐emitting diodes (LEDs), fabricated from PFO, PFO–HTM and PFO–ETM as hosts and tris[2,5‐bis‐2′‐(9′,9′‐dihexylfluorene)pyridine‐κ²NC_3′]iridium(III ), Ir(HFP)₃ as the guest, emitted red light with brightnesses of 2040 cd m^–2, 1940 cd m^–2 and 2490 cd m^–2 at 290 mA cm^–2 (16 V) and with luminance efficiencies of 1.4 cd A^–1, 1.4 cd A^–1 and 1.8 cd A^–1 at 4.5 mA cm^–2 for PFO, PFO–HTM, and PFO–ETM, respectively.     

Implementation of RNS-Based Distributed Arithmetic Discrete Wavelet Transform Architectures Using Field-Programmable Logic

Currently there are design barriers inhibiting the implementation of high-precision digital signal processing (DSP) objects with field programmable logic (FPL) devices. This paper explores overcoming these barriers by fusing together the popular distributed arithmetic (DA) method with the residue number system (RNS) for use in FPL-centric designs. The new design paradigm is studied in the context of a high-performance filter bank and a discrete wavelet transform (DWT). The proposed design paradigm is facilitated by a new RNS accumulator structure based on a carry save adder (CSA). The reported methodology also introduces a polyphase filter structure that results in a reduced look-up table (LUT) budget. The 2C-DA and RNS-DA are compared, in the context of a FPL implementation strategy, using a discrete wavelet transform (DWT) filter bank as a common design theme. The results show that the RNS-DA, compared to a traditional 2C-DA design, enjoys a performance advantage that increases with precision (wordlength).     

A unified framework for off-line permutation routing in parallel networks

In this paper we present a general strategy for finding efficient permutation routes in parallel networks. Among the popular parallel networks to which the strategy applies are mesh networks, hypercube networks, hypercube-derivative networks, ring networks, and star networks. The routes produced are generally congestion-free and take a number of routing steps that is within a small constant factor of the diameter of the network. Our basic strategy is derived from an algorithm that finds (in polynomial time) efficient permutation routes for aproduct network, G×H, given efficient permutation routes forG andH. We investigate the use of this algorithm for routingmultiple permutations and extend its applicability to a wide class of graphs, including several families ofCayley graphs. Finally, we show that our approach can be used to find efficient permutation routes among the remaining live nodes infaulty networks.This research was supported in part by a grant from the NSF, Grant No. CCR-88-12567.     

Finite-element grid improvement by minimization of stiffness matrix trace

A new and simple method of finite-element grid improvement is presented. The objective is to improve the accuracy of the analysis. The procedure is based on a minimization of the trace of the stiffness matrix. For a broad class of problems this minimization is seen to be equivalent to minimizing the potential energy. The method is illustrated with the classical tapered bar problem examined earlier by Prager and Masur. Identical results are obtained.     

Technology Scapegoats and Policy Saviors

IEEE Security & Privacy's associate editor in chief discusses technology's role in identity fraud and identity theft.