English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 84662/113307 (75%)
造訪人次 : 22342768      線上人數 : 875
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://nccur.lib.nccu.edu.tw/handle/140.119/71243

    題名: Analyzing the Density of Subgroups in Valued Relationships Based on DNA Computing
    作者: 鄭至甫
    Jeng, Jyh‐Fu
    貢獻者: 科管智財所
    日期: 2006
    上傳時間: 2014-11-07 16:03:03 (UTC+8)
    摘要: One method for enhancing the quality of work life for companies or other organisations is to rearrange employees by detecting and analysing employees’ close interpersonal relationships based on business implications. Although human resource managers can use various methods to enhance the quality of work life, one of the most widely used and effective methods is job rotation. In this paper, we select a model of a workplace where employees in a variety of job functions are sharing tasks, information, etc. through close interpersonal relationships, and we suppose a personnel network which contains strong terms of mutual understanding. However, with a huge number of employees it becomes extremely difficult to find the maximum clique of employees for rearrangement, meaning this is NP-hard. Therefore, we employ DNA computing, also known as molecular computation, to this rearranging problem. The goal of this paper is to propose a way to apply DNA computing to this human resource management problem, and to measure its effectiveness in rearranging employees to analyse the density of subgroups in a personnel network with valued relationships.
    關聯: Lecture Notes in Artificial Intelligence, 4253, 964-971
    資料類型: article
    顯示於類別:[科技管理與智慧財產研究所] 期刊論文


    檔案 描述 大小格式瀏覽次數


    社群 sharing

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