[Net] FTPFile.getTimestamp() returns incorrect year
Hi, this is forwarded from user list. Does anybody know how to solve this problem? Regards, Lukas -- Forwarded message -- Hi, I found that FTPFile.getTimestamp() returns incorrect year. I have a file which was created on 2006-07-28 but getTimestamp() method returns 2005-07-28. Does anybody know any workaround? Is there fixed version available yet? Thanks, Lukas - To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
Re: [Net] FTPFile.getTimestamp() returns incorrect year
Hi,
Let's elaborate this questions a little more. When I do the follwoing
then it works as expected:
#1) ==
Calendar cal = null;
FTPTimestampParserImpl parser = new FTPTimestampParserImpl();
parser.configure(UnixFTPEntryParser.NUMERIC_DATE_CONFIG);
try {
cal = parser.parseTimestamp(2006-07-03 22:52);
} catch (Throwable e) {
fail(e.getMessage());
}
System.out.println(cal.getTime());
Now the question is if this is exactly the same what will happen
behind the scene if I do the following:
#2) ==
FTPClient client = new
FTPClient();client.configure(UnixFTPEntryParser.NUMERIC_DATE_CONFIG);
FTPFile[] allFiles = client.listFiles(folder);
Because not the particualr FTPFiles.getTimestamp() would lead to 2005
year instead of 2006. Do I need to perform additional configuration
setting in the second case?
Regards,
Lukas
On 7/31/06, Lukas Vlcek [EMAIL PROTECTED] wrote:
Hi, this is forwarded from user list. Does anybody know how to solve
this problem?
Regards,
Lukas
-- Forwarded message --
Hi,
I found that FTPFile.getTimestamp() returns incorrect year.
I have a file which was created on 2006-07-28 but getTimestamp()
method returns 2005-07-28.
Does anybody know any workaround?
Is there fixed version available yet?
Thanks,
Lukas
-
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
Re: [math] Re: commons math
Hi John, As I said I am not an active commited to [math] and I probably can't speak on behalf of this community but to me this seems interesting. I will look at it in deeper detail. Thanks! Lukas On 8/16/05, John Gant [EMAIL PROTECTED] wrote: Sorry for the late link to code, and paper. Please note that this code is not in a form that I would even think about commiting. I plan to restructure all of the code and add unit tests, including all algorithms. The best way to describe the current code is 'student form', meaning there are file loading methods and other utility methods throughout the files. The code was written in haste, and will be heavily refactored regardless. Read at your own risk :) Thanks Hen for the space! http://people.apache.org/~bayard/jgant/ Thanks, John - To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED] - To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
Re: [math] Re: commons math
Hi, this sounds great to me as well! I have been using [math] for some time and I found it very handy (congratulations to math team!). As for data mining functions I didn't have a chance to look what is implemented elsewhere yet (e.g: WEKA) but if there is anything what could be started in commons-math domena then I could offer my implementation of association mining package. It is not finished yet and still needs more tuning but I hope to finish it soon and see if it is helpful to other people. Regards, Lukas On 8/14/05, John Gant [EMAIL PROTECTED] wrote: Algorithms: - Feature reduction a. Basic cross correlation, including both spearman and pearson cross correlation algorithms. b. Principal Component Analysis. c. Entropy Based reduction. I currently have a, and b finished but need to brush up on my junit skills :) -Difference Measures I had in mind a difference engine, basically an engine that handles all difference operations. This difference engine could, in the constructor or using set methods, take an instance of one of the following difference methods. a. euclidean distance b. city-block distance -Pattern Discovery a. KMotif Discovery Algorithm. Again I have this algorithm completed, just need to boundary test everything. -Clustering Algorithms a. K-means Algorithm. I'd like to discuss the architecture of the k-means, I have a few ideas and would like a little feedback. I know this is just a small subset of the available algorithms, but this seems to be a good start. Thanks, John On 8/13/05, Phil Steitz [EMAIL PROTECTED] wrote: John, Sounds great! Extending the stat package to include some data mining capabilities would be a good and useful addition to commons-math, IMHO. To get started, the first thing to do is to read the developer's guide (http://jakarta.apache.org/commons/math/developers.html), which will tell point you to the general apache references and go over some IP stuff that we have to worry about in [math]. Then either here or on the Wiki (see the guide for a link), post a brief description of the kinds of mining algorithms that you are interested in developing and we can get this going. On this list, pls begin the subject line of all [math] messages with [math]. Thanks in advance for your contributions! Phil On 8/13/05, John Gant [EMAIL PROTECTED] wrote: Hello, I am currently a graduate student in Computer Science and Computer Engineering at the University of Louisville, Kentucky. First let me congratulate the group of developers who commit and architect for apache commons. I have used many of the libraries and they are all of excellent quality (but I guess you already know that :)). I am interested in contributing to open source software and have interests that are in the domain of statistics with a focus in data mining. After writing many algorithms for classes, and asking an apache contributor if any of this would be needed elsewhere, he told me to purpose something to the dev list. So here it goes, I would like to help start a data mining section of commons math and advance the existing statistical libraries. I plan on developing the algorithms for personal use anyway, and would like to see some of my work be used by others. If anyone is interested we can continue this thread and I will email my code, and purpose my new algorithms. John Gant - To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED] - To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED] -- John Gant - To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED] - To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
[math] Re: commons math
Hi, As Phil noted the question of IP is very important. As far as I know association mining concept is not covered by any patent or copyright (in fact I would be very surprised if it is). Also I think (and authors of [math] would confirm) that it is important to provide good and clear documentation for every new function to [math]. John, do you have any documentation for you functions (I mean links to some papers where the function is described)? I am not [math] commiter but I am interested in your stuff. Is there any link where I could download your code? Regards, Lukas On 8/15/05, John Gant [EMAIL PROTECTED] wrote: Excellent! I also found some older stuff that I had written yesterday, and it included a tree clustering algorithm. Within this code, I also found implementations of distibution-specific random number generators, i.e. triangular, uniform, exponential, etc. I am not sure if these would be useful in the statistical section, but I could refactor them to use commons math classes. Thanks, John On 8/15/05, Lukas Vlcek [EMAIL PROTECTED] wrote: Hi, this sounds great to me as well! I have been using [math] for some time and I found it very handy (congratulations to math team!). As for data mining functions I didn't have a chance to look what is implemented elsewhere yet (e.g: WEKA) but if there is anything what could be started in commons-math domena then I could offer my implementation of association mining package. It is not finished yet and still needs more tuning but I hope to finish it soon and see if it is helpful to other people. Regards, Lukas On 8/14/05, John Gant [EMAIL PROTECTED] wrote: Algorithms: - Feature reduction a. Basic cross correlation, including both spearman and pearson cross correlation algorithms. b. Principal Component Analysis. c. Entropy Based reduction. I currently have a, and b finished but need to brush up on my junit skills :) -Difference Measures I had in mind a difference engine, basically an engine that handles all difference operations. This difference engine could, in the constructor or using set methods, take an instance of one of the following difference methods. a. euclidean distance b. city-block distance -Pattern Discovery a. KMotif Discovery Algorithm. Again I have this algorithm completed, just need to boundary test everything. -Clustering Algorithms a. K-means Algorithm. I'd like to discuss the architecture of the k-means, I have a few ideas and would like a little feedback. I know this is just a small subset of the available algorithms, but this seems to be a good start. Thanks, John On 8/13/05, Phil Steitz [EMAIL PROTECTED] wrote: John, Sounds great! Extending the stat package to include some data mining capabilities would be a good and useful addition to commons-math, IMHO. To get started, the first thing to do is to read the developer's guide (http://jakarta.apache.org/commons/math/developers.html), which will tell point you to the general apache references and go over some IP stuff that we have to worry about in [math]. Then either here or on the Wiki (see the guide for a link), post a brief description of the kinds of mining algorithms that you are interested in developing and we can get this going. On this list, pls begin the subject line of all [math] messages with [math]. Thanks in advance for your contributions! Phil On 8/13/05, John Gant [EMAIL PROTECTED] wrote: Hello, I am currently a graduate student in Computer Science and Computer Engineering at the University of Louisville, Kentucky. First let me congratulate the group of developers who commit and architect for apache commons. I have used many of the libraries and they are all of excellent quality (but I guess you already know that :)). I am interested in contributing to open source software and have interests that are in the domain of statistics with a focus in data mining. After writing many algorithms for classes, and asking an apache contributor if any of this would be needed elsewhere, he told me to purpose something to the dev list. So here it goes, I would like to help start a data mining section of commons math and advance the existing statistical libraries. I plan on developing the algorithms for personal use anyway, and would like to see some of my work be used by others. If anyone is interested we can continue this thread and I will email my code, and purpose my new algorithms. John Gant - To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED
Re: [collections] Porting to JDK 1.5 and Generics
Hi, Is there any performance gain in Generics Collections in Java5? Can I expect performace improvement or specialized type collection libraries (like fastutil) will be always faster. Lukas On Wed, 16 Feb 2005 13:42:49 +0100, Mauro Franceschini [EMAIL PROTECTED] wrote: Hi to all! Any ideas about a port to Generics in JDK1.5 about the Commons Collections Framework? I'd like to help on it. Mauro - To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED] - To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
