• Korean Journal of Mathematics
• /
• v.21 no.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.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.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}}}$.

• Journal of the Korean Mathematical Society
• /
• v.39 no.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.10b
• /
• 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.

• Journal of Digital Convergence
• /
• v.12 no.7
• /
• pp.285-290
• /
• 2014

In these days the patient can be easy to see the treatment results at home without going directly to hospital. Despite the many advantages that the patient is got optimum service timely, the currently used personal healthcare devices have no compatibility because the manufacturer use the proprietary software and hardware protocols. For these issues, standardization is required between the set-top box and the individual healthcare devices. In this paper, we designed the healthcare set-top box possible to biometric data transmission by using a standard IEEE P11073 between the device and the set-top box. Because the set-top box using IEEE P11073 standardization can transfer data independently, we are expected to make it contribute significantly to the healthcare business.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.795-797
• /
• 2014

The visibility polygon of a simple polygon P is the set of points which are visible from a visibility source in P such as a point or an edge. Since a visibility polygon is the set of points, the set operations such as intersection and union can be executed on them. The intersection(resp. union) of two visibility polygons is the set of points which are visible from both (resp. either) of the corresponding two visibility sources. As previous results, there exist O(n) time algorithms for the set operations of two visibility polygons with total n vertices. In this paper, we present $O(log^2n)$ time algorithms for solving the problems on a reconfigurable mesh with size $O(n^2)$.

• Journal of the Chungcheong Mathematical Society
• /
• v.25 no.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.

• Bulletin of the Korean Mathematical Society
• /
• v.37 no.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
• /
• v.26 no.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).

• Journal of the Chungcheong Mathematical Society
• /
• v.23 no.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.