Geometry in preduals of spaces of 2-homogeneous polynomials on Hilbert spaces

Let H be a (real or complex) Hilbert space. Using spectral theory and properties of the Schatten–Von Neumann operators, we prove that every symmetric tensor of unit norm in HoH is an infinite absolute convex combination of points of the form xox with x in the unit sphere of the Hilbert space. We use this to obtain explicit characterizations of the smooth points of the unit ball of HoH .

Moving window kernel PCA for adaptive monitoring of nonlinear processes

This paper discusses the monitoring of complex nonlinear and time-varying processes. Kernel principal component analysis (KPCA) has gained significant attention as a monitoring tool for nonlinear systems in recent years but relies on a fixed model that cannot be employed for time-varying systems. The contribution of this article is the development of a numerically efficient and memory saving moving window KPCA (MWKPCA) monitoring approach. The proposed technique incorporates an up- and downdating procedure to adapt (i) the data mean and covariance matrix in the feature space and (ii) approximates the eigenvalues and eigenvectors of the Gram matrix. The article shows that the proposed MWKPCA algorithm has a computation complexity of O(N2), whilst batch techniques, e.g. the Lanczos method, are of O(N3). Including the adaptation of the number of retained components and an l-step ahead application of the MWKPCA monitoring model, the paper finally demonstrates the utility of the proposed technique using a simulated nonlinear time-varying system and recorded data from an industrial distillation column.

Algorithmic computation of knot polynomials of secondary structure elements of proteins

The classification of protein structures is an important and still outstanding problem. The purpose of this paper is threefold. First, we utilize a relation between the Tutte and homfly polynomial to show that the Alexander-Conway polynomial can be algorithmically computed for a given planar graph. Second, as special cases of planar graphs, we use polymer graphs of protein structures. More precisely, we use three building blocks of the three-dimensional protein structure-alpha-helix, antiparallel beta-sheet, and parallel beta-sheet-and calculate, for their corresponding polymer graphs, the Tutte polynomials analytically by providing recurrence equations for all three secondary structure elements. Third, we present numerical results comparing the results from our analytical calculations with the numerical results of our algorithm-not only to test consistency, but also to demonstrate that all assigned polynomials are unique labels of the secondary structure elements. This paves the way for an automatic classification of protein structures.

A Kernel Interleaved Scheduling Method for Streaming Applications on Soft-core Vector Processors

Massively parallel networks of highly efficient, high performance Single Instruction Multiple Data (SIMD) processors have been shown to enable FPGA-based implementation of real-time signal processing applications with performance and
cost comparable to dedicated hardware architectures. This is achieved by exploiting simple datapath units with deep processing pipelines. However, these architectures are highly susceptible to pipeline bubbles resulting from data and control hazards; the only way to mitigate against these is manual interleaving of
application tasks on each datapath, since no suitable automated interleaving approach exists. In this paper we describe a new automated integrated mapping/scheduling approach to map algorithm tasks to processors and a new low-complexity list scheduling technique to generate the interleaved schedules. When applied to a spatial Fixed-Complexity Sphere Decoding (FSD) detector
for next-generation Multiple-Input Multiple-Output (MIMO) systems, the resulting schedules achieve real-time performance for IEEE 802.11n systems on a network of 16-way SIMD processors on FPGA, enable better performance/complexity balance than current approaches and produce results comparable to handcrafted implementations.

Macroscopic limit of time-dependent density-functional theory for adiabatic local approximations of the exchange-correlation kernel

Time-dependent density-functional theory is a rather accurate and efficient way to compute electronic excitations for finite systems. However, in the macroscopic limit (systems of increasing size), for the usual adiabatic random-phase, local-density, or generalized-gradient approximations, one recovers the Kohn-Sham independent-particle picture, and thus the incorrect band gap. To clarify this trend, we investigate the macroscopic limit of the exchange-correlation kernel in such approximations by means of an algebraical analysis complemented with numerical studies of a one-dimensional tight-binding model. We link the failure to shift the Kohn-Sham spectrum of these approximate kernels to the fact that the corresponding operators in the transition space act only on a finite subspace.

Taguchi optimisation approach for production of activated carbon from phosphoric acid impregnated palm kernel shell by microwave heating

Taguchi method was applied to investigate the optimal operating conditions in the preparation of activated carbon using palm kernel shell with quadruple control factors: irradiation time, microwave power, concentration of phosphoric acid as impregnation substance and impregnation ratio between acid and palm kernel shell. The best combination of the control factors as obtained by applying Taguchi method was microwave power of 800 W, irradiation time of 17 min, impregnation ratio of 2, and acid concentration of 85%. The noise factor (particle size of raw material) was considered in a separate outer array, which had no effect on the quality of the activated carbon as confirmed by t-test. Activated carbon prepared at optimum combination of control factors had high BET surface area of 1,473.55 m² g-1 and high porosity. The adsorption equilibrium and kinetic data can satisfactorily be described by the Langmuir isotherm and a pseudo-second-order kinetic model, respectively. The maximum adsorbing capacity suggested by the Langmuir model was 1000 mg g-1.

Kernel-based local order estimation of nonlinear nonparametric systems

We consider the local order estimation of nonlinear autoregressive systems with exogenous inputs (NARX), which may have different local dimensions at different points. By minimizing the kernel-based local information criterion introduced in this paper, the strongly consistent estimates for the local orders of the NARX system at points of interest are obtained. The modification of the criterion and a simple procedure of searching the minimum of the criterion, are also discussed. The theoretical results derived here are tested by simulation examples.