• Management Science and Financial Engineering
• /
• 제6권2호
• /
• pp.29-45
• /
• 2000

We consider the design of a two-level telecommunication network having logical full-mesh/star topology, with the implementation of conduit systems taken together. The design problem is then viewed as consisting of three subproblems: locating hub facilities, placing a conduit network, and installing cables therein to configure the logical full-mesh/star network. Without partitioning into subproblems as done in the conventional approach, the whole problem is directly dealt with in a single integrated framework, inspired by some recent successes with the approach. We successfully formulate the problem as a variant of the classical multicommodity flow model for the fixed charge network design problem, aided by network augmentation, judicious commodity definition, and some flow restrictions. With our optimal model, we solve some randomly generated sample problems by using CPLEX MIP program. From the computational experiments, it seems that our model can be applied to the practical problem effectively.

• 경영과학
• /
• 제14권1호
• /
• pp.87-105
• /
• 1997

There have been lots of research on temporal data management for the past two decades. Most of them are based on some logical data model, especially on the relational data model, although there are some conceptual data models which are independent of logical data models. Also, many properties or issues regarding temporal data models and temporal query languages have been studied. But some of them were shown to be incompatible, which means there could not be a complete temporal data model, satisfying all the desired properties at the same time. Many modeling issues discussed in the papers, do not have to be done so, if they take object-oriented data model as a base model. Therefore, this paper proposes a temporal data model, which is based on the object-oriented data model, mainly discussing the most essential issues that are common to many temporal data models. Our new temporal data model and query language will be illustrated with a small database, created by a set of sample transaction.

• 한국정보과학회논문지:데이타베이스
• /
• 제30권3호
• /
• pp.237-251
• /
• 2003

이 논문에서는 비디오 데이타의 논리적 구조와 의미적 내용을 효과적으로 검색하기 위한 비디오 검색 시스템을 제안한다. 제안하는 검색 시스템은 비정형화된 비디오 데이타를 원시 데이타 계층, 내용 계층 그리고 키프레임 계층의 세 계층으로 구성하는 계층화된 모델링을 사용한다. 계층화된 모델링에 존재하는 내용 계층은 비디오 데이타에 대한 논리적인 계층 구조와 의미적 내용을 표현한다. 제안하는 검색 시스템은 모델링에 따라 텍스트 기반의 검색은 물론 시각적인 특징 기반의 유사도 검색을 지원한다. 또한 시공간 관계에 기반한 의미적 내용 검색과 유사도 검색을 지원한다.

• 정보관리학회지
• /
• 제18권3호
• /
• pp.219-238
• /
• 2001

최근 들어 전자상거래의 개념이 기업뿐만 아니라 모든 유형의 조직체로 확산되어 가면서 전통적인 업무처리방식에서 전자적 업무 처리를 향한 변화를 통해 기업이나 조직체는 새로운 가치를 창출하면서 시장을 확대하는 기회로 이용하고 있다. 본 논문은 이러한 전자상거래의 개념을 디지털 도서관에 적용하여 도서관과 비즈니스 패러다임의 변화에 대한 이해를 바탕으로 도서관 업무와 전자상거래가 연계되는 몇 가지 모델을 제안하였다. 그리고 이중 전자상거래 개념을 자료 구입 과정에 적용시킴으로써 자료 구입 과정에 참여하는 모든 기관을 하나의 마켓플레이스로 통합하고 거래 행위가 이루어지도록 하는 eMarketplace를 구축 논리모델을 상세히 제시하였다.

• 응용통계연구
• /
• 제18권2호
• /
• pp.445-452
• /
• 2005

본 논문을 통하여 경주 안압지에서 출토된 통일신라시대의 14면 주사위인 '목제주령구'의 모사품(8개의 육각면과 6개의 정사각면으로 이루어져 있는 14면 주사위)을 굴리는 경우와 던지는 경우로 나누어 시행한 후 구한 빈도적 확률의 결과를 8개의 삼각면과 6개의 정사각면으로 이루어져 있는 14면 주사위에 대한 연구인 허명회(1994)와 채경철과 이충석(1995)의 연구 결과와 비교하고자 한다.

