Fabrication of multi-walled carbon nanotube reinforced polyelectrolyte hollow nanofibers by electrospinning

Hybrid hollow multi-walled carbon nanotubes (MWCNTs)/polyelectrolytes (PE) nanofibers were prepared by a combination of the electrospinning method and layer-by-layer (LbL) technique. The mixed polystyrene (PS)/MWCNTs nanofibers were obtained by electrospinning method, which were employed as templates to self-assembly multilayered polyelectrolytes by LbL technique. Hollow MWCNTs/PE nanofibers were obtained by selectively removed part of the template: PS, which is confirmed by Raman spectra, transmission electron microscopy (TEM) and scanning electron microscopy (SEM).     

S盒设计中的一种新准则

本文提出了强扩散准则,强雪崩效应以及扩散效应的逼近优势等相关概念,给出了差分均匀性与强k阶扩散准则之间的相互关系,利用给出的设计准则改进了Rijndael密码的S盒。     

择形催化合成2,6-DMN的研究进展

介绍了2,6-二甲基萘(2,6-DMN)的制备方法,详细论述了萘、甲基萘在分子筛催化剂上择形催化合成2,6-DMN的研究进展,提出了择形催化合成2,6-DMN的研究方向。     

憎水性栀子蓝色素制备的研究

以浓盐酸为催化剂,采用乙酸酐酯化处理水溶性栀子蓝色素,制备了憎水性栀子蓝色素.探讨了栀子蓝色素与乙酸酐料液比、反应时间和反应温度等因素对憎水性栀子蓝色素色价的影响.结果表明:采用料液比1:20,在常温下反应4 h,为制备憎水性栀子蓝色素的最优条件.同时,通过红外光谱、可见吸收光谱及溶解性对栀子蓝色素的酯化改性进行了初步的探讨.     

基于OpenGL和MFC的石油井管道的绘制

介绍了O penGL的知识和石油井的基本概念,利用O penGL实现石油井管道的绘制,包括石油井数据的变换和管道起始点的跟踪和角度的旋转。纹理光照效果增强图形生动性,交互操作改变图形视角。并且利用DAO数据库和L istv iew控件实现数据保存和修改。该程序能够完成石油井的管道绘制和数据保存。     

Tri-Gate Bulk MOSFET Design for CMOS Scaling to the End of the Roadmap

A tri-gate bulk MOSFET design utilizing a low-aspect-ratio channel is proposed to provide an evolutionary pathway for CMOS scaling to the end of the roadmap. 3-D device simulations indicate that this design offers the advantages of a multi-gate FET (reduced variability in performance and improved scalability) together with the advantages of a conventional planar MOSFET (low substrate cost and capability for dynamic threshold-voltage control).     

Evolving artificial neural network ensembles

Using a coordinated group of simple solvers to tackle a complex problem is not an entirely new idea. Its root could be traced back hundreds of years ago when ancient Chinese suggested a team approach to problem solving. For a long time, engineers have used the divide-and-conquer strategy to decompose a complex problem into simpler sub-problems and then solve them by a group of solvers. However, knowing the best way to divide a complex problem into simpler ones relies heavily on the available domain knowledge. It is often a manual process by an experienced engineer. There have been few automatic divide-and-conquer methods reported in the literature. Fortunately, evolutionary computation provides some of the interesting avenues to automatic divide-and-conquer methods. An in-depth study of such methods reveals that there is a deep underlying connection between evolutionary computation and ANN ensembles. Ideas in one area can be usefully transferred into another in producing effective algorithms. For example, using speciation to create and maintain diversity had inspired the development of negative correlation learning for ANN ensembles, and an in-depth study of diversity in ensembles. This paper will review some of the recent work in evolutionary approaches to designing ANN ensembles.     

Structured optimal and robust control with multiple criteria: a convex solution

In this paper, the design of controllers that incorporate structural and multiobjective performance requirements is considered. The control structures under study cover nested, chained, hierarchical, delayed interaction and communications, and symmetric systems. Such structures are strongly related to several modern-day and future applications including integrated flight propulsion systems, platoons of vehicles, micro-electro-mechanical systems, networked control, control of networks, production lines and chemical processes. It is shown that the system classes presented have the common feature that all stabilizing controllers can be characterized by convex constraints on the Youla-Kucera parameter. Using this feature, a solution to a general optimal performance problem that incorporates time domain and frequency domain constraints is obtained. A synthesis procedure is provided which at every step yields a feasible controller together with a measure of its performance with respect to the optimal. Convergence to the optimal performance is established. An example of a multinode network congestion control problem is provided that illustrates the effectiveness of the developed methodology.     

Evaluation of image similarity by histogram intersection

Colour is the most widely used attribute in image retrieval and object recognition. A technique known as histogram intersection has been widely studied and is considered to be effective for color‐image indexing. The key issue of this algorithm is the selection of an appropriate color space and optimal quantization of the selected color space. The goal of this article is to measure the model performance in predicting human judgment in similarity measurement for various images, to explore the capability of the model with a wide set of color spaces, and to find the optimal quantization of the selected color spaces. Six color spaces and twelve quantization levels are involved in evaluating the performance of histogram intersection. The categorical judgment and rank order experiments were conducted to measure image similarity. The CIELAB color space was found to perform at least as good as or better than the other color spaces tested, and the ability to predict image similarity increased with the number of bins used in the histograms, for up to 512 bins (8 per channel). With more than 512 bins, further improvement was negligible for the image datasets used in this study. © 2005 Wiley Periodicals, Inc. Col Res Appl, 30, 265–274, 2005; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/col.20122