• Title/Summary/Keyword: extremal

Search Result 186, Processing Time 0.024 seconds

ON EXTREMAL SORT SEQUENCES

  • Yun, Min-Young;Keum, Young-Wook
    • Journal of applied mathematics & informatics
    • /
    • v.9 no.1
    • /
    • pp.239-252
    • /
    • 2002
  • A sort sequence $S_n$ is sequence of all unordered pairs of indices in $I_n$={1,2,…n}. With a sort sequence $S_n$ = ($s_1,S_2,...,S_{\frac{n}{2}}$),one can associate a predictive sorting algorithm A($S_n$). An execution of the a1gorithm performs pairwise comparisons of elements in the input set X in the order defined by the sort sequence $S_n$ except that the comparisons whose outcomes can be inferred from the results of the preceding comparisons are not performed. A sort sequence is said to be extremal if it maximizes a given objective function. First we consider the extremal sort sequences with respect to the objective function $\omega$($S_n$) - the expected number of tractive predictions in $S_n$. We study $\omega$-extremal sort sequences in terms of their prediction vectors. Then we consider the objective function $\Omega$($S_n$) - the minimum number of active predictions in $S_n$ over all input orderings.

Statistical Studies on the Derivation of Design Low Flows (I) (설계갈수량의 유도를 위한 수문통계학적 연구 (I))

  • 이순혁;박영근;박종근
    • Magazine of the Korean Society of Agricultural Engineers
    • /
    • v.34 no.3
    • /
    • pp.43-52
    • /
    • 1992
  • Design low flows were derived from the decision of a best fitting probability distribution and of an optimum transformation method can be contributed to the planning of water utilization and management of various hydraulic structures during dry season in the main river systems in Korea. The results were analyzed and summarized as follows. 1.Basic statistics for the selected watersheds were calculated as one of means for the analysis of extremal distribution. 2.Parameters for the different frequency distributions were calculated by the method of moment. 3.Type m extremal distribution was confirmed as a best one among others for the frequency distribution of the low flows by x$^2$ goodness of fit test. 4.Formulas for the design low flows of the Type m extremal distribution with two and three parameters were dervied for the selected watersheds. 5.Design low flows for the Type m extremal distribution when a minimum drought is zero or larger than zero were derived for the selected watersheds, respectively. 6.Design low flows of the Type m extremal distribution with two parameters are appeared to be reasonable when a minimum drought approaches to zero and the observed low flows varied within a relating small range while those with three parameters are seemed to be consistent with the probability distribution of low flows when a minimum drought is larger than zero and the observed low flows showed a wide range.

  • PDF

Probability Funetion of Best Fit to Distribution of Extremal Minimum Flow and Estimation of Probable Drought Flow (극소치유량에 대한 적정분포형의 설정과 확률갈수량의 산정)

  • 김지학;이순탁
    • Water for future
    • /
    • v.8 no.1
    • /
    • pp.80-88
    • /
    • 1975
  • In this paper the authors established the best fit distribution function by applying the concept of probabiaity to the annual minimum flow of nine areas along the Nakdong river basin which is one of the largest Korean rivers and calculated the probable minimum flow suitable to those distribution function. Lastly, the authors tried to establish the best method to estimate the probable minimun flow by comparing some frequency analysis methods. The results obtained are as follows (1) It was considered that the extremal distribution type III was the most suitable one in the distributional types as a result of the comparision with Exponential distribution, Log-Normal distribution, Extremal distribution type-III and so on. (2) It was found that the formula of extremal distribution type-II for the estimation of probable minimum flow gave the best result in deciding the probable minimum flow of the Nakdong river basin. Therfore, it is recommended that the probable minimum flow should be estimated by using the extremal distribution type-III method. (3) It could be understood that in the probable minimum flow the average non-excessive probability appeared to be $Po{\fallingdotseq}1-\frac{1}{2T}$ and gave the same values of the probable variable without any difference in the various methods of plotting technique.

  • PDF

