• 대한수학회보
• /
• 제46권1호
• /
• pp.171-182
• /
• 2009

In this paper, we consider the parameter space of the rational plane curves with uni-branched singularity. We show that such a parameter space is decomposable into irreducible components which are rational varieties. Rational parametrizations of the irreducible components are given in a constructive way, by a repeated use of Abhyankar-Moh Epimorphism Theorem. We compute an enumerative invariant of this parameter space, and include explicit computational examples to recover some classically-known invariants.

• 정보과학회 논문지
• /
• 제44권9호
• /
• pp.986-991
• /
• 2017

본 논문에서는 주어진 입 출력 예제로부터 명령형 프로그램을 합성하는 방법을 제시한다. 프로그램 합성기의 입력으로 (1) 입 출력 예제, (2) 불완전한 프로그램, (3) 사용될 변수 및 정수가 주어지면, 합성기는 주어진 입 출력 예제를 모두 만족하는 완성된 프로그램을 출력한다. 기본 알고리즘은 정답 프로그램을 찾을 때까지, 가능한 모든 프로그램을 나열하는 것이다(enumerative search). 이 경우 탐색 공간이 매우 크므로 오랜 시간이 걸린다는 문제점이 있다. 시간을 효과적으로 단축하기 위한 우리의 방법은, 코드 최적화 기법을 이용해 문법은 다르지만 같은 의미의 프로그램들을 확인함으로써, 불필요한 중복탐색을 피하는 것이다. 20개의 입문자 교육용 프로그래밍 문제들을 대상으로 합성 알고리즘 성능을 평가한 결과, 우리의 방법이 기본 탐색 알고리즘의 성능을 약 10배 향상시킴을 확인하였다.

• 한국문헌정보학회지
• /
• 제32권2호
• /
• pp.55-76
• /
• 1998

이 논문의 전반부는 분석적 합성식 분류법의 일반적인 특성과 장단점을 열거식분류법과 대비하여 분석하고 있다. 후반부에서는 분석적 합성식 분류표의 일반적인 작성단계와 그에 따르는 문제점과 고려사항을 분석하고, 이를 결혼상담소용 분류표의 작성이라는 실예를 통하여, 패싯분석과 주류의 순서 및 열거순서, 배열구조상의 순서 등 각종 순서의 결정, 분류기호의 선택과 적용의 순서로 고찰하고 있다.

• Journal of Construction Engineering and Project Management
• /
• 제3권3호
• /
• pp.17-22
• /
• 2013

In many urban cities, super-tall buildings have been being constructed around New York and Chicago as the center since 1930 to improve the efficiency of land use and respond to new residential type. In terms of energy consumption, super-tall buildings are classified as a top energy consumption building. Also, as time passed, the degradation of energy performance occurs in super-tall buildings like general things so that these cannot show the initial performance planned in the design phase. Accordingly, building owners need to make a plan to apply energy saving measures to existing building during the operation phase. In order to select energy saving measures, calculus-based methods and enumerative schemes have been typically used. However, these methods are time-consuming and previous studies which used these methods have problems with not considering the initial construction cost. Consequently, this study proposes a model for selecting an optimal combination of energy saving measures which derives maximum energy saving within allowable cost using genetic algorithms. As a contribution of this research, it would be expected that a model is utilized as one of the decision-making tools during the planning stage for energy saving.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권6호
• /
• pp.2282-2303
• /
• 2021

To solve the problems of heavy computing load and system transmission pressure in energy internet (EI), we establish a three-tier cloud-edge integrated EI network based on a cloud-edge collaborative computing to achieve the tradeoff between energy consumption and the system delay. A joint optimization problem for resource allocation and task offloading in the threetier cloud-edge integrated EI network is formulated to minimize the total system cost under the constraints of the task scheduling binary variables of each sensor node, the maximum uplink transmit power of each sensor node, the limited computation capability of the sensor node and the maximum computation resource of each edge server, which is a Mixed Integer Non-linear Programming (MINLP) problem. To solve the problem, we propose a joint task offloading and resource allocation algorithm (JTOARA), which is decomposed into three subproblems including the uplink transmission power allocation sub-problem, the computation resource allocation sub-problem, and the offloading scheme selection subproblem. Then, the power allocation of each sensor node is achieved by bisection search algorithm, which has a fast convergence. While the computation resource allocation is derived by line optimization method and convex optimization theory. Finally, to achieve the optimal task offloading, we propose a cloud-edge collaborative computation offloading schemes based on game theory and prove the existence of Nash Equilibrium. The simulation results demonstrate that our proposed algorithm can improve output performance as comparing with the conventional algorithms, and its performance is close to the that of the enumerative algorithm.

• 국제학술발표논문집
• /
• The 5th International Conference on Construction Engineering and Project Management
• /
• pp.294-299
• /
• 2013

In many urban cities, super-tall buildings have been being constructed around New York and Chicago as the center since 1930 to improve the efficiency of land use and respond to new residential type. In terms of energy consumption, super-tall buildings are classified as a top energy consumption building. Also, as time passed, the degradation of energy performance occurs in super-tall buildings like general things so that these cannot show the initial performance planned in the design phase. Accordingly, building owners need to make a plan to apply energy saving measures to existing building during the operation phase. In order to select energy saving measures, calculus-based methods and enumerative schemes have been typically used. However, these methods are time-consuming and previous studies which used these methods have problems with not considering the initial construction cost. Consequently, this study proposes a model for selecting an optimal combination of energy saving measures which derives maximum energy saving within allowable cost using genetic algorithms. As a contribution of this research, it would be expected that a model is utilized as one of the decision-making tools during the planning stage for energy saving.

