• 제목/요약/키워드: non-uniform bound

검색결과 20건 처리시간 0.023초

A Non-uniform Bound on Matching Problem

  • Teerapabolarn, Kanint;Neammanee, Kritsana
    • Kyungpook Mathematical Journal
    • /
    • 제46권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.

  • PDF

Exploiting Static Non-Uniform Cache Architectures for Hard Real-Time Computing

  • Ding, Yiqiang;Zhang, Wei
    • Journal of Computing Science and Engineering
    • /
    • 제9권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.

비균일 수렴허용오차 방법을 이용한 분지한계법 개선에 관한 연구 (A Non-Uniform Convergence Tolerance Scheme for Enhancing the Branch-and-Bound Method)

  • 정상진;;최경현;최동훈
    • 대한기계학회논문집A
    • /
    • 제36권4호
    • /
    • pp.361-371
    • /
    • 2012
  • 혼합이산비선형계획법(mixed-discrete nonlinear programming) 문제의 최적화를 위한 대표적인 기법 중에 하나인 분지한계법(branch-and-bound method)은 다른 기법에 비해 강건하지만 분지한계법 내부의 각 노드마다 연속최적화를 수행해야 하기 때문에 많은 함수 계산이 요구되는 것으로 알려져 있다. 이러한 분지한계법의 단점을 극복하기 위하여 크게 두 가지 연구를 수행하였다. 먼저, 분지한계법의 각 노드마다 동일한 수렴허용오차를 설정해주던 기존의 방법을 대체할 수 있는 비균일 수렴허용오차 방법을 제안하였다. 또한 분지한계법에 적용할 수 있는 5 가지 분지순서 방법 중에서 분지한계법의 성능을 가장 극대화할 수 있는 분지순서 방법을 제시하였다. 수렴허용오차 방법과 분지순서 방법들을 각각 선택하여 분지한계법에 적용한 후 7 개의 수학예제와 4 개의 공학예제에 대하여 테스트를 수행한 결과, 제안된 비균일 수렴허용오차 방법과 5 가지 분지순서 방법 중 최소간 격차이법을 분지한계법에 함께 적용할 경우 분지한계법의 성능이 가장 극대화 됨을 확인할 수 있었다.

인발 봉재의 반경방향 불균일 변형률 평가 (Evaluation of Radial Direction Non-uniform Strain in Drawn Bar)

  • 이성민;이인규;이성윤;정명식;문영훈;이상곤
    • 소성∙가공
    • /
    • 제29권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.

PACKING DIMENSION OF MEASURES ON A RANDOM CANTOR SET

  • Baek, In-Soo
    • 대한수학회지
    • /
    • 제41권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.

다중 전송률을 지원하는 VSG-CDMA 역방향 링크 성능 분석 (Performance Analysis of VSG-CDMA Supporting Multi-Rate Date Service in the Reverse Link)

  • 이영호;김항래;김남
    • 한국전자파학회논문지
    • /
    • 제14권3호
    • /
    • pp.268-275
    • /
    • 2003
  • 본 논문에서는 멀티 미디어 서비스를 지원하는 VSG-CDMA 시스템의 역방향 링크 용량을 전력 제어와 사용자 분포에 따라 두 모델로 가정하여 해석적으로 분석한다. 분석 모델 I은 완벽한 전력제어와 사용자의 균일 분포로 가정하여 블록킹 확률식을 계산하고 1 %의 블록킹 확률에 일치하는 최대 음성과 데이터 사용자수를 산출한다. 분석 모델 II은 전력제어오차와 사용자의 비균일(셀 경계 부분에 위치)분포로 가정하여 분석한다. 모델 I의 분석 결과는 5 MHz의 광대역 VSG-CDMA 시스템 용량의 상한선(upper bound)이며 모델 II의 분석 결과는 시스템 용량의 하한선(lower bound)을 제시한다. 또한 모델 II에서 데이터 활동율과E$_{b}$/N$_{o}$ 값에 따른 사용자 용량을 분석하여 VSG-CDMA 시스템의 성능 개선 방안을 제안한다.

An efficient algorithm for the non-convex penalized multinomial logistic regression

  • Kwon, Sunghoon;Kim, Dongshin;Lee, Sangin
    • Communications for Statistical Applications and Methods
    • /
    • 제27권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.

CAGD에서 유리 곡선의 미분과 그 상한에 관한 연구의 흐름 (A Brief History of Study on the Bound for Derivative of Rational Curves in CAGD)

  • 박윤범
    • 한국수학사학회지
    • /
    • 제27권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.

Enhancement of Sensitivity in Interferometric Biosensing by Using a New Biolinker and Prebinding Antibody

  • Park, Jae-Sook;Lim, Sung-Hyun;Sim, Sang-Jun;Chae, Hee-Yeop;Yoon, Hyun-C.;Yang, Sang-Sik;Kim, Byung-Woo
    • Journal of Microbiology and Biotechnology
    • /
    • 제16권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.

실시간 무선 센서 네트워크에서 전송 지연 감소를 위한 MAC 개선 방안 (Improvement of MAC Protocol to Reduce the Delay Latency in Real-Time Wireless Sensor Networks)

  • 장호;정원석;이기동
    • 한국통신학회논문지
    • /
    • 제34권8A호
    • /
    • pp.600-609
    • /
    • 2009
  • 기존의 IEEE 802.11 DCF(Distributed Coordination Function)와 같은 전통적인 CSMA(carrier sense multiple access) 프로토콜은 네트워크 규모가 커짐에 따라서 성능의 급격한 감쇠와 전송 지연 증가를 초래한다. 이러한 문제를 효과적으로 해결하기 위하여 본 논문에서는 무선 센서 네트워크에 적합한 MAC(medium access control) 프로토콜을 제안한다. 기존의 DCF 프로토콜은 데이터 전송을 위한 슬롯(slot)을 선택할 때 패킷 충돌로 인한 재전송이 반복될 때 마다 크기가 커지는 경쟁 윈도우(contention window) 내에서 일반 확률 분포(uniform probability distribution)를 이용한 랜덤(random) 선택 기법을 사용하지만 제안한 프로토콜에서는 전송 지연을 최대한 감소시키기 위하여 경쟁 윈도우의 크기를 고정시키고, 전송 슬롯을 보다 효율적으로 선택하도록 비 균등(non-uniform)확률 분포를 사용하여 전송 슬롯을 랜덤하게 선정한다. 시뮬레이션을 통하여 제안한 프로토콜이 802.11 MAC 표준에 비하여 전송 지연이 감소함을 보여 전송 지연에 민감한 실시간 무선 센서 네트워크의 최적 지연 한계점(best latency bound)을 충족시키는 프로토콜임을 입증한다.