• 한국산학기술학회:학술대회논문집
• /
• 한국산학기술학회 2012년도 춘계학술논문집 2부
• /
• pp.817-819
• /
• 2012

This paper propose an interested digital rights protection scheme to address problems facing contemporary DRM approached : static digital rights management, and limited application to on-line environment. We introduce a dynamic mission control technology to realize dynamic digital rights management. And we incorporate license agent to on- and off-line monitoring and tracking. The proposed system prevent illegal access and use by using PKI security method, real time action monitoring for user, data security for itself.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제6권2호
• /
• pp.127-137
• /
• 2006

This paper presents an $H_{\infty}$ controller synthesis method for discrete time fuzzy dynamic systems based on a piecewise smooth Lyapunov function. The basic idea of the proposed approach is to construct controllers for the fuzzy dynamic systems in such a way that a Piecewise smooth Lyapunov function can be used to establish the global stability with $H_{\infty}$ performance of the resulting closed loop fuzzy control systems. It is shown that the control laws can be obtained by solving a set of Bilinear Matrix Inequalities (BMIs). An example is given to illustrate the application of the proposed method.

• 한국통신학회논문지
• /
• 제29권2B호
• /
• pp.263-271
• /
• 2004

본 논문에서는 perVC-Queuing 기반의 버퍼관리알고리즘을 제안한다. 제안된 알고리즘은 서비스 율 측정과 동적 VC 임계치를 사용하여 GFR VC에 네트워크 자원을 공정하게 분배하고 모든 VC가 요구하는 MCR을 보장한다. 컴퓨터 시뮬레이션결과 제안된 알고리즘이 GFR 서비스 클래스가 요구하는 QoS를 보장하고 TCP의 성능을 향상하였다.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1996년도 추계학술대회발표논문집; 고려대학교, 서울; 26 Oct. 1996
• /
• pp.275-278
• /
• 1996

We propose dynamic file allocation method in distributed database management system with changing access patterns. There are a lot of studies on file allocation problem in D-DBMS, and those studies deal with off-line analysis and optimization. Those works are well for systems with static database access patterns, but are inadequate for systems that have changing access patterns. In these systems, dynamic file allocation along with access pattern is more proper. In advance, Brunstrom et al. studied on this area, but they dealt a extremely simplified model. So, we make more practical models to simulate real system. In these models, many factors that were disregard in the advance study are considered. These models are composed with the non-replication system and the replication system. In addition to, we deal with CPU workload balancing in such system in order to improve performance of systems. Our methodology is very simple and realistic, therefore we think that it will give a lot of improvement in D-DBMS with changing access pattern.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1996년도 추계학술대회발표논문집; 고려대학교, 서울; 26 Oct. 1996
• /
• pp.49-52
• /
• 1996

In this article, we develop a 'dynamic' approach to manufacturing improvement, based on perspectives of manufacturing learning and decision theory. First, we present an alternative definition of production system consistent with a decision-theoretic perspective: the system consists of structural, infra-structural, and decision making constructs. A primary proposition is that learning capability possessed by a manufacturing system be prerequisite for the system to improve its manufacturing performance through optimal controlling of the three constructs. To support the proposition, we elaborate on a mathematical representation of "learning" as defined in an applied setting. We show how the learning capability acts as an integrating force ameliorating the trade-off between two key manufacturing capabilities, i.e., process controllability and process flexibility.exibility.

• 디지털산업정보학회논문지
• /
• 제8권2호
• /
• pp.81-94
• /
• 2012

This paper suggests PARED algorithm, a modified RED algorithm, that actively reacts to dynamic changes in network to apply packet drop probability flexibly. The main idea of PARED algorithm is that it compares the target queue length to the average queue length which is the criterion of changes in packet drop probability and feeds the gap into packet drop probability. That is, when the difference between the average queue length and the target queue length is great, it reflects as much as the difference in packet drop probability, and reflects little when the difference is little. By doing so, packet drop probability could be actively controled and effectively dealt with in the network traffic situation. To evaluate the performance of the suggested algorithm, we conducted simulations by changing network traffic into a dynamic stat. At the experiments, the suggested algorithm was compared to the existing RED one and then to ARED one that provided the basic idea for this algorithm. The results proved that the suggested PARED algorithm is superior to the existing algorithms.

• 경영과학
• /
• 제26권1호
• /
• pp.127-136
• /
• 2009

This paper purposes analyzing how task assignments influence on business process efficiency, and improving business process efficiency in Business Process Management (BPM) environments. For this purpose, task assignment is categorized into dynamic assignment and static assignment. Dynamic assignment binds a user to a task at process run-time, whereas static assignments assigns a task to a user at process build-time. So far, the influence of task assignment methods has not been studied. We, in this paper, analyze the business process efficiency using two different assigning rule, in terms of cycle time as a efficiency measure. The comparison result can provide a guideline for a company who wants to employ commercial BPM systems.

• 한국산학기술학회:학술대회논문집
• /
• 한국산학기술학회 2011년도 춘계학술논문집 1부
• /
• pp.366-370
• /
• 2011

This paper propose an interested digital rights protection scheme using license agent to address problems facing contemporary DRM approached : static digital rights management, and limited application to on-line environment. We introduce a dynamic mission control technology to realize dynamic digital rights management. And we incorporate license agent to on- and off-line monitoring and tracking. The proposed system prevent illegal access and use by using PKI security method, real time action monitoring for user, data security for itself.

• 한국화재소방학회논문지
• /
• 제14권4호
• /
• pp.23-28
• /
• 2000

반도체 공장의 제연설계를 위한 성능기준 설계를 분석하였다. 사례분석을 통하여 제연 설계 시스템의 성능평가 기준을 설정하고 최적의 배연 방법을 분석하기 위한 FDS 화재모델링을 수행하였다. 제연 설계 지침이나 관련 법규 또는 표준화된 기준이 부족한 한국과 미국의 현실에서 본 연구의 성능기준 설계 방법은 반도체공장의 제연 설계를 위한 현실적인 적용과 활용이 기대된다.

• 한국경영과학회지
• /
• 제26권3호
• /
• pp.105-117
• /
• 2001

This paper models supply uncertainty in the dynamic Newsboy problem context. The system consists of one supplier and one retailer who places an order to the supplier every period to meet stochastic demand. Supply uncertainty is modeled as the uncertainty in quantities delivered by the supplier. That is, the supplier delivers exactly the amount ordered by the retailer with probability of $\beta$ and the amount minus K with probability of (1-$\beta$). We formulate the problem as a dynamic programming problem and prove that retailer’s optimal replenishment policy is a stationary base-stock policy. Through a numerical study, we found that the cost increase due to supply uncertainty is significant and that the costs increase more rapidly as supply uncertainty increases. We also identified the effects of various system parameters. One of the interesting results is that as retailer’s demand uncertainty, the other uncertainty in our model, increases, the cost increase due to supply uncertainty becomes less significant.