• Asian-Australasian Journal of Animal Sciences
• /
• 제28권10호
• /
• pp.1407-1418
• /
• 2015

A total of 32,817 test-day milk yield (TDMY) records of the first lactation of 4,056 Girolando cows daughters of 276 sires, collected from 118 herds between 2000 and 2011 were utilized to estimate the genetic parameters for TDMY via random regression models (RRM) using Legendre's polynomial functions whose orders varied from 3 to 5. In addition, nine measures of persistency in milk yield ($PS_i$) and the genetic trend of 305-day milk yield (305MY) were evaluated. The fit quality criteria used indicated RRM employing the Legendre's polynomial of orders 3 and 5 for fitting the genetic additive and permanent environment effects, respectively, as the best model. The heritability and genetic correlation for TDMY throughout the lactation, obtained with the best model, varied from 0.18 to 0.23 and from -0.03 to 1.00, respectively. The heritability and genetic correlation for persistency and 305MY varied from 0.10 to 0.33 and from -0.98 to 1.00, respectively. The use of $PS_7$ would be the most suitable option for the evaluation of Girolando cattle. The estimated breeding values for 305MY of sires and cows showed significant and positive genetic trends. Thus, the use of selection indices would be indicated in the genetic evaluation of Girolando cattle for both traits.

• 한국수자원학회논문집
• /
• 제43권5호
• /
• pp.471-482
• /
• 2010

수문학적 물순환과정에서 강우는 여러 기상학적 인자들과 밀접한 관련을 갖으며 발생한다. 따라서 본 연구에서는 대표적인 수문기상인자인 해수면온도와 한반도에 발생하는 월강우량 사이의 관계에 대하여 분석하였다. 우리나라의 61개 지점의 월평균 강우량과 위도 및 경도 자료를 이용하여 군집분석을 수행하였다. 군집 분석 결과에서 우리나라의 월강우자료를 이용하여 크게 4개의 군집으로 구분할 수 있었다. 군집별로 구분된 강우관측소의 월강우량 자료들을 주성분을 추출하였다. 추출된 주성분과 해수면온도와의 상관성 분석을 수행하였다. 상관성 분석 결과에서 양(+)의 상관관계가 음(-)의 상관관계보다 더 크게 나타났다. 또한, 상관관계가 가장 큰 지점의 해수면온도를 이용하여 3개월의 월강우량을 지역가중다항식을 통해 예측하였다. 지역가중다항식을 통한 예측 결과는 군집에 따라 정확성에 차이는 있으나, 정량적인 예측이 가능한 것으로 판단되었다. 따라서 해수면온도와 같은 수문기상인자를 통한 강우량의 예측에 대한 지속적인 연구가 필요하다.

• 한국게임학회 논문지
• /
• 제17권2호
• /
• pp.17-26
• /
• 2017

최근 청소년들의 인터넷 및 스마트폰 과도한 사용이 사회적 이슈가 되어왔다. 작업에 대한 몰입 수준은 좋은 결과물을 만들 수 있는 긍정적 효과와 과 몰입 같은 부정적 효과를 모두 가지고 있다. 본 연구는 심혈관 반응 기반의 몰입 상태를 판단하는 알고리즘을 개발하고자 하였다. 피험자들은 무 자극 상태, 그리고 몰입을 유발하기 위한 패턴 맞추기 게임을 수행하였고, 몰입 수준을 제공하기 위해 협력과 경쟁 태스크로 나누어 실험 디자인 하였다. 각 태스크에 따라 심박과 진폭의 상관성을 분석하고 다항식 회귀 분석을 통해 회귀식 및 정확도를 확인하였다. 결과는 게임 태스크일 때, 심박과 진폭은 양의 상관성을 보였으며 무자극일 때 음의 상관성을 보였다. 개발된 다차항 회귀식으로 게임 태스크와 무 자극을 구분하는 정확도는 평균 89%의 정확도를 보였다. 태스크간의 차이는 76.5% 정확도를 확인하였다. 본 연구는 실시간으로 몰입 수준을 정량적으로 평가하는데 사용될 수 있을 것으로 기대된다.

• Structural Engineering and Mechanics
• /
• 제6권7호
• /
• pp.757-772
• /
• 1998

The objective of the present work is to estimate the strength and failure characteristics of symmetric thin square laminates under negative shear load. Two progressive failure analyses, one using the Hashin criterion and the other using a Tensor polynomial criterion, are used in conjunction with the finite element method. First-order shear-deformation theory along with geometric nonlinearity in the von Karman sense has been incorporated in the finite element modeling. Failure loads, associated maximum transverse displacements, locations and modes of failure including the onset of delamination are discussed in detail; these are found to be quite different from those for the positive sheer load reported in Part I of this study (Singh et al. 1998).

