• Title/Summary/Keyword: Random Binary

Search Result 281, Processing Time 0.023 seconds

An Empirical Comparison of Statistical Models for Pre-service Teachers' Help Networks using Binary and Valued Exponential Random Graph Models (예비교원의 도움 네트워크에 관한 통계 모형의 경험적 비교: 이항 및 가중 ERGM을 중심으로)

  • Kim, Sung-Yeun;Kim, Chong Min
    • The Journal of the Korea Contents Association
    • /
    • v.20 no.4
    • /
    • pp.658-672
    • /
    • 2020
  • The purpose of this study is to empirically compare statistical models for pre-service teachers' help networks. We identified similarities and differences based on the results of the binary and valued ERGM. Research questions are as follows: First, what are the similarities of factors influencing the binary/valued help network for pre-service teachers? Second, what are differences of factors influencing the binary/valued help network for pre-service teachers? We measured 42 pre-service teachers with focus on their help and friend networks, happiness, and personal characteristics. Results indicated that, first, the similar factors influencing the binary and valued help network of pre-service teachers were local dependencies (reciprocity, transitivity), similarity (major, gender), activity (early childhood education, negative emotion), popularity (early childhood education) and multiplicity (friend network). Second, the difference between factors affecting pre-service teacher's binary and valued help network was the effect of activity (physical education) and popularity (GPA, negative emotion). Based on these findings, we presented implications.

Real-time Traffic Sign Recognition using Rotation-invariant Fast Binary Patterns (회전에 강인한 고속 이진패턴을 이용한 실시간 교통 신호 표지판 인식)

  • Hwang, Min-Chul;Ko, Byoung Chul;Nam, Jae-Yeal
    • Journal of Broadcast Engineering
    • /
    • v.21 no.4
    • /
    • pp.562-568
    • /
    • 2016
  • In this paper, we focus on recognition of speed-limit signs among a few types of traffic signs because speed-limit sign is closely related to safe driving of drivers. Although histogram of oriented gradient (HOG) and local binary patterns (LBP) are representative features for object recognition, these features have a weakness with respect to rotation, in that it does not consider the rotation of the target object when generating patterns. Therefore, this paper propose the fast rotation-invariant binary patterns (FRIBP) algorithm to generate a binary pattern that is robust against rotation. The proposed FRIBP algorithm deletes an unused layer of the histogram, and eliminates the shift and comparison operations in order to quickly extract the desired feature. The proposed FRIBP algorithm is successfully applied to German Traffic Sign Recognition Benchmark (GTSRB) datasets, and the results show that the recognition capabilities of the proposed method are similar to those of other methods. Moreover, its recognition speed is considerably enhanced than related works as approximately 0.47second for 12,630 test data.

Characteristics of holographic storage of random-phase-modulation-added binary amplitude data (랜덤 위상변조가 가미된 이진 진폭 데이터 영상의 홀로그래픽 저장 특성)

  • 오용석;신동학;장주석
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.5 no.2
    • /
    • pp.289-296
    • /
    • 2001
  • We propose a method to add phase-modulation to binary amplitude data pages using a twisted-nematic liquid crystal display as a dynamic phase mask. For this, the phase modulation characteristics of the display were examined both theoretically and experimentally, and an unexpected abnormal phenomenon was found experimentally in which the modulation property changed as the incident beam intensity increased. To investigate the characteristics of holographically storing the binary data images, eight pages of holograms were stored at one spot of in un-thick Dupont's photopolymer with angle multiplexing. When phase-modulation-added pages were stored at the Fourier plane, the uniformity of the signal beam at the plane was improved, and thus more holograms can be recorded with our method, compared with the conventional case of using only binary amplitude modulation under the same condition.

  • PDF

The Measurement of Flash Point for Binary Mixtures of 2,2,4-Trimethylpentane, Methylcyclohexane, Ethylbenzene and p-xylene at 101.3 kPa

  • Hwang, In Chan;In, Se Jin
    • Clean Technology
    • /
    • v.26 no.4
    • /
    • pp.279-285
    • /
    • 2020
  • Laboratories and industrial processes typically involve the use of flammable substances. An important property used to estimate fire and explosion risk for a flammable liquid is the flash point. In this study, flash point data at 101.3 kPa were determined using a SETA closed cup flash point tester on the following solvent mixtures: {2,2,4-trimethylpentane + methylcyclohexane}, {2,2,4-trimethylpentane + ethylbenzene}, and {2,2,4-trimethylpentane + p-xylene}. The purpose of this work is to obtain flash point data for binary mixtures of 2,2,4-trimethylpentane with three hydrocarbons (methylcyclohexane, ethylbenzene, and p-xylene), which are representative compounds of the main aromatic hydrocarbon fractions of petroleum. The measured flash points are compared with the predicted values calculated using the GE models' activity coefficient patterns: the Wilson, the Non-Random Two-Liquid (NRTL), and the UNIversal QUAsiChemical (UNIQUAC) models. The non-ideality of the mixture is also considered. The average absolute deviation between the predicted and measured lower flash point s is less than 1.99 K, except when Raoult's law is calculated. In addition, the minimum flash point behavior is not observed in any of the three binary systems. This work's predicted results can be applied to design safe petrochemical processes, such as identifying safe storage conditions for non-ideal solutions containing volatile components.

