search for: contraint

I am wondering that how does the LLVM PTX backend find out the constraints on executing GPU thread/block/grid size ( i.e. a block can at most have 1024 threads). Can anyone point me to the code ? I need information in the optimizer, how can I get it ? Thanks Xin

You specify shader model, bit size and etc. arch-specified parameters though -march, -mattr and -mcpu, but AFAIK, PTX backend does not use the GPU thread/block/grid size information in optimization yet. On Mon, Mar 12, 2012 at 8:17 PM, Xin Tong <xerox.time.tech at gmail.com> wrote: > I am wondering that how does the LLVM PTX backend find out the > constraints on executing GPU

I am a little confused to the what happens with the following: before do @site = mock_model(Site, :to_param => "1") Site.stub!(:new).and_return(@site) end def post_with_successful_save @site.should_receive(:save).and_return(true) post :create, :site => {} end I understand that the "@site.should_receive(:save)..." places a check to whether the

Hi R, I have the variance-covariance matrix, >V=matrix(c(0.011119238, 0.002407527, 0.002407527, 0.020739401),2,2) I need to find a vector X=c(x1,x2), such that 1) X'VX is equal to a constant 2 (say) and 2) sum(x) should be equal to a another constant 1.5 (say). How do we do this in R? BR, Shubha Shubha Karanth | Amba Research Ph +91 80 3980 8031 | Mob +91 94

On Sep 7, 2010, at 6:27 PM, Lang Hames wrote: > The design I have in mind is this: We add a method to TargetRegisterInfo which returns a PBQPProblemBuilder for the target architectures. I implement a base PBQPProblemBuilder by simply lifting the current construction process out of the PBQP allocator and into its own class. Anyone (such as yourself, Carlos) who wants to represent more esoteric

Hi Jakob, That's a good point. I'll factor out the problem builder in the next couple of days and drop a mail to the list explaining how to write extensions. Cheers, Lang. On Thu, Sep 9, 2010 at 12:21 AM, Jakob Stoklund Olesen <stoklund at 2pi.dk>wrote: > > On Sep 7, 2010, at 6:27 PM, Lang Hames wrote: > > The design I have in mind is this: We add a method to

I don't think so, but you should check source code. On Tue, Mar 13, 2012 at 9:58 PM, Xin Tong <xerox.time.tech at gmail.com> wrote: > but does it have default values ? > > Thanks > > Xin > > On Tue, Mar 13, 2012 at 5:19 AM, Che-Liang Chiou <clchiou at gmail.com> wrote: >> You specify shader model, bit size and etc. arch-specified parameters >>

There seems to exist peculiar cases where optim does not take care of constraints on the parameters to be optimized over. The call to optim is of the form opt <- optim(cp, fn=sn.dev, gr=sn.dev.gh, method="L-BFGS-B", lower=c(-Inf, 1e-10, -0.99527), upper=c( Inf, Inf, 0.99527), control=control, X=X, y=y, hessian=FALSE) The code has worked fine

