similar to: Inefficient Winbind behavior? Not sure if it posted 1 st time.

Hello all, I'm having an issue with Winbind and I'm not sure if it's occurring by design or not. My Samba server resides in a Windows NT domain and uses winbindd to authenticate to a mixed-mode 2003 domain over a trust relationship. Everything works the way it ought to. However, every so often my users experience delays of anywhere from 30 to 60 seconds when connecting to a share,

Hello, I've been trying for a couple of weeks now to get Samba to authenticate via Winbind to an NT domain. I've scoured Google and the mailing lists to no avail. I've tried various configurations that I've found during my searches, but none of them have worked for me. I need to be able to authenticate users, that do not have an account on the Linux box, against the NT domain,

Hello all, I'm having an issue with Winbind and I'm not sure if it's occurring by design or not. My Samba server resides in a Windows NT domain and uses winbindd to authenticate to a mixed-mode 2003 domain over a trust relationship. Everything works the way it ought to. However, every so often my users experience delays of anywhere from 30 to 60 seconds when connecting to a share,

Patches item #16627, was opened at 2007-12-26 21:13 You can respond by visiting: http://rubyforge.org/tracker/?func=detail&atid=413&aid=16627&group_id=85 Category: win32-service Group: Code Cleanup Status: Open Resolution: None Priority: 3 Submitted By: Nobody (None) Assigned to: Nobody (None) Summary: Replace inefficient busy wait loop with UDP/IP loopback socket. Initial Comment:

https://bugzilla.mindrot.org/show_bug.cgi?id=1665 Summary: prefix_pton is inefficient Product: py-radix Version: -current Platform: ix86 OS/Version: Linux Status: NEW Severity: enhancement Priority: P2 Component: Default AssignedTo: unassigned-bugs at mindrot.org ReportedBy: weinholt at

RFC 4731: " IMAP4 Extension to SEARCH Command for Controlling What Kind of Information Is Returned" https://tools.ietf.org/html/rfc4731 I do this (telnet session): """ a select proveedores/TUHS * FLAGS (\Answered \Flagged \Deleted \Seen \Draft) * OK [PERMANENTFLAGS (\Answered \Flagged \Deleted \Seen \Draft \*)] Flags permitted. * 8330 EXISTS * 0 RECENT

I often need to work with large vectors whose distribution I want to summarize by Q-Q plots. Since the vectors are large, I use a subset of quantiles, e.g. quantile(x, probs = ppoints(1000)) Unfortunately, this seemed to be taking too long for large x (much longer than 'sort'). I initially thought maybe quantile was doing something sophisticated (which I don't really need with a

When --checksum is used they're calculated in both ends to see if the file should be transfered. This is of course not necessary if the file doesn't exist in the destination. However, the checksum is still calculated by the sender, which is often a very large overhead. Would it be possible to avoid it?

dear R experts--- t <- 1:30 f <- function(t) { cat("f for", t, "\n"); return(2*t) } g <- function(t) { cat("g for", t, "\n"); return(3*t) } s <- ifelse( t%%2==0, g(t), f(t)) shows that the ifelse function actually evaluates both f() and g() for all values first, and presumably then just picks left or right results based on t%%2.

Hello, LLVM generates two additional instructions for 128->256 bit typecasts (e.g. _mm256_castsi128_si256()) to clear out the upper 128 bits of YMM register corresponding to source XMM register. vxorps xmm2,xmm2,xmm2 vinsertf128 ymm0,ymm2,xmm0,0x0 Most of the industry-standard C/C++ compilers (GCC, Intel's compiler, Visual Studio compiler) don't generate any extra moves

Hello Ralph, many thanks for your fast reply and help with this issue! :-) Am 31.08.2017 um 15:43 schrieb Ralph Böhme: > On Thu, Aug 24, 2017 at 03:37:07PM +0200, awl1 via samba wrote: >> Before I follow your advice to move this whole issue/topic to the >> samba-technical alias and start over there with a clean description of the >> scenario and the findings, I have two

https://bugzilla.netfilter.org/show_bug.cgi?id=1426 Bug ID: 1426 Summary: Inefficient command lookup on errors Product: nftables Version: unspecified Hardware: x86_64 OS: All Status: NEW Severity: enhancement Priority: P5 Component: nft Assignee: pablo at netfilter.org

hi, i'm really in trouble to simulate some experiment. that is, it takes too much time to process the following code. following is short example, ------------------------------------------------------------------------------------------------------- p<-data.frame(a=rnorm(10),b=rnorm(10),c=rnorm(10),d=rnorm(10)) test<-data.frame(a=rnorm(1),b=rnorm(1),c=rnorm(1),d=rnorm(1))

Full_Name: Martin Frith Version: R-2.0.0 OS: linux-gnu Submission from: (NULL) (134.160.83.73) I have large vectors containing 100,000 to 20,000,000 numbers. However, they only contain a few hundred *distinct* numbers (e.g. positive integers < 200). When I do ecdf(v), it either runs out of memory, or it succeeds, but when I plot the ecdf with postscript, the output is unnecessarily bloated

Hey, I just read another post about calling R from C. Someone on stackoverflow (DWin makes me suspect its David W.?) referenced this: http://www.math.univ-montp2.fr/~pudlo/R_files/call_R.pdf Which made me think: Why is a loop in R bad, but in C not? And where exactly does looping cost the most? I wrote a piece of code for my bachelor's thesis where I loop from 1 to 500, and estimate a

Hello, I've made some changes in the libvorbis-1.2.3 source code to introduce some functionality I need for a project I'm working on. For compilation, besides including some macro definitions I need to pass to the C preprocessor, and linking with the math library somewhere (and including the source files I've implemented, of course) I've made no big changes in the Makefile or

I have a 1.1G Ogg file with vorbis and theora. oggz_seek_units() takes 14 seconds to find a position in the file towards the end. Now, the function guess() in oggz_seek() guesses a position at about 1.5G and then slowly searches back until it finds the end of the file (continously seeking beyond the end of the file and then calling read which returns 0). Then it does a linear scan from the

Hello Jeremy, Andrew, All, I can now indeed confirm that my test scenario runs MUCH faster when executed against a Windows 10 SMB2 server than against Samba (test scenario takes ~ 18 seconds using a Windows SMB2 server as opposed to ~ 300 seconds when the server is Samba 4.6.5). But, most interestingly, the reason for these performance gains is NOT - as assumed by Jeremy - that the number of

​Hi, Would you be able to kindly check and assist with the IndVarSimplify / SCEV problem I got in the latest LLVM, please? Sometimes IndVarSimplify may not eliminate narrow IV's when there actually exists such a possibility. This may affect other LLVM passes and result in inefficient code. The reproducing test 'indvar_test.cpp' is attached. The problem is with the second

I''ve noticed that: - with x86-64 Fedora 15 DVD install images: - du -sh <ROOT VOLUME> was 36 GB - btrfs df | grep -i data have shown over 40 GB used - without - du -sh <ROOT VOLUME> is 34 GB - btrfs df | grep -i data have shown less then 34 GB used It seems that iso files are considered compressable while they may not be (and penalty is severe - 3x). Regards