• Journal of Korea Water Resources Association
• /
• v.38 no.8 s.157
• /
• pp.691-698
• /
• 2005

A series of experiments has been performed to investigate the flapping motion, which has been generally considered as an intrinsic characteristic of plane flow, of the horizontal merging buoyant jet discharged into stationary ambient water. For Horizontal merging buoyant jets, the flapping motions has been observed and the average onsets of flapping motion coincided with the start of merging transition. The Strouhal number, which describes the measure of frequency of vortices on the flow boundary with respect to the local properties of the flow, varies and converges to a constant value over merging transition. Considering the merging transition and the variation of local flow properties, the characteristics of flapping motion of plane flow can be applied to merging buoyant jets.

• Journal of Korean Society of Transportation
• /
• v.25 no.2 s.95
• /
• pp.73-81
• /
• 2007

The purpose of this paper is to perform a basic study on the interaction between lanes, which can be achieved through analyzing traffic breakdown at the microscopic level. Using aerial photographic data for the microscopic analysis, this study analyzed the characteristics of traffic flow at a merging area. This research produced aggregated traffic data such as flows, speeds, and densities in 30 second intervals by lane for the macroscopic analysis and individual headway data by lane for the microscopic analysis. The paper contains an analysis of lane characteristics through flows, speeds, densities, and headway variations and also investigates the influence of ramp flows on mainline flows with space-time diagrams. Firstly, the merging area in this study is divided into three sections: before-merging, during-merging, and after-merging. The transition process was analyzed at each lane. Secondly, the breakdown was observed in detail with data divided in 50-foot units. The breakdown was checked through the relationships between ramp and freeway mainline flows, various techniques were proposed to analyze the breakdown, and the formation of breakdown was introduced as three stages in this study. In the near future, the findings of this study could contribute to determining the dynamic capacity on freeways by easily understanding changeable traffic breakdown patterns over time and space.

• Publications of The Korean Astronomical Society
• /
• v.27 no.4
• /
• pp.331-334
• /
• 2012

We investigate the role of galaxy environment in the evolution of individual galaxies through the AKARI observations of the merging galaxy cluster A2255. MIR diagnostics using N3-S11 colors are adopted to select star-forming galaxies and galaxies in transition between star-forming galaxies and quiescent galaxies. We do not find particular enhancement of star formation rates as a function of galaxy environment, reflected in cluster-centric distance and local surface density of galaxies. Instead, the locations of intermediate MIR-excess galaxies (-1.2 < N3 - S11 < 0.2) show that star-forming galaxies are transformed into passive galaxies in the substructures of A2255, where the local surface density of galaxies is relatively high.

• The Journal of the Acoustical Society of Korea
• /
• v.13 no.1
• /
• pp.14-23
• /
• 1994

In this paper, speech units appropriate for recognition of Korean language have been studied. For better speech recognition, co-articulatory effects within an utterance should be considered in the selection of a recognition unit. One way to model such effects is to use larger units of speech. It has been found that diphone is a good recognition unit because it can model transitional legions explicitly. When diphone is used, stationary phoneme models may be inserted between diphones. Computer simulation for isolated word recognition was done with 7 word database spoken by seven male speakers. Best performance was obtained when transition regions between phonemes were modeled by two-state HMM's and stationary phoneme regions by one-state HMM's excluding /b/, /d/, and /g/. By merging rarely occurring diphone units, the recognition rate was increased from $93.98\%$ to $96.29\%$. In addition, a local interpolation technique was used to smooth a poorly-modeled HMM with a well-trained HMM. With this technique we could get the recognition rate of $97.22\%$ after merging some diphone units.

• Journal of KIISE:Software and Applications
• /
• v.35 no.12
• /
• pp.753-763
• /
• 2008

The amount of UCCs (User Created Contents) has been increasing rapidly and is associated with a serious copyright problem. Automatic logo detection in videos is an efficient means of overcoming the copyright problem. However, logos have varying characteristics, which make logo detection and recognition very difficult. Especially, there are frequent logo transitions in a video, comprising several video contents. This disrupts accurate video segmentation based on logos. Therefore, this paper proposes an accurate logo transition detection method for recognizing logos in digital video contents. The proposed method accurately segments a video according to logo and efficiently recognizes various types of logos. The experimental results demonstrate the effectiveness of the proposed method for logo detection and video segmentation according to logo.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.25 no.6
• /
• pp.786-798
• /
• 2001

