• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.24 no.2
• /
• pp.207-213
• /
• 2013

This study describes an omega-K algorithm for focusing bistatic synthetic aperture radar(SAR) data using bistatic-to-monostatic conversion. Bistatic SAR system considered in this study consists of a transmitting antenna and a physical array of several receiving antennas. The length of the physical array is identical to the SAR synthetic aperture. Unlike the monostatic case, an omega-K algorithm for the bistatic case is difficult to obtain the exact equation in the 2D wavenumber domain. The key of the proposed algorithm is converting the bistatic data into a monostatic one. The effectiveness of the proposed algorithm is proved by simulation and real measurement data.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.23 no.8
• /
• pp.1014-1017
• /
• 2012

In this paper, we introduce a method which enhances the azimuth resolution to obtain the high-resolution SAR image. We used ${\omega}-k$ algorithm to obtain the SAR image and extrapolation using auto-regressive(AR) method to enhance the azimuth resolution in the 2-D frequency domain. The AR method is a linear prediction model-based extrapolation technique. In the result, we showed the performance comparison with respect to the target range and the prediction order of Burg algorithm which is one of AR method.

• Journal of Information Processing Systems
• /
• v.9 no.2
• /
• pp.301-314
• /
• 2013

In a parallel processing system, Multi-stage Interconnection Networks (MINs) play a vital role in making the network reliable and cost effective. The MIN is an important piece of architecture for a multiprocessor system, and it has a good impact in the field of communication. Optical Multi-stage Interconnection Networks (OMINs) are the advanced version of MINs. The main problem with OMINs is crosstalk. This paper, presents the (1) Destination Based Modified Omega Network (DBMON) and the (2) Destination Based Scheduling Algorithm (DBSA). DBSA does the scheduling for a source and their corresponding destination address for messages transmission and these scheduled addresses are passed through DBMON. Furthermore, the performance of DBMON is compared with the Crosstalk-Free Modified Omega Network (CFMON). CFMON also minimizes the crosstalk in a minimum number of passes. Results show that DBMON is better than CFMON in terms of the average number of passes and execution time. DBSA can transmit all the messages in only two passes from any source to any destination, through DBMON and without crosstalk. This network is the modified form of the original omega network. Crosstalk minimization is the main objective of the proposed algorithm and proposed network.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.8
• /
• pp.972-982
• /
• 1988

In multiprocessor systems, there are Omega network and M network among various MIN's which interconnect the processor and memory modules. Both one-path Omega network and two-path M network are composed of Log2N stages. In this paper, Augmented M network (AMN) with 2**k+1 paths and Augmented Omega network (AON) with 2**k paths are proposed. The proposed networks can be acomplished by adding K stage(s) to M network and Omega network. Using destination tag, routing algorithm for AMN and AON becomes simple and multiple faults are tolerant. By evaluating RST(request service time) performance of AMN and AON with (Log2N)+K stages, we demonstrated the fact that MMIN (AMN) with 2**k+1 paths performs better than MMIN(AON) with 2**k+1. paths.

• Proceedings of the KIEE Conference
• /
• 2002.07a
• /
• pp.145-147
• /
• 2002

In this paper, the improved fault locating method using distributed parameter which calculating the reduced voltage and current according to the ground capacitance in long transmission line was proposed. For the purpose of the fault locating algorithm non influenced source impedance, the loop method was used in the system modeling analysis. To enhance the fault locating, zero sequence of the fault current which is variable according to ground capacitance was not used but positive and negative sequence. System model was simulated using EMTP software. To verify the accuracy of proposed method, in different cases 64 sampled data per cycle was used and 160km and 300km long transmission line has fault resistance $0{\Omega}\;and\;100{\Omega}$ respectively was compared.

• KSBB Journal
• /
• v.29 no.4
• /
• pp.225-231
• /
• 2014

