search for: bound

Dear all, I am quite puzzled about the bound and absolute.t arguments to the l1ce function in the lasso2 package. (The l1ce function estimates the regression parameter b in a regression model y=Xb+e subject to the constraint that |b|<t for some value t). The doc says: bound numeric, either a single number or a vector: the constraint(s)...

Hi, First, when I try the example Prostate with bound 0.44 (as in the manual), I got a different result: > l1c.P <- l1ce(lpsa ~ ., Prostate, bound=0.44) > l1c.P .... Coefficients: (Intercept) lcavol lweight age lbph svi 1.0435803 0.4740831 0.1953156 0.0000000 0.0000000 0.3758199 lcp gle...

Dear LLVM developers: Here is my another proposal of LLVM. Any suggestion would be welcome! * ** * *** Integrate Baggy Bounds Checking into SAFECode*** * * *Abstract:** * Baggy Bounds Checking (BBC) is an efficient bounds checking technique that pad and align objects to powers of two and enable allocation bounds. It uses a contiguous array as bounds table to enable efficient bounds lookup and thus has low overhead at r...

...(lower==-Inf) && (upper==Inf). Rather, it should return 0. Quick fix: ### old code ### ### [snip] else { if (is.na(lower) || is.na(upper)) stop("a limit is missing") if (is.finite(lower)) { inf <- 1 bound <- lower } else if (is.finite(upper)) { inf <- -1 bound <- upper } else { inf <- 2 bound <- 0 } wk <- .External("call_dqagi", ff, rho =...

On Sat, Aug 17, 2013 at 7:08 AM, Tom Browder <tom.browder at gmail.com> wrote: > On Sat, Aug 17, 2013 at 6:15 AM, Tom Browder <tom.browder at gmail.com>wrote: > >> On Fri, Aug 16, 2013 at 2:58 PM, Tom Browder <tom.browder at gmail.com>wrote: >> >>> On Fri, Aug 16, 2013 at 2:55 PM, Tom Browder <tom.browder at gmail.com>wrote: >>>

...corDisplay *) 0xce2470 #23 0x00002aaaaeb4c593 in regexHandleEvent (d=0x1e67540, event=0x0) at regex.c:265 rd = (RegexDisplay *) 0xd15ba0 #24 0x00002aaaaed4f894 in moveHandleEvent (d=0x633f00, event=0x7fff0f24ad30) at move.c:673 o = {{name = 0x40001000c <Address 0x40001000c out of bounds>, type = CompOptionTypeBool, value = { b = 0, i = 0, f = 0, s = 0x0, c = {0, 0, 0, 0}, action = {initiate = 0, terminate = 0, state = 0, type = CompBindingTypeNone, key = {keycode = 0, modifiers = 0}, button = {button = 0, modifiers = 0}, bell = 0, edgeMask = 0, edgeButt...

