similar to: Kleinberg's burst detection algorithm

I had this problem some last year and never got it figured out. Now it is bugging me. It seems that sometimes when a student writes his/her file to a directory, it will not keep the correct group. It puts his/her main group as the group owner and that fouls things up. Here is what I have. Unix Permissions /school 3777 admin.teacher /school/bhs 3777 admin.teacher /school/bhs/reese

ALL: <<diffserv-gred_10-06>> I have attached the current script that I am using. $TC qdisc add dev $EDEV parent 2:20 gred setup DPs 3 default 2 grio $TC qdisc change dev $EDEV parent 2:20 gred DP 1 limit $lim min $minTh max $maxTh avpkt $avgPL burst $bursty bandwidth $netBand probability 0.02 prio 2 $TC qdisc change dev $EDEV parent 2:20 gred DP 2 limit $lim min $minTh max

It's both in 2.6 and recent 2.6 (for RH ASS2.1 you'll probably need to copy the latest 2.4 defintion, but I don't care for obsolete junk). Index: src/super.c =================================================================== --- src/super.c (revision 1014) +++ src/super.c (working copy) @@ -799,7 +799,7 @@ /* get first two blocks */ for (i=0; i<2; i++) { - bhs[i] = getblk

I have a problem with some Samba permissions. Here is the share. [bhs] path = /school/bhs read only = no valid users = @teacher @admin @bhs create mask = 660 force create mode = 2660 directory mask = 770 force directory mode = 3770 T: is mapped to a DFS share with permissions 3777, then the 'bhs' share is a link in the DFS share. I get inconsistent

It would be nice to know how often we get checksum failures. Even better, how many of them we can fix with the single bit ecc. So, we add a statistics structure. The structure can be installed into debugfs wherever the user wants. For ocfs2, we'll put it in the superblock-specific debugfs directory and pass it down from our higher-level functions. The stats are only registered with

My manual patching of the rejects in checkpoint.c didn''t work out; a delete of 10,000 files caused a panic (in any ext fs, not just Lustre). In the new checkpoint.c, two routines expected by the patch no longer exist: __cleanup_transaction and __flush_buffer. I can avoid the panic if I omit (don''t try to manually patch) the following: Index: linux-2.6.9/fs/jbd/checkpoint.c

It would be nice to know how often we get checksum failures. Even better, how many of them we can fix with the single bit ecc. So, we add a statistics structure. The structure can be installed into debugfs wherever the user wants. For ocfs2, we'll put it in the superblock-specific debugfs directory and pass it down from our higher-level functions. The stats are only registered with

Was wondering if someone could tell me if this is correct. I want to set up some DFS shares. I have 3 servers with SAMBA/LDAP on them. My first is basically my PDC and the other two are my BDCs. I assume that I will have to set all of this up on each server, so that no matter which server catches the logon, the logon script will get run. Also, if one of the servers was to go down for a

I was wondering what the criteria were for including books on the Books Related to R page <http://www.r-project.org/doc/bib/R-books.html>. (There is no maintainer listed on this page.) In particular, I was wondering why the following two books are not listed: * Andrew Gelman, Jennifer Hill, *Data Analysis Using Regression and Multilevel/Hierarchical Models*. (CRAN package 'arm') *

I have two vectors, a and b. b is a text file. I want to find in b those elements of a which occur at the beginning of the line in b. I have the following code, but it only returns a value for the first value in a, but I want both. Any ideas please. a = c(2,3) b = NULL b[1] = "aaa 2 aaa" b[2] = "2 aaa" b[3] = "3 aaa" b[4] = "aaa 3 aaa"

On Tue, Feb 10, 2009 at 10:11 AM, Duncan Murdoch <murdoch at stats.uwo.ca> wrote: > Stavros Macrakis wrote: >> On Tue, Feb 10, 2009 at 8:31 AM, Duncan Murdoch <murdoch at stats.uwo.ca>wrote: >>> The evaluator recognizes the context of usage and will get the >>> function for a function call.... >> Can you point me to chapter and verse in the language

I recently traced a bug of mine to the fact that cumsum(s)[length(s)] is not always exactly equal to sum(s). For example, x<-1/(12:14) sum(x) - cumsum(x)[3] => 2.8e-17 Floating-point addition is of course not exact, and in particular is not associative, so there are various possible reasons for this. Perhaps sum uses clever summing tricks to get more accurate results? In some

To test two environments for object equality (Lisp EQ), I can use 'identity': > e1 <- environment(local(function()x)) > e2 <- environment(local(function()x)) > identical(e1,e2) # compares object identity [1] FALSE > identical(as.list(e1),as.list(e2)) # compares values as name->value mapping [1] TRUE # (is there a

igraph is a package for graphs and networks. It has a C core and uses a simple and fast graph representation allowing millions of vertices and edges. NEW FEATURES: - We use the ARPACK library for graph related eigenvalue problems, like Page Rank calculation, Kleinberg's hub and authority scores, eigenvector centrality, etc. There is also a generic interface if someone wants to use

igraph is a package for graphs and networks. It has a C core and uses a simple and fast graph representation allowing millions of vertices and edges. NEW FEATURES: - We use the ARPACK library for graph related eigenvalue problems, like Page Rank calculation, Kleinberg's hub and authority scores, eigenvector centrality, etc. There is also a generic interface if someone wants to use

Tested in: R version 2.8.1 (2008-12-22) / Windows Recursive default argument references normally give nice clear errors. In the first set of examples, you get the error: Error in ... : promise already under evaluation: recursive default argument reference or earlier problems? (function(a = a) a ) () (function(a = a) c(a) ) () (function(a = a) a[1] ) () (function(a = a)

What is the recommended class for time of day (independent of calendar date)? And what is the recommended way to get the time of day from a POSIXct object? (Not a string representation, but a computable representation.) I have looked in the man page for DateTimeClasses, in the Time Series Analysis Task View and in Spector's Data Manipulation book but haven't found these. Clearly I can

Hi all, Newbie to the group. Just started using Opus as part of a WebRTC project and amazed by the versatility of the codec. Great stuff!!!! I have been trying to understand the performance of Opus inband FEC in the presence of bursty loss. Although I do not have exact characterization of the loss profile, we are seeing issues over WiFi. RTCP reports about 33% loss, but I am guessing a lot of it

Hello again, Is it possible to split a bandwidth equally among clients regardless of its current link speed? I have a link that can get bursty at times. At any given time the N active sessions (the ones with non-empty queues) need to be serviced simultaneously, each at a rate of 1/N''th of the link speed. My case is an internet connection that oscillates between 96 kbps and 256 kbps. I

On Wed, Dec 28, 2016 at 04:09:31PM +0800, Jason Wang wrote: > +static int tun_rx_batched(struct tun_file *tfile, struct sk_buff *skb, > + int more) > +{ > + struct sk_buff_head *queue = &tfile->sk.sk_write_queue; > + struct sk_buff_head process_queue; > + int qlen; > + bool rcv = false; > + > + spin_lock(&queue->lock); Should this be spin_lock_bh()?