• 한국시뮬레이션학회논문지
• /
• 제4권2호
• /
• pp.31-40
• /
• 1995

A hybrid simulation model consists of real physical entities as well as simulated ones. It also contains logical processes for decision making for each operation units, a group of the entities. During the execution of such simulations, the physical and the logical processes consume real clock time while the activity durations of the simulated ones are generated. Due to the inherent chracteristics of the subjects of the communication channels. Since one can not undo an real event already taken place, the traditional central clock approach is used for the synchronization of the events(Kim[6]). However, there are still chances of causality errors due to the randomness in the communication delays. This error is not found in the distributed pure simulations. This paper explains the error in details and proposes a prevention scheme that is simple to implement.

• 한국경영과학회지
• /
• 제14권1호
• /
• pp.87-87
• /
• 1989

There have been lots of research on temporal data management for the past two decades. Most of them are based on some logical data model, especially on the relational data model, although there are some conceptual data models which are independent of logical data models. Also, many properties or issues regarding temporal data models and temporal query languages have been studied. But some of them were shown to be incompatible, which means there could not be a complete temporal data model, satisfying all the desired properties at the same time. Many modeling issues discussed in the papers, do not have to be done so, if they take object-oriented data model as a base model. Therefore, this paper proposes a temporal data model, which is based on the object-oriented data model, mainly discussing the most essential issues that are common to many temporal data models. Our new temporal data model and query language will be illustrated with a small database, created by a set of sample transaction.

• 전자공학회논문지B
• /
• 제28B권7호
• /
• pp.520-534
• /
• 1991

This paper describes the design of an ALU and a shifter for RISC. The RISC datapath is designed to have a 4-stage pipeline and a 20 MHz operating frequency. The ALU makes use of the 32-bit BLC adder which has the characteristics of high speed ane regular structuer and executes the arithmetic instructions-addition and subtraction- and the logical instructions-AND, OR, and XOR. Additionally, multiplication is possible by iterative executions of step instructions to perform shift and add operations. The shifter is implemented by using the modified of funnel shifter. The shifter is able to perform the arithmetic andlogical shift instructions without maskiog. Moreover, it carries out data align operation which conforms to big endian byte address. The logical operation of the desinged ALU and the shifter were simulated using YSLOG and VLSIsim. SPICE simulation results using 1.2um double metal process parameters show that the ALU and shifter have a delay time of 15.9NS and 9.9NS, respectively. Therefore, the ALU and the shifter operates correctly above 20[ MHz ] click ferquency and are composed of about 7K and 15K teansistors, respectively.

• 논리연구
• /
• 제9권2호
• /
• pp.99-116
• /
• 2006

There has been several proposals to resolve the gentle murder paradox; Forrester claims that the paradox shows that the deontic closure principle should be abandoned, while Sinnott-Armstrong claims that the paradoxical result arises from the scope ambiguity. However, I shall argue, the gentle murder paradox hinges on the logical structure of adverbial expressions. Although Davidson shows an insightful way of understanding logical structure of adverbs, there has been misunderstandings concerning the nature of his account. Especially what is called neo-Davidsonian event semantics is based upon combination of two fundamentally conflicting ideas. I shall propose a new way of understanding Davidson's account, on the basis of which I continue to give a new diagnosis of the gentle murder paradox.

• 한국통신학회논문지
• /
• 제28권6B호
• /
• pp.523-532
• /
• 2003

GENMET(GEneralized Multihop Network) which is based on Wavelength-Division Multiplexsing(WDM) and can be used in order to construct the next generation lightwave network is a logical(virtual), packet-switched and multihop topology network. GENMET is a regular multihop network which is a generalization of Shuffle network and do Bruijn network As such, it has the advantage of simple routing which is critical in a high speed network Given a physical topology, different logical topologies can be derived for assigning wavelengths to the UserNodes. By appropriately assigning wavelengths, performance of the network, such as mean hop count, maximum throughput and mean packet delay can be improved. In this paper, we propose heuristic algorithms for effectively assigning a limited number of wavelengths to the given UserNodes. The Performance of proposed algorithm is compared with the random assignment and the lower bounds.