http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Nawaf Aljohani (검색결과 2 건)
- 무료
- 기관 내 무료
- 유료
-
Generation of Finite Inductive, Pseudo Random, Binary Sequences
Fisher, Paul,Aljohani, Nawaf,Baek, Jinsuk Korea Information Processing Society 2017 Journal of information processing systems Vol.13 No.6
This paper introduces a new type of determining factor for Pseudo Random Strings (PRS). This classification depends upon a mathematical property called Finite Induction (FI). FI is similar to a Markov Model in that it presents a model of the sequence under consideration and determines the generating rules for this sequence. If these rules obey certain criteria, then we call the sequence generating these rules FI a PRS. We also consider the relationship of these kinds of PRS's to Good/deBruijn graphs and Linear Feedback Shift Registers (LFSR). We show that binary sequences from these special graphs have the FI property. We also show how such FI PRS's can be generated without consideration of the Hamiltonian cycles of the Good/deBruijn graphs. The FI PRS's also have maximum Shannon entropy, while sequences from LFSR's do not, nor are such sequences FI random.
-
Generation of Finite Inductive, Pseudo Random, Binary Sequences
Paul Fisher,Nawaf Aljohani,백진숙 한국정보처리학회 2017 Journal of information processing systems Vol.13 No.6
This paper introduces a new type of determining factor for Pseudo Random Strings (PRS). This classificationdepends upon a mathematical property called Finite Induction (FI). FI is similar to a Markov Model in that itpresents a model of the sequence under consideration and determines the generating rules for this sequence. If these rules obey certain criteria, then we call the sequence generating these rules FI a PRS. We also considerthe relationship of these kinds of PRS’s to Good/deBruijn graphs and Linear Feedback Shift Registers (LFSR). We show that binary sequences from these special graphs have the FI property. We also show how such FIPRS’s can be generated without consideration of the Hamiltonian cycles of the Good/deBruijn graphs. The FIPRS’s also have maximum Shannon entropy, while sequences from LFSR’s do not, nor are such sequences FIrandom.
KISS연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
