• Title/Summary/Keyword: In/Out Binary

Search Result 447, Processing Time 0.022 seconds

Compact Binaries Ejected from Globular Clusters as GW Sources

  • Bae, Yeong-Bok;Kim, Chunglee;Lee, Hyung Mok
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.38 no.1
    • /
    • pp.57.2-57.2
    • /
    • 2013
  • Based on N-body simulations, we find out that significant fraction of dynamically formed BH-BH (10 $M_{\odot}$ and NS-NS (1.4 $M_{\odot$ ecah) binaries are ejected from globular clusters. About 30 percent of compact stars are ejected in the form of binary. The merging time of ejected binary depends on the velocity dispersion of globular cluster. Some of ejected binaries have merging time-scales shorter than Hubble time and are expected to produce gravitational waves that can be detectable by the advanced ground-based interferometers. The merger rates of ejected BH-BH and NS-NS binaries per globular cluster are estimated to be 3.5 and 17 per Gyr, respectively. Assuming the spatial density of globular clusters as 8.4 $h^3$ clusters $Mpc^{-3}$ and extrapolating to the horizon distance of the advanced LIGO-Virgo network, we expect the detection rates solely attributed to BH-BH and NS-NS with cluster origin are to be 42 and 1.7 $yr^{-1}$, respectively. Besides, we find out that BH-NS binary ejection hardly occurs in globular clusters and dynamically formed compact binaries may possibly be the source of short GRBs whose locations are far from host galaxies.

  • PDF

Comparison of Haseman-Elston Linkage Tests with Age-of-Onset or Affection Trait

  • Jung, Kyoung-Hee;Song, Hae-Hiang
    • Communications for Statistical Applications and Methods
    • /
    • v.13 no.3
    • /
    • pp.635-649
    • /
    • 2006
  • In this paper, we perform a simulation study of genetic model-free age-of-onset methods in linkage tests which has been proposed by Zhu et al. (1997). They performe. Haseman-Elston regression on a set of bipolar pedigree data using each of three dependent variables: a binary trait indicating disease concordance or discordance, a binary trait adjusted for age-of-onset, and the residuals from a survival analysis. We compare the powers of the proposed test statistics for various situations. Simulations that we have carried out show that the gains in power are observed when the residuals from a survival analysis are used in linkage tests.

Kinetics Prediction of Binary Aromatic Solvent Mixtures in Catalytic Oxidation Process (방향족 유기용매의 촉매산화공정에서 이성분계 혼합물의 속도특성 예측)

  • 이승범;윤용수;홍인권;이재동
    • Journal of environmental and Sanitary engineering
    • /
    • v.16 no.1
    • /
    • pp.66-71
    • /
    • 2001
  • The objective of this study was to depict the kinetic behavior of the platinum catalyst for the deep oxidation of aromatic solvents and their binary mixtures. The oxidation kinetics of aromatic solvents, which were benzene, toluene and m-xylene, was studied on a 0.5% $Pt/{\gamma}-Al_2O_3$ catalyst. Deep oxidation of binary mixtures, which were 1:1 in volume, was carried out and the inlet concentration was controlled in the range of 133 and 333ppmv. An approach based on the two-stage redox model was used to analysis the results. The deep oxidation conversion of aromatic solvents was inversely proportional to inlet concentration in plug flow reactor. This trend is due to the zeroth-order kinetics with respect to inlet concentration. The kinetic parameters of multicomponent model were independently evaluated from the single compound oxidation experiments. A simple multicomponent model based on two-stage redox rate model made reasonably good predictions of conversion over the range of parameters studied.

  • PDF

Transformation of Carrot (Daucus carota) Cells Using Binary Vector System (Binary Vector System을 이용한 당근 (Daucus carota) 세포의 형질전환)

  • 양덕조;이성택
    • KSBB Journal
    • /
    • v.5 no.3
    • /
    • pp.247-253
    • /
    • 1990
  • These studies were carried out to obtain the transformant from carrot cells by using binary vector pGA472 with NPT II gene to confer kanamycin resistance in the plant cells. The binary vector pGA472 was mobilized from E. coli MC1000 into A. tumefaciens strains isolated in the Korea, C23-1. K29-1, and disarmed Ti-plasmid PC2760, and A28l using a tri-parental mating method with E. coli HB101/pRK2013. Transconjugants, C23-1/pGA472, K29-1/pGA472, PC2 760/pGA472 and A28l/pGA472 were obtaind on the minimum AB media containing tetracycline and kanamycin, were comfirmed to hold the Ti-plasmid and pGA472 binary vector on the 0.7% agarose gel. Transformed carrot calli were initiated on the MS media supplemented with l00$\mu\textrm{g}$/ml kanamycin and 250$\mu\textrm{g}$/ml carbenicillin after co-cultivation of carrot explant and transconjugant Agrobacteria. Selected callus was grown vigouousley for subculture on the medium containing 100$\mu\textrm{g}$/ml kanamycin, thus indication that the selected callus was transformed with NPT II gene.

  • PDF

Synthesis of binary Cu-Se and In-Se nanoparticle inks using cherry blossom gum for CuInSe2 thin film solar cell applications

  • Pejjai, Babu;Reddy, Vasudeva Reddy Minnam;Seku, Kondaiah;Cho, Haeyun;Pallavolu, Mohan Reddy;Le, Trang Thi Thuy;Jeong, Dong-seob;Kotte, Tulasi Ramakrishna Reddy;Park, Chinho
    • Korean Journal of Chemical Engineering
    • /
    • v.35 no.12
    • /
    • pp.2430-2441
    • /
    • 2018
  • Selenium (Se)-rich binary Cu-Se and In-Se nanoparticles (NPs) were synthesized by a modified heat-up method at low temperature ($110^{\circ}C$) using the gum exudates from a cherry blossom tree. Coating of CISe absorber layer was carried out using Se-rich binary Cu-Se and In-Se NPs ink without the use of any external binder. Our results indicated that the gum used in the synthesis played beneficial roles such as reducing and capping agent. In addition, the gum also served as a natural binder in the coating of CISe absorber layer. The CISe absorber layer was integrated into the solar cell, which showed a power conversion efficiency (PCE) of 0.37%. The possible reasons for low PCE of the present solar cells and the steps needed for further improvement of PCE were discussed. Although the obtained PCE is low, the present strategy opens a new path for the fabrication of eco-friendly CISe NPs solar cell by a relatively chief non-vacuum method.

The Filling Imbalance in Multi-Cavity Injection Molds with Unary Branch Type Runner Lay-out (편측 분기형 러너 배열을 가진 다수 캐비티 사출금형에서의 충전 불균형도)

  • 강철민;정영득
    • Transactions of Materials Processing
    • /
    • v.13 no.7
    • /
    • pp.580-585
    • /
    • 2004
  • Almost all injection molds have multi-cavity runner system fur productivity and are designed with geometrically balanced runner system in order to minimize filling imbalance between cavity to cavity during processing. However, filling imbalances have been observed though geometrically balanced runner lay-out. Generally, these filling imbalances are due to thermal unbalance, viscosity, characteristic of polymers and so on. These kinds of filling imbalances have already been reported by Beaumont since 1997, but his research has mainly focused on filling imbalance at binary runner. In this study, we conducted an experimental study about the filling imbalances in unary branch runner as well as binary branch runner and inquired into the causes of filling imbalances. The results could be summarized as fellowing: Filling imbalances existed in multi-cavity mold with unary branch runner, it could be decreased by optimizing processing condition such as increasing injection rate, and it is almost proportion to each polymer's temperature sensibility.

Efficient Similarity Analysis Methods for Same Open Source Functions in Different Versions (서로 다른 버전의 동일 오픈소스 함수 간 효율적인 유사도 분석 기법)

  • Kim, Yeongcheol;Cho, Eun-Sun
    • Journal of KIISE
    • /
    • v.44 no.10
    • /
    • pp.1019-1025
    • /
    • 2017
  • Binary similarity analysis is used in vulnerability analysis, malicious code analysis, and plagiarism detection. Proving that a function is equal to a well-known safe functions of different versions through similarity analysis can help to improve the efficiency of the binary code analysis of malicious behavior as well as the efficiency of vulnerability analysis. However, few studies have been carried out on similarity analysis of the same function of different versions. In this paper, we analyze the similarity of function units through various methods based on extractable function information from binary code, and find a way to analyze efficiently with less time. In particular, we perform a comparative analysis of the different versions of the OpenSSL library to determine the way in which similar functions are detected even when the versions differ.

(An) analysis of quantum cryptography vulnerability by Binary merge (이진 병합에 의한 양자암호 취약성)

  • Rim, Kwang-Cheol;Choi, Jin-Suk
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.20 no.6
    • /
    • pp.837-842
    • /
    • 2010
  • In this paper, quantum cryptography systems used in the design process inevitably open bit stream of pseudo-random number that exists multiple open channels between them and the need to share information on the part of the situation exposes a pair of bit stream. In this paper, the base test of pseudo-random number I tested out this process and the merge bit binary column look out for randomness.

Binary Search Tree with Switch Pointers for IP Address Lookup (스위치 포인터를 이용한 균형 이진 IP 주소 검색 구조)

  • Kim, Hyeong-Gee;Lim, Hye-Sook
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.1
    • /
    • pp.57-67
    • /
    • 2009
  • Packet forwarding in the Internet routers is to find out the longest prefix that matches the destination address of an input packet and to forward the input packet to the output port designated by the longest matched prefix. The IP address lookup is the key of the packet forwarding, and it is required to have efficient data structures and search algorithms to provide the high-speed lookup performance. In this paper, an efficient IP address lookup algorithm using binary search is investigated. Most of the existing binary search algorithms are not efficient in search performance since they do not provide a balanced search. The proposed binary search algorithm performs perfectly balanced binary search using switch pointers. The performance of the proposed algorithm is evaluated using actual backbone routing data and it is shown that the proposed algorithm provides very good search performance without increasing the memory amount storing the forwarding table. The proposed algorithm also provides very good scalability since it can be easily extended for multi-way search and for large forwarding tables

A Model for Machine Fault Diagnosis based on Mutual Exclusion Theory and Out-of-Distribution Detection

  • Cui, Peng;Luo, Xuan;Liu, Jing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.9
    • /
    • pp.2927-2941
    • /
    • 2022
  • The primary task of machine fault diagnosis is to judge whether the current state is normal or damaged, so it is a typical binary classification problem with mutual exclusion. Mutually exclusive events and out-of-domain detection have one thing in common: there are two types of data and no intersection. We proposed a fusion model method to improve the accuracy of machine fault diagnosis, which is based on the mutual exclusivity of events and the commonality of out-of-distribution detection, and finally generalized to all binary classification problems. It is reported that the performance of a convolutional neural network (CNN) will decrease as the recognition type increases, so the variational auto-encoder (VAE) is used as the primary model. Two VAE models are used to train the machine's normal and fault sound data. Two reconstruction probabilities will be obtained during the test. The smaller value is transformed into a correction value of another value according to the mutually exclusive characteristics. Finally, the classification result is obtained according to the fusion algorithm. Filtering normal data features from fault data features is proposed, which shields the interference and makes the fault features more prominent. We confirm that good performance improvements have been achieved in the machine fault detection data set, and the results are better than most mainstream models.