Re: [ALL] Volunteers for a Math IPMC?

e.org/jira/browse/MATH-172 > [Or is that out of scope for an incubation proposal?] Incubator is not a place to rethink code. It is primarily for building community. > > > > Gilles > > > On Fri, Jun 17, 2016 at 3:35 PM, Gilles <gil...@harfang.homelinux.org> >> wrote:

Re: [ALL] Volunteers for a Math IPMC?

because CM is being kicked out of Commons. On Fri, Jun 17, 2016 at 3:35 PM, Gilles <gil...@harfang.homelinux.org> wrote: > On Fri, 17 Jun 2016 08:51:36 -0700, Ted Dunning wrote: > >> Excuse me? >> >> See inline. >> >> >> >> On Fri, Jun 17,

Re: [ALL] Volunteers for a Math IPMC?

Excuse me? See inline. On Fri, Jun 17, 2016 at 7:50 AM, Gilles wrote: > Hi all. > > On Tue, 14 Jun 2016 11:01:13 -0700, Ralph Goers wrote: > >> I thought this had been made clear. Several months Commons voted to >> make Math a TLP. But shortly after that most

Re: [ALL] Volunteers for a Math IPMC?

On Wed, Jun 15, 2016 at 10:21 AM, John D. Ament wrote: > Yep absolutely. I don't think the incubator has ever rejected a project? > We have discouraged some submissions. But I have never seen a formal submission be denied.

Re: [ALL] Volunteers for a Math IPMC?

Jochen, The need to build the community (nearly) from scratch is definitely NOT a reason for rejection. It is simply a risk factor that must be mitigated to succeed in incubation. On Tue, Jun 14, 2016 at 10:51 PM, Jochen Wiedmann wrote: > On Tue, Jun 14, 2016 at

Re: [ALL] Volunteers for a Math IPMC?

On Tue, Jun 14, 2016 at 2:29 PM, John D. Ament wrote: > We generally expect some kind of backing community to bring this to. We > have seen pretty consistently that starting from an empty community doesn't > work. It doesn't mean that it's impossible, but very hard to

Re: [ALL] Volunteers for a Math IPMC?

Looking back through the discussion, it is a bit of a problem that one of the major reasons given for the fork is that the team thought that they didn't have a large enough PMC and that incubation wouldn't get them enough additional contributors. That made it seem like the project should go

Re: [collections] MultiValuedMap interface discussion

Following Guava on this has something to be said for it. https://code.google.com/p/guava-libraries/wiki/NewCollectionTypesExplained Their decision is that Multimap#get returns a collection always. If there are no values, then an empty collection is returned so that you can always do

Re: [math] Proposal for New way of Computing an approximate Percentile without storing input data

On Sun, Mar 23, 2014 at 2:09 AM, Thomas Neidhart thomas.neidh...@gmail.comwrote: There is already an issue for this: https://issues.apache.org/jira/browse/MATH-418 It links also other implementations and algorithms, maybe you could add a link to your's as well? Done. Thanks for the

Re: [math] Proposal for New way of Computing an approximate Percentile without storing input data

Murthy, I recently developed an alternative algorithm which provides superior accuracy for extreme quantiles. You can read more at https://github.com/tdunning/t-digest/blob/master/docs/t-digest-paper/histo.pdf?raw=true The library involved is available via maven and is apache licensed. Apache

Re: [math] refactoring least squares

On Tue, Feb 25, 2014 at 6:22 AM, Konstantin Berlin kber...@gmail.comwrote: Hi, I am really having problems believing that matrix copying is the major problem in an optimization algorithm. Copying is O(N^2) operations. Surely, for any problem where performance would matter, it is completely

Re: [math] refactoring least squares

On Tue, Feb 25, 2014 at 8:39 AM, luc l...@spaceroots.org wrote: Also, I think testing should be done on an actual large problem where scaling issuing would show up. The 1000x2 jaccobian would results in a 2x2 normal equation. Surely this is not a good test case. Konstantin As you point

Re: [math] refactoring least squares

