• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1992년도 춘계공동학술대회 발표논문 및 초록집; 울산대학교, 울산; 01월 02일 May 1992
• /
• pp.267-277
• /
• 1992

본 논문은 다목적선형계획법을 위한 Decision Support System ASEOV-VIM을 소개하고 있다. ASEOV-VIM에는 1) efficient solution set전체에 대한 개괄과 search direction을 제새하는 ASEOV; 2) decision maker의 preference information을 도출해내는 VIM; 3) 위 두 부분간의 interface로 활용되는 Mediator등 3개의 하부시스템이 있다. ASEOV-VIM은 TURBO-C를 이용하여 personal computer에 구현되었다.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2000년도 춘계공동학술대회 논문집
• /
• pp.251-252
• /
• 2000

• 한국국방경영분석학회지
• /
• 제15권1호
• /
• pp.44-53
• /
• 1989

This paper concerns with the case of having a goal program with no preassigned deterministic ranking for the goals. The priority ranking in this case depends on the states of nature which are random variables. The Bayesian approach is performed to obtain the nondominated set of rankings.

• 한국국방경영분석학회지
• /
• 제15권2호
• /
• pp.56-77
• /
• 1989

A new concept, namely the error discrimination of a code defined as the capability to not only detect errors from two distinct error sets but also to distinguish between them has been introduced in [SAKA 89a]. Consider $E_+\;and\;E_-$ as the two distinct error sets, namely the positive error set and the negative error set respectively. If a code C is not only capable of detecting any error e in {$E_+,\;E_-$}, but also able to identify the error set to which e belongs then the code is said to be an $E_+\;&\;E_-$ error discriminating code. The error discriminating property enables construction of unidirectional error detecting/correcting codes using asymmetric error control code. We derive here theory for asymmetric t error correcting and d error detecting codes. Furthermore, unidirectional error control code construction methods are introduced using asymmetric error control codes and $E_+\;&\;E_-$ error discriminating codes.

• 한국경영과학회지
• /
• 제30권2호
• /
• pp.1-11
• /
• 2005

The network structures of a hyperlinked environment can be a rich source of information about the contents of the environment and it provides effective means for understanding it. Recently, there have been a number of algorithms proposed analyzing hypertext link structure so as to determine the best authorities for a given topic or query. In this paper, we review the algorithm of mutual reinforcement relationship for finding hubs and authorities from World Wide Web, and suggest SHA, a new approach for link-structure analysis, which uses the relationships among a set of relative authoritative pages, a set of hub pages, and a set of super hub pages.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2004년도 춘계공동학술대회 논문집
• /
• pp.734-737
• /
• 2004

When the margin level is set relatively low, margin violation probability increases and the default probability of the futures market rises. On the other hand, if the margin level is set high, the margin violation probability decreases, but the futures market becomes less attractive to hedgers as the investor's opportunity cost increases. In this paper, we investigate whether the movement of KOSPI200(Korea Composite Stock Price Index 200) futures daily prices can be modeled with the extreme value theory. Base on this investigation, we examine the validity of the margin level set by the extreme value theory. Computational results are presented to compare the extreme value distribution and the empirical distribution of margin violation in KOSPI200. Some observations and implications drawn from the computational experiment are also discussed.

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

This paper attempts to show how DEA(data envelopment analysis), a nonparametric productivity analysis method, can be employed for insurance companies to improve their respective efficiencies and competitiveness. Specifically, we measured relative technical efficiencies and returns to scale of 11 Korean property-liability insurance companies using BCC model, and raised several issues including the cause of inefficiency, benchmarking toward reference set and resource allocation concerning the insurance companies. Also, in order to monitor the variability of the research results over periods, we employed longitudinal analysis to see the moving patterns of technical efficiencies, returns to scale and frequencies included in the reference set of the individual insurance companies under consideration. The methodology and the results in this paper may also serve as a useful guideline for individual insurance companies to set their respective business strategies.

• 한국경영과학회지
• /
• 제33권2호
• /
• pp.17-26
• /
• 2008

The traveling salesman problem is to find tours through all cities at minimum cost ; simply visiting the cities only once that a salesman wants to visit. As such, the traveling salesman problem is a NP-complete problem ; an heuristic algorithm is preferred to an exact algorithm. In this paper, we suggest an effective cost relaxation using a candidate arc set which is obtained from a regression function for the traveling salesman problem. The proposed method sufficiently consider the characteristics of cost of arcs compared to existing methods that randomly choose the arcs for relaxation. For test beds, we used 31 instances over 100 cities existing from TSPLIB and randomly generated 100 instances from well-known instance generators. For almost every instances, the proposed method has found efficiently better solutions than the existing method.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제7권4호
• /
• pp.229-234
• /
• 2007

In this paper, we present an efficient instruction set architecture using vector register file hardware to accelerate operation of general matrix-vector operations in DSP microprocessor. The technique enables in-situ row-access as well as column access to the register files. It can reduce the number of memory access significantly. The technique is especially useful for block-based video signal processing kernels such as FFT/IFFT, DCT/IDCT, and two-dimensional filtering. We have applied the new instruction set architecture to in-loop deblocking filter processing in H.264 decoder. Performance comparisons show that the required load/store operations for the in-loop deblocking filter can be reduced about 42%. The architecture would improve the processing speed, and code density in DSP microprocessor especially for video signal processing substantially.

• Journal of Applied and Pure Mathematics
• /
• 제5권1_2호
• /
• pp.1-8
• /
• 2023

This study is on a Boolean B or Boolean lattice L in abstract algebra with closed binary operation *, complement and distributive properties. Both Binary operations and logic properties dominate this set. A lattice sheds light on binary operations and other algebraic structures. In particular, the construction of the elements of this L set from idempotent elements, our definition of k-order idempotent has led to the expanded definition of the definition of the lattice theory. In addition, a lattice offers clever solutions to vital problems in life with the concept of logic. The restriction on a lattice is clearly also limit such applications. The flexibility of logical theories adds even more vitality to practices. This is the main theme of the study. Therefore, the properties of the set elements resulting from the binary operation force the logic theory. According to the new definition given, some properties, lemmas and theorems of the lattice theory are examined. Examples of different situations are given.