• Title/Summary/Keyword: In/Out Binary

Search Result 446, Processing Time 0.028 seconds

The Fundamental Study on Quality Properties of Binary Blended Concrete according to Water Reducing Performance of Chemical Admixture and Estimation Equation of Compressive Strength (화학 혼화제의 감수 성능에 따른 2성분계 콘크리트의 품질특성 및 압축강도 추정식에 관한 기초적 연구)

  • Kim, Kyung-Hwan;Oh, Sung-Rok;Choi, Byung-Keol;Choi, Yun-Wang
    • Journal of the Korea institute for structural maintenance and inspection
    • /
    • v.20 no.1
    • /
    • pp.9-17
    • /
    • 2016
  • In this study, binary blended concrete mix with fly ash and ground granulated blast furnace slag was prepared according to 3 level of water reduction performance of chemical admixture (0%, 8% and 16%) and 3 level of water-cement ratio (40%, 45% and 50%) for evaluation of quality properties of binary blended concrete according to performance of chemical admixture. concrete mix was carried out repetition test of three times in order to secure the reliability. As a result, compressive strength according to performance of chemical admixture was found that difference of strength was about 20% occurred, chemical admixture was showed that a great influence on qualities of concrete. In addition, reflected the effect of performance of chemiacal admixture, prediction model equations for concrete compressive strength was proposed, it was found that more than 85% of the high correlation.

Sensitivity analysis in Bayesian nonignorable selection model for binary responses

  • Choi, Seong Mi;Kim, Dal Ho
    • Journal of the Korean Data and Information Science Society
    • /
    • v.25 no.1
    • /
    • pp.187-194
    • /
    • 2014
  • We consider a Bayesian nonignorable selection model to accommodate the selection bias. Markov chain Monte Carlo methods is known to be very useful to fit the nonignorable selection model. However, sensitivity to prior assumptions on parameters for selection mechanism is a potential problem. To quantify the sensitivity to prior assumption, the deviance information criterion and the conditional predictive ordinate are used to compare the goodness-of-fit under two different prior specifications. It turns out that the 'MLE' prior gives better fit than the 'uniform' prior in viewpoints of goodness-of-fit measures.

Photoelectric Observations of the Close Eclipsing Binary System CW Cephei

  • Han, Won-Yong
    • Journal of Astronomy and Space Sciences
    • /
    • v.1 no.1
    • /
    • pp.41-53
    • /
    • 1984
  • Photoelectric observations of the close eclipsing binary system CW Cep, which is well known of its apsidal motion, were made on 20 nights during August and November in 1983 using two 61cm reflectors at the Sobaeksan Observing Station of Korean National Astronomical Observatory and I1san Observing Station of Yonsei University Observatory. Standardized new light curves in UBV system are presented with a total of 1,422 individual observations. For the corrections of regional and instrumental differences, same standard stars were observed at the two observatories. Four new times of minimum light were determined with the method of Kwee and van Woerden(1956). With all of the collected times of minima, apsidal motion of this system was checked, but the O-C values calculated by the light elements of Nha(1975) and Soderhjelm (1976) did not coincide well with new times of minima. New light elements which satisfy most times of minima better, and are deduced the apsidal period derived by the new light elements turns out to be 43 years, somewhat longer than those of values previously known.

  • PDF

