• 호남수학학술지
• /
• 제42권4호
• /
• pp.645-651
• /
• 2020

The distinguishing number (index) D(G) (D'(G)) of a graph G is the least integer d such that G has an vertex labeling (edge labeling) with d labels that is preserved only by a trivial automorphism. The strong product G ☒ H of two graphs G and H is the graph with vertex set V (G) × V (H) and edge set {{(x1, x2),(y1, y2)}|xiyi ∈ E(Gi) or xi = yi for each 1 ≤ i ≤ 2.}. In this paper we study the distinguishing number and the distinguishing index of strong product of two graphs. We prove that for every k ≥ 2, the k-th strong power of a connected S-thin graph G has distinguishing index equal two.

• 대한수학회보
• /
• 제52권2호
• /
• pp.395-408
• /
• 2015

In present article, we determine the distinguishing number of the merged Johnson graphs which are generalization of both the Kneser graphs and the Johnson graphs.

• Journal of Electrical Engineering and information Science
• /
• 제3권2호
• /
• pp.151-157
• /
• 1998

Free-space optical interconnection networks can be classified into two types, space variant and space invariant, according to the degree of space variance. In terms of physical implementations, the degree of space variance can be interpreted as the degree of sharing beam steering optics among the nodes of a given network. This implies that all nodes in a totally space-invariant network can share a single beam steering optics to realize the given network topology, whereas, in a totally space variant network, each node requires a distinct beam steering optics. However, space invariant networks require mechanisms for distinguishing the origins of incoming signals detected at the node since several signals may arrive at the same time if the node degree of the network is greater than one. This paper presents a signal source encoding scheme for distinguishing incoming signals efficiently, in terms of the number of detectors at each node or the number of unique wavelengths. The proposed scheme is solved by developing a new parallel genetic algorithm called distributed asynchronous genetic algorithm (DAGA). Using the DAGA, we solved signal distinction schemes for various network sizes of several topologies such as hypercube, the mesh, and the de Brujin.

• 대한수학회논문집
• /
• 제30권1호
• /
• pp.45-64
• /
• 2015

In this article, we consider a proper total coloring distinguishes adjacent vertices by sums, if every two adjacent vertices have different total sum of colors of the edges incident to the vertex and the color of the vertex. Pilsniak and Wozniak [15] first introduced this coloring and made a conjecture that the minimal number of colors need to have a proper total coloring distinguishes adjacent vertices by sums is less than or equal to the maximum degree plus 3. We study proper total colorings distinguishing adjacent vertices by sums of some graphs and their products. We prove that these graphs satisfy the conjecture.

• International Journal of Internet, Broadcasting and Communication
• /
• 제16권1호
• /
• pp.280-286
• /
• 2024

In this paper, layered UNet with warmup and dropout tricks was used to segment teeth instantly by using data labeled for each individual tooth and increase performance of the result. The layered UNet proposed before showed very good performance in tooth segmentation without distinguishing tooth number. To do instance segmentation of teeth, we labeled teeth CBCT data according to tooth numbering system which is devised by FDI World Dental Federation notation. Colors for labeled teeth are like AI-Hub teeth dataset. Simulation results show that layered UNet does also segment very well for each tooth distinguishing tooth number by color. Layered UNet model using warmup trick was the best with IoU values of 0.80 and 0.77 for training, validation data. To increase the performance of instance segmentation of teeth, we need more labeled data later. The results of this paper can be used to develop medical software that requires tooth recognition, such as orthodontic treatment, wisdom tooth extraction, and implant surgery.

• 충청수학회지
• /
• 제16권1호
• /
• pp.15-23
• /
• 2003

In order to compute the Nielsen number N(f) of a self-map $f:X{\rightarrow}X$, some Reidemeister classes in the fundamental group ${\pi}_1(X)$ need to be distinguished. D. Ferrario has some algebraic results which allow distinguishing Reidemeister classes. In this paper we generalize these results to the Reidemeister sets of iterates.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(3)
• /
• pp.29-32
• /
• 2001

In this paper, we applied the high-performance PGAP(Parallel Genetic Algorithm Processor) to recognizing rotated pattern. In order to perform this research efficiently, we used Multi-PGAP system consisted of four PGAP. In addition, we used mental rotation based on the rotated pattern recognition mechanism of human to reduce the number of operation. Also, we experimented with distinguishing specific pattern from similar coin patterns and determine rotated angle between patterns. The result showed that the development of future artificial recognition system is feasible by employing high performance PGAPS.

• 복식
• /
• 제55권7호
• /
• pp.76-88
• /
• 2005

The aim of this study is to define the concept of the matchless, and its social and cultural origins. I shall also define the different types of Matchless style, the respective characteristics of each style, and the distinguishing features of this style in domestic street fashion. In order to do this, 1 have referred to several published studies and a number of Web-sites of Korean fashion information companies for my research. The results of this study are the following; 1. The concept of matchless is a positive way of self-expression by coordination, created by consumers who attach great importance to their image and to developing their individual style. Also, this concept constitutes a new approach to code which reanalyzes existing styles with a new sensitivity. 2. The social & cultural origins of matchless are the expansion of fear of war and terror, and economic depression, the extension of the 5-day workweek, interest in 'Well-being', and the phenomena of cultural diversity. 3. The types of Matchless are Style Matchless, Theme Matchless, Texture Matchless, Season Matchless, and Complex-Layered Matchless. 4. The distinguishing features of Matchless in street fashion are the distinction of formal & Casual wear's Matchless, the creation of a new Look in Sports & Casual wear's Matchless, the development of a new coordinated, layered look, the immense popularity of Denim, the new fashionable versions of Military style, and the renaissance of the Romantic Feminine Look.

• Journal of Information Technology Applications and Management
• /
• 제26권3호
• /
• pp.19-27
• /
• 2019

In this study, we propose a methodology for predicting the movie audience based on movie information that can be easily acquired before opening and effectively distinguishing qualitative variables. In addition, we constructed a model to estimate the number of movie audiences at the time of data acquisition through the configured variables. Another purpose of this study is to provide a criterion for categorizing success of movies with qualitative characteristics. As an evaluation criterion, we used information gain ratio which is the node selection criterion of C4.5 algorithm. Through the procedure we have selected 416 movie data features. As a result of the multiple linear regression model, the performance of the regression model using the variables selection method based on the information gain ratio was excellent.

• 대한수학교육학회지:학교수학
• /
• 제12권3호
• /
• pp.371-388
• /
• 2010

이 논문의 목적은 소수(素數, prime number) 개념을 처음 배우는 학생들이 소수와 그 관련 개념들을 어떻게 이해하고 있는지를 탐구하기 위한 것이다. 이를 위하여 소수와 합성수 개념을 학습한 직후의 중학교 1학년 학생들에게 설문조사를 중심으로 자료를 수집하고 분석하였다. 연구 결과, 학생들은 주어진 자연수의 소수성을 판정하기 위한 소수의 기능적인 정의를 선호하며, 주어진 자연수의 약수를 찾는 것에만 주목하여 소수와 합성수를 곱셈적 관계로 이해하는데 어려움을 나타내었다. 이러한 결과는 학생들이 자연수의 곱셈적 기본 단위로서 소수 개념의 본질적인 중요성을 인식하고 산술의 기본 정리가 보장하는 자연수의 곱셈적 구조를 이해할 수 있도록 하는 교수학적 전략의 필요성을 제안한다.