• 제목/요약/키워드: information theoretic analysis

검색결과 94건 처리시간 0.027초

Business Process Evaluation and Case Study for Sequential Application of BPM

  • Song, Young-Woong;Lim, Hyung-Chul;Choi, Yoon-Ki
    • Journal of Construction Engineering and Project Management
    • /
    • 제2권2호
    • /
    • pp.36-44
    • /
    • 2012
  • Adoption and practical application of BPM yet remains at a theoretic and methodological level for many industrial sectors. As for construction industry, adapting BPM into enterprise resource across all business processes could cause problems due to rapid change in corporate operation systems. Furthermore, it is unable to predict potential risks of business process while BPM are being applied. Therefore, applying BPM model to core strategy and individual task seems more effective than applying BPM model to the entire enterprise resource planning. In this paper, we define BPM and suggest a BPM model by analyzing each business unit in order to evaluate each business unit which is included in the business process architecture based on quantitative standards. This paper also presents a sequential application plan for business process model. Finally, a case study is demonstrated for the application of BPM system, focusing on cost management business, which turned out to be a top priority in the aspect of efficiency and ease based on priority analysis.

비협조 동적게임이론을 이용한 경쟁적 전력시장의 발전기 보수계획 전략 분석 (An Improved Generation Maintenance Strategy Analysis in Competitive Electricity Markets Using Non-Cooperative Dynamic Game Theory)

  • 김진호;박종배;김발호
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제52권9호
    • /
    • pp.542-549
    • /
    • 2003
  • In this paper, a novel approach to generator maintenance scheduling strategy in competitive electricity markets based on non-cooperative dynamic game theory is presented. The main contribution of this study can be considered to develop a game-theoretic framework for analyzing strategic behaviors of generating companies (Gencos) from the standpoints of the generator maintenance-scheduling problem (GMP) game. To obtain the equilibrium solution for the GMP game, the GMP problem is formulated as a dynamic non-cooperative game with complete information. In the proposed game, the players correspond to the profit-maximizing individual Gencos, and the payoff of each player is defined as the profits from the energy market. The optimal maintenance schedule is defined by subgame perfect equilibrium of the game. Numerical results for two-Genco system by both proposed method and conventional one are used to demonstrate that 1) the proposed framework can be successfully applied in analyzing the strategic behaviors of each Genco in changed markets and 2) both methods show considerably different results in terms of market stability or system reliability. The result indicates that generator maintenance scheduling strategy is one of the crucial strategic decision-makings whereby Gencos can maximize their profits in a competitive market environment.

Sensor placement selection of SHM using tolerance domain and second order eigenvalue sensitivity

  • He, L.;Zhang, C.W.;Ou, J.P.
    • Smart Structures and Systems
    • /
    • 제2권2호
    • /
    • pp.189-208
    • /
    • 2006
  • Monitoring large-scale civil engineering structures such as offshore platforms and high-large buildings requires a large number of sensors of different types. Innovative sensor data information technologies are very extremely important for data transmission, storage and retrieval of large volume sensor data generated from large sensor networks. How to obtain the optimal sensor set and placement is more and more concerned by researchers in vibration-based SHM. In this paper, a method of determining the sensor location which aims to extract the dynamic parameter effectively is presented. The method selects the number and place of sensor being installed on or in structure by through the tolerance domain statistical inference algorithm combined with second order sensitivity technology. The method proposal first finds and determines the sub-set sensors from the theoretic measure point derived from analytical model by the statistical tolerance domain procedure under the principle of modal effective independence. The second step is to judge whether the sorted out measured point set has sensitive to the dynamic change of structure by utilizing second order characteristic value sensitivity analysis. A 76-high-building benchmark mode and an offshore platform structure sensor optimal selection are demonstrated and result shows that the method is available and feasible.

