• 천문학회보
• /
• 제39권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.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제9권1호
• /
• pp.37-50
• /
• 2009

Evaluation results about area scaling capabilities of various SRAM margin-assist techniques for random $V_T$ variability issues are described. Various efforts to address these issues by not only the cell topology changes from 6T to 8T and 10T but also incorporating multiple voltage-supply for the cell terminal biasing and timing sequence controls of read and write are comprehensively compared in light of an impact on the required area overhead for each design solution given by ever increasing $V_T$ variation (${\sigma}_{VT}$). Two different scenarios which hinge upon the EOT (Effective Oxide Thickness) scaling trend of being pessimistic and optimistic, are assumed to compare the area scaling trends among various SRAM solutions for 32 nm process node and beyond. As a result, it has been shown that 6T SRAM will be allowed long reign even in 15 nm node if ${\sigma}_{VT}$ can be suppressed to < 70 mV thanks to EOT scaling for LSTP (Low Standby Power) process.

• 한국통신학회논문지
• /
• 제32권12C호
• /
• pp.1142-1148
• /
• 2007

본 논문에서는 OFDM (Orthogonal Frequency Division Multiplexing) 시스템에서 전송 신호의 PAPR(Peak-to-Average Power Ratio)을 효과적으로 감소시키기 위한 피크 신호 관찰 기반의 적응적 SLM (Adaptive Selective Mapping; ASLM) 기법을 제안한다. 제안 기법은 기존 SLM 방법에서의 복잡도 문제를 개선하기 위해, 매 OFDM 심벌마다 IFFT (Inverse Fast Fourier Transform) 결과에 대한 피크 신호 조정, 피크 조정된 신호의 FFT 결과와 원래 OFDM 심벌간의 부반송파별 전력차 비교를 통한 직교 부호 선택, 선택된 직교 부호만을 이용한 전형적인 SLM 과정의 3단계로 구성된다. 모의실험 결과, 제안된 ASLM 기법은 우수한 PAPR 감소 성능을 유지하면서도 기존 SLM 방법에 비해 훨씬 적은 IFFT 연산 및 PAPR 계산 횟수를 요구함을 확인하였다.

• 천문학회보
• /
• 제41권2호
• /
• pp.58.3-58.3
• /
• 2016

The Kepler space mission provides quantitative and qualitative photometric time series of oscillating stars. It is possible to examine statistical study with seismic properties of solar-like stars. Global seismic properties - large frequency separation (${\Delta}{\nu}$), frequency of maximum power (${\nu}_{max}$) and amplitude of Gaussian envelope (A) widely have been used to determine empirical scaling relations for inferring the stellar physical quantities - mass, age and temperature. We aim to confirm whether width of Gaussian envelope on power excess (${\delta}{\nu}_{env}$) can be used with parameter of scaling relation before redgiant phase using Kepler data. Therefore we analyze the characteristics of ${\delta}{\nu}_{env}$ of 129 solar-like stars from main-sequence to subgiant. We have demonstrated that ${\delta}{\nu}_{env}$ has highly correlations with global parameters - ${\Delta}{\nu}$ and ${\nu}max$. We have also found the break of ${\delta}{\nu}_{env}-{\Delta}{\nu}$ and ${\nu}_{max}$ relations.

• 대한수학회지
• /
• 제45권5호
• /
• pp.1221-1241
• /
• 2008

Most of domains people have studied are convex bounded projective (or affine) domains. Edith $Soci{\acute{e}}$-$M{\acute{e}}thou$ [15] characterized ellipsoid in ${\mathbb{R}}^n$ by studying projective automorphism of convex body. In this paper, we showed convex and bounded projective domains can be identified from local data of their boundary points using scaling technique developed by several mathematicians. It can be found that how the scaling technique combined with properties of projective transformations is used to do that for a projective domain given local data around singular boundary point. Furthermore, we identify even unbounded or non-convex projective domains from its local data about a boundary point.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• pp.15-16
• /
• 2006

