Triple DES is an algorithm that was chosen as a simple way to enlarge the DES key space without an immediate need to field a new symmetric encryption algorithm, while maintaining backward compatibility with legacy sys...
详细信息
Triple DES is an algorithm that was chosen as a simple way to enlarge the DES key space without an immediate need to field a new symmetric encryption algorithm, while maintaining backward compatibility with legacy systems. Eventhough, AES is the modern successor, some industries, like the electronic payments industry, still use TDES extensively and continues to develop and promulgate standards based upon it (e.g. EMV, available from EMVCo). This guarantees that TDES will remain an active cryptographic standard into the future. By design, DES and therefore TDES, suffer from slow performance in software;As a consequense TDES is better suited to hardware implementations, and this has motivated researchers to propose a variety of hardware implementations. Ccurrent trends imply that future networks will encrypt data at a low level, increasing the demand for high throughput, and are likely to be dominated by mobile terminals, thus, the power consumption and electromagnetic emissions aspects of encryption devices will be critical. This paper presents several realizations of one of the most widely used encryption algorithm, the DES/TripleDES, both in software and in hardware. We present software implementations of the algorithm running on two of the state-of-the-art Intel IXP network processors and several hardware realizations based on a standard-cell library. Moreover, by placing and routing those designs, we have also realized that the commercial ASIC synthesis tools cannot accurately predict the area and the performance of the placed & routed final netlist in such designs, since the ASIC implementations of the encrypted algorithms include a very large number of wires and a limited number of logic CMOS cells.
Despite 35 years of R&D on the problem of Optical character Recognition (OCR), the technology is not yet mature enough for the Arabic font-written script compared with Latin-based ones. There is still a wide room ...
详细信息
Despite 35 years of R&D on the problem of Optical character Recognition (OCR), the technology is not yet mature enough for the Arabic font-written script compared with Latin-based ones. There is still a wide room for enhancements as per: lowering the Word Error Rate "WER", standing robust in face of moderate noise, and working on an omni-font open-vocabulary basis. Among the best trials done in this regard so far comes the HMM-based ones. Elaborating on this Automatic Speech Recognition "ASR"-inspired promising approach, our team has significantly refined basic processes and modules deployed in such architectures "e.g. lines & words decomposition, features extraction, models parameters selection, language modelling, .., etc." to develop what is hoped to be a truly reliable "i.e. low WER, omni font-written, open-vocabulary, noise-robust, and responsive" Arabic OCR suitable for real-life IT applications. This paper extensively reviews the HMM-based approach for building Arabic font-written OCR's in general, and our work in specific. It also reports about the experimental results obtained so far showing that our system outperforms its rivals reported in the published literature.
Dirichlet Process (DP) mixture models are promising candidates for clustering applications where the number of clusters is unknown a priori. Due to computational considerations these models are unfortunately unsuitabl...
详细信息
ISBN:
(纸本)9780262195683
Dirichlet Process (DP) mixture models are promising candidates for clustering applications where the number of clusters is unknown a priori. Due to computational considerations these models are unfortunately unsuitable for large scale data-mining applications. We propose a class of deterministic accelerated DP mixture models that can routinely handle millions of data-cases. The speedup is achieved by incorporating kd-trees into a variational Bayesian algorithm for DP mixtures in the stick-breaking representation, similar to that of Blei and Jordan (2005). Our algorithm differs in the use of kd-trees and in the way we handle truncation: we only assume that the variational distributions are fixed at their priors after a certain level. Experiments show that speedups relative to the standard variational algorithm can be significant.
In this paper, a novel method for Cued Speech language recognition is proposed. A multimodal processing framework is developed for the efficient fusion of the modalities under consideration. The robust feature extract...
详细信息
We consider the combinatorial optimization problem of finding the most influential nodes on a large-scale social network for two widely-used fundamental stochastic diffusion models. It was shown that a natural greedy ...
详细信息
In Alternating-time Temporal Logic (ATL), one can express statements about the strategic ability of an agent (or a coalition of agents) to achieve a goal φ such as: "agent i can choose a strategy such that, if i...
详细信息
ISBN:
(纸本)9781450378413
In Alternating-time Temporal Logic (ATL), one can express statements about the strategic ability of an agent (or a coalition of agents) to achieve a goal φ such as: "agent i can choose a strategy such that, if i follows this strategy then, no matter what other agents do, φ will always be true". However, strategies in ATL are revocable in the sense that in the evaluation of the goal φ the agent i is no longer restricted by the strategy she has chosen in order to reach the state where the goal is evaluated. In this paper we consider alternative variants of ATL where strategies, on the contrary, are irrevocable. The difference between revocable and irrevocable strategies shows up when we consider the ability to achieve a goal which, again, involves (nested) strategic ability. Furthermore, unlike in the standard semantics of ATL, memory plays an essential role in the semantics based on irrevocable strategies.
The increasing complexity of modern telecommunication systems is one of the main issues encountered in most telecom products. Despite the plethora of methods and tools for efficient system design, verification and val...
详细信息
ISBN:
(纸本)9789630626705
The increasing complexity of modern telecommunication systems is one of the main issues encountered in most telecom products. Despite the plethora of methods and tools for efficient system design, verification and validation phases are still consuming significant part of the overall design time. The proposed approach outlines the use of the B method/language for producing correct-by-construction implementations of telecommunication systems. The method described is supported by appropriate tools that automate the process of proving that system properties are maintained during the various design stages. The feasibility of the latter is evaluated in practice through the design of a real world telecom application, borrowed from the domain of wireless telecommunication networks. Copyright 2007 ICST.
We define the canonical representative for the equivalence class consisting of all polynomial- and quadratic differential operators that take the same values on a given subspace of C∞(Rn,Rw). We also examine the rela...
详细信息
This paper describes annotations for the Corpus of Spontaneous Japanese. The information we annotated to the corpus includes morphemes, clause units, dependency structures, summaries, and discourse structures. They ar...
详细信息
This paper describes annotations for the Corpus of Spontaneous Japanese. The information we annotated to the corpus includes morphemes, clause units, dependency structures, summaries, and discourse structures. They are integrated in the form of XML. Morphological information was semi-automatically annotated to the transcribed text by reducing the human labor cost within the framework of morphological annotation that we proposed. Next, clause unites were detected based on the morphological information as basic units for our annotation. Then, dependency structures, summaries, discourse structures were annotated based on the clause units.
Previously, we have proposed a reverberation‐robust system for automatic speech recognition (ASR) based on a temporal masking principle. In the first pathway of this system, speech is analysed by a bank of auditory f...
Previously, we have proposed a reverberation‐robust system for automatic speech recognition (ASR) based on a temporal masking principle. In the first pathway of this system, speech is analysed by a bank of auditory filters, in order to provide acoustic features for the recogniser. In the second pathway, a bandpass modulation filter (1.5 Hz ‐ 8.2 Hz) detects regions of the envelope in each filter channel that contain strong speech energy. Regions of the modulation filter output that exceed a threshold are labelled as reliable evidence for the speech in a time‐frequency mask; regions that fall below the threshold are dominated by reverberation and labelled as unreliable. The acoustic features and time‐frequency mask are then decoded by a “missing data” ASR system. Here we describe modifications of this system that bring it into closer agreement with purported mechanisms of human perceptual compensation for reverberation, as determined by psychophysical studies [Watkins & Makin, JASA 121, 257‐266]. Specifically, we use a metric for identifying regions of reliable speech that gives greater emphasis to reverberation “tails,” and is computed independently for each frequency band. The performance of the system is evaluated on a corpus of spoken digits convolved with recorded room impulse responses.
暂无评论