On Mon, Feb 24, 2014 at 10:23 AM, Gilles gil...@harfang.homelinux.orgwrote: One way to improve performance would be to provide pre-allocated space for the Jacobian and reuse it for each evaluation. Do you have actual data to back this statement? The LeastSquaresProblem interface would

Re: [math]

On Mon, Feb 17, 2014 at 5:01 AM, Emmanuel Joliet ejol...@sciops.esa.intwrote: https://issues.apache.org/jira/browse/MATH-870 Recently, many problems have been found out with class ... Please, consider not removing it. We use it heavily and need the class as it gives what we need (handling

Re: [math] trouble with SingularValueDecomposition

0.6238274168581248 0.7787213901449556 -Original Message- From: Ted Dunning [mailto:ted.dunn...@gmail.com] Sent: Saturday, February 15, 2014 2:17 AM To: Commons Developers List Subject: Re: [math] trouble with SingularValueDecomposition For what its worth, I tested the Mahout SVD which

Re: [math] trouble with SingularValueDecomposition

And what exactly are the results you are getting? On Fri, Feb 14, 2014 at 6:07 PM, Patrick Meyer meyer...@gmail.com wrote: Hi, I am using the SingularValueDecomposition class with a matrix but it gives me a different result than R. My knowledge of SVD is limited, so any advice is

Re: [math] trouble with SingularValueDecomposition