Vanadyl Binary Schiff Base Complexes Containing N2O2 Coordination Sphere: Synthesis, Ab Initio Calculations and Thermodynamic Properties

  • Asadi, Mozaffar;Ghatee, Mohammad Hadi;Torabi, Susan;Mohammadi, Khosro;Moosavi, Fatemeh
    • Journal of the Korean Chemical Society
    • /
    • v.57 no.1
    • /
    • pp.63-72
    • /
    • 2013
  • Some vanadyl complexes were synthesized by treating a methanolic solution of the appropriate Schiff base ligand and one equivalent of $VO(SO_4)_2$ to yield [($VOL_2^{1-14}$)](L=Salicylaldehyde's derivatives, Schemes 1, 2). These oxovanadium (IV) complexes were characterized based on their FT-IR, UV-Vis spectroscopy and elemental analysis. The IR spectra suggest that coordination takes place through azomethine nitrogen and phenolate oxygen. In addition, the formation constants of the oxovanadium (IV) binary complexes were determined in methanolic medium. The ab initio calculations were also carried out to determine the structural and the geometrical properties of one of the complexes and its calculated vibrational frequencies were investigated.

Program Translation from Conventional Programming Source to Java Bytecode (기존 프로그래밍 원시코드에서 자바 바이트 코드로의 변환)

  • Jeon-Geun Kang;Haeng-Kon Kim
    • Journal of the Korea Computer Industry Society
    • /
    • v.3 no.8
    • /
    • pp.963-980
    • /
    • 2002
  • Software reengineering is making various research for solutions against problem of maintain existing systems. Reengineering has a meaning of development of software on exizting systems through the reverse engineering auf forward engineering. Most of the important concepts used in reengineering is composition that is restructuring of the existing objects. Is there a compiler that can compile a program written in a traditional procedural language (like C or Pascal) and generate a Java bytecode, rather than an executable code that runs oかy on the machine it was compiled (such as an a.out file on a Unix machine)\ulcorner This type of compiler may be very handy for today's computing environment of heterogeneous networks. In this paper we present a software system that does this job at the binary-to-binary level. It takes the compiled binary code of a procedural language and translates it into Java bytecode. To do this, we first translate into an assembler code called Jasmin [7] that is a human-readable representation of Java bytecode. Then the Jasmin assembler converts it into real Java bytecode. The system is not a compiler because it does not start at the source level. We believe this kind of translator is even more useful than a compiler because most of the executable code that is available for sharing does not come with source programs. Of course, it works only if the format of the executable binary code is known. This translation process consists of three major stages: (1) analysis stage that identifies the language constructs in the given binary code, (2) initialization stage where variables and objects are located, classified, and initialized, and (3) mapping stage that maps the given binary code into a Jasmin assembler code that is then converted to Java bytecode.

  • PDF

A DATA COMPRESSION METHOD USING ADAPTIVE BINARY ARITHMETIC CODING AND FUZZY LOGIC

  • Jou, Jer-Min;Chen, Pei-Yin
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.756-761
    • /
    • 1998
  • This paper describes an in-line lossless data compression method using adaptive binary arithmetic coding. To achieve better compression efficiency , we employ an adaptive fuzzy -tuning modeler, which uses fuzzy inference to deal with the problem of conditional probability estimation. The design is simple, fast and suitable for VLSI implementation because we adopt the table -look-up approach. As compared with the out-comes of other lossless coding schemes, our results are good and satisfactory for various types of source data.

  • PDF

Algebraic-Coded Cryptosystem Using Primitive Binary BCH Codes (원시 이원 BCH 부호를 사용한 Algebraic-Coded Cryptosystem)

  • Jo Yong-Geon;Nam Gil-Hyeon
    • Journal of the military operations research society of Korea
    • /
    • v.15 no.2
    • /
    • pp.94-104
    • /
    • 1989
  • The concept of Algebraic-Coded Cryptosystem has been proposed recently but its application has not been developed yet. The primary object of this paper is to implement the Private-Key Algebraic-Coded Cryptosystem by using the primitive binary BCH codes. In the analysis of the cryptosystein, we find out the fact that there may exist other key pairs $S_i\;and\;P_i$ satisfying $G^*=S_{i},G_{s},P_{i}$ where $SG_{s}P$ is the original cryptosystem made by use of the systematic code generation matrix $G_{s}$.

  • PDF

How Do South Korean People View the US and Chinese National Influence?: Is Soft Power Zero-Sum?

  • Zhao, Xiaoyu
    • Asian Journal for Public Opinion Research
    • /
    • v.5 no.1
    • /
    • pp.15-40
    • /
    • 2017
  • This paper addresses the zero-sum of soft power against the backdrop of the rise of China and the relative "decline" of America. It attempts to find out that whether the "decline" of America's soft power is caused by the rise of China's soft power, and whether China's rise could guarantee with certainty the growth of soft power. In light of the particularity of South Korea, that is, its economy relies on China and its security relies on the US, this paper chooses South Korea as the entry point for the study. Based on the Pew data from a South Korean opinion poll, this paper conducts bivariate correlation and binary logistic regression respectively, to explore the existence of zero-sum "competitions" between China's and America's soft power.

STRUCTURES OF IDEMPOTENT MATRICES OVER CHAIN SEMIRINGS

  • Kang, Kyung-Tae;Song, Seok-Zun;Yang, Young-Oh
    • Bulletin of the Korean Mathematical Society
    • /
    • v.44 no.4
    • /
    • pp.721-729
    • /
    • 2007
  • In this paper, we have characterizations of idempotent matrices over general Boolean algebras and chain semirings. As a consequence, we obtain that a fuzzy matrix $A=[a_{i,j}]$ is idempotent if and only if all $a_{i,j}$-patterns of A are idempotent matrices over the binary Boolean algebra $\mathbb{B}_1={0,1}$. Furthermore, it turns out that a binary Boolean matrix is idempotent if and only if it can be represented as a sum of line parts and rectangle parts of the matrix.

Fault Detection in Comvinational Circuits (조합논리회로의 결함검출)

  • Koh, Kyung-Sik;Huh, Woong
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.11 no.4
    • /
    • pp.17-22
    • /
    • 1974
  • In this paper, the problem of finding tests to detect faults in combinational logic circuits is considered. At first, the method of fault detection in fan-out-free irredundant circuits is derived, and the result is extended to the fan-out redundant circuits. A fan-out circuit is decomposed into a set of fan-out-free subcircuits by cutting the lines at the internal fan-out points, and the minimal detecting test. sets for each subcircuit are found separately. And then, the compatible tests from each test set are combined maximally into composite tests to generate primary input binary vectors. By this procedure. the minimal complete test sets for reconvergent fan-out circuits are easily found and the detectable and undetectable faults are also classified clearly.

  • PDF