• 제목/요약/키워드: Path Management

검색결과 1,713건 처리시간 0.027초

외식기업 브랜드 자산 구성 요인간의 관계 연구 (Relationships among Brand Equity Components)

  • 김영훈;조용범
    • 한국조리학회지
    • /
    • 제14권2호
    • /
    • pp.128-137
    • /
    • 2008
  • The importance of brand and brand equity has greatly increased not only in the professional perspectives but also in academic viewpoints. Especially, lots of related studies have been focused on the components of brand equity itself. However, this study concentrates on the relationships of brand equity components for understanding consumers' attitudes toward the brands of the food-service businesses. The basic research model consists of 4 brand equity components: brand awareness, perceived quality, brand image, and brand preference. Research data are gathered through survey questions responded by university students. For statistical analysis, correlation analysis, factor analysis, and covariance structure analysis are carried out. The result of this study are summed up as follows. Among the brand equity components, brand awareness had a great effect on perceived quality(path coefficient; 0.476). Brand image highly influenced brand preference(path coefficient; 0.439).

  • PDF

Essential Arcs of a Directed Acyclic Graph

  • Chung, Ee-Suk
    • Management Science and Financial Engineering
    • /
    • 제13권1호
    • /
    • pp.121-126
    • /
    • 2007
  • Among many graphs, directed acyclic graph(DAG) attracts many researchers due to its nice property of existence of topological sort. In some classic graph problems, it is known that, if we use the aforementioned property, then much efficient algorithms can be generated. So, in this paper, new algorithm for the all-pairs shortest path problem in a DAG is proposed. While the algorithm performing the iteration, it identifies the set of essential arcs which requires in a shortest path. So, the proposed algorithm has a running time of $O(m^*n+m)$, where m, n and $m^*$ denote the number of arcs, number of node, and the number of essential arcs in a DAG, respectively.

스프링클러 작동특성(作動特性)과 피난평가(避難評價)에 관한 실증적(實證的) 연구(硏究) (An Empirical Study on the Sprinkler Operational Characteristics and Escape Time Estimation)

  • 진복권
    • 대한안전경영과학회지
    • /
    • 제8권3호
    • /
    • pp.37-50
    • /
    • 2006
  • The trends in building construction these days are moving towards having better work spaces and greater suitability for the use of information technology. Therefore people can work in a more relaxed delightful and pleasant environment. Accident such as like fire could cause the mass destruction of human beings. This paper aims to evaluate the path of the spread of a fire and the suitability of fire fighting appliances for maximum egress time. General advanced phase of compartment. Aswell, we analyzed and verified the path of the flame in compartment fires. Also we conducted an analysis of the adaptation of sprinkler systems concerned with sprinkler RTI. Moreover those evaluation is made more earlier by the development and use of computer simulation program and rapid progress to apply PBFD (Performance Based Fire Design).

양방향 Filtered-x 최소 평균 제곱 알고리듬에 대한 해석 (Analysis of Bi-directional Filtered-x Least Mean Square Algorithm)

  • 권오상
    • 디지털산업정보학회논문지
    • /
    • 제10권4호
    • /
    • pp.133-142
    • /
    • 2014
  • The least mean square(LMS) algorithm has been popular owing to its simplicity, stability, and availability to implement. But it inherently has a problem of slow convergence speed, and the presence of a transfer function in the secondary path following the adaptive controller and the error path has been shown to generally degrade the stability and the performance of the LMS algorithm in applications of acoustical noise control. In general, in order to solve these problems, the filtered-x LMS (FX-LMS) type algorithms can be used and the bi-directional Filtered-x LMS(BFXLMS) algorithm is very attractive among them, which increase the convergence speed and the performance of the controller with nearly equivalent computation complexity. In this paper, a mathematical analysis for the BFXLMS algorithm is presented. In terms of view points of time domain, frequency domain, and stochastic domain, the characteristics and stabilities of algorithm is accurately analyzed.

Task-Technology Fit in Construction Scheduling

  • Yang, Juneseok;Arditi, David
    • 국제학술발표논문집
    • /
    • The 6th International Conference on Construction Engineering and Project Management
    • /
    • pp.117-121
    • /
    • 2015
  • Construction managers use scheduling methods to improve the outcome of their project. Despite the many obvious advantages of the critical path method (CPM), its use in construction has been limited. Understanding the reasons why CPM is not used as extensively as expected could improve its level of acceptance in the construction industry. The link between construction scheduling methods and the tasks expected to be performed by schedulers has been an on-going concern in the construction industry. This study proposes a task-technology fit model to understand why CPM is not used as extensively as expected in construction scheduling. A task-technology fit model that aims to measure the extent to which a construction scheduling method functionally matches the tasks expected to be performed by the scheduling staff. The model that is proposed is an answer to the lack of proper instruments for evaluating the extent to which scheduling methods are used in the industry.

  • PDF

Staffing-Technology Fit in Construction Scheduling

  • Yang, Juneseok;Arditi, David
    • 국제학술발표논문집
    • /
    • The 6th International Conference on Construction Engineering and Project Management
    • /
    • pp.631-635
    • /
    • 2015
  • Construction managers use scheduling methods to improve the outcome of their project. In spite of the many obvious advantages of the critical path method (CPM), its use in construction has been limited. Understanding the reasons why CPM is not used as extensively as expected could improve its level of acceptance in the construction industry. The link between construction scheduling methods and the capabilities of the scheduling staff has been an on-going concern in the construction industry. This study proposes a staffing-technology fit model to understand why CPM is not used as extensively as expected in construction scheduling. A staffing-technology fit model that aims to measure the extent to which a construction scheduling method matches the staff's experience, know-how and capabilities. The model that is proposed is an answer to the lack of proper instruments for evaluating the extent to which scheduling methods are used in the industry.

  • PDF