• 대한수학회보
• /
• 제55권4호
• /
• pp.1023-1035
• /
• 2018

We strengthen a result of Michiel Kosters by proving the following theorems: (*) Let ${\phi}:W{\rightarrow}V$ be a finite surjective morphism of algebraic varieties over an ample field K. Suppose V has a simple K-rational point a such that $a{\not\in}{\phi}(W(K_{ins}))$. Then, card($V(K){\backslash}{\phi}(W(K))$ = card(K). (**) Let K be an infinite field of positive characteristic and let $f{\in}K[X]$ be a non-constant monic polynomial. Suppose all zeros of f in $\tilde{K}$ belong to $K_{ins}{\backslash}K$. Then, card(K \ f(K)) = card(K).

• 한국경영과학회지
• /
• 제25권3호
• /
• pp.17-33
• /
• 2000

We consider the Steiner tree packing problem. For a given undirected graph G =(V, E) with positive integer capacities and non-negative weights on its edges, and a list of node sets(nets), the problem is to find a connection of nets which satisfies the edge capacity limits and minimizes the total weights. We focus on the switchbox routing problem in knock-knee model and formulate this problem as an integer programming using Steiner tree variables. The model contains exponential number of variables, but the problem can be solved using a polynomial time column generation procedure. We test the algorithm on some standard test instances and compare the performances with the results using cutting plane approach. Computational results show that our algorithm is competitive to the cutting plane algorithm presented by Grotschel et al. and can be used to solve practically sized problems.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제4권1호
• /
• pp.49-65
• /
• 2000

A method for inverting the Laplace transform is presented, using a finite series of the classical Legendre polynomials. The method recovers a real-valued function f(t) in a finite interval of the positive real axis when f(t) belongs to a certain class ${\mathcal{W}}_{\beta}$ and requires the knowledge of its Laplace transform F(s) only at a finite number of discrete points on the real axis s > 0. The choice of these points will be carefully considered so as to improve the approximation error as well as to minimize the number of steps needed in the evaluations. The method is tested on few examples, with particular emphasis on the estimation of the error bounds involved.

• 대한수학회지
• /
• 제57권6호
• /
• pp.1535-1549
• /
• 2020

This paper deals with the inverse of tails of Hurwitz zeta function. More precisely, for any positive integer s ≥ 2 and 0 ≤ a < 1, we give an algorithm for finding a simple form of f_s,a(n) such that $$\lim_{n{\rightarrow}{\infty}}\{\({\sum\limits_{k=n}^{\infty}}{\frac{1}{(k+a)^s}}\)^{-1}-f_{s,a}(n)\}=0$$. We show that f_s,a(n) is a polynomial in n-a of order s-1. All coefficients of f_s,a(n) are represented in terms of Bernoulli numbers.

• 대한수학회보
• /
• 제54권2호
• /
• pp.507-519
• /
• 2017

We present an upper bound on the Cheeger constant of a distance-regular graph. Recently, the authors found an upper bound on the Cheeger constant of distance-regular graph under a certain restriction in their previous work. Our new bound in the current paper is much better than the previous bound, and it is a general bound with no restriction. We point out that our bound is explicitly computable by using the valencies and the intersection matrix of a distance-regular graph. As a major tool, we use the discrete Green's function, which is defined as the inverse of ${\beta}$-Laplacian for some positive real number ${\beta}$. We present some examples of distance-regular graphs, where we compute our upper bound on their Cheeger constants.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제1권1호
• /
• pp.44-49
• /
• 2001

For minimum phase systems, the conventional fuzzy logic controllers (FLCs) use the error and the change-of-error as fuzzy input variables. Then the control rule table is a skew symmetric type, that is, it has UNLP (Upper Negative and Lower Positive) or UPLN property. This property allowed to design a single-input FLC (SFLC) that has many advantages. But its control parameters are not automatically adjusted to the situation of the controlled plant. That is, the adaptability is still deficient. We here design a single-input direct adaptive FLC (SDAFLC). In the AFLC, some parameters of the membership functions characterizing the linguistic terms of the fuzzy rules are adjusted by an adaptive law. The SDAFLC is designed by a stable error dynamics. We prove that its closed-loop system is globally stable in the sense that all signals involved are bounded and its tracking error converges to zero asymptotically. We perform computer simulations using a nonlinear plant and compare the control performance between the SFLC and the SDAFLC.