An enhanced Web page change detection approach based on limiting similarity computations to elements of same type

This paper describes an efficient Web page detection approach based on restricting the similarity computations between two versions of a given Web page to the nodes with the same HTML tag type. Before performing the similarity computations, the HTML Web page is transformed into an XML-like structure in which a node corresponds to an open-closed HTML tag. Analytical expressions and supporting experimental results are used to quantify the improvements that are made when comparing the proposed approach to the traditional one, which computes the similarities across all nodes of both pages. It is shown that the improvements are highly dependent on the diversity of tags in the page. That is, the more diverse the page is (i.e., contains mixed content of text, images, links, etc.), the greater the improvements are, while the more uniform it is, the lesser they are.     

Distributed top-<Emphasis Type="Italic">k</Emphasis> aggregation queries at large

Top-k query processing is a fundamental building block for efficient ranking in a large number of applications. Efficiency is a central issue, especially for distributed settings, when the data is spread across different nodes in a network. This paper introduces novel optimization methods for top-k aggregation queries in such distributed environments. The optimizations can be applied to all algorithms that fall into the frameworks of the prior TPUT and KLEE methods. The optimizations address three degrees of freedom: 1) hierarchically grouping input lists into top-k operator trees and optimizing the tree structure, 2) computing data-adaptive scan depths for different input sources, and 3) data-adaptive sampling of a small subset of input sources in scenarios with hundreds or thousands of query-relevant network nodes. All optimizations are based on a statistical cost model that utilizes local synopses, e.g., in the form of histograms, efficiently computed convolutions, and estimators based on order statistics. The paper presents comprehensive experiments, with three different real-life datasets and using the ns-2 network simulator for a packet-level simulation of a large Internet-style network.     

Interlayer cooling potential in vertically integrated packages

The heat-removal capability of area-interconnect-compatible interlayer cooling in vertically integrated, high-performance chip stacks was characterized with de-ionized water as coolant. Correlation-based predictions and computational fluid dynamic modeling of cross-flow heat-removal structures show that the coolant temperature increase due to sensible heat absorption limits the cooling performance at hydraulic diameters ≤200 μm. An experimental investigation with uniform and double-side heat flux at Reynolds numbers ≤1,000 and heat transfer areas of 1 cm² was carried out to identify the most efficient interlayer heat-removal structure. The following structures were tested: parallel plate, microchannel, pin fin, and their combinations with pins using in-line and staggered configurations with round and drop-like shapes at pitches ranging from 50 to 200 μm and fluid structure heights of 100–200 μm. A hydrodynamic flow regime transition responsible for a local junction temperature minimum was observed for pin fin in-line structures. The experimental data was extrapolated to predict maximal heat flux in chip stacks having a 4-cm² heat transfer area. The performance of interlayer cooling strongly depends on this parameter, and drops from >200 W/cm² at 1 cm² and >50 μm interconnect pitch to <100 W/cm² at 4 cm². From experimental data, friction factor and Nusselt number correlations were derived for pin fin in-line and staggered structures.     

Optimal assembly plan generation: a simplifying approach

The main difficulty in the overall process of optimal assembly plan generation is the great number of different ways to assemble a product (typically thousands of solutions). This problem confines the application of most existing automated planning methods to products composed of only a limited number of components. The presented method of assembly plan generation belongs to the approach called “disassembly” and is founded on a new representation of the assembly process, with introduction of a new concept, the equivalence of binary trees. This representation allows to generate the minimal list of all non-redundant (really different) assembly plans. Plan generation is directed by assembly operation constraints and plan-level performance criteria. The method was tested for various assembly applications and compared to other generation approaches. Results show a great reduction in the combinatorial explosion of the number of plans. Therefore, this simplifying approach of assembly sequence modeling allows to handle more complex products with a large number of parts.     

Computational performance of a parallelized three-dimensional high-order spectral element toolbox

In this paper, a comprehensive performance review of an MPI-based high-order three-dimensional spectral element method C++ toolbox is presented. The focus is put on the performance evaluation of several aspects with a particular emphasis on the parallel efficiency. The performance evaluation is analyzed with the help of a time prediction model based on a parameterization of the application and the hardware resources. Two tailor-made benchmark cases in computational fluid dynamics (CFD) are introduced and used to carry out this review, stressing the particular interest for clusters with up to thousands of cores. Some problems in the parallel implementation have been detected and corrected. The theoretical complexities with respect to the number of elements, to the polynomial degree, and to communication needs are correctly reproduced. It is concluded that this type of code has a nearly perfect speedup on machines with thousands of cores, and is ready to make the step to next-generation petaFLOP machines.     

Finite element analysis on implicitly defined domains: An accurate representation based on arbitrary parametric surfaces

In this paper, we present some novel results and ideas for robust and accurate implicit representation of geometric surfaces in finite element analysis. The novel contributions of this paper are threefold: (1) describe and validate a method to represent arbitrary parametric surfaces implicitly; (2) represent arbitrary solids implicitly, including sharp features using level sets and boolean operations; (3) impose arbitrary Dirichlet and Neumann boundary conditions on the resulting implicitly defined boundaries. The methods proposed do not require local refinement of the finite element mesh in regions of high curvature, ensure the independence of the domain’s volume on the mesh, do not rely on boundary regularization, and are well suited to methods based on fixed grids such as the extended finite element method (XFEM). Numerical examples are presented to demonstrate the robustness and effectiveness of the proposed approach and show that it is possible to achieve optimal convergence rates using a fully implicit representation of object boundaries. This approach is one step in the desired direction of tying numerical simulations to computer aided design (CAD), similarly to the isogeometric analysis paradigm.     

MoSuMo: A Semantic Web service to generate electrostatic potentials across solvent excluded protein surfaces and binding pockets

Investigations of molecular interactions can benefit from knowledge of the regions that correspond to binding sites and electrostatic potentials across molecular surfaces. In support of simulations aimed at a coarser level of granularity than molecular dynamics, we have developed MoSuMo, a SADI-based Semantic Web service for generating molecular surfaces from a set of 3D atomic coordinates. MoSuMo's service input requires a Protein Data Bank (PDB) identifier from which it obtains the PDB entry and for which it generates electrostatic potentials as vertex values across a geometric mesh that represents the molecular surface. Service inputs and outputs are specified as restrictions on classes from the Semanticscience Integrated Ontology (SIO), which is formalized using the Web Ontology Language (OWL). Binding sites containing their ligands are identified and described as sub-collections of surface vertices. Thus, MoSuMo provides a semantic web service for investigating molecular interactions including visualization.     

Robust skeletonization using the discrete λ-medial axis

Medial axes and skeletons are notoriously sensitive to contour irregularities. This lack of stability is a serious problem for applications in e.g. shape analysis and recognition. In 2005, Chazal and Lieutier introduced the λ-medial axis as a new concept for computing the medial axis of a shape subject to single parameter filtering. The λ-medial axis is stable under small shape perturbations, as proved by these authors. In this article, a discrete λ-medial axis (DLMA) is introduced and compared with the recently introduced integer medial axis (GIMA). We show that DLMA provides measurably better results than GIMA, with regard to stability and sensibility to rotations. We give efficient algorithms to compute the DLMA, and we also introduce a variant of the DLMA which may be computed in linear-time.