• Journal of Korean Society of Transportation
• /
• v.31 no.2
• /
• pp.33-44
• /
• 2013

The land use-transportation models typically have complicated model structure that is good for empirical execution but bad for theoretical probe. This complexity makes it very difficult to derive the first-order conditions for system optimization in tractable forms. Yu and Rhee (2011) and Rhee (2012) show how to simplify the derivative of the model's objective function with respect to policy variables in the computable general equilibrium model of land use and transportation. However, the travel demand in their model was fixed. This drawback fundamentally limits the applicability of their methodology in the planning field. We relax this restriction. Once this is done, we can employ the methodology developed in analyzing the impacts of various types of policy instruments in the models where land market is treated endogenously and transportation network is embedded.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.685-696
• /
• 2004

Real-time multimedia applications that require large amount of bandwidth need resource reservation before starting service for providing the QoS(i.e., Quality of Service). To reserve resources in advance, each reservation request has to notify its expectation on the required amount of resources and service duration. Using this information, a resource manager can schedule advance reservations. However, most existing resource management systems are adopting straightforward call admission control process (i.e., only immediate reservation) by checking currently available resources without considering the service duration. Hence, the resource management system that supports advance reservation has to manage confliction caused by indefinite service duration of immediate reservation. Even though the separation of resource pool according to type of reservation can prevent the confliction, it causes low resource utilization. In this paper, we propose an effective resource management scheme that supports both immediate and advance reservations by sharing resources dynamically. Using network cost function, the proposed scheme determines and adaptively adjusts resource boundary according to the confliction rate by varying weight parameters. And also, we define user utility function to quantify user satisfaction based on how well the reserved resource is guaranteed during service time. Simulation results using NS-2 network simulator show that the proposed scheme can achieve better resource utilization with preferable QoS than other schemes like static resource partitioning.

• Journal of the Korea Computer Graphics Society
• /
• v.22 no.3
• /
• pp.21-29
• /
• 2016

Cell segmentation is an important but time-consuming and laborious task in biological image analysis. An automated, robust, and fast method is required to overcome such burdensome processes. These needs are, however, challenging due to various cell shapes, intensity, and incomplete boundaries. A precise cell segmentation will allow to making a pathological diagnosis of tissue samples. A vast body of literature exists on cell segmentation in microscopy images [1]. The majority of existing work is based on input images and predefined feature models only - for example, using a deformable model to extract edge boundaries in the image. Only a handful of recent methods employ data-driven approaches, such as supervised learning. In this paper, we propose a novel data-driven cell segmentation algorithm for bright-field microscopy images. The proposed method minimizes an energy formula defined by two dictionaries - one is for input images and the other is for their manual segmentation results - and a common sparse code, which aims to find the pixel-level classification by deploying the learned dictionaries on new images. In contrast to deformable models, we do not need to know a prior knowledge of objects. We also employed convolutional sparse coding and Alternating Direction of Multiplier Method (ADMM) for fast dictionary learning and energy minimization. Unlike an existing method [1], our method trains both dictionaries concurrently, and is implemented using the GPU device for faster performance.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.12
• /
• pp.3753-3761
• /
• 2000

There exist several versions of schema and instances created under different versions of the schema concurrently in the database in schema evolution environments. This paper proposes a mechanism for accessing instances regardless of versions in schema evolution environments in object relational databases. Access handling routines are used in accessing to the instances through the undefined attributes in the versions in which they were created. The change of semantic information of attributes is supported. Access handling routines are defined for each pair of semantics rather than defining backdate/update functions for each pair of versions of a class. A query language that accommodates version and semantic information is defined through the extension of the primitive SQL format.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.1
• /
• pp.45-54
• /
• 1995

Retest arises when attemptint to validate code modifications. This paper proposes a retest methodology which explicitly defines the amount of retesting to be performed for any given code change. In order to minimize the objective function, we use the set/use matrix through analysis of data dependence as well as the connectivity, reachability, and test case/reference matrix through program control flow analysis. The value of objective function will give the minimum number of test cases necessary to assure the proposed methodology, we develope the retesting tool for generating mininum test cases based on the function.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2002.11a
• /
• pp.621-624
• /
• 2002

