<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: Metadata onlySubject: search.filters.subject.electronic commerce

Search Results

Now showing 1 - 3 of 3
  • Thumbnail Image
    Item type:Item,
    基於網格運算並具備工作負載分享之數位內容智財權管理服務系統
    (2008)
    蔡銘箴
    ;
    TSAI MIN-JEN
    ;
    國立交通大學資訊管理研究所
    分散式運算 (Distributed Computing)允許應用程式透過網路，在不同地方的電腦 上執行，將可不必把運算任務集中在某台電腦，而是以功能任務分派給各地電腦運 算，再傳回結果與回覆任務。隨著系統架構的演進，相較於早期的主從式(Client-Server) 架構，同儕運算(Peer-to-Peer)與網格運算(Grid Computing)架構的分散式系統應用已逐 漸成為企業運算的主流。 本研究提出一個基於網格運算下且具有工作負載分享之數位內容智財權管理服 務系統，此平台符合Grid Portal 的標準，使用Globus Toolkit 與Condor 來作為整個平 台的基礎，並利用Web 2.0 based 介面來提供使用者選擇服務、遞交、控制、管理工 作與即時監控工作進度，目的為提供數位內容智財權管理服務包括： 1、不可視浮水印嵌入與偵測 2、圖片攪亂以增強訊號的強韌性 3、可視浮水印的嵌入 4、影像竄改驗證與還原 5、浮水印攻擊測試 6、使用者自訂工作。 然而為了使得平台具有 QOS 的動態資源協調能力，來降低整體工作執行時間， 在平台中，透過協調機制的工作評估服務，利用電腦效能指標，來預測工作執行時間 並進行有效的工作分割與合併，使平台保有穩定的運算能力。 因此本計畫將充分運用網格運算的特性，有效運用網路服務來對數位內容的使用 作分享、搜尋與管理，同時保護智慧財產權在開放的網路環境下依然能夠保護著作人 的所有權。
  • Thumbnail Image
    Item type:Item,
    HPRS: A profitability based recommender system
    (2007)
    Chen, Mu-Chen
    ;
    Chen, Long-Sheng
    ;
    Hsu, Fei-Hao
    ;
    Hsu, Yuanjia
    ;
    Chou, Hsiao-Ying
    In electronic commerce, recommender systems are popularly being used to help enterprises for satisfying customers' individually diverse preferences. These systems learn about user preferences over time and automatically suggest products that fit the learned model of user preferences. In tradition, recommendations are provided to customers based on purchase probability and customers' preferences, without considering the profitability factor for sellers. This work presents a new profitability-based recommender system, HPRS (Hybrid Perspective Recommender System), which attempts to integrate the profitability factor into the traditional recommender systems. Comparisons between our proposed system and traditional system which only considers the purchase probability clarify the advantages of our system. The experimental results show that the proposed HPRS can increase profit from cross-selling without compromising recommendation accuracy.
  • Thumbnail Image
    Item type:Item,
    Efficient k-out-of-n oblivious transfer schemes
    (2008)
    Chu, Cheng-Kang
    ;
    Tzeng, Wen-Guey
    ;
    交大名義發表
    ;
    National Chiao Tung University
    Oblivious transfer is an important cryptographic protocol in various security applications. For example, in on-line transactions, a k-out-of-n oblivious transfer scheme allows a buyer to privately choose k-out of n digital goods from a merchant without learning information about other n-k goods. In this paper, we propose several efficient two-round k-out-of-n oblivious transfer schemes, in which the receiver R sends O(k) messages to the sender S, and S sends O( n) messages back to R. The schemes provide unconditional security for either sender or receiver. The computational security for the other side is based on the Decisional Diffie-Hellman (DDH) or Chosen-Target Computational Diffie-Hellman (CT-CDH) problems. Our schemes have the nice property of universal parameters, that is, each pair of R and S need not hold any secret before performing the protocol. The system parameters can be used by all senders and receivers without any trapdoor specification. In some cases, our OT(n)(k) schemes are the most efficient ones in terms of the communication cost, either in rounds or the number of messages. Moreover, one of our schemes is extended to an adaptive oblivious transfer scheme. In that scheme, S sends O( n) messages to R in one round in the commitment phase. For each query of R, only O( 1) messages are exchanged and O( 1) operations are performed. The preliminary version of this paper was published at PKC ' 05 [ Chu and Tzeng 2005].