• 제어로봇시스템학회:학술대회논문집
• /
• 1994.10a
• /
• pp.293-299
• /
• 1994

A new approach to deal with the model matching problem for square plants is suggested. Admissibility conditions of the model matching error are derived in terms of state-space parameters and the derived formulas are exploited to obtain the solution to the model matching problem in H$_{2}$ norm.

• 전기의세계
• /
• v.27 no.6
• /
• pp.58-62
• /
• 1978

The problem of optimal shutdown control of nuclear reactor having nonlinear dynamics is considered. Since the problem, being a bounded state space problem, is difficult to solve by conventional analytic methods such as Pontryagin's maximum principle, it is approached directly by the quasilinearization technique, and solved numerically. The solution obtained in this manner proves to be an improvement over the previous results.

• Kyungpook Mathematical Journal
• /
• v.63 no.4
• /
• pp.647-707
• /
• 2023

In this article, we discuss and survey the recent progress towards the Schottky problem, and make some comments on the relations between the André-Oort conjecture, Okounkov convex bodies, Coleman's conjecture, stable modular forms, Siegel-Jacobi spaces, stable Jacobi forms and the Schottky problem.

• Korean Institute of Interior Design Journal
• /
• v.13 no.6
• /
• pp.3-11
• /
• 2004

In the 21st Century, our society is facing decrease of general population and beginning of aging society due to low birth rate, and such issues are increasing the elderly population. Especially in Korea, the elderly population exceeded 7% of the total population in 2000, making its way to the aging society and the elderly population will increase up to 14% by 2019, becoming the true aging society. Unlike other countries, aging in Korea is happening very fast and this requires the society's preparation and plans to deal with the problem. This study was started with the problem that the welfare centers for elderly people in Gwangju do not have the space plan adequate for the regional characteristics and users' demands. Therefore, this study performed an investigation and analysis on service programs, management, and space formation of S welfare centers for elderly people in Gwangju. This study produced a figure after interviews with social welfare workers and surveys. And then this study investigated size and formation of space for the service programs in each welfare center This study showed the current status of welfare centers for elderly people and difference in size and formation of space related to the service programs of the region. Therefore, this study was done to provide the basic data for the space formation of new welfare centers.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.28 no.3
• /
• pp.7-25
• /
• 2017

The problem of library space has long been discussed in various aspects such as library relations, architecture, and space design. The purpose of this study is to examine the change of the concept of the complex space of the library according to the development of advanced technology and the social paradigm, and to present the direction of constructing the complex space of the future library by analyzing each case. All concepts such as mediatheque, information commons, larchiveum, and the maker space that is recently introduced into the library are important elements of the complex space presented as a problem of library construction and space. The future library reflects these concepts and serves as a mediator between information and users, users and users, users and media to support reading, information, learning, rest, community-oriented culture and creation, start-up and collaboration. It should be constructed as a multi-space platform to create new value through.

• 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.

• ETRI Journal
• /
• v.28 no.6
• /
• pp.819-821
• /
• 2006

Log-polar coordinate image space is proposed as a solution for the problem of unbounded accumulator space in the automatic detection of vanishing points. The proposed method can detect vanishing points at high speed under small memory requirements, as opposed to conventional image space based methods.

• The Korean Journal of Air & Space Law and Policy
• /
• v.16
• /
• pp.224-235
• /
• 2002

The problem of space debris has been dealt with at the STSC of the COPUOS. The technical discussion at the said Committee was finished by adopting the Technical Report in 1999. Its legal discussion will be followed very soon at the LSC of the COPUOS. In this paper, I try to outline certain legal points concerning the space debris.

• Journal of the Korean Geographical Society
• /
• v.46 no.3
• /
• pp.366-381
• /
• 2011

A competitive location problem in discrete space is computationally difficult to solve in general because of its combinatorial feature. In this paper, we address an alternative method for solving competitive location problems in discrete space, particularly employing deterministic allocation. The key point of the suggested method is to reducing the number of predefined potential facility sites associated with the size of problem by utilizing geometric concepts. The suggested method was applied to the existing broadband marketplace with increasing competition as an application. Specifically, we compared computational results and spatial configurations of two different sized problems: the problem with the original potential sites over the study area and the problem with the reduced potential sites extracted by a GIS-based geometric algorithm. The results show that the competitive location model with the reduced potential sites can be solved more efficiently, while both problems presented the same optimal locations maximizing customer capture.

• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.141-154
• /
• 2007

The connectivity problem is a fundamental problem in graph theory. The best known algorithm to solve the connectivity problem on general graphs with n vertices and m edges takes $O(K(G)mn^{1.5})$ time, where K(G) is the vertex connectivity of G. In this paper, an efficient algorithm is designed to solve vertex connectivity problem, which takes $O(n^2)$ time and O(n) space for a trapezoid graph.