• The Bulletin of The Korean Astronomical Society
• /
• v.39 no.2
• /
• pp.71.2-71.2
• /
• 2014

processes at the origin of the star formation in the galaxies over the last 10 billions years. While it was proposed in the past that merging of galaxies has a dominant role to explain the triggering of the star formation in the distant galaxies having high star formation rates. In the opposite, more recent studies revealed scaling laws linking the star formation rate in the galaxies to their stellar mass or their gas mass. The small dispersion of these laws seems to be in contradiction with the idea of powerful stochastic events due to interactions, but rather in agreement with the new vision of galaxy history where the latter are continuously fed by intergalactic gas. I was especially interested in one of this scaling law, the relation between the star formation (SFR) and the stellar mass (M*) of galaxies, commonly called the main sequence of star forming galaxies. I have studied this main sequence, SFR-M*, in function of the morphology and other physical parameters as the radius, the colour, the clumpiness. The goal was to understand the origin of the sequence's dispersion related to the physical processes underlying this sequence in order to identify the main mode of star formation controlling this sequence. This work needed a multi-wavelength approach as well as the use of galaxies profile simulation to distinguish between the different galaxy morphological types implied in the main sequence.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.19 no.4
• /
• pp.332-341
• /
• 2014

A cascaded H-bridge multi-level STATCOM(STATic synchronous COMpensator), which is composed of many cell inverters with independent dc-sources, generates inevitably dc-side voltage unbalance among phases when it compensates unbalanced load. It comes from the difference of flowing active power in each phase when this compensator makes negative-sequence current to eliminate the unbalance of source-side current. However, this unbalance can be controlled by injecting zero-sequence current which is decoupled with grid currents, so the compensator can work well during this balancing process. Both a feedback control algorithm, which produces zero-sequence current proportional to dc-side voltage unbalance within each phase, and a feedforward control algorithm, which makes zero-sequence current directly from the compensator's negative-sequence current, were proposed. The dc-side voltage of each phase can be controlled stably by these proposed algorithms in both steady-state and transient, so the compensator can have fast response to satisfy control performance under rapid changing load. These balancing controllers were implemented and verified via simulation and experiment.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.1390-1393
• /
• 2003

Work factor approach is conveniently used in metal fracture mechanics to determine fracture toughness from a single fracture test. In this work, we investigated the applicability of the work factor approach in order to determine fracture toughness of thick graphite/epoxy composites in the hydrostatic pressure environment from a single fracture test. The effect of hydrostatic pressure on the elastic work factor was studied, The stacking sequence used was multi-directional, [0$^{\circ}$/${\pm}$45$^{\circ}$/90$^{\circ}$]. The hydrostatic pressures applied were 0.1 MPa, 100 MPa, 200 MPa, and 300 MPa. The results showed that the elastic work factor was not affected by the hydrostatic pressure, The elastic work factor decreased in a linear fashion with crack length.

• Journal of applied mathematics & informatics
• /
• v.32 no.1_2
• /
• pp.61-74
• /
• 2014

This paper describes an iterative method for orthogonal projections $AA^+$ and $A^+A$ of an arbitrary matrix A, where $A^+$ represents the Moore-Penrose inverse. Convergence analysis along with the first and second order error estimates of the method are investigated. Three numerical examples are worked out to show the efficacy of our work. The first example is on a full rank matrix, whereas the other two are on full rank and rank deficient randomly generated matrices. The results obtained by the method are compared with those obtained by another iterative method. The performance measures in terms of mean CPU time (MCT) and the error bounds for computing orthogonal projections are listed in tables. If $Z_k$, k = 0,1,2,... represents the k-th iterate obtained by our method then the sequence of the traces {trace($Z_k$)} is a monotonically increasing sequence converging to the rank of (A). Also, the sequence of traces {trace($I-Z_k$)} is a monotonically decreasing sequence converging to the nullity of $A^*$.

• Journal of Communications and Networks
• /
• v.16 no.1
• /
• pp.92-97
• /
• 2014

