similar to: time zone - any practical solution?

Hello all, Could someone help me with the time zones in understandable & practical way? I got completely stucked with this. Have googled for a while and read the manuals, but without solutions... ------------------------------------------------------------------- When data imported from Excel 2007 into R (2.13) all time variables, depending on date (summer or winter) get (un-asked for it!)

Can you explain why you need them as 'integer', A floating point representation can hold a value upto ~4.5e15 as an "integer" keeping the precision that you might need. Jim Holtman Data Munger Guru What is the problem that you are trying to solve? Tell me what you want to do, not how you want to do it. On Tue, Apr 26, 2016 at 1:11 PM, Andr? Luis Neves <andrluis at

Ok. I`m trying to run a Poisson glmm with an observation-level random intercept. But I`m getting the following error for the 'Baci' variable: 'Error: (maxstephalfit) PIRLS step-halvings failed to reduce deviance in pwrssUpdate'. I guess this message is because the baci variable is not a an integer, and cannot be transformed into an integer as R has a threshold of 2x10^9 even in

Dear all: I converted the columns (Baci, Meti, Fungii, Protozoai) into integers (using excel) and then imported the data (.txt) into R. Interestingly, the other three variables were loaded as INT, but the 'Baci' one continued as Num. I imported the data using the following command line: X <- read.delim(file.choose(), header = TRUE, dec =

Dear all, I am a biologist. I have two sets of distance P(start1, end1) and Q(start2, end2). The distance will be like this. P ------------------------ Q ---------------------------------------- I want to know whether P falls closely to the right end or left end of Q. P and Q are of different lengths for each data point. There are more than 10000 pairs of P and Q. Is there any test or

> Suppose you have four lifetime operations on the same address in memory, > with loads and stores all around them: > > start1--end1 .. start2--end2 > > If you remove start1 then you have a bare pointer, the memory came from > somewhere and you lose the optimization that loads before start1 become > undef, but you don't miscompile. This is assuming no looping after

On 12/27/2012 12:35 PM, Rafael Espíndola wrote: >>> Oh, I was reading "precedes/following" as having static (dominance) >>> meaning. That is, in the above example you could not delete the store >>> since it is not true that >>> llvm.lifetime.end dominates it. >>> >>> Nick, is this what you had in mind? If not, then we must delete a

On 12/28/2012 04:20 AM, Rafael Espíndola wrote: >> Suppose you have four lifetime operations on the same address in memory, >> with loads and stores all around them: >> >> start1--end1 .. start2--end2 >> >> If you remove start1 then you have a bare pointer, the memory came from >> somewhere and you lose the optimization that loads before start1 become

Hi! I would appreciate some feedback from someone with experience in SCEV/SE. D39346 tries to fix an issue in LV (PR34965) that exposes a limitation in SCEV/SE. The best solution to the LV issue might not be a fix at SCEV/SE level but we may want to report/address SCEV/SE limitation as well. For the snippet below, LV expects SE to return a SCEVAddRecExpr for %21. However, SE returns ((4 * (zext

>> Oh, I was reading "precedes/following" as having static (dominance) >> meaning. That is, in the above example you could not delete the store >> since it is not true that >> llvm.lifetime.end dominates it. >> >> Nick, is this what you had in mind? If not, then we must delete a >> matching llvm.lifetime.end, but it is not clear how we define

Thanks for the feedback, Sanjoy. > SCEV is fairly conservative around PHI nodes that aren't recurrences and aren't obviously equivalent to a min-max branch-phi idiom. Is that the limitation you're running into here? Yes, that's exactly the problem. The problematic PHI nodes (%bc.resume.val and %bc.resume.val1) aren't either recurrences or related to min-max idioms. I

Hi all, I need 2 CDR Records of below 2 numbers for outgoing calls, detail is given as below: *96XXXXXXXX88XXXXXXXX* *=> Call file : outbound call generate through below file* Test.call ====== Channel: local/s at outgoing/n WaitTime: 45 Context: outgoing_ivrs Extension: s Priority: 1 Set: contact_no=96XXXXXXXX extensions.conf ============ [outgoing] exten => s,1,NoOP(----- First LEG

From: Sui Jingfeng <suijingfeng at loongson.cn> This patch adds the aperture_contain_firmware_fb() function to do the determination. Unfortunately due to the fact that apertures list will be freed dynamically, the location and size information of the firmware fb will be lost after dedicated drivers call aperture_remove_conflicting_devices(), aperture_remove_conflicting_pci_devices() or

This is a bug found by internal compiler bootstrap, and possibly it is the root cause of https://bugs.llvm.org/show_bug.cgi?id=33652 and https://bugs.llvm.org/show_bug.cgi?id=33626. Here is the testcase 1.c. The original code is at MemorySSA.cpp:586 for rL307764. ------------------------- 1.c --------------------------- long a, c, d, e, f, m, cnt, i_hasval; volatile long b; void goo(long); void

From: Sui Jingfeng <suijingfeng at loongson.cn> Currently, the default VGA device selection is not perfect. Potential problems are: 1) This function is a no-op on non-x86 architectures. 2) It does not take the PCI Bar may get relocated into consideration. 3) It is not effective for the PCI device without a dedicated VRAM Bar. 4) It is device-agnostic, thus it has to waste the effort to