최근 급속도로 발전하고 있는 생체인식 분야는 상업적인 활성화와 이에 따른 사용자의 신뢰성 확보를 위해 서로 다른 생체인식 제품들의 상호호환성과 상호연동성을 고려한 표준화된 생체인식 데이터 및 API에 대한 기술 개발을 하고 있으며, 이러한 생체 인식 기술의 표준화는 제품들의 호환성 측면에서 매우 중요하므로 생체 정보를 이용하는 모든 제품에 대하여 시스템과 소프트웨어에 대한 표준적합성 시험이 요구될 것이다. 이에 따라 본 연구에서는 생체인식시스템 응용 인터페이스 표준 규격인 BioAPI에 대하여 표준 적합성 시험도구를 개발하기 위하여 우선적으로 BioAPI 표준규격에서 명시하는 필수함수에 대한 표준적합성시험을 수행하였다.

• Proceedings of the KAIS Fall Conference
• /
• 2007.05a
• /
• pp.143-146
• /
• 2007

컴퓨터 네트워크에서 전송제어 프로토콜 상에서 다중시간 간격으로 혼잡제어의 지연을 피드백 루프의 시간간격을 조정하여 명시적 예측을 실행해 제어의 단점을 개선하는데 연구한다. 먼저 TCP의 모둘 형 확장에서 Tahoe, Reno, Vegas등 다양한 버전의 TCP에 적용되는 간단한 인터페이스를 통한 함수 호출을 정의하고, 이것이 성능을 크게 향상시는 것을 입증한다. 두 번째로, 광대역 WAN에서 지연-대역폭의 곱이 높을 경우 더욱 심각해지는 사후 제어의 불확실성 차이를 해소함으로써 MTS TCP가 기반 피드백 제어에 사전성을 부여한다는 것을 입증한다. 세번째는 트래픽 제어의 3가지 차원인, 즉 추적 능력, 연결 지속 기간, 공정성이 성능에 미치는 영향 등을 비교 분석하여 입증한다.

• Journal of the Korean Chemical Society
• /
• v.17 no.5
• /
• pp.324-331
• /
• 1973

We study a mixture of ideal gases by use of recently developed methods in continuum thermodynamics of irreversible processes. A complete form of the free energy function and the gas law for each component are derived directly from an entropy production inequality by assuming that: (1) Constitutive functions depend on the mass densities, the diffusion velocities, the temperature and its gradient only. (2) Phenomenological coefficients appearing in an extra entropy flux are material constants. (3) The internal energy density per unit mass is independent of the total mass density (Joule).

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.178-180
• /
• 2005

XML 문서의 검색을 위한 질의 언어인 XQuery는 다양한 데이터 소스로부터 가져온 고유한 구조를 가진 질의 결과로 구성할 수 있도록 설계되어 XML질의 언어의 표준이 되었다. 현재 XQuery는 반복문 등을 포함하는 과다한 검색기능을 지원하도록 함으로써 질의 표현이 상대적으로 복잡한 형태를 취한다. 따라서 일반적인 SQL처럼 XQuery에 명시적인 group by절을 도입한 질의 표현기법을 모색하여 XML데이터의 재구성과 집계함수 처리론 위한 그룹화를 보다 쉽게 구성할 수 있도록 하고자 하였다.

• Environmental and Resource Economics Review
• /
• v.23 no.3
• /
• pp.409-434
• /
• 2014

This paper estimates household demand for electricity using a micro-level household expenditure data set. A two-stage estimation method where the endogenous block price estimates are obtained from a discrete block choice model is used. This method successfully identifies a downward sloping conditional demand function with the data, while both the usual two-stage method with instrumental variable estimation and the Hewitt-Hanemann discrete-continuous model fail to do that. The paper simulates the impacts of two hypothetical pricing reforms that reduce the number of blocks and make the price gap smaller. It is shown that the reform may increase the overall consumer benefit, but is regressive.