• 한국경영과학회지
• /
• 제23권2호
• /
• pp.29-46
• /
• 1998

In this paper, we develop detailed algorithms for implementing the so-called Limited Column Generation procedure for Local Access Telecommunication Network(LATN) design problem. We formulate the problem into a tree-partitioning problem with an exponential number of variables. Its linear programming relaxation has all integral vertices, and can be solved by the Limited Column Generation procedure in just n pivots, where n is the number of nodes in the network. Prior to each pivot. an entering variable is selected by detecting the Locally Most Violated(LMV) reduced cost, which can be obtained by solving a subproblem in pseudo-polynomial time. A critical step in the Limited Column Generation is to find all the LMV reduced costs. As dual variables are updated at each pivot, the reduced costs have to be computed in an on-line fashion. An efficient implementation is developed to execute such a task so that the LATN design problem can be solved in O(n$^2$H), where H is the maximum concentrator capacity. Our computational experiments indicate that our algorithm delivers an outstanding performance. For instance, the LATN design problem with n＝150 and H＝1000 can be solved in approximately 67 seconds on a SUN SPARC 1000 workstation.

• Journal of Advanced Marine Engineering and Technology
• /
• 제39권2호
• /
• pp.172-178
• /
• 2015

Constructing a bilingual multi-word lexicon is confronted with many difficulties such as an absence of a commonly accepted gold-standard dataset. Besides, in fact, there is no everybody's definition of what a multi-word unit is. In considering these problems, this paper evaluates and analyzes the context vector approach which is one of a novel alignment method of constructing bilingual lexicons from parallel corpora, by comparing with one of general methods. The approach builds context vectors for both source and target single-word units from two parallel corpora. To adapt the approach to multi-word units, we identify all multi-word candidates (namely noun phrases in this work) first, and then concatenate them into single-word units. As a result, therefore, we can use the context vector approach to satisfy our need for multi-word units. In our experimental results, the context vector approach has shown stronger performance over the other approach. The contribution of the paper is analyzing the various types of errors for the experimental results. For the future works, we will study the similarity measure that not only covers a multi-word unit itself but also covers its constituents.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1995년도 춘계공동학술대회논문집; 전남대학교; 28-29 Apr. 1995
• /
• pp.54-68
• /
• 1995

In this paper, we develop detailed algorithms for implementing the so-called Limited Column Generation procedure for Local Access Telecommunication Network (LATN) Design problem. We formulate the problem into a tree-partitioning problem with an exponential number of variables. Its linear programming relaxation has all integral vertices, and can be solved by the Limited Column. Generation procedure in just n pivots, where n is the number of nodes in the network. Prior to each pivot, an entering variable is selected by detecting the Locally Most Violated (LMV) reduced cost, which can be obtained by solving a subproblem in pseudo-polynomial time. A critical step in the Limited Column Generation is to find all the LMV reduced costs. As dual variables are updated at each pivot, the reduced costs have to be computed in an on-line fashion. An efficient implementation is developed to execute such a task so that the LATN Design problem can be solved in O(n$^{2}$H), where H is the maximum concentrator capacity. Our computational experiments indicate that our algorithm delivers an outstanding performance. For instance, the LATN Design problem with n = 150 and H = 1000 can be solved in approximately 67 seconds on a SUN SPARC 1000 workstation.

• 한국경영과학회지
• /
• 제41권4호
• /
• pp.113-128
• /
• 2016

This paper proposes a Bi-level Genetic Algorithm for the Fixed Charge Transportation Problem with Non-linear Unit Cost. The problem has the property of mixed integer program with non-linear objective function and linear constraints. The bi-level procedure consists of the upper-GA and the lower-GA. While the upper-GA optimize the connectivity between each supply and demand pair, the lower-GA optimize the amount of transportation between the pairs set to be connected by the upper-GA. In the upper-GA, the feasibility of the connectivity are verified, and if a connectivity is not feasible, it is modified so as to be feasible. In the lower-GA, a simple method is used to obtain a pivot feasible solution under the restriction of the connectivity determined by the upper-GA. The obtained pivot feasible solution is utilized to generate the initial generation of chromosomes. The computational experiment is performed on the selected problems with several non-linear objective functions. The performance of the proposed procedure is analyzed with the result of experiment.

• 대한정형외과스포츠의학회지
• /
• 제2권1호
• /
• pp.6-14
• /
• 2003

전방십자인대재건술의목표는안정된관절과 pivot shift 현상을 제거하고, 반월상 연골을 보호하고, 관절운동범위를 유지하고, 술후슬개-대퇴관절의문제를최소화하도록재활하여수상전의운동수준으로복귀시키는것이다. 그래서전방십자인대 재건술은급성기에수술은피하고, 수술 전에재활치료를통하여관절운동범위와 대퇴사두고근의근력을얻은다음, 환자가육체적으로나정신적으로준비가될때까지수술을연기한다. 수술후재활치료는슬관절의완전신전과closed kinetic chain 운동을강조하며, 수술후정기적인방문으로재활치료를지도해주고장기추시해야하는것이중요하다.

• 한국공간구조학회논문집
• /
• 제20권3호
• /
• pp.81-89
• /
• 2020

