218270
Cryptanalysis of a multistage encryption system
This paper analyzes the security of a new multistage encryption system (MES) recently proposed in ISCAS'2004. It is found that MES is insecure against a differential chosen-plaintext/ciphertext attack. Experiments are given to support the proposed attack. It is also pointed out that the security of MES against brute-force attacks is not sufficiently high.
2501834
On the security of the Yen-Guo's domino signal encryption algorithm (DSEA)
Recently, a new domino signal encryption algorithm (DSEA) was proposed for digital signal transmission, especially for digital images and videos. This paper analyzes the security of DSEA, and points out the following weaknesses: (1) its security against the brute-force attack was overestimated; (2) it is not sufficiently secure against ciphertext-only attacks, and only one ciphertext is enough to get some information about the plaintext and to break the value of a sub-key; (3) it is insecure against known/chosen-plaintext attacks, in the sense that the secret key can be recovered from a number of continuous bytes of only one known/chosen plaintext and the corresponding ciphertext. Experimental results are given to show the performance of the proposed attacks, and some countermeasures are discussed to improve DSEA.
3106412
On the Design of Perceptual MPEG-Video Encryption Algorithms
In this paper, some existing perceptual encryption algorithms of MPEG videos are reviewed and some problems, especially security defects of two recently proposed MPEG-video perceptual encryption schemes, are pointed out. Then, a simpler and more effective design is suggested, which selectively encrypts fixed-length codewords in MPEG-video bit streams under the control of three perceptibility factors. The proposed design is actually an encryption configuration that can work with any stream cipher or block cipher. Compared with the previously-proposed schemes, the new design provides more useful features, such as strict size-preservation, on-the-fly encryption and multiple perceptibility, which make it possible to support more applications with different requirements. In addition, four different measures are suggested to provide better security against known/chosen-plaintext attacks
2190827
Chosen-Plaintext Cryptanalysis of a Clipped-Neural-Network-Based Chaotic Cipher
At ISNN'04, a novel symmetric cipher was proposed, by combining a chaotic signal and a clipped neural network (CNN) for encryption. The present paper analyzes the security of this chaotic cipher against chosen-plaintext attacks, and points out that this cipher can be broken by a chosen-plaintext attack. Experimental analyses are given to support the feasibility of the proposed attack.
6261034
An Economic Model of User Rating in an Online Recommender System
Economic modeling provides a formal mechanism to understand user incentives and behavior in online systems. In this paper we describe the process of building a parameterized economic model of user-contributed ratings in an online movie recommender system. We constructed a theoretical model to formalize our initial understanding of the system, and collected survey and behavioral data to calibrate an empirical model. This model explains 34% of the variation in user rating behavior. We found that while economic modeling in this domain requires an initial understanding of user behavior and access to an uncommonly broad set of user survey and behavioral data, it returns significant formal understanding of the activity being modeled.
1290713
NMPP: a user-customized NimbleGen microarray data processing pipeline
UNLABELLED
NMPP package is a bundle of user-customized tools based on established algorithms and methods to process self-designed NimbleGen microarray data. It features a command-line-based integrative processing procedure that comprises five major functional components, namely the raw microarray data parsing and integrating module, the array spatial effect smoothing and visualization module, the probe-level multi-array normalization module, the gene expression intensity summarization module and the gene expression status inference module.


AVAILABILITY
http://plantgenomics.biology.yale.edu/nmpp
16791890
JComp: A Reuse-Driven Componentization Framework for Java Applications
Program componentization has been proved to be an effective way to increase the speed and cost-effectiveness of reusing, maintaining, and understanding existing software systems. JComp is a componentization framework that supports semi-automatically extracting reusable components from an existing Java system and automatically transforming the existing system into a component-based system. Based on the automated class dominance analysis and domain knowledge, JComp introduces a novel technique to incrementally identify reusable components in a low cost but high precision way. Also, JComp provides a methodology to automate the transformation of existing object-oriented systems into component-based systems
1387754
A Service-Oriented Componentization Framework for Java Software Systems
In the fast growing global market for services, service-oriented computing has drastically changed the way in which we develop software systems. Providing competitive services to these markets will be critical to the success of businesses and organizations. Some competitive services have already been implemented in existing systems. In this paper, we present a novel service-oriented componentization framework that automatically supports: i) identifying critical business services embedded in an existing Java system by utilizing graph representations of the system models, ii) realizing each identified service as a self-contained component that can be deployed as a single unit, and iii) transforming the object-oriented design into a service-oriented architecture. A toolkit implementing our framework has been developed as an Eclipse rich client platform (RCP). Our initial evaluation has shown that our framework is effective in identifying services from an object-oriented design and migrating it to a service-oriented architecture
20338082
Guaranteed Cost Control of Networked Control Systems: An LMI Approach
In this paper, networked control systems (NCS) is modeled as a discrete-time linear state-delayed system with norm-bounded uncertainty. Inspired by the so-called descriptor model transformation, a delay-dependent sufficient condition for the existence of a guaranteed cost controller for NCS is presented by a set of linear matrix inequalities (LMIs). The resulting controller can not only asymptotically stabilize the system but also guarantee an adequate level of performance. Theoretical analysis and illustrative results show that the control strategy presented in this paper is effective and feasible.