Multiresolution Hierarchies (MH) and Directed Acyclic Graphs (DAG) are two recent approaches for the compression of highresolution shadow information. In this paper, we introduce Merged Multiresolution Hierarchies (MMH), a novel data structure that unifies both concepts. An MMH leverages both hierarchical homogeneity exploited in MHs, as well as topological similarities exploited in DAG represe...

One of the challenges in reliable multicast is approximating or replicating TCP’s congestion control algorithm. This has led to various proposals to adapt TCP itself for use over multicast. The drawback of these multicast TCP services is that they place significant processing load on the sender and they fail to deal with the problem of ACK implosion. This paper shows how concast, a network-laye...

The design of Adaptive Hypermedia is a difficult task which can be made easier if generic systems and AH creators’ models are reused. We address this design problem in the setting of the GLAM platform only made up of generic components. We present a rule-based approach helping an AH creator in reusing its user and domain models to create a specific adaptive hypermedia. This semi-automatic appro...

SPECIAL ISSUE PAPERS Effective Sparse Dynamic Programming Algorithms for Merged and Block Merged LCS Problems AHM Mahfuzur Rahmana and M. Sohel Rahmana An Efficient and Scalable Approach for Ontology Instance Matching Rudra Pratap Deb Nath, Hanif Seddiqui, and Masaki Aono Longest Common Subsequence Problem for Run-Length-Encoded Strings Shegufta Bakht Ahsan, Syeda Persia Aziz, and M. Sohel Rahm...

Social networking provides opportunities to expand the nature of existing applications and user activities in cyberspace. Consider the idea of “social TV”. Along with these opportunities to combine activities such as social networking and TV or entertainment, comes an interesting set of challenges to the privacy of identity information. In this paper we will examine a key set of these challenge...

The employment of optimistic model versioning systems allows multiple developers of a team to work independently on their local copies of a software model. The merging process towards one consolidated version obviously turns out to be error-prone and time-consuming when performed without any tool support. Recently, several sophisticated approaches for model merging have been presented. However,...

This paper investigates the profitability and locational effects of mergers when firms play a Cournot game and compete in spatially differentiated markets. A two-firm merger is generally profitable in these types of markets because the merged partners can coordinate their location decisions. The merged firm locates its plants outside the market quartiles with distance from the market center bei...

Given a pair of merging sequences A and B, and a target sequence T , the merged longest common subsequence (MLCS) problem is to find out a longest common subsequence (LCS) between sequences E(A,B) and T , where E(A,B) is obtained from merging two subsequences of A and B. In this paper, we propose an algorithm for solving the MLCS problem in O(L(r − L + 1)m) time, where r and L denote the length...

The multiple altimeter missions have not only advanced our knowledge of ocean circulation, ice sheet topography, and global climate, but also improved the accuracy of altimetric measurements by cross-calibration and validation. In this paper, one year’s simultaneous maps of sea level anomaly (MSLA) data obtained from four altimeters, Envisat, Geosat Follow-On (GFO), Jason-1, and TOPEX/Poseidon ...