An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
In this paper, we consider an interesting variant of the facility location problem called uncapacitated facility location problem with penalties (UFLWP, for short) in which each client can be either assigned to some opened facility or rejected by paying a penalty. Existing approaches [M. Charikar, S. Khuller, D. Mount, G. Narasimhan, Algorithms for facility location problems with outliers,  2001, p. 642] and [K. Jain, M. Mahdian, E. Markakis, A. Saberi, V. Vazirani, Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP,  (2003) 795] for this variant of facility location problem are all based on primal-dual method. In this paper, we present an efficient linear programming (LP) rounding based approach to show that LP rounding techniques are equally capable of solving this variant of facility location problem. Our algorithm uses a two-phase filtering technique (generalized from Lin and Vitter's [@?-approximation with minimum packing constraint violation, ) to identify those to-be-rejected clients and open facilities for the remaining ones. Our approach achieves an approximation ratio of 2+2/e (~2.736) which is worse than the best approximation ratio of 2 achieved by the much more sophisticated dual fitting technique [K. Jain, M. Mahdian, E. Markakis, A. Saberi, V. Vazirani, Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP,  (2003) 795], but better than the approximation ratio of 3 achieved by the primal-dual method [M. Charikar, S. Khuller, D. Mount, G. Narasimhan, Algorithms for facility location problems with outliers,  2001, p. 642]. Our algorithm is simple, natural, and can be easily integrated into existing LP rounding based algorithms for facility location problem to deal with outliers. problem to deal with outliers.

title: Efficient Algorithms for Determining 3-D Bi-Plane Imaging Geometry
abstract: Biplane projection imaging is one of the primary methods for imaging and visualizing the cardiovascular system in medicine. A key problem in such a technique is to determine the imaging geometry (i.e., the relative rotation and translation) of two projections so that the 3-D structure can be accurately reconstructed. Based on interesting observations and efficient geometric techniques, we present in this paper new algorithmic solutions for this problem. Comparing with existing optimization-based approaches, our techniques yield better accuracy and have bounded execution time, thus is more suitable for on-line applications. Our techniques can easily detect outliers to further improve the accuracy.

title: Power domination in block graphs
abstract: The problem of monitoring an electric power system by placing as few measurement devices in the system as possible is closely related to the well-known domination problem in graphs. In 2002, Haynes et al. considered the graph theoretical representation of this problem as a variation of the domination problem. They defined a set S to be a power dominating set of a graph if every vertex and every edge in the system is monitored by the set S (following a set of rules for power system monitoring). The power domination number γp(G) of a graph G is the minimum cardinality of a power dominating set of G. This problem was proved NP-complete even when restricted to bipartite graphs and chordal graphs. In this paper, we present a linear time algorithm for solving the power domination problem in block graphs. As an application of the algorithm, we establish a sharp upper bound for power domination number in block graphs and characterize the extremal graphs.

title: Modeling with cubic A-patches
abstract: We present a sufficient criterion for the Bernstein-Bezier (BB) form of a trivariate polynomial within a tetrahedron, such that the real zero contour of the polynomial defines a smooth and single sheeted algebraic surface patch. We call this an A-patch. We present algorithms to build a mesh of cubic A-patches to interpolate a given set of scattered point data in three dimensions, respecting the topology of any surface triangulation T of the given point set. In these algorithms we first specify "normals" on the data points, then build a simplicial hull consisting of tetrahedra surrounding the surface triangulation T and finally construct cubic A-patches within each tetrahedron. The resulting surface constructed is at (tangent plane) continuous and single sheeted in each of the tetrahedra. We also show how to adjust the free parameters of the A-patches to achieve both local and global shape control.

title: A Speaker Tracking Algorithm Based on Audio and Visual Information Fusion Using Particle Filter
abstract: Object tracking by sensor fusion has become an active research area in recent years, but how to fuse various information in an efficient and robust way is still an open problem. This paper presents a new algorithm for tracking speaker based on audio and visual information fusion using particle filter. A closed-loop architecture with reliability of each individual tracker is adopted, and a new method for data fusion and reliability adjustment is proposed. Experiments show the new algorithm is efficient in fusing information and robust to noise.

title: Building the Software Infrastructure for Smart Classroom: From Open Agent Architecture (OAA) to Smart Platform
abstract: Smart Classroom is a Smart Space developed to enhance tele-education practice. This paper describes the considerations of bringing forward Smart Platform as the software infrastructure of Smart Classroom system, abandoning the former implementation based on OAA. As a multi-agent system for Smart Space, Smart Platform encompasses following features: spontaneous discovery of runtime environment, automatic management and resolving of agent dependencies, combination of delegated communication and peer-to-peer communication, etc. In addition, a surrogate agent on Smart Platform and Metaglue from MIT is now being developed to inter-connect Smart Classroom with MIT's Intelligent Room to extend their functionality.

title: Discrete Laplace-Beltrami operators and their convergence
abstract: The convergence property of the discrete Laplace-Beltrami operators is the foundation of convergence analysis of the numerical simulation process of some geometric partial differential equations which involve the operator. In this paper we propose several simple discretization schemes of Laplace-Beltrami operators over triangulated surfaces. Convergence results for these discrete Laplace-Beltrami operators are established under various conditions. Numerical results that support the theoretical analysis are given. Application examples of the proposed discrete Laplace-Beltrami operators in surface processing and modelling are also presented.