For what its worth, I tested the Mahout SVD which shares code lineage with the Commons Math implementation. The results I got were: *sum(abs(m - u * s * v')) = 4.31946146e-16S =1.002319690998 1.0023196909981. U =0.994059401897 0.067747631244

Re: [LANG] New class called StringAlgorithms?

On Fri, Jan 17, 2014 at 4:11 AM, Benedikt Ritter brit...@apache.org wrote: A concrete use case could be a query engine which allows customizing its string matching algorithm. Is this really a use case? It sounds very constructed to me. Have you ever thought I'd like to query on google,

Re: [Math] src/userguide/java

In my experience, examples are most useful as ... well ... examples. As such, they should be an example of how user code works. That means that they should be a complete stand-alone project, just as most user programs should be complete and standalone. If you want to also deliver a pre-compiled

Re: [math] Include test data from netlib

From the FAQ: *2.1) What is Netlib? *The Netlib repository contains freely available software, documents, and databases of interest to the numerical, scientific computing, and other communities. The repository is maintained by ATT Bell Laboratories, the University of Tennessee and Oak Ridge

Re: [MATH] Eigen decomposition of matrices consisting of RealFieldElements

I had the same question. Presumably, it is a reasonable thing to have in the corner case of needing eigenvalues for matrices with extended precision decimal numbers or some such, but I would be very surprised if there measurably non-zero demand for such a feature. On Thu, Dec 19, 2013 at 9:55

Re: [math] Re: Sparse matrices not supported anymore?

On Fri, Nov 8, 2013 at 11:47 AM, Luc Maisonobe l...@spaceroots.org wrote: is there still consensus that we are going to remove the sparse implementations with 4.0? Well, I really think it is a pity, we should support this. But lets face it: up to now we have been unable to do it properly.

Re: I need a map for long and double

, odd. Now looking at fastutil... Gary Gary On Tue, Nov 5, 2013 at 8:59 PM, Ted Dunning ted.dunn...@gmail.com wrote: Trove is GPL (last I looked). Mahout has primitive collection implementations (and is obviously ASL). There are other implementations such as hppc (see http

Re: [math] Multithreaded performances

On Mon, Nov 4, 2013 at 10:09 PM, Romain Manni-Bucau rmannibu...@gmail.comwrote: Oh sorry, that's what I said early, in a real app no or not enough to be an issue buy on simple apps or very high thrououtput apps yes. Le 5 nov. 2013 07:00, Ted Dunning ted.dunn...@gmail.com a écrit

Re: I need a map for long and double

Trove is GPL (last I looked). Mahout has primitive collection implementations (and is obviously ASL). There are other implementations such as hppc (see http://labs.carrotsearch.com/hppc.html ) Mahout is a decent implementation, but I think that hppc has had a round or two more optimization.

Re: [math] Multithreaded performances

My experience is that the only way to get really high performance with counter-like objects is to have one per thread and combine them on read. On Mon, Nov 4, 2013 at 8:49 AM, Romain Manni-Bucau rmannibu...@gmail.comwrote: Hi, ATM sirona (a java monitoring library in incubator) relies a

Re: [math] Multithreaded performances

I still think that what you need is a thread-safe copy rather than a thread-safe mutate. Even if you force every thread to do the copy, the aggregation still still wins on complexity/correctness/performance ideas. On Mon, Nov 4, 2013 at 12:58 PM, Romain Manni-Bucau rmannibu...@gmail.comwrote:

Re: [math] Multithreaded performances

, Phil Steitz phil.ste...@gmail.com a écrit : On 11/4/13 2:22 PM, Ted Dunning wrote: I still think that what you need is a thread-safe copy rather than a thread-safe mutate. I was just thinking the same thing. Patches welcome. Phil Even if you force every thread to do the copy

Re: [math] Multithreaded performances

On Mon, Nov 4, 2013 at 8:23 PM, Phil Steitz phil.ste...@gmail.com wrote: On 11/4/13 3:44 PM, Ted Dunning wrote: The copy doesn't have to lock if you build the right data structure. The individual stats objects need to update multiple quantities atomically when new values come

Re: [math] Multithreaded performances

Le 5 nov. 2013 06:46, Ted Dunning ted.dunn...@gmail.com a écrit : On Mon, Nov 4, 2013 at 8:23 PM, Phil Steitz phil.ste...@gmail.com wrote: On 11/4/13 3:44 PM, Ted Dunning wrote: The copy doesn't have to lock if you build the right data structure. The individual stats objects need

Re: [MATH] Interest in large patches for small cleanup / performance changes?

On Sun, Nov 3, 2013 at 10:56 AM, Luc Maisonobe l...@spaceroots.org wrote: I had proposed that error messages be incrementally built from simple base patterns, to be assembled either at the point where the exception is going to be thrown or inside specific exceptions[2] (or a combination

Re: [MATH] Interest in large patches for small cleanup / performance changes?

How many of these actually matter any more? On Sat, Nov 2, 2013 at 7:52 AM, Sean Owen sro...@apache.org wrote: In Math, is there any appetite for large patches containing many instances of particular micro-optimizations? Examples: - Replace: a[i][j] = a[i][j] + foo; with:

Re: [Math] due-to attribute in changes.xml

On Thu, Oct 31, 2013 at 10:24 AM, Gilles gil...@harfang.homelinux.orgwrote: The person who raised the bug still took the trouble to do so. My question is still: is it sufficient? Without filing a bug report, the reporter is harming himself. Also, some reports are only feature requests. I

Re: [MATH] Repurposing a deprecated constructor in EigenDecomposition

On Wed, Oct 23, 2013 at 3:14 PM, Sean Owen sro...@gmail.com wrote: EigenDecomposition resembles QR in this respect, as far as they are implemented here. This argues for them to treat arguments similarly. Actually not. It is quite reasonable for the EigenDecomposition to stop when singularity

Re: [MATH] Repurposing a deprecated constructor in EigenDecomposition

On Wed, Oct 23, 2013 at 8:33 PM, Sean Owen sro...@gmail.com wrote: it feels a little funny just because then we should have similar logic for other decompositions. I think I remember the LU one stops early, always. The stopping early is definitely an option with QR. With LU, it isn't so

Re: svn commit: r1533990 - /commons/proper/math/trunk/src/main/java/org/apache/commons/math3/distribution/BetaDistribution.java

Thread issue. Off topic for this thread. No idea how this happened. On Mon, Oct 21, 2013 at 3:25 PM, Phil Steitz phil.ste...@gmail.com wrote: Was this maybe to the wrong thread, or is there a doco issue here? Phil On Oct 20, 2013, at 10:42 PM, Ted Dunning ted.dunn...@gmail.com wrote

Re: [math] MathIllegalArgumentException

+1 The overwhelming standard practice is to use a plausible exception type (such as some form of IllegalArgumentException) with a message. On Mon, Oct 21, 2013 at 5:24 PM, Phil Steitz phil.ste...@gmail.com wrote: I hate to open this can of worms again, but the following is just too painful

Re: svn commit: r1533990 - /commons/proper/math/trunk/src/main/java/org/apache/commons/math3/distribution/BetaDistribution.java

This makes it somewhat harder to read the docs code which is where I read docs 90+% of the time. On the other hand my IDE will do the right thing if I ask it to. Sent from my iPhone On Oct 20, 2013, at 14:27, Thomas Neidhart thomas.neidh...@gmail.com wrote: On 10/20/2013 11:24 PM,

Re: [OT][LANG] Blog post about Validate vs. Guava Preconditions

In general, it is going to be very, very hard for Commons to go up against guava. The Preconditions stuff is only the tip of the ice-berg. The advantages highlighted in the blog are typical of every aspect of guava ... well thought out (the different exception types and varargs for instance) and

Re: [math] Add Pair factory method, toString(), Comparator

On Thu, Oct 17, 2013 at 2:06 PM, Gilles gil...@harfang.homelinux.orgwrote: The issue is closed, thank you. To be honest I'm sorry I opened this issue, as it wasn't worth this much time or annoyance. If the regular contributors were thinking that way, no work would be done. There wouldn't be

Re: [CHALLENGE] Move All of Commons to the Dormant

Careful there. Hen might suggest making that list dormant. Sent from my iPhone On Oct 16, 2013, at 0:38, Jörg Schaible joerg.schai...@gmx.de wrote: BTW: We have already a challenge result, it's just terribly out of date: https://wiki.apache.org/commons/CommonsPeople

Re: [math] Add Pair factory method, toString(), Comparator

Does this really add comparisons on average? Or does it only add comparisons on key equality? If the latter the difference is definitely minute. Secondly, changing comparator value to include value changes how sets work. Usually, this is good. Occasionally bad. In any case, a change that is

Re: [VOTE] Move Apache Commons to Git for SCM... - is not a consensus

Ralph, Majority votes at ASF almost never require a majority of all possible voters. Almost always the (plus 3 plus minus) convention is used. As you can find in innumerable threads as well, consensus among the discussion participants is preferable for big changes (like moving to git).

Re: [VOTE] Move Apache Commons to Git for SCM... - is not a consensus

in that). On Sunday, October 13, 2013, Ted Dunning wrote: Ralph, Majority votes at ASF almost never require a majority of all possible voters. Almost always the (plus 3 plus minus) convention is used. As you can find in innumerable threads as well, consensus among

Re: [VOTE] Move Apache Commons to Git for SCM... - is not a consensus

that said while consensus isn't unanimous it also isn't the simple majority vote either, so to state that consensus was reached is incorrect because there were several -1 votes. Ralph On Oct 13, 2013, at 3:51 PM, Ted Dunning wrote: Ralph, Majority votes at ASF almost never require

Re: [DISCUSS] Why is releasing such a pain and what can we do to make it easier?

On Mon, Oct 14, 2013 at 2:55 AM, Henri Yandell flame...@gmail.com wrote: I propose release votes be simple revision based requests and involve no artifact churn :) Hen, This is a pretty good idea. But I still think that artifact churn will be a necessary process in order to get enough valid

Re: [VOTE] Moving to Git...

I hate myself a bit for jumping in here, but as much as I prefer git, I really don't think that changing will make that much difference. The problem with commons is that people have much more energy for interminable conversations about things that don't much matter (like this thread). People who

Re: [OT] Anyone going to JavaOne?

I am not going, but we have a ton of guys there. Drop by the MapR booth and say hi! On Thu, Sep 19, 2013 at 12:50 PM, James Carman ja...@carmanconsulting.comwrote: Is anyone planning on going? It would be great to meet some of you guys face-to-face for once, if you're going to be there.

[MATH] Re: commons-math pull request: Two implementations of least squares in separeat...

On Tue, Aug 27, 2013 at 7:41 AM, Gilles gil...@harfang.homelinux.orgwrote: The patch does not apply cleanly (special options needed to handle output from git?). Try different prefix levels. The -p0 option is commonly helpful.

Re: MannWhitneyUTest.mannWhitneyU

I think that it will be somewhat slower, but next to imperceptibly so. It will not be any more accurate. It should be noted, however, that this code will fail for input longer than 2^16 because of integer overflow. On Sun, Aug 25, 2013 at 8:27 PM, Dave Brosius dbros...@apache.org wrote: I

Re: Need for an alternatives to the main line of code.

On Thu, Aug 22, 2013 at 11:52 AM, Luc Maisonobe luc.maison...@free.frwrote: Then you just clone it as you would clone any repositories and provide a link to your own repository. If I remember well, Evan just did that a few days ago. And you can do with it as you will. Build a prototype

Re: Need for an alternatives to the main line of code.

+1 Sent from my iPhone On Aug 21, 2013, at 9:42, Ajo Fod ajo@gmail.com wrote: I hope you'll agree that as it stands, this makes CM capable of only solving a subset the mathematical problems of what it can solve with a more open policy. The argument for alternative designs of the API

Re: [math] Kolmogorov-Smirnov 2-sample test

On Sat, Aug 10, 2013 at 8:59 AM, Ajo Fod ajo@gmail.com 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

Re: [Math] Fluent API, inheritance and immutability

This is often dealt with by using builder classes and not putting all the fluent methods on the objects being constructed. The other way to deal with this is to use a covariant return type. For instance, there is no guarantee that Pattern.compile returns any particular class other than that it

Re: [Math] Does any commiter understand Change of variables?

The math is quite simple. What is not clear is what the numerical properties are for substitution of the sort being advocated. Which functions will do better with substitution? Which will do better with Laguerre polynomials? On Sat, Jul 20, 2013 at 8:59 AM, Ajo Fod ajo@gmail.com wrote:

Re: [Math] Cleaning up the curve fitters

The discussion about how to get something into commons when it is (a) well documented and (b) demonstrated better on at least some domains is partially procedural, but it hinges on technical factors. I think that Ajo is being very reserved here. When I faced similar discouragement in the past

Re: [Math] Cleaning up the curve fitters

On Fri, Jul 19, 2013 at 12:27 PM, Phil Steitz phil.ste...@gmail.com wrote: It still seems to me that it would serve CM well to pay more attention to Ajo's comments and suggestions. Simply saying that we should focus on technical discussion when CM's list is filled with esthetic arguments

Re: [math] Math-Jax in javadoc?

We have adopted this in Mahout based on the suggestion I saw here. It works great. On Sun, Jul 14, 2013 at 2:31 PM, Ajo Fod ajo@gmail.com wrote: I like this idea too. Im curious to know how it works. +1 On Sun, Jul 14, 2013 at 11:35 AM, Thomas Neidhart thomas.neidh...@gmail.com

Re: [math] Math-Jax in javadoc?

. On Sun, Jul 14, 2013 at 10:01 PM, Phil Steitz phil.ste...@gmail.com wrote: On 7/14/13 3:24 PM, Ted Dunning wrote: We have adopted this in Mahout based on the suggestion I saw here. It works great. I just opened a ticket (https://issues.apache.org/jira/browse/MATH-1006) and attached

Re: Lang: ObjectUtils

A bigger question is why this is needed at all. Why not just use composition? In guava, one would do this: Iterables.all(Arrays.asList(foo), new PredicateDouble() { @Override public boolean apply(Double input) { return input != null; }

Re: [math] On MATH-995: Problems with LegendreGaussQuadrature class.

On Fri, Jun 28, 2013 at 9:05 AM, Gilles gil...@harfang.homelinux.orgwrote: Did you read my other (rather more lengthy) post? Is that jumping? Yes. You jumped on him rather than helped him be productive. The general message is we have something in the works, don't bother us with your ideas.

Re: [Bag] random pick

...@gmail.com I remplaced the patch 2013/3/13 Ted Dunning ted.dunn...@gmail.com You seem to have reformatted the entire file. This makes it nearly impossible to review your suggested change. Can you make a diff that doesn't involve changing every line in the file? On Tue, Mar 12, 2013

Re: [Bag] random pick

You seem to have reformatted the entire file. This makes it nearly impossible to review your suggested change. Can you make a diff that doesn't involve changing every line in the file? On Tue, Mar 12, 2013 at 3:48 PM, Othmen Tiliouine tiliouine.oth...@gmail.com wrote: i puted the suggestion

Re: [Bag] random pick

Othmen, The common way to contribute code is to file a bug report/enhancement request at the correct commons component: https://issues.apache.org/jira/secure/BrowseProjects.jspa#10260 My guess is that you want collections which is at https://issues.apache.org/jira/browse/COLLECTIONS Then you

Re: [ALL] How to handle static imports [was: Re: svn commit: r1441784 - /commons/sandbox/beanutils2/trunk/src/main/java/org/apache/commons/beanutils2/PropertyDescriptorsRegistry.java]

Another common use is with junit to import assertEquals and such. On Mon, Feb 4, 2013 at 4:41 PM, Gary Gregory garydgreg...@gmail.com wrote: On Mon, Feb 4, 2013 at 4:32 PM, Benedikt Ritter brit...@apache.org wrote: ... We haven't decided yet how to handle static imports. To form some

Re: [math] DiscreteEmpiricalDistribution

This will be very useful. Sampling from discrete ECDF's is also closely related to generating samples from a multinomial distribution. I did a bit of work on the latter problem. The result of that work is in org.apache.mahout.math.random.Multinomial The major difference that you will have is

Re: [math] [linear] immutability

On Tue, Jan 1, 2013 at 10:25 AM, Phil Steitz phil.ste...@gmail.com wrote: Agreed we should keep the discussion concrete. Sebastien and Luc have both mentioned specific examples where the overhead of matrix data copy and storage creates practical problems. Konstantin mentioned another

Re: [math] [linear] immutability

On Tue, Jan 1, 2013 at 11:17 AM, Sébastien Brisard sebastien.bris...@m4x.org wrote: Please mention that when I first mentioned in-place operations, I didn't have speed in mind, but really memory. I think we would not gain much speedwise, as Java has become very good at allocating objects

Re: [math] [linear] immutability

My apologies, but I have totally lost track of who said what because too many comments have enormous lines immediately adjacent to responses. On Tue, Jan 1, 2013 at 11:39 AM, Somebody s...@body.org wrote: I thought that maybe it was due to the underlying (dynamic) data structure for sparse

Re: [math] [linear] immutability

On Mon, Dec 31, 2012 at 9:30 AM, Phil Steitz phil.ste...@gmail.com wrote: If we stick to 0) algebraic objects are immutable 1) algorithms defined using algebraic concepts should be implemented using algebraic objects ... 0) Start, with Konstantin's help, by fleshing out the InPlace

Re: [math] major problem with new released version 3.1

Dim has it exactly right here. On Sun, Dec 30, 2012 at 10:38 AM, Dimitri Pourbaix pourb...@astro.ulb.ac.be wrote: In optimization, the user supplies the function to be minimised. In curve fitting, the user supplies a series of observations and the model to be fitted. Trying to combine both

Re: [math] major problem with new released version 3.1

Konstantin, We are close then. Yes optimization should use vector methods as possible. But visitor functions are very easy to add in an abstract class. They impose very little burden on the implementor. On Sun, Dec 30, 2012 at 8:52 AM, Konstantin Berlin kber...@gmail.comwrote: I think we

Re: [math] major problem with new released version 3.1

The GPU requires native code that is executed on the GPU. Standard linear algebra libraries exist for this so if the API can express a standard linear algebra routine concisely, then the GPU can be used. General Java code usually can't be executed on a GPU. There is some late breaking news on

Re: [math] major problem with new released version 3.1

On Sun, Dec 30, 2012 at 12:16 PM, Konstantin Berlin kber...@gmail.comwrote: ... There would be no burden on the user's side: the visitor pattern has been implemented for RealVectors in version 3.1. Besides, we could provide all the relevant visitors (addition, scaling, …) There is an

Re: [math] major problem with new released version 3.1

Actually, the visitor pattern or variants thereof can produce very performant linear algebra implementations. You can't usually get quite down to optimized BLAS performance, but you get pretty darned fast code. The reason is that the visitor is typically a very simple class which is immediately

Re: [math] major problem with new released version 3.1

access. I just don't want the vector operations to be tied to any particular implementation detail. On Dec 29, 2012, at 6:30 PM, Ted Dunning ted.dunn...@gmail.com wrote: Actually, the visitor pattern or variants thereof can produce very performant linear algebra implementations. You can't

Re: [math] pearson and spearman correlation runtime complexity

Can you say more about how you implemented these? The Pearson coefficient should be quite simple. A few passes through the data should suffice and it can probably be done in one pass, especially if you aren't worried about 1ULP accuracy. The Spearman coefficient should be no worse than the cost

Re: [Math] Old to new API (MultivariateDifferentiable(Vector)Function)

Correctness isn't that hard to get. You just need to add a bitmap for exceptional values in all matrices. This bitmap can be accessed by sparse operations so that the iteration is across the union of non-zero elements in the sparse vector/matrix and exception elements in the operand. That fact

Re: [math] Checking preconditions on package private functions

That's fine. I think raw use of reflection might make the tests pretty complicated, but the idea is reasonable. Jmockit allows mocking of static methods (I have used it to mock System.nanoTime(), for instance). By using a partial mock class, you can gain access to private methods as well. On

Re: [math] Checking preconditions on package private functions

I can only say from my own experience that people make mistakes over time and having the code warn them when that happens is a good thing. Your experience may be different but I have to admit that I have done some pretty silly things along the lines of forgetting to follow some constraint.

Re: [CSV] Discussion about the new CSVFormatBuilder

Surely you meant to say no other commons library. Builder patterns are relatively common. See guava for instance: http://docs.guava-libraries.googlecode.com/git/javadoc/com/google/common/base/Splitter.html On Tue, Nov 20, 2012 at 11:49 AM, Gary Gregory garydgreg...@gmail.comwrote: - it has

Re: [CSV] Discussion about the new CSVFormatBuilder

Another way of looking at the builder style is that it is Java's way of using keyword arguments for complex constructors. It also allows a reasonable amount of future-proofing. These benefits are hard to replicate with constructors. On the other hand, builder-style patterns are a royal pain

Re: [Math] MATH-894

The typical answer to this when adding a functional method like compute is to also add a view object. The rationale is that a small number of view methods can be composed with a small number of compute/aggregate methods to get the expressive power of what would otherwise require a vast array

Re: [all] moving to svnpubsub or CMS?

On Thu, Nov 15, 2012 at 2:46 AM, Olivier Lamy ol...@apache.org wrote: This is a false dichotomy. Maven site generation can work with ASF CMS if desired. That is sort of true but doesn't really apply to commons. I created the Flume site using Maven and Maven generates the site from RST

Re: [Math] MATH-894

On Thu, Nov 15, 2012 at 8:42 AM, Phil Steitz phil.ste...@gmail.com wrote: On 11/15/12 8:01 AM, Ted Dunning wrote: The typical answer to this when adding a functional method like compute is to also add a view object. The rationale is that a small number of view methods can be composed

Re: [Math] MATH-894

On Thu, Nov 15, 2012 at 10:04 AM, Phil Steitz phil.ste...@gmail.com wrote: Do you know how to do that with a primitive array? Can you provide some sample code? You don't. See my next paragraph. See the assign method in this class:

Re: [Math] MATH-894

On Thu, Nov 15, 2012 at 10:42 AM, Phil Steitz phil.ste...@gmail.com wrote: On 11/15/12 10:29 AM, Ted Dunning wrote: On Thu, Nov 15, 2012 at 10:04 AM, Phil Steitz phil.ste...@gmail.com wrote: Do you know how to do that with a primitive array? Can you provide some sample code? You

Re: [Math] MATH-894

Yes. Sounds similar. On Thu, Nov 15, 2012 at 11:02 AM, Phil Steitz phil.ste...@gmail.com wrote: The assign methods are inherited. The signatures are like assign(DoubleFunction), assign(DoubleDoubleFunction, Matrix other) and so on. OK, assign looks like what I was calling evaluate and

Re: [all] moving to svnpubsub or CMS?

On Tue, Nov 13, 2012 at 11:40 PM, Luc Maisonobe l...@spaceroots.org wrote: Please, could someone who knows what to do step up? I can't volunteer the time to do this, but I can say that process is really quite simple. We switched with Drill and the results are not bad at all. See

Re: [all] moving to svnpubsub or CMS?

On Wed, Nov 14, 2012 at 6:54 AM, Emmanuel Bourg ebo...@apache.org wrote: Le 14/11/2012 08:59, Ted Dunning a écrit : All you need to do is translate the pages to mark-down text, copy and adapt a few headers and stick the resulting files into a standardized directory structure in SVN

Re: [math] UTF-8 characters in javadoc comments

On Wed, Nov 14, 2012 at 12:11 AM, Sébastien Brisard sebastien.bris...@m4x.org wrote: There is no problem with the current setup of our website (at least, the website generated locally has no problem). For the new system, I would like to step up, but I really (really) have no clue what you

Re: [all] moving to svnpubsub or CMS?

On Wed, Nov 14, 2012 at 1:53 PM, Olivier Lamy ol...@apache.org wrote: 2012/11/14 Thomas Vandahl t...@apache.org: On 14.11.2012 08:40, Luc Maisonobe wrote: Please, could someone who knows what to do step up? Just a quick note that sites created by Maven can be published with

Re: [Math] MATH-878: Feature request with patch

On Sun, Nov 4, 2012 at 11:56 AM, Phil Steitz phil.ste...@gmail.com wrote: 0) Did you or anyone else ever analyze the bigram data in the paper using Fisher's test stats? That bigram data isn't particularly interesting; any text will show similar effects. Others have tested Fisher's exact

Re: [Math] MATH-878: Feature request with patch

What kind of check did you want? I checked the code by eye and supplied several test cases. You might say that I am versed in statistics since I am the author of the major paper on this test as applied to computational linguistics. On Sun, Oct 21, 2012 at 11:07 PM, Phil Steitz

Re: [Math] MATH-878: Feature request with patch

On Mon, Oct 22, 2012 at 4:20 AM, Gilles Sadowski gil...@harfang.homelinux.org wrote: On Sun, Oct 21, 2012 at 11:25:08PM -0700, Ted Dunning wrote: What kind of check did you want? Well, I'm seeking to know whether the code can be included in Commons Math's trunk. Hard for me to say as I

Re: [Math] MATH-816 (mixture model distribution) . .

. Jared From: Ted Dunning [ted.dunn...@gmail.com] Sent: Wednesday, October 17, 2012 9:41 PM To: Commons Developers List Subject: Re: [Math] MATH-816 (mixture model distribution) =?utf-8?B?LiAgICAu? ==?utf-8?B?LiAgICAu?= The issue is that with a fixed

Re: [Math] MATH-816 (mixture model distribution)

Seems fine. I think that the limitation to a fixed number of mixture components is a bit limiting. So is the limitation to a uniform set of components. Both limitations can be eased without a huge difficultly. Avoiding the fixed number of components can be done by using some variant of

Re: [Math] MATH-816 (mixture model distribution)=?utf-8?B?LiAgICAu? =

the component list. A new mixture model could be instantiated using the getComponents function and then adding or removing more components if necessary. Jared From: Ted Dunning [ted.dunn...@gmail.com] Sent: Wednesday, October 17, 2012 5:21 PM To: Commons

Re: [math] G-Tests in math.stat.inference

Feel free to grab and adapt the Mahout code. It has some added wrinkles for convenience like the signed square root variant of the G-test. On Tue, Oct 9, 2012 at 12:53 PM, rado tzvetkov rtzvet...@yahoo.com wrote: Also I already have code to contribute and tests for G-Test for independence.

Re: [math] Logistic, Probit regerssion and Tolerance checks

This is great. A very useful feature would be to allow basic L_1 and L_2 regularization. This makes it much easier to avoid problems with separable problems. It might be interesting to think for a moment how easy it would be to support generalized linear regression in this same package. Small

  1   2   3   4   >