• Journal of applied mathematics & informatics
• /
• v.25 no.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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8B
• /
• pp.667-680
• /
• 2008

In this work, we present the results of our empirical study on 802.11 wireless LAN network traffic. We collect the packet trace from existing campus wireless LAN infra-structure. We analyzed four different data sets: aggregate traffic, upstream traffic, downstream traffic, tcp only packet trace from aggregate traffic. We analyze the time series aspect of underlying traffic (byte count process and packet count process), marginal distribution of time series, and packet size distribution. We found that in all four data sets there exist long-range dependent property in byte count and packet count process. Inter-arrival distribution is well fitted with Pareto distribution. Upstream traffic, i.e. from the user to Internet, exhibits significant difference in its packet size distribution from the rests. Average packet size of upstream traffic is 151.7 byte while average packet size of the rest of the data sets are all greater than 260 bytes. Packets with full data payloads constitutes 3% and 10% in upstream traffic and the downstream traffic, respectively. Despite the significant difference in packet size distribution, all four data sets have similar Hurst values. The Hurst alone does not properly explain the stochastic characteristics of the underlying traffic. We model the underlying traffic using fractional-ARIMA (FARIMA) and fractional Gaussian Noise (FGN). While the fractional Gaussian Noise based method is computationally more efficient, FARIMA exhibits superior performance in accurately modeling the underlying traffic.

• Journal of applied mathematics & informatics
• /
• v.23 no.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
• /
• v.26 no.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).

• Journal of the Korean Operations Research and Management Science Society
• /
• v.21 no.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
• /
• v.27 no.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
• /
• v.17 no.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
• /
• v.14 no.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.

• Journal of the Korean Mathematical Society
• /
• v.56 no.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
• /
• v.31 no.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.