How to construct identity-based signatures without the key escrow problem

The inherent key escrow problem is one of the main reasons for the slow adoption of identity-based cryptography. The existing solution for mitigating the key escrow problem is by adopting multiple Private Key Generators (PKGs). Recently, there was a proposal that attempted to reduce the trust of the PKG by allowing a malicious PKG to be caught if he reveals the user’s identity-based private key illegally. Nonetheless, the proposal does not consider that the PKG can simply decrypt the ciphertext instead of revealing the private key itself (in the case of identity-based encryption schemes). The aim of this paper is to present an escrow-free identity-based signature (IBS) scheme, in which the malicious PKG will be caught if it releases a signature on behalf of the user but signed by itself. We present a formal model to capture such a scheme and provide a concrete construction.     

随机采样的2DPCA人脸识别方法

在2DPCA的基础上提出一种随机采样的2DPCA人脸识别方法--RRS-2DPCA.同传统通过对特征或投影向量进行采样的方法不同的是,RRS-2DPCA(Row Random Sampling 2DPCA)将随机采样建立于图像的行向量集中,然后在行向量子集中执行2DPCA.在ORL、Yale和AR人脸数据集上进行实验,结果表明RRS-2DPCA不仅具很好的识别性能和运算效率,而且对参数具有很大的稳定性.另外针对2DPCA和RRS-2DPCA对光线、遮挡等不鲁棒问题,进一步提出了局部区域随机采样的2DPCA方法LRRS-2DPCA(Local Row Random Sampling 2DPCA),将RRS-2DPCA执行在人脸图像的局部区域中.实验结果表明LRRS-2DPCA不仅具有较好的鲁棒性更大大的提高了RRS-2DPCA的识别性能.     

Volatility dynamics of the US business cycle: A multivariate asymmetric GARCH approach

Most empirical investigations of the business cycles in the United States have excluded the dimension of asymmetric conditional volatility. This paper analyses the volatility dynamics of the US business cycle by comparing the performance of various multivariate generalised autoregressive conditional heteroskedasticity (GARCH) models. In particular, we propose two bivariate GARCH models to examine the evidence of volatility asymmetry and time-varying correlations concurrently, and then apply the proposed models to five sectors of Industrial Production of the United States. Our findings provide strong evidence of asymmetric conditional volatility in all sectors, and some support of time-varying correlations in various sectoral pairs. This has important policy implications for government to consider the effective countercyclical measures during recessions.     

Quart-parametric interpolations for intersecting paths

The intersecting path is an important tool path generation method. This paper proposes an approach for the quart-parametric interpolation of intersecting paths. The objective of our approach is that the intersecting paths for surface machining can be directly interpolated within the computer numerical control (CNC) system. This enables the CNC interpolator to process the intersecting paths without geometric approximation as in existing approaches and take into consideration any specific feedrate profiles and further machining dynamical issues along the path.The interpolation of the intersection of two general parametric surfaces is transferred into interpolation of its projection curves and the time trajectories of four parameters along the intersecting curves are obtained. Our strategy is to carry out the quart-parametric interpolation based on the projection interpolation. The feedrate control method is developed, and then the interpolation algorithms for two projection curves are proposed. An error reduction scheme is presented to alleviate point deviation from the drive parametric surface. Simulations of quart-parametric interpolation have been carried out to verify the effectiveness of the proposed algorithm.     

Developing a framework for analyzing IS sourcing

This paper develops a framework for the consideration of internal markets as an alternative to information systems (IS) outsourcing. It is based on an assessment of the pros and cons of both outsourcing and of insourcing based on the internal markets approach. It is formulated in terms of the operational, tactical, and strategic impacts of the choice among the alternatives. The framework, and the propositions that are developed from it, should be useful both for researchers, who can use it for developing testable research hypotheses, and for practitioners, who may use it as a basis for developing a comprehensive set of criteria for the evaluation of these sourcing options.     

Maxi-min margin machine: learning large margin classifiers locally and globally.