Could someone help me with the following code snippet. The results are not what I expect: > Sheet1$Claims[1:10] [1] NA 1 2 NA NA NA NA NA NA NA > Sheet1[1:10,"SubmissionStatus"] [1] Declined Bound Bound Bound Bound Bound Declined Dead Declined [10] Not Taken Levels: Bound Dead Declined Not Taken > Sheet1$Claimsnum <- NA > Sheet1$Claimsnum <- ifelse(Sheet1$SubmissionStatus != "Bound",99999, + ifelse(as.character(Sheet1$Cla...

...o-length array with a flexible-array member in `struct PACKED_REGISTRY_TABLE`. Also annotate array `entries` with `__counted_by()` to prepare for the coming implementation by GCC and Clang of the `__counted_by` attribute. Flexible array members annotated with `__counted_by` can have their accesses bounds-checked at run-time via `CONFIG_UBSAN_BOUNDS` (for array indexing) and `CONFIG_FORTIFY_SOURCE` (for strcpy/memcpy-family functions). This fixes multiple -Warray-bounds warnings: drivers/gpu/drm/nouveau/nvkm/subdev/gsp/r535.c:1069:29: warning: array subscript 0 is outside array bounds of 'PACK...

...t; #4 0x080bb1b7 in handle_show_dialplan (fd=1, argc=2, argv=0x80478e0) at pbx.c:3663 exten = 0x0 context = 0x0 counters = {total_context = 40, total_exten = 67, total_prio = 134, context_existence = 1, extension_existence = 1} incstack = {0x1 <Address 0x1 out of bounds>, 0x0, 0x0, 0x80a8537 "\215e?[^_???\003\200", 0x0, 0x8120b95 "logger.c", 0x37c <Address 0x37c out of bounds>, 0x811596c "ast_verbose", 0x0, 0x0, 0x80476e8 "`\025\025\b\001v\004\b\210>\026\b", 0x80e3ee6 "\203?0\215e?[^\211?_??\220?\200&qu...

...tail.aspx?sku=INCITS%2fISO%2fIEC+9899%3a2011%5b2012%5d > I found a draft version which appears to have been complete. > > The title of Annex L is Analyzability, because that was the > purpose, but the effect was to define a stricter abstract machine in > which there were no unbounded undefined behaviors except what was > absolutely necessary. That does not address every question in the > questionnaire, but it is a good start, and it has already been > standardized so there is something concrete to implement. IMHO, the Annex completely fails to be useful for the p...

Hi, Some days ago I am interested in detecting undefined behaviors in C programs based on Clang. After several days’ investigation, I think checking bounds overflow bugs is more interesting, because bounds overflow is one of the most frequently encountered errors in C programs. For example, performing pointer arithmetic without checking bounds can cause bounds overflow. To increase the accuracy of finding bugs, I want to write several passes, bas...

John Regehr wrote: > Qiuping, > > Have you looked at what has already been done? I would expect that taking > previous work such as this: > > http://llvm.org/pubs/2006-05-24-SAFECode-BoundsCheck.html > > and integrating into current LLVM would be a better idea than starting > over. > This code is publicly available from the SAFECode project (see http://safecode.cs.illinois.edu to see how to get it). However, it has not been maintained well over the years and is cu...

...would require a nested for loop. Does anyone have advice as to how to do this? Thanks for your time. Kirsten ## Mark-Recapture ## Estimate popoulation from repeated sampling ## Population size N <- 400 N ## Vector labeling each item in the population pop <- c(1:N) pop ## Lower and upper bounds of sample size lower.bound <- round(x = .05 * N, digits = 0) lower.bound ## Smallest possible sample size upper.bound <- round(x = .15 * N, digits = 0) upper.bound ## Largest possible sample size ## Length of sample size interval length.ss.interval <- length(c(lower.bound:upper.bound))...

How to define bounds for a semi continous variable in lp_solve. Min 5x1 +9x2 +7.15x3 +0.1x4 subject to x1+x2+x3+x4=6.7 x1+x4 <= 6.5 And x3 can be 0 or greater than 3.6 hence x3 is a semi continous variable how to define bounds as well as semicontinous function because using set.semicont and set. bound simantane...

Sounds an good idea, is that means lowerinng down the SAFECode project from the higher level(clang)to lower level for an more general work on bound check? I aslo want to know is it possoble to detecting memory leak at the very low(llvm ir) level to detecting memory leaks? Or at llvm ir level to providing an stackfull hooks? It's very useful to have such an feature. The stack hooks can help us to print extra stack info in the exec period w...

...xb778a7a8 in reload () at app_queue.c:4012 #2 0x0805bb44 in ast_module_reload (name=0x8137cc7 "app_queue.so") at loader.c:257 #3 0x08092b3f in handle_reload (fd=33, argc=2, argv=0xbddfa470) at cli.c:147 #4 0x0809283e in ast_cli_command (fd=33, s=0x6d6f7250 <Address 0x6d6f7250 out of bounds>) at cli.c:1364 #5 0x080aef0f in action_command (s=0x81ead18, m=0xbddfaac0) at manager.c:927 #6 0x080b3ee4 in process_message (s=0x81ead18, m=0xbddfaac0) at manager.c:1305 #7 0x080b2ac5 in session_do (data=0x81ead18) at manager.c:1401 #8 0xb7f15ed8 in pthread_start_thread () from /lib/libpt...

...ith LLVM 2.6, and mainline is working (with some regressions) with the upcoming LLVM 2.7. You can subscribe to the SVA Commits mailing list (http://lists.cs.uiuc.edu/mailman/listinfo/sva-commits) to get email whenever a commit is made to SAFECode. However, there is an inter-procedural static array bounds checking pass that comprises a small component of SAFECode. It is an optional component, so SAFECode works without it, but SAFECode would work better if this static array bounds checking pass were working. This inter-procedural static array bounds checking pass in SAFECode has not been maintained...

...ts. Here is my proposal: http://socghop.appspot.com/gsoc/student_proposal/show/google/gsoc2010/easyqiu/t127038894856 2010-04-07 yiqiuping1986 发件人： John Criswell 发送时间： 2010-03-30 22:42:53 收件人： John Regehr 抄送： 易秋萍; llvmdev at cs.uiuc.edu 主题： Re: [LLVMdev]summer_of_code_idea_―_checking_bounds_overflow_bugs John Regehr wrote: > Qiuping, > > Have you looked at what has already been done? I would expect that taking > previous work such as this: > > http://llvm.org/pubs/2006-05-24-SAFECode-BoundsCheck.html > > and integrating into current LLVM would be a bet...

If this is posted elsewhere I cannot find it. I need to perform multiple integration where some of the variables are in the bounds of the other variables. I was trying to use R2Cuba function but cannot set the upper and lower bounds. My code so far is : int <- function(y){ u2 = y[1] z2 = y[2] u1 =y[3] z1 = y[4] ff <- u1*(z1-u1)*u2*(z2-u2)*exp(-0.027*(12-z2)) return(ff) } cuhre(4,1,int,rel.tol=1e-3,lower=c(y[4],y[4...

Dear Duncan, Everything worked out with your help. Thanks. I'm now looking at bound checks that an Ada program has, so I can remove all possible. It seams that Ada already does some optimization to remove bound checks. Do you know how are they done, and where? I tested two codes (below) and the first code did not produce any bound check and the second produced two bound checks....