• Title/Summary/Keyword: binary solution

Search Result 345, Processing Time 0.021 seconds

Gibbs Energy of Nonrandomly Mixed Lattice Solutions with a Specific Interaction (특정 상호작용을 갖는 논랜덤 혼합 격자 용액의 깁스 에너지)

  • Jung, Hae-Young
    • Journal of the Korean Chemical Society
    • /
    • v.53 no.6
    • /
    • pp.663-670
    • /
    • 2009
  • Performing random number simulations, we obtained an approximate distribution of the number of ways arranging molecules in a binary lattice solution of nonrandom mixing with a specific interaction. From the distribution an approximate equation of excess Gibbs energy for a binary lattice solution was derived. Using the equation, liquid-vapor equilibrium at constant pressure for 15 binary solutions were calculated and compared with the result from Wilson equation, Van Laar equation and Redlich-Kister equation.

A Built-In Redundancy Analysis with a Minimized Binary Search Tree

  • Cho, Hyung-Jun;Kang, Woo-Heon;Kang, Sung-Ho
    • ETRI Journal
    • /
    • v.32 no.4
    • /
    • pp.638-641
    • /
    • 2010
  • With the growth of memory capacity and density, memory testing and repair with the goal of yield improvement have become more important. Therefore, the development of high efficiency redundancy analysis algorithms is essential to improve yield rate. In this letter, we propose an improved built-in redundancy analysis (BIRA) algorithm with a minimized binary search tree made by simple calculations. The tree is constructed until finding a solution from the most probable branch. This greatly reduces the search spaces for a solution. The proposed BIRA algorithm results in 100% repair efficiency and fast redundancy analysis.

The Measurement of Transfer Enthalpy in Mixed Solvent (Part I). Enthalpies of Solution of Aniline, Pyridine and Benzylamine in the Isodielectric Binary Mixtures of Methanol with Acetonitrile, Nitrobenzene and Nitromethane

  • Lee, Ik-Choon;Kang, Chul-Hyun;Lee, Bon-Su;Lee, Hai-Whang
    • Bulletin of the Korean Chemical Society
    • /
    • v.11 no.6
    • /
    • pp.546-552
    • /
    • 1990
  • Enthalpies of solution of aniline, pyridine and benzylamine in iso-dielectric mixtures of methanol with acetonitrile (AN), nitrobenzene (NB) and nitromethane (NM) have been measured calorimetrically. The solute-solvent interaction was analyzed using a model developed by Waghorne et al. and found that the relatively weak base, aniline, tended to behave anomalously, especially in the NB and NM binary systems by forming bidentate hydrogen bonds between the two-$NH_2$ hydrogens and the two-$NO_2$ oxygens. Pyridine and benzylamine were found to be preferentially solvated by methanol in all the binary mixtures.

Binary CDMA 기술 소개

  • 류승문
    • The Proceeding of the Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.13 no.4
    • /
    • pp.13-24
    • /
    • 2002
  • CDMA 시스템은 성능의 우수성에도 불구하고 신호처리의 복잡성과, 여러 채널의 신호를 동시에 전송시, 채널수가 증가할수록 신호의 PAPR(Peak to Average Power Ratio)가 증가하는 문제점을 갖고 있다. 본 논문에서는 멀티코드 CDMA의 특성과 구조를 유지하면서도 전송신호의 레벨이 항상 일정하여 기존의 TDMA 시스템 구조로도 멀티코드 CDMA 신호를 전송할 수 있는 Binary CDMA 기술에 대해 소개한다. Binary CDMA 기술은 적용 기술별로는 펄스폭 CDMA(PW/CDMA; Pulse Width CDMA), 다위상 CDMA(MP/CDMA; Multi Phase CDMA), 코드선택 CDMA(CS/CDMA; Code Select CDMA)로 구분되며, 사용자간의 상호간섭이 심한 환경에서 무선으로 실시간 멀티미디어를 보내는 소형 휴대형 장비에 적합한 무선 solution을 제공한다.

Impedance Imaging of Binary-Mixture Systems with Regularized Newton-Raphson Method

  • Kim, Min-Chan;Kim, Sin;Kim, Kyung-Youn
    • Journal of Energy Engineering
    • /
    • v.10 no.3
    • /
    • pp.183-187
    • /
    • 2001
  • Impedance imaging for binary mixture is a kind of nonlinear inverse problem, which is usually solved iteratively by the Newton-Raphson method. Then, the ill-posedness of Hessian matrix often requires the use of a regularization method to stabilize the solution. In this study, the Levenberg-Marquredt regularization method is introduced for the binary-mixture system with various resistivity contrasts (1:2∼1:1000). Several mixture distribution are tested and the results show that the Newton-Raphson iteration combined with the Levenberg-Marquardt regularization can reconstruct reasonably good images.

  • PDF

