• 제목/요약/키워드: convexity number

검색결과 25건 처리시간 0.025초

$(P_{1},P_2)$-PLP 의 해법에 관한 연구 (An Efficient Solution Procedure for $(P_{1},P_2)$)

  • 손기형
    • 한국경영과학회지
    • /
    • 제17권1호
    • /
    • pp.17-30
    • /
    • 1992
  • This paper concerns with (p$_{1}$, p$_{2}$)-Plant Location problem in which entire set of candidate sites for facility locations is divided by two overlapping subsets, each of which with its own number of facilities to be established. We propose an algorithm which attempts to solve the Lagrangean dual of (p$_{1}$, p$_{2}$)-PLP by dividing sub-problem into twop-Plant Location Problems and solving them based on the convexity of the Lagrangean dual problem with respect to the number of facilities to be established. In doing so, Orthogonal Move procedure is proposed to provide easy-to-obtain lower bound to the Lagrangean Dual of (p$_{1}$, p$_{2}$)-PLP. Computational experience is reported.

  • PDF

Worst Closed-Loop Controlled Bulk Distributions of Stochastic Arrival Processes for Queue Performance

  • Lee Daniel C.
    • Journal of Communications and Networks
    • /
    • 제7권1호
    • /
    • pp.87-92
    • /
    • 2005
  • This paper presents basic queueing analysis contributing to teletraffc theory, with commonly accessible mathematical tools. This paper studies queueing systems with bulk arrivals. It is assumed that the number of arrivals and the expected number of arrivals in each bulk are bounded by some constraints B and (equation omitted), respectively. Subject to these constraints, convexity argument is used to show that the bulk-size probability distribution that results in the worst mean queue performance is an extremal distribution with support {1, B} and mean equal to A. Furthermore, from the viewpoint of security against denial-of-service attacks, this distribution remains the worst even if an adversary were allowed to choose the bulk-size distribution at each arrival instant as a function of past queue lengths; that is, the adversary can produce as bad queueing performance with an open-loop strategy as with any closed-loop strategy. These results are proven for an arbitrary arrival process with bulk arrivals and a general service model.

Association of Type 2 Diabetes Mellitus With Perivascular Spaces and Cerebral Amyloid Angiopathy in Alzheimer's Disease: Insights From MRI Imaging

  • Ozlem Bizpinar Munis
    • 대한치매학회지
    • /
    • 제22권3호
    • /
    • pp.87-99
    • /
    • 2023
  • Background and Purpose: According to the amyloid cascade hypothesis, fibrillary amyloid-beta load in the brain causes Alzheimer's disease (AD) with toxic effects. Recently, perivascular spaces (PVSs), fluid-filled cavities around small penetrating arterioles and venules in the brain, and the glymphatic system relationship with type 2 diabetes mellitus (DM2) and AD has been an important research topic from a physiopathological point of view. There are two types of PVSs that are associated with sporadic atherosclerosis and cerebral amyloid angiopathy. In this study, we evaluated the relationship between the number and localization of enlarged PVSs in AD. Methods: A total of 254 patients with AD and 125 healthy controls were included in this study All the patients were evaluated with neurological and cognitive examinations and magnetic resonance imaging (MRI). PVSs on MRI were graded by recording their number and location. The study was a retrospective study. Results: In our study, the number of white matter convexity-central semiovale localized PVSs was higher in patients than in the control group. In addition, the number of PVSs in this localization score was higher in patients with DM2. Cerebral PVS counts were higher in patients with AD than in the control group. Conclusions: These results suggest the important role of cerebral amyloid angiopathy, one of the vascular risk factors, and the glymphatic system in the pathogenesis of AD. In addition, the results of our study suggest that the evaluation of PVSs levels, especially at the (centrum semiovale), using imaging studies in AD is a potential diagnostic option.

