• Analytical Science and Technology
• /
• v.7 no.2
• /
• pp.237-243
• /
• 1994

The stability of W/O emulsions (milk fat : water=4 : 1, w/w) containing various emulsifiers was compared to determine the effect of different chemical types of emulsifiers in relation to the change of HLB value caused by emulsifier type and the influence of single vs. binary emulsifier systems. These variables were compared at emulsifier HLB values of 0.5~16.7 and at emulsifier concentrations of 1.0~3.0%(w/w). Eleven emulsifiers used as 11 different single mixtures and 16 different binary mixtures were evaluated in W/O type emulsion systems containing 20.0%(w/w) of water in milk fat. This W/O emulsion was stable (more than 90.0 of ESI value) in the range of low value of emulsifier HLB (less than 4.7 of HLB value). All the ESI values of binary emulsifier systems were higher than those of single emulsifier systems. But, the influence pattern of emulsifier HLB on this emulsion stability in single emulsifier systems was very similar to the trend in binary emulsifier systems.

• ETRI Journal
• /
• v.32 no.4
• /
• pp.588-595
• /
• 2010

This paper proposes encoding and decoding for nonlinear product codes and investigates the performance of nonlinear product codes. The proposed nonlinear product codes are constructed as N-dimensional product codes where the constituent codes are nonlinear binary codes derived from the linear codes over higher order alphabets, for example, Preparata or Kerdock codes. The performance and the complexity of the proposed construction are evaluated using the well-known nonlinear Nordstrom-Robinson code, which is presented in the generalized array code format with a low complexity trellis. The proposed construction shows the additional coding gain, reduced error floor, and lower implementation complexity. The (64, 24, 12) nonlinear binary product code has an effective gain of about 2.5 dB and 1 dB gain at a BER of $10^{-6}$ when compared to the (64, 15, 16) linear product code and the (64, 24, 10) linear product code, respectively. The (256, 64, 36) nonlinear binary product code composed of two Nordstrom-Robinson codes has an effective gain of about 0.7 dB at a BER of $10^{-5}$ when compared to the (256, 64, 25) linear product code composed of two (16, 8, 5) quasi-cyclic codes.

• Journal of Nuclear Fuel Cycle and Waste Technology(JNFCWT)
• /
• v.19 no.3
• /
• pp.353-366
• /
• 2021

The solubilities of different multicomponent lanthanide oxide (Ln₂O₃) solid solutions including binary (Ln₁ and Ln₂ = La, Nd, Eu, or Tm), ternary (Ln₁, Ln₂, and Ln₃ = La, Nd, Eu, or Tm), and higher systems (Ln = La, Ce, Pr, Nd, Sm, Eu, Gd, Tb, Dy, Ho, Er, Tm, Yb, and Lu) were studied after aging for four weeks at 60℃. Our recent study revealed that the phase transformations in binary ((La, Nd) and (La, Eu)) and ternary (La, Nd, Eu) systems are responsible for the formation of (La, Nd)(OH)₃, (La, Eu)(OH)₃, and (La, Nd, Eu)(OH)₃ solid solutions, respectively. The variations in the mole fractions of La³⁺, Nd³⁺, and Eu³⁺ in the sample solutions of these hydroxide solid solutions indicated that a thermodynamic equilibrium might account for the apparent La, Nd, and Eu solubilities. Conversely, the binary and ternary systems containing Tm₂O₃ as the heavy lanthanide oxide retained the oxide-based solid solutions, and their solubility behaviors were dominated by their congruent dissolutions. In the higher multicomponent system, the X-ray diffraction patterns of the solid phases, before and after contact with the aqueous phase indicated the formation of a stable oxide solid solution and their solubility behavior was explained by its congruent dissolution.

• Journal of Astronomy and Space Sciences
• /
• v.22 no.3
• /
• pp.233-242
• /
• 2005

The absolute dimensions and orbital elements of 66 near contact binaries, collected from literatures, have been analyzed to investigate the physical characteristics of the near contact binaries as well as co-relations among physical parameters. The relationship between the mass ratio and luminosity ratio of the near contact binary systems have been obtained as a $L_2/L_1{\approx}(M_2/M_1)^{1.45}$, which is similar to that of the early type contact binary system. The physical parameters of the new contact binaries show that the difference in mass, radius, luminosity and temperature between the primary and the secondary components for the F type NCBs are smaller than those for the A type NCBs. In H-R diagram, the components of the A types are located closer to the terminal age main sequence than those of the F types.

• Geomechanics and Engineering
• /
• v.12 no.4
• /
• pp.639-655
• /
• 2017