• 한국비블리아학회지
• /
• 제15권1호
• /
• pp.23-41
• /
• 2004

웹 자원을 색인 및 조직하는 데에는 키워드 추출에 기반한 자동색인에 의한 방법과 기존의 분류 체계나 주제별 디렉토리를 이용하는 방법이 있다. 그러나 두 방법은 각각 표준적인 방식이 없거나 분류 구조상의 불합리성으로 인하여 이용자의 정보 요구에 제대로 대처하지 못하고 있다. 따라서 이 논문에서는 기존 분류 체계의 구조상의 한계와 특정성과 망라성과 같은 웹 자원의 특성과 관련된 문제를 지적함과 더불어 패싯 분석에 의한 웹 자원 조직의 타당성과 그 장단점을 기술하였다. 그리고 패싯 분석을 이용 한 구체적인 방법론 세 가지를 제시하였다. 첫째, 패싯 분석을 기반으로 한 색인 시스템, 둘째, 열거형 분류 체계를 패싯 분류 체계로 구조를 수정한 대안, 셋째, 국내 검색 엔진의 주제별 디렉토리의 패싯 모형 등이다. 이러한 방법론들을 검토한 결과, 패싯 분석에 의한 통제어휘 구축이 웹 자원을 조직하는 수단으로 활용될 수 있는 가능성을 제시하였다.

• 대한수학회지
• /
• 제54권4호
• /
• pp.1121-1148
• /
• 2017

Go is an ancient game of great complexity and has a huge following in East Asia. It is also very rich mathematically, and can be played on any graph, although it is usually played on a square lattice. As with any game, one of the most fundamental problems is to determine the number of legal positions, or the probability that a random position is legal. A random Go position is generated using a model previously studied by the author, with each vertex being independently Black, White or Uncoloured with probabilities q, q, 1 - 2q respectively. In this paper we consider the probability of legality for two scenarios. Firstly, for an $N{\times}N$ square lattice graph, we show that, with $q=cN^{-{\alpha}}$ and c and ${\alpha}$ constant, as $N{\rightarrow}{\infty}$ the limiting probability of legality is 0, exp($-2c^5$), and 1 according as ${\alpha}$ < 2/5, ${\alpha}=2/5$ and ${\alpha}$ > 2/5 respectively. On the way, we investigate the behaviour of the number of captured chains (or chromons). Secondly, for a random graph on n vertices with edge probability p generated according to the classical $Gilbert-Erd{\ddot{o}}s-R{\acute{e}}nyi$ model ${\mathcal{G}}$(n; p), we classify the main situations according to their asymptotic almost sure legality or illegality. Our results draw on a variety of probabilistic and enumerative methods including linearity of expectation, second moment method, factorial moments, polyomino enumeration, giant components in random graphs, and typicality of random structures. We conclude with suggestions for further work.

• 한국도서관정보학회지
• /
• 제20권
• /
• pp.351-381
• /
• 1993

The purpose of this study is to analyze the various processes and patterns to build or synthesize class numbers in the 800 class of the Dewey Decimal Classification, Edition 20(1989). The results of the analysis are as follows: 1. The 800(Literature and rhetoric) class in the DDC system is the main class added analytico-synthetic principle positively to an enumerative scheme. 2. The facets to be a n.0, pplied in literature are language literary form literary period ; kind, scope, or medium ; notation 08(collection) or 09(criticism) literary feature, subject, author, etc. 3. In the 800 class, there are the five tables of precedence for literary forms aspects ; specific kinds of persons ; literary, period in relation to the aspects for works treating more than one literary form subforms, aspects and literary periods in the works treating a specific literary form. 4. The basic number synthesis of literary works proceeds through the various facets in the following sequence, as far as necessary for the item : base no. + literary form + literary time or period + kind, scope, or medium + notation 08 or 09 + subform + additional notation from T3C and other tables. 5. In view of the multiplicity of facets, their synthesis formulas take the following order : (1) Works about the literature : base no.(schedule) + language(T6) or form(T3B) (2) Works by or about individual author : base no.(schedule) + form (T3A) + period(schedule) + subform(T3A) (3) Works by or about more than one author, not restricted by language facet : base no.(schedule) + period(T1) ; base no.(schedule) + kind, scope, medium(T3B), or feature(T3C), or person(T5). (4) Works by or about more than one author, restricted by language facet : base no.(schedule) + form (T3B) + period(schedule) + subform(T3B) + notation 08 or 09(T3B) ; base no.(schedule) + notation 08 or 09(T3B) + 9(T3C) + area notation(T2) : base no.(schedule) + form (T3B) + notation 008 or 009(T3B) : base no.(schedule) + form (T3B) + kind, scope, medium(T3B) + notation 08 or 09(T3B) + period(schedule). (5) Affiliated literatures for which period numbers are not us base no.(schedule) + form (T3A or T3B), or notation 08 or 09(T3B) : base no.(schedule) + kind, scope, medium(T3B), feature(T3C), or person(T5) 6. The problems in the number building of the 800 class are the complexity and difficulty of number synthesis, the intrinsic weakness of from distinction and the inconvenience of retrieval inherent in the form class. In order to solve these problems, therefore, the citation orders and methods of DDC should be improved and synthesis patterns simplified from the point of view of its applicability and its usefulness in the "literature class".