similar to: smbclient -k fails

Hello samba experts ! I have a big problem with my samba 3.0.2a on debian. I use winbindd, which seems to work (getent passwd/group and wbinfo -u works), and the net ads join worked too, but the authentication with the AD controler, hosted on Win2003 Server, fails. Sample of the level 3 log file : ... [2004/05/04 08:47:20, 3] smbd/process.c:switch_message(685) switch message SMBsesssetupX

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 This is the latest stable release of Samba. This is the version that production Samba servers should be running for all current bug-fixes. There have been several issues fixes since the 3.0.2a release and new features have been added as well. See the "Changes" section for details on exact updates. Common bugs fixed in Samba 3.0.3 include:

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 This is the latest stable release of Samba. This is the version that production Samba servers should be running for all current bug-fixes. There have been several issues fixes since the 3.0.2a release and new features have been added as well. See the "Changes" section for details on exact updates. Common bugs fixed in Samba 3.0.3 include:

hi you all, I had this problem for a long time and with different versions of SAMBA and LPRng: using '/usr/spool/lp/bin/lpr -r -Fl -m%m -J"%J" -U%U -P%p %s' as 'print command' results in two jobs in the queue window on the NT box, though there is only one job in the unix queue. using '/usr/spool/lp/bin/lpr -r -Fl -m%m -U%U -P%p %s' works fine, but delete

Hello, It's been some time I've discovered that the Tango project website (http://tango.freedesktop.org/) is completely blank. Page source code is just empty I've tried googling around to see some maintenance announcement but found nothing. Does anybody know what is going on ? Tango project remains for me the best source of great public domain icons ! Best, Pierre PS : I've

I asked: > In this discussion of seq(), can anyone explain to > me _why_ seq(to=n) and seq(length=3) have different > types? Martin Maechler <maechler@stat.math.ethz.ch> replied: well, the explantion isn't hard: look at seq.default :-) That's the "efficient cause", I was after the "final cause". That is, I wasn't asking "what is it

Hi, I wonder if the following (apparent) inconsistency is a bug or feature. Since scalars are simply vectors of length one I would think that a and a:a produce the same result. For example, > identical(4.01,4.01:4.01) [1] TRUE However, identical(4,4:4) [1] FALSE and > identical(4.0,4.0:4.0) [1] FALSE A closer look reveals that the colon operator produces objects

The poly() function can create more variables than can be fitted when there are replicated values. In the example below, 'x' has only 5 distinct values, but I can apparently fit a 12th-degree polynomial with no error messages or even nonzero coefficients: R> x = rep(1:5,3) R> y = rnorm(15) R> lm(y ~ poly(x, 12)) Call: lm(formula = y ~ poly(x, 12)) Coefficients:

On 14/01/2020 10:07 a.m., peter dalgaard wrote: > Yep, that looks wrong (probably want to continue discussion over on R-devel) > > I think the culprit is here (in src/nmath/choose.c) > > if (k < k_small_max) { > int j; > if(n-k < k && n >= 0 && R_IS_INT(n)) k = n-k; /* <- Symmetry */ > if (k < 0) return 0.;

It took me by surprise to find that choose(4,5) delivers [1] NaN Warning message: NaNs produced in: choose(n, k) If we look at choose(4,5) as the number of ways of choosing 5 objects from 4 I would have expected 0 as result. Furthermore dhyper(5,4,6,5) does deliver 0 and this essentially equivalent to choose(4,5)*choose(6,0)/choose(10,5).

On 14/01/2020 10:50 a.m., peter dalgaard wrote: > > >> On 14 Jan 2020, at 16:21 , Duncan Murdoch <murdoch.duncan at gmail.com> wrote: >> >> On 14/01/2020 10:07 a.m., peter dalgaard wrote: >>> Yep, that looks wrong (probably want to continue discussion over on R-devel) >>> I think the culprit is here (in src/nmath/choose.c) >>> if (k

I sometimes buy myself a default value for a hash using something like this: h = Hash.new{|h,k| h[k] = ""}. I can now pass ''h'' any key and if a value has not yet been associated with that key I receive an empty string. I would love to do something similar in my partials so that I wouldn''t have to worry about passing in every variable that is referenced.

Yep, that looks wrong (probably want to continue discussion over on R-devel) I think the culprit is here (in src/nmath/choose.c) if (k < k_small_max) { int j; if(n-k < k && n >= 0 && R_IS_INT(n)) k = n-k; /* <- Symmetry */ if (k < 0) return 0.; if (k == 0) return 1.; /* else: k >= 1 */ if n is a near-integer, then k

At the risk of throwing oil on a fire. If we are talking about fractional values of choose() doesn't it make sense to look to the gamma function for the correct analytic continuation? In particular k<0 may not imply the function should evaluate to zero until we get k<=-1. Example: ``` r choose(5, 4) #> [1] 5 gchoose <- function(n, k) { gamma(n+1)/(gamma(n+1-k) * gamma(k+1))

Bringing up an old topic on a small technicality. In the help documentation on seq. Value: The result is of 'mode' '"integer"' if 'from' is (numerically equal to an) integer and 'by' is not specified. The arguement in seq specifying length also creates "double" which is not obvious in the wording, as "by" is not specified

Bringing up an old topic on a small technicality. In the help documentation on seq. Value: The result is of 'mode' '"integer"' if 'from' is (numerically equal to an) integer and 'by' is not specified. The arguement in seq specifying length also creates "double" which is not obvious in the wording, as "by" is not specified

This struck me as incorrect: > choose(3.999999, 4) [1] 0.9999979 > choose(3.9999999, 4) [1] 0 > choose(4, 4) [1] 1 > choose(4.0000001, 4) [1] 4 > choose(4.000001, 4) [1] 1.000002 Should base::choose(n, k) check whether n is within machine precision of k and return 1? Thanks, Erik *** sessionInfo() R version 3.6.0 beta (2019-04-15 r76395) Platform: x86_64-apple-darwin15.6.0

This struck me as incorrect: > choose(3.999999, 4) [1] 0.9999979 > choose(3.9999999, 4) [1] 0 > choose(4, 4) [1] 1 > choose(4.0000001, 4) [1] 4 > choose(4.000001, 4) [1] 1.000002 Should base::choose(n, k) check whether n is within machine precision of k and return 1? Thanks, Erik *** sessionInfo() R version 3.6.0 beta (2019-04-15 r76395) Platform: x86_64-apple-darwin15.6.0

Hi, I am trying to find the fastest way to "find the last index k such that x[k] < y in a *sorted* vector x" These are my two alternatives: x <- sort(rnorm(1e4)) y <- 0.2 # Alt 1 k <- max(1, sum(x < y)) # Alt 2 "divide and conquer" lastIndexLessThan <- function(x, y) { k0 <- 1; k1 <- length(x) while ((dk <- (k1 - k0)) >

> On 14 Jan 2020, at 16:21 , Duncan Murdoch <murdoch.duncan at gmail.com> wrote: > > On 14/01/2020 10:07 a.m., peter dalgaard wrote: >> Yep, that looks wrong (probably want to continue discussion over on R-devel) >> I think the culprit is here (in src/nmath/choose.c) >> if (k < k_small_max) { >> int j; >> if(n-k < k