Double Encryption of Digital Hologram Based on Phase-Shifting Digital Holography and Digital Watermarking (위상 천이 디지털 홀로그래피 및 디지털 워터마킹 기반 디지털 홀로그램의 이중 암호화)

  • Kim, Cheol-Su
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.22 no.4
    • /
    • pp.1-9
    • /
    • 2017
  • In this Paper, Double Encryption Technology Based on Phase-Shifting Digital Holography and Digital Watermarking is Proposed. For the Purpose, we First Set a Logo Image to be used for Digital Watermark and Design a Binary Phase Computer Generated Hologram for this Logo Image using an Iterative Algorithm. And Random Generated Binary Phase Mask to be set as a Watermark and Key Image is Obtained through XOR Operation between Binary Phase CGH and Random Binary Phase Mask. Object Image is Phase Modulated to be a Constant Amplitude and Multiplied with Binary Phase Mask to Generate Object Wave. This Object Wave can be said to be a First Encrypted Image Having a Pattern Similar to the Noise Including the Watermark Information. Finally, we Interfere the First Encrypted Image with Reference Wave using 2-step PSDH and get a Good Visible Interference Pattern to be Called Second Encrypted Image. The Decryption Process is Proceeded with Fresnel Transform and Inverse Process of First Encryption Process After Appropriate Arithmetic Operation with Two Encrypted Images. The Proposed Encryption and Decryption Process is Confirmed through the Computer Simulations.

Fast Anti-Collision Algorithm Using Pre-distributed Random Address (미리 분배된 난수를 이용하는 빠른 충돌방지 알고리즘)

  • Kang Jeon il;Park Ju sung;Nyang Dae hun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.3A
    • /
    • pp.184-194
    • /
    • 2005
  • One of the most important factors that decide the overall performance of RFID system is anti-collision algorithm. By enhancing the anti-collision algorithm, we can increase the number of RFID tags that can be processed in unit time. Two anti-collision algorithms are most widely prevailed: one is ALOHA-based protocol and the other is a binary tree walking method, but these are still under research. In this paper, we suggest an anti-collision algorithm named AAC(Address Allocating and Calling) using pre-distributed random address, which is much faster and more efficient than existing ones. Finally, we evaluate our scheme using mathematical analysis and computer simulation.

Design of the composition state machine based on the chaotic maps (혼돈맵들에 기반한 합성 상태머신의 설계)

  • Seo, Yong-Won;Park, Jin-Soo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.12
    • /
    • pp.3688-3693
    • /
    • 2009
  • In this paper the design methode of a separated composition state machine based on the compositive map with connecting two chaotic maps together - sawtooth map $S_2(x)$ and tent map $T_2(x)$ and the result of that is proposed. this paper gives a graph of the chaotic states generated by the composition state machine using the compositive logic of two different chaotic maps - sawtooth map and tent map and also shows that the period of pseudo-random states has the length according to the precision of the discreet truth table.

Performance Evaluation of the HomePNA 3.0 Asynchronous MAC Mode with Collision Management Protocol (HomePNA 3.0 비동기 MAC 모드의 Collision Management Protocol 성능 분석)

  • 김희천;정민영;이태진
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7A
    • /
    • pp.727-734
    • /
    • 2004
  • Collision Management Protocol (CMP) efficiently resolves collisions when data frames are transmitted in networks consisting of HomPNA 3.0 asynchronous MAC mode device with random access. Unlike Distributed Fair Priority Queueing (DFPQ) algorithm in HomePNA 2.0 or Binary Exponential Backoff (BEB) algorithm in IEEE 802.11, order of retransmission is decided according to Collision Signaling Sequence (CSS) values allocated to each device. Thus, CMP can minimize the number of mean collisions because order of retransmission is decided in a deterministic way. In this paper. we evaluate the saturation performance of CMP in HomePNA 3.0 using an analytic method.

Construction of Jacket Matrices Based on q-ary M-sequences (q-ary M-sequences에 근거한 재킷 행렬 설계)

  • S.P., Balakannan;Kim, Jeong-Ki;Borissov, Yuri;Lee, Moon-Ho
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.7
    • /
    • pp.17-21
    • /
    • 2008
  • As with the binary pseudo-random sequences q-ary m-sequences possess very good properties which make them useful in many applications. So we construct a class of Jacket matrices by applying additive characters of the finite field $F_q$ to entries of all shifts of q-ary m-sequence. In this paper, we generalize a method of obtaining conventional Hadamard matrices from binary PN-sequences. By this way we propose Jacket matrix construction based on q-ary M-sequences.