<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

Filters

1997 - 199912000 - 20011

Settings

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

Access type: Metadata onlyAuthor: search.filters.author.Chang, CT

Search Results

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item type:Item,
    The fewest circular-arc segments for manufacturing the quickest return profile of a cam-follower mechanism
    (1997)
    Chang, CT
    ;
    機械工程學系
    ;
    Department of Mechanical Engineering
    This paper investigates a circular-are approximation methodology with the fewest segments for manufacturing the quickest return profile (QRP) of a cam-follower mechanism. The cam is a disk type rotating with, a constant angular speed, and the follower is a translating flat-faced type with a spring system. The rise cam profile (RCP) adopts a cosine kinematic function. We may persive the cam as stationary, while the follower reciprocates along its profile in order to produce radial displacements. Sometimes, the flat-faced follower needs to return quickly from a RCP to the base circle based on the Brachistochrone theory. We can minimize the time required for this action using the energy equation and solving for QRP from Euler equation. The follower can thus execute the quickest return profile in a control system. The fillet earn profile (FCP) connecting smoothly both, the RCP and QRP is also considered. Finally, this paper provides a practical example to explain how to design and fabricate the QRP.
  • Thumbnail Image
    Item type:Item,
    An intelligent on-demand multicast routing protocol in Ad hoc networks
    (2001)
    Wang, K
    ;
    Chang, CT
    ;
    資訊工程學系
    ;
    Department of Computer Science
    In this paper we present an intelligent on-demand multicast routing protocol (IOD-MRP) which is suited in rapidly changing network environments, such as ad hoc networks. This protocol simplifies and enhances the existing core-assisted mesh protocol (CAMP). The main difference between our protocol and CAMP is eliminating the cores from CAMP. We remove the cores from CAMP and apply an on demand receiver-initiated procedure to dynamically build routes and maintain multicast group membership. In addition, flooding is an important issue in ad hoc networks and our protocol is able to reduce flooding messages. Simulation results show that IOD-MRP reduces number of control messages by 3% - 13% compared to CAMP and still has slightly lower packet delay and packet loss rates.