search for: thesholds

Hello all, I am working with a 1000x1000 matrix, and I would like to return a 1000x1000 matrix that tells me which value in the matrix is greater than a theshold value (1 or 0 indicator). i have tried mat2<-as.matrix(as.numeric(mat1>0.25)) but that returns a 1:100000 matrix. I have also tried for loops, but they are grossly inefficient. THanks for all your help in advance. Lanre

This fixes three issues on move extents ioctl without auto defrag: a) In ocfs2_find_victim_alloc_group(), we have to convert bits to block first in case of global bitmap. b) In ocfs2_probe_alloc_group(), when finding enough bits in block group bitmap, we have to back off move_len to start pos as well, otherwise it may corrupt filesystem. c) In ocfs2_ioctl_move_extents(), set me_threshold both for

This commit fixes three issues on non-auto defrag path (defragfs.ocfs2 doesn't set OCFS2_MOVE_EXT_FL_AUTO_DEFRAG on range.me_flags): - For ocfs2_find_victim_alloc_group(), old code forgot enlarge bitmap range for global_bitmap case. Old code could generate negative vict_bit. - For ocfs2_probe_alloc_group(), old code forgot back off move_len when finding enough bitmap space. Old code has

Hello! I have the following combinatorial problem. Consider the cumulative sums of all permutations of a given weight vector 'w'. I need to know how often weight in a certain position brings the cumulative sums equal or above the given threshold 'q'. In other words, how often each weight is decisive in raising the cumulative sum above 'q'? Here is what I do: w <-

...ven if the host has indicated it doesn't want to know. This seemed like a good idea at the time: if we fill the transmit ring, we should tell the host immediately. Unfortunately this logic also applies to the receiving ring, which is refilled constantly. We should introduce real notification thesholds to replace this logic. Meanwhile, removing the logic altogether breaks the heuristics which KVM uses, so we use a hack: only notify if there are outgoing parts of the new buffer. It even makes a difference with lguest's crappy network implementation: 1GB guest->host before: 30.0844 1GB g...

...ven if the host has indicated it doesn't want to know. This seemed like a good idea at the time: if we fill the transmit ring, we should tell the host immediately. Unfortunately this logic also applies to the receiving ring, which is refilled constantly. We should introduce real notification thesholds to replace this logic. Meanwhile, removing the logic altogether breaks the heuristics which KVM uses, so we use a hack: only notify if there are outgoing parts of the new buffer. It even makes a difference with lguest's crappy network implementation: 1GB guest->host before: 30.0844 1GB g...

...to know. This seemed like a good idea at > the time: if we fill the transmit ring, we should tell the host > immediately. > > Unfortunately this logic also applies to the receiving ring, which is > refilled constantly. We should introduce real notification thesholds > to replace this logic. Meanwhile, removing the logic altogether breaks > the heuristics which KVM uses, so we use a hack: only notify if there are > outgoing parts of the new buffer. > > Here are the number of exits with lguest's crappy network implem...

...to know. This seemed like a good idea at > the time: if we fill the transmit ring, we should tell the host > immediately. > > Unfortunately this logic also applies to the receiving ring, which is > refilled constantly. We should introduce real notification thesholds > to replace this logic. Meanwhile, removing the logic altogether breaks > the heuristics which KVM uses, so we use a hack: only notify if there are > outgoing parts of the new buffer. > > Here are the number of exits with lguest's crappy network implem...

hi - if I sample from a normal distribution with something like n100<-rnorm(100,0,1) and add an outlier with n100[10]<-4 then qqnorm(n100) visually shows the point 4 as an outlier and calculating the probablity of a value of 4 or bigger in 100 samples of norm(0,1) gives > 1-exp(log(pnorm(4,0,1))*100) [1] 0.003162164 If I have more than 1 sample above outlier threshold the math is a

On 2/20/23 1:05 PM, Heming Zhao wrote: > This fixes three issues on move extents ioctl without auto defrag: > > a) In ocfs2_find_victim_alloc_group(), we have to convert bits to block > first in case of global bitmap. > b) In ocfs2_probe_alloc_group(), when finding enough bits in block group > bitmap, we have to back off move_len to start pos as well, otherwise it > may

