• East Asian mathematical journal
• /
• 제40권1호
• /
• pp.75-83
• /
• 2024

For a reduced, irreducible and nondegenerate curve C ⊂ ℙ^r of degree d, it was shown that the arithmetic genus g of C has an upper bound π₀(d, r) by G. Castelnuovo. And he also classified the curves that attain the extremal value. These curves are arithmetically Cohen-Macaulay and contained in a surface of minimal degree. In this paper, we investigate the arithmetic genus of curves lie on a surface of minimal degree - the Veronese surface, smooth rational normal surface scrolls and singular rational normal surface scrolls. We also provide a construction of curves on singular rational normal surface scroll S(0, 2) ⊂ ℙ³ which attain the maximal arithmetic genus.

• Elastomers and Composites
• /
• 제34권3호
• /
• pp.262-268
• /
• 1999

미가교 천연고무의 응력완화와 탄성복원에 대한 카본블랙의 영향을 조사하였다. 카본블랙의 형태가 보다 작고 높은 구조의 특징을 가질 때 응력완화는 더 지연되었고 탄성복원은 더 활발하였다. 이 결과는 결합고무의 크기, 즉 천연고무와 카본블랙의 상호작용의 크기에 기인하였다.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제16권1호
• /
• pp.51-64
• /
• 2012

This paper provides an efficient dimension reduction algorithm of the positive realization of discrete phase type(DPH) distributions. The relationship between the representation of DPH distributions and the positive realization of the positive system is explained. The dimension of the positive realization of a discrete phase-type realization may be larger than its McMillan degree of probability generating functions. The positive realization with sufficient large dimension bound can be obtained easily but generally, the minimal positive realization problem is not solved yet. We propose an efficient dimension reduction algorithm to make the positive realization with tighter upper bound from a given probability generating functions in terms of convex cone problem and linear programming.

• 대한수학회보
• /
• 제59권4호
• /
• pp.1045-1067
• /
• 2022

Given a graph G, a {1, 3, …, 2n-1}-factor of G is a spanning subgraph of G, in which each degree of vertices is one of {1, 3, …, 2n-1}, where n is a positive integer. In this paper, we first establish a lower bound on the size (resp. the spectral radius) of G to guarantee that G contains a {1, 3, …, 2n-1}-factor. Then we determine an upper bound on the distance spectral radius of G to ensure that G has a {1, 3, …, 2n-1}-factor. Furthermore, we construct some extremal graphs to show all the bounds obtained in this contribution are best possible.

• 산업경영시스템학회지
• /
• 제38권3호
• /
• pp.169-180
• /
• 2015

Recently, scheduling problems with position-dependent processing times have received considerable attention in the literature, where the processing times of jobs are dependent on the processing sequences. However, they did not consider cases in which each processed job has different learning or aging ratios. This means that the actual processing time for a job can be determined not only by the processing sequence, but also by the learning/aging ratio, which can reflect the degree of processing difficulties in subsequent jobs. Motivated by these remarks, in this paper, we consider a two-agent single-machine scheduling problem with linear job-dependent position-based learning effects, where two agents compete to use a common single machine and each job has a different learning ratio. Specifically, we take into account two different objective functions for two agents: one agent minimizes the total weighted completion time, and the other restricts the makespan to less than an upper bound. After formally defining the problem by developing a mixed integer non-linear programming formulation, we devise a branch-and-bound (B&B) algorithm to give optimal solutions by developing four dominance properties based on a pairwise interchange comparison and four properties regarding the feasibility of a considered sequence. We suggest a lower bound to speed up the search procedure in the B&B algorithm by fathoming any non-prominent nodes. As this problem is at least NP-hard, we suggest efficient genetic algorithms using different methods to generate the initial population and two crossover operations. Computational results show that the proposed algorithms are efficient to obtain near-optimal solutions.

• 대한전자공학회논문지TC
• /
• 제45권6호
• /
• pp.27-33
• /
• 2008

