What kind of operations can we perform effectively (without full unpacking) with compressed texts? In this paper we consider three fundamental problems: (1) check the equality of two compressed texts, (2) check whether one compressed text is a substring of another compressed text, and (3) compute the number of different symbols (Hamming distance) between two compressed texts of the same length....

Indexing and editing digital video directly in the compressed domain offer many advantages in terms of storage efficiency and processing speed. We have designed automatic tools in the compressed domain for extracting key visual features such as scene cut, dissolve, camera operations (zoom, pan), and moving object detection and tracking. In addition, we have developed algorithms to solve the dec...

Aiming to advance the coning algorithm performance of strapdown inertial navigation systems, a new half-compressed coning correction structure is presented. The half-compressed algorithm structure is analytically proven to be equivalent to the traditional compressed structure under coning environments. The half-compressed algorithm coefficients allow direct configuration from traditional compre...

In this paper we investigate the structure of the shortest co-cycle base(or SCB in short) of connected graphs, which are related with map geometries, i.e., Smarandache 2dimensional manifolds. By using a Hall type theorem for base transformation, we show that the shortest co-cycle bases have the same structure (there is a 1-1 correspondence between two shortest co-cycle bases such that the corre...

nowadays, increased attention has been focused on internal combustion engine fuels. regarding environmental effects of internal combustion engines particularly as sources of pollution and depletion of fossil fuels, compressed natural gas has been introduced as an alternative to gasoline and diesel fuels in many applications. a high research octane number which allows combustion at higher compre...