83,687 Hits in 7.8 sec

"Give Me Letters 2, 3 and 6!": Partial Password Implementations and Attacks [chapter]

David Aspinall, Mike Just
2013 Lecture Notes in Computer Science  
A partial password is a query of a subset of characters from a full password, posed as a challenge such as "Give me letters 2, 3 and 6 from your password".  ...  In this paper we survey a number of online banking implementations of partial passwords, and investigate the security of the mechanism.  ...  We're grateful to a student helper who spent several months gathering the survey data used in Section 2 and to Ronald Bowes for hosting some of the password sources we used on his blog [18] .  ... 
doi:10.1007/978-3-642-39884-1_11 fatcat:ajurakvmmbgpflw7hcgjzd6giu

CJN volume 6 issue 3 Cover and Front Matter

1979 Canadian Journal of Neurological Sciences  
The third topic will deal with "Neurobiological Basis of Epilepsy" (Co-ordinator: H. Doose), with a Round Table on "Genetics of Epileptic susceptibility" (Chairmen: H.  ...  Doose, with the participation of E. Andermann, D. Janz, J. Heijbel, J. Majkowski and S. Giaquinto). The fourth topic will be held on "Advances in drug treatment" ( INDEX TO ADVERTISEMENTS  ...  An optimum dose of 3 to 5 tablets a day divided into 4 to 6 doses.  ... 
doi:10.1017/s0317167100023921 fatcat:2ewbndenyrdpfd5d6r4yhdzeg4

Enhancing Cost and Security of Arabic SMS Messages over Mobile Phone Network

Abdullah Abdullah
2009 ˜Al-œRafidain journal for computer sciences and mathematics  
This work succeeded to overcome small size limitation of the SMS message by changing Arabic characters coding from Unicode to Base64 coding scheme and developing a runt version of lossless Huffman coding  ...  Compression is required for saving the transmission energy or to use bandwidth in an efficient manner in addition to save the user money while the end-to-end effective encryption is required for security  ...  Store Header data which consist of three parts as in Table 4 : • USV (size = 64 bits). • FFS value (size = 6 bits). • RFT (size = (FFS * n) bits V.  ... 
doi:10.33899/csmj.2009.163826 fatcat:nt2chz7hbzg67knbiw744e2rvu

Modern Applied Science, Vol. 3, No. 6, June 2009, all in one file, Part A

Editor MAS
2009 Modern Applied Science  
Acknowledgements First and foremost, I would like to thank Marie Redmond for her guidance during my MSc period at the Department of Computer Science.  ...  ) as well as to School of Manufacturing Engineering, Universiti Malaysia Perlis and UTM for providing research facilities to undertake this work.  ...  Figure 3 . 3 the diagram of virtual sound combination based on HRTF auto Figure 4 . 4 Left ear HRTF (N=6). Figure 5 . 5 Right ear HRTF (N=6). Figure 6 . 6 Left ear HRTF (N=12).  ... 
doi:10.5539/mas.v3n6p0a fatcat:dmlmamahxndkhjrxqqixuoflfy

3-Query Locally Decodable Codes of Subexponential Length

Klim Efremenko
2012 SIAM journal on computing (Print)  
In this paper we give an unconditional 3-query LDC construction with shorter codeword length of exp(exp(O( √ log n log log n))).  ...  In recent work [Yek08] Yekhanin constructs a 3-query LDC with sub-exponential length of size exp(exp(O( log n log log n ))).  ...  An immediate corollary from this example and Theorem 3.6 is 3-query LDC. Theorem 3.8. There exists a (3, δ, 3δ) locally decodable code of length exp(exp(O( √ log n log log n))).  ... 
doi:10.1137/090772721 fatcat:a5hjtma7zvg6bniyopspahavvy

Entropy of Tamil prose

Gift Siromoney
1963 Information and Control  
Kibble of Heriot-Watt College, Edinburgh and late Dr. R. P. Sethu Pillai, Professor of Tamil, University of Madras, for their valuable help at the initial stages of the work.  ...  Other codes which are not optimum, may be constructed, using the given values of the p's. 3 7 7 87 74 73 5 5 6 19 24 22 14 11 11 29 30 29 14 13 13 9 9 12 0 0 0 56 71 67  ...  Following Huffman (1952) , an optimum binary code is construtted and tabulated. The average number of binary digits per symbol is 4.44 compared to 4.34, the value of H~.  ... 
doi:10.1016/s0019-9958(63)90354-1 fatcat:4issjv2dnnajfnwd4hyp3kifjq

Locally Decodable Codes

Sergey Yekhanin
2011 Foundations and Trends® in Theoretical Computer Science  
Locally decodable codes are a class of "error-correcting codes". Errorcorrecting codes help ensure reliability when transmitting information over noisy channels.  ...  if a certain fraction of the codeword bits are corrupted.  ...  Acknowledgements Acknowledgements We would like to thank Parikshit Gopalan for carefully reading a draft of this survey and providing detailed and helpful comments.  ... 
doi:10.1561/0400000030 fatcat:pthtiolxsre4pciwckjyl5oodq

Natural Area Coding Based Postcode Scheme

Valentin Rwerekane, Maurice Ndashimye
2017 International Journal of Computer and Communication Engineering  
As such, a city is divided up into concentric rectangles of which sizes vary from one to three level 3 NAC cells, each NAC cell containing approximately 30×30 plots of 20×50 m 2 .  ...  The technique used in this paper can be tailored to a city of any size.  ...  A 4-letter code can be used to cover a territory of 100 km 2 and a 6-letter code can cover a 250,000 km 2 approximately.  ... 
doi:10.17706/ijcce.2017.6.3.161-172 fatcat:nadttxs2jngklpt4fodz6oy3su

Non-Coherent MIMO Scheme Based on OFDM-MFSK

Evgeny Tsimbalo, Robert J. Piechocki, Andrew Nix, Paul Thomas
2017 IEEE Wireless Communications Letters  
Simulation results demonstrate an up to 8 dB coding gain of the proposed scheme over single-antenna OFDM-MFSK.  ...  For the resulting scheme, we develop a novel optimal non-coherent detector that produces soft bit information for a state-of-the-art error correction decoder.  ...  alphabet sizes.  ... 
doi:10.1109/lwc.2017.2698455 fatcat:fqrmxrfhvng5bl4seqgk64pl3y

Features of Application of Data Compression Methods

2021 Qalaai Zanist Scientific Journal  
Without data compression a 3-minute song would be over 100Mb in size, while a 10minute video would be over 1Gb in size. Data compression shrinks big files into much smaller ones.  ...  The article describes the known methods of data compression, considers the features of compression statistical and linguistic methods, with and without losses, relatively static and dynamic models.  ...  Also known in this group of methods is the group coding algorithm RLE (Run Length Encoding). Assume that the size of the alphabet is N = 256, and we compress a plain text file (ASCII).  ... 
doi:10.25212/lfu.qzj.6.3.34 fatcat:na7nye4h3zernbl57gcnjzcn2y

Notes on block-sorting data compression

Hidetoshi Yokoo
1999 Electronics and communications in Japan. Part 3, Fundamental electronic science  
We give a new description of the algorithm in terms of the KarpMillerRosenberg (KMR) repetition finder in order to combine the above two aspects. © 1999 Scripta Technica, Electron Comm Jpn Pt 3, 82(6):  ...  The block-sorting data compression method of Burrows and Wheeler has received considerable attention in anticipation that it may be comparable, or even superior, to the ZivLempel codes.  ...  Block-Sorting Data Compression Consider the lossless compression of an input string over an ordered alphabet A of size D.  ... 
doi:10.1002/(sici)1520-6440(199906)82:6<18::aid-ecjc3>;2-7 fatcat:xo3ta6fggzcqdfmdat54mei57m

DNA fountain: As storage system

Sohan Patel, Darshan Patel
2021 IP International Journal of Comprehensive and Advanced Pharmacology  
This is a way to secureand keep data safely as long as possible. 455EB of data can be encoded in1 gm of single std. DNA.  ...  Goldman's and someresearcher's took a data file and that it was converted into the binary code and that they created effective andefficient relationship between binary code (0, 1) and genetic code (A,  ...  Conflict of Interest The authors report no conflicts of interest. The authors alone are responsible for the content and writing of this article. Source of Funding None.  ... 
doi:10.18231/j.ijcaap.2021.023 fatcat:s5yydfe6cfa4rnvahfpdivhr7e

Selection of Tabulation Method, Machine or Manual

Mary R. Paton
1942 Journal of Marketing  
Class C Interviews | Class D Interviews need) daar | dap | cio | dw | sta | ae | dae | ht | ae | de | de | as | i | a it Z 213 | 4 }7 | 2] 3 4 I 2] 3 4 I 2 | 3 4 Banda | | | | | | | Sek hee we BrandB |  ...  Steps which are entirely incom- parable on machine tabulation are (1), precoding the questionnaire, (3), coding returned questionnaires, and (4), punch- ing cards.  ... 
doi:10.1177/002224294200600302 fatcat:2fxl7yiqrjc2rlwb6hqjrganee

