similar to: Lempel—Ziv complexity

Hi everyone, I'm currently working on project trying to send sensor data from a microcontroller over radio to another device. I need compression because the radio has not enough bandwidth to send it without. Because the sensor data quiet much resembles audio data I got the best compression results using lossless audio codecs instead of data compression algorithms like Lempel-Ziv. I

Bellow, follows a proposal for a new opensolaris project. Of course, this is open to change since I just wrote down some ideas I had months ago, while researching the topic as a graduate student in Computer Science, and since I''m not an opensolaris/ZFS expert at all. I would really appreciate any suggestion or comments. PROJECT PROPOSAL: ZFS Compression Algorithms. The main purpose of

Hello zfs-discuss, Is someone actually working on it? Or any other algorithms? Any dates? -- Best regards, Robert mailto:rmilkowski at task.gda.pl http://milek.blogspot.com

Here is an answer to a 1999 post. I didn't find a direct answer anywhere on the Web, perhaps because it is "obvious" once one sees it. Suppose you have data from a longitudinal study, where each subject was measured *up to* four times, with missing measurements, so that the data look like this: > MAT<- structure(c(23, 24, 6, 19, 16, 20, 13, 11, NA, 8, NA, 21, 19, 15, 11,

Hi, I am trying to install openxencenter to control my VMs I followed the instructions but when I tried to start it I got:  File "window.py", line 44, in <module>     import gtkvnc ImportError: No module named gtkvnc does any one face this problem before. I tried to comment the import line and xencenter started but console tab is not working and it is lookoing for gtkvnc module.

Hello, many linux SW is starting to implement new lzma compresson instrad of old zlib (gzip) od bzip2. lzma is default comrpession in very good compression SW 7-zip, which is faster and have higher compression ratio then bzip2 or rar. Currently its probalby the best compressor in therms of compression and decompression speed / compression ratio. In linux there is GNU lzma SW which implements

Hi, I am confused by the way the indexing works. I read a table from a csv file like this: ysmd <- read.csv("ysmd.csv",header=TRUE); ysmd.table <- hash(); for (i in 1:length(ysmd$X.stock)) ysmd.table[ysmd$X.stock[i]] <- ysmd[i,]; the first column ("X.stock") is a string (factor): > ysmd$X.stock[[100]] [1] FLO 7757 Levels: A AA AA- AAAAA AAC AACC AACOU AACOW AADR

Hi Sanjoy, Here's a version of Banerjee and Wolfe's Exact SIV test: https://sites.google.com/site/parallelizationforllvm/weak-siv-test It assumes you've already filtered out the easy cases handled by ZIV, strong SIV, etc. I'm not confident about my uses of APInt. If you have any comments, I'd love to hear them. Thanks, Preston On Thu, Apr 12, 2012 at 5:14 AM, Sanjoy Das

Hello, I would like to know whether R has a homogeneous function of S-plus's new.frame(), which create explicit frames in the evaluator and provide a locale for computations that can be shared among various functions. new.frame() in S-plus: http://www.uni-muenster.de/ZIV/Mitarbeiter/BennoSueselbeck/s-html/helpfiles/new.frame.html Thanks.

On Wed, 18 Apr 2012 18:16:47 -0700 Preston Briggs <preston.briggs at gmail.com> wrote: > Hi Sanjoy, > > Here's a version of Banerjee and Wolfe's Exact SIV test: > https://sites.google.com/site/parallelizationforllvm/weak-siv-test > It assumes you've already filtered out the easy cases handled by ZIV, > strong SIV, etc. > > I'm not confident about my

Hi all! I have recently finished the first prototype of data dependence analysis for LLVM. Now that I have some more time I would like to prepare a "production" version. In this post I'll try to describe the current state and propose a work plan. Currently, the analysis has a very simplified interface (it allows to query for dependence between two given instructions or whether a

>From an example in http://www.uni-muenster.de/ZIV.BennoSueselbeck/s-html/helpfiles/nargs.html , number of arguments in '...' can be obtained by (function(...)nargs())(...) . I now realize that sys.call() doesn't expand '...' when the function is called with '...'. It just returns the call as is. If 'stopifnot' uses sys.call() instead of match.call() , the

2013/8/8 Preston Briggs <preston.briggs at gmail.com> > > Hi, > > The DependenceAnalysis pass isn't reliable yet; it has several errors that > need to be corrected. These manifest by the analysis claiming there's no > dependence when one in fact exists. > > Your proposed scheme of testing every pair of instructions is > asymptotically expensive, requiring

Hi all, Just for my own fun, I decided to write a small PAM module that will automatically start ssh-agent on session open (and add the default keys), and kill the agent upon session close. Well, writing this was a breeze; however, for some odd reason, it doesn't work... I'm stumped. I'll try again tomorrow. But meanwhile, attached is my current version; it has to be compiled inside

> > Here's a version of Banerjee and Wolfe's Exact SIV test: > > https://sites.google.com/site/parallelizationforllvm/weak-siv-test > > It assumes you've already filtered out the easy cases handled by ZIV, > > strong SIV, etc. > > > > I'm not confident about my uses of APInt. If you have any comments, > > I'd love to hear them. >

>>>>> Suharto Anggono Suharto Anggono via R-devel <r-devel at r-project.org> >>>>> on Thu, 18 May 2017 16:27:09 +0000 writes: >> From an example in >> http://www.uni-muenster.de/ZIV.BennoSueselbeck/s-html/helpfiles/nargs.html >> , number of arguments in '...' can be obtained by > (function(...)nargs())(...) .

In Splus c() and unlist() called the same C code, but with a different 'sys_index' code (the last argument to .Internal) and c() did not consider an argument named 'use.names' special. > c function(..., recursive = F) .Internal(c(..., recursive = recursive), "S_unlist", TRUE, 1) > unlist function(data, recursive = T, use.names = T) .Internal(unlist(data, recursive

In S-PLUS 3.4 help on 'c' (http://www.uni-muenster.de/ZIV.BennoSueselbeck/s-html/helpfiles/c.html), there is no 'use.names' argument. Because 'c' is a generic function, I don't think that changing formal arguments is good. In R devel r71344, 'use.names' is not an argument of functions 'c.Date', 'c.POSIXct' and 'c.difftime'. Could

While you are fiddling with stopifnot(), please consider changing the form of the error thrown so that it includes the caller's call. The change would be from something like stop( <<the message>> ) to stop(simpleError( <<the message>>, sys.call(-1))) For the following code f <- function(x, y) { stopifnot(x > y) x - y } g <- function(x,

I'm having problems getting nls to agree that convergence has occurred in a toy problem. nls.out never gets defined when there is an error in nls. Reaching the maximum number of iterations is alway an error, so nls.out never gets defined when the maximum number of iterations is reched. >From ?nls.control: tol: A positive numeric value specifying the tolerance level for the