search for: counts

Hi this is my first post. I am trying to run a simulation for a computer playing Von Neumann poker and adjusting it's expectation of an opponent's behavior according to how the opponent plays. This program involves random generation of "hands" and shifting of parameters. However, when I run the code, no errors come up, but the program doesn't do anything. Could someone

...t+found? yes '..' in /1/8070 (1884172) is /2/8186 (3588108), should be /1 (1687558). Fix? yes '..' in /1/8071 (1949708) is /2/8184 (3227660), should be /1 (1687558). Fix? yes Unconnected directory inode 2064396 (/1/8071/???) Connect to /lost+found? yes Pass 4: Checking reference counts Inode 1671181 ref count is 1, should be 2. Fix? yes Inode 1687558 ref count is 73, should be 65. Fix? yes Inode 1703942 ref count is 41, should be 40. Fix? yes Inode 1736710 ref count is 39, should be 38. Fix? yes Inode 1785868 ref count is 1, should be 2. Fix? yes Inode 1802246 ref count...

So I've been an avid user of Left 4 Dead 1 and 2. This problem only seems to arise in L4D2, where the audio will cut out. Now, not completely, some things will drop but some stay, for instance, I can hear the noise my gun makes, the shots fired but I don't hear characters talking anymore or any special infected sounds. Another instance is I'll see my gun firing but I'll hear the

...g': --8<-- e2fsck 1.35 (28-Feb-2004) Couldn't find ext2 superblock, trying backup blocks... hdb1.img was not cleanly unmounted, check forced. Pass 1: Checking inodes, blocks, and sizes Pass 2: Checking directory structure Pass 3: Checking directory connectivity Pass 4: Checking reference counts Pass 5: Checking group summary information Free blocks count wrong for group #0 (24043, counted=0). Fix? no Free blocks count wrong for group #1 (32250, counted=0). Fix? no Free blocks count wrong for group #2 (32253, counted=0). Fix? no Free blocks count wrong for group #3 (32250, counted=158)....

Hello, i've ubuntu 8.04 (32bit) with wine 1.0-rc5. I've installed without problem vampire: bloodlines and it works fine in the menu, but when the game starts the audio works well but the video is all "orange". As graphic card i've a ati moblitiy x1600 with official driver (installed using envyNG) and before start the game i've used compiz-switch to disable compiz. the

The code on http://blog.craz8.com/articles/2005/10/28/acts_as_taggable-is-a-cool-piece-of-code is based on the acts_as_taggable gem,anybody has done that using the acts_as_taggable plugin?thanks! btw:the code above uses the tag_count method,which is defined in the gem: def tags_count(options = {}) options = {:order => ''count DESC''}.merge(options)

Based on Rich's review of my v1 that touched only cache.c, I have now tried to bring all three filters with alignment rounding in line with one another. There is definitely room for future improvements once we teach nbdkit to let filters and plugins advertise block sizes, but I'm hoping to get NBD_CMD_CACHE implemented first. Eric Blake (2): blocksize: Process requests in linear order

...ll instructions based on which the hotness/coldness of callsites can be determined. Experiments have shown that using a higher threshold for hot callsites results in improved runtime performance of the generated code without significant code size increases. We propose to generate synthetic function counts for non-PGO compilation and use the counts for boosting hot callsites during inlining. Synthetic function entry counts of functions are initialized based on properties of the function such as whether it is visible outside the module, whether it has an inline keyword and so on. Then, the callgraph...

Can someone help me with a misunderstanding I'm having with hist? I expected, from the example below, that the number of bins would always be 10 and the length of the counts array the same. According to the help section 'breaks' can be a integer indicating the number of bins. From the example below, the number of bins (length of the counts array) varies. Am I wrong in expecting the same number of bins every time from my hist() call (am I doing something wrong)?...