The quilt patch titled Subject: ocfs2: fix non-auto defrag path not working issue has been removed from the -mm tree. Its filename was ocfs2-fix-non-auto-defrag-path-not-working-issue.patch This patch was dropped because it was merged into the mm-hotfixes-stable branch of git://git.kernel.org/pub/scm/linux/kernel/git/akpm/mm ------------------------------------------------------ From:

This is a note to let you know that I've just added the patch titled ocfs2: fix non-auto defrag path not working issue to the 6.2-stable tree which can be found at: http://www.kernel.org/git/?p=linux/kernel/git/stable/stable-queue.git;a=summary The filename of the patch is: ocfs2-fix-non-auto-defrag-path-not-working-issue.patch and it can be found in the queue-6.2 subdirectory.

This is a note to let you know that I've just added the patch titled ocfs2: fix non-auto defrag path not working issue to the 6.1-stable tree which can be found at: http://www.kernel.org/git/?p=linux/kernel/git/stable/stable-queue.git;a=summary The filename of the patch is: ocfs2-fix-non-auto-defrag-path-not-working-issue.patch and it can be found in the queue-6.1 subdirectory.

This is a note to let you know that I've just added the patch titled ocfs2: fix non-auto defrag path not working issue to the 5.15-stable tree which can be found at: http://www.kernel.org/git/?p=linux/kernel/git/stable/stable-queue.git;a=summary The filename of the patch is: ocfs2-fix-non-auto-defrag-path-not-working-issue.patch and it can be found in the queue-5.15

This is a note to let you know that I've just added the patch titled ocfs2: fix non-auto defrag path not working issue to the 5.4-stable tree which can be found at: http://www.kernel.org/git/?p=linux/kernel/git/stable/stable-queue.git;a=summary The filename of the patch is: ocfs2-fix-non-auto-defrag-path-not-working-issue.patch and it can be found in the queue-5.4 subdirectory.

This is a note to let you know that I've just added the patch titled ocfs2: fix non-auto defrag path not working issue to the 4.19-stable tree which can be found at: http://www.kernel.org/git/?p=linux/kernel/git/stable/stable-queue.git;a=summary The filename of the patch is: ocfs2-fix-non-auto-defrag-path-not-working-issue.patch and it can be found in the queue-4.19

The patch titled Subject: ocfs2: fix non-auto defrag path not working issue has been added to the -mm mm-hotfixes-unstable branch. Its filename is ocfs2-fix-non-auto-defrag-path-not-working-issue.patch This patch will shortly appear at https://git.kernel.org/pub/scm/linux/kernel/git/akpm/25-new.git/tree/patches/ocfs2-fix-non-auto-defrag-path-not-working-issue.patch This patch

...good idea at > > > the time: if we fill the transmit ring, we should tell the host > > > immediately. > > > Unfortunately this logic also applies to the receiving ring, which is > > > refilled constantly. We should introduce real notification thesholds > > > to replace this logic. Meanwhile, removing the logic altogether breaks > > > the heuristics which KVM uses, so we use a hack: only notify if there are > > > outgoing parts of the new buffer. > > > Here are the number of exits with lgues...

...good idea at > > > the time: if we fill the transmit ring, we should tell the host > > > immediately. > > > Unfortunately this logic also applies to the receiving ring, which is > > > refilled constantly. We should introduce real notification thesholds > > > to replace this logic. Meanwhile, removing the logic altogether breaks > > > the heuristics which KVM uses, so we use a hack: only notify if there are > > > outgoing parts of the new buffer. > > > Here are the number of exits with lgues...

...e a good idea at >>> the time: if we fill the transmit ring, we should tell the host >>> immediately. >>> Unfortunately this logic also applies to the receiving ring, which is >>> refilled constantly. We should introduce real notification thesholds >>> to replace this logic. Meanwhile, removing the logic altogether breaks >>> the heuristics which KVM uses, so we use a hack: only notify if there are >>> outgoing parts of the new buffer. >>> Here are the number of exits with lguest...