A simplified cascade current‐source inverter interconnected to a single‐phase three‐wire distribution system and its application to electric energy storage systems with batteries

A novel current source inverter system interconnected to the single‐phase grid is proposed. It has the same construction as the conventional three‐phase current source inverter that is interconnected to the single‐phase three‐wire distribution system. Though the proposed circuit has no output transformer, it can be equivalently performed as the single‐phase double cascade inverter by diverting the pole transformer in the utility system. By controlling the appropriate scheme, the output currents can be obtained as the five‐level waveforms and their distortions can be decreased sufficiently. It is applied to the interactive electric energy storage system with batteries and the basic discharging characteristics are discussed experimentally. © 2004 Wiley Periodicals, Inc. Electr Eng Jpn, 150(2): 50–61, 2005; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/eej.10380     

用熔融还原的方法从浸钒渣中提镓——碳饱和情况下的熔融还原过程

用通用旋转组合设计的方法得到了浸钒渣在饱和碳的熔融还原过程中镓的还原提取率与温度,时间及CaO的加入量关系的非线性数学模型。用非线性优化的方法并综合考虑Fe,Mn的回收,得到了最优的工艺条件及结果;用Langmuir—Knudsen方程推算了镓在铁液中的理论挥发量与时间的关系,与由本模型得到的关系式是一致的。     

二进制分辨矩阵在连续属性约简中的研究

针对二进制分辨矩阵无法处理连续型数据,提出一种基于邻域的改进二进制分辨矩阵及其属性约简方法。实验结果表明,与先数据离散化,后属性约简的方法相比,利用文中方法提取出的特征属性的分类能力更高。     

一种相容决策表的属性值与属性约简方法

针对相容决策表,另辟一种数据约简思路,与传统数据约简方法不同的是,本文方法考虑属性值约简与属性约简之间的关联,该方法首先进行属性值约简,然后再进行属性约简,本文并给予了充分的证明,而普通的方法并没有考虑它们之间的联系,并有许多冗余的比较操作。     

Improved results on frequency‐weighted balanced truncation and error bounds

In this paper, we present some new results on frequency‐weighted balanced truncation which is a significant improvement on Lin and Chiu's frequency‐weighted balanced truncation technique. The reduced‐order models, which are guaranteed to be stable in the case of double‐sided weighting, are obtained by direct truncation. Two sets of simple, elegant and easily calculatable a priori error bounds are also derived. Numerical examples and comparison with other well‐known techniques show the effectiveness of the proposed technique. Copyright © 2011 John Wiley & Sons, Ltd.     

An efficient IP address lookup algorithm based on a small balanced tree using entry reduction

Due to a tremendous increase in internet traffic, backbone routers must have the capability to forward massive incoming packets at several gigabits per second. IP address lookup is one of the most challenging tasks for high-speed packet forwarding. Some high-end routers have been implemented with hardware parallelism using ternary content addressable memory (TCAM). However, TCAM is much more expensive in terms of circuit complexity as well as power consumption. Therefore, efficient algorithmic solutions are essentially required to be implemented using network processors as low cost solutions.Among the state-of-the-art algorithms for IP address lookup, a binary search based on a balanced tree is effective in providing a low-cost solution. In order to construct a balanced search tree, the prefixes with the nesting relationship should be converted into completely disjointed prefixes. A leaf-pushing technique is very useful to eliminate the nesting relationship among prefixes [V. Srinivasan, G. Varghese, Fast address lookups using controlled prefix expansion, ACM Transactions on Computer Systems 17 (1) (1999) 1-40]. However, it creates duplicate prefixes, thus expanding the search tree.This paper proposes an efficient IP address lookup algorithm based on a small balanced tree using entry reduction. The leaf-pushing technique is used for creating the completely disjointed entries. In the leaf-pushed prefixes, there are numerous pairs of adjacent prefixes with similarities in prefix strings and output ports. The number of entries can be significantly reduced by the use of a new entry reduction method which merges pairs with these similar prefixes. After sorting the reduced disjointed entries, a small balanced tree is constructed with a very small node size. Based on this small balanced tree, a native binary search can be effectively used in address lookup issue. In addition, we propose a new multi-way search algorithm to improve a binary search for IPv4 address lookup. As a result, the proposed algorithms offer excellent lookup performance along with reduced memory requirements. Besides, these provide good scalability for large amounts of routing data and for the address migration toward IPv6. Using both various IPv4 and IPv6 routing data, the performance evaluation results demonstrate that the proposed algorithms have better performance in terms of lookup speed, memory requirement and scalability for the growth of entries and IPv6, as compared with other algorithms based on a binary search.     

使用Dreamweaver结合ASP技术构建企业科技与节能管理系统

节能减排和科技创新是我国保持可持续发展的重要保障,国家高度重视这两项工作,十一五以来陆续出台了鼓励节能减排和科技创新的相关鼓励政策。节能与科技管理系统是企业展示自身节能减排和科技创新成果和经验的窗口,在节能减排和科技创新工作中发挥着重要作用。本文介绍了作者利用Dreamweaver和ASP技术构建企业节能与科技管理系统的一些认识和经验。     

STUDY ON THE VARIATION MECHANISM OF CARBON CONTENT OF LIQUID IRON IN MELTING GASIFIER

This paper studied the changing principles of carbon content in direct reduction iron (DRI) and liquid iron in the COREX melting gasifier. Under the normal working conditions of experimental equipment, liquid nitrogen was poured into the melting gasifier from its tuyere to cool down quickly. And then seven cross sections were made to study the carburization reaction and its characteristics of the solid iron and the liquid iron, and also the reaction of carbon between the slag and the metal. According to the results, the influences of the thickness of the semi-coke layer and the temperature on the carbon content of liquid iron in the COREX melting gasifier were confirmed.     

铸造用CO2硬化冷芯盒材料及工艺的发展

铸造用CO2硬化粘结剂系统具有气硬冷芯盒的优点,同时又具有环保方面的优势。主要介绍了水玻璃-CO2法、聚丙烯酸钠-CO2法、酚醛树脂-CO2法三种工艺。这些工艺方法近年来国内外研究较多,并且取得了很大进展。     

协同处置系统优化节能降耗的生产实践

公司协同处置项目植入热盘炉后,烧成系统运行稳定性变差,热耗上升,处置废弃物时标煤耗最高上升4kg/t.cl以上。对窑尾烟室缩口,C4下料管及窑尾分解炉燃料喷入点进行综合诊断分析,实施优化改造措施,分解炉内煤粉燃烧环境得到改善,系统通风阻力降低,标煤耗降低到103 kg/t.cl以下,与热盘炉植入前相当。