A microbial fuel cell (MFC) and bioelectrochemical systems are novel bioprocesses which employ exoelectrogenic biofilm on electrode as a biocatalyst for electricity generation and various useful chemical production. Previous reports show that electrogenic biofilms of MFCs are time varying systems and dynamically interactive with the electrically conductive media (carbon paper as terminal electron acceptor). It has been reported that maximum power point tracking (MPPT) method can automatically control load by algorithm so that increase power generation and columbic efficiency. In this study, we developed logic based control strategy for external load resistance by using $LabVIEW^{TM}$ which increases the power production with using flat-plate MFCs and MPPT circuit board. The flat-plate MFCs inoculated with anaerobic digester sludge were stabilized with fixed external resistance from $1000{\Omega}$ to $100{\Omega}$. Automatic load control with MPPT started load from $52{\Omega}$ during 120 hours of operation. MPPT control strategy increased approximately 2.7 times of power production and power density (1.95 mW and $13.02mW/m^3$) compared to the initial values before application of MPPT (0.72 mW and $4.79mW/m^3$).

• Journal of Sensor Science and Technology
• /
• v.26 no.1
• /
• pp.7-14
• /
• 2017

A threshold-based fall recognition algorithm using a tri-axial accelerometer and a bi-axial gyroscope mounted on the skin above the upper sternum was proposed to recognize fall-like activities of daily living (ADL) events. The output signals from the tri-axial accelerometer and bi-axial gyroscope were obtained during eight falls and eleven ADL action sequences. The thresholds of signal vector magnitude (SVM_Acc), angular velocity (${\omega}_{res}$), and angular variation (${\theta}_{res}$) were calculated using MATLAB. When the measured values of SVM_Acc, ${\omega}_{res}$, and ${\theta}_{res}$ were compared to the threshold values (TH1, TH2, and TH3), fall-like ADL events could be distinguished from a fall. When SVM_Acc was larger than 2.5 g (TH1), ${\omega}_{res}$ was larger than 1.75 rad/s (TH2), and ${\theta}_{res}$ was larger than 0.385 rad (TH3), eight falls and eleven ADL action sequences were recognized as falls. When at least one of these three conditions was not satisfied, the action sequences were recognized as ADL. Fall-like ADL events such as jogging and jumping up (or down) have posed a problem in distinguishing ADL events from an actual fall. When the measured values of SVM_Acc, ${\omega}_{res}$, and ${\theta}_{res}$ were applied to the sequential processing algorithm proposed in this study, the sensitivity was determined to be 100% for the eight fall action sequences and the specificity was determined to be 100% for the eleven ADL action sequences.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.26 no.12
• /
• pp.1663-1673
• /
• 2002

In the present paper, flow and heat transfer characteristics of confined impinging slot jets have been numerically investigated using a SIMPLE-based segregated SUPG finite element method. For laminar jets, it is shown that the skin friction coefficient obtained from the present SUPG formulation approaches the grid-independent Galerkin solution inducing negligible false diffusion in the flow field when a moderate number of grid points are used. For turbulent jets, the k-$\omega$turbulence model is adopted. The streamwise mean velocity and the heat transfer coefficient respectively agree very well with existing experimental data within limited ranges of parameters.

• Journal of applied mathematics & informatics
• /
• v.9 no.1
• /
• pp.239-252
• /
• 2002

A sort sequence $S_n$ is sequence of all unordered pairs of indices in $I_n$={1,2,…n}. With a sort sequence $S_n$ = ($s_1,S_2,...,S_{\frac{n}{2}}$),one can associate a predictive sorting algorithm A($S_n$). An execution of the a1gorithm performs pairwise comparisons of elements in the input set X in the order defined by the sort sequence $S_n$ except that the comparisons whose outcomes can be inferred from the results of the preceding comparisons are not performed. A sort sequence is said to be extremal if it maximizes a given objective function. First we consider the extremal sort sequences with respect to the objective function $\omega$($S_n$) - the expected number of tractive predictions in $S_n$. We study $\omega$-extremal sort sequences in terms of their prediction vectors. Then we consider the objective function $\Omega$($S_n$) - the minimum number of active predictions in $S_n$ over all input orderings.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.5
• /
• pp.137-144
• /
• 1989

A new algorithm is presented which efficiently reports minimum width/space violation in a geometric mask pattern. The proposed algorithm solves a sequence of range search problems by employing a plane sweep method. The algorithm runs in O(n log n) time, where n is the number of edges in a mask pattern. Since a lower bound in time conplexity for reporting all minimum width/space violations is ${\Omega}$ (n log n), this algorithm is theoretically optimal within a constant multiplicaive factor. It requires O($n^{0.5}$) space which is very efficient in practice. Moreover, this algorithm, we believe, is easy to implement and practically fast (116.7 seconds for a rectilinear region with 250000 vertices ar VAX 8650.)