Resource Allocation in Spectrum Sharing ad-hoc Cognitive Radio Networks Based on Game Theory: An Overview

  • Abdul-Ghafoor, Omar B.;Ismail, Mahamod;Nordin, Rosdiadee;El-Saleh, Ayman Abd
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권12호
    • /
    • pp.2957-2986
    • /
    • 2013
  • The traditional approach of fixed spectrum allocation to licensed networks has resulted in spectrum underutilisation. Cognitive radio technology is envisioned as a promising solution that can be used to resolve the ineffectiveness of the fixed spectrum allocation policy by accessing the underutilised spectrum of existing technologies opportunistically. The implementation of cognitive radio networks (CRNs) faces distinct challenges due to the fact that two systems (i.e., cognitive radio (CR) and primary users (PUs)) with conflicting interests interact with each other. Specially, in self-organised systems such as ad-hoc CRNs (AHCRNs), the coordination of spectrum access introduces challenges to researchers due to rapid utilisation changes in the available spectrum, as well as the multi-hop nature of ad-hoc networks, which creates additional challenges in the analysis of resource allocation (e.g., power control, channel and rate allocation). Instead, game theory has been adopted as a powerful mathematical tool in analysing and modelling the interaction processes of AHCRNs. In this survey, we first review the most fundamental concepts and architectures of CRNs and AHCRNs. We then introduce the concepts of game theory, utility function, Nash equilibrium and pricing techniques. Finally, we survey the recent literature on the game theoretic analysis of AHCRNs, highlighting its applicability to the physical layer PHY, the MAC layer and the network layer.

광 베니언-형 교환 망에서의 누화를 회피하기 위한 교환소자를 달리하는 멀티캐스트 스케줄링(제1부):누화 관계의 그래프 이론적 분석 (Switching Element Disjoint Multicast Scheduling for Avoiding Crosstalk in Photonic Banyan-Type Switching Networks(Part I):Graph Theoretic Analysis of Crosstalk Relationship)

  • 차영환
    • 한국정보과학회논문지:정보통신
    • /
    • 제28권3호
    • /
    • pp.447-453
    • /
    • 2001
  • 본 논문에서는 방향성 커플러를 이용하여 구성한 광 베니언-형 교환 망에 있어 교환소자를 달리하는 멀티캐스팅의 스케줄링을 고려한다. 임의의 주어진 시각에 최대한 하나의 접속만이 각각의 교환소자를 점유하기 때문에 블록킹은 물론 누화가 발생하지 않도록 보장된다. 이러한 멀티캐스팅에서는 대개 수차례 걸친 라우팅이 수반되므로 라우팅 횟수를 최소한으로 하는 것이 바람직하다. 먼저 일-대-다 접속 능력을 제공하는 광 베니언-형 망에서 접속들이 동일한 교환소자를 경유하기 위한 필요충분 조건을 제시한다. 멀티캐스트 접속을 일정한 부분접속들로 분할 하는 규칙을 정의하고 부분접속들간의 누화 관계를 그래프로 표현한다. 최악의 경우의 누화를 분석하기 위해 그래프차수의 상한을 제시한다. 후속 논문(제2부)[14]에서는 스케줄링 알고리즘과 스케줄링 길이의 상한을 고찰하고 관련 연구결과와의 상세한 비교를 다룬다.

  • PDF

