基于虚拟模糊集的PID参数整定器的仿真研究

该文中给出的模糊整定器是在虚拟模糊集概念的基础上实现的。该方法首先根据Ｚ－Ｎ整规则,按照过程的开环阶跃响应设置初始参数,然后基于闭环控制系统的响应特性,利用模糊系统精确整定控制器参数。模糊控制规则知识库由整定知识和专家经验规则构成。其中整定知识可通过对一典型过程的参数整定来自动提取。最后给出的数字仿真结果证明该方法的有效性。     

弹道导弹的雷达探测系统仿真

该文根据弹道理论建立了雷则弹道导弹的仿真模型,并对雷达跟踪的导弹弹道数据进行了处理,预报了它的落点范围,并与理论落点进行比较,给出了落点精度。仿真结果表明：雷达对导弹的探测数据经过一数据处理,所得到的落点比较精确。     

MASK: An efficient mechanism to extend inter-domain IP spoofing preventions

IP spoofing hinders the efficiency of DDoS defenses. While recent proposals of IP spoofing prevention mechanisms are weak at filtering spoofing packets due to the complexity in maintaining source IP spaces and the low incentive of deployments. To address this problem, we propose an efficient mechanism to extend the range of inter-domain IP spoofing prevention called MASK. Source MASK nodes inform destination MASK nodes about the source IP spaces and labels of their neighbor Stub-ASes in order to implement the marking and verification of packets towards the Stub-ASes, and limit the number of MASK peers through the propagation of BGP updates so as to reduce the overheads of computing and storing of labels. By utilizing the method of extending the spoofing prevention to Stub-ASes, MASK can not only enlarge the domain of the spoofing prevention service, but also filter spoofing packets in advance. Through analysis and simulations, we demonstrate MASK＇s accuracy and effectiveness.     

P2P网络应用研究与展望

文中论述了P2P技术的概念、结构和应用,以及P2P标准化的推进,对P2P技术的发展进行了展望。     

DCMP: A Distributed Cycle Minimization Protocol for Peer-to-Peer Networks

Broadcast-based peer-to-peer (P2P) networks, including flat (for example, Gnutella) and two-layer superpeer implementations (for example, Kazaa), are extremely popular nowadays due to their simplicity, ease of deployment, and versatility. The unstructured network topology, however, contains many cyclic paths, which introduce numerous duplicate messages in the system. Although such messages can be identified and ignored, they still consume a large proportion of the bandwidth and other resources, causing bottlenecks in the entire network. In this paper, we describe the distributed cycle minimization protocol (DCMP), a dynamic fully decentralized protocol that significantly reduces the duplicate messages by eliminating unnecessary cycles. As queries are transmitted through the peers, DCMP identifies the problematic paths and attempts to break the cycles while maintaining the connectivity of the network. In order to preserve the fault resilience and load balancing properties of unstructured P2P systems, DCMP avoids creating a hierarchical organization. Instead, it applies cycle elimination symmetrically around some powerful peers to keep the average path length small. The overall structure is constructed fast with very low overhead. With the information collected during this process, distributed maintenance is performed efficiently even if peers quit the system without notification. The experimental results from our simulator and the prototype implementation on PlanetLab confirm that DCMP significantly improves the scalability of unstructured P2P systems without sacrificing their desirable properties. Moreover, due to its simplicity, DCMP can be easily implemented in various existing P2P systems and is orthogonal to the search algorithms.     

HBA: Distributed Metadata Management for Large Cluster-Based Storage Systems

An efficient and distributed scheme for file mapping or file lookup is critical in decentralizing metadata management within a group of metadata servers. This paper presents a novel technique called Hierarchical Bloom Filter Arrays (HBA) to map filenames to the metadata servers holding their metadata. Two levels of probabilistic arrays, namely, the Bloom filter arrays with different levels of accuracies, are used on each metadata server. One array, with lower accuracy and representing the distribution of the entire metadata, trades accuracy for significantly reduced memory overhead, whereas the other array, with higher accuracy, caches partial distribution information and exploits the temporal locality of file access patterns. Both arrays are replicated to all metadata servers to support fast local lookups. We evaluate HBA through extensive trace-driven simulations and implementation in Linux. Simulation results show our HBA design to be highly effective and efficient in improving the performance and scalability of file systems in clusters with 1,000 to 10,000 nodes (or superclusters) and with the amount of data in the petabyte scale or higher. Our implementation indicates that HBA can reduce the metadata operation time of a single-metadata-server architecture by a factor of up to 43.9 when the system is configured with 16 metadata servers.     

Cartesian product of compressible effect algebras

In the paper, we prove that is compatible with p}, the set of commutant of p, and , the projection commutant of a, are all normal sub-effect algebras of a compressible effect algebra E, and is a direct retraction on E} is a normal sub-effect algebra of an effect algebra E. Moreover, we answer an open question in Gudder’s (Rep Math Phys 54:93–114, 2004), Compressible effect algebras, Rep Math Phys, by showing that the cartesian product of an infinite number of E _i is a compressible effect algebra if and only if each E _i is a compressible effect algebra. This work was supported by the SF of Education Department of Shaanxi Province (Grant No. 07JK267), P. R. China.     

Cross-Layer Optimization for State Update in Mobile Gaming

In a large-scale mobile gaming environment with limited wireless network bandwidth, efficient mechanisms for state update are crucial to allow graceful real-time interaction for a large number of players. By using the state updating threshold as a key parameter that bridges the resulting state distortion and the network traffic, we are able to study the fundamental traffic-distortion tradeoffs via both theoretical modeling and numerical analysis using real game traces. We consider a WiMAX link model, where the bandwidth allocation is driven by the underlying physical layer link quality as well as application layer gaming behaviors. Such a cross-layer optimization problem can be solved using standard convex programming techniques. By exploring the temporal locality of gaming behavior, we also propose a prediction method for on-line bandwidth adaptation. Using real data traces from a multiplayer driving game, TORCS, the proposed network-aware bandwidth allocation method (NABA) is able to achieve significant reduction in state distortion compared to two baselines: uniform and proportional policies.     

基于SOPC技术的校园信息显示系统

可编程片上系统SOPC是Altera公司近年来提出的一种灵活、高效的片上系统解决方案.介绍以液晶显示模块LCD为系统主要外设,利用SOPC技术实现校园信息显示系统的软、硬件设计思路,给出汉字与图形综合显示的软件设计的主要程序,对于SOPC系统的研究、开发具有较好的工程应用与参考价值.