ASYMPTOTIC BEHAVIOR OF A-HARMONIC FUNCTIONS AND p-EXTREMAL LENGTH

  • Kim, Seok-Woo;Lee, Sang-Moon;Lee, Yong-Hah
    • Bulletin of the Korean Mathematical Society
    • /
    • v.47 no.2
    • /
    • pp.423-432
    • /
    • 2010
  • We describe the asymptotic behavior of functions of the Royden p-algebra in terms of p-extremal length. We also prove that each bounded $\cal{A}$-harmonic function with finite energy on a complete Riemannian manifold is uniquely determined by the behavior of the function along p-almost every curve.

AN EXTREMAL PROBLEM OF HOLOMORPHIC FUNCTIONS IN THE COMPLEX PLANE

  • Chung, Young-Bok;Park, Byoung-Il
    • Honam Mathematical Journal
    • /
    • v.35 no.4
    • /
    • pp.717-727
    • /
    • 2013
  • In this paper, we study on a higher order extremal problem relating the Ahlfors map associated to the pair of a finitely connected domain in the complex plane and a point there. We show the power of the Ahlfors map with some error term which is conformally equivalent maximizes any higher order derivative of holomorphic functions at the given point in the domain.

ON THE EXTREMAL TYPE I BINARY SELF-DUAL CODES WITH NEAR-MINIMAL SHADOW

  • HAN, SUNGHYU
    • Journal of applied mathematics & informatics
    • /
    • v.37 no.1_2
    • /
    • pp.85-95
    • /
    • 2019
  • In this paper, we define near-minimal shadow and study the existence problem of extremal Type I binary self-dual codes with near-minimal shadow. We prove that there is no such codes of length n = 24m + 2($m{\geq}0$), n = 24m + 4($m{\geq}9$), n = 24m + 6($m{\geq}21$), and n = 24m + 10($m{\geq}87$).

ON SOMBOR INDEX OF BICYCLIC GRAPHS WITH GIVEN MATCHING NUMBER

  • XIAOLING, SUN;JIANWEI, DU
    • Journal of Applied and Pure Mathematics
    • /
    • v.4 no.5_6
    • /
    • pp.249-262
    • /
    • 2022
  • Nowadays, it is an important task to find extremal values on any molecular descriptor with respect to different graph parameters. The Sombor index is a novel topological molecular descriptor introduced by Gutman in 2021. The research on determining extremal values for the Sombor index of a graph is very popular recently. In this paper, we present the maximum Sombor index of bicyclic graphs with given matching number. Furthermore, we identify the corresponding extremal bicyclic graphs.

A Method to Detect Object of Interest from Satellite Imagery based on MSER(Maximally Stable Extremal Regions) (MSER(Maximally Stable Extremal Regions)기반 위성영상에서의 관심객체 검출기법)

  • Baek, Inhye
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.18 no.5
    • /
    • pp.510-516
    • /
    • 2015
  • This paper describes an approach to detect interesting objects using satellite images. This paper focuses on the interesting objects that have common special patterns but do not have identical shapes and sizes. The previous technologies are still insufficient for automatic finding of the interesting objects based on operation of special pattern analysis. In order to overcome the circumstances, this paper proposes a methodology to obtain the special patterns of interesting objects considering their common features and their related characteristics. This paper applies MSER(Maximally Stable Extremal Regions) for the region detection and corner detector in order to extract the features of the interesting object. This paper conducts a case study and obtains the experimental results of the case study, which is efficient in reducing processing time and efforts comparing to the previous manual searching.

EXTREMAL PROBLEM OF A QUADRATICALLY HYPONORMAL WEIGHTED SHIFT

  • Lee, Hee-Yul;Lee, Mi-Ryeong
    • Journal of applied mathematics & informatics
    • /
    • v.26 no.3_4
    • /
    • pp.673-678
    • /
    • 2008
  • Let $W_{\alpha}$, be a recursively generated quadratically hyponormal weighted shift with a weight sequence ${\alpha}$ : 1, (1, $\sqrt{x}$, $\sqrt{y}$)$^{\wedge}$. In [4] Curto-Jung showed that R = {(x,y) : $W_{1,\;(1,\;{\sqrt{x}},\;{\sqrt{y}})^{\wedge}}$ is quadratically hyponormal} is a closed convex with nonempty interior, which guarantees that there are a lot of quadratically hyponormal weighted shifts with first two equal weights. They suggested a problem computing expressions of certain extremal points of R. In this note we obtain a partial answer of their extremal problem.

  • PDF