A novel method for extracting frequency slippage signal from radar full pulse sequence is presented. For the radar full pulse sequence received by radar interception receiver, radio frequency (RF) and time of arrival (TOA) of all pulses constitute a two-dimensional information sequence. In a complex and intensive electromagnetic environment, the TOA of pulses is distributed unevenly, randomly, and in a nonstationary manner, preventing existing methods from directly analyzing such time series and effectively extracting certain signal features. This work applies Gaussian noise insertion and structure function to the TOA-RF information sequence respectively such that the equalization of time intervals and correlation processing are accomplished. The components with different frequencies in structure function series are separated using empirical mode decomposition. Additionally, a chaos detection model based on the Duffing equation is introduced to determine the useful component and extract the changing features of RF. Experimental results indicate that the proposed methodology can successfully extract the slippage signal effectively in the case that multiple radar pulse sequences overlap.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.1022-1030
• /
• 2003

In this paper we propose a efficient offset curve construction algorithm for $C^0$-continuous Open and Closed 2D sequence curve with line segment in the plane. One of the most difficult problems of offset construction is the loop problem caused by the interference of offset curve segments. Prior work[1-10] eliminates the formation of local self-intersection loop before constructing a intermediate(or raw) offset curve, whereas the global self-intersection loop are detected and removed explicitly(such as a sweep algorithm[13]) after constructing a intermediate offset curve. we propose an algorithm which removes global as well as local intersection loop without making a intermediate offset curve by forward tracing of tangential circle. Offset of both open and closed poly-line segment sequence curve in the plane constructs using the proposed approach.

• Journal of the Korean Society for Precision Engineering
• /
• v.13 no.5
• /
• pp.38-43
• /
• 1996

Windowing routines have as their purpose the reduction of the sidelobes of a spectral output of the FFT or DFT routines. Windowing routines accomplish this by forcing the beginning and end of any sequence to approach each other in value. Since they must work with any sequence they force the beginning and ending samples near zero. To make up for this reduction in power, windowing routines give extra weight to the values near the middle of the sequence. The difference between windows is the way in which they transition from the low weights near the edges to the higher weights neqr the middle of the sequence. Signal-to-noise ratio(SNR) can be determined by the ratio of the output noisy signal variance to the input noisy signal variance of a window. Standard deviation of noise is reduced by windowing. Thus, the windowing operation improved the SNR of the noisy signal. This paper shows a performance estimation of windowing on a single tone with added Gaussian noise and uniform noise.

• The Journal of the Korea Contents Association
• /
• v.11 no.3
• /
• pp.65-72
• /
• 2011

We stand at real world that some practical use method of gene information appears in succession by entrance on the stage of advanced techonlogy. As a lot of studies and development are achieved based on analysis of bio data, necessity of a tool that can help correct interpretation of data is required more and more in a lot of targets of bioinformatics to search new relation and information are established. In this paper, we are offered in existing I wish to offer user a more convenient study tool developing system that can supplement shortcomings of various tools for data analysis. So we've designed to offer in united environment that is not environment that is parted ORF driving out, bio information retrieval and work of similarity comparison lamp to work for bio data analysis and offers lacking consecutiveness in existing analysis system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9A
• /
• pp.1339-1345
• /
• 1999

In this paper we propose the digital information hiding technique by which we use the combination of random sequence and Hadamard matrix to hide multiple information. The prior work used only one random sequence multiplied by information signal to lower the energy level of information signal and thus it is difficult for a third party to detect the information signal or jam it. But because we have to use the orthogonal code for hiding key in order to hide multiple information in the same digital image, only the use of random sequence that are not uncorrelated has some problems in the information hiding scheme. Thus we present a new information hiding scheme that can be used in hiding multiple information by the use of random sequence that spreads the energy level of the data to be hidden and Hadamard matrix that makes the random sequence uncorrelated.

• Industrial Engineering and Management Systems
• /
• v.7 no.2
• /
• pp.84-92
• /
• 2008

Scheduling is one of the most important issues in the planning and operation of production systems. This paper investigates a general job shop scheduling problem with reentrant work flows and sequence dependent setup times. The disjunctive graph representation is used to capture the interactions between machines in job shop. Based on this representation, four two-phase heuristic procedures are proposed to obtain near optimal solutions for this problem. The obtained solutions in the first phase are substantially improved by reversing the direction of some critical disjunctive arcs of the graph in the second phase. A comparative study is conducted to examine the performance of these proposed algorithms.