In this paper, we propose a novel large margin classifier, called the maxi-min margin machine M(4). This model learns the decision boundary both locally and globally. In comparison, other large margin classifiers construct separating hyperplanes only either locally or globally. For example, a state-of-the-art large margin classifier, the support vector machine (SVM), considers data only locally, while another significant model, the minimax probability machine (MPM), focuses on building the decision hyperplane exclusively based on the global information. As a major contribution, we show that SVM yields the same solution as M(4) when data satisfy certain conditions, and MPM can be regarded as a relaxation model of M(4). Moreover, based on our proposed local and global view of data, another popular model, the linear discriminant analysis, can easily be interpreted and extended as well. We describe the M(4) model definition, provide a geometrical interpretation, present theoretical justifications, and propose a practical sequential conic programming method to solve the optimization problem. We also show how to exploit Mercer kernels to extend M(4) for nonlinear classifications. Furthermore, we perform a series of evaluations on both synthetic data sets and real-world benchmark data sets. Comparison with SVM and MPM demonstrates the advantages of our new model.     

Incremental linear discriminant analysis for face recognition.

Dimensionality reduction methods have been successfully employed for face recognition. Among the various dimensionality reduction algorithms, linear (Fisher) discriminant analysis (LDA) is one of the popular supervised dimensionality reduction methods, and many LDA-based face recognition algorithms/systems have been reported in the last decade. However, the LDA-based face recognition systems suffer from the scalability problem. To overcome this limitation, an incremental approach is a natural solution. The main difficulty in developing the incremental LDA (ILDA) is to handle the inverse of the within-class scatter matrix. In this paper, based on the generalized singular value decomposition LDA (LDA/GSVD), we develop a new ILDA algorithm called GSVD-ILDA. Different from the existing techniques in which the new projection matrix is found in a restricted subspace, the proposed GSVD-ILDA determines the projection matrix in full space. Extensive experiments are performed to compare the proposed GSVD-ILDA with the LDA/GSVD as well as the existing ILDA methods using the face recognition technology face database and the Carneggie Mellon University Pose, Illumination, and Expression face database. Experimental results show that the proposed GSVD-ILDA algorithm gives the same performance as the LDA/GSVD with much smaller computational complexity. The experimental results also show that the proposed GSVD-ILDA gives better classification performance than the other recently proposed ILDA algorithms.     

Practical considerations for high spatial and temporal resolution dynamic transmission electron microscopy

Although recent years have seen significant advances in the spatial resolution possible in the transmission electron microscope (TEM), the temporal resolution of most microscopes is limited to video rate at best. This lack of temporal resolution means that our understanding of dynamic processes in materials is extremely limited. High temporal resolution in the TEM can be achieved, however, by replacing the normal thermionic or field emission source with a photoemission source. In this case the temporal resolution is limited only by the ability to create a short pulse of photoexcited electrons in the source, and this can be as short as a few femtoseconds. The operation of the photo-emission source and the control of the subsequent pulse of electrons (containing as many as 5 x 10(7) electrons) create significant challenges for a standard microscope column that is designed to operate with a single electron in the column at any one time. In this paper, the generation and control of electron pulses in the TEM to obtain a temporal resolution <10(-6)s will be described and the effect of the pulse duration and current density on the spatial resolution of the instrument will be examined. The potential of these levels of temporal and spatial resolution for the study of dynamic materials processes will also be discussed.     

Exploiting Network Locality for CC-NUMA Multiprocessors

The Journal of Supercomputing - Rapid advances in interconnection networks in multiprocessors are closing the gap between computation and communication. Given this trend, how can we utilize fast...     

Real time video frames allocation in mobile networks using cooperative pre-fetching

In this paper, we study the bandwidth allocation problem for serving video requests in a mobile real-time video player system. One of the main issues to maintain the quality of services (QoS) in mobile video playback is to ensure sufficient number of video frames available at the client side while a video is being played. However, due to the limited bandwidth of a mobile network and variable workload streaming video, this is not easy to achieve in practice. In addition, the communication link between mobile clients and a video server is subject to frequent errors and temporary disconnection. In this paper, we propose to use the notion of buffered bandwidth in addition to the network bandwidth to support real-time playback of videos at mobile clients. Based on this, we designed a bandwidth allocation scheme called Cooperative Pre-Fetching (CP) in which the amount of bandwidth to be allocated to serve a video request depends on the current buffer level of the video at the client relative to the target buffer level of the client. In determining the target buffer level, we consider the errors in communication to the client as well as the other clients who are concurrently served by the system. The buffered video frames at the clients are then used to minimize the impact of error in communications on the overall QoS of video playbacks in the whole system.