Speed-up fractal image compression with a fuzzy classifier

This paper presents a fractal image compression scheme incorporated with a fuzzy classifier that is optimized by a genetic algorithm. The fractal image compression scheme requires to find matching range blocks to domain blocks from all the possible division of an image into subblocks. With suitable classification of the subblocks by a fuzzy classifier we can reduce the search time for this matching process so as to speedup the encoding process in the scheme. Implementation results show that by introducing three image classes and using fuzzy classifier optimized by a genetic algorithm the encoding process can be speedup by about 40% of an unclassified encoding system.     

Synthesis,characterization, and electrical properties of polypyrrole/multiwalled carbon nanotube composites

Size‐controllable polypyrrole (PPy)/multiwalled carbon nanotube (MWCNT) composites have been synthesized by in situ chemical oxidation polymerization directed by various concentrations of cationic surfactant cetyltrimethylammonium bromide (CTAB). Raman spectra, FTIR, SEM, and TEM were used to characterize their structure and morphology. These results showed that the composites are core (MWCNT)–shell (PPy) tubular structures with the thickness of the PPy layer in the range of 20–40 nm, depending on the concentration of CTAB. Raman and FTIR spectra of the composites are almost identical to those of PPy alone. The electrical conductivities of these composites are 1–2 orders of magnitude higher than those of PPy without MWCNTs. © 2006 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 44: 6449–6457, 2006     

韧性金属裂纹尖端损伤区内应变场测量——数字散斑相关法应用

本文用数字散斑相关方法测量了五种不同幂硬化指数韧性金属材料(铝和铜),双边裂纹尖端细观区域内应变场.对所得结果用韧性损伤模型进行了分析.在此法中以金属自然表面结构为散斑场,不同加载状态的散斑场进行比较,得到相对变形与应变.图象之间相关性 C 是变形参数或是位移及其导数的泛函.使其相关性 C 取最大值的试凑变形即为其真实变形场.这一方法在细观测量中应用得到满意的结果.     

数字化战场的技术体系结构

阐述了信息制胜战中数字战场的三种体系结构（作战体系结构、系统体制结构与技术体系结构）及信息系统技术体系近几年的发展；介绍了信息化战场提出的几种技术体系结构，进而分析指出了数字化战场发展过程中所需要开发的各种信息业务和应当注意加强研究的技术方面。     

公安110报警指挥系统组网设计

１１０是电话网中的匪警特服号，现代信息化社会的发展要求１１０接警响应迅速而准确，本文介绍了公安１１０报警指挥系统的组成原理，给出了该系统与公共市话网和公安专网的组网实现方法，并对工程设计中的系统可靠性问题进行了详细的讨论，该系统也可用于１１９报警等其待服业务。     

On the average length of lexicographic paths

A bound is given for the average length of a lexicographic path, a definition that is motivated by degeneracies encountered when using the randomized simplex method.     

两种计算吸光光度法同时测定钙镁

研究了在pH10．5的硼砂-氢氧化钾缓冲溶液和乙醇的增敏作用条件下，偶氮氯膦Ⅰ与钙、镁的吸收特性，建立了多波长光度法同时测定钙和镁的方法。采用两种矩阵算法对试验数据进行处理，并对结果进行比较和分析。钙和镁含量在0～25μg／25ml范围内用计算法Ⅱ能得到准确结果。     

并行“冒泡”排序算法的改进

并行“冒泡”排序算法的改进黄干平（武汉大学计算机科学系,武汉,４３００７２）关键词排序,并行算法,冒泡中国法分类号ｗ３０１．６ＰＢＳＭ并行排序算法是对ＫａｚｕｈｉｒｓＳａｄｏ和ＹｏｓｈｉｈｉｄｅＩｇａｒａｓｈ的并行“冒泡’书ｒ序算法’“的改进,其并行...     

Approximate minimum-cost multicommodity flows in\tilde O(ɛ −2 KNM) timetime

We show that an ε-approximate solution of the cost-constrainedK-commodity flow problem on anN-nodeM-arc network,G can be computed by sequentially solving O(K(? ^?2+logGK) logGM log (G? ^?1 GK)) single-commodity minimum-cost flow problems on the same network. In particular, an approximate minimum-cost multicommodity flow can be computed in $\tilde O$ (G? ^?2 GKNM) running time, where the notation Õ(·) means “up to logarithmic factors”. This result improves the time bound mentioned by Grigoriadis and Khachiyan [4] by a factor ofM/N and that developed more recently by Karger and Plotkin [8] by a factor of? ^?1. We also provide a simple $\tilde O$ (NM)-time algorithm for single-commodity budget-constrained minimum-cost flows which is $\tilde O$ (? ^?3) times faster than the algorithm developed in the latter paper.