A Novel Geometric Algorithm for Blind Image Restoration Based on High-Dimensional Space

A novel geometric algorithm for blind image restoration is proposed in this paper, based on High-Dimensional Space Geometrical Informatics (HDSGI) theory. In this algorithm every image is considered as a point, and the location relationship of the points in high-dimensional space, i.e. the intrinsic relationship of images is analyzed. Then geometric technique of "blurring-blurring-deblurring" is adopted to get the deblurring images. Comparing with other existing algorithms like Wiener filter, super resolution image restoration etc., the experimental results show that the proposed algorithm could not only obtain better details of images but also reduces the computational complexity with less computing time. The novel algorithm probably shows a new direction for blind image restoration with promising perspective of applications.

An Enhanced Particle Swarm Optimization Algorithm

Particle Swarm Optimization (PSO) algorithm is often used for finding optimal solution, but it easily entraps into the local extremum in later evolution period. Based on improved chaos searching strategy, an enhanced particle swarm optimization algorithm is proposed in this study. When particles get into the local extremum, they are activated by chaos search strategy, where the chaos search area is controlled in the neighborhood of current optimal solution by reducing search area of variables. The new algorithm not only gets rid of the local extremum effectively but also enhances the precision of convergence significantly. Experiment results show that the proposed algorithm is better than standard PSO algorithm in both precision and stability.

一种任务类型敏感的J2EE事务调度算法

J2EE(Java 2 platform enterprise edition)是构建分布式企业应用的基础中间件平台,当前的J2EE事务对资源的访问调度仍然是简单的先来先服务策略,导致服务器负载很重时,次要任务和关键任务争夺有限的资源,降低了关键任务的性能与成功率.为此,有必要识别任务类型,在资源不足时优先保证关键任务事务的执行.但提交给J2EE的事务基于交互方式执行,且缺乏必要的调度信息,因而不能简单地沿用已有的优先级驱动调度算法.提出一种新的事务调度算法TMPBP(threaded multi-queue priority-based protocol),该算法能够安全、有效地提高系统重负载情况下关键事务的服务质量,防止饥饿和优先级倒置.TMPBP包含了一种新的启发式优先级分派算法HRS(heuristic resource statistics),可以在调度信息缺乏的J2EE环境下动态识别关键事务.结果表明,通过合理地选择参数,TMPBP算法能够显著地提高关键事务的服务质量.

A shortest path algorithm for moving objects in spatial network databases

One of the most important kinds of queries in Spatial Network Databases (SNDB) to support location-based services (LBS) is the shortest path query. Given an object in a network, e.g. a location of a car on a road network, and a set of objects of interests, e.g. hotels,gas station, and car, the shortest path query returns the shortest path from the query object to interested objects. The studies of shortest path query have two kinds of ways, online processing and preprocessing. The studies of preprocessing suppose that the interest objects are static. This paper proposes a shortest path algorithm with a set of index structures to support the situation of moving objects. This algorithm can transform a dynamic problem to a static problem. In this paper we focus on road networks. However, our algorithms do not use any domain specific information, and therefore can be applied to any network. This algorithm’s complexity is O(klog2 i), and traditional Dijkstra’s complexity is O((i + k)2).

a shortest path algorithm for moving objects in spatial network databases

中国计算机学会

a simple but effective improvement to the plumb-line algorithm

Emporiki Bank; Microsoft; Alpha Bank