혼합치열기 정상교합 아동에 관한 두부방사선 계측학적 연구 (A ROENTGENOCEPHALOMETRIC STUDY ON THE CHILDREN OF NORMAL OCCLUSION IN THE MIXED DENTITION)

  • 이희주
    • 대한치과교정학회지
    • /
    • 제5권1호
    • /
    • pp.11-19
    • /
    • 1975
  • This study was undertaken to investigate the exact values of the cephalometric standards of Hellman dental age III B groups of Korean in the reontgenocephalometry. The subjects consisted of 25 males and the same number of females with the normal occlusion and acceptable profile. Each lateral cephalometric head film was taken with the teeth in occlusion and the Focal-film distance was 300cm. Their linear and angular measurements were made directly. The following conclusions were obtained; 1) The author made the tables of standard deviation from the measured values. 2) The degree of the facial convexity of Korean children was larger than that of the white. 3) The labial inclination of the lower central incisor in male was a little greater than that in female.

  • PDF

A new equilibrium existence via connectedness

  • Rim, Dong-Il;Im, Sung-Mo;Kim, Won-Kyu
    • 대한수학회보
    • /
    • 제33권4호
    • /
    • pp.587-592
    • /
    • 1996
  • In 1950, Nash [5] first proved the existence of equilibrium for games where the player's preferences are representable by continuous quasiconcave utilities and the strategy sets are simplexes. Next Debreu [3] proved the existence of equilibrium for abstract economies. Recently, the existence of Nash equilibrium can be further generalized in more general settings by several athors, e.g. Shafer-Sonnenschein [6], Borglin-Keiding [2], Yannelis-Prabhaker [8]. In the above results, the convexity assumption is very essential and the main proving tools are the continuous selection technique and the existence of maximal elements. Still there have been a number of generalizations and applications of equilibrium existence theorem in generalized games.

  • PDF

VALUATION AND HEDGING OF OPTIONS WITH GENERAL PAYOFF UNDER TRANSACTIONS COSTS

  • Choi, Hyeong-In;Heath, David;Ku, Hye-Jin
    • 대한수학회지
    • /
    • 제41권3호
    • /
    • pp.513-533
    • /
    • 2004
  • We present the pricing and hedging method for options with general payoffs in the presence of transaction costs. The convexity of the payoff function-gamma of the options- is an important issue under transaction costs. When the payoff function is convex, Leland-style pricing and hedging method still works. However, if the payoff function is of general form, additional assumptions on the size of transaction costs or of the hedging interval are needed. We do not assume that the payoff is convex as in Leland 〔11〕 and the value of the Leland number is less (bigger) than 1 as in Hoggard et al. 〔10〕, Avellaneda and Paras 〔1〕. We focus on generally recognized asymmetry between the option sellers and buyers. We decompose an option with general payoff into difference of two options each of which has a convex payoff. This method is consistent with a scheme of separating out the seller's and buyer's position of an option. In this paper, we first present a simple linear valuation method of general payoff options, and also propose in the last section more efficient hedging scheme which costs less to hedge options.

Pragmatic Assessment of Optimizers in Deep Learning

  • Ajeet K. Jain;PVRD Prasad Rao ;K. Venkatesh Sharma
    • International Journal of Computer Science & Network Security
    • /
    • 제23권10호
    • /
    • pp.115-128
    • /
    • 2023
  • Deep learning has been incorporating various optimization techniques motivated by new pragmatic optimizing algorithm advancements and their usage has a central role in Machine learning. In recent past, new avatars of various optimizers are being put into practice and their suitability and applicability has been reported on various domains. The resurgence of novelty starts from Stochastic Gradient Descent to convex and non-convex and derivative-free approaches. In the contemporary of these horizons of optimizers, choosing a best-fit or appropriate optimizer is an important consideration in deep learning theme as these working-horse engines determines the final performance predicted by the model. Moreover with increasing number of deep layers tantamount higher complexity with hyper-parameter tuning and consequently need to delve for a befitting optimizer. We empirically examine most popular and widely used optimizers on various data sets and networks-like MNIST and GAN plus others. The pragmatic comparison focuses on their similarities, differences and possibilities of their suitability for a given application. Additionally, the recent optimizer variants are highlighted with their subtlety. The article emphasizes on their critical role and pinpoints buttress options while choosing among them.

