• 산업경영시스템학회지
• /
• 제45권3호
• /
• pp.57-65
• /
• 2022

DEA(data envelopment analysis) is a technique for evaluation of relative efficiency of decision making units (DMUs) that have multiple input and output. A DEA model measures the efficiency of a DMU by the relative position of the DMU's input and output in the production possibility set defined by the input and output of the DMUs being compared. In this paper, we proposed several DEA models measuring the multi-period efficiency of a DMU. First, we defined the input and output data that make a production possibility set as the spanning set. We proposed several spanning sets containing input and output of entire periods for measuring the multi-period efficiency of a DMU. We defined the production possibility sets with the proposed spanning sets and gave DEA models under the production possibility sets. Some models measure the efficiency score of each period of a DMU and others measure the integrated efficiency score of the DMU over the entire period. For the test, we applied the models to the sample data set from a long term university student training project. The results show that the suggested models may have the better discrimination power than CCR based results while the ranking of DMUs is not different.

• 대한수학회지
• /
• 제45권4호
• /
• pp.1043-1056
• /
• 2008

The spanning column rank of an $m{\times}n$ matrix A over a semiring is the minimal number of columns that span all columns of A. We characterize linear operators that preserve the sets of matrix ordered pairs which satisfy multiplicative properties with respect to spanning column rank of matrices over semirings.

• 대한수학회지
• /
• 제45권2호
• /
• pp.301-312
• /
• 2008

The spanning column rank of an $m{\times}n$ matrix A over a semiring is the minimal number of columns that span all columns of A. We characterize linear operators that preserve the sets of matrix pairs which satisfy additive properties with respect to spanning column rank of matrices over semirings.

• 대한수학회보
• /
• 제41권3호
• /
• pp.427-434
• /
• 2004

The purpose of the paper is to correct erroneous proofs of two theorems of Walters ([1]) about the pressure of continuous transformations.

• Journal of Electrical Engineering and information Science
• /
• 제1권2호
• /
• pp.146-146
• /
• 1996

Although knowledge discovery is increasingly important in databases, the discovered knowledge sets may not be effectively used for application domains. It is partly because knowledge discovery does not take user's interests into account, and too many knowledge sets are discovered to handle efficiently. We believe that user's interests are conveyed by a query and if a nested query is concerned it may include a user's thought process. This paper describes a novel concept for discovering knowledge sets based on query processing. Knowledge discovery process is performed by: extracting features from databases, spanning features to generate range features, and constituting a knowledge set. The contributions of this paper include the following: (1) not only simple queries but also nested queries are considered to discover knowledge sets regarding user's interests and user's thought process, (2) not only positive examples (answer to a query) but also negative examples are considered to discover knowledge sets regarding database abstraction and database exceptions, and (3) finally, the discovered knowledge sets are quantified.

• Journal of Electrical Engineering and information Science
• /
• 제1권2호
• /
• pp.145-156
• /
• 1996

Although knowledge discovery is increasingly important in databases, the discovered knowledge sets may not be effectively used for application domains. It is partly because knowledge discovery does not take user's interests into account, and too many knowledge sets are discovered to handle efficiently. We believe that user's interests are conveyed by a query and if a nested query is concerned it may include a user's thought process. This paper describes a novel concept for discovering knowledge sets based on query processing. Knowledge discovery process is performed by: extracting features from databases, spanning features to generate range features, and constituting a knowledge set. The contributions of this paper include the following: (1) not only simple queries but also nested queries are considered to discover knowledge sets regarding user's interests and user's thought process, (2) not only positive examples (answer to a query) but also negative examples are considered to discover knowledge sets regarding database abstraction and database exceptions, and (3) finally, the discovered knowledge sets are quantified.

• 한국항행학회논문지
• /
• 제21권5호
• /
• pp.472-478
• /
• 2017