A complementary construction using mutually unbiased bases

Gaofei Wu, Matthew Geoffrey Parker
2013 Cryptography and Communications  
Moreover, a subset of the set can be viewed as a codebook that asymptotically achieves 3 2 times the Welch bound.  ...  We also sketch an algorithm to uniquely generate these sequences. The pairwise squared inner-product of members of the sequence set is shown to be 1 2 .  ...  As n gets large, |B n | approaches 6 n , whereas the size of the construction of [8] approaches 4 n .  ... 
doi:10.1007/s12095-013-0095-9 fatcat:zkhvspp2ejeybffcw6fz3o7r6m

Data Security Using Cramer – Shoup Algorithm in Cloud Computing

Deepak Jain
2017 IJARCCE  
Cloud computing is an rising technology that has become today"s blistering analysis space as a result of the advancement of inflated property and it's most attention-grabbing and magnetized technology  ...  that offers the on demand services to the users over the web.  ...  (3, 7, 243, 19683, 729) and personal secret's (2, 3, 4, 5, 6) 2) Encryption Choose any value for r from Z q , Let us assume r = 3. u 1 = 3 3 = 9, u 2 = 7 3 = 343, e = 729 3 (5) = 1.93 * 10 9 .  ... 
doi:10.17148/ijarcce.2017.63216 fatcat:zy546kddfvdebhgj75qtebyrv4
« Previous Showing results 1 — 15 out of 83,687 results