Two-dimensional concrete meso-modeling research based on pixel matrix and skeleton theory

  • Jingwei Ying;Yujun Jian;Jianzhuang Xiao
    • Computers and Concrete
    • /
    • 제33권6호
    • /
    • pp.671-688
    • /
    • 2024
  • The modeling efficiency of concrete meso-models close to real concrete is one of the important issues that limit the accuracy of mechanical simulation. In order to improve the modeling efficiency and the closeness of the numerical aggregate shape to the real aggregate, this paper proposes a method for generating a two-dimensional concrete meso-model based on pixel matrix and skeleton theory. First, initial concrete model (a container for placing aggregate) is generated using pixel matrix. Then, the skeleton curve of the residual space that is the model after excluding the existing aggregate is obtained using a thinning algorithm. Finally, the final model is obtained by placing the aggregate according to the curve branching points. Compared with the traditional Monte Carlo placement method, the proposed method greatly reduces the number of overlaps between aggregates by up to 95%, and the placement efficiency does not significantly decrease with increasing aggregate content. The model developed is close to the actual concrete experiments in terms of aggregate gradation, aspect ratio, asymmetry, concavity and convexity, and old-new mortar ratio, cracking form, and stress-strain curve. In addition, the cracking loss process of concrete under uniaxial compression was explained at the mesoscale.

구면 보로노이 다이아그램을 이용한 움직이는 정규 다면체의 근점 알고리즘 (A Sequence of the Extreme Vertices ova Moving Regular Polyhedron Using Spherical Voronoi Diagrams)

  • 김형석
    • 한국멀티미디어학회논문지
    • /
    • 제3권3호
    • /
    • pp.298-308
    • /
    • 2000
  • 본 논문에서는 고정된 평면에 대한 움직이는 정규 다면체의 가까운 점들을 효과적으로 찾는 알고리즘을 제안한다. 본 알고리즘은 문제를 효율적으로 해결 위하여 다면체의 각 면에서 정의되는 단위 법선 벡터들에 의해 구성되는 구면 보로노이 다이아그램을 이용한다. 일반적인 보로노이 다이아그램이 O(nlogn) 시간에 구성되는 것에 반하여 여기에 사용되는 구면 보로노이 다이아그램은 O(n)에 구할 수 있음을 보인다. 이를 본 문제에 적용하면 구면 위치 파악 문제로 전환할 수 있다. 따라서, 주어진 시점에서의 근점은 O(logn) 시간에 구할 수 있고, 다면체의 움직임에 따라 변하는 근점들의 리스트는 (equation omitted) 시간에 구할 수 있다. 이때, m$^{j}$ $_{k}$ (1$\leq$j$\leq$s)는 질의점이 지나는 구면 보로노이 다이아그램의 영역 sreg(equation omitted)의 선분의 개수이다. 본 논문에서 제안한 알고리즘은 컴퓨터 애니메이션과 로보틱스 분야에서 충돌지점을 찾는 문제에 효과적으로 사용될 수 있다.

  • PDF

전역 및 국부 기하 특성을 반영한 메쉬 분할 (A Mesh Segmentation Reflecting Global and Local Geometric Characteristics)

  • 임정훈;박영진;성동욱;하종성;유관희
    • 정보처리학회논문지A
    • /
    • 제14A권7호
    • /
    • pp.435-442
    • /
    • 2007
  • 본 논문에서는 3D 메쉬 모델의 텍스쳐 매핑, 단순화, 모핑, 압축, 형상정합 등 다양한 분야에 응용될 수 있는 메쉬분할 문제를 다룬다. 메쉬 분할은 주어진 메쉬를 서로 떨어진 집합(disjoint sets)으로 나누는 과정으로서, 본 논문에서는 메쉬의 전역적 및 국부적 기하 특성을 동시에 반영하여 메쉬를 분할하는 방법을 제시하고자 한다. 먼저 주어진 메쉬의 국부적 기하 특성인 곡률 정보와 전역적 기하 특성인 볼록성을 이용하여 메쉬 정점들 중 첨예정점(sharp vertex)을 추출하고, 모든 첨예정점들 간의 유클리디언 거리에 기반한 $\kappa$-평균군집화 기법[26]을 적용하여 첨예 정점들을 분할한다. 분할된 첨예정점에 속하지 않는 나머지 정점들에 대해서는 유클리디언 거리상 가까운 군집으로 병합하여 최종적인 메쉬분할이 이루어진다. 또한 본 논문에서 제안한 메쉬분할 방법을 구현하여 여러 메쉬 모델에 대해 실험 결과를 보여준다.