The Migration of Multi-tier E-commerce Applications to an Enterprise Java Environment

As technology evolves, many organizations face the problem of migrating legacy applications from one technology base to another. We report on a case study involving the migration of legacy code into the IBM® WebSphere® Commerce Suite product. Specifically, we focus on the problem of migrating applications that use traditional database access techniques to applications using the Enterprise JavaBean (EJB) programming model. Our results include a practical methodology that facilitates such migration, as well as a tool that supports this methodology. The tool has been released on IBM's alphaWorks site.     

Image coding quality assessment using fuzzy integrals with a three-component image model

Based on importance measures and fuzzy integrals, a new assessment method for image coding quality is presented in this paper. The proposed assessment is based on two subevaluations. In the first subevaluation, errors on edges, textures, and flat regions are computed individually. The errors are then assessed using an assessment function. A global evaluation with Sugeno fuzzy integral is then obtained based on the importance measure of edge, texture, and flat region. In the second subevaluation, an importance measure is first established depending on the types of regions where errors occur, a subtle evaluation is then obtained using Sugeno fuzzy integral on all pixels of the image. A final evaluation is obtained based on the two subevaluations. Experimental results show that this new image quality assessment closely approximates human subjective tests such as mean opinion score with a high correlation coefficient of 0.963, which is a significant improvement over peak signal-to-noise ratio, picture quality scale, and weighted mean square error, three other image coding quality assessment methods, which have the correlation coefficients of 0.821, 0.875, and 0.716, respectively.     

Clustering-based topical Web crawling using CFu-tree guided by link-context

Topical Web crawling is an established technique for domain-specific information retrieval. However, almost all the conventional topical Web crawlers focus on building crawlers using different classifiers, which needs a lot of labeled training data that is very difficult to label manually. This paper presents a novel approach called clustering-based topical Web crawling which is utilized to retrieve information on a specific domain based on link-context and does not require any labeled training data. In order to collect domain-specific content units, a novel hierarchical clustering method called bottom-up approach is used to illustrate the process of clustering where a new data structure, a linked list in combination with CFu-tree, is implemented to store cluster label, feature vector and content unit. During clustering, four metrics are presented. First, comparison variation （CV） is defined to judge whether the closest pair of clusters can be merged. Second, cluster impurity （CIP） evaluates the cluster error. Then, the precision and recall of clustering are also presented to evaluate the accuracy and comprehensive degree of the whole clustering process. Link-context extraction technique is used to expand the feature vector of anchor text which improves the clustering accuracy greatly. Experimental results show that the performance of our proposed method overcomes conventional focused Web crawlers both in Harvest rate and Target recall.     

QoS-aware placement of stream processing service

Many emerging online stream processing services require the consideration of quality of service (QoS), which is highly dependent on the placement of services at various hosts. This paper investigates the QoS-aware placement problems of stream processing services under different contexts. On condition that the client demands are stable, the QoS-aware placement problem aiming to minimize the cost when servers are CPU-uncapacitated, is equivalent to the set cover problem, and can be solved by a greedy algorithm with approximation factor O(log?n), where n is the number of clients. However, when CPU capacity constraints on servers are taken into account, the QoS-aware placement problem cannot be approximated unless P=NP. Therefore, we propose two heuristic algorithms: (1) ISCA (Iterated Set Cover-based Algorithm) and (2) KBA (Knapsack-Based Algorithm). We also consider the placement problem of client demands increasing over time. Two objectives, called extension factor and system lifetime, are proposed for demand increment-blind and increment-aware models respectively. Both of them can be solved by extending ISCA and KBA. The experimental results show that ISCA and KBA have distinct effects on different demand sizes. ISCA is more efficient when client demands are relatively small, while KBA performs better for larger demands.     

Biophotonic probes for bio-detection and imaging

The rapid development of biophotonics and biomedical sciences makes a high demand on photonic structures to be interfaced with biological systems that are capab...     

PDA用于注射液中微粒检测的研究

本文以激光相位多普勒（ＰＤＡ）技术为基础,利用ＰＤＡ信号探测器及高速信号的处理系统,实现了注射液中不溶性微粒的尺寸分布检测,对ＰＤＡ技术的实用化研究进行了有益的探索。     

微扰理论总结

电磁兼容数值仿真需要建立电子设备的仿真模型,但是实际电子设备模型比较复杂,包括有大量的微小结构,如各种安装凸台、凹槽等.如果按照实际的模型建立仿真模型会耗费大量的人力物力.同时复杂的模型会使计算量急剧的增加,过于复杂的模型也会导致网格的畸变,导致错误的仿真结果.因此在电磁兼容仿真建模过程中,必须对电子设备的仿真模型加以简化或等效处理.本文基于国内外对微扰问题研究,给出电子设备建模过程中模型简化的基本原理,即微扰理论.并对以后的研究提出相关的思路和方法.     

Design optimization and cold RF test of a 2.6-cell cryogenic RF gun

To further improve the performance of acceler-ators, the first cryogenic normal-conducting RF gun in China was designed and manufactured. As a new and attractiv...     

氧化混凝法处理苎麻脱胶煮炼废水的试验研究

探讨了以Fenton试剂和石灰对苎麻脱胶煮炼废水进行氧化混凝处理的方法.试验表明,当FeSO4·7H20、H2O2(质量分数30%)、饱和石灰乳的投加量分别为3 g/L、3 mL/L和4 mL/L时,CODcr的去除率>50%,色度去除率>90%.更重要的是,处理后出水可部分回用于煮炼生产,从而节约生产用碱量,减少废水排放量,还可提高废水可生化性,为后续生物处理创造条件.该处理方法是一种清洁生产处理方法,具有较广阔的应用前景.