多目的IP传输设计实现

组播因其在点对多点传输方面拥有的优势,常被用于多媒体会议等应用。但是由于使用组播路由规模的限制,阻碍了在因特网推广组播技术的应用。首先对组播的原理作了分析,提出了具有组播特性的包含多个目的IP地址的IP传输设计,然后描述了一些关键问题,并讲解了具体设计和实现方法。     

基于网络的多媒体课堂教学模式的研究与实践

计算机多媒体技术和网络技术应用于教学,给学生提供了一个开放的学习空间,使学生在新型学习环境中,不断充实自己、完善自我。本文从教学模式出发,探讨基于网络的多媒体课堂教学模式,并对该模式进行了分析。旨在将网络、多媒体这种现代教育技术运用于传统的课堂教学,提高素质教育水平。     

Nanotextured superhydrophobic micromesh

A superhydrophobic micromesh covered with nanoprotrusions has been introduced and its applicability to a waterproof mobile phone speaker has been evaluated. The nanotextured superhydrophobic micromesh showed excellent water repellency, self-cleaning and waterproofing performances. In a waterproof speaker test using the fabricated nanotextured micromesh, the micromesh did not lose its waterproof function at 2 m water depth and did not form a remnant water film after being removed from the water. The packaged speaker showed almost the same sound quality before and after dipping at a 2 m water depth. These results demonstrate that the superhydrophobic nanotextured micromesh could be directly applicable for various products that need to resist water penetration, yet allow the transmission of gases and sound/light waves.     

两种聚类算法的比较与实现

基于统计的系统聚类分析是一种重要的数据挖掘算法。研究了一种多重系统聚类模型及其算法实现,把变量聚类和样本聚类相结合,并使用了两种方法赋值样本数据阵,使聚类结果更加直观。     

M0内核在通用文本型HMI中的应用

采用NUC100LE3AN为主控芯片,设计了通用文本型HMI(Human Machine Interface),实现了与大部分品牌PLC的通信连接。介绍了该装置的构架原理、功能及其软硬件设计思想。详细讨论了FLASH存储器空间分配、APROM区与LDROM相互跳转原理、以及应用程序区任务模块的组织形式等。最后通过与信捷XC1-32型PLC连接,进行了功能测试,结果表明设计满足了功能需求。     

Reachability determination in acyclic Petri nets by cell enumeration approach

Reachability is one of the most important behavioral properties of Petri nets. We propose in this paper a novel approach for solving the fundamental equation in the reachability analysis of acyclic Petri nets, which has been known to be NP-complete. More specifically, by adopting a revised version of the cell enumeration method for an arrangement of hyperplanes in discrete geometry, we develop an efficient solution scheme to identify firing count vector solution(s) to the fundamental equation on a bounded integer set, with a complexity bound of O((nu)^n−m), where n is the number of transitions, m is the number of places and u is the upper bound of the number of firings for all individual transitions.