Collaborative representation with reduced residual for face recognition

Collaboration representation-based classification (CRC) was proposed as an alternative approach to the sparse representation method with similar efficiency. The CRC is essentially a competition scheme for the training samples to compete with each other in representing the test sample, and the training class with the minimum representation residual from the test sample wins the competition in the classification. However, the representation error is usually calculated based on the Euclidean distance between a test sample and the weighted sum of all the same-class samples. This paper exploits alternative methods of calculating the representation error in the CRC methods to reduce the representation residual in a more optimal way, so that the sample classes compete with each other in a closer range to represent the test sample. A large number of face recognition experiments on three face image databases show that the CRC methods with optimized presentation residual achieve better performance than the original CRC, and the maximum improvement in classification accuracy is up to 12 %.     

Smart pricing scheme: A multi-layered scoring rule application

Defining appropriate pricing strategy for smart environment is important and complex task at the same time. It holds the primal fraction in Demand Response (DR) program. In our work, we devise an incentive based smart dynamic pricing scheme for consumers facilitating a multi-layered scoring rule. The proposed strategy characterizes both incentive based DR and price based DR programs facilities. This mechanism is applied between consumer agents (CA) to electricity provider agent (EP) and EP to Generation Company (GENCO). Based on the Continuous Ranked Probability Score (CRPS), a hierarchical scoring system is formed among these entities, CA–EP–GENCO. As CA receives the dynamic day-ahead pricing signal from EP, it will schedule the household appliances to lower price period and report the prediction in a form of a probability distribution function to EP. EP, in similar way reports the aggregated demand prediction to GENCO. Finally, GENCO computes the base discount after running a cost-optimization problem. GENCO will reward EP with a fraction of discount based on their prediction accuracy. EP will do the same to CA based on how truthful they were reporting their intentions on device scheduling. The method is tested on real data provided by Ontario Power Company and we show that this scheme is capable to reduce energy consumption and consumers’ payment.     

Double auction mechanisms on Markovian networks

This paper studies the double auction (DA) mechanism in Ma and Li (2011) for a class of exchange economies. We extend their results to more general cases where sellers and buyers each form a complex time non-homogeneous Markovian chain, as specified in Ram et al. (2009), in the communication of their private information. A numerical example is also provided. Both bubbles and crashes are observed in the example, consistent with results of our theorems. Our example and theoretical results provide new evidence that a DA mechanism, widely utilized in real exchange markets, may contribute to the excess volatility identified in Shiller (1981) and LeRoy and Porter (1981).     

基于个性诊断的路段缺失速度值估计

针对基于GPS的浮动车技术因无法做到对路网的时空间全覆盖导致部分路段实时交通状态缺失问题,提出基于热门路段个性化诊断(personality diagnosis base on popular road,PDPR)模型对各路段上的缺失速度值进行估计。使用K均值算法对所有原始数据作离散化处理,根据数据覆盖率对路段进行分类;以高覆盖率路段的速度数据为辅助,使用个性诊断算法(personality diagnosis,PD)对低覆盖率路段进行缺失速度估计,把估计值映射到连续型空间。实验结果表明,PDPR模型估计误差比PPCA(probabilistic principal component analysis)算法低32.84%,比滑动平均法低5.70%。     

基于直方图的水墨画艺术风格研究

基于内容的照片或自然图像分析和检索已经得到广泛的研究,但多数都基于颜色特征,不能直接用于水墨画艺术作品的分析。对图像进行预处理,提出基于灰度直方图描述水墨画笔道力度分布信息及构图风格,并利用神经网络学习水墨画整体技法风格特征,依据此特征进行不同艺术家间的分类。实验结果表明,通过对整体风格特征的提取,直方图模型能够有效表征画家不同的艺术风格,实现了水墨画的自动分类。     

案例式教学法在《Access数据库》教学中的应用研究

作为一门重要的数据库基础课程,《Access数据库》的教学不但可以使学生学会一种数据库技术,而且还能够奠定学生将来学习高级数据库技术的基础,因此,将案例式教学法应用《Access数据库》教学中具有重大的实际意义。为此,对案例式教学法的内涵进行阐述,《Access数据库》教学中案例式教学法的实际应用策略,以及应用案例式教学法需要注意的一系列事项。     

