特种电动机高压阀门准确制动的仿真计算

对于特种异步电动机拖动的高压阀门 ,切断电动机交流供电电源后 ,在电机的定子绕组中通入适当的直流电流 ,产生直流磁场 ,使电机进行能耗制动 ,让阀心和电机转子的能量 ,包括动能消耗在转子的绕组中 ,达到准确停车的目的。介绍了这一过程的计算机仿真计算     

基于双链式存储的可靠通信网合并

本文介绍图的双链式存储结构在可靠通讯网合并算法中的应用.     

基于级连分组BP网络的高精度手写数字识别

本文提出了一种基于级连分组网的手写数字识别的新方法。这种方法根据将每次分类任务简单化的思想,将每个网络的任务简化以提高其辨别能力。整个系统分为两级,第一级进行粗分类,选取前两个后选字。第二级对两个后选字进行细分类。每个细分类网络完成区分两类特定模式的任务,由于每个子网络分类数目的减少导致识别精度的提高。使用我们自己构造的含10万个字符的库进行测试,我们的系统达到了在拒识为5%以内时误识为0.067%。     

首饰设计的发展与创新

"设计创新"作为近年来的时尚用语涉及到各个设计领域,在首饰设计领域中也不乏听闻。首饰设计不同的发展阶段风格迥异,在当今社会各种环境因素影响之下,"设计创新"仍是其不断发展的关键所在。     

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.     

Discriminant subspace analysis: a Fukunaga-Koontz approach

The Fisher Linear Discriminant (FLD) is commonly used in pattern recognition. It finds a linear subspace that maximally separates class patterns according to the Fisher Criterion. Several methods of computing the FLD have been proposed in the literature, most of which require the calculation of the so-called scatter matrices. In this paper, we bring a fresh perspective to FLD via the Fukunaga-Koontz Transform (FKT). We do this by decomposing the whole data space into four subspaces with different discriminability, as measured by eigenvalue ratios. By connecting the eigenvalue ratio with the generalized eigenvalue, we show where the Fisher Criterion is maximally satisfied. We prove the relationship between FLD and FKT analytically, and propose a unified framework to understanding some existing work. Furthermore, we extend our our theory to Multiple Discriminant Analysis (MDA). This is done by transforming the data into intra- and extra-class spaces, followed by maximizing the Bhattacharyya distance. Based on our FKT analysis, we identify the discriminant subspaces of MDA/FKT, and propose an efficient algorithm, which works even when the scatter matrices are singular, or too large to be formed. Our method is general and may be applied to different pattern recognition problems. We validate our method by experimenting on synthetic and real data.