similar to: RFC: adding new data "ups.efficiency"

Hello Rubyists, I''m in the position of being given the job to design and build a mission-critical web facing application for a small but growing enterprise. It is to be used by customers as needed, numbering in the tens up to the hundreds. It will collect operational data, particularly in a table around 50 columns wide, and potentially millions of rows deep, most fields being numerical.

Hi, Quick question to all the electronics gurus out there.. I unpacked my second GS phone yesterday (had it for about a month!) and set it up.. This morning the power supply is dead.. I have looked for a new one online (In the UK using Maplin let me know if you know a better place.) becasue it would probbaly take too long to get one sent from China or the US and I need to get that station

Hello, I am building the SPEC 2006 Benchmark with Clang as the compiler. I have written a function pass in LLVM and I am trying to run that for SPEC by invoking the pass in the build options of SPEC. The build options of SPEC are in a *.cfg config file, which allows us to specify the choice of compiler while building SPEC. (https://www.spec.org/cpu2006/Docs/install-guide-unix.html) The pass

Hi, Something has been bothering me for a long time and I''d like to know what other think about this common situation with Rails. Someone is looking at http://example.com/user/new where there is a form that POSTs the data to the user/create action. The controller might look like def new @user = User.new end def create @user = User.new(params[:entry]) if @user.save

Has anyone profiled the performance of RedCloth versus BlueCloth? I''m starting to realise that RedCloth is a more mature ruby project, although Markdown the syntax maybe more widespread than Textilize. Apart from the syntax, does anyone feel they have a preference, in terms of performance or number of outstanding bugs? Many thanks in advance. CHEERS> SAM

I was doing a test on adding a lot of leafs and filters, I create 100,000 filters with about 25,000 leafs, it has taken over 30minutes to add all the rules. Does any one have any info on the Maxium or so number or rules a box should have to remain operational and also able to install the rules? This was on an AMD 700 athlon. -- When dealing with a slow pipe, never underestimate the throughput

Rsync is efficient at transferring diffs across the wire, but how efficient is it at updating the remote file itself (in terms of disk operations)? If, for example, you have a 500MB file (say an ISO) whose modification consists solely of a few bytes added on to the beginning of the file. Will it create an entirely new 500MB file? Or will it somehow know how to insert the bytes at the beginning

Hi, Does anyone have the data of the rsync transfer speed vs. other tools like ftp? Or where is the place to find such information that compare the transfer speed between different tools? If I were to transfer a single large file, say 500Mega Byte, previously non-existent on the remote host, what would be the fastest tool I can choose for transfer? Thanks, Christina Li

Afternoon all, I'm running a transfer setup as follows: A -> B -> C - fairly simple, B initiates a transfer from A to C - B is a vital intermediary as it bridges two otherwise seperate networks. All machines have onboard Gigabit ethernet, A+B are connected via Crossover and B->C is connected by very fast switch (i.e. all connections should be able to use the full gig if they wanted

Dear Members  I am Writing to you because I need help to compute the Malmquist Luenberger  index  with  R with my panel data of 10 central Africa countries from the year 1980 to 2008. I have three inputs and 2 outputs which one is undesirable (CO2) and the other (GDP for agriculture is the desirable one).  Is it possible for you to guide me through the right code which could help me to compute it?

I'm trying to answer a question from a student about memory use in R (I won't go into the details right here). I have a really vague memory of having read a document, possibly by Venables or Ripley, discussing the awfulness of memory allocation in S-PLUS, and giving (in the context of a bootstrapping analysis of shoe size data??) some general strategies for conserving memory in S-PLUS.

hi,all l am a newer to xapian,and l builds indexes for three million pages recently,but lt takes about seven days ,l am a bit of confusing about the efficiency of building indexes with xapian,so please give me some information about xapian efficiency of building indexes,thanks a lot.

This change lowers ring buffer reclaim threshold from 1/2*queue to budget for better performance. According to our test with qemu + dpdk, packet dropping happens when the guest is not able to provide free buffer in avail ring timely with default 1/2*queue. The value in the patch has been tested and does show better performance. Signed-off-by: jiangkidd <jiangkidd at hotmail.com> ---

On Tue, Aug 20, 2019 at 02:51:23AM +0000, ? jiang wrote: > This change lowers ring buffer reclaim threshold from 1/2*queue to budget > for better performance. According to our test with qemu + dpdk, packet > dropping happens when the guest is not able to provide free buffer in > avail ring timely with default 1/2*queue. The value in the patch has been > tested and does show better

I am trying to decode 192k/24 bit flac on 542 MHZ risk processor, and I am having problems. I seem to be right at the edge of what this processor can do. So I am wondering what functions would be canidates for assembly code optimization? Any suggestions? Or could an older version of code be a batter candidate to use? Dennis Kerrisk 720-542-8504 303-668-0736 dennis_k85 at yahoo.com

Hi Gregory, GM> Flac decode is VERY fast: GM> http://web.inter.nl.net/users/hvdh/lossless/lossless.htm Thank you for the link. Although I switched to flac for other reasons, these data appear to support my switch, given the hardware limitations I have. As I mentioned, I use a 400 mhz laptop in my office, and at home a qnap ts-101 running slimserver software. While quite usable, neither

Good afternoon! Thanks for the previous answers, now there was a question of efficiency. I use the formula of transformation YUV12->RGB: float r = nY + 1.371f * ( nV - 128 ); float g = nY - 0.698f * ( nV - 128 ) - 0.336f * ( nU - 128 ); float b = nY + 1.732f * ( nU - 128 ); frame[index + 0] = ClampFloatToByte( r ); frame[index + 1] = ClampFloatToByte(

Full_Name: Morten Welinder Version: snapshot OS: Submission from: (NULL) (65.213.85.218) Time to kick phyper's tires... The current version has very serious cancellation issues. For example, if you ask for a small right-tail you are likely to get total cancellation. For example phyper(59, 150, 150, 60, FALSE, FALSE) gives 6.372680161e-14. The right answer is dhyper(0, 150, 150, 60,

Dear R-users In order to speed up the performance of my program I tried to make a function f2 (that is only called from function f1) local to f1. In that way I pass one argument less to f2, a huge matrix. (This matrix isn't changed inside f2, so - afaik - it is passed by reference and size doesn't matter.) Still I would have expected that f1 would be a little faster, but the opposit

Dear R-help, As a generalization, is it more efficient to use a single method to selectively transform items in a matrix? Preferably whole-vector, yes; but if one of the column vectors compels the use of a "for loop", is it then faster to do all of the transformations for the matrix via that "for loop", rather than use a mixture of methods on a column-wise basis? TIA