This paper describes the phenomena of wake-induced transition of the boundary layers on a NACA0012 airfoil using measured phase-averaged data. Especially, the phase-averaged wall shear stresses are reasonably evaluated using the principle of Computational Preston Tube Method. Due to the passing wake, the turbulent patch is generated in the laminar boundary layer on the airfoil and the boundary layer becomes temporarily transitional. The patches propagate downstream with less speed than free-stream velocity and merge with each other at further down stream station, and the boundary layer becomes more transitional. The generation of turbulent patch at the leading edge of the airfoil mainly depends on velocity defects and turbulent intensity profiles of passing wakes. However, the growth and merging of turbulent patches depend on local streamwise pressure gradients as well as characteristics of turbulent patches. In this transition process, the present experimental data show very similar features to the previous numerical and experimental studies. It is confirmed that the two phase-averaged mean velocity dips appear in the outer region of transitional boundary layer for each passing cycle. Relatively high values of the phase-averaged turbulent fluctuations in the outer region indicate the possibility that breakdown occurs in the outer layer not near the wall.

• The KIPS Transactions:PartA
• /
• v.9A no.1
• /
• pp.61-74
• /
• 2002

This paper presents a method which synthesizes asynchronous circuits from free-choice Signal Transition Graphs (STGs) with timing constraints. The proposed method synthesizes asynchronous circuits by analyzing: the relations between signal transitions directly from the STGs without generating state graphs. The synthesis procedure decomposes a free-choice STG into deterministic STGs which do not have choice behavior. Then, a timing analysis extracts the timed concurrency and tamed causality relations between any two signal transitions for each deterministic STG. The synthesis procedure synthesizes circuits for each deterministic STG and synthesizes the final circuit by merging the circuits for each deterministic STG. The experimental results show that our method achieves significant reductions in synthesis time for the circuits which have a large state space, and generates circuits that have nearly the same area as compared to previous methods.

• Journal of information and communication convergence engineering
• /
• v.5 no.2
• /
• pp.131-135
• /
• 2007

In this paper, The proposed algorithm consists of three steps. In the first step, TD(Transition Density) calculation has to be performed. a CLB-based CPLD low-power technology mapping algorithm considered a Trade-off is proposed. To perform low-power technology mapping for CPLDs, a given Boolean network has to be represented in a DAG. Total power consumption is obtained by calculating the switching activity of each node in a DAG. In the second step, the feasible clusters are generated by considering the following conditions: the number of inputs and outputs, the number of OR terms for CLB within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. In the final step, low-power technology mapping based on the CLBs packs the feasible clusters. The proposed algorithm is examined using SIS benchmarks. When the number of OR terms is five, the experiment results show that power consumption is reduced by 30.73% compared with TEMPLA, and by 17.11 % compared with PLA mapping.

• Proceedings of the IEEK Conference
• /
• 2003.07b
• /
• pp.1165-1168
• /
• 2003

In this paper, a CLB-based CPLD low-power technology mapping algorithm is proposed. To perform low power technology mapping for CPLD, a given Boolean network have to be represented to DAG. The proposed algorithm are consist of three step. In the first step, TD(Transition Density) calculation have to be performed. In the second step, the feasible clusters are generated by considering the following conditions: the number of output, the number of input and the number of OR-terms for CLB(Common Logic Block) within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. In the final step, low power technology mapping based on the CLBs is packing the feasible clusters into the several proper CLBs. Therefore the proposed algorithm is proved an efficient algorithm for a low power CPLD technology mapping.

• Journal of information and communication convergence engineering
• /
• v.5 no.1
• /
• pp.59-63
• /
• 2007

In this paper, a CLB-based CPLD low-power technology mapping algorithm considered a Trade-off is proposed. To perform low-power technology mapping for CPLDs, a given Boolean network has to be represented in a DAG. The proposed algorithm consists of three steps. In the first step, TD(Transition Density) calculation has to be performed. Total power consumption is obtained by calculating the switching activity of each node in a DAG. In the second step, the feasible clusters are generated by considering the following conditions: the number of inputs and outputs, the number of OR terms for CLB within a CPLD. The common node cluster merging method, the node separation method, and the node duplication method are used to produce the feasible clusters. In the final step, low-power technology mapping based on the CLBs packs the feasible clusters. The proposed algorithm is examined using SIS benchmarks. When the number of OR terms is five, the experiment results show that power consumption is reduced by 30.73% compared with TEMPLA, and by 17.11 % compared with PLA mapping.