every one,I meet a problem: I used reahat9.0(kernel 2.4.20-8smp,I installed a SCSI RAID Card),and there are always some problems and them the system is dead. is anyone can help me about it? Thanks Crist Below is the error log: Jun 11 22:19:03 mail1 kernel: EXT3-fs error (device sd(8,18)): ext3_free_blocks: Freeing blocks not in datazone - block = 1382828372, count = 1 Jun 11 22:19:03 mail1

On 11.02.20 10:33, Eugenio P?rez wrote: > On Mon, 2020-02-10 at 12:01 +0100, Christian Borntraeger wrote: >> >> On 10.02.20 10:47, Eugenio Perez Martin wrote: >>> Hi Christian. >>> >>> I'm not able to reproduce the failure with eccb852f1fe6bede630e2e4f1a121a81e34354ab commit. Could you add more data? >>> Your configuration (libvirt or qemu

I have a list (length 750), each element containing a vector of unique strings (unique gene ids), with length up to ~40 (median 15). I want to compile a matrix of all possible triplets and their frequency within gene elements. Using combn and a lot of looping, I am accomplishing this but it is VERY slow. I've tried to figure out a way to vectorize this, using "match" and

I am trying to replicate the SAS proc univariate in R. I got most of the stats I needed for a by grouping in a data frame using: all1 <- ddply(all,"ACT_NAME", summarise, mean=mean(COUNTS), sd=sd(COUNTS), q25=quantile(COUNTS,.25),median=quantile(COUNTS,.50), q75=quantile(COUNTS,.75), q90=quantile(COUNTS,.90), q95=quantile(COUNTS,.95), q99=quantile(COUNTS,.99) ) So I got the mean, median std dev, quantiles etc. IS there any way I can add the mode to the mixt...

The background: I'm trying to fit a Poisson-lognormal distrbutuion to some data. This is a way of modelling species abundances: N ~ Pois(lam) log(lam) ~ N(mu, sigma2) The number of individuals are Poisson distributed with an abundance drawn from a log-normal distrbution. To fit this to data, I need to integrate out lam. In principle, I can do it this way: PLN1 <- function(lam, Count,

Hi all, It looks like the induction variable simplification pass prefers doing a zero-extension to compute the wider trip count of loops when extending the IV. This can sometimes result in loss of information making ScalarEvolution's analysis conservative which can lead to missed performance opportunities. For example, consider this loopnest- int i, j; for(i=0; i< 40; i++) for(j=0;

Hello Everyone, I started seeing some ata errors on a server running FreeBSD 5.4-STABLE that I've never seen before. This probably has something to do with it but we just upgraded the RAM on the server from 1 GB to 2 GB (DDR 400), perhaps a cable got slightly loose. I'm pretty certain the hard drives are good since the server ran fine prior to the memory upgrade. What do the errors below

Hi, I've been running close combat 5 with wine for a while now but lately I've been getting a error with the program crashing. The following output comes in the terminal: ---------------------------------------------------------------------------------------------------------------------------------------------------- wine: Unhandled page fault on write access to 0x0375fffe at

hello, I have the following in my controller def totalmembers @total = User.find_by_sql "SELECT COUNT(*) as count FROM users " end now inside my template how do i access the field "count" from the query so i can print out the number of members ? I tried everythign like <%= @total.count %> but nothing works. thanks adam

On Fri, Dec 15, 2017 at 12:22 AM, Sean Silva <chisophugis at gmail.com> wrote: > IIUC, this proposal is just saying that we should infer a static profile > for entry counts just like we do for branch probabilities. In the case of > entry counts, we do not hide that information behind an analysis like BPI, > so currently just annotating synthetic PGO entry counts is a simple > solution that piggybacks on the PGO mechanism and Just Works. > > If that is c...

Although the time spent in memcpy/memset probably pales in comparison to time spent in socket I/O, it's still worth worth reducing the number of times we have to utilize a bounce buffer when we already have aligned data. Note that blocksize, cache, and cow all do block fragmentation and bounce-buffer alignment; this brings the logic in cache and cow (which were copied from one another) more