similar to: [LLVMdev] SUBALLOCATOR

Hi, I am solving following problem: Suppose I have some multiset: > multiset <- c("a","a","c","d","d") and rules, which operate with it (for simplicity not writen in R functions) > rule1: "a" -> c("a","b") > rule2: "a" -> c("a","c") > rule3: "c" ->

Dear R users, I want to perform an exact permutation of multisets. I have looked at the coin package, but it doesn't seem to offer what I am looking for. I want to perform permutations (exact - without duplications) on multisets of scalars (e.g., the multiset 0,0,1,2,2). I want to output all the possible permutations into a data frame so that each multiset permutation occupies a row (or

Hello Peter, I'm using a virtual users model in dovecot where all the mail is stored under the same OS user account anyway, so file/dir permissions won't be a problem. The system users I was referring to are actually completely separate user accounts at the moment with their own uid/gid (and passwordless sudo between them), but I guess they could use same uid/gid and just have

Hi, we've implemented an indirect call promotion llvm pass. The design notes including examples are shown below. This pass complements the indirect call profile infrastructure http://lists.cs.uiuc.edu/pipermail/llvmdev/2015-April/084271.html Your feedback and comments will be highly appreciated. Thanks, Ivan ============================================================================RFC:

Hello Tapia, You are going to great lengths :) I assume, that PAM working means, "user" and "otheruser" are the names of system-users with the same uid, home etc? Then I do not see, why dovecot, all defaults and authenticating against PAM won't work out of the box, shouldn't it? Peter Am 2017-09-23 um 22:08 schrieb Tapio Sokura: > Hello, > > Will I be

Hi Folks, A while ago (September 2007) I set up an experimental Debian 4.0 Etch installation, and installed R on it, along with several packages -- including e1071 and the "Bundle" VR -- by means of the Debian package manager. Most of the time, R works fine. But not always. Just now, I wanted to try the code suggested by Johannes H?sing for "Stroparia"'s Multiset

Hello! I am trying to impute missing data and output the results of the imputation. My data set is called: MyData. I have a bunch of variables all of which start with Q20_ - and some of them have missing values. Here is what I've been doing: imputationmodel<-mice( MyData[ c (grep("Q20_", names(MyData)) ) ] ) multipledataset<-complete(imputationmodel,action="long")

hello hpa, please pull git pull git://brane.itp.tuwien.ac.at/~mattems/klibc.git maks for those changes: Kyle McMartin (1): klibc-utils: add dmesg maximilian attems (2): klibc comment fix fstype: add ocfs2 support with the following diffstat README | 2 usr/Kbuild | 2 usr/kinit/fstype/fstype.c | 15 +++++++

Over the last couple of years I have written quite a few R programs for various "psychometric" techniques, and I am regularly updating and expanding what is there. I now have (wholly or partially), or have planned -- gifi package (update to homals on CRAN). Code for multiple correspondence analysis, nonlinear principal component analysis, nonlinear multiset canonical

Buen d?a amigos: LA PRESENTE ES CON EL FIN DE AGRADECERLES SU BUEN VOLUNTAD DE AYUDARME A RESOLVER EL PROBLEMA POR CONSEGUIR O EMITIR RADIO POR INTERNET. POR LO TANTO, LE SUGERIMOS QUE ME AYUDEN EN LOS MENSAJES QUE USTEDES NOS ENVIEN, PARA QUE PODAMOS AVANZAR Y RECIBIR DICHOS MENSAJES EN IDIOMA ESPA?OL, PREFERIBLEMENTE, PARA PODER ENTENDER LO QUE USTEDES NOS QUIEREN ACONSEJAR. ATENTAMENTE: ESGARDO

Hi, This has been asked before but not sufficiently answered from what I could find. How do you create combinations with repetitions (multisets) in R? If I have > set <- array(1:3) And I want to choose all combinations of picking 2 numbers, I want to get a print out like [,1] [,2] [1,] 1 1 [2,] 1 2 [3,] 1 3 [4,] 2 2 [5,] 2 3 [6,] 3 3 subsets(set,

For nfs exporting, ocfs2_get_dentry() returns the dentry for fh. ocfs2_get_dentry() may read from disk(when inode not in memory) without any cross cluster lock. this leads to load a stale inode. this patch fixes above problem. solution is that in case of inode is not in memory, we get the cluster lock(PR) of alloc inode where the inode in question is allocated from(this causes node on which

Amigos: Ser?a posible que sus comentarios, sugerenciaas, invitaciones, consultas, opiniones, los pueda recibir en idioma espa?ol? Atentamente: Edgardo Tapia --- El mar 27-oct-09, icecast-request at xiph.org <icecast-request at xiph.org> escribi?: > De: icecast-request at xiph.org <icecast-request at xiph.org> > Asunto: Icecast Digest, Vol 65, Issue 4 > A: icecast at

Hi Mark/Joel, I meet with some meta allocation bugs when I implement reflink these days. And after some investigation, I think we should have the same problem when we have PAGE_SIZE > CLUSTER_SIZE. So I create a scenario today in one ppc box and try. the box panic as I expected. ;) The scenario is that: Create a file with the disk layout like this(with bs=512, and cs=4K). debugfs: stat

changes from v4: 1, let suballoc lock covers the checking of the group. 2, add/correct some log messages. 3, use ocfs2_read_group_descriptor() instead of diry reading the group. Signed-off-by: Wengang Wang <wen.gang.wang at oracle.com> -- dlmglue.c | 45 ++++++++++++++++ dlmglue.h | 2 export.c | 77 +++++++++++++++++++++++++-- inode.c | 24 ++++++++

#against V6.2, add indentation. For nfs exporting, ocfs2_get_dentry() returns the dentry for fh. ocfs2_get_dentry() may read from disk(when inode not in memory) without any cross cluster lock. this leads to load a stale inode. this patch fixes above problem. solution is that in case of inode is not in memory, we get the cluster lock(PR) of alloc inode where the inode in question is allocated

#against V6, corrects some format problem pointed out by checkpatch.pl. For nfs exporting, ocfs2_get_dentry() returns the dentry for fh. ocfs2_get_dentry() may read from disk(when inode not in memory) without any cross cluster lock. this leads to load a stale inode. this patch fixes above problem. solution is that in case of inode is not in memory, we get the cluster lock(PR) of alloc inode

The old %llu vs u64 battle. Cast them correctly. Signed-off-by: Joel Becker <joel.becker at oracle.com> --- fs/ocfs2/export.c | 9 +++++---- fs/ocfs2/suballoc.c | 19 ++++++++++++------- 2 files changed, 17 insertions(+), 11 deletions(-) diff --git a/fs/ocfs2/export.c b/fs/ocfs2/export.c index de3da8e..15713cb 100644 --- a/fs/ocfs2/export.c +++ b/fs/ocfs2/export.c @@ -100,7 +100,8

Back porting from mainline. For nfs exporting, ocfs2_get_dentry() returns the dentry for fh. ocfs2_get_dentry() may read from disk(when inode not in memory) without any cross cluster lock. this leads to load a stale inode. this patch fixes above problem. solution is that in case of inode is not in memory, we get the cluster lock(PR) of alloc inode where the inode in question is allocated

changes from v3: 1, move codes that checks inode allocation bit to subfunction ocfs2_test_inode_bit(). 2, release the suballoc lock just after we get it. we should release it asap and doing so doesn't affect functionility. 3, add inode alloc slot validation. Signed-off-by: Wengang Wang <wen.gang.wang at oracle.com> -- dlmglue.c | 45 +++++++++++++++++ dlmglue.h | 2