Loading...
Search for:
standard-constructions
0.006 seconds
Mahak: A test collection for evaluation of farsi information retrieval systems
, Article 2007 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2007, Amman, 13 May 2007 through 16 May 2007 ; 2007 , Pages 639-644 ; 1424410312 (ISBN); 9781424410316 (ISBN) ; Abolhassani, H ; Neshati, M ; Behrangi, E ; Rostami, A ; Mohammadi Nasiri, M ; Sharif University of Technology
2007
Abstract
Currently there is no standard test collection for evaluation of Farsi information retrieval systems. In this paper we introduce Mahak, the first complete test collection generally available for evaluating Farsi information retrieval systems. We also discuss our construction process in detail. As a goal, we hope that Mahak will foster the development of Farsi information retrieval systems. © 2007 IEEE
A secure self-synchronized stream cipher
, Article Computer Journal ; Volume 61, Issue 8 , August , 2018 , Pages 1182-1201 ; 00104620 (ISSN) ; Mohebbipoor, F ; Sharif University of Technology
Oxford University Press
2018
Abstract
We follow two main objectives in this article. On the one hand, we introduce a security model called LORBACPA+ for self-synchronized stream ciphers which is stronger than the blockwise LOR-IND-CPA, where we show that standard constructions as delayed CBC or similar existing self-synchronized modes of operation are not secure in this stronger model. Then, on the other hand, following contributions of Millérioux et al., we introduce a new self-synchronized stream cipher and prove its security in LORBACPA+ model. © The British Computer Society 2018. All rights reserved
Objective Method
, M.Sc. Thesis Sharif University of Technology ; Haji Mirsadeghi, Mir Omid (Supervisor)
Abstract
In this thesis we introduce the objective method for solving combinatorial probability problems and combinatorial optimization. For introducing this method, we consider its application in solving problems such as graphs maximal partial matching problem. Then we introduce mean-field model, which has a close relationship with this method. Finally we use this method to discuss perfect mathching with minimal cost in complete graphs, and using obtaind theorems and concepts from solving this problem, like involution invariance and standard construction, we find an answer for random assigment problem, which is one of the most practical problems in the class of optimization problems