• 한국컴퓨터정보학회논문지
• /
• 제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.

• 비교문화연구
• /
• 제39권
• /
• pp.485-499
• /
• 2015

Initially, the word 'usage' in the rule of Korean orthography was used to indicate the whole grammatical knowledge to separate between stems and inflectional affixes and nominals and case markers. Nowadays the word 'usage' in the rule of Korean orthograph is understood to indicate both 'usage' as the principles of the orthographic rule and 'grammar.' Even though 'usage' and 'grammar' can be understood as two different words, the discrepancy between them is not clear. In fact, if examining the rule of Korean orthography, it is not difficult to find that the principles of the orthography is written based on the grammar rules. Thus, the original principle is damaged because the rule of Korean orthography depends on the grammar rules too much. In addition, the rule of Korean orthography forces to change the grammar rules when describing them. Incorrect description of the grammar rules often causes the spelling mistakes. Therefore, it is necessary to divide two areas such as 'usage' and 'grammar' when dealing with 'the orthographic rules' and describing them.

• 산업경영시스템학회지
• /
• 제29권2호
• /
• pp.104-109
• /
• 2006

We can offer suitable information to users analyzing the pattern of users. An association rule is one of data mining techniques which can discover the pattern. We use an association rule which considers the web page visiting time and we should the pattern analyse of users. The offered method puts the weights in Web page visiting time of the user and produces an association rule. Weight is web page visiting time unit divide to total of web page visiting time. We offer rather meaningful result the association rule by Apriori algorithm. This method that proposes in the paper offers rather meaningful result Apriori algorithm

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1994년도 춘계공동학술대회논문집; 창원대학교; 08월 09일 Apr. 1994
• /
• pp.691-700
• /
• 1994

Voronoi diagram of a set of geometric entities on a plane such as points, line segments, or arcs is a collection of Voronoi polygons associated with each entity, where Voronoi polygon of an entity is a locus of point which is closer to the associated entity than any other entity. Voronoi diagram is one of the most fundamental geometrical construct and well-known for its theoretical elegance and the wealth of applications. Various geometric problems can be solved with the aid of Voronoi diagram. For example, the maximum tool diameter of a milling cutter for rough cutting in a pocket can be easily found, and the pocketing tool path can be efficiently generated from Voronoi diagram. In PCB design, the design rule checking can be easily done via Voronoi diagram, too. This paper discusses an algorithm to construct Voronoi diagram of a simple polygon which consists of simple curves such as line segments as well as arcs in a plane with O(nlogn) time complexity by employing the divide and conquer scheme.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1996년도 추계학술대회 학술발표 논문집
• /
• pp.129-132
• /
• 1996

In this paper, we suggest a framework to represent the fuzziness in knowledge base as a perspective of the object-oriented paradigm. We divide the knowledge base in two parts. One is the object-base that stores the fuzzy propositions and the explanatory databases. The other is the rule-base that manages the rules between the fuzzy propositions. As the first step, we have to develop a new fuzzy object model that gives an easy way to represent the fuzzy propositions, that is, the fuzzy knowledge in the real world.

• 한국정보시스템학회지:정보시스템연구
• /
• 제12권2호
• /
• pp.1-20
• /
• 2003

This paper deals with the application of the genetic algorithm to the technical trading rule of the stock market. MACD(Moving Average Convergence & Divergence) and the Stochastic techniques are widely used technical trading rules in the financial markets. But, it is necessary to determine the parameters of these trading rules in order to use the trading rules. We use the genetic algorithm to obtain the appropriate values of the parameters. We use the daily KOSPI data of eight years during January 1995 and October 2002 as the experimental data. We divide the total experimental period into learning period and testing period. The genetic algorithm determines the values of parameters for the trading rules during the teaming period and we test the performance of the algorithm during the testing period with the determined parameters. Also, we compare the return of the genetic algorithm with the returns of buy-hold strategy and risk-free asset. From the experiment, we can see that the genetic algorithm outperforms the other strategies. Thus, we can conclude that genetic algorithm can be used successfully to the technical trading rule.

• 한국철학논집
• /
• 제27호
• /
• pp.327-361
• /
• 2009