The binary mixture consists of two types of granular media with different physical attributes and sizes, which can be characterized by the percentage of large granules by weight (P) and the particle size ratio (${\alpha}$). Researchers determine that two thresholds ($P_S$ and $P_L$) exist for the peak shear strength of binary mixtures, i.e., at $P{\leq}P_S$, the peak shear strength is controlled by the small granules; at $P{\leq}P_L$, the peak shear strength is controlled by the large granules; at $P_S{\leq}P{\leq}P_L$, the peak shear strength is governed by both the large and small granules. However, the thresholds of binary mixtures with different ${\alpha}$ values, and the explanation related to the inner details of binary mixtures to account for why these thresholds exist, require further confirmation. This paper considers the mechanical behavior of binary mixtures with DEM analysis. The thresholds of binary mixtures are found to be strongly related to their coordination numbers $Z_L$ for all values of ${\alpha}$, where $Z_L$ denotes the partial coordination number only between the large particles. The arrangement structure of the large particles is examined when P approaches the thresholds, and a similar arrangement structure of large particles is formed in both 2D and 3D particle systems.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.1
• /
• pp.19-25
• /
• 2012

In evaluating the performance of RFID systems, the tag anti-collision arbitration has been considered to be an important issue. For BT(Binary Tree) and ABS( Adaptive Binary Splitting) protocols, the so-called capture effect, which presumably happens frequently in the process of readers' receiving messages from multiple tags, can lead to some failures in detecting all tags in BT and ABS. In this paper, we propose a new anti-collision protocol, namely FTB (Feedback TagID with Binary splitting), which can solve the aforementioned problem and improve the performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.5
• /
• pp.1766-1784
• /
• 2014

Finger vein images contain rich oriented features. Local line binary pattern (LLBP) is a good oriented feature representation method extended from local binary pattern (LBP), but it is limited in that it can only extract horizontal and vertical line patterns, so effective information in an image may not be exploited and fully utilized. In this paper, an orientation-selectable LLBP method, called generalized local line binary pattern (GLLBP), is proposed for finger vein recognition. GLLBP extends LLBP for line pattern extraction into any orientation. To effectually improve the matching accuracy, the soft power metric is employed to calculate the matching score. Furthermore, to fully utilize the oriented features in an image, the matching scores from the line patterns with the best discriminative ability are fused using the Hamacher rule to achieve the final matching score for the last recognition. Experimental results on our database, MMCBNU_6000, show that the proposed method performs much better than state-of-the-art algorithms that use the oriented features and local features, such as LBP, LLBP, Gabor filter, steerable filter and local direction code (LDC).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4429-4447
• /
• 2018

Local binary descriptors are well-suited for many real-time and/or large-scale computer vision applications, while their low computational complexity is usually accompanied by the limitation of performance. In this paper, we propose a new optimization framework, RLDB (Robust-LDB), to improve a typical region-based binary descriptor LDB (local difference binary) and maintain its computational simplicity. RLDB extends the multi-feature strategy of LDB and applies a more complete region-comparing configuration. A cascade bit selection method is utilized to select the more representative patterns from massive comparison pairs and an online learning strategy further optimizes descriptor for each specific patch separately. They both incorporate LDP (linear discriminant projections) principle to jointly guarantee the robustness and distinctiveness of the features from various scales. Experimental results demonstrate that this integrated learning framework significantly enhances LDB. The improved descriptor achieves a performance comparable to floating-point descriptors on many benchmarks and retains a high computing speed similar to most binary descriptors, which better satisfies the demands of applications.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.7_8
• /
• pp.381-386
• /
• 2003

In this paper, we consider the problem of embedding complete binary trees into 3-dimensional meshes. The method of embedding a complete binary tree into 3-dimensional mesh with the link congestion two is considered in [1], and the embedding in [2] shows that a complete binary tree can be embedded into a ,3-dimensional mesh of expansion 1.27. The proposed embedding in this paper shows that a complete binary tree can be embedded into a 3-dimensional mesh of expansion approximately 1.125 with the link congestion one, using the dimensional ordered routing. Such method yields some improved features in terms of minimizing the link congestion or the expansion of embedding comparing to the previous results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.8
• /
• pp.2101-2123
• /
• 2023

Recent studies have shown that the neural network-based binary code similarity detection technology performs well in vulnerability mining, plagiarism detection, and malicious code analysis. However, existing cross-architecture methods still suffer from insufficient feature characterization and low discrimination accuracy. To address these issues, this paper proposes a cross-architecture binary function similarity detection method based on composite feature model (SDCFM). Firstly, the binary function is converted into vector representation according to the proposed composite feature model, which is composed of instruction statistical features, control flow graph structural features, and application program interface calling behavioral features. Then, the composite features are embedded by the proposed hierarchical embedding network based on a graph neural network. In which, the block-level features and the function-level features are processed separately and finally fused into the embedding. In addition, to make the trained model more accurate and stable, our method utilizes the embeddings of predecessor nodes to modify the node embedding in the iterative updating process of the graph neural network. To assess the effectiveness of composite feature model, we contrast SDCFM with the state of art method on benchmark datasets. The experimental results show that SDCFM has good performance both on the area under the curve in the binary function similarity detection task and the vulnerable candidate function ranking in vulnerability search task.