• Kyungpook Mathematical Journal
• /
• v.46 no.4
• /
• pp.489-496
• /
• 2006

The aim of this paper is to use the Stein-Chen method to obtain a non-uniform bound on Poisson approximation in matching problem.

• Journal of Computing Science and Engineering
• /
• v.9 no.4
• /
• pp.177-189
• /
• 2015

High-performance processors using Non-Uniform Cache Architecture (NUCA) are increasingly used to deal with the growing wire delays in multicore/manycore processors. Due to the convergence of high-performance computing with embedded computing, NUCA caches are expected to benefit high-end embedded systems as well. However, for real-time systems that use multicore processors with NUCA caches, it is crucial to bound worst-case execution time (WCET) accurately and safely. In this paper, we developed a WCET analysis approach by considering the effect of static NUCA caches on WCET. We compared the WCET in real-time applications with different topologies of static NUCA caches. Our experimental results demonstrated that the static NUCA cache could improve the worst-case performance of realtime applications using multicore processor compared to the cache with uniform access time.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.36 no.4
• /
• pp.361-371
• /
• 2012

In order to improve the efficiency of the branch-and-bound method for mixed-discrete nonlinear programming, a nonuniform convergence tolerance scheme is proposed for the continuous subproblem optimizations. The suggested scheme assigns the convergence tolerances for each continuous subproblem optimization according to the maximum constraint violation obtained from the first iteration of each subproblem optimization in order to reduce the total number of function evaluations needed to reach the discrete optimal solution. The proposed tolerance scheme is integrated with five branching order options. The comparative performance test results using the ten combinations of the five branching orders and two convergence tolerance schemes show that the suggested non-uniform convergence tolerance scheme is obviously superior to the uniform one. The results also show that the branching order option using the minimum clearance difference method performed best among the five branching order options. Therefore, we recommend using the "minimum clearance difference method" for branching and the "non-uniform convergence tolerance scheme" for solving discrete optimization problems.

• Transactions of Materials Processing
• /
• v.29 no.6
• /
• pp.356-361
• /
• 2020

In general, the drawing process is performed in a multi-pass to meet the required shape and cross section. In the drawn material, the surface strain is relatively higher than the center due to the direct contact with the die. Therefore, a non-uniform strain distribution appears in the surface of the material where the strain is concentrated and the center having a relatively low strain, thus it is difficult to predict the strain in the drawn material. In this study, the non-uniform strain distribution was evaluated using a finite element analysis and the non-uniform strain distribution model based on the upper bound method. In addition, the relationship between the hardness and the strain was established through a simple compression test to evaluate the distribution of the strain in the experimentally multi-pass drawn bar.

• Journal of the Korean Mathematical Society
• /
• v.41 no.5
• /
• pp.933-944
• /
• 2004

Packing dimension of a set is an upper bound for the packing dimensions of measures on the set. Recently the packing dimension of statistically self-similar Cantor set, which has uniform distributions for contraction ratios, was shown to be its Hausdorff dimension. We study the method to find an upper bound of packing dimensions and the upper Renyi dimensions of measures on a statistically quasi-self-similar Cantor set (its packing dimension is still unknown) which has non-uniform distributions of contraction ratios. As results, in some statistically quasi-self-similar Cantor set we show that every probability measure on it has its subset of full measure whose packing dimension is also its Hausdorff dimension almost surely and it has its subset of full measure whose packing dimension is also its Hausdorff dimension almost surely for almost all probability measure on it.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.14 no.3
• /
• pp.268-275
• /
• 2003

In this paper, the capacity of VSG-CDMA system supporting multi-media service in the reverse link is analyzed by considering the two models according to the power control and user distribution. In analysis model I, assuming perfect power control and uniform distribution of users, the equation of blocking probability is calculated and the maximum number of voice and data user is derived in accordance with 1 % blocking probability. In analysis model II, it is analyzed by assuming power control error and non-uniform distribution of users. The result of analysis model I means the upper bound of system capacity in the 5 MHz wideband VSG-CDMA system, and the result of analysis model II shows the lower bound of system capacity. Also, the improved plan of performance for VSG-CDMA system is suggested by the analyzed result according to data activity and the value of $E_b/N_o$ in model II.

