Vehicle routing concepts in the closed-loop container network of ARN—a case study

In this paper we discuss a real-life case study to optimize the logistics network for the collection of containers from end-of-life vehicle dismantlers in the Netherlands. Advanced planning concepts, such as dynamic assignment of dismantlers to logistic service providers, are analyzed using a simulation model. Based on this model, we periodically solve a vehicle routing problem to gain insight into the long-term performance of the system. The vehicle routing problem considered is a multi-depot pickup and delivery problem with alternative delivery locations. A special characteristic of the problem is the limited vehicle capacity of two containers. We solve this problem with a heuristic based on route generation and set partitioning.     

对于模糊ARTMAP的研究及改进

在模糊artmap网络中,Fa2层每增加一个的神经元就表示增加了一个聚类,这是该网络的优点同时也增加了网络的负荷。文中对模糊artmap算法进行了简要介绍并分析了算法的收敛复杂度。在此基础上,提出数据集划分法以提高网络的收敛速度。最后通过试验比较算法改进前后的网络收敛速度的差异,证明改进后网络的收敛速度明显提高。     

一种基于系数状态表的SPIHT图像编码算法

提出了一种新的基于系数状态表的SPIHT(LPS-SPIHT,list of p ixel stata-set partition ing in h ierarch icaltrees)图像压缩编码算法,该算法具有以下5个特点:第一,定义了一种扩展的空间方向树,使1个结点含有2×2相邻的4个系数,并将基本EZW(嵌入式小波零树)的符号定义应用于扩展树;第二,用1个廉价的系数状态表代替了SPIHT算法中的LIS(不重要集合表)、LIP(不重要像素表)、LSP(重要像素表)等3个数据表,节省了内存;第三,通过扫描系数状态表,可一次性完成对图像数据的编码,使分类过程与细化过程合二而一;第四,利用一种树指数避免了重复计算,提高了处理速度;第五,通过重新组织编码过程,省去了对大量可推知位的编码,提高了压缩效率。实践证明,与目前公认的最为有效的SPIHT算法相比,该算法不仅性能优越,而且计算简单,容易实现。     

一种基于单CPU单ASIC结构的软硬件划分算法

软硬件划分是软硬件协同设计中的关键问题之一。本文针对单CPU单ASIC结构嵌入式系统，提出了一种基于数据流图的划分算法。实验结果表明，该算法可以有效地解决软硬件划分问题，效率较高，对固定时间约束下硬件面积最小划分问题具有一定的实际意义。     

Existing State and Partitioning of Rare Earth on Weathered Ores

The existing state and partitioning of rare earth （RE） on weathered ores in Longnan County（LN）, Xingfeng County（XF） and Ninghua County（NH） were characterized systematically by standard geological analytical methods. It is found that RE in the weathered rare earth ores exist as four phases： （a） water soluble, （b） ion-exchangeable, （c） colloidal sediment （oxides）, （d） minerals, in which mainly as ion exchangeable phase, accounting for nearly 80% of total RE, with about 20% in the form of colloid sediment phase and mineral phase, but very little as aqueous soluble phase. These rare earth partitioning were mainly chosen mid-heavy RE elements, occupying above 60%, but not equal in the four phases. The mid-heavy RE elements were primarily enriched in the ion exchangeable phase up to 40%, while the containment of cerium dioxide is below 2 %. The cerium deficiency occurs in the ion exchangeable phase in weathered ore. It results from that the Ce^3＋ is oxidized into Ce^4＋ and changes into CeO2. For LN ore, the containment of Y is high in weathered ore because Y-minerals are abundant in original rock.     

嵌入式系统软硬件功能分配的研究

首先简要介绍了嵌入式系统及其传统的顺序设计方法和协同设计方法，然后论述了软硬件划分问题的由来、软硬件划分在协同设计中的地位、发展过程、主要问题及技术难点。     

非线性函数的自适应分区多神经网络学习及仿真实验

根据BP神经网络学习非线性函数的精度与所学函数的区间大小及变化率等有关，提出了一种非线性函数的自适应分区多神经网络学习方法，这种方法根据学习精度的要求，自适应地把所学函数分成若干区间，分别用一个BP神经网络去学习，从而使学习精度大大提高，最后，给出了学习一维函数和多维函数的仿真实例，其结果表明分区学习的精度可提高10倍以上。     

MCM划分的自组织神经网络

本文在提出一个直接和间接相联模块间相似性的表示方法的基础上，提出了一个基于自组织神经网络的性能驱动ＭＣＭ划分的神经学习方法。算法求解如何在高层设计中将功能模块分配到ＭＣＭ芯片中。算法不仅考虑了模块间的相似关系，还考虑了ＭＣＭ的版图结构；具有芯片间连线数目最少和时钟周期最短双重优化目标；能使连线尽量产生在相邻近的芯片之间；能满足时延、散热和面积约束。文中还提出了一个层次神经网络模型和面积约束下的ＭＣ     

Post-pass partitioning of signal processing programs

Symmetric multiprocessor systems are increasingly common, not only as high-throughput servers, but as a vehicle for executing a single application in parallel in order to reduce its execution latency. This article presents Pedigree, a compilation tool that employs a new partitioning heuristic based on the program dependence graph (PDG). Pedigree creates overlapping, potentially interdependent threads, each executing on a subset of the SMP processors that matches the thread’s available parallelism. A unified framework is used to build threads from procedures, loop nests, loop iterations, and smaller constructs. Pedigree does not require any parallel language support; it is post-compilation tool that reads in object code. The SDIO Signal and Data Processing Benchmark Suite has been selected as an example of real-time, latency-sensitive code. Its coarse-grained data flow parallelism is naturally exploited by Pedigree to achieve speedups of 1.63×/2.13× (mean/max) and 1.71×/2.41× on two and four processors, respectively. There is roughly a 20% improvement over existing techniques that exploit only data parallelism. By exploiting the unidirectional flow of data for coarse-grained pipelining, the synchronization overhead is typically limited to less than 6% for synchronization latency of 100 cycles, and less than 2% for 10 cycles. This research was supported by ONR contract numbers N00014-91-J-1518 and N00014-96-1-0347. We would like to thank the Pittsburgh Supercomputing Center for use of their Alpha systems.     

多探头 K 分割编码结构及循环码编码器研究

针对增量型数字编码器提出了一种多探头Ｋ分割编码结构及与之相应的一种增量型循环码编码器的基本结构，并研究了这种Ｋ分割方式下编码状态的特征及规律，确立了一种以二进制循环码为特征标志的编码方式．尤其是这种基于Ｋ分割编码结构原理的循环码编码器，在改进码盘结构及提高编码器综合性能方面具有显著的效果．