Displaying 10 results from an estimated 10 matches for "max_y".
Did you mean:
max_e
2009 Feb 26
2
[LLVMdev] Impressive performance result for LLVM: complex arithmetic
Following a discussion about numerical performance on comp.lang.functional
recently I just tried running a simple C mandelbrot benchmark that uses C99's
complex arithmetic using gcc and llvm-gcc on a 2.1GHz Opteron 2352 running
Debian:
gcc: 5.727s
llvm-gcc: 1.393s
There is still 20% room for improvement but LLVM is >4x faster than gcc here.
Sweet.
Here's the code:
#include
2005 Oct 06
3
playing with R: make a animated GIF file...
...quot;
logoWidth = 1.5
logoHeight = 2.5
L = nchar(yourLogo)
TrigSplit = 360 / L
yourLogo = strReverse(yourLogo)
posx = numeric(L)
posy = numeric(L)
for( i in 0:L){
posx[i] = logoHeight * sin(i * TrigSplit * pi / 180)
posy[i] = logoWidth * cos(i * TrigSplit * pi / 180)
}
max_x = max(posx)*1.1
max_y = max(posy)*3
min_x = min(posx)*1.1
min_y = min(posy)*3
cex = 2/(posy + 2)
idx = 1:L
for(j in 1:L-1) {
###################file = paste("CQM_",j,".png",sep="")
###################png(filename=file, bg="transparent")
plot(0,t='n', xlim=c(min_x,...
2009 Feb 27
0
[LLVMdev] Impressive performance result for LLVM: complex arithmetic
On gcc's side, this is a simple missed opt on the part of builtin lowering.
As a result, the gcc code ends up with a call to muldc3 (complex = 2x2
multiply double) and the llvm code doesn't.
GCC should be fixed in a second, and with that, there is no
appreciable performance difference between the two.
On Thu, Feb 26, 2009 at 4:07 PM, Jon Harrop <jon at ffconsultancy.com> wrote:
>
2006 Oct 17
0
[680] trunk/wxruby2/samples/printing/printing.rb: Cleaned up to use the Ruby naming convention, added #! line, now uses Wx default ID''s in standard menu items.
...n><span class="cx"> # We know the graphic is 200x200. If we didn''t know this,
</span><span class="cx"> # we''d need to calculate it.
</span><del>- maxX = 200
- maxY = 200
</del><ins>+ max_x = 200
+ max_y = 200
</ins><span class="cx">
</span><span class="cx"> # Let''s have at least 50 device units margin
</span><del>- marginX = 50
- marginY = 50
</del><ins>+ margin_x = 50
+ margin_y = 50
</ins><span...
2011 Mar 22
0
Diagonal population density
...Density in X
fy<-rowSums(city$data)
fy<-(fy-min(fy))/(max(fy)-min(fy)) #Relative Marginal Density in Y
image(x,y,t(city$data),xlab="",ylab="") #plotting city
### plotting fuzzy membership function of city
contour(color(fcity,min_x=min(x),max_x=max(x),min_y=min(y),max_y=max(y),px=length(x),py=length(y),n=n,operator=operator),add=T,xlab="",ylab="",lwd=1.5)
###
par(mar=c(0,3,1,1)) #upper-left corner
### plot fuzzy membership function of X
plot(fcity$x,c(0,1,1,0),type="l",axes=F,frame.plot=TRUE,xlab="",ylab="&quo...
2007 May 22
0
[1030] trunk/wxruby2/samples/printing/printing.rb: Fix so will print again.
...22 08:20:06 UTC (rev 1029)
+++ trunk/wxruby2/samples/printing/printing.rb        2007-05-22 17:17:39 UTC (rev 1030)
</span><span class="lines">@@ -262,7 +262,9 @@
</span><span class="cx"> max_y += (2*margin_y)
</span><span class="cx">
</span><span class="cx"> # Get the size of the DC in pixels
</span><del>- w, h = dc.get_size
</del><ins>+ size = dc.get_size
+ w = size.get_width
+ h = size.get_height
</...
2008 Aug 24
2
Missing ids in documentation
...ent_fill_linear</h3>
dc.html:<h3>DC#logical_to_device_x</h3>
dc.html:<h3>DC#logical_to_device_xrel</h3>
dc.html:<h3>DC#logical_to_device_y</h3>
dc.html:<h3>DC#logical_to_device_yrel</h3>
dc.html:<h3>DC#max_x</h3>
dc.html:<h3>DC#max_y</h3>
dc.html:<h3>DC#min_x</h3>
dc.html:<h3>DC#min_y</h3>
dc.html:<h3>DC#is_ok</h3>
dc.html:<h3>DC#reset_bounding_box</h3>
dc.html:<h3>DC#set_axis_orientation</h3>
dc.html:<h3>DC#set_background</h3>
dc.html:<h3>DC#se...
2001 Apr 03
3
single-pass algorithm for quantile calculation
Dear R users, I am looking for a reference to an algorithm for estimation of
sample quantiles which does not require bringing the whole data into memory
(more precisely its memory complexity should be much less than linear,
ideally constant). I realize that such an algorithm can only be approximate
and actually quite wrong for some samples, but that's fine with me.
Thank you,
Vadim
2011 Oct 03
1
minimisation problem, two setups (nonlinear with equality constraints/linear programming with mixed constraints)
Dear All,
Thank you for the replies to my first thread here: http://r.789695.n4.nabble.com/global-optimisation-with-inequality-constraints-td3799258.html. So far the best result is achieved via a penalised objective function. This was suggested by someone on this list privately. I am still looking into some of the options mentioned in the original thread, but I have been advised that there may
2007 Mar 27
0
[922] branches/wxruby2/wxwidgets_282: Changes, additions and deprecations 2.6 -> 2.8 Wx API
...> * "DC#logical_to_device_xrel":#DC_logicaltodevicexrel
</span><span class="cx"> * "DC#logical_to_device_y":#DC_logicaltodevicey
</span><span class="lines">@@ -90,7 +100,7 @@
</span><span class="cx"> * "DC#max_y":#DC_maxy
</span><span class="cx"> * "DC#min_x":#DC_minx
</span><span class="cx"> * "DC#min_y":#DC_miny
</span><del>-* "DC#ok":#DC_ok
</del><ins>+* "DC#is_ok":#DC_isok
</ins><sp...