Preparation and Characterization of Electrodeposited Cadmium and Lead thin Films from a Diluted Chloride Solution

  • Sulaymon, Abbas Hamid;Mohammed, Sawsan A.M.;Abbar, Ali Hussein
    • Journal of Electrochemical Science and Technology
    • /
    • v.5 no.4
    • /
    • pp.115-127
    • /
    • 2014
  • Cd-Pb thin films were electrodeposited from a diluted chloride solution using stainless steel rotating disc electrode. The linear sweep voltammograms of the single metallic ions show that electrodeposition of these ions was mass transfer control due to the plateau observed for different rotations at concentration (50 and 200 ppm). The voltammograms of binary system elucidate that electrodeposition process always start at cathodic potential located between the potential of individual metals. Currents transients measurements, anodic linear sweep voltammetry (ALSV) and atomic force microscopy (AFM) were used to characterize the electrocryatalization process and morphology of thin films. ALSV profiles show a differentiation for the dissolution process of individual metals and binary system. Two peaks of dissolution Cd-Pb film were observed for the binary system with different metal ion concentration ratios. The model of Scharifker and Hills was used to analyze the current transients and it revealed that Cd-Pb electrocrystalization processes at low concentration is governed by three-dimensional progressive nucleation controlled by diffusion, while at higher concentration starts as a progressive nucleation then switch to instantaneous nucleation process. AFM images reveal that Cd-Pb film electrodeposited at low concentration is more roughness than Cd-Pb film electrodeposited at high concentrated solution.

An Application of a Binary PSO Algorithm to the Generator Maintenance Scheduling Problem (이진 PSO 알고리즘의 발전기 보수계획문제 적용)

  • Park, Young-Soo;Kim, Jin-Ho
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.56 no.8
    • /
    • pp.1382-1389
    • /
    • 2007
  • This paper presents a new approach for solving the problem of maintenance scheduling of generating units using a binary particle swarm optimization (BPSO). In this paper, we find the optimal solution of the maintenance scheduling of generating units within a specific time horizon using a binary particle swarm optimization algorithm, which is the discrete version of a conventional particle swarm optimization. It is shown that the BPSO method proposed in this paper is effective in obtaining feasible solutions in the maintenance scheduling of generating unit. IEEE reliability test systems(1996) including 32-generators are selected as a sample system for the application of the proposed algorithm. From the result, we can conclude that the BPSO can find the optimal solution of the maintenance scheduling of the generating unit with the desirable degree of accuracy and computation time, compared to other heuristic search algorithm such as genetic algorithms. It is also envisaged that BPSO can be easily implemented for similar optimizations and scheduling problems in power system problems to obtain better solutions and improve convergence performance.

A kinematic Analysis of Binary Robot Manipulator using Genetic Algorithms

  • Gilha Ryu;Ihnseok Rhee
    • International Journal of Precision Engineering and Manufacturing
    • /
    • v.2 no.1
    • /
    • pp.76-80
    • /
    • 2001
  • A binary parallel robot manipulator uses actuators that have only two stable states being built by stacking variable geometry trusses on top of each other in a long serial chain. Discrete characteristics of the binary manipulator make it impossible to analyze an inverse kinematic problem in conventional ways. We therefore introduce new definitions of workspace and inverse kinematic solution, and the apply a genetic algorithm to the newly defied inverse kinematic problem. Numerical examples show that our genetic algorithm is very efficient to solve the inverse kinematic problem of binary robot manipulators.

  • PDF

Solid Solution and Defect Structure of LiCrO2 in the Pseudo-binary Systems : Li2Cr2O4-MgAl2O4 (의사이성분계, Li2Cr2O4-MgCr2O4와 Li2Cr2O4-MgAl2O4에서의 LiCrO2 고용체 형성과 결합구조)

  • 정영서;오근호;김호기
    • Journal of the Korean Ceramic Society
    • /
    • v.25 no.1
    • /
    • pp.35-41
    • /
    • 1988
  • In the system of Li2O-MgO-Al2O3-Cr2O3, the crystalline solid solution of LiCrO2 along the pseudo-binary join between rocksalt structure(LiCrO2) and spinel structure(MgCr2O4 or MgAl2O4) have been investigated by x-ray diffraction techniques. In this study, order-disorder phase transition of LiCrO2 was observed and the unit cell of the disordered LiCrO2 structure has been established. It has been found that LiCrO2 makes a solid solution over a wide range with MgAl2O4, while not with MgCr2O4. This difference was explained as being due to the ability of oxygen lattice distortion which depended on the relative sizes and chemical bonding characteristics of the substituted ions.

  • PDF

Performance Comparison on Pattern Recognition Between DNA Coding Method and GA Coding Method (DNA 코딩방법과 GA 코딩방법의 패턴인식 성능 비교에 관한 연구)

  • 백동화;한승수
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2002.12a
    • /
    • pp.383-386
    • /
    • 2002
  • In this paper, we investigated the pattern recognition performance of the numeric patterns (from 0 to 9) using DNA coding method. The pattern recognition performance of the DNA coding method is compared to the that of the GA(Genetic Algorithm). GA searches effectively an optimal solution via the artificial evolution of individual group of binary string using binary coding, while DNA coding method uses four-type bases denoted by A(Adenine), C(Cytosine), G(Guanine) and T(Thymine), The pattern recognition performance of GA and DNA coding method is evaluated by using the same genetic operators(crossover and mutation) and the crossover probability and mutation probability are set the same value to the both methods. The DNA coding method has better characteristics over genetic algorithms (GA). The reasons for this outstanding performance is multiple possible solution presentation in one string and variable solution string length.