• Korean Journal of Mathematics
• /
• 제21권4호
• /
• pp.495-502
• /
• 2013

Let $\mathcal{T}^{(p)}_n$ be the set of p-ary labeled trees on $\{1,2,{\ldots},n\}$. A maximal decreasing subtree of an p-ary labeled tree is defined by the maximal p-ary subtree from the root with all edges being decreasing. In this paper, we study a new refinement $\mathcal{T}^{(p)}_{n,k}$ of $\mathcal{T}^{(p)}_n$, which is the set of p-ary labeled trees whose maximal decreasing subtree has k vertices.

• 대한수학회보
• /
• 제58권5호
• /
• pp.1279-1300
• /
• 2021

Let P be a finite point set in ℝ² with the set of distance n-chains defined as ∆_n(P) = {(|p₁ - p₂|, |p₂ - p₃|, …, |p_n - p_n+1|) : p_i ∈ P}. We show that for 2 ⩽ n = O_|P|(1) we have ${\mid}{\Delta}_n(P){\mid}{\gtrsim}{\frac{{\mid}P{\mid}^n}{{\log}^{\frac{13}{2}(n-1)}{\mid}P{\mid}}}$. Our argument uses the energy construction of Elekes and a general version of Rudnev's rich-line bound implicit in [28], which allows one to iterate efficiently on intersecting nested subsets of Guth-Katz lines. Let G is a simple connected graph on m = O(1) vertices with m ⩾ 2. Define the graph-distance set ∆_G(P) as ∆_G(P) = {(|p_i - p_j|)_{i,j}∈E(G) : p_i, p_j ∈ P}. Combining with results of Guth and Katz [17] and Rudnev [28] with the above, if G has a Hamiltonian path we have ${\mid}{\Delta}_G(P){\mid}{\gtrsim}{\frac{{\mid}P{\mid}^{m-1}}{\text{polylog}{\mid}P{\mid}}}$.

• 대한수학회지
• /
• 제39권1호
• /
• pp.31-49
• /
• 2002

An R$^{n}$ -geometry (P$^{n}$ , L) is a generalization of the Euclidean geometry on R$^{n}$ (see Def. 1.1). We can consider some topologies (see Def. 2.2) on the line set L such that the join operation V : P$^{n}$ $\times$ P$^{n}$ \ $\Delta$ longrightarrow L is continuous. It is a notable fact that in the case n = 2 the introduced topologies on L are same and the join operation V : P$^2$ $\times$ P$^2$ \ $\Delta$ longrightarrow L is continuous and open [10, 11]. It is a fundamental topological property of plane geometry, but in the cases n $\geq$ 3, it is no longer true. There are counter examples [2]. Hence, it is a fundamental problem to find suitable topologies on the line set L in an R$^{n}$ -geometry (P$^{n}$ , L) such that these topologies are compatible with the incidence structure of (P$^{n}$ , L). Therefore, we need to study the topologies of the line set L in an R$^{n}$ -geometry (P$^{n}$ , L). In this paper, the relations of such topologies on the line set L are studied.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국제학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.30-35
• /
• 1993

