Hello,
I am currently implementing a database Blob provider, and while writing
some unit tests I noticed that VFS is not catching the case that a file is
(still) open. It will happily call doRename(). Afterwards both source and
target file objects are isContentOpen==false.
Is this the int
Online report :
http://vmbuild.apache.org/continuum/buildResult.action?buildId=27303&projectId=132
Build statistics:
State: Failed
Previous State: Failed
Started at: Sat 10 Aug 2013 22:28:43 +
Finished at: Sat 10 Aug 2013 22:28:49 +
Total time: 6s
Build Trigger: Schedule
Bui
Group (shared) Maven 3 Build Definition (Java 1.6)
MIME-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
X-Continuum-Build-Host: vmbuild
X-Continuum-Project-Id: 97
X-Continuum-Project-Name: Commons Math
Online report :
http://vmbuild.apache.org/con
On Sat, Aug 10, 2013 at 8:59 AM, Ajo Fod wrote:
> If the data doesn't fit, you probably need a StorelessQuantile estimator
> like QuantileBin1D from the colt libraries. Then pick a resolution and do
> the single pass search.
>
Peripheral to the actual topic, but the Colt libraries are out of dat
On 8/10/13 11:00 AM, Phil Steitz wrote:
> On 8/10/13 10:41 AM, Ajo Fod wrote:
>> This paper provides some approximations and situations where you could use
>> exact computations:
>> http://www.iro.umontreal.ca/~lecuyer/myftp/papers/ksdist.pdf
>> ... they even refer to a java program at the end of p
On 8/10/13 10:41 AM, Ajo Fod wrote:
> This paper provides some approximations and situations where you could use
> exact computations:
> http://www.iro.umontreal.ca/~lecuyer/myftp/papers/ksdist.pdf
> ... they even refer to a java program at the end of page 11.
He he. This is the reference that ou
This paper provides some approximations and situations where you could use
exact computations:
http://www.iro.umontreal.ca/~lecuyer/myftp/papers/ksdist.pdf
... they even refer to a java program at the end of page 11.
Cheers,
Ajo.
On Sat, Aug 10, 2013 at 10:06 AM, Phil Steitz wrote:
> On 8/10/1
On 8/10/13 9:35 AM, Ajo Fod wrote:
> In:
> http://ocw.mit.edu/courses/mathematics/18-443-statistics-for-applications-fall-2006/lecture-notes/lecture14.pdf
>
> Take a look at 2 sample KS stats and the relationship to the 1 sample ...
> page 88. You already have the 1 sample table.
The problem is th
In:
http://ocw.mit.edu/courses/mathematics/18-443-statistics-for-applications-fall-2006/lecture-notes/lecture14.pdf
Take a look at 2 sample KS stats and the relationship to the 1 sample ...
page 88. You already have the 1 sample table.
Cheers,
Ajo
On Sat, Aug 10, 2013 at 9:16 AM, Phil Steitz w
On 8/10/13 8:59 AM, Ajo Fod wrote:
> This depends on data size. If it fits in memory, a single pass through the
> sorted array to find the biggest differences would suffice.
>
> If the data doesn't fit, you probably need a StorelessQuantile estimator
> like QuantileBin1D from the colt libraries. Th
This depends on data size. If it fits in memory, a single pass through the
sorted array to find the biggest differences would suffice.
If the data doesn't fit, you probably need a StorelessQuantile estimator
like QuantileBin1D from the colt libraries. Then pick a resolution and do
the single pass
Hi
How to go ahead with it?
Le 6 août 2013 04:07, "Romain Manni-Bucau" a écrit :
> I thought to "i see you" or "i watch you"..., the idea being to get i and
> y at the start and end to do "iwy" or "isy" which is a bit fun and could be
> represented by a small and funny animal.
> Le 6 août 2013 0
12 matches
Mail list logo
