Worcester Polytechnic Institute

About: Worcester Polytechnic Institute is a education organization based out in Worcester, Massachusetts, United States. It is known for research contribution in the topics: Population & Data envelopment analysis. The organization has 6270 authors who have published 12704 publications receiving 332081 citations. The organization is also known as: WPI.

Fuzzy Keyword Search over Encrypted Data in Cloud Computing

Abstract: As Cloud Computing becomes prevalent, more and more sensitive information are being centralized into the cloud. For the protection of data privacy, sensitive data usually have to be encrypted before outsourcing, which makes effective data utilization a very challenging task. Although traditional searchable encryption schemes allow a user to securely search over encrypted data through keywords and selectively retrieve files of interest, these techniques support only exact keyword search. That is, there is no tolerance of minor typos and format inconsistencies which, on the other hand, are typical user searching behavior and happen very frequently. This significant drawback makes existing techniques unsuitable in Cloud Computing as it greatly affects system usability, rendering user searching experiences very frustrating and system efficacy very low. In this paper, for the first time we formalize and solve the problem of effective fuzzy keyword search over encrypted cloud data while maintaining keyword privacy. Fuzzy keyword search greatly enhances system usability by returning the matching files when users' searching inputs exactly match the predefined keywords or the closest possible matching files based on keyword similarity semantics, when exact match fails. In our solution, we exploit edit distance to quantify keywords similarity and develop an advanced technique on constructing fuzzy keyword sets, which greatly reduces the storage and representation overheads. Through rigorous security analysis, we show that our proposed solution is secure and privacy-preserving, while correctly realizing the goal of fuzzy keyword search.

Profitability and Marketability of the Top 55 U.S. Commercial Banks

Abstract: Utilizing recent developments in data envelopment analysis (DEA), this paper examines the performance of the top 55 U.S. commercial banks via a two-stage production process that separates profitability and marketability. Substantial performance inefficiency is uncovered in both dimensions. Relatively large banks exhibit better performance on profitability, whereas smaller banks tend to perform better with respect to marketability. New contextdependent performance measures are defined for profitability and marketability which employ a DEA stratification model and a DEA attractiveness measure. When combined with the original DEA measure, the context-dependent performance measure better characterizes the profitability and marketability of 55 U.S. commercial banks. The new approach identifies areas for improved bank performance over the two-stage production process. The effect of acquisition on efficiency and attractiveness is also examined.

Monte Carlo Estimation of Bayesian Credible and HPD Intervals

Abstract: This article considers how to estimate Bayesian credible and highest probability density (HPD) intervals for parameters of interest and provides a simple Monte Carlo approach to approximate these Bayesian intervals when a sample of the relevant parameters can be generated from their respective marginal posterior distribution using a Markov chain Monte Carlo (MCMC) sampling algorithm. We also develop a Monte Carlo method to compute HPD intervals for the parameters of interest from the desired posterior distribution using a sample from an importance sampling distribution. We apply our methodology to a Bayesian hierarchical model that has a posterior density containing analytically intractable integrals that depend on the (hyper) parameters. We further show that our methods are useful not only for calculating the HPD intervals for the parameters of interest but also for computing the HPD intervals for functions of the parameters. Necessary theory is developed and illustrative examples—including a si...

Uniform Design: Theory and Application

Abstract: A uniform design (UD) seeks design points that are uniformly scattered on the domain. It has been popular since 1980. A survey of UD is given in the first portion: The fundamental idea and construction method are presented and discussed and examples are given for illustration. It is shown that UD's have many desirable properties for a wide variety of applications. Furthermore, we use the global optimization algorithm, threshold accepting, to generate UD's with low discrepancy. The relationship between uniformity and orthogonality is investigated. It turns out that most UD's obtained here are indeed orthogonal.