본 논문에서는 네트워크 토폴로지 설계방법들(minimum spanning tree와 Dijkstra algorithm)을 사용하여 교통 격자 가로망을 최적화 하는 방안을 다루며, 최소신장트리(minimum spanning tree)에서 직진 교통신호등간의 연동들을 통해 출발지와 목적지간의 지연시간을 최소화 하는 것으로 교통격자 가로망을 최적화한다. 또한 컴퓨터 네트워크에서 사용되어지는 Dijkstra algorithm을 통해 구해진 경로에 따라 차량 운전자들이 그 경로를 준수한다고 가정한다면 격자망에서 교통신호등의 연동을 통해 최적화할 수 있음을 보여준다. 격자 가로망에서의 모의실험결과는 직진 교통신호등의 연동을 통해 망을 가로지는 지연시간을 최소화함을 보여준다.

• Tribology and Lubricants
• /
• 제36권6호
• /
• pp.324-331
• /
• 2020

Wedging in a frictional elastic system is defined if the state of stick exists after the external loading on the system is removed. This paper presents a method to determine the critical coefficient of wedging for an elastic frictional system by considering the separation state. Wedging is always possible if the coefficient of friction exceeds a critical value known as the critical wedging coefficient. This method requires two concepts: a necessary and sufficient condition for wedging, which can be interpreted as positive spanning sets of constraint vectors existing in the wedged system, and the minimal positive basis that enables a minimum wedging coefficient. The algorithm based on the positive spanning concept is repeatedly executed after eliminating nodes from the contact stiffness matrix, for which the separation states are impending. The simulation results show that once a node enters the separation state, it never returns to the contact state again and the critical wedging coefficient reduces during repeated algorithm execution. The benefit of this method is that the computation time permits handling models with large numbers of contact nodes. The algorithm can also numerically find the critical wedging coefficient, thereby contributing to fastening and assembly performance improvements in mechanical systems.

• 응용통계연구
• /
• 제22권2호
• /
• pp.415-424
• /
• 2009

비지도 학습 신경망모형의 한 종류인 자기조직도(self-organizing map: SOM)는 고차원 자료를 차원축소하고 저차원지도를 통해 유사한 개체를 군집화하는 방법이며 다양한 분야의 데이터에 적용되고 있다. 한편 최소생성나무(minimal spanning tree: MST)는 개체점들을 닫힌 루프 없이 가장 짧게 선분으로 연결하는 그래프 방법이다. 본 연구에서는 부노드 자기조직도에 최소생성나무를 적용하여 부노드 간 거리를 근사적으로 나타내는 자료 시각화 방법과 자기조직도의 최적 형태와 크기를 결정하기 위한 거리 측도를 제안하였다. 또한 피서의 붓꽃자료와 실제 유전자발현자료 및 모의생성 자료에 적용하여 이 방법의 유용성을 살펴보았다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2013년도 추계학술발표대회
• /
• pp.1367-1369
• /
• 2013

Applying Application-Level Multicast technology (ALM) to Distributed Interactive Applications (DIAs) becomes more and more popular. Especially for DIAs embedded priority that the sender forwards data to receivers due to their respective priorities. The priority-based directed minimum spanning tree (PST) algorithm was designed for these DIAs. However, the PST has no efficient priority selection and filtering mechanism. The system will consume a tremendous amount of resource for reconstructing distribution tree and becomes unstable and unscalable. In this paper, First, We propose a novel priority-based application level multicast algorithm: Predict-and-Quantize for Priority with directed minimum Spanning Tree (PQPST), which can efficiently predict efficient priorities for the receivers and quantize the predicted priorities to build the multicast distribution tree. Second, we propose Priority Discrepancy Heuristic Mechanism (PDHM), which sets different thresholds of priority discrepancy within the priority discrepancy interval to control the distribution tree construction can efficiently decrease the repeated distribution tree construction, and we get the best heuristic priority discrepancy interval by PQPST. According to the simulation results, the PQPST and PDHM can efficiently improve the performance of the PST algorithm.