完整後設資料紀錄
DC 欄位語言
dc.contributor.author蔡中zh_TW
dc.contributor.authorC.Tsaien_US
dc.date.accessioned2017-10-06T06:22:23Z-
dc.date.available2017-10-06T06:22:23Z-
dc.date.issued1980-04en_US
dc.identifier.urihttp://hdl.handle.net/11536/137519-
dc.description.abstract本文提出一個簡單的方法為計算機輔助電路分析來選電路的樹。此方法是由樹的特性歸納成三項法則而成。此法有別於它法者是避免用計算機乘的運算並且直接從附帶矩陣上求得。zh_TW
dc.description.abstractA simple-method is described to find a tree in a circuit for computer-aided circuit analysis.This method is based on three rules derived from the properties of tree. It differs from others is that it doesn't use any multiplication operation and obtains the results directly from the incidence matrix.en_US
dc.language.isozh_TWen_US
dc.publisher交大學刊編輯委員會zh_TW
dc.title論計算機輔助電路分析中選樹的方法zh_TW
dc.titleOn the Method of Selecting Tree in Computer-Aided Circuit Analysisen_US
dc.typeCampus Publicationsen_US
dc.identifier.journal交通大學學報zh_TW
dc.identifier.journalThe Journal of National Chiao Tung Universityen_US
dc.citation.volume7en_US
dc.citation.spage45en_US
dc.citation.epage=O105-1en_US
顯示於類別:交通大學學報


文件中的檔案:

  1. HT001313-04.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。