As the damage caused by earthquakes gradually increases, seismic retrofitting for existing public facilities has been implemented in Korea. Several types of structural analysis methods can be used to evaluate the seismic performance of structures. Among them, for nonlinear dynamic analysis, the hysteresis model must be carefully applied because it can significantly affect the behavior. In order to find a hysteresis model that predicts rational behavior, this study compared the experimental results and analysis results of the existing non-seismic reinforced concrete frames. For energy dissipation, the results were close to the experimental values in the order of Pivot, Concrete, Degrading, and Takeda models. The Concrete model underestimated the energy dissipation due to excessive pinching. In contrast, the other ones except the Pivot model showed the opposite results with relatively little pinching. In the load-displacement curves, the experimental and analysis results tended to be more similar when the column axial force was applied to columns.

• Korean Journal of Acupuncture
• /
• 제32권4호
• /
• pp.190-198
• /
• 2015

Objectives : Through comparison between Mawangdui Silk Manuscripts and Huangdi's Internal Classic, this study aimed to put an emphasis on clinical significance of Yin-yang theory in Meridians. Methods : We investigated the documents recorded in Yin Yang Shi Yi Mai Jiu Jing, Zu Bi Shi Yi Mai Jiu Jing and Miraculous Pivot to compare of the character of meridian names. Results : In the naming of meridians, three yin and three yang were accepted earlier than Viscera and Bowels. Three yin and three yang play important role in relation with division of a human body. Conclusions : It is necessary to focus on the importance of Yin-yang theory in meridian system.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2008년도 한국컴퓨터종합학술대회논문집 Vol.35 No.1 (C)
• /
• pp.21-25
• /
• 2008

온라인 분석 처리(On-Line Analytical Processing: OLAP)은 데이터 웨어하우스로부터 다차원 데이터를 분석하거나 의사 결정을 위한 유용한 정보를 제공하고 있다. 데이터 분석을 위해, OLAP에서는 다차원 데이터를 표현한 스프레드시트(spreadsheet) 또는 피벗 테이블(PIVOT table)을 널리 사용하고 있다. 스프레드시트와 피벗 테이블은 서로 유사한 형태로써 분석의 기준이 되는 애트리뷰트들이 많은 구조이다. 사용자들은 흔히 사용되고 있는 SQL 구문을 이용하여 스프레드시트 또는 피벗 테이블에서 손쉬운 데이터 분석을 요구한다. 그러나, RDBMS에서 제공하는 SQL 구문의 사용으로, 이는 다차원 데이터를 효과적으로 분석할 수 없다. 그 이유는 SQL 구문이 다양한 데이터 분석의 목적으로 사용되거나, 요약된 집계 정보를 도출하는 데 한계가 있기 때문이다. 따라서, 본 연구에서는 SQL 구문을 확장하여 다차원 데이터를 표현한 스프레드시트를 손쉽게 조작하고, 요약된 집계를 계산하는 셀(cell) 구문을 제안한다. 이 방법은 스프레드시트와 피벗 테이블에서 행과 열이 교차하는 좌표(coordinate)를 이용하여, 특정 셀의 조작 및 선택한 부분/전체 영역에 대한 집계 정보를 계산하는 방법이다. 결과적으로, RDBMS에서 사용되는 SQL 구문이 친숙한 사용자들이 제안한 셀 구문을 이용하면, 다양한 관점에 따라 손쉽게 스프레드시트와 피벗 테이블을 다룰 수 있을 것으로 사료된다.

• 한국경영과학회지
• /
• 제27권2호
• /
• pp.153-171
• /
• 2002

In this paper, we present an efficient pricing strategy, the pivot and probe Algorithm for Network Flow Problems(PAPANET), specifically for solving capacitated, linear network flow problem (NPs). The PAPANET begins with an initial relaxed network problem(RNP), consisting of all the nodes and initial candidate arcs(possibly a few least cost arcs form the original problem and a set of all the artificial and slack arcs). After an initial solution to the RNP is derived by pivoting, the PROBE procedure identifies a set of most violated arcs from the noncandidate arcs that are not considered to be in the current RNP, and adds them to the RNP. The procedure also discards a set of least favorable, zero flow, nonbasic arcs from the RNP. The new RNP is solved to optimality and the procedure continues until all of the dual constraints of the noncandidate arcs are satisfied by the dual solution to the RNP. The PAPANET effectively reduces the problem size, time per pivot, and solution CPU time by eliminating noncandidate arcs. Computational tests on randomly generated problems indicate that PAPANET achieves and average savings of 50-80% of the solution CPU time of that of a comparable standard network simplex implementation.

• Clinics in Shoulder and Elbow
• /
• 제4권2호
• /
• pp.191-195
• /
• 2001

재발성 주관절 후외방성 회전 불안정성은 주관절의 아탈구, 탈구 또는 골절 등 외상, 수술 또는 외반주 변형이후 과부하등으로 인해 외측 척측 측부 인대 손상의 결과로서 발생하고, 주관절 pivot shift 검사는 주란절에 외반력, 종축 압박력과 회외전 모멘트로 후외방 아탈구를 유발하는 검사로서 주관절 후외방성 불안정성에 있어 가장 예민한 검사로 알려져 있다.