關鍵字查詢 | 類別:期刊論文 | | 關鍵字:A Scalable

[第一頁][上頁]1[次頁][最末頁]目前在第 1 頁 / 共有 12 筆查詢結果
序號 學年期 教師動態
1 82/2 物理系 薛宏中 教授 期刊論文 發佈 Nearest-neighbour heuristics in accelerated algorithms of optimisation problems , [82-2] :Nearest-neighbour heuristics in accelerated algorithms of optimisation problems期刊論文Nearest-neighbour heuristics in accelerated algorithms of optimisation problemsLin, Simon C.; Hsueh, H.C.Physica A: Statistical Mechanics and its Applications 203(3-4), pp.369-380A scalable linear algorithm of simulated annealing (SA) was proposed by Lin et al. that is capable of achieving a near optimal solution for the travelling saleman problem in a controllable way. Since the linearity is based on the hybrid mechanism that combines SA heuristics with the scaling relation of acceptance ratio in the low temperature, other conventional heuristics in optimisation problems ought to be tried. The nearest-neighbour (NN) heuristics is thus studied, and one finds that the quenched configuration of NN's could be resurrected back to SA path by the hybrid mechanism. It is also verified that the same scalable linear algorithm of Lin's may continue to apply with exactly the same set of parameters.en國外否NLD
2 96/2 軍訓室 張忠義 少校教官 期刊論文 發佈 Fast Mining of Closed Sequential Patterns , [96-2] :Fast Mining of Closed Sequential Patterns期刊論文Fast Mining of Closed Sequential PatternsLin, Nancy P.; Hao, Wei-hua; Chen, Hung-jen; Chueh, Hao-en; Chang, Chung-i淡江大學軍訓室data mining;sequential patterns mining;closed sequential patternsAthens: World Scientific and Engineering Academy and SocietyWSEAS Transactions on Computers 7(4), pp.133-139This paper propose a novel algorithm for mining closed frequent sequences, a scalable, condensed and lossless structure of complete frequent sequences that can be mined from a sequence database. This algorithm, FMCSP, has applied several optimization methods, such as equivalence class, to alleviate the needs of searching space and run time. In particular, since one of the main issues in this type of algorithms is the redundant generation of the closed sequences, hence, we propose an effective and memory saving methods, different from previous works, does not require the complete set of closed sequences to be residing in the memory.20130327 已補正 by 游筑翔@@
3 96/2 資工系 闕豪恩 助理教授 期刊論文 發佈 Fast Mining of Closed Sequential Patterns , [96-2] :Fast Mining of Closed Sequential Patterns期刊論文Fast Mining of Closed Sequential PatternsLin, Nancy P.; Hao, Wei-hua; Chen, Hung-jen; Chueh, Hao-en; Chang, Chung-i淡江大學軍訓室data mining;sequential patterns mining;closed sequential patternsAthens: World Scientific and Engineering Academy and SocietyWSEAS Transactions on Computers 7(4), pp.133-139This paper propose a novel algorithm for mining closed frequent sequences, a scalable, condensed and lossless structure of complete frequent sequences that can be mined from a sequence database. This algorithm, FMCSP, has applied several optimization methods, such as equivalence class, to alleviate the needs of searching space and run time. In particular, since one of the main issues in this type of algorithms is the redundant generation of the closed sequences, hence, we propose an effective and memory saving methods, different from previous works, does not require the complete set of closed sequences to be residing in the memory.20130327 已補正 by 游筑翔@@
4 96/2 資工系 陳宏任 講師 期刊論文 發佈 Fast Mining of Closed Sequential Patterns , [96-2] :Fast Mining of Closed Sequential Patterns期刊論文Fast Mining of Closed Sequential PatternsLin, Nancy P.; Hao, Wei-hua; Chen, Hung-jen; Chueh, Hao-en; Chang, Chung-i淡江大學軍訓室data mining;sequential patterns mining;closed sequential patternsAthens: World Scientific and Engineering Academy and SocietyWSEAS Transactions on Computers 7(4), pp.133-139This paper propose a novel algorithm for mining closed frequent sequences, a scalable, condensed and lossless structure of complete frequent sequences that can be mined from a sequence database. This algorithm, FMCSP, has applied several optimization methods, such as equivalence class, to alleviate the needs of searching space and run time. In particular, since one of the main issues in this type of algorithms is the redundant generation of the closed sequences, hence, we propose an effective and memory saving methods, different from previous works, does not require the complete set of closed sequences to be residing in the memory.20130327 已補正 by 游筑翔@@
5 96/2 資工系 郝維華 講師 期刊論文 發佈 Fast Mining of Closed Sequential Patterns , [96-2] :Fast Mining of Closed Sequential Patterns期刊論文Fast Mining of Closed Sequential PatternsLin, Nancy P.; Hao, Wei-hua; Chen, Hung-jen; Chueh, Hao-en; Chang, Chung-i淡江大學軍訓室data mining;sequential patterns mining;closed sequential patternsAthens: World Scientific and Engineering Academy and SocietyWSEAS Transactions on Computers 7(4), pp.133-139This paper propose a novel algorithm for mining closed frequent sequences, a scalable, condensed and lossless structure of complete frequent sequences that can be mined from a sequence database. This algorithm, FMCSP, has applied several optimization methods, such as equivalence class, to alleviate the needs of searching space and run time. In particular, since one of the main issues in this type of algorithms is the redundant generation of the closed sequences, hence, we propose an effective and memory saving methods, different from previous works, does not require the complete set of closed sequences to be residing in the memory.20130327 已補正 by 游筑翔@@
6 90/1 電機系 李維聰 教授 期刊論文 發佈 A novel routing algorithm for WDM-based micro-cellular wireless system , [90-1] :A novel routing algorithm for WDM-based micro-cellular wireless system期刊論文A novel routing algorithm for WDM-based micro-cellular wireless systemPan, Jen-yi; Lee, Wei-tsong; Pan, Jen-yi; Huang, Nen-fu淡江大學電機工程學系Backbone of cellular network;IMT-2000;Optical packet network;Self routing;Shuffle-exchange network;WDMAmsterdam: Elsevier BVComputer Communications 24(17), pp.1714-1725Today, almost everyone has a personal computing appliance, and base-stations are aggressively deployed to serve these customers. However, the cellular network backbone may become overloaded behind these convenient personal services, especially in the near future of International Mobile Telecommunications-2000 (IMT-2000). Therefore, this study presents a scalable Wavelength Division Multiplexing (WDM) cellular network backbone to provide plenty of bandwidth up to Giga-bits/s, even to Tera-bits/s. In this paper, we propose a WDM-based solution for cellular network backbone, which originates from the shuffle-exchange n
7 94/2 資工系 陳瑞發 副教授 期刊論文 發佈 VON: A Scalable Peer-to-Peer Network for Virtual Environments , [94-2] :VON: A Scalable Peer-to-Peer Network for Virtual Environments期刊論文VON: A Scalable Peer-to-Peer Network for Virtual EnvironmentsHu, Shun-Yun; Chen, Jui-Fa; Chen, Tsu-Han淡江大學資訊工程學系Piscataway: Institute of Electrical and Electronics EngineersIEEE Network 20(4), pp.22-31The scalability of large-scale networked virtual environments (NVEs) such as today's massively multiplayer online games (MMOGs) faces inherent limits imposed by client-server architectures. We identify an emerging research direction that applies peer-to-peer (P2P) networks in order to realize more scalable and affordable NVEs. The central issue for P2P-based NVE (P2P-NVE) systems is to correctly and efficiently maintain the topology of all participating peers by solving the neighbor discovery problem. We also propose the Voronoi-based overlay network (VON), a simple and efficient design that maintains the P2P topology in a fully-distributed, low-latency, and message-efficient manner. Simulation results show that by bounding
8 99/2 資管系 李鴻璋 副教授 期刊論文 發佈 A Scalable, High-performance Grouping DCF for the MAC layer enhancement of 802.11n , [99-2] :A Scalable, High-performance Grouping DCF for the MAC layer enhancement of 802.11n期刊論文A Scalable, High-performance Grouping DCF for the MAC layer enhancement of 802.11nTing, K-C.; Lee, H-C.; Lai, Fei-pei淡江大學資訊管理學系grouping;802.11;802.11n;MAC capacity;distributed coordination function;DCF;TDMA;throughput;collisionInderscience EnterpriseInternational Journal of Communication Networks and Distributed Systems 7(1-2), pp.101-118Today’s 802.11 wireless local area network (WLAN) technology has become a popular protocol for internet access. However, this technology is not scalable at all because its capacity will deteriorate with an increase in the number of active stations, due to the huge collision costs involved. In this article, we propose a scalable, high performance grouping distributed coordination function (HG-DCF) which introduces the TDMA concept to partition all active stations into several groups to prevent all stations from transmitting frames simultaneously and to reduce the heavy
9 96/1 資創系 張峯誠 副教授 期刊論文 發佈 Layered Access Control Schemes on Watermarked Scalable Media , [96-1] :Layered Access Control Schemes on Watermarked Scalable Media期刊論文Layered Access Control Schemes on Watermarked Scalable MediaChang, F. C.; Huang, H.-C.; Hang, H.-M.淡江大學資訊軟體學系access control;scalable coding;encryption;watermarkingThe Journal of VLSI Signal Processing 49(3), pp.443-455本書目待補正Intellectual Property (IP) protection is a critical element in multimedia transmission and delivery systems. Conventional IP protection on multimedia data can be categorized into encryption and watermarking. In this paper, a structure to perform layered access control on scalable media by combining encryption and robust watermarking is proposed, implemented, and verified. By taking advantages of the nature of both encryption and watermarking, copyrights of multimedia contents can be well protected and at the same time, multiple-grade services can be provided. In the summated examples, we assume a scalable transmission scheme over the broadcasting environment and use it to test the effectiveness of propo
10 98/2 電機系 吳庭育 助理教授 期刊論文 發佈 Quality-Aware Bandwidth Allocation for Scalable On-Demand Streaming in Wireless Networks , [98-2] :Quality-Aware Bandwidth Allocation for Scalable On-Demand Streaming in Wireless Networks期刊論文Quality-Aware Bandwidth Allocation for Scalable On-Demand Streaming in Wireless NetworksDing, Jen-wen; Deng, Der-Jiunn; Wu, Tin-Yu ; Chen, Hsiao-Hwa淡江大學電機工程學系Bandwidth allocation;MPEG-4 FGS video;NGN/IMS;video broadcasting;video streamingPiscataway: Institute of Electrical and Electronics EngineersIEEE Journal on Selected Areas in Communications 28(3), pp.366-376In this paper, we propose a scalable transport scheme for delivering on-demand video streams over broadband wireless networks in next-generation network/IP multimedia subsystem (NGN/IMS) architecture. The proposed transport scheme makes use of fine-granular-scalability (FGS) encoded videos to accommodate high bandwidth variation of wireless networks. We formulate the bandwidth allocation to FGS-encoded streams as a resource allocation problem and develop a quality-aware bandwidth allocation scheme, called QABA. With QABA, the proposed tr
11 97/1 電機系 李揚漢 教授 期刊論文 發佈 Low-power/High-speed scalable and subchannelizable FFT architecture for SOFDMA application , [97-1] :Low-power/High-speed scalable and subchannelizable FFT architecture for SOFDMA application期刊論文Low-power/High-speed scalable and subchannelizable FFT architecture for SOFDMA application李揚漢; Lee, Yang-han; Chiang, Jen-shiun; Chou, Yen-hsih; Lee, Yu-shih; Tseng, Hsien-wei; Chuang, Ming-hsueh淡江大學電機工程學系淡江大學淡江理工學刊 = Tamkang Journal of Science and Engineering 11(3), pp.313-324In this paper, a scalable and subchannelizable innovative FFT architecture is proposed to provide with low-power and high-speed characteristics for SOFDMA application in IEEE 802.16 WiMAX communication and other fields that have features in SOFDMAapplications. The scalability design uses multiplexing concept to build only one 1024-point and only one 2048-point FFT processors in an IEEE 802.16e and an IEEE 802.16-2004 WiMAX system respectively. The spirits of the subchannelization design are prohibited all of the unused arithmetic operations in the present inventive design to achieve low-power requirement when only a sma
12 97/2 電機系 莊博任 教授 期刊論文 發佈 Scalable Grouping Random Key Predistribution in Large Scale Wireless Sensor Networks , [97-2] :Scalable Grouping Random Key Predistribution in Large Scale Wireless Sensor Networks期刊論文Scalable Grouping Random Key Predistribution in Large Scale Wireless Sensor NetworksChuang, Po-Jen; Chao, Tun-Hao; Li, Bo-Yi淡江大學電機工程學系臺北縣:淡江大學淡江理工學刊=Tamkang Journal of Science and Engineering 12(2),頁151-160The security issue in a wireless sensor network (WSN) has been drawing considerable research attention in recent years. Key management, a basic security service, becomes the core design for various security services, such as encryption and authentication. To increase the connectivity of each key in a large-scale WSN and to enlarge its maximum supportable network size, this paper presents a scalable grouping (SG) random key predistribution scheme. The SG scheme divides all nodes into several groups and uses the one-way function to generate group-to-group pairwise keys. To improve resilience against node capture, i.e., to fortify the security strength, the scheme takes on the concept that the link k
[第一頁][上頁]1[次頁][最末頁]目前在第 1 頁 / 共有 12 筆查詢結果