In this paper, we propose an adaptive SLM scheme based on peak observation for PAPR reduction of OFDM signals. The proposed scheme is composed of three steps: peak scaling, sequence selection, and SLM procedures. In the first step, the peak signal samples in the IFFT outputs of the original input sequence are scaled down. In the second step, the sub-carrier positions where power difference between the original input sequence and the FFT outputs of the scaled signal is large, are identified. Then, the phase sequences which have the maximum number of phase-reversed sequence words only for these positions, are selected. Finally, only using the selected phase sequences, the generic SLM procedure is performed for the original input sequence. Simulation results reveal that the proposed adaptive SLM remarkably reduces the complexity in terms of IFFT and PAPR calculations than the conventional SLM, while maintaining the PAPR reduction performance.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제14권8호
• /
• pp.763-767
• /
• 2008

본 논문에서는 모바일 환경에서의 3D 그래픽 처리에 효과적인 고성능/저전력의 CORDIC 구조를 구성하기 위하여 각도 기반 검색(ABS)과 스케일링 효과를 고려한 검색(SCS)과 같은 두 가지 오프라인 벡터링 방법을 제안하고 이를 통해 연산의 반복횟수를 줄이는 알고리즘을 개발한다. ABS 알고리즘은 3차원 벡터를 두 각으로 표현하고 이를 검색의 기준으로 삼았고, SCS 알고리즘은 단위 벡터를 기준으로 하여 벡터 회전 시에 최소의 반복 연산만으로도 원하는 회전을 수행할 수 있는 최적의 기본각 회전 시퀀스를 오프라인으로 미리 검색하여 적용한다 본 논문에서 제안하는 ABS, SCS 알고리즘을 통해 지연을 각각 50% 감소시킬 수 있었으며, 이와 함께 voltage scaling 기술을 적용하여 전력 소모를 크게 감소시킬 수 있음을 논의한다.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제3권2호
• /
• pp.157-160
• /
• 2003

In this paper, we describe how to represent lower case hand-written English alphabets by a sequence of two to seven fuzzy sets. Each fuzzy set represents an arc segment of the character and each arc segment is assumed to be a part of an ellipse. The part of an ellipse is defined by five quantities; its short and long radii, its orientation angle, whether it is a part of the lower half or the upper half, and whether it is the full half or a part of a half. Hence, we use the Cartesian product of five fuzzy sets to represent each arc segment. We show that this representation is a translation, rotation, and scaling invariant and that it can be used to generate the hand-written English alphabets. The representation we describe is different from the one proposed earlier by the author and when compared with the previous representation, the one described in this paper simulates more closely the behavior of how one writes English characters.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제6권4호
• /
• pp.234-239
• /
• 2006

In the past decade, several tools have been developed to automate the floating-point to fixed-point conversion for DSP systems. In the conversion process, a number of scaling shifts are introduced, and they inevitably alter the original code sequence. Recently, we have observed that a compiler can often be adversely affected by this alteration, and consequently fails to generate efficient machine code for its target processor. In this paper, we present an optimization technique that safely migrates scaling shifts to other places within the code so that the compiler can produce better-quality code. We consider our technique to be safe in that it does not introduce new overflows, yet preserving the original SQNR. The experiments on a commercial fixed-point DSP processor exhibit that our technique is effective enough to achieve tangible improvement on code size and speed for a set of benchmarks.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제15권4호
• /
• pp.267-275
• /
• 2011

This paper proposes a new quickly convergent pattern search quasi-Newton algorithm that employs the multi-step version of the Symmetric Rank One (SRI). The new algorithm works on the factorizations of the inverse Hessian approximations to make available a sequence of convergent positive bases required by the pattern search process. The algorithm, in principle, resembles that developed in [1] with multi-step methods dominating the dervation and with numerical improvements incurred, as shown by the numerical results presented herein.