Multiple Empirical Kernel Learning with Majority Projection for imbalanced problems

Traditional Multiple Empirical Kernel Learning (MEKL) expands the expressions of the sample and brings better classification ability by using different empirical kernels to map the original data space into multiple kernel spaces. To make MEKL suit for the imbalanced problems, this paper introduces a weight matrix and a regularization term into MEKL. The weight matrix assigns high misclassification cost to the minority samples to balanced misclassification cost between minority and majority class. The regularization term named Majority Projection (MP) is used to make the classification hyperplane fit the distribution shape of majority samples and enlarge the between-class distance of minority and majority class. The contributions of this work are: (i) assigning high cost to minority samples to deal with imbalanced problems, (ii) introducing a new regularization term to concern the property of data distribution, (iii) and modifying the original PAC-Bayes bound to test the error upper bound of MEKL-MP. Through analyzing the experimental results, the proposed MEKL-MP is well suited to the imbalanced problems and has lower generalization risk in accordance with the value of PAC-Bayes bound.     

User activities and the heterogeneity of urban space:The case of Dahiyat Al Hussein park

Urban researchers have maintained a constant interest in the complexity and continuity of urban space usage. Some have applied actor–network theory (ANT) to investigate the heterogeneity of spaces and present them through the networks of their users’ activities. However, these accounts are predominantly limited in examining the extent to which these spaces may be heterogeneous when exploring such networks. This paper draws on recent ANT scholarship, which employs an ethnographic research conducted in a main park in a housing project at Dahiyat Al Hussein in Amman, Jordan. The findings describe the complex and unpredictable negotiations that occur within spaces by documenting the varieties and interrelations among user activity networks within this common and shared urban space. This research reveals the extent to which spaces, parks in this case, may be heterogeneous by unpacking their usage. The conclusions and insights assert the necessity of paying attention to design detail and creating designs that are responsive to evolving user activities.     

Kernel-based fourth-order diffusion for image noise removal

The fourth-order partial differential equations have good performance on noise smoothing and edge preservation without creating blocky effects on smooth regions. However, for low signal-to-noise ratio images, the discrimination between edges and noise is a challenging problem. A novel kernel-based fourth-order diffusion is proposed in this paper. It introduces a kernelized gradient operator in the fourth-order diffusion process, which leads to more effective noise removal capability. Experiment results show that this method outperforms several previous anisotropic diffusion methods for noise removal and edge preservation.     

应用时频分析方法辨识时变系统的模态参数

应用Gabor展开及Hilbert变换进行时变线性系统模态参数的辨识。利用非平稳信号的Gabor变换将结构响应信号表示在时频面上，并通过Gabor展开重构分离模态分量，建立每一阶模态的时变线性模型。对单模态时变线性模型应用Hilbert变换来辨识随时间变化的模态频率和阻尼。通过对刚度和阻尼慢变的两自由度系统模态参数的仿真辨识验证辨识方法的有效性。仿真结果表明：本文方法为时变线性系统的模态参数辨识提供了一条新的途径。     

面阵凝视型成像空间应用技术

介绍了凝视型成像技术的特点、优势、现状和发展趋势，论述了凝视型成像技术应用于遥感领域发展的重要性，总结了面阵凝视型成像技术作为空间应用所涵盖的关键技术，将为我国空间凝视型成像技术的进一步发展提供参考。     

基于保护分散式抽象方法的可扩展操作系统设计

为了提供高性能和柔性，操作系统内核应该只保留最小的功能，今天的操作系统大而低效，更缺乏柔性，我们提出了保护分散式操作系统抽象方法，集成了分散式操作系统抽象和保护抽象的方法，这种新的安全方式在分散式抽象系统里共享用户级的抽象，能够使非特权，不信任的任务在运行时定义并安全的共享生成的抽象，它在对相同的抽象重复调用时，通过消除上下文切换的需求和对通常情况进行优化，可获得较好的柔性，保护分散式抽象的设计强调简单并正确性证明，易于理解和使用，文章介绍了保护分散式操作系统抽象方法，并运用该方法开发了一个基于共享库的原型操作系统－ExLinux/LibOS.     

A stochastic realization algorithm via block LQ decomposition in Hilbert space

A stochastic realization problem of a stationary stochastic process is re-visited, and a new stochastically balanced realization algorithm is derived in a Hilbert space generated by second-order stationary processes. The present algorithm computes a stochastically balanced realization by means of the singular value decomposition of a weighted block Hankel matrix derived by a “block LQ decomposition”. Extension to a stochastic subspace identification method explains how the proposed abstract algorithm is implemented in system identification.     

Assessing continuous bivariate effects among different groups through nonparametric regression models: An application to breast cancer detection

In many applications, the joint effect of two continuous covariates on the target binary response may vary across groups defined by levels of a given factor. A testing procedure that would enable this type of surface-by-factor interactions to be detected has been designed. To accomplish this goal, a logistic generalized additive model (GAM) with bivariate continuous interactions varying across groups defined by levels of a factor is considered. A local scoring algorithm based on local linear kernel smoothers was implemented to estimate the proposed logistic GAM. Bootstrap resampling techniques were used for the purpose of testing for factor-by-surface interactions. Given the high computational cost involved, binning techniques were used to speed up computation in the estimation and testing processes. The adequacy of the bootstrap-based test was assessed by means of a simulation study. If a factor-by-surface interaction is detected in the model, it is then established that the use of the odds-ratio curves is very useful in obtaining a direct interpretation of the fitted model. The benefits of using this methodology when analyzing real data are illustrated by applying the technique to the outputs produced by a computerized system dedicated to the early detection of breast cancer.     

High training set size reduction by space partitioning and prototype abstraction

Instance-based learning methods like the nearest neighbour classifier generally suffer from the indiscriminate storage of all training instances, resulting in large memory requirements and slow execution speed. In this paper, new training set size reduction methods based on prototype generation and space partitioning are proposed. Experimental results show that the new algorithms achieve a very high reduction rate with still an important classification accuracy.