机械制图CAD与教学

机械制图是工科类,特别是机械类学生的重要专业技术基础课,CAD是现代计算机绘图工具.现在制造业的快速发展带动了相关的绘图设计的快速发展.本文从机械制图CAD在设计制图中的地位谈起,突出了机械制图CAD的基础性.再进一步谈到机械制图CAD的教学的必要性,重点讨论了在教学创新的重要性.以及多媒体测绘室的重要地位,和建设的必要性.     

双以太环形网络技术研究

本文系统地阐述了双以太环形网络技术,对其核心进行了分析,可作为设备接入双以太环形网络的应用参考.     

浅析电子商务中的安全问题

随着现今社会互联网、个人终端技术的飞越发展,电子商务越来越多的出现在人们的生活与工作中,这种全新的商务模式具有便捷、高效率、低成本的特点.同时,这种全新的商务模式对管理水平、信息传递技术都提出了更高的要求,其中安全的重要性尤为突出.     

发电机电气制动方法及其应用研究

利用Matlab对水轮发电机不同别动方法进行了仿真,计算出了不同水轮发电机组在不同的投入转速和不同的制动电流下的制动时间,为水轮发电机电气制动方案的设计以及选择最佳的制动参数提供了重要的依据.     

职业院校计算机网络教学的思考

为提高教学质量、保证学生后续课程的顺利学习,本文从计算机网络课程本身出发,并结合职业院校学生的特点,分别从讲授内容的整合、教学方法的改进、教学手段的更新和实验的精心设计四个方面进行了研究和探讨,强调培养学生解决问题的应用能力,提高教学质量,教学效果.     

The two-equal-disjoint path cover problem of Matching Composition Network

Embedding of paths have attracted much attention in the parallel processing. Many-to-many communication is one of the most central issues in various interconnection networks. A graph G is globally two-equal-disjoint path coverable if for any two distinct pairs of vertices (u,v) and (w,x) of G, there exist two disjoint paths P and Q satisfied that (1) P (Q, respectively) joins u and v (w and x, respectively), (2) |P|=|Q|, and (3) V(PQ)=V(G). The Matching Composition Network (MCN) is a family of networks which two components are connected by a perfect matching. In this paper, we consider the globally two-equal-disjoint path cover property of MCN. Applying our result, the Crossed cube CQ_n, the Twisted cube TQ_n, and the Möbius cube MQ_n can all be proven to be globally two-equal-disjoint path coverable for n5.     

Document recommendation for knowledge sharing in personal folder environments

Sharing sustainable and valuable knowledge among knowledge workers is a fundamental aspect of knowledge management. In organizations, knowledge workers usually have personal folders in which they organize and store needed codified knowledge (textual documents) in categories. In such personal folder environments, providing knowledge workers with needed knowledge from other workers’ folders is important because it increases the workers’ productivity and the possibility of reusing and sharing knowledge. Conventional recommendation methods can be used to recommend relevant documents to workers; however, those methods recommend knowledge items without considering whether the items are assigned to the appropriate category in the target user’s personal folders. In this paper, we propose novel document recommendation methods, including content-based filtering and categorization, collaborative filtering and categorization, and hybrid methods, which integrate text categorization techniques, to recommend documents to target worker’s personalized categories. Our experiment results show that the hybrid methods outperform the pure content-based and the collaborative filtering and categorization methods. The proposed methods not only proactively notify knowledge workers about relevant documents held by their peers, but also facilitate push-mode knowledge sharing.     

Social network,social trust and shared goals in organizational knowledge sharing

The aim of our study was to further develop an understanding of social capital in organizational-knowledge-sharing. We first developed a measurement tool and then a theoretical framework in which three social capital factors (social network, social trust, and shared goals) were combined with the theory of reasoned action; their relationships were then examined using confirmatory factoring analysis. We then surveyed of 190 managers from Hong Kong firms, we confirm that a social network and shared goals significantly contributed to a person's volition to share knowledge, and directly contributed to the perceived social pressure of the organization. The social trust has however showed no direct effect on the attitude and subjective norm of sharing knowledge.     

Hamiltonian-connected graphs

For a simple graph G, let . In this paper, we prove that if NCD(G)≥|V(G)|, then either G is Hamiltonian-connected, or G belongs to a well-characterized class of graphs. The former results by Dirac, Ore and Faudree et al. are extended.     

Application classification using packet size distribution and port association

Traffic classification is an essential part in common network management applications such as intrusion detection and network monitoring. Identifying traffic by looking at port numbers is only suitable to well-known applications, while signature-based classification is not applicable to encrypted messages. Our preliminary observation shows that each application has distinct packet size distribution (PSD) of the connections. Therefore, it is feasible to classify traffic by analyzing the variances of packet sizes of the connections without analyzing packet payload. In this work, each connection is first transformed into a point in a multi-dimensional space according to its PSD. Then it is compared with the representative points of pre-defined applications and recognized as the application having a minimum distance. Once a connection is identified as a specific application, port association is used to accelerate the classification by combining it with the other connections of the same session because applications usually use consecutive ports during a session. Using the proposed techniques, packet size distribution and port association, a high accuracy rate, 96% on average, and low false positive and false negative rates, 4–5%, are achieved. Our proposed method not only works well for encrypted traffic but also can be easily incorporated with a signature-based method to provide better accuracy.