• 호남수학학술지
• /
• 제30권4호
• /
• pp.589-602
• /
• 2008

As a survey-type article, the paper reviews various digital topological utilities from digital covering theory. Digital covering theory has strongly contributed to the calculation of the digital k-fundamental group of both a digital space(a set with k-adjacency or digital k-graph) and a digital product. Furthermore, it has been used in classifying digital spaces, establishing almost Van Kampen theory which is the digital version of van Kampen theorem in algebrate topology, developing the generalized universal covering property, and so forth. Finally, we remark on the digital k-surface structure of a Cartesian product of two simple closed $k_i$-curves in ${\mathbf{Z}}^n$, $i{\in}{1,2}$.

• 한국수학사학회지
• /
• 제18권1호
• /
• pp.103-110
• /
• 2005

스위스 수학자 오일러에 의하여 해결된 쾨니히스베르크의 다리문제에 대한 역사적 배경과 그 응용으로서 그래프의 컴퓨터 표현에 대하여 간단한 예를 통하여 행렬로 표현하였고 오일러 회로에 의한 행렬 표현을 연구해 보았다.

• 로봇학회논문지
• /
• 제8권2호
• /
• pp.82-91
• /
• 2013

This paper proposes a building recognition algorithm using watershed image segmentation algorithm and integrated region matching (IRM). To recognize a building, a preprocessing algorithm which is using Gaussian filter to remove noise and using canny edge extraction algorithm to extract edges is applied to input building image. First, images are segmented by watershed algorithm. Next, a region adjacency graph (RAG) based on the information of segmented regions is created. And then similar and small regions are merged. Second, a color distribution feature of each region is extracted. Finally, similar building images are obtained and ranked. The building recognition algorithm was evaluated by experiment. It is verified that the result from the proposed method is superior to color histogram matching based results.

• 전기의세계
• /
• 제30권2호
• /
• pp.101-111
• /
• 1981

This paper describes two methods which generate all the prime implicants (PI's) quickly by using the directions of adjacency tavle (DA-table) that gives the knowledge of adjacency relations among the given minterms. One is a graphical method that enables us to generate PI's by hand, the other is a checking method that determines the existance of PI's quickly when it is programmed on a digital computer. And a fast minimization algorithm will be shown in this paper that can be implemented with reduced computational effort by selecting essential prime implicants (EPI's) first of all and using the concept of the integration of the PI identification and selection procedure. The procedure, proposed in this paper, has all the advantage of Karnaugh mapping, so the procedure is simple and easy.

• 한국컴퓨터정보학회논문지
• /
• 제20권12호
• /
• pp.101-106
• /
• 2015

This paper suggests heuristic algorithm with polynomial time complexity for rigging elections problem that can be obtain the optimal solution using linear programming. The proposed algorithm transforms the given problem into adjacency graph. Then, we divide vertices V into two set W and D. The set W contains majority distinct and the set D contains minority area. This algorithm applies divide-and-conquer method that the minority area D is include into majority distinct W. While this algorithm using simple rule, that can be obtains the optimal solution equal to linear programing for experimental data. This paper shows polynomial time solution finding rule potential in rigging elections problem.

• 영어어문교육
• /
• 제9권1호
• /
• pp.23-48
• /
• 2003

This paper provides an analysis of the linear constituent order of the NP in three different types of languages based on 33 languages: the NP with the prenominal modifiers, the NP with the postnominal modifiers, and the NP with both prenominal and postnominal modifiers (the mixed NP). Languages have NPs that feature different linear order, of the NP constituents. We attribute such different linear constituent orders within the NP to the linguistic distance and the limits imposed by the constituency and adjacency. We use the various kinds of alignment constraints which properly reflect the linguistic distance between the noun and each constituent. Language universals on word order provide us some general orders of various NP constituents. If we adopt the linguistic distance, the limits imposed by the constituency and the adjacency, and the alignment constraints, we can explain the complicated differences of NP constituent orders of languages of the world.

• Industrial Engineering and Management Systems
• /
• 제10권4호
• /
• pp.279-287
• /
• 2011

This research develops a framework for resolving time and worker conflicts in the Critical Chain Project Management (CCPM) method, expressed in the form of a Max-Plus Linear (MPL) system. Our previous work proposed a method for resolving time conflicts. However, in practical cases, both time and worker conflicts may occur. Hence, we propose a method for resolving both time and worker conflicts for a single project. We first consider how to detect a resource conflict. Then, we define an adjacency matrix to resolve the detected conflicts. Using the proposed method, we confirm that the resource conflict can be resolved through a numerical example.

• 전기의세계
• /
• 제28권6호
• /
• pp.61-77
• /
• 1979

This paper is concerned with minimization process of the binary logic function. This paper describes an algorithm called the SIMPLE TABLE METHOD that well suited to minimization a switching function of any number of variables. For the Simple Table construction, a theorem based upon the numerical properties of the logic function is derived from the relationships governing minterms of the given function. Finally the minimal sum of products can be obtained in terms of the Direct Method or the Indirect Method from the table and table characteristics derived from the Simple Table. The properties and table characteristics used in this paper are described. All the minterms of a switching function are manipulated only by decimal numbers, not binary numbers. Some examples are used as a vehicle to guide the readers who are familiar with the Karnaugh map and Quine-McCluskey tabular method to this New method. These examples not only treat how to handle Don't Care miterms but also show the multiple output functions.

• 비교문화연구
• /
• 제27권
• /
• pp.435-470
• /
• 2012

This paper aims to examine directives and its adjacency pair directives-responses in the Chinese textbook Hanyu Kouyu from the speech act theory, and give some suggestions for Chinese speaking instruction. For analysis of directives, it is important to consider context surrounding it at first. Context includes space for speaking, person who speak with, adjacent speech act, etc., so this paper considers context firstly before explaining directives and discusses how each element of context effects interpretation of its meaning. From the politeness perspective, directives and rejection as one of the responses are easy to be FTAs(face-threatening acts) fundamentally, so they are required to have some strategies for minimizing the threat, and it is found that there are strategies for positive face and negative face in the textbook. In the textbook, it is also examined that directives-responses contribute for interlocutor to accomplish social acts, for example, negotiating, insisting, maintaining, making alternative ideas, etc.

• East Asian mathematical journal
• /
• 제16권1호
• /
• pp.147-159
• /
• 2000

In this paper, we investigate the properties of non-normal(convexoid, hyponormal) adjacency operators for a graph under two operations, tensor product and Cartesian one.