차수가 h인 다항식 ${\hbar}(x){\in}F_q[x]$에서, $x-s_1,\;x-s_2,\;{\cdots},\;x-s_n$에 의해 생성된 $\(F_q[x]/({\hbar(x))\)*$의 multiplicative subgroup의 크기를 결정하는 것은 대단히 중요한 과제이다. 여기서 $\{s_1,\;s_2,\;{\cdots},\;s_n\}{\sebseteq}F_q$이고 모든 i 에 대해서, ${\hbar}(x){\neq}0$이다. 지금까지 알려진 asymptotic lower bound는 $(rh)^{O(1)}\(2er+O(\frac{1}{r})\)^h$이며, 여기서 $r=\frac{n}{h}$이고 e(=2.718...)는 natural logarithm의 기저이다. 본 논문에서는, coding theory 문제와 연계해서 더 낳은 lower bound인 $(rh)^{O(1)}\(2er+{\frac{e}{2}}{\log}r-{\frac{e}{2}}{\log}{\frac{e}{2}}+O{(\frac{{\log}^2r}{r})}\)^h$를 증명하고자 한다. 여기서 log는natural logarithm을 나타내며, 또한 이방식의 제약점에 대해서도 논의한다.

• 한국임상수의학회지
• /
• 제10권1호
• /
• pp.1-10
• /
• 1993

To investigate the availability of hamster test in assaying the fertilizing capacity of dog sperm and the effect of canine sperm motility on sperm binding and penetration, semen were collected from four dogs(three dogs had been proven to be fertile and one dog to be subfertile during the past two years) and then preserved in BWW(Biggers, Whitten, Whittingham) medium for about 20 hours. The semen were given each different treatment according to the experimental design and coincubated with zona-free hamster ova for 5 hours. The ova were stained by lacmoid and examined under phase contrast microscope to investigate the rates of ova bound with sperm(sperm binding) and ova penetrated by sperm(penetration), and also numbers of both bound and penetrated sperm per ovum. In comparison between fertile dogs and a subfertile dog, the rate of sperm binding was higher in fertile dogs than the subfertile dog(p<0.01, p<0.05). The number of bound sperm per ovum was considerably higher in a fertile dog than the subfertile dog((p<0.01), and also difference of number of the bound sperm was obtained among the fertile dogs(p<0.01, p<0.05). The rate of penetration as well as the number of penetrated sperm per ovum was higher in the fertile dogs than the subfertile dog(p<0.01, p<0.05). In fertile dogs. the canine semen preserved at 4$^{\circ}C$ for 18 to 22 hours showed from 30 to 80% motility at Insemination, however, no difference in hamster test was obtained according to different degree of sperm motility. These results indicated that hamster test would be of avail in assaying the fertilizing capacity of dog sperm.

• 콘크리트학회논문집
• /
• 제26권6호
• /
• pp.723-730
• /
• 2014

최근 고로슬래그 미분말의 사용량이 증가함에 따라 고로슬래그 미분말 혼입 시멘트의 수화반응 모델뿐만 아니라 압축강도, 수화생성물, 수화열 등 고로슬래그 미분말 혼입 시멘트 페이스트의 물성에 관한 연구가 활발히 진행되고 있다. 하지만 고로슬래그 미분말 혼입 시멘트 페이스트의 물성에 큰 영향을 끼치는 고로슬래그 미분말의 반응도에 대한 연구는 세계적으로도 부족하며 특히 국내에서는 전무한 실정이다. 따라서 본 연구는 선택적 추출법을 이용하여 시멘트 페이스트 내 고로슬래그 미분말의 반응도를 정량분석하고 물 바인더비, 치환율, 양생온도에 따라 압축강도, 화학결합수, $Ca(OH)_2$을 측정하여 비교 분석 하였다. 실험결과 시멘트 페이스트 내 고로슬래그 미분말의 반응도, 화학결합수, $Ca(OH)_2$은 치환율이 낮고 물 바인더비와 양생 온도가 높을수록 높게 나타났으며 특히 고로슬래그 미분말의 반응도는 최종적으로 약 0.3~0.4 값에 수렴하는 것으로 나타났다.

• 수산경영론집
• /
• 제35권1호
• /
• pp.117-132
• /
• 2004

This study attempts to suggest a new approach of the estimation of range and degree of fisheries damages caused by a large scale of reclamation undertaken in coastal area using the central limit theorem(CLT) in statistics. The key result of the study is the introduction of the new concept of critical variation of environmental factor($d_{c}$). The study defines $d_{c}$ as a standard deviation of the sample mean($\bar{X}$) of environmental factor(X), in other words, $\frac{\sigma}{ \sqrt{n}}$. The inner bound of $d_{c}$ could be the area of fisheries damages caused by public coastal undertaking. The study also defines the decreasing rate of fisheries production$\delta_{\varepsilon}$, in other words, degree of fisheries damages, as the rate of change in the distribution of sample mean(($\bar{X}$), caused by the continuous and constant variation of environmental factor. Therefore $\delta_{\varepsilon}$ can be easily calculated by the use of table of the standardized normal distribution.

• Industrial Engineering and Management Systems
• /
• 제13권2호
• /
• pp.193-202
• /
• 2014

Patients' satisfaction while receiving medical service is affected by whether or not their preferences can be met, including time and physician preference. Due to scarcity of medical resource in China, efficient use of available resources is urgently required. To guarantee the utilization ratio, the scheduling decisions are made after all booking information is received. Two integer models with different objectives are formulated separately, maximizing the degree of satisfaction and revenue. The optimal value of the two models can be considered as the bound of corresponding objectives. However, it is improper to implement any of the extreme policies. Because revenue is a key element to keep the hospital running and satisfaction degree is related to the hospital's reputation, neither the revenue nor the satisfaction can be missed. Therefore, hospitals should make a balance. An integrated model is developed to find out the tradeoff between the two objectives. The whole degree of mismatching that is related to patient satisfaction and other separate mismatching degree are considered. Through a computational study, it is concluded that based on the proposed model hospitals can make their decisions according to service requirement.