• Journal of applied mathematics & informatics
• /
• 제25권1_2호
• /
• pp.85-107
• /
• 2007

In this paper, we develop a fairly large number of sets of global semiparametric sufficient efficiency conditions under various generalized (${\theta},{\eta},{\rho}$)-V-invexity assumptions for a multiobjective fractional programming problem involving arbitrary norms.

• 한국통신학회논문지
• /
• 제33권8B호
• /
• pp.667-680
• /
• 2008

본 논문에서는 802.11 무선 랜 네트워크 트래픽의 실제 관측 자료에 대한 연구 결과를 보인다. 패킷 트레이스는 대학 캠퍼스의 무선 랜 시설에서 얻은 자료로서 총합된 트래픽(aggregate traffic), 업스트림 트래픽(upstream traffic), 다운스트림 트래픽(downstream traffic), 그리고 TCP 패킷으로만 구성된 통합된 트래픽으로 이 4개의 트래픽 데이터를 수집하였다. 수집한 데이터에서 byte count 프로세스와 packet count 프로세스로 구성된 트래픽의 시계열과 시계열의 주변분포, 그리고 패킷 크기 분포에 대한 분석을 한다. 4개의 모든 데이터의 byte count 프로세스와 packet count 프로세스에서 장기 의존성 성질이 나타났다. 사용자가 인터넷으로 접속하는 없트�� 트래픽의 평균 패킷 크기는 151.7 byte였는데 다른 데이터의 평균 패킷 크기는 모드 260 byte 이상이었다. 최대 크기를 갖는 패이로드(payload)는 업스트림에서 3%, 그리고 나온트림에서 10%로 나타났다. 이런 분명한 패킷 크기 분포의 차이에도 불구하고 모든 4개의 데이터에서는 허스트(Hurst) 값이 모두 유사하게 나왔다. 허스트 값만으로는 트래픽의 확률적 특성을 충분히 설명할 수가 없다. 트래픽의 특성을 fractional-ARIMA(FARINA) 그리고 fractional Gaussian noise(FGN)으로 모델링을 한다. FGN은 연산을 하는데 있어서는 더 효율적이었고, FARINA는 트래픽 특성을 정확하게 모델링하는데 더 좋은 결과를 얻었다.

• Journal of applied mathematics & informatics
• /
• 제23권1_2호
• /
• pp.1-23
• /
• 2007

The purpose of this paper is to develop a fairly large number of sets of global parametric sufficient optimality conditions under various generalized $({\theta},\;{\eta},\;{\rho})-V-invexity$ assumptions for a discrete minmax fractional programming problem involving arbitrary norms.

• Nonlinear Functional Analysis and Applications
• /
• 제26권1호
• /
• pp.65-70
• /
• 2021

We characterize the solution set for a second-order cone linear fractional optimization problem (P). We present sequential Lagrange multiplier characterizations of the solution set for the problem (P) in terms of sequential Lagrange multipliers of a known solution of (P).

• 한국경영과학회지
• /
• 제21권3호
• /
• pp.227-236
• /
• 1996

In this paper an algorithm based on cutting plane approach is developed which constructs all the efficient p-tuples of multiobjective integer linear fractional programming problem. The integer solution is constrained to satisfy and h out of n additional constraint sets. A numerical illustration in support of the proposed algorithm is developed.

• Korean Journal of Mathematics
• /
• 제27권2호
• /
• pp.279-295
• /
• 2019

In this paper, using local fractional integrals on fractal sets $R^{\alpha}(0<{\alpha}{\leq}1)$ of real line numbers, we establish new some inequalities of Simpson's type based on generalized convexity.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제17권4호
• /
• pp.534-542
• /
• 2017

This paper presents a fast locking technique for a fractional-N PLL frequency synthesizer. The technique directly measures $K_{VCO}$ on a chip, computes the VCO's target tuning voltage for a given target frequency, and directly sets the loop filter voltage to the target voltage before the PLL begins the normal closed-loop locking process. The closed-loop lock time is significantly minimized because the initial frequency of the VCO are put very close to the desired final target value. The proposed technique is realized and designed for a 4.3-5.3 GHz fractional-N synthesizer in 65 nm CMOS and successfully verified through extensive simulations. The lock time is less than $12.8{\mu}s$ over the entire tuning range. Simulation verifications demonstrate that the proposed method is very effective in reducing the synthesizer lock time.

• Journal of the Korean Data and Information Science Society
• /
• 제14권3호
• /
• pp.707-714
• /
• 2003

Because of complex aliasing, nonregular designs have traditionally been used for screening only main effects. However, complex aliasing actually may allow some interactions entertained and estimated without making additional runs. According to hierarchical principle, the minimum aberration has been used as an important criterion for selecting regular fractional factorial designs. The criterion is not applicable to nonregular designs. In this paper, we give a criterion for choosing fractional factorial designs based on the fan theory. The criterion is focused on the partial ordering given by set inclusion on estimable sets which is called leaves.

• 대한수학회지
• /
• 제56권1호
• /
• pp.91-111
• /
• 2019

We give a direct proof of the sharp two-sided estimates, recently established in [4, 9], for the Dirichlet heat kernel of the fractional Laplacian with gradient perturbation in $C^{1,1}$ open sets by using Duhamel's formula. We also obtain a gradient estimate for the Dirichlet heat kernel. Our assumption on the open set is slightly weaker in that we only require D to be $C^{1,{\theta}}$ for some ${\theta}{\in}({\alpha}/2,1]$.

• East Asian mathematical journal
• /
• 제31권5호
• /
• pp.677-684
• /
• 2015

In [7], it was shown that Euclidean rings R of imaginary quadratic integers admit unitary number systems. In this paper, as an application of the result, we obtain all self similar tiles arising from the unitary number systems of R.