• 대한수학회보
• /
• 제59권1호
• /
• pp.167-177
• /
• 2022

A vertex v of a graph G = (V, E) is said to ve-dominate every edge incident to v, as well as every edge adjacent to these incident edges. A set S ⊆ V is called a double vertex-edge dominating set if every edge of E is ve-dominated by at least two vertices of S. The minimum cardinality of a double vertex-edge dominating set of G is the double vertex-edge domination number γ_dve(G). In this paper, we provide an upper bound on the double vertex-edge domination number of trees in terms of the order n, the number of leaves and support vertices, and we characterize the trees attaining the upper bound. Finally, we design a polynomial time algorithm for computing the value of γ_dve(T) for any trees. This gives an answer of an open problem posed in [4].

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 The Third Asian Fuzzy Systems Symposium
• /
• pp.288-295
• /
• 1998

This paper proposes a new data classification method based on the tolerant rough set that extends the existing equivalent rough set. Similarity measure between two data is described by a distance function of all constituent attributes and they are defined to be tolerant when their similarity measure exceeds a similarity threshold value. The determination of optimal similarity theshold value is very important for the accurate classification. So, we determine it optimally by using the genetic algorithm (GA), where the goal of evolution is to balance two requirements such that (1) some tolerant objects are required to be included in the same class as many as possible. After finding the optimal similarity threshold value, a tolerant set of each object is obtained and the data set is grounded into the lower and upper approximation set depending on the coincidence of their classes. We propose a two-stage classification method that all data are classified by using the lower approxi ation at the first stage and then the non-classified data at the first stage are classified again by using the rough membership functions obtained from the upper approximation set. We apply the proposed classification method to the handwritten numeral character classification. problem and compare its classification performance and learning time with those of the feed forward neural network's back propagation algorithm.

• 대한수학회지
• /
• 제37권5호
• /
• pp.849-856
• /
• 2000

We give a new saddle point theorem for vector-valued functions on an admissible compact convex set in a topological vector space under weak condition that is the semicontinuity of two function scalarization and acyclicty of the involved sets. As application, we obtain the minimax theorem.

• 대한수학회논문집
• /
• 제9권3호
• /
• pp.629-639
• /
• 1994

Loewner ([13]) showend the semigroup of the real non-singular totally positive matrices is generated by itsinfinitesimal elements, that is,s the set of all Jacobi matrices with non-negative off-diagonal elements. In general, a semigroup is not completely recreated from the set of its infinitesimal elements. We extend Loewner's work and show that the semi-group of all invertible upper (or lower) triangular stochastic matrices is generated by the set of its infinitesimal elements.

• Korean Journal of Mathematics
• /
• 제25권1호
• /
• pp.71-85
• /
• 2017

This paper introduces a novel extension of soft rough fuzzy set so-called modified soft rough fuzzy set model in which new lower and upper approximation operators are presented together their related properties that are also investigated. Eventually it is shown that these new models of approximations are finer than previous ones developed by using soft rough fuzzy sets.

• East Asian mathematical journal
• /
• 제28권5호
• /
• pp.579-585
• /
• 2012

Let D be a finite digraph with the vertex set V(D) and arc set A(D). A two-valued function $f:V(D){\rightarrow}\{-1,\;1\}$ defined on the vertices of a digraph D is called a signed 2-independence function if $f(N^-[v]){\leq}1$ for every $v$ in D. The weight of a signed 2-independence function is $f(V(D))=\sum\limits_{v{\in}V(D)}\;f(v)$. The maximum weight of a signed 2-independence function of D is the signed 2-independence number ${\alpha}_s{^2}(D)$ of D. Recently, Volkmann [3] began to investigate this parameter in digraphs and presented some upper bounds on ${\alpha}_{s}^{2}(D)$ for general digraph D. In this paper, we improve upper bounds on ${\alpha}_s{^2}(D)$ given by Volkmann [3].

• ETRI Journal
• /
• 제37권2호
• /
• pp.406-416
• /
• 2015

Timing plays a key role in expressing the qualitative aspects of a character's motion; that is, conveying emotional state, personality, and character role, all potentially without changing spatial positions. Temporal editing of locomotion style is particularly difficult for a novice animator since observers are not well attuned to the sense of weight and energy displayed through motion timing; and the interface for adjusting timing is far less intuitive to use than that for adjusting pose. In this paper, we propose an editing system that effectively captures the timing variations in an example locomotion set and utilizes them for style transfer from one motion to another via both global and upper-body timing transfers. The global timing transfer focuses on matching the input motion to the body speed of the selected example motion, while the upper-body timing transfer propagates the sense of movement flow - succession - through the torso and arms. Our transfer process is based on key times detected from the example set and transferring the relative changes of angle rotation in the upper body joints from a timing source to an input target motion. We demonstrate that our approach is practical in an interactive application such that a set of short locomotion cycles can be applied to generate a longer sequence with continuously varied timings.

• 한국전자통신학회논문지
• /
• 제17권2호
• /
• pp.367-374
• /
• 2022

그래프 노드상에서 발생하는 그래프 신호의 일부를 선택해서 만든 샘플링 신호로부터 원신호를 복원하기 위해, 복원오차를 최소화하기 위한 최적의 샘플링 집합을 선택하는 알고리즘에 관해 연구한다. 복잡도 개선을 위해 복원오차를 직접적으로 최소화하는 대신에, 복원오차의 상한값을 비용함수로 사용하고, QR분해 적용을 통해 발생하는 상삼각행렬의 대각선상에 위치하는 값으로 샘플링을 결정할 수 있게 하는, 저 복잡도를 갖는 반복적 탐욕알고리즘을 제안한다. 기존의 샘플링 선택 방법과 비교하여, 제안 알고리즘이 복원 성능 저하를 평균 5%미만으로 유지하면서, 약 3.5배 빠른 실행시간을 보임을 다양한 그래프 상황에서 실험을 통해 확인한다.

• 대한상부위장관⦁헬리코박터학회지
• /
• 제18권3호
• /
• pp.198-203
• /
• 2018

Xanthogranulomatous gastritis (XGG) presenting as a subepithelial tumor (SET) is a very rare entity. We report a case of SET-like XGG diagnosed and treated with endoscopic resection. A 55-year-old female patient was initially referred with a 1.5-cm SET located at the anterior wall of the middle antrum. Endoscopic ultrasound examination revealed submucosal invasion without any perigastric lymph node enlargement. Endoscopic resection was performed for an accurate diagnosis and treatment, and the lesion was diagnosed histopathologically as XGG. At the 18-month follow-up after endoscopic resection, there was no evidence of XGG recurrence. SET-like XGG is very rare and the diagnosis is a preoperative challenge. However, inflammatory tumors should be considered in the differential diagnosis of SET.

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

In this paper, we investigate a set-membership identification approach to the quantification of an upper bound of model uncertainty in frequency domain, which is required in the H$_{\infty}$ robust control system design. First we formulate this problem as a set-membership identification of a nominal model error in the presence f unknown noise input with unknown bound, while the ordinary set-membership approaches assume that an upper bound of the uncertain input is known. For this purpose, the proposed algorithm includes the estimation of the bound of the uncertain input. thus the proposed method can obtain the hard bound of the model error in frequency domain as well as a parametric lower-order nominal model. Finally numerical simulation results are shown to confirm the validity of the presented algorithm..