城市慢行交通网络数据建模研究

城市慢行交通系统是现代城市交通系统的重要组成部分,随着多模式城市交通发展,建立便捷和高效的城市慢行交通网络系统成为现代城市解决交通问题和提升交通运行效率的关键措施。基于此,文中应用统一建模语言（UML）和地理标识语言（GML）建立城市慢行交通网络数据模型,提出一种统一的和一致性的交通地理要素定义和性质描述方法,并阐述基于GML的城市慢行交通网络的地理要素和关系表达。研究成果促进了城市交通地理数据的组织、表达、集成、共享和操作,对建立高效的城市慢行交通网络系统具有重要的理论价值。     

State estimation for complex systems with randomly occurring nonlinearities and randomly missing measurements

This paper is concerned with the state estimation problem for the complex networked systems with randomly occurring nonlinearities and randomly missing measurements. The nonlinearities are included to describe the phenomena of nonlinear disturbances which exist in the network and may occur in a probabilistic way. Considering the fact that probabilistic data missing may occur in the process of information transmission, we introduce the randomly data missing into the sensor measurements. The aim of this paper is to design a state estimator to estimate the true states of the considered complex network through the available output measurements. By using a Lyapunov functional and some stochastic analysis techniques, sufficient criteria are obtained in the form of linear matrix inequalities under which the estimation error dynamics is globally asymptotically stable in the mean square. Furthermore, the state estimator gain is also obtained. Finally, a numerical example is employed to illustrate the effectiveness of the proposed state estimation conditions.     

On the complexity of role updating feasibility problem in RBAC

In Role Based Access Control (RBAC) systems, it is necessary and important to update the role–permission assignments in order to reflect the evolutions of the system transactions. However, role updating is generally complex and challenging, especially for large-scale RBAC systems. This is because the resulting state is usually expected to meet various requirements and constraints. In this paper, we focus on a fundamental problem of role updating in RBAC, which determines whether there exists a valid role–permission assignment, i.e., whether it can satisfy all the requirements of the role updating and without violating any role–capacity or permission–capacity constraint. We formally define such a problem as the Role Updating Feasibility Problem (RUFP), and study the computational complexity of RUFP in different subcases. Our results show that although several subcases are solvable in linear time, this problem is NP-complete in the general case.     

The clustering-based case-based reasoning for imbalanced business failure prediction: a hybrid approach through integrating unsupervised process with supervised process

Case-based reasoning (CBR) is one of the main forecasting methods in business forecasting, which performs well in prediction and holds the ability of giving explanations for the results. In business failure prediction (BFP), the number of failed enterprises is relatively small, compared with the number of non-failed ones. However, the loss is huge when an enterprise fails. Therefore, it is necessary to develop methods (trained on imbalanced samples) which forecast well for this small proportion of failed enterprises and performs accurately on total accuracy meanwhile. Commonly used methods constructed on the assumption of balanced samples do not perform well in predicting minority samples on imbalanced samples consisting of the minority/failed enterprises and the majority/non-failed ones. This article develops a new method called clustering-based CBR (CBCBR), which integrates clustering analysis, an unsupervised process, with CBR, a supervised process, to enhance the efficiency of retrieving information from both minority and majority in CBR. In CBCBR, various case classes are firstly generated through hierarchical clustering inside stored experienced cases, and class centres are calculated out by integrating cases information in the same clustered class. When predicting the label of a target case, its nearest clustered case class is firstly retrieved by ranking similarities between the target case and each clustered case class centre. Then, nearest neighbours of the target case in the determined clustered case class are retrieved. Finally, labels of the nearest experienced cases are used in prediction. In the empirical experiment with two imbalanced samples from China, the performance of CBCBR was compared with the classical CBR, a support vector machine, a logistic regression and a multi-variant discriminate analysis. The results show that compared with the other four methods, CBCBR performed significantly better in terms of sensitivity for identifying the minority samples and generated high total accuracy meanwhile. The proposed approach makes CBR useful in imbalanced forecasting.