AN EXAMPLE OF REPRESENTING THREE LEVEL'S SCHEDULES WITHIN SCHEDULE HIERARCHY BY BDM TECHNIQUE

  • Seon-Gyoo Kim
    • 국제학술발표논문집
    • /
    • The 4th International Conference on Construction Engineering and Project Management Organized by the University of New South Wales
    • /
    • pp.445-452
    • /
    • 2011
  • The schedule hierarchy in construction project is generally composed of three levels. The highest level is a milestone schedule and represented by Bar Chart format. The middle level is an integrated project schedule (IPS) and represented by CPM (Critical Path Method) format. The lowest level is a detail working schedule and usually represented by Bar Chart. The traditional scheduling techniques such as ADM (Arrow Diagramming Method) or PDM (Precedence Diagramming Method) cannot represent all kinds of schedule within schedule hierarchy as identical schedule format. However, the BDM (Beeline Diagramming Method) technique can represent all kinds of schedule within schedule hierarchy as identical CPM format. This paper describes the basic concept, principle, interpretation methods, and schedule computation methods of the BDM as a new networking technique that can represent all kinds of overlapping relationships between activities, and then presents an example of representing three level's schedules within schedule hierarchy by the BDM technique.

  • PDF

A reinforcement learning-based network path planning scheme for SDN in multi-access edge computing

  • MinJung Kim;Ducsun Lim
    • International journal of advanced smart convergence
    • /
    • 제13권2호
    • /
    • pp.16-24
    • /
    • 2024
  • With an increase in the relevance of next-generation integrated networking environments, the need to effectively utilize advanced networking techniques also increases. Specifically, integrating Software-Defined Networking (SDN) with Multi-access Edge Computing (MEC) is critical for enhancing network flexibility and addressing challenges such as security vulnerabilities and complex network management. SDN enhances operational flexibility by separating the control and data planes, introducing management complexities. This paper proposes a reinforcement learning-based network path optimization strategy within SDN environments to maximize performance, minimize latency, and optimize resource usage in MEC settings. The proposed Enhanced Proximal Policy Optimization (PPO)-based scheme effectively selects optimal routing paths in dynamic conditions, reducing average delay times to about 60 ms and lowering energy consumption. As the proposed method outperforms conventional schemes, it poses significant practical applications.

분산클라우드 환경에서 마이크로 데이터센터간 자료공유 알고리즘 (A Data Sharing Algorithm of Micro Data Center in Distributed Cloud Networks)

  • 김현철
    • 융합보안논문지
    • /
    • 제15권2호
    • /
    • pp.63-68
    • /
    • 2015
  • 현재의 ICT 인프라(인터넷과 서버/Client 연동)는 다양한 장치, 서비스, 비즈니스 및 기술 진화에 따른 신속한 대응에 어려움을 겪고 있다. 클라우드 컴퓨팅(Cloud Computing)은 구름 같은 네트워크 환경에서 원하는 작업을 요청하여 실행한다는 데서 기원하였으며, 인터넷 기술을 활용하여 IT 자원을 서비스로 제공하는 컴퓨팅을 뜻하고 오늘날 IT 트렌드의 하나로 가장 주목 받고 있다. 이러한 분산클라우드 환경에서는 네트워크 및 컴퓨팅 자원에 대한 통합 관리 체계를 통하여 관리 비용 증가 문제를 원천적으로 해결하고 분산된 마이크로 데이터센터(Micro DC(Data Center))를 통하여 코어 네트워크 트래픽 폭증 문제를 해결하여 비용 절감 효과를 높일 수 있다. 그러나 기존의 Flooding 방식은 인접한 모든 DC들에게 전송하기 때문에 많은 트래픽을 유발 할 수 있다. 이를 위해 Restricted Path Flooding 알고리즘이 제안되었으나 대규모 네트워크에서는 여전히 트래픽을 발생할 수 있는 단점이 있어서 본 논문에서는 홉수 제한을 통하여 이를 개선한 Lightweight Path Flooding 알고리즘을 제안하였다.

모바일 LBS 시스템에서 동적 경로 계산 데이터베이스 모델 (A Dynamic Path Computation Database Model in Mobile LBS System)

  • 주용진
    • Spatial Information Research
    • /
    • 제19권3호
    • /
    • pp.43-52
    • /
    • 2011
  • 최근, 모바일 시스템에서 DBMS를 활용한 위치기반서비스에 대한 관심이 높아지고 있으며, 향상된 차량항법 (in-vehicle navigation) 시스템에 있어 효과적인 저장, 트랜잭션 관리, 모델링과 공간 질의를 통해 현행 파일 기반 시스템이 가지는 한계를 극복할 것으로 기대되고 있다. 특히, 도로 네트워크 데이터는 경로 탐색 시스템에 있어 가장 중요한 영역에 해당하며 효율적인 관리와 유지를 필요로 한다. 이에 본 연구는 모바일 LBS 시스템에서 위상적인 네트워크 데이터를 위한 그래프 기반 지오 데이터베이스 모델 개발과 휴리스틱 접근에 기반을 둔 동적 경로 계산 알고리즘을 제시하는 것을 목적으로 한다. 이를 위해, 계층적 네트워크를 지원하는 데이터 모델을 설계하고, 모바일 LBS 시스템에서 수행 능력을 평가하기위한 경로 계산 시스템을 구현하였다. 마지막으로, 제시된 계층 그래프 모델 기반 경로 계산 알고리듬은 네트워크를 구성하는 노드 개수를 줄여 탐색 속도와 효율적 메모리 사용에 기여할 수 있을 확인 할 수 있다.