Breaking the search space symmetry in partitioning problems: An application to the graph coloring problem

Many problems consist in splitting a set of objects into different groups so that each group verifies some properties. In practice, a partitioning is often encoded by an array mapping each object to its group numbering. In fact, the group number of an object does not really matter, and one can simply rename each group to obtain a new encoding. That is what we call the symmetry of the search space in a partitioning problem. This property may be prejudicial for optimization methods such as evolutionary algorithms (EA) which require some diversity during the search.     

视频编码新标准H.264中抗误码技术的研究

介绍了视频编码新标准———H .2 6 4中采用的几种抗误码技术 ,基于这些技术 ,新标准确保了压缩视频流在接收端的恢复质量。     

Tuning fuzzy power-system stabilizers in multi-machine systems by global optimization algorithms based on efficient domain partitions

In this paper, the problem of global tuning of fuzzy power-system stabilizers (FPSSs) present in a multi-machine power system in order to damp the power system oscillations is considered. In particular, it is formulated as a problem of global minimization of a multiextremal black-box function over a multidimensional hyperinterval. A global optimization technique, recently proposed, is used for solving the stated problem: the search hyperinterval is partitioned into smaller hyperintervals and the objective function is evaluated only at two vertices corresponding to the main diagonal of the generated hyperintervals, thus avoiding unnecessary ponderous simulations. Then, the performances of this technique are numerically compared with ones of a genetic algorithm (GA).     

Covering a string

We consider the problem of finding the repetitive structures of a given stringx. The periodu of the stringx grasps the repetitiveness ofx, sincex is a prefix of a string constructed by concatenations ofu. We generalize the concept of repetitiveness as follows: A stringw covers a stringx if there is a superstring ofx which is constructed by concatenations and superpositions ofw. A substringw ofx is called aseed ofx ifw coversx. We present anO(n logn)-time algorithm for finding all the seeds of a given string of lengthn.Partially supported by SERC Grants GR/F 00898 and GR/J 17844, NATO Grant CRG 900293, ESPRIT BRA Grant 7131 for ALCOMII, and MRC Grant G 9115730.Partially supported by MRC Grant G 9115730 and S.N.U. Posco Research Fund 94-15-1112.     

EFFECTIVE PARALLELIZATION TECHNIQUES FOR LOOP NESTS WITH NON-UNIFORM DEPENDENCES

The parallelism of loop nests with non-uniform dependences is difficult to extract and ineffectively explored by the existing parallelization schemes. In this paper, we propose new efficient techniques in extracting parallelism of loop nests with non-uniform dependences using their irregularity. By this way, current highly parallel multiprocessor systems such as multithreaded and clustering multiprocessor systems can be fully utilized. These four mechanisms are (a) parallelization part splitting, (b) partial parallelization decomposition, (c) irregular loop interchange and (d) growing pattern detection. They explore parallelisms of special parallel patterns for nested loops with non-uniform dependences. The loop transformations used in uniform loops are also applied in non-uniform dependence loops after legality tests. We apply the results of classical convex theory and detect special parallel patterns of dependence vectors. We also proposed an algorithm that combines above mechanisms to enhance parallelism. We demonstrate that our technique gives much better speedup and extracts more parallelism than the existing techniques. Thus, we are encouraged by these apparent enhancements to pursue further development.     

计算机硬盘坏磁道修复的思路与技巧

本文通过隐藏坏磁道分区的方法,着重介绍了硬盘坏磁道的修复技术及注意事项,同时还介绍了逻辑坏磁道、0磁道损坏的修复方法。     

Alkyd emulsions

Various aspects of alkyd emulsion technology have been investigated. The influence of alkyd oil length, acid value and hydroxyl number and type of surfactant used as emulsifier, on shear stability of alkyds emulsions have been studied. It was found that the acid value was the most important alkyd parameter, the stability increasing with increasing oil length. It is also shown that anionic surfactants give emulsions with small droplet sizes at lower concentrations than do nonionics. Polymerizable nonionic surfactants have been tested as emulsifiers and compared with conventional surfactants of the same hydrophilic lipophilic balance (HLB). It was found that surfactants capable of participating in the autoridative curing process give faster drying and improved film hardness compared with nonreactive surfactants. The distribution of driers between the alkyd phase and the water phase has been investigated. It was found that low pH and the use of hydrophilic anionic surfactants, such as sodium dodecyl sulphate, favour partitioning of cobalt into the aqueous phase which is unfavourable with respect to drying properties.     

一种基于序列计算的最近似K对数据搜索方案

多种应用场合需要寻找给定数据库中相似度最大的前k对数据.然而,由于应用领域需要处理的数据规模呈上升趋势,计算这样的最相似k对数据,难度非常大.提出了一种基于序列计算的最相似k对数据搜索方案,首先,将所有数据对分割成多个组,然后,提出了所有数据对分组算法和核心数据对分组算法,通过单独计算每个组中的最近似k对数据,从所有组的最近似k对数据中选择相似度最高的k对数据,进而正确地确定最近似k对数据.最后基于合成数据进行实验,性能评估结果验证了本文算法的有效性和可扩展性.     

Elemental partitioning,lattice misfit and creep behaviour of Cr containing γ′ strengthened Co base superalloys

Novel Cr containing Co-Al-W base superalloys were studied by atom probe tomography and neutron diffraction. Cr is found to predominantly partition to the γ matrix and decrease partitioning of W to γ′. Furthermore, Cr significantly enhances the γ′ volume fraction, decreases the γ/γ′ lattice misfit and deteriorates the creep resistance. Addition of Ni to the Cr containing alloys affects partitioning of W and Al, further decreases the lattice misfit and results in the formation of irregularly shaped precipitates. Al, W and Cr tend to occupy the ‘B'sublattice in the γ′-A₃B phase (L1₂ type), while Co and Ni reside in the ‘A' sublattice.     

感兴趣区域的非线性变换多描述编码

介绍一种基于感兴趣区域的非线性变换的多描述图像编码,能够与目前的标准图像压缩算法兼容,对图像的感兴趣区域进行更好的保护。由感兴趣区域的非线性几何变换产生冗余,对图像进行采样形成多描述编码。通过仿真实验,证实当图像在差错信道下传输而丢失描述时,该算法能够使图像感兴趣区域得到更好的恢复。