similar to: Why are big data.frames slow? What can I do to get it fas ter?

Hello! I've been trying to get this right for quite a while now and fear there is an easy solution I just don't see. I did not have this problem in Linux, and I searched r-help and Google but did not find a solution, but of course I am grateful for and resources I might not have found our not understood yet. I try to parse a time stamp with time zone. I essentially just want to parse the

Thanks for this clarification. I have learned in the meantime that it is necessary to be very careful when using all these POSIX things. As another example, here is something that made me scratch my head just yesterday: When I create a sequence of days that happens to start before and ends in daylight savings time, I seem to lose a day: > seq(from = strptime("20030329",

Hi folks, I written a FAS (Fedora Account System) plugin for ovirt server in order to plug it to our FAS without the need of 389. So, I'm looking for help to integrate it to ovirt server properly. The plugin is located here: http://laxathom.fedorapeople.org/infra-fp/ovirt-server-fas-plugin/ Also, i'm not a ruby[rails] guru so that any comment or improvement on the plugin are welcome.

Dear all, I have found the following (for me) incomprehensible behaviour of ISOdate (POSIXct): > ISOdate(1900,6,16) [1] "1900-06-15 14:00:00 Westeurop?ische Sommerzeit" > ISOdate(1950,6,16) [1] "1950-06-16 14:00:00 Westeurop?ische Sommerzeit" Note that in the first case I get the 15th of June back, not the 16th as I would have expected! This happened under R-1.7.1 on

gtk12-config --version 1.2.10 glib12-config --version 1.2.10 AZ -----Original Message----- From: Tilghman Lesher [mailto:tilghman@mail.jeffandtilghman.com] Sent: Wednesday, May 21, 2003 2:27 PM To: asterisk-users@lists.digium.com Subject: Re: [Asterisk-Users] gastman segmentation fault when pressing 'enter' in a command win dow On Wednesday 21 May 2003 01:22 pm, Alex Zarubin wrote:

If we are on the subject of byte compilation, let me bring a couple of examples which have been puzzling me for some time. I'd like to know a) if the compilation will likely to improve the performance for this type of computations, and b) at least roughly understand the reasons for the observed numbers, specifically why x[i]<- assignment is so much slower than x[i] extraction. The loops

In einer eMail vom 30.08.98 05:55:16 (MEZ) - Mitteleurop. Sommerzeit schreibt samba@samba.anu.edu.au: << # export SMBPASSWD='mypasswd' # gethash 74AC99CA40DED4204A3B108F3FA6CB6D:F671043BA08E88500D2EB5279AC65E53 >> This is nice. Every other user on the system can see that hash with ps. I would not call that extended security. Detlef

Luke, Thank you for sharing the benchmark results. The improvement is very substantial, I am looking forward to the release of the byte compiler! The arithmetic shows that x[i]<- is still the bottleneck. I suspect that this is due to a very involved dispatching/search for the appropriate function on the C level. There might be significant gain if loops somehow cached the result of the initial

We had a similar problem here, different but perhaps not entirely unique if someone else happens to make the same mistake. We give kudos to the samba logging. =) We have a linux samba print server with cups as a member server of an nt4 domain. The win98 users could print fine, win 2k could not - but that wasn't the problem, though only these systems had an "access denied" error

Hello, I?m quite new to this list. I have a high frequency-dataset with more than 500.000 records. I want to edit a data.frame "Test". My small programm runs fine with a small part of the dataset (just 100 records), but it is very slow with a huge dataset. Of course it get?s slower with more records, but when I change just the size of the frame and keep the number of edited records

On Sun, May 22, 2011 at 1:07 PM, Serg Anohovsky <serg.anohovsky at gmail.com>wrote: > Hello. > I have compiled the simple program: > > #include <stdio.h> > #include <stdlib.h> > > int v1[10000]; > > int main() > { > int i; > > for (i = 0; i < 10000; i++) { > v1[i] = i; > } > > This loop

---------- Forwarded message ---------- From: Serg Anohovsky <serg.anohovsky at gmail.com> Date: 2011/5/22 Subject: Re: [LLVMdev] No SSE instructions To: Chris Lattner <clattner at apple.com> 2011/5/22 Chris Lattner <clattner at apple.com> > > On May 22, 2011, at 10:47 AM, Justin Holewinski wrote: > > On Sun, May 22, 2011 at 1:07 PM, Serg Anohovsky

Hi, can anyone give an example for a pointopoint routed setup? i.e. each virtual machine has one ip with pointopoint config to the host machine, on a private interface - thus the virtual machines can only talk to the host, which routes them and can use normal iptables for filtering all traffic. with xen this was a simple script doing ifconfig ${vif} ${main_ip} netmask 255.255.255.255 up ip

Hello Andreas, On 10/11/05, Andreas Jellinghaus <aj at dungeon.inka.de> wrote: > Peter Koch pointed me to your posting on openssh-devel mailing list. I am very glad that he did. > I'm one of the opensc people, and from my point of view your idea > is a good one. The current openssh-opensc code has a number of issues, > for example the ssh-agent does not test the pin

Andreas Jellinghaus wrote: > Hi Edward, > Hello. > I saw your mail on btrfs ml with the grub patches and the notes > how to deal with btrfs. > > can you explain how grub and btrfs work exactly? > I read the grub manual at > http://www.gnu.org/software/grub/manual/html_node/Bootstrap- > tricks.html#Bootstrap-tricks > > so I wonder: does btrfs provide a

Hi Gerolf, I think we have several (perhaps separable) issues here: 1. Do we have a canonical form for loops, preserved through the optimizer, that allows naturally-constructed loop nests to remain separable? 2. Do we forbid non-lowering transformations that turn vectorizable loops into non-vectorizable loops? 3. How do we detect cases where transformations cause a negative answer to either

Hi everybody, On 10/17/12 12:32 AM, Hal Finkel wrote: >>> Do you have a plan for xforms to increase the amount of >>> vectorization? >> >> Yes. We will need to implement a predication phase and to design the >> interaction with other loop transformations. Also, this will have to >> work well with the cost model. We also need to think of a good way to

Hi Preston! > > I'd start by making a plan (a design!) with goals and stuff. > Publish it so we can see what you mean by "vectorization". I will send a separate email later, but here is a quick overview. I see the vectorizer having four main components: 1. Preparation passes: If-conversion, loop transformations, etc. 2. Cost model - This unit decides on the best

----- Original Message ----- > From: "Ralf Karrenberg" <Chareos at gmx.de> > To: llvmdev at cs.uiuc.edu > Sent: Wednesday, October 17, 2012 2:13:08 AM > Subject: Re: [LLVMdev] Loop vectorizer > > Hi everybody, > > On 10/17/12 12:32 AM, Hal Finkel wrote: > >>> Do you have a plan for xforms to increase the amount of > >>>

Hi Nadav, Do you have any small write-up of current design of loop vectorizer?. If so, can you please send it across?. I want to see if there are dependencies such as unrolling for the vectorization. In the design we may also have to consider BB vectorizer and loop vectorizer working well together with no ambiguous requirements/dependencies. Regards, Shivaram -----Original Message-----