开源RTOS T-Kernel在Blackfin处理器上的移植

随着嵌入式计算技术的飞速发展,多种功能强大的微处理器和相应嵌入式操作系统也相继问世。选择合适的嵌入式操作系统和处理器平台进行移植成为嵌入式开发的重要技术环节。本文介绍了开源嵌入式实时操作系统RTOS(Real Time Operating System)T-Kernel和Blackfin(BF)533处理器及其开发环境VisualDSP++4.5Environment,给出了中断管理、任务切换和系统调用入口三个模块的移植方法,并讨论了相应的系统稳定性和实时性测试方法。日本T-Engine组织推出的T-Kernel RTOS拥有高实时性、小体积的内核,并强调对底层处理器全面封装;ADI Blackfin系列微处理器同时具有DSP和MCU的特点,非常适合于移植RTOS。因此T-Kernel在BF533上的移植是一个典型的开发应用实例,其移植分析方法对于其他嵌入式RTOS移植也具有参考价值。

Active Hidden Models for Tracking with Kernel Projections

We introduce Active Hidden Models (AHM) that utilize kernel methods traditionally associated with classification. We use AHMs to track deformable objects in video sequences by leveraging kernel projections. We introduce the "subset projection" method which improves the efficiency of our tracking approach by a factor of ten. We successfully tested our method on facial tracking with extreme head movements (including full 180-degree head rotation), facial expressions, and deformable objects. Given a kernel and a set of training observations, we derive unbiased estimates of the accuracy of the AHM tracker. Kernels are generally used in classification methods to make training data linearly separable. We prove that the optimal (minimum variance) tracking kernels are those that make the training observations linearly dependent.

The abelianization of the Johnson kernel

We prove that the first complex homology of the Johnson subgroup of the Torelli group Tg is a non-trivial, unipotent Tg-module for all g ≥ 4 and give an explicit presentation of it as a Sym H 1(Tg,C)-module when g ≥ 6. We do this by proving that, for a finitely generated group G satisfying an assumption close to formality, the triviality of the restricted characteristic variety implies that the first homology of its Johnson kernel is a nilpotent module over the corresponding Laurent polynomial ring, isomorphic to the infinitesimal Alexander invariant of the associated graded Lie algebra of G. In this setup, we also obtain a precise nilpotence test. © European Mathematical Society 2014.

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.

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.

Kernel based approaches to local nonlinear non-parametric variable selection

In this paper, we consider the variable selection problem for a nonlinear non-parametric system. Two approaches are proposed, one top-down approach and one bottom-up approach. The top-down algorithm selects a variable by detecting if the corresponding partial derivative is zero or not at the point of interest. The algorithm is shown to have not only the parameter but also the set convergence. This is critical because the variable selection problem is binary, a variable is either selected or not selected. The bottom-up approach is based on the forward/backward stepwise selection which is designed to work if the data length is limited. Both approaches determine the most important variables locally and allow the unknown non-parametric nonlinear system to have different local dimensions at different points of interest. Further, two potential applications along with numerical simulations are provided to illustrate the usefulness of the proposed algorithms.