On Sep 7, 2010, at 3:01 AM, Carlos Sanchez de La Lama wrote: > The machine I am targeting has some special requirements for some > operations, say: > > ADD or1, ir1, r5 > > would add ir1 (input reg 1) and r5 and put the result in or1 (output reg > 1). The point id that input and output regs have to go paired (this > meaning an addition of ir1 with whatever always goes to

but does it have default values ? Thanks Xin On Tue, Mar 13, 2012 at 5:19 AM, Che-Liang Chiou <clchiou at gmail.com> wrote: > You specify shader model, bit size and etc. arch-specified parameters > though -march, -mattr and -mcpu, but AFAIK, PTX backend does not use > the GPU thread/block/grid size information in optimization yet. > > On Mon, Mar 12, 2012 at 8:17 PM, Xin

Hi all, The machine I am targeting has some special requirements for some operations, say: ADD or1, ir1, r5 would add ir1 (input reg 1) and r5 and put the result in or1 (output reg 1). The point id that input and output regs have to go paired (this meaning an addition of ir1 with whatever always goes to or1, or an in general irX + whatever goes to orX). AFAIK, InstrInfo.td only allow

i want to estimate parameters with maximum likelihood method with contraints (contant numbers). for example sum(Ai)=0 and sum(Bi)=0 i have done it without the constraints but i realised that i have to use the contraints. Without constraints(just a part-not complete): skellamreg_LL=function(parameters,z,design) { n=length(z); mu=parameters[1]; H=parameters[2]; Apar...

Hi Carlos, Jakob, The PBQP allocator was designed to support a very wide range of constraints, and can handle something like this easily. Say you have 4 of these orX/irX registers, then for any pair of virtual registers used in such an add instruction you would add the following constraint matrix to the PBQP instance: [ 0 inf inf inf ] [ inf 0 inf inf ] [ inf inf 0 inf ] [ inf inf inf 0

Hi, I would like to know if anyone has any idea of how to run an OLS with constraints? I need to contraint a coefficient estimate in the model equal to 1, and I am not sure how to include it into the OLS estimation... I was hoping to find something like "cnsreg" in STATA.. thank you Soyoko ______________________________________ Ms. Soyoko Umeno Graduate Research Assitant for the Illinois-M...

Hello, I'm trying to use coxph() function to fit a very simple Cox proportional hazards regression model (only one covariate) but the parameter space is restricted to an open set (0, 1). Can I still obtain a valid estimate by using coxph function in this scenario? If yes, how? Any suggestion would be greatly appreciated. Thanks!!! [[alternative HTML version deleted]]

Hello! I would like to use constrain to sum coeficients of a factor to 0 instead of classical corner contraint i.e. I would like to fit a model like lm(y ~ 1 + effectA + effectB) and say get parameters intercept effectA_1 effectA_2 effectB_1 effectB_2 effectB_3 where effectA_1 represents deviation of level A_1 from intercept and sum(effectA_1, effectA_2) = 0 and the same for factor B. Is this possible...

Hello, As a rails newbie, i have stumbled upon some tutorials promoting migratons. I have thought, wow, cool and started using them right away. However, now that i am reading the RoR list on a daily basis, i have seen also mails ranging from ''migrations are not always the best'' to ''migrations are evil'' and even ''i would not use migrations even

...39;t a DAG pointer handy (at least I don't think there is, as I'm not too familiar yet with LLVM internals), which meant that I needed to handle multiple alternative constraints in other places besides just SelectionDAGBuilder::visitInlineAsm. Basically I see that there are three layers of contraint info classes, SDISelAsmOperandInfo -> AsmOperandInfo -> ConstraintInfo. Therefore, I implemented a different scheme, putting a ParseConstraints function in TargetLowering that returns a vector of AsmOperandInfo objects, and which will do the constraint selection without needing the DAG. I...

...ssible Mac OS X Server. Currently I''ve been looking at Litespeed and their LSAPI integration and am tempted by that. I also have looked at Mongrel with Pound/Pens/Balance. I *could* do Apache 2.2 and Mongrel but want to avoid Apache if possible as I''d like to keep my memory contraints as low as possible and I''ve found Apache can be a bit of a memory hog (perhaps its my configuration - but I just don''t care to use Apache if need be). Thanks for all the feedback. -- Posted via http://www.ruby-forum.com/.

...have a poor VPN connection with mainland. Since Samba4 does not support (yet) subtrees, we have deployed a DC in each location for domain validation. However users in mainland logon randomly at overseas location and sometimes this is a problem due to low bandwidth available. Is there any way to contraint logon servers? We have though about two options: - Limit, via firewall rule, login at oversea locations from mainland, but we are not sure if this will a problem or delay in excess logon process. - Limit DNS replication so at mainland office no oversea DCs entries are shown, but this would be q...