search for: infeasibility

Hi all, I am a fourth year EE bachelors student who is very interested in compilers. I have taken the only compilers course offered in my school and did an independent study with my CS professor. Although I'll begin to work in a couple of months, I definitely want to pursue my interest in compiler design and optimization as a PhD in the future. I am very interested in the z3 SMT solver

so I have some local users that I'd like to show up in my samba domain a bit more properly, but it's infeasable to add their accounts to the ldap directory proper. I've tried to create an idmap entry (probably wrong) and a structural SID with a sam account pointing to the numeric UID and a proper name for the unix account, but it still shows up as UNIX-USER/accountname. what am

I need advanced Asterisk training in the SouthEast area of the U.S; I don't need to know how to install linux and Asterisk and compile the modules and load them and such. I don't need to know what extensions.conf does or sip.conf does; What I do need is a better understanding of what every single little option in sip.conf or iax.conf does, and I need to learn a lot more about all the

Hi, There are numerous emails flying around the list at the moment regarding the state of the JIT. In its current state it is infeasible to add support for another architecture (very difficult to say the least) - there are plans currently being formulated to deal with this and convert the JIT to the new MC architecture, which would allow much easier porting between platforms. Have a look for the

Hello Everyone,   I'm trying to conduct a couple of power analyses and was hoping someone might be able to help. I want to estimate the sample size that would be necessary to adequately power a couple of non-inferiority tests. The first would be a log-rank test and the second would be a Wilcoxon rank-sum test. I want to be able to determine the sample size that would be necessary to test for a

How can I see more of the structure than displayed by 'str'? Consider the following: tstDF <- data.frame(a=1, row.names='b') > str(tstDF) 'data.frame': 1 obs. of 1 variable: $ a: num 1 The object 'tstDF' has row.names, but I have to suspect they are there -- AND know a function like 'row.names' or 'dimnames' -- to see

On Wed, Nov 17, 2010 at 12:11 AM, Bruno Cardoso Lopes <bruno.cardoso at gmail.com> wrote: > Hi, > > On Sun, Nov 14, 2010 at 5:39 AM, Michael.Kang <blackfin.kang at gmail.com> wrote: >> I like to get the support of llvm runtime so that I can run some VM >> that depends on llvm. I googled porting keyword >> and also simply try to cross compile llvm. Just like

OK. Thank you. What I want to do is: Fix source code in-place, then feed it to compiler normally. I assume I can fix source code in-place using clang::SourceManager, but I cannot find the appropriate API. Now I know that way is infeasible. Thanks again. 2011/5/5 Joshua Warner <joshuawarner32 at gmail.com> > Wen-Han, > > It sounds like there are two problems here: first is

On Thu, May 10, 2018 at 3:10 PM Zachary Turner <zturner at google.com> wrote: > On Thu, May 10, 2018 at 1:50 PM Chandler Carruth via llvm-dev < > llvm-dev at lists.llvm.org> wrote: > >> Last time this came up, there were a lot of people that were stuck on GCC >> 4.9 due to ABI reasons. I think forcing that upgrade is going to be the >> most disruptive part

Hi My goal is that given a binary and the corresponding input. I want to know what IR level basic blocks are covered. I need the detail information, which is the set of all the covered BBs rather than just a number. I want to know whether there are some tools that can support this requirements. If not, I think maybe instrumentation can helps. However, I do not know too much about this. Any

On Wed, Nov 17, 2010 at 4:30 PM, James Molloy <James.Molloy at arm.com> wrote: > Hi, > > There are numerous emails flying around the list at the moment regarding the state of the JIT. In its current state it is infeasible to add support for another architecture (very difficult to say the least) - there are plans currently being formulated to deal with this and convert the JIT to the

Hi, The following works fine: > f [1] 0.08 0.03 0.04 > A2 [,1] [,2] [,3] [1,] 0.000000e+00 0.0000000000 0.000000e+00 [2,] 0.000000e+00 0.0000000000 0.000000e+00 [3,] 2.999651e-03 0.0009094342 1.945708e-03 [4,] 4.124431e-05 0.0001360390 1.203345e-05 [5,] 3.027932e-04 0.0000412920 4.668090e-04 [6,] 0.000000e+00 0.0000000000 0.000000e+00 > b2 [1] 0 0 0 0 0 0

Dear All, I would like to know how to sort a vector of numeric values such that we know the original index of each ordered component. Say, we have c <- c(1,4,3,2) csort <- sort(c,descreasing=FALSE) With a few components of c, we can manually find out: csort[1] = 1 = c[1], ie, the original index of csort[1] is 1, csort[2] =2 =c[4], ie, the original index of csort[2] is 4. When length(c) is

Dear All, I am using package fPortfolio to run minimum variance portfolio optimizations in R. I already know how to set portfolioSpecs, portfolio objects and constraints. Unfortunately I am not able to set the following type of constraints. I have a timeSeries object with returns data for roughly 1.5k assets for 261 subperiods (workingdays) and want to compute the global minimum variance

On 27 June 2015 at 17:01, Duncan P. N. Exon Smith <dexonsmith at apple.com> wrote: > >> On 2015 Jun 26, at 17:02, Peter Sewell <Peter.Sewell at cl.cam.ac.uk> wrote: >> >> On 26 June 2015 at 22:53, Sean Silva <chisophugis at gmail.com <mailto:chisophugis at gmail.com>> wrote: >>> All of these seem to fall into the pattern of "The compiler

Greetings, I am having trouble getting the function reformulate_ATSP_as_TSP to work for me. I have provided a simple example of some of the code I've been using. In particular, I'm not sure why I'm getting the error "Error in dimnames(tsp) <- list(lab, lab) : length of 'dimnames' [1] not equal to array extent" since I created the object ATSP with a valid

On Nov 17, 2010, at 12:37 AM, Michael.Kang wrote: > On Wed, Nov 17, 2010 at 4:30 PM, James Molloy <James.Molloy at arm.com> wrote: >> Hi, >> >> There are numerous emails flying around the list at the moment regarding the state of the JIT. In its current state it is infeasible to add support for another architecture (very difficult to say the least) - there are plans

Hello, I am in the process of trying to get a large network (300+ systems) spanning 3 subnets to be able to display all windows machines in the Network Neighborhood. After reading through copious amounts of documentation, using Samba as a domain controller and then having systems on each subnet seemed to be the best approach. I set one of the machines to be the domain controller for what was my

Hello All, sample() only sample on one variable x. But I'm interested in sampling more than one variable without replacement. Suppose I have 3 vectors x, y, z. I want to draw samples from all three vectors such that the combination of the three elements in each draw is not the same as any previous draws. I could use expand.grid to generate a vector out of the three vectors. But when the

dear R wizards: X is factor with 20,000*20=800,000 observations of 20,000 factors. I.e., each factor has 20 observations. y is 800,000 normally distributed data points. I want to see how much R^2 the X factors can provide. Easy, right? > lm ( y ~ X) and > aov( y ~ X) Error: cannot allocate vector of size 3125000 Kb is this computationally infeasible? (I am not an expert, but