• Computers and Concrete
• /
• v.21 no.2
• /
• pp.149-156
• /
• 2018

This paper investigated the influence of binary and ternary blends of mineral admixtures in self-compacted mortar (SCM) on the fresh, mechanical and durability properties. For this purpose, 25 mortar mixtures were prepared having a total binder content of $640kg/cm^3$ and water/binder ratio between 0.41 and 0.50. All the mixtures consisted of Portland cement (PC), fly ash (FA) and silica fume (SF) as binary and ternary blends and air-entrained admixture wasn't used while control mixture contained only PC. The compressive and tensile strength tests were conducted for 28 and 91 days as well as slump-flow and V-funnel time tests whilst freeze-thaw (F-T) resistance and capillary water absorption tests were made for 91-day. Finally, in general, the use of SF with FA as ternary blends improved the tensile strength of mortars at 28- and 91-day while the use of SF15 with FA increased the compressive strength of the mortars compared to binary blends of FA. SCM mixtures with ternary blends had lower the sorptivity values than that of the mortars with binary blends of FA and the control mixture due to the beneficial properties of SF while the use of FA with SF as ternary blends induced the F-T resistance enhancement.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.28 no.10
• /
• pp.1574-1582
• /
• 2004

Binary manipulators have recently received much attention due to hyper-redundancy, light weight, good controllability and high reliability. The precise positioning of the manipulator end-effecter requires the use of many modules, which results in a high-dimensional workspace. When the workspace dimension is large, existing inverse kinematics methods such as the Ebert-Uphoff algorithm may require impractically large memory size in determining the binary positions of all actuators. To overcome this limitation, we propose a new inverse kinematics algorithm: the inverse kinematics problem is formulated as an optimization problem using real-valued design variables, The key procedure in this approach is to transform the integer-variable optimization problem to a real-variable optimization problem and to push the real-valued design variables as closely as possible to the permissible binary values. Since the actual optimization is performed in real-valued design variables, the design sensitivity becomes readily available, and the optimization method becomes extremely efficient. Because the proposed formulation is quite general, other design considerations such as operation power minimization can be easily considered.

• Journal of Electrical Engineering and Technology
• /
• v.4 no.3
• /
• pp.323-329
• /
• 2009

This paper presents a new approach for thermal unit commitment (UC) using a differential evolution (DE) algorithm. DE is an effective, robust, and simple global optimization algorithm which only has a few control parameters and has been successfully applied to a wide range of optimization problems. However, the standard DE cannot be applied to binary optimization problems such as UC problems since it is restricted to continuous-valued spaces. This paper proposes binary differential evolution (BDE), which enables the DE to operate in binary spaces and applies the proposed BDE to UC problems. Furthermore, this paper includes heuristic-based constraint treatment techniques to deal with the minimum up/down time and spinning reserve constraints in UC problems. Since excessive spinning reserves can incur high operation costs, the unit de-commitment strategy is also introduced to improve the solution quality. To demonstrate the performance of the proposed BDE, it is applied to largescale power systems of up to 100-units with a 24-hour demand horizon.

• Journal of Sensor Science and Technology
• /
• v.29 no.2
• /
• pp.82-88
• /
• 2020

In this paper, we propose a complementary metal-oxide semiconductor (CMOS) binary image sensor with a gate/body-tied (GBT) p-channel metal-oxide-semiconductor field-effect transistor (PMOSFET)-type photodetector using a double-tail comparator for high-speed and low-power operations. The GBT photodetector is based on a PMOSFET tied with a floating gate (n+ polysilicon) and a body that amplifies the photocurrent generated by incident light. A double-tail comparator compares an input signal with a reference voltage and returns the output signal as either 0 or 1. The signal processing speed and power consumption of a double-tail comparator are superior over those of conventional comparator. Further, the use of a double-sampling circuit reduces the standard deviation of the output voltages. Therefore, the proposed CMOS binary image sensor using a double-tail comparator might have advantages, such as low power consumption and high signal processing speed. The proposed CMOS binary image sensor is designed and simulated using the standard 0.18 ㎛ CMOS process.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.5 no.2
• /
• pp.21-28
• /
• 2009

