On 10/28/11 9:31 PM, Sébastien Brisard wrote:
> Hi,
> The following question might sound stupid, but occured to me while
> thinking about MATH-692. So here goes. What was initially meant by
> "Continuous Distribution" (as in AbstractContinuousDistribution) ?
> My view on this is that the underlying
Hi,
The following question might sound stupid, but occured to me while
thinking about MATH-692. So here goes. What was initially meant by
"Continuous Distribution" (as in AbstractContinuousDistribution) ?
My view on this is that the underlying random variable is defined by a
*density*, which takes
Online report :
http://vmbuild.apache.org/continuum/buildResult.action?buildId=13852&projectId=97
Build statistics:
State: Failed
Previous State: Ok
Started at: Sat 29 Oct 2011 00:29:22 +
Finished at: Sat 29 Oct 2011 00:31:28 +
Total time: 2m 6s
Build Trigger: Schedule
Build
Shouldn't Vectorial be Vector?
On Fri, Oct 28, 2011 at 2:30 PM, Gilles Sadowski <
gil...@harfang.homelinux.org> wrote:
> Hello.
>
> I think that something is not quite right in those class names:
> UnivariateMatrixFunction
> UnivariateRealFunction
> UnivariateVectorialFunction
>
> To be consis
Hi all guys,
Since 72 hours passed I'm declaring this vote as closed and passed
with 3 positive votes from PMCs:
* Simone Tripodi
* Luc Maisonobe
* Oliver Heger
no other votes were cast.
I'll move the proposed release to dist/ and give 24 hours for mirrors
to sync before making ANN and site u
Hello.
I think that something is not quite right in those class names:
UnivariateMatrixFunction
UnivariateRealFunction
UnivariateVectorialFunction
To be consistent, we should either
1. indicate the "grouping" and "number" type everywhere:
UnivariateRealMatrixFunction
Univaria
On 27 October 2011 13:02, Gary Gregory wrote:
> Hi Adrian,
>
> I usually carefully follow the steps in
> https://wiki.apache.org/commons/UsingNexus
Some of which is not appropriate for Sandbox components, as they do
not have releases.
> Gary
>
> On Thu, Oct 27, 2011 at 7:08 AM, Adrian Crum <
> a
On Fri, Oct 28, 2011 at 07:20:34AM -0700, Phil Steitz wrote:
> [...]
> BoundedPoint. As I said, this is what I tend to do at the moment, but
> I have mixed feelings about this solution vs. passing 3 double[]. Any
> thoughts about this side question?
> >>> On the principle, you
On 10/28/11 12:14 AM, Luc Maisonobe wrote:
> Le 28/10/2011 08:27, Sébastien Brisard a écrit :
>
> Hi Sébastien,
>
>> 2011/10/27 Gilles Sadowski :
>> The BOBYQA optimizer takes simple bound contraints into account:
>> lowerBound(i) <= p(i) <= upperBound(i)0 <= i < n
>> where "n" is
+1
Le 28/10/2011 07:14, Stefan Bodewig a écrit :
Hi all,
compared to RC1 Michael Kuss' name has been fixed and he's been added as
contributor. A bunch of additional tests increased coverage (still some
areas are not covered but coverage is better than it has been for any
prior release). A few
To whom it may engage...
This is an automated request, but not an unsolicited one. For
more information please visit http://gump.apache.org/nagged.html,
and/or contact the folk at gene...@gump.apache.org.
Project commons-proxy-test has an issue affecting its community integration.
This
Hello Michael,
On Wed, Oct 26, 2011 at 5:02 PM, Michael Kuß wrote:
> It is ok for me if it is fixed some time in the future.
> Yes, that was this Markus Kuss. Although I requested it to be
> changed to Christian Grobmeier.
> Just do not go into too much trouble.
for some reason I don't remember
Hi Gilles,
>
>> > but this could be handled by
>> > returning eg a negative value.
>
> That's not very object-oriented. ;-)
>
Touché !
Best regards,
Sébastien
-
To unsubscribe, e-mail: dev-unsubscr...@commons.apache.org
For addi
Hi Luc,
2011/10/28 Luc Maisonobe :
> Le 28/10/2011 08:27, Sébastien Brisard a écrit :
>
> Hi Sébastien,
>
>> 2011/10/27 Gilles Sadowski :
>> The BOBYQA optimizer takes simple bound contraints into account:
>> lowerBound(i) <= p(i) <= upperBound(i) 0 <= i < n
>> where "n" is the pr
Hello.
> >>> [...]
> >>> In order to avoid this, what I tend to do at the moment is to define a
> >>> new class --say, BoundedPoint-- which would hold three double:s an
> >>> initial value, a lower bound and an upper bound. Then I would just
> >>> provide the method with the corresponding array of
Le 28/10/2011 08:27, Sébastien Brisard a écrit :
Hi Sébastien,
> 2011/10/27 Gilles Sadowski :
> The BOBYQA optimizer takes simple bound contraints into account:
> lowerBound(i) <= p(i) <= upperBound(i)0 <= i < n
> where "n" is the problem dimension.
>
> The parent class
16 matches
Mail list logo
