<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css">

學術出版;;Publications

Permanent URI for this communityhdl:11536/1

收集所有交通大學研究人員與學生個人或團體所發表之各項學術著作，涵蓋期刊論文、教師專書、學位論文等項。;;Collections of Publications of NCTU Researchers and Students Like Journal Papers and Thesis.

Browse

🏛️國立陽明交通大學機構典藏

Access type: Open accessSubject: search.filters.subject.Cloud computing

Search Results

Now showing 1 - 4 of 4
  • Thumbnail Image
    Item type:Item,
    區域交通控制中心雲端化計畫(3/4)
    (2015)
    黃銘崇
    ;
    邱裕鈞
    ;
    國立交通大學運輸研究中心
    本計畫係應用「雲端運算」技術於區域交通控制問題，以其自動化調派IT資源、快速部署與優異的延展性與可用性等優勢，建構整合式區域交通控制雲端系統示範平臺，達成無縫、即時地整合交通控制資料，進而同步解決「跨單位間之區域交通控制協同管理」與「現有中、小型都市交通控制中心軟硬體建置與後續管理維運」等問題。本計畫之主要目的為針對前兩期所提出之雲端交通協控系統規劃架構進行調整，以C-c-R架構進行協控機制軟體開發與功能擴充，期望能將本計畫成果應用於智慧型運輸系統中先進交通管理系統之參考。本計畫的重要成果與效益包含：「建立一以C-c-R為架構之交通控制雲端平台」、「降低地區交通控制系統建置與維運成本」、「提升區域交通控制協同合作管理品質」與「強化雲端運算與交通控制核心技術研發能量與人才培育」。
  • Thumbnail Image
    Item type:Item,
  • Thumbnail Image
    Item type:Item,
    Dynamic Multiservice Load Balancing in Cloud-Based Multimedia System
    (2014-03-01)
    Lin, Chun-Cheng
    ;
    Chin, Hui-Hsin
    ;
    Deng, Der-Jiunn
    ;
    工業工程與管理學系
    ;
    Department of Industrial Engineering and Management
    Consider a centralized hierarchical cloud-based multimedia system (CMS) consisting of a resource manager, cluster heads, and server clusters, in which the resource manager assigns clients' requests for multimedia service tasks to server clusters according to the task characteristics, and then each cluster head distributes the assigned task to the servers within its server cluster. For such a complicated CMS, however, it is a research challenge to design an effective load balancing algorithm that spreads the multimedia service task load on servers with the minimal cost for transmitting multimedia data between server clusters and clients, while the maximal load limit of each server cluster is not violated. Unlike previous work, this paper takes into account a more practical dynamic multiservice scenario in which each server cluster only handles a specific type of multimedia task, and each client requests a different type of multimedia service at a different time. Such a scenario can be modelled as an integer linear programming problem, which is computationally intractable in general. As a consequence, this paper further solves the problem by an efficient genetic algorithm with an immigrant scheme, which has been shown to be suitable for dynamic problems. Simulation results demonstrate that the proposed genetic algorithm can efficiently cope with dynamic multiservice load balancing in CMS.
  • Thumbnail Image
    Item type:Item,
    A novel approach to collaborative testing in a crowdsourcing environment
    (2013-08-01)
    Tung, Yuan-Hsin
    ;
    Tseng, Shian-Shyong
    ;
    資訊工程學系
    ;
    Department of Computer Science
    Software testing processes are generally labor-intensive and often involve substantial collaboration among testers, developers, and even users. However, considerable human resource capacity exists on the Internet in social networks, expert communities, or internet forums-referred to as crowds. Effectively using crowd resources to support collaborative testing is an interesting and challenging topic. This paper defines the collaborative testing problem in a crowd environment as an NP-Complete job assignment problem and formulates it as an integer linear programming (ILP) problem. Although package tools can be used to obtain the optimal solution to an ILP problem, computational complexity makes these tools unsuitable for solving large-scale problems. This study uses a greedy approach with four heuristic strategies to solve the problem. This is called the crowdsourcing-based collaborative testing approach. This approach includes two phases, training phase and testing phase. The training phase transforms the original problem into an ILP problem. The testing phase solves the ILP using heuristic strategies. A prototype system, called the Collaborative Testing System (COTS), is also implemented. The experiment results show that the proposed heuristic algorithms produce good quality approximate solutions in an acceptable timeframe. (c) 2013 Elsevier Inc. All rights reserved.