Simple recurrence relations for calculating completion times of various storage polices (unlimited, intermediate storages(FIS), finite intermediate storages(FIS), no intermediate storage(NIS), zero wait(ZW) for serial multi-product multi-unit processes are suggested. Not only processing times but also transfer times, set-up (clean-up) times of units and set-up times of storages are considered. Optimal scheduling strategies with zero transfer times and zero set-up times had been developed as a mixed integer linear programniing(MILP) formulation for several intermediate storage policies. In this paper those with non-zero transfer times, non-zero set-up times of units and set-up times of storages are newly proposed as a mixed integer nonlinear programming(MINLP) formulation for various storage polices (UIS, NIS, FIS, and ZW). Several examples are tested to evaluate the robustness of this strategy and reasonable computation times.

• 디지털융복합연구
• /
• 제12권7호
• /
• pp.285-290
• /
• 2014

병원에 직접 가지 않아도 집에서 진료결과를 쉽게 확인할 수 있고 환자가 원하는 최적의 서비스를 최적의 타이밍에 제공받을 수 있다는 많은 장점에도 불구하고 현재 사용되고 있는 개인 헬스케어 기기는 제조사들이 만든 독자적인 소프트웨어 하드웨어 프로토콜로 인해 기기들 간의 호환성이 거의 없다. 이러한 문제 때문에 개인 헬스케어 기기와 셋톱박스 간의 표준화가 매우 필요하며, 이를 위해 본 연구에서는 IEEE P11073 표준을 이용하여 개인 헬스케어 기기와 셋톱박스 간의 생체 데이터 전송이 가능한 헬스케어 셋톱박스를 설계하였다. IEEE P11073 표준을 이용한 셋톱박스는 다양한 헬스케어 기기에 대한 독립적 데이터 전송을 가능케하여 헬스케어 시장의 활성화에 큰 기여를 할 것이라 기대한다.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2014년도 춘계학술대회
• /
• pp.795-797
• /
• 2014

단순 다각형 P의 가시성 다각형은 점이나 에지와 같은 가시원으로부터 가시적인 P의 내부 점들의 집합을 말한다. 가시성 다각형은 점들의 집합이므로 가시성 다각형에 대한 교집합과 합집합과 같은 집합 연산을 수행할 수 있다. 두 가시성 다각형의 교집합은 두 가시원으로부터 동시에 가시적인 점들의 집합이고, 합집합은 두 가시원 중 하나 이상에 가시적인 점들의 집합이다. 기존 연구로서 n개의 정점을 갖는 두 가시성 다각형에 대해 O(n) 시간에 수행되는 순차 알고리즘이 나와 있다. 본 논문에서는 $O(n^2)$크기의 재구성가능한 메쉬(Reconfigurable MESH) 병렬 모델에서 $O(log^2n)$ 시간에 해결하는 병렬 알고리즘을 제시한다.

• 충청수학회지
• /
• 제25권1호
• /
• pp.27-33
• /
• 2012

Let $f$ be a difeomorphism of a closed $n$ -dimensional smooth manifold M, and $p$ be a hyperbolic periodic point of $f$. Let ${\Lambda}(p)$ be a closed set which containing $p$. In this paper, we show that (i) if $f$ has the asymptotic average shadowing property on ${\Lambda}(p)$, then ${\Lambda}(p)$ is the chain component which contains $p$. (ii) suppose $f$ has the asymptotic average shadowing property on ${\Lambda}(p)$. Then if $f|_{\Lambda(p)}$ has the $C^{1}$-stably shadowing property then it is hyperbolic.

• 대한수학회보
• /
• 제37권4호
• /
• pp.685-690
• /
• 2000

In this paper, we consider the jump number of the split P[S] of a subset S ordered set P. $For\ x\in\ P,\ we\ show\ that\ s(P)\leq\ s(P[x]\leq\ s(P)+2$ and give a necessary and sufficient condition for which s(P[x])=s(P).

• Nonlinear Functional Analysis and Applications
• /
• 제26권1호
• /
• pp.65-70
• /
• 2021

We characterize the solution set for a second-order cone linear fractional optimization problem (P). We present sequential Lagrange multiplier characterizations of the solution set for the problem (P) in terms of sequential Lagrange multipliers of a known solution of (P).

• 충청수학회지
• /
• 제23권2호
• /
• pp.315-321
• /
• 2010

Waring's problem deals with representing any nonconstant function in a set of functions as a sum of kth powers of nonconstant functions in the same set. Consider ${\sum}_{i=1}^p\;f_i(z)^k=z$. Suppose that $k{\geq}2$. Let p be the smallest number of functions that give the above identity. We consider Waring's problem for the set of linear fractional transformations and obtain p = k.