대역확산 워터마킹 시스템의 채널용량 분석 (Analysis of Channel Capacity for Spread Spectrum Watermarking Systems)

  • 김주찬;배정남;김진영
    • 한국통신학회논문지
    • /
    • 제35권5C호
    • /
    • pp.439-444
    • /
    • 2010
  • 본 논문에서는 대역확산 워터마킹 시스템을 무선채널 환경에서 부가데이터를 전송하기 위하여 적용할 경우 채널에 의한 영향을 분석하기 위하여 채널용량식을 정보이론적 관점에서 유도하고 분석한다. 부가데이터를 기존의 무선통신 시스템을 통하여 전송하기 위해서는 무선채널을 통과하는 워터마킹 신호가 채널에 의해서 어떻게 영향을 받고, 어느 정도의 데이터를 신뢰할 만한 수준으로 전송가능한지를 판단하는 기준으로서의 채널용량에 관한 연구가 필수적이다. 수치적 결과로부터 대역확산 워터마킹 시스템의 채널용량은 HWR, WNR, PN 길이 및 호스트 시스템의 샘플링 주파수에 의해 결정됨을 알 수 있었다. 또한 적용된 Nakagami-m 페이딩 채널과 Log-normal 새도잉 채널에서 채널 상태 변화에 따른 채널용량의 변화를 확인하였고 다이버시티를 적용했을 경우의 채널용량의 향상 또한 확인하였다. 본 논문에서 다룬 대역확산 워터마킹 시스템의 채널용량의 수식적 결과는 PN 시퀀스를 이용하는 일반적인 대역확산 워터마킹 시스템에 적용할 수 있다.

IP Spoofing 대응 기능을 가진 방화벽 시스템 구현

  • 최석윤;김중규
    • 한국산업정보학회:학술대회논문집
    • /
    • 한국산업정보학회 1997년도 춘계학술대회 발표논문집
    • /
    • pp.163-181
    • /
    • 1997
  • This dissertation provides a theroetic study on the network security in general , the firewall in particular . In fact, the firewall has been recognized as a very promising option to obtain the security in the real world network environment . The dissertation provides a thorough theoretic investigation on the various problems raised in the computer network, and also explores a methodology of the security against IP spoofing. Moreover, it investigates a systematic procedure to make analysis plans of the firewall configuration. Based on the above investigation and analysis , this dissertation provides two approaches to network security, which address a number of issues both at the network and at application level. At the network level. a new methdo is proposed which uses packet filtering based on the analysis of the counter plot about the screen router. On the other hand at the application level, a novel method is exlored which employs security software , Firewall-1, on Bastion host. To demonstrate the feasibility and the effectiveness of the proposed methodologes, a prototype implementation is made. The experiment result shows that the screen router employing the proposesed anti-IP spoofing method at the network level is effective enough for the system to remain secure without being invaded by any illegarl packets entering from external hackers. Meanwhile , at the application level. the proposed software approach employing Firewall -1 is proved to be robust enough to provent hackings from the outer point to point protocol connection. Theoretically, it is not possible to provide complete secuirty to the network system, because the network security involove a number of issues raised from low level network equipments form high level network protocol. The result in this dissertation provides a very promising solution to network security due to its high efficiency of the implementation and superb protectiveness from a variety of hacking.

러프 엔트로피를 이용한 범주형 데이터의 클러스터링 (lustering of Categorical Data using Rough Entropy)

  • 박인규
    • 한국인터넷방송통신학회논문지
    • /
    • 제13권5호
    • /
    • pp.183-188
    • /
    • 2013
  • 객체를 분류하기 위하여 유사한 특징을 기반으로 하는 다양한 클러스터해석은 데이터 마이닝에서 필수적이다. 그러나 많은 데이터베이스에 포함되어 있는 범주형 데이터의 경우에 기존의 분할접근방법은 객체간의 불확실성을 처리하는데 한계가 있다. 범주형 데이터의 분할과정에서 식별불가능에 의한 동치류의 불확실성에 대한 접근논리가 러프집합의 대수학적인 논리에만 국한되어서 알고리즘의 안정성과 효율성이 떨어지는 요인으로 작용하고 있다. 본 논문에서는 범주형 데이터에 존재하는 속성의 의존도를 고려하기 위하여 정보이론적인 척도를 기반으로 러프엔트로피를 정의하고 MMMR이라는 알고리즘을 제안하여 분할속성을 추출한다. 제안된 방법의 성능을 분석하고 비교하기 위하여 K-means, 퍼지에 의한 방법과 표준편차를 이용한 기존의 방법과 비교우위를 ZOO데이터에 국한하여 알아본다. ZOO데이터를 이용하여 기존의 범주형 알고리즘과의 비교우위를 살펴보고 제안된 알고리즘의 효율성을 검증한다.