• Communications for Statistical Applications and Methods
• /
• v.27 no.1
• /
• pp.129-140
• /
• 2020

In this paper, we introduce an efficient algorithm for the non-convex penalized multinomial logistic regression that can be uniformly applied to a class of non-convex penalties. The class includes most non-convex penalties such as the smoothly clipped absolute deviation, minimax concave and bridge penalties. The algorithm is developed based on the concave-convex procedure and modified local quadratic approximation algorithm. However, usual quadratic approximation may slow down computational speed since the dimension of the Hessian matrix depends on the number of categories of the output variable. For this issue, we use a uniform bound of the Hessian matrix in the quadratic approximation. The algorithm is available from the R package ncpen developed by the authors. Numerical studies via simulations and real data sets are provided for illustration.

• Journal for History of Mathematics
• /
• v.27 no.5
• /
• pp.329-345
• /
• 2014

CAGD(Computer Aided Geometric Design) is a branch of applied mathematics concerned with algorithms for the design of smooth curves and surfaces and for their efficient mathematical representation. The representation is used for the computation of the curves and surfaces, as well as geometrical quantities of importance such as curvatures, intersection curves between two surfaces and offset surfaces. The $B\acute{e}zier$ curves, B-spline, rational $B\acute{e}zier$ curves and NURBS(Non-Uniform Rational B-Spline) are basically and widely used in CAGD. The definitions and properties of these curves are presented in this paper. And a brief history of study on the bound for derivative of rational curves in CAGD is also presented.

• Journal of Microbiology and Biotechnology
• /
• v.16 no.12
• /
• pp.1968-1976
• /
• 2006

Recombinant E. coli ACV 1003 (recA:: lacZ) was used to measure low concentrations of DNA-damaging chemicals, which produce $\beta$-galactosidase via an SOS regulon system. Very low $\beta$-galactosidase activities of less than 0.01 unit/ml, $\beta$-galactosidase produced through an SOS response corresponding to the 10 ng/ml (ppb) of DNA damaging chemicals in the environment, can be rapidly determined by using an alternative interferometric biosensor with optically flat thin films of porous silicon rather than by the conventional time-consuming Miller's enzyme assay as well as the ELISA method. fu order to enhance the sensitivity in the interferometry, it needs to obtain more uniform distribution and higher biolinking efficiency, whereas interferometric sensing is rapid, cheap, and advantageous in high throughput by using a multiple-well-type chip. In this study, pore size adjusted to 60 nm for the target enzyme $\beta$-galactosidase to be bound on both walls of a Si pore and a calyx crown derivative was apllied as a more efficient biolinker. Furthermore, anti-$\beta$-galactosidase was previously functionalized with the biolinker for the target $\beta$-galactosidase to be specifically bound. When anti-$\beta$-galactosidase was bound to the calyx-crown derivative-linked surface, the effective optical thickness was found to be three times as high as that obtained without using anti-$\beta$-galactosidase. The resolution obtained was very similar to that afforded by the time-consuming ELISA method; however, the reproducibility was still unsatisfactory, below 1 unit $\beta$-galactosidase/ml, owing to the microscopic non-uniform distribution of the pores in the etched silicon surface.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.8A
• /
• pp.600-609
• /
• 2009

The traditional carrier sense multiple access (CSMA) protocol like IEEE 802.11 Distributed Coordination Function (DCF) does not handle the constraints adequately, leading to degraded delay latency and throughput as the network scales are enlarged. We present more efficient method of a medium access for real-time wireless sensor networks. Proposed MAC protocol is like the randomized CSMA protocol, but unlike previous legacy protocols, it does not use a time-varying contention window from which a node randomly picks a transmission slot. To reduce the latency for the delivery of event reports, we carefully decide to select a fixed-size contention window with non-uniform probability distribution of transmitting in each slot. We show that the proposed method can offer up to severaansimes latency reduction compared to legacy of IEEE 802.11 as the size of the sensor network scales up to 256 nodes using widely using network simulation package,caS-2. We finally show that proposed MAC scheme comes close to meet bounds on the best latency being achieved by a decentralized CSMA-based MAC protocol for real-time wireless sensor networks which is sensitive to delay latency.