FWIW, I built the commons vfs site with Maven 3 and didn't have any issues.
On Sep 8, 2011, at 10:00 PM, Greg Sterijevski wrote:
> Okay will do. My primary computer died, so I moved to a Mac. Its a bit of
> learning curve, even coming from linux.
>
> Thank you,
>
> -Greg
>
> On Thu, Sep 8, 2
Okay will do. My primary computer died, so I moved to a Mac. Its a bit of
learning curve, even coming from linux.
Thank you,
-Greg
On Thu, Sep 8, 2011 at 11:58 PM, Phil Steitz wrote:
> I know some people have gotten maven 3 to work, but I think most [math]
> developers use maven 2. That's what
I know some people have gotten maven 3 to work, but I think most [math]
developers use maven 2. That's what I use at least. You might try that.
Phil
On Sep 8, 2011, at 9:19 PM, Greg Sterijevski wrote:
> Hello All,
>
> I am seeing this. My build is on a Mac. Does anyone have any clues?
>
>
Hello All,
I am seeing this. My build is on a Mac. Does anyone have any clues?
[ERROR] Failed to execute goal
org.apache.maven.plugins:maven-site-plugin:3.0-beta-3:site (default-site) on
project commons-math: failed to get Reports: Unable to parse configuration
of mojo org.codehaus.mojo:findbugs-
I agree with Ted. You sometimes run into this issue with psuedoinverses. You
discover a zero eigenvalue at index i. The user's natural inclination is to
attribute it to the corresponding column of the data matrix.
-Greg
On Thu, Sep 8, 2011 at 6:55 PM, Ted Dunning wrote:
> OK.
>
> Replace that w
Gilles,
Is the test checked in? I am interested in looking at it.
Thank you,
-Greg
On Thu, Sep 8, 2011 at 2:51 PM, Ted Dunning wrote:
> On Thu, Sep 8, 2011 at 12:42 PM, Luc Maisonobe >wrote:
>
> > ... Luc - are there other reasons that QR would be better for cov
> >> matrices? I would have
Sorry Ted, I was not very clear in my explanations.
solve does return a RealMatrix. Internally, it builds BlockRealMatrix, though.
The issue is that Luc needs the underlying double[][] array in this
ODE application. This you could easily get if the returned matrix were
a Array2DRowRealMatrix, and y
Why doesn't solve just return a RealMatrix? Why does it insist on returning
an Array2DRowRealMatrix?
Does the user really care?
2011/9/8 Sébastien Brisard
> Hi Luc,
> thanks for your detailed explanations attached to the MATH-659. I'm
> worried about the changes I have applied to the code, now
Hi Luc,
thanks for your detailed explanations attached to the MATH-659. I'm
worried about the changes I have applied to the code, now. Here is
what I've done. I've replaced the following line
{code}
return new Array2DRowRealMatrix(decomposition.getSolver().solve(b), false);
{code}
with
{code}
RealM
On Fri, Sep 9, 2011 at 12:25 AM, Elijah Zupancic wrote:
> Hi Niall,
>
> The source of the misunderstanding regarding the usage of chain may be
> my fault. Thank you very much for piping up and letting us know some
> of the history regarding the chain project.
>
> I was under the assumption that al
OK.
Replace that with the correct value. I meant it to be an index.
That doesn't change my other points. There is an inherent problem with
"less than" comments when you have subtracted several other elements
previously and only now notices that the remainder is less than some other
adjusted val
On 9 September 2011 00:36, sebb wrote:
> On 7 September 2011 03:23, Gary Gregory wrote:
>> Hi All:
>>
>> It feels like it's about time to vote on releasing version 22?
>
> Idea has been removed; Clirr has been added; comments have been updated.
>
> I think the only remaining issue is with the bun
On 7 September 2011 03:23, Gary Gregory wrote:
> Hi All:
>
> It feels like it's about time to vote on releasing version 22?
Idea has been removed; Clirr has been added; comments have been updated.
I think the only remaining issue is with the bundle plugin, which
keeps complaining about duplicate
Hi Niall,
The source of the misunderstanding regarding the usage of chain may be
my fault. Thank you very much for piping up and letting us know some
of the history regarding the chain project.
I was under the assumption that all keys of a Context were String
because in ContextBase in the initial
On Thu, Sep 08, 2011 at 09:36:47AM -0700, Ted Dunning wrote:
> Since the diagonal elements are heavily modified during the Cholesky
> decomposition, it isn't clear what these actually mean.
>
> With pivoting, the meaning of these is even less clear.
>
> Also, I thought that the test for non-posit
On Wed, Sep 7, 2011 at 6:10 AM, Gary Gregory wrote:
> On Wed, Sep 7, 2011 at 12:22 AM, Ralph Goers
> wrote:
>
>> Why is the idea plugin defined? IntelliJ hasn't needed it in a long time.
>>
>
> Good question.
>
> Should we get rid of it?
+1
> The warning at the start of all commons build is an
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-configuration has an issue affecting its community integration.
Th
On Wed, Sep 7, 2011 at 1:26 PM, Gary Gregory wrote:
> Should LockableFileWriter.close() be changed from:
>
> public void close() throws IOException {
> try {
> out.close();
> } finally {
> lockFile.delete();
> }
>
> to:
>
> public boolean close() th
Hi Niall!!!
ok I got you, sounds that instead of improving we put a step down on
the Context.
What is in your opinion the better way to manage the Context,
replacing it with with Map and using generics?
We thought String as a key maybe because influenced by some usecases,
but as you already told it
On Tue, Sep 6, 2011 at 9:39 AM, Simone Tripodi wrote:
> Hi Niall,
> thanks for the hint!
>
> Anyway (DISCLAIMER: I'm putting in the original chain author's shoes,
> so I couldn't say the truth) I immagine that users would be interested
> on having, as a Context, not just a place where storing comp
On Thu, Sep 8, 2011 at 12:42 PM, Luc Maisonobe wrote:
> ... Luc - are there other reasons that QR would be better for cov
>> matrices? I would have to play with a bunch of examples, but I
>> suspect with the defaults, Cholesky may do the best job detecting
>> singular problems.
>>
>
> I'm not su
Le 08/09/2011 09:15, Phil Steitz a écrit :
On 9/7/11 6:34 AM, Gilles Sadowski wrote:
Hi.
In class "AbstractLeastSquaresOptimizer" (in "o.a.c.m.optimization.general"),
the method "getCovariances()" uses "LUDecompositionImpl" to compute the
inverse of a matrix.
In my application, this leads to a
Le 08/09/2011 08:07, Sébastien Brisard a écrit :
Hi,
this question was raised while working on MATH-659, which I quote
{quote}
In rev1166533, I removed the call to this method in
AdamsNordsieckTransformer.initializeHighOrderDerivatives(double,
double[], double[][], double[][]). This raises one im
great, looking forward for more contributions Paul!!!
thanks a lot, have a nice day!
Simo
http://people.apache.org/~simonetripodi/
http://www.99soft.org/
On Thu, Sep 8, 2011 at 8:46 PM, Paul Benedict wrote:
> Here's my +1 non-binding.
>
> On Thu, Sep 8, 2011 at 1:38 PM, Simone Tripodi
> wrot
Here's my +1 non-binding.
On Thu, Sep 8, 2011 at 1:38 PM, Simone Tripodi wrote:
> Hi all,
> The proposal of making the 2.0-work brach as proper codebase in /trunk
> for the [chain] component passes with 3 +1 binding votes from
>
> * Simone Tripodi
> * James Carman
> * Matt Benson
>
> no other
Hi all,
The proposal of making the 2.0-work brach as proper codebase in /trunk
for the [chain] component passes with 3 +1 binding votes from
* Simone Tripodi
* James Carman
* Matt Benson
no other votes have been casted.
I'm going to move the current trunk in a 1.X branch, and the 2.0-work in
Am 08.09.2011 17:40, schrieb Simone Tripodi:
Hi!
Perhaps we should add an example section to Commons Parent, but
commented out, and a note to say it should be included in component
POMs?
+1 I think it would be helpful!
Agreed. This is a good idea.
Oliver
s/sote/site/
hehehe, in I
On 8 September 2011 16:07, sebb wrote:
> On 8 September 2011 07:42, Henri Yandell wrote:
>> On Tue, Sep 6, 2011 at 8:16 AM, wrote:
>>> Author: sebb
>>> Date: Tue Sep 6 15:16:47 2011
>>> New Revision: 1165701
>>>
>>> URL: http://svn.apache.org/viewvc?rev=1165701&view=rev
>>> Log:
>>> LANG-744 S
Since the diagonal elements are heavily modified during the Cholesky
decomposition, it isn't clear what these actually mean.
With pivoting, the meaning of these is even less clear.
Also, I thought that the test for non-positive definiteness was whether the
diagonal element after reduction from pr
Hi!
>
> Perhaps we should add an example section to Commons Parent, but
> commented out, and a note to say it should be included in component
> POMs?
>
+1 I think it would be helpful!
>
> s/sote/site/
>
hehehe, in Italian we say "the rush wants the calm", typed too hurry :P
Simo
http://people
I offer the Mahout implementation from MAHOUT-792 (not yet committed) as a
reference that does pivoting and has a settable threshold. It also uses
vectorized view operations to avoid touching the internal representation if
that helps.
On Thu, Sep 8, 2011 at 8:22 AM, Gilles Sadowski <
gil...@harfa
Could you be contaminating the cross product matrix when you do your
accumulation? I noticed one of the utility classes has methods for doing
safe accumulations. I know that this was part of the problem when I was
trying to estimate the Wampler data with the MillerRegression. Just a
thought...
On
On Thu, Sep 08, 2011 at 09:49:12AM -0500, Greg Sterijevski wrote:
> Cholesky, in my opinion, is not robust as you have discovered. When it
> encounters a non-psd matrix it gives up. Maybe that is the correct course of
> action, but I still think that when you are using the getCovariance to
> estima
Rank revealing Cholesky should be effectively about as good as an eigen
solution. The pivoting results in non-increasing diagonals and a sharp rank
indicator. You can do pseudo inverse things with the result as well.
Getting the actual pseudo inverse isn't a bad thing. I just don't see it as
en
On 8 September 2011 07:42, Henri Yandell wrote:
> On Tue, Sep 6, 2011 at 8:16 AM, wrote:
>> Author: sebb
>> Date: Tue Sep 6 15:16:47 2011
>> New Revision: 1165701
>>
>> URL: http://svn.apache.org/viewvc?rev=1165701&view=rev
>> Log:
>> LANG-744 StringUtils throws java.security.AccessControlExcep
On 8 September 2011 10:54, Simone Tripodi wrote:
> HA! gotcha!
> the section is missing in the Configuration
> pom, what you need is adding
>
>
>
>
> people.apache.org
The "standard" name is apache.website, according to COMMONSSITE-26,
but it does not matter too much.
> Apac
Cholesky, in my opinion, is not robust as you have discovered. When it
encounters a non-psd matrix it gives up. Maybe that is the correct course of
action, but I still think that when you are using the getCovariance to
estimate the curvature in the neighborhood of a point it would be okay to
take t
On Thu, Sep 08, 2011 at 12:15:20AM -0700, Phil Steitz wrote:
> On 9/7/11 6:34 AM, Gilles Sadowski wrote:
> > Hi.
> >
> > In class "AbstractLeastSquaresOptimizer" (in
> > "o.a.c.m.optimization.general"),
> > the method "getCovariances()" uses "LUDecompositionImpl" to compute the
> >
Now in SVN :)
Gary
On Thu, Sep 8, 2011 at 2:22 AM, Henri Yandell wrote:
> +1 :)
>
> On Wed, Sep 7, 2011 at 12:54 PM, Gary Gregory
> wrote:
> > On Wed, Sep 7, 2011 at 2:42 PM, sebb wrote:
> >
> >> On 7 September 2011 19:26, Gary Gregory wrote:
> >> > Hi All:
> >> >
> >> > The message for the
Hi.
In revision 1166674, I've added an argument to that exception so that it can
print the value that failed the test.
However, I also wonder whether the message should not be
---CUT---
not positive definite matrix: diagonal element at ({1},{1}) is not strictly
larger than {2} ({0})"
---CUT---
If speed is not a factor, why not do the best thing and calculate the
eigenvalue decomposition and then form a moore-penrose inverse. The
inversion will never fail (unless all eigenvalues are zero). You will also
have an immediate diagnostic of the stability of the system (through the
condition or
The Apache Commons team is pleased to announce the availability
of Commons Configuration 1.7.
The Commons Configuration software library provides a generic
configuration interface which enables an application to read
configuration data from a variety of sources, e.g. properties files, XML
docu
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
HA! gotcha!
the section is missing in the Configuration
pom, what you need is adding
people.apache.org
Apache Commons Site
${commons.deployment.protocol}://people.apache.org/www/commons.apache.org/configuration
and run
mvn site-deploy -Dcommons.deploym
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-configuration has an issue affecting its community integration.
Th
Hi Simone,
many thanks for your support, but there seems to be a different problem.
I did run mvn site:site before. Obviously maven does not know where to
deploy the site.
Well, it is possible to copy the site per hand to its location at
people.apache.org. I was also able to adapt the distri
On 9/7/11 9:26 PM, Greg Sterijevski wrote:
> I thought that QR is of O(n^3) complexity, while LU is probably in the
> vicinity of O(n^2.5). While this is not a barn burning improvement, it is an
> improvement. Consider that if you are using the covariance of the parameters
> in deciding how to make
On 9/7/11 1:07 PM, Ted Dunning wrote:
> Does the LUDecomposition not use pivots?
Yes
> LU should always do so since it is
> numerically unstable otherwise. I would be surprised if it doesn't given
> the normal level of quality in commons math.
>
> QR is, of course, almost always preferable to LU
On 9/7/11 6:34 AM, Gilles Sadowski wrote:
> Hi.
>
> In class "AbstractLeastSquaresOptimizer" (in
> "o.a.c.m.optimization.general"),
> the method "getCovariances()" uses "LUDecompositionImpl" to compute the
> inverse of a matrix.
> In my application, this leads to a "SingularMat
49 matches
Mail list logo