도시내 범죄발생과 범죄 두려움 위치의 공간적 차이 분석 (Spatial Analysis of the Difference between Real Crime and Fear of Crime)

  • 허선영;문태헌
    • 한국지리정보학회지
    • /
    • 제14권4호
    • /
    • pp.194-207
    • /
    • 2011
  • 본 연구는 실제 범죄발생 장소와 범죄 두려움을 느끼는 장소를 비교하여 서로 일치하거나 다르게 나타나는 장소의 공간적 환경 특성을 분석함으로써 도시공간의 환경 개선을 통해 범죄예방의 가능성을 타진해 보고자 한다. 연구의 방법으로는 첫째, 범죄관련 사례연구와 이론적 고찰을 통해 연구의 내용적 범위와 방법을 정립하였다. 둘째, 방범은 경찰력만으로 대처하기 어려우므로 전 시민이 언제, 어디서나, 협력적으로 범죄예방에 참여할 수 있도록 온라인으로 작동하는 시민 참여형 방범시스템(Citizen Participation System for Crime Prevention, CPSCP)을 개발하였다. 셋째, CPSCP를 활용하여 시민이 공간상에서 범죄두려움을 느끼는 장소를 직접 표시하게 하여 지역 내 두려움을 느끼는 장소에 대한 데이터를 수집하였다. 넷째, 실제 범죄발생 장소와 범죄 두려움을 느끼는 장소를 중첩 분석하여 두 장소의 차이를 비교 분석하였다. 그 결과로 범죄를 예방하고 범죄에 대한 두려움을 해소하기 위해서는 도시공간의 물리적 환경을 개선하는 환경설계(environmental design)가 필요하다는 것을 알 수 있었다. 본 연구에서 개발한 CPSCP는 향후 시스템을 고도화 하여 U-City의 U-방범시스템으로 활용함으로써 시민이 자기 동네를 자주적으로 스마트 안전도시로 만들어 나가는데 크게 기여할 것이다.

오프라인 소매점의 모바일 할인 서비스에 대한 전략적 분석 (Game Theoretic Analysis of the Mobile Discount Service of the Offline Retailers)

  • 조형래;이민호
    • 산업경영시스템학회지
    • /
    • 제39권3호
    • /
    • pp.47-55
    • /
    • 2016
  • The proliferation of the Internet and related technologies has led to a new form of distribution channels, namely online retailers. The conventional offline and the new online retailers have different transaction costs perceived by the consumers in the following perspectives: the accessibility to the product information, the traffic cost and the opportunity cost for the time to visit the store, the delivery time and the possibility of 'touch and feel' to test the quality of the product. In particular, the online retailers have lower distribution cost structure in that they do not have physical stores, which results in lower selling price. Thus they continuously offer price competition against offline retailers using the lower selling cost as competitive weapon. Moreover the emergence of the social commerce is likely to intensify the competition between the online and offline retailers. To survive in this fierce competition, the offline retailers are trying to defend their business interests by sticking to offline transaction in anticipation of increased customer loyalty, customer's preference for 'touch and feel' style shopping, and others. Despite of these efforts, customers who touch and feel a product in an offline store but purchase the product through an online retailer are increasing. To protect such customers, recently, some of the offline retailers began to provide the mobile discount service (MDS) which enables the offline customers to purchase a product at a discounted price through the mobile applications. In business competitions, the price discount strategy is usually considered to secure more market share at the cost of lower profit. In this study, however, we analyze the effect of MDS as a weapon for securing more profit. To do this, we set up a game model between the online and offline retailers which incorporates the effect of the MDS. By numerically analyzing the Nash equilibrium of the game, some managerial implications for using the MDS for more profit are discussed.