Various cryptosystems use exhaustive techniques to search the key space. Such search techniques should be guided in order to be computationally adequate. Here, a Genetic Algorithm, GA, is proposed for the cryptanalysi...
详细信息
Various cryptosystems use exhaustive techniques to search the key space. Such search techniques should be guided in order to be computationally adequate. Here, a Genetic Algorithm, GA, is proposed for the cryptanalysis of DES-like systems to find out the underlying key. The genetic algorithm approach is adopted, for obtaining the exact key by forming an initial population of keys that belong to the key subspace. In the proposed algorithms the premature convergence could be avoided by dynamic variation of control parameters that can affect the fitness function. In this paper a new method has been developed for the first time to break DES-like examples. These ex-amples include both DES and FEAL with eight rounds. The performance of the propsed method, as such, is con-siderably faster than exhaustive search and differential cryptanalysis, DC. Therefore, it can be directly applied to a variety of DES-like systems instead of the current DC techniques.
Reliable segmentation of a human airway tree from volumetric computer tomography (CT) data sets is the most important step for further analysis in many clinical applications such as diagnosis of bronchial tree patholo...
详细信息
There have been proposed several dynamic load-balancing methods for web server clusters. In order to realize an effective load-balancing, they have required an almost real-time server load information which could be o...
详细信息
Due to environmental mismatch, speech recognition systems often exhibit drastic performance degradation in noisy conditions. This paper presents a model-based technique termed Adaptive Parallel Model Combination (APMC...
详细信息
ISBN:
(纸本)9781424423149
Due to environmental mismatch, speech recognition systems often exhibit drastic performance degradation in noisy conditions. This paper presents a model-based technique termed Adaptive Parallel Model Combination (APMC) which compensates the initial acoustic models to reduce the discrepancy. APMC used the well-known PMC technique to composite a set of corrupted speech models, while fine tuning the mean parameter of the models using a transformation-based adaptation technique called Maximum Likelihood Spectral Transformation (MLST). Evaluated on a context-independent phone recognition task, APMC was found to be superior to both PMC and MLST, especially in non-stationary noisy conditions. On average, APMC has achieved 48.81% improvement over the initial models, whereas PMC and MLST have improved the accuracy by 34.12% and 35.23% respectively.
Java is widely used because its security and platform independence. Although Java's security model is designed for protecting users from untrusted sources, Java's security is not under fully control at the app...
详细信息
In this paper, we present a very high-capacity and low-distortion 3D steganography scheme. Our steganography approach is based on a novel multilayered embedding scheme to hide secret messages in the vertices of 3D pol...
详细信息
In this paper, we present a very high-capacity and low-distortion 3D steganography scheme. Our steganography approach is based on a novel multilayered embedding scheme to hide secret messages in the vertices of 3D polygon models. Experimental results show that the cover model distortion is very small as the number of hiding layers ranges from 7 to 13 layers. To the best of our knowledge, this novel approach can provide much higher hiding capacity than other state-of-the-art approaches, while obeying the low distortion and security basic requirements for steganography on 3D models.
There are many distributed, autonomous, heterogeneous and dynamic data sources in data sharing environment. In order to achieve the goal of global data sharing without compromising the security of local domain respect...
详细信息
Nowadays complex information system's integrated formal models of function verification and performance evaluation lack properties constraint about space aspect. This paper presents an integrated verification mode...
详细信息
Nowadays complex information system's integrated formal models of function verification and performance evaluation lack properties constraint about space aspect. This paper presents an integrated verification model atsFPM by defining a space requirement function over the states of the considered information system. The patterns of paths which are based on regular expressions is proposed in order to specify the functional specifications. The syntax and semantic of the model atsFPM is defined. A conversion product model is obtained by the combination of the system model and the automaton of the pattern of paths which expresses the functional specifications. The verification of the model atsFPM is tackled by the performance verification technique of Markov Reward Model. Experimental results show that the atsFPM model and its verification approach can satisfy the modeling of information system and verification of functional and performance specifications.
作者：
Chandrajit L. Bajaj徐国良张琴CVC
Department of Computer ScienceInstitute for Computational Engineering and Sciences University of Texas at Austin LSEC
Institute of Computational MathematicsAcademy of Mathematics and System Sciences Chinese Academy of Sciences School of Sciences
Beijing Information Science and Technology University
We present a general framework for a higher-order spline level-set （HLS） method and apply this to biomolecule surfaces construction. Starting from a first order energy functional, we obtain a general level set formu...
详细信息
We present a general framework for a higher-order spline level-set （HLS） method and apply this to biomolecule surfaces construction. Starting from a first order energy functional, we obtain a general level set formulation of geometric partial differential equation, and provide an efficient approach to solving this partial differential equation using a C2 spline basis. We also present a fast cubic spline interpolation algorithm based on convolution and the Z-transform, which exploits the local relationship of interpolatory cubic spline coefficients with respect to given function data values. One example of our HLS method is demonstrated their individual atomic coordinates which is the construction of biomolecule and solvated radii as prerequisites. surfaces （an implicit solvation interface） with
暂无评论