• Journal of the Korean housing association
• /
• v.16 no.2
• /
• pp.19-25
• /
• 2005

This paper call attention to the characteristics of apartment unit plans as to the outdoor adjacency methods. My arguments will attempt to investigate spatial composition and each room sizes of the unit plans. So far, very little has been done in this direction. I will limits myself to study 573 plans which have been designed from 1996 till 2003. What emerges from this analysis is that these samples divided 3 types derived from the outdoor adjacency methods. Type 1 limits itself to 39 square meters unit plans. Type 2 was distributed from 49 square meters to 200 square meters with the exception of 100-110 square meters. And, type 3 ranges from 59 to 160 square meters. Therefore, it could be profitable each room's environmental condition (daylight, ventilation and etc) and diverse apartment building types to design in extent 49-160 square meters.

• Korean Journal of English Language and Linguistics
• /
• v.2 no.4
• /
• pp.555-574
• /
• 2002

This study concerns the constraints of English Poetic Meter. In English poems, the metrical pattern doesn't always match the linguistic stress on the lines. These mismatches are found differently among the poets. For the lexical stress mismatched with the weak metrical position, W⇒ Strength is established by the concept of the strong syllable. The peaks of monosyllabic words mismatched with the weak metrical position are divided according to which side of the boundary of a phonological domain they are adjacent to. Adjacency Constraint I is suggested for the mismatched peak which is adjacent to the left boundary of a phonological domain; /sup */Peak] and Adjacency ConstraintⅡ for the mismatched peak which is adjacent to the right boundary of a phonological domain. These constraints are various according to the poets (Pope, Milton and Shakespeare) : /sup */[Peak [-stress], /sup */W⇒ Strength and /sup */Peak] in Pope; /sup */[+stress][Peak[-stress] and /sup */Peak] in Milton; /sup */[ +stress][Peak[-stress], /sup */W⇒Strength and Adjacency ConstraintⅡ in Shakespeare.

• Proceedings of the Korea Database Society Conference
• /
• 2008.05a
• /
• pp.211-224
• /
• 2008

As a lot of information and media are given to users in Internet space nowadays, users feel disoriented or "lost in space" intensively. So it is suggested that we have the system to reduce information overload and to propose effective and efficient information. In this study we present a visualizing technique which uses fisheye views on data adjacency to combine global context and local details for presentation of many results in limited space. Data Adjacency on graph theory is applied to set up degree of interest which is main focus in fisheye views. Graph theory is useful to solve the problem resulted from various combinational optimization, especially it has advantages to analyze issues in information space like Internet. To test the usability of the proposed visualization technique, we compared the effectiveness of different visualization techniques. Results show that our method is evaluated with respect to less time and high satisfaction for a task accomplishment.

• Honam Mathematical Journal
• /
• v.32 no.3
• /
• pp.375-387
• /
• 2010

The paper studies an existence problem of a (generalized) universal covering space over a digital wedge with a compatible adjacency. In algebraic topology it is well-known that a connected, locally path connected, semilocally simply connected space has a universal covering space. Unlike this property, in digital covering theory we need to investigate its digital version which remains open.

• Honam Mathematical Journal
• /
• v.30 no.2
• /
• pp.207-217
• /
• 2008

Digital geometry has strongly contributed to the study of a discrete topological space $X{\subset}{\mathbf{Z}}^n$ with k-adjacency of ${\mathbf{Z}}^n$. As a survey-type article, we review various utilities of digital geometry.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1116-1120
• /
• 1987

In this paper, the Adjacency Matrix is applied to analyze the MIN, which is one of the kind and further implemented in designing the new kind of SSIN, which provides the special form of MIN that has identical link patterns between switching stages. At first, new theorems are established and next the classes of the SSIN are generated from computer simulation.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.2
• /
• pp.121-126
• /
• 1999

Existing data structures for non-manifold solid modelers use basic dat entities, such as vertex, edge, loop, face, shell, and region to find adjacency relationships. But, no one clearly identified what additional types of data entitles are necessary to represent incidence relationships. In this paper, we classified the boundary information of vertex, edge, face , and region from the 3-D space view. As the results we can clearly define the boundary information required for adjacency relationships. The existing B-rep data structures for solid modeler are compared whether they have the required boundary information.

• Bulletin of the Korean Mathematical Society
• /
• v.33 no.1
• /
• pp.75-86
• /
• 1996

Let G be a finite simple connected graph with vertex set V(G) and edge set E(G). Let A(G) be the adjacency matrix of G. The characteristic polynomial of G is the characteristic polynomial $\Phi(G;\lambda) = det(\lambda I - A(G))$ of A(G). A zero of $\Phi(G;\lambda)$ is called an eigenvalue of G.

• The KIPS Transactions:PartC
• /
• v.15C no.6
• /
• pp.531-538
• /
• 2008

With the dynamic and mobile nature of ad hoc networks, links may fail due to topology changes. So, a major challenge in ad hoc network is dynamically to search paths from a source to destination with an efficient routing method, which is an important issue for delay-sensitive real-time application. The main concerns of graph theory in communications are finding connectivity and searching paths using given nodes. A topology of the nodes in ad hoc networks can be modeled as an adjacency matrix. In this paper, based on this adjacency matrix, we propose new path search algorithms using a sequence of matrix calculation. The proposed algorithms can search paths from a destination to a source using connectivity matrix. Two matrix-based algorithms for two different purposes are proposed. Matrix-Based Backward Path Search(MBBS) algorithm is designed for shortest path discovery and Matrix-Based Backward Multipath Search(MBBMS) algorithm is for multipath search.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.1
• /
• pp.129-139
• /
• 1994

This paper presents a morphological analysis method for the Korean language. The characteristics and adjacency information of the words can be obtained from sentences in a large corpus. Generally a word can be analyzed to a result by applying the adjacency attributes and rules. However, we have to choose one from the several results for the ambiguous words. The collected morpheme's adjacency attributes and relations with neighbor words are recorded in a well designed dictionaries. With this information, abbreviated words as well as ambiguous words can be almost analyzed successfully. Efficiency of morphological analyzer depends on the information in the dictionaries. A morpheme dictionary and a phrase dictionary have been designed with lexical database, and necessary information extracted from the corpus is stored in the dictionaries.