Novel synchronous coding schemes are introduced and relationships between optimal synchronous codes and Huffman codes are also discussed. Although the problem of existence of optimal synchronous codes has not been res...
详细信息
ISBN:
(纸本)0769515061;076951507X
Novel synchronous coding schemes are introduced and relationships between optimal synchronous codes and Huffman codes are also discussed. Although the problem of existence of optimal synchronous codes has not been resolved yet, we show that any synchronous code can consider as an optimal synchronous code for some information source and that there always exist optimal synchronous codes for the information source with a dyadic probability, distribution. Comparing with Huffman coding, the synchronous coding is used not only for statistical modeling but also for dictionary methods. Moreover, it is proven that breaking a synchronous code is NP-complete.
A large amount of on-line information resides on the invisible web - web pages generated dynamically from databases and other data sources hidden from the user. They are not indexed by a static URL but is generated wh...
详细信息
ISBN:
(纸本)076951507X
A large amount of on-line information resides on the invisible web - web pages generated dynamically from databases and other data sources hidden from the user. They are not indexed by a static URL but is generated when queries are asked via a search interface (we denote them as specialized search engines). In this paper we propose a system that is capable of automatically making use of these specialized engines to find information on the invisible web. We describe our overall architecture and process: from obtaining the search engines to picking the right engines to query. Experiments show that vie can find information that is not found by the traditional search engines.
Every year, millions of pupils take part in the baccalaureate examination and entrance examinations to universities or colleges in Vietnam. It is vital to keep the questions secret in order to maintain fairness and pr...
详细信息
XML is emerging as the "universal" language for semistructured data description/exchange, and new issues regarding the management of XML data, both in terms of performance and usability, are becoming critica...
详细信息
ISBN:
(纸本)076951507X
XML is emerging as the "universal" language for semistructured data description/exchange, and new issues regarding the management of XML data, both in terms of performance and usability, are becoming critical. The application of knowledge-based synthesization and compression methods (i.e. derivation of synthetic views and loss-less/lossy approximation of contents) can be extremely ben, eficial in this scenario. In this paper we present SqueezeX, a system for the synthesization/compression of XML data based on a multidimensional/classification-based interpretation of their schema and on the application of semantic-and type-oriented compression techniques.
To extract informative terms through known relevance information for query expansion is an important issue in the design of an effective text retrieval system. Various discriminant functions have been developed as a d...
详细信息
ISBN:
(纸本)0769515061;076951507X
To extract informative terms through known relevance information for query expansion is an important issue in the design of an effective text retrieval system. Various discriminant functions have been developed as a device for eliciting good terms. In this paper the notion of informativeness of terms is interpreted and discriminant functions are formalised both based on information-theoretic ideas for auromatic query expansion. Preliminary, results show that the approach adopted in this paper is worthy of continued investigation.
In this paper, e-words are used for coding k-ary trees with n internal nodes. The properties of e-words are discussed in depth, such as the necessary and sufficient condition of e-words, and based on the properties, a...
详细信息
ISBN:
(纸本)076951507X
In this paper, e-words are used for coding k-ary trees with n internal nodes. The properties of e-words are discussed in depth, such as the necessary and sufficient condition of e-words, and based on the properties, a loopless algorithm is obtained to generate e-words for k-ary trees in lexicographic order, which is more efficient in both space and time than the previous algorithm. In addition, e-words can also be easily generated in lexicographic order by a recursive algorithm, and in the order with the Strong Minimal Change Property (SMCP) by a loopless algorithm.
Knowledge management is very important in the consulting business. On the one hand knowledge is the crucial factor of production that differentiates consulting companies from their competitors. On the other hand knowl...
详细信息
ISBN:
(纸本)076951507X
Knowledge management is very important in the consulting business. On the one hand knowledge is the crucial factor of production that differentiates consulting companies from their competitors. On the other hand knowledge management is a consulting service that can be sold to other companies. A holistic approach for the introduction and establishment of knowledge management in consulting companies is presented that covers changes in organization, roles, processes and informationtechnology. It focuses on an innovative approach to capturing implicit knowledge with intelligent software agents.
The concept of Virtual Private Networks offers a simple and cheap alternative to dedicated secure networks in corporate networks and Internet environments. The choice, however, of authentication and encryption techniq...
详细信息
ISBN:
(纸本)076951507X
The concept of Virtual Private Networks offers a simple and cheap alternative to dedicated secure networks in corporate networks and Internet environments. The choice, however, of authentication and encryption techniques and protocols affect issues such as data throughput and performance throughout the network. This paper looks into two virtual private network models within a corporate network. Two operating system platforms are implemented in this investigation;Novell Netware and Windows 2000. Performance of the two arrangements is, subsequently, analyzed and evaluated.
We present a partitioning method able to manage web log sessions. Sessions are assimilable to transactions, i.e., tuples of variable size of categorical data. We adapt the standard definition of mathematical distance ...
详细信息
ISBN:
(纸本)076951507X
We present a partitioning method able to manage web log sessions. Sessions are assimilable to transactions, i.e., tuples of variable size of categorical data. We adapt the standard definition of mathematical distance used in the K-Weans algorithm to represent transactions dissimilarity, and redefine the notion. of cluster centroid. The cluster centroid is used as the representative of the common properties of cluster elements. We show that using our concept of cluster centroid together with Jaccard distance we obtain results that are comparable with standard approaches, but substantially improve their efficiency.
This paper proposes a joint source and channel coding (JSCC) method for MPEG-2 video transmission. Based on the current channel status, this JSCC method finds the best source and channel code rate distribution. Due to...
详细信息
ISBN:
(纸本)0769515061;076951507X
This paper proposes a joint source and channel coding (JSCC) method for MPEG-2 video transmission. Based on the current channel status, this JSCC method finds the best source and channel code rate distribution. Due to the different bit error sensitivity, of the source code, we apply unequal error protection (UEP) for the source bits by using so-called rate compatible punctured convolution (RCPC) channel coder for efficient protection during channel transmission. In the simulations, we illustrate that under the conditions of the same channel status and total bit rate, our method provides the minimal overall distortion of the MPEG-2 video compared to the equal error protection (EEP) coding.
暂无评论