similar to: autoregression

On Mon, Feb 13, 2017 at 03:12:45PM -0500, Waiman Long wrote: > On 02/13/2017 02:42 PM, Waiman Long wrote: > > On 02/13/2017 05:53 AM, Peter Zijlstra wrote: > >> On Mon, Feb 13, 2017 at 11:47:16AM +0100, Peter Zijlstra wrote: > >>> That way we'd end up with something like: > >>> > >>> asm(" > >>> push %rdi; > >>>

On Mon, Feb 13, 2017 at 03:12:45PM -0500, Waiman Long wrote: > On 02/13/2017 02:42 PM, Waiman Long wrote: > > On 02/13/2017 05:53 AM, Peter Zijlstra wrote: > >> On Mon, Feb 13, 2017 at 11:47:16AM +0100, Peter Zijlstra wrote: > >>> That way we'd end up with something like: > >>> > >>> asm(" > >>> push %rdi; > >>>

On Mon, Oct 16, 2017 at 02:18:48PM -0400, Boris Ostrovsky wrote: > On 10/12/2017 03:53 PM, Boris Ostrovsky wrote: > > On 10/12/2017 03:27 PM, Andrew Cooper wrote: > >> On 12/10/17 20:11, Boris Ostrovsky wrote: > >>> There is also another problem: > >>> > >>> [ 1.312425] general protection fault: 0000 [#1] SMP > >>> [ 1.312901]

On 10/12/2017 03:53 PM, Boris Ostrovsky wrote: > On 10/12/2017 03:27 PM, Andrew Cooper wrote: >> On 12/10/17 20:11, Boris Ostrovsky wrote: >>> There is also another problem: >>> >>> [ 1.312425] general protection fault: 0000 [#1] SMP >>> [ 1.312901] Modules linked in: >>> [ 1.313389] CPU: 0 PID: 1 Comm: init Not tainted 4.14.0-rc4+ #6

On 10/12/2017 03:53 PM, Boris Ostrovsky wrote: > On 10/12/2017 03:27 PM, Andrew Cooper wrote: >> On 12/10/17 20:11, Boris Ostrovsky wrote: >>> There is also another problem: >>> >>> [ 1.312425] general protection fault: 0000 [#1] SMP >>> [ 1.312901] Modules linked in: >>> [ 1.313389] CPU: 0 PID: 1 Comm: init Not tainted 4.14.0-rc4+ #6

Hi, I'm working on a project that use llvm openrisc beckend (currently not part of the upstream). Right now I'm looking at a bug where llc generates memory instructions that has out-of-range displacement, for example l.sb 37668(r1), r2 in which 37668 is a 17 bit signed integer, but the instruction only allows 16 bit signed displacement. As a result, after running through the

Hi- I'm wrestling with some of my data apparently not being called into a GLM or an LM. I'm looking at factors affecting fish annual catch rates (ie. CPUE) over 30 years. Two of the factors I'm using are sea surface temperature and sea surface temperature anomaly. A small sample of my data is below: CPUE Year Vessel_ID Base_Port Boat_Lgth Planing SST Anomaly 0.127

Folks, I have been using the VAR {vars} program to find a fit for the following bi-variate time series (subset): bivariateTS<-structure(c(0.950415958293559, 0.96077848972081, 0.964348957109053, 0.967852884998915, 0.967773510751625, 0.970342843688257, 0.97613937178359, 0.980118627997436, 0.987059493773907, 0.99536830931504, 1.00622672085718, 1.01198013845981, 1.01866618122606,

After looking at this for a while, I do not think that this problem is NP-hard. With a finite "short branch" displacement k, I was not able to come up with a gadget that could create global constraints as would be needed to e.g. model an instance of 3SAT or vertex cover in terms of this problem. The problem is hard though. I believe that it is likely to be exponential in the "short

Hey guys, I'm working on a bug for x86-64 in LLVM 2.9. Well, it's actually two issues. The assembly generated for large stack offsets has an overflow; And, once the overflow is fixed, the displacement is too large for GNU ld to handle it. void fool( int long n ) { double w[268435600]; double z[268435600]; unsigned long i; for ( i = 0; i < n; i++ ) { w[i] = 1.0; z[i] =

When addresses are a displacement from a constant (this can happen in device drivers), the resulting address gets folded rather than using base+displacement addressing. This results in code bloat. Example test attached. -------------- next part -------------- An embedded and charset-unspecified text was scrubbed... Name: const-addr.ll URL:

On Fri, 27 Aug 2004 02:20:34 -0500 (CDT) Chris Lattner <sabre at nondot.org> wrote: > On Thu, 26 Aug 2004, Jeff Cohen wrote: > > > Also, the store into the arrays generates two x86 machine > > instructions: > > > > lea %ECX, DWORD PTR [%ESP + 16] > > mov DWORD PTR [%ECX + <element offset>], %EAX > > > > These can be combined into a

On Thu, 3 May 2018 08:40:37 +0100 Rowland Penny via samba <samba at lists.samba.org> wrote: > On Wed, 2 May 2018 19:21:46 -0300 > "Ethy H. Brito" <ethy.brito at inexo.com.br> wrote: > > This is where it is all going wrong, Your PDC isn't using LDAP, so > you will have to rely on the winbind 'rid' backend. The lines below are > wrong in several

In conducting studies of animal orientation and displacement, I need to produce circular histograms of angles (bearings in radians 0-2pi) where the centre of the circle indicates very few observations for a given bin of angles and outwardly concentric circles indicate greater frequencies of observations for a given bin of angles. I'd like not to have to write the function myself but I

Dear R users, I would like to simulate, for 20000 replications, an autoregressive process: y(t)=0.8*y(t-1)+e(t) where e(t) is i.i.d.(0,sigma*sigma), Thank you in advance ____________________________________________________ Écoutez gratuitement le nouveau single de Noir Désir et découvrez d'autres titres en affinité avec vos goûts musicaux

Hello, I am trying to carry out a phylogenetic autoregression to test whether my data show a phylogenetic signal, but I keep calculating bizzare R-squared values. My script is: > library(ape) > x <-

On 11 Jun 2007, at 22:35, Jan Rehders wrote: > It's inside PPCJITInfo::relocate but unfortunately I could not figure > out anything from the source. It looks like it's calculating new > addresses for functions which does not make much sense for a native > function, at all On the PPC, unconditional branches are limited to 24 bit signed displacements. When you call a function

Hi, I am trying to fit all subsets for a vector autoregression with exogenous variables. I have been looking at the 'leaps' function but I not sure how to get it to work when lags for each variable are included in the model. I would be really appreciative if someone could provide some links to examples. Thanks in advance! -- View this message in context:

Hi, In order to produce an autoregression where only certain lags are allowed, specified in advance (e.g. c(1,2,5) ), I have found it necessary to look beyond the standard [ar] function, thankfully discovering the [FitAR] package, wherein the [FitARp] function provided exactly that capability. However for my problem at hand, [FitARp] is vastly slower than [ar] - taking hours rather than minutes.

This might be obvious to some, but I can't find a neat way to do it: Say I have two (very long) numerical vectors a & b of the same length representing variable coefficients of a linear autoregression. I want to calculate vector x defined by x[1] <- b[1] for (n in 2:length(a)) x[n] <- a[n]*x[n-1] + b[n] Is there a way to do this vectorially, i.e. without using the 'for'