『대학(大學)』이 본래 치자를 상대로 교육하는 정치학 텍스트였다는 점은 오늘날 우리가 책을 이해하는데 무엇보다도 중요시해야 하는 전제이다. 주지하듯이 정치가에게 '자기성찰적 도덕성(修己)'을 요구하는 『대학』은 오늘날 흔히 이해되듯이 '도덕'과 '행정'이 분리된 이해방식이 아니라 행정의 결과에 정치가의 위대한 도덕행정의 공효가 드러나는 것을 의미하기 때문이다. 즉 『대학(大學)』에서 말하는 도덕은 흔히 말하는 현실과 유리된 도덕적 이해 윤리적 이해를 의미하는 것이 아니라 현실의 정치적 능력을 포함하는 보다 포괄적인 실천 능력 전반을 의미한다. 삼강령 가운데 '명명덕(明明德)'은 정치가의 덕성, 곧 정치가의 자질[明德]을 함양하는 것[明]'을 의미한다. '신민(新民)'은 '정치가의 내실 있는 행정의 결과로 백성들을 혁신 혹은 개신시킨다'는 의미이다. '지어지선(止於至善)'은 '명명덕과 신민의 결과 최고선의 경지에 도달하고 이를 유지하려는 노력'을 의미한다. 이 삼강령은 다시 팔조목의 실천과정으로 세분화된다. 명명덕(明明德)은 '격물(格物)→치지(致知)→성의(誠意)→정심(正心)→수신(修身)'의 5단계 '수기(修己)' 과정으로, '신민(新民)'은 '제가(齊家)→치국(治國)→평천하(平天下)'의 3단계 '치인(治人)' 과정으로 세분화되어 그 실천방법이 제시되었다. 그리고 이 양자의 균형적 조화가 실천되는 그 지점, 곧 수기치인(修己治人)의 지점이 바로 지어지선(止於至善)의 지점이기도 하다. 모든 도덕적 인간이 정치를 하는 것은 아니지만 정치가라면 반드시 도덕적이어야 한다. 그리고 이를 역설한 것이 『대학』이다.

• 한국항만학회지
• /
• 제15권1호
• /
• pp.87-97
• /
• 2001

The calculation of earthwork plays a major role in plan or design of many civil engineering projects, and thus it has become very important to advanced the accuracy of earthwork calculation. Current method used for estimating the volume of pit excavation assumes that the ground profile between the grid points is linear(trapezoidal rule), or nonlinear(simpson's formulas). In this paper the spot height method, least square method, and chamber formulas, Chen and Lin method are compared with the volumes of the pits in these examples. As a result of this study, algorithm of chen and Lin me쇙 by spline method should provide a better accuracy than the spot height method, least square method, chamber formulas. The Chen and Lin formulas can be used for estimating the excavation volume of a pit divide into a grid with unequal intervals. From the characteristics of the cubic spline polynomial, the modeling curve of the Chen and Lin method is smooth and matches the ground profile well. Generally speaking, the nonlinear profile formulas provide better accuracy than the linear profile formulas. The mathematical model mentioned make an offer maximum accuracy in estimating the volume of a pit excavation.

• 한국융합학회논문지
• /
• 제10권2호
• /
• pp.217-225
• /
• 2019

대표적인 종단자료 분석방법인 잠재성장모형(Latent Growth Modeling)은 무조건적 모형과 조건적 모형으로 구분한다. 잠재성장모형의 무조건적 모형 성장궤적은 선형으로 가정하여 분석하는 경우가 많다. 본 연구는 선형 성장궤적으로 가정하여 모형 적합도가 미달하는 경우 연관규칙기법을 이용하여 모형 적합도를 제고하는 방법론을 제안한다. 방법론은 연관규칙 마이닝의 순차패턴(Sequential Pattern)을 사용한다. 이를 위하여 종단자료를 분위별로 나누고, 각 분위에 속한 종단자료의 기간 변화를 산출한 뒤 이를 순차 패턴 화하였다. SPSS AMOS를 이용하여 한국고용정보원의 2001년부터 6년간 조사한 청년 패널 자료로 효과성을 검증하였다. 기존 단순선형함수를 가정할 때와 비교하여 모형 적합도가 상승하는 것을 확인할 수 있었다.

• 한국경영과학회지
• /
• 제18권3호
• /
• pp.79-100
• /
• 1993

This paper proposes an idea of reverse modeling that analyzes LP models and then converts them into an object-oriented model repository. The process of reverse modeling consists of (1) identifying and analyzing source models by meta processor, (2) model decomposition and generalization to scan the models and divide them into model components, and (3) deriving model selection rules from the components by rule generator. Through the process, we can extract reusable model components and build a model base with model selectioon rules. Examples with models created by SML and MODLER modeling languages are given to illustrate the methods. The model base management capabilities provided by reverse modeling can increase the reusabioity of current modeling tools.