This paper proposes RCBT(Reduced Compact Binary trie) to correct faults of CBT (Compact Binary trie). First, in the case of CBT, a compact structure was tried for the first time, but as the amount of data was increasing, that of inputted data gained and much difficulty was experienced in insertion due to the dummy nodes used in balancing trees. On the other hand, if the HCBT realized hierarchically, given certain depth to prevent the map from increasing onthe right, reached the depth, the method for making new trees and connecting to them was used. Eventually, fast progress could be made in the inputting and searching speed, but this had a disadvantage of the storage space becoming bigger because of the use of dummy nods like CBT and of many tree links. In the case of RCBT in this thesis, a capacity is increased by about 60% by completely cutting down dummy nods.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.4
• /
• pp.539-544
• /
• 2011

Balanced binary sequences of period $2^n-1(n{\geq}1)$ having the two-valued autocorrelation function have many applications in spread-spectrum communications system. In this paper we propose new nonlinear binary sequences which are constructed from Legendre sequences with the same cross-correlation as the sequences proposed by Cho. These sequences include the m-sequences, GMW sequences, Kasami sequences and No sequences which are described in terms of the trace function over a finite field. Also the proposed sequences have more low cross-correlation distribution than the quadratic form sequences proposed by Klapper.

• Journal of Advanced Navigation Technology
• /
• v.15 no.5
• /
• pp.735-741
• /
• 2011

In this paper, we have analyzed the effect of SNR estimation error on the BER performance of MMSE-DFE in high-speed binary CDMA system. Since MMSE equalization algorithm requires the SNR value of input signal, it should be estimated using CAZAC sequence in preamble. However, when AWGN and ISI exist simultaneously, it is impossible to estimate the exact SNR value of input signal and thereby equalizer's performance may be deteriorated. The simulation results can be used as a guideline for selection of SNR estimation algorithm for MMSE-DFE design.

• Journal of Intelligence and Information Systems
• /
• v.12 no.1
• /
• pp.107-123
• /
• 2006

We propose the Generalized Binary Second-order Recurrent Neural Networks(GBSRNNf) being equivalent to regular grammars and ?how the implementation of lexical analyzer recognizing the regular languages by using it. All the equivalent representations of regular grammars can be implemented in circuits by using GSBRNN, since it has binary-valued components and shows the structural relationship of a regular grammar. For a regular grammar with the number of symbols m, the number of terminals p, the number of nonterminals q, and the length of input string k, the size of the corresponding GBSRNN is $O(m(p+q)^2)$ and its parallel processing time is O(k) and its sequential processing time, $O(k(p+q)^2)$.

• The Journal of the Korea Contents Association
• /
• v.14 no.11
• /
• pp.541-548
• /
• 2014

In this paper, we introduce a second version of modified binary particle swarm optimization using a concept of genotype-phenotype in genetic algorithms. Particle swarm optimization uses an information of difference between a position of the best solution and one's own position in the process of searching optimum. To obtain this difference of positions, the first version of modified binary particle swarm optimization uses a phenotype but the proposed second version uses a genotype. We can represent the solution space in large search space by using a genotype which provides continuous whole space as search space compared to a phenotype which provides only binary information. Experimental results in 10 De Jong benchmark function show that the second version outperforms the first version in six functions which has a broad search space and many local optima.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.2
• /
• pp.203-210
• /
• 2001

To estimate relational models and test the theoretical hypotheses of binary tree search algorithms, we built binary search trees with random permutations of n (number of nodes) distinct numbers, which ranged from three to seven. Probabilities for building binary search trees corresponding to each possible height and balance factor were estimated. Regression models with variables of number of nodes, height, and average number of comparisons were estimated and the theorem of O(1g(n)) was accepted experimentally by a Lack of Test procedure. Analysis of Variance model was applied to compare the average number of comparisons with three groups by height and balance factor of the trees to test theoretical hypotheses of a binary search tree performance statistically.