منابع مشابه
Directly Addressable Variable-Length Codes
We introduce a symbol reordering technique that implicitly synchronizes variable-length codes, such that it is possible to directly access the i-th codeword without need of any sampling method. The technique is practical and has many applications to the representation of ordered sets, sparse bitmaps, partial sums, and compressed data structures for suffix trees, arrays, and inverted indexes, to...
متن کاملNumerical Solution of fuzzy differential equations of nth-order by Adams-Bashforth method
So far, many methods have been presented to solve the rst-order di erential equations. But, not many studies have been conducted for numerical solution of high-order fuzzy di erential equations. In this research, First, the equation by reducing time, we transform the rst-order equation. Then we have applied Adams-Bashforth multi-step methods for the initial approximation of one order di erentia...
متن کاملNumerical Solution of fuzzy differential equations of nth-order by Adams-Moulton method
In recent years, Fuzzy differential equations are very useful indifferent sciences such as physics, chemistry, biology and economy. It should be noted, that if the equations that appear to be uncertain, then take help of fuzzy logic at these equations. Considering that most of the time analytic solution of such equations and finding an exact solution has either high complexity or cannot be solv...
متن کاملSharp Singular Adams Inequalities in High Order Sobolev Spaces
In this paper, we prove a version of weighted inequalities of exponential type for fractional integrals with sharp constants in any domain of finite measure in R. Using this we prove a sharp singular Adams inequality in high order Sobolev spaces in bounded domain at critical case. Then we prove sharp singular Adams inequalities for high order derivatives on unbounded domains. Our results extend...
متن کاملVariable-to-fixed length codes are better than fixed-to-variable length codes for Markov sources
-It is demonstrated that for finite-alphabet, Kth order ergodic Markov Sources (i.e., memory of K letters), a variable-to-fixed code is better than the best fixed-to-variable code (Huffman code). It is shown how to construct a variable-to-fixed length code for a Kth order ergodic Markov source, which compresses more effectively than the best fixed-to-variable code (Huffman code).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2002
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(02)00188-8