Search Results

Search found 13313 results on 533 pages for 'hit count'.

Page 381/533 | < Previous Page | 377 378 379 380 381 382 383 384 385 386 387 388  | Next Page >

• Are there any well-known algorithms or computer models that computer scientists use to predict FIFA

  - by Khnle

  Occasionally I read news articles that mention about some computer models that computer scientists use to predict winners of some sporting events or the odds for betting which I think there must be a mathematical model behind it. I never bothered to think twice even though I am a "pseudo computer scientist" myself. With the 2010 FIFA World Cup just underway, and since I am also a "pseudo football/soccer player" myself, I just started to wonder about these calculations algorithms. For example, I know one factor is determining the strength of opponents, so that a win against a strong opponent can count more than a win against a weak opponent. But it now kind of gets in a circular loop, or at least how does one determine the strength of a team in the first place, before that team can be considered strong or weak? If it's based on a historical data then there's no way that could be accurate, because those players of the past are no longer on the fields so their impact is none (except maybe if they become coaches like Maradona) Anyway, long question short, if you're happen to be working in this field or have some knowledge, please shed some lights.

  Read the article

• Building an array of arrays

  - by iFloh

  I am trying to get the following loop working to fill an array of arrays: while (condition) { [itemsArray fillFromDB]; if (! [checkArray containsObject:checkFlag]) { // Add existing itemsArray to myArray if (itemsArray.count) { // add the itemsArray to myArray and create a new instance of itemsArray [myArray addObject:itemsArray]; [itemsArray release]; NSMutableArray *itemsArray = [[NSMutableArray alloc] init]; } [itemsArray addObject:myObject]; [checkArray addObject:checkFlag]; } else { [itemsArray addObject:tmpEvent]; } } However I try to shape this loop it falls over the release of itemsArray when I use release (as above), the array does not re-initialise as a new instance with alloc. Whilst expecting emptyness, the next Object is added to the old array. when I use removeAllObjects, my Array is emptied and so is the array attached to myArray. Where am I going in the wrong direction?

  Read the article

• How do I search for values in a dictionary

  - by fishhead

  what would be the best way to search for a value in a dictionary. for instance I would like to search for modified objects, would going through the entire collection be the only way to do this? c#, .net 2.0 class RecA { public bool modified {get;set:} public string{get;set;} } class RecA_Dic : Dictionary<int,Rec_A> { public bool GetItemByKey(int key,out obj) { return this.TryGetValue(key, out obj); } public List<Rec_A> getModifiedItems() { List<Rec_A> li = new List<Rec_A>(); for(int i=0;i<this.count;i++) if (((Rec_A)this[i]).modified == true) li.Add((Rec_A)this[i]); return li; } }

  Read the article

• SSRS 2008: How to do multiple values report?

  - by Shimrod

  Hi everyone, Right now I have an application which uses Reporting Services to render reports. This is working nicely, I call each report with a given value (e.g. a ClientId), and the report gets rendered correctly. However, what I'd like to do now is being able to send multiple ClientIDs to the report, and would like to get 1 pdf file with count(ClientsIDs) pages, each containing the report, according to the ClienID. How is that possible? I don't really know how to name what I want to do, so I don't really find answers on the net right now. Maybe someone has a tutorial for me? Thanks in advance !

  Read the article

• Any ideas why this wont print out

  - by stan

  Revising for php and cant seem to get this to print the values out that i want Any ideas? Thanks <form action="revision.php" method="GET"> <input type=“text” name=“number[]”/> <input type=“text” name=“number[]”/> <input type=“text” name=“number[]”/> <input type=“text” name=“number[]”/> <input type=“text” name=“number[]”/> <input type="Submit" name="Calcuate"/> </form> <?php if(isset($_GET['number'])){ $amount = count($number); for($i=0; $i < $amount; $i++){ echo $number[$i]; } } ?>

  Read the article

• Simple Thread Programming

  - by mike

  I have started to play with threads in c#, but need now help, here is my code: public partial class Form1 : Form { public Form1() { InitializeComponent(); DoCount(); } public void DoCount() { for (int i = 0; i < 100; i++) { objTextBox.Text = i.ToString(); Thread.Sleep(100); } } } its a simple win forms with a textbox, i want to see the "counting", but as you see in my code, the textbox shows me 99, it count till 99 and then shows up.. i`ll think, i have to manage this in a new thread but dont know how!

  Read the article

• LINQ How to force query to materialize?

  - by Bobb

  Say I have simple LINQ extenstion: var filtered = data.Where(i => i.Count > 0); I know that this will not evaluated unless I start to use filtered i.e. foreach(DataItem i in filtered) ... However I need to create cloned version of data and release data as soon as possible. data can be changed in other thread so I want to get immediate snapshot of it. How can I force filtered to be evaluated immediately?

  Read the article

• Can't seem to be able to set ListViewItem.imageIndex

  - by TKL

  I have been scratching my head with this error for at least an hour, what the heck is wrong here? In a loop: if (selectedItems[x].ImageIndex == 3) { List<ListViewItem> dupes = CP.listCache.FindAll(delegate(ListViewItem item) { return item.Text == selectedItems[x].Text; }); if (dupes != null && dupes.Count == 1) dupes[0].ImageIndex = 0; } I can access the imageIndex, but not set it. ArgumentOutOfRange exception occurs.

  Read the article

• what is a good way to do countif in python

  - by tolomea

  I want to count how many members of an iterable meet a given condition. I'd like to do it in a way that is clear and simple and preferably reasonably optimal. My current best ideas are: sum(meets_condition(x) for x in my_list) and len([x for x in my_list if meets_condition(x)]) The first one being iterator based is presumably faster for big lists. And it's the same form as you'd use for testing any and all. However it depends on the fact that int(True) == 1, which is somewhat ugly. The second one seems easier to read to me, but it is different from the any and all forms. Does anyone have any better suggestions? is there a library function somewhere that I am missing?

  Read the article

• Getting Popular Topics on a Custom Made Forum

  - by Navarr

  For this website we're working on, we're trying to get the most popular topics (based on how many posts have been made in them within the last 24 hours). We have a medium to large based forum, and the current MySQL query looks like this: SELECT `forums_topics`.*, ( SELECT COUNT(`id`) FROM `forums_posts` WHERE `postdate` > (UNIX_TIMESTAMP()-60*60*24) AND `topicid`=`forums_topics`.`id` ) AS `trendy_threads` FROM `forums_topics` WHERE `deleted`=0 ORDER BY `trendy_threads` DESC,`postdate` DESC LIMIT 3 This unfortunately causes an SQL timeout with just one query and Error 500's. How can we get this information as quickly and as efficiently as possible?

  Read the article

• Resolve circular typedef dependency?

  - by Nick

  What is the best way to resolve the following circular dependency in typedef-ing these structs? Note the C language tag - I'm looking for a solution in standard gcc C. typedef struct { char* name; int age; int lefthanded; People* friends; } Person; typedef struct { int count; int max; Person* data; } People;

  Read the article

• How to map a set of text as a whole to a node?

  - by JIpeng Tan

  Suppose I have a plain text file with the following data: DataSetOne <br /> content <br /> content <br /> content <br /> DataSetTwo <br /> content <br /> content <br /> content <br /> content <br /> ...and so on... What I want to to is: count how many contents in each data set. For example the result should be <DataSetOne, 3>, <DataSetTwo, 4> I am a beginer to hadoop, I wonder if there is a way to map a chunk of data as a whole to a node. for example, set all DataSetOne to node 1 and all DataSetTwo to node 2. Does anyone can give me an idea how to archive this?

  Read the article

• How can I apply indexer to Dictionary.Values (C# 3.0)

  - by Newbie

  I have done a program string[] arrExposureValues = stock.ExposureCollection[dt].Values.ToArray(); for(int i = 0; i < arrExposureValues.Length; i++) Console.WriteLine(arrExposureValues[i]); Nothing wrong and works fine. But is it possible to do something like the below for(int i = 0; i < stock.ExposureCollection[dt].Count; i++) Console.WriteLine(stock.ExposureCollection[dt].Values[i]); This is just for my sake of knowledge (Basically trying to accomplish the same in one line). Note: ExposureCollection is Dictionary<DateTime, Dictionary<string, string>> First of all I have the doubt if it is at all possible! I am using C# 3.0. Thanks.

  Read the article

• Class design question (Disposable and singleton behavior)

  - by user137348

  The Repository class has singleton behavior and the _db implements the disposable pattern. As excepted the _db object gets disposed after the first call and because of the singleton behavior any other call of _db will crash. [ServiceBehavior(InstanceContextMode=InstanceContextMode.Single)] public class Repository : IRepository { private readonly DataBase _db; public Repository(DataBase db) { _db = db; } public int GetCount() { using(_db) { return _db.Menus.Count(); } } public Item GetItem(int id) { using(_db) { return _db.Menus.FirstOrDefault(x=>x.Id == id); } } } My question is, is there any way to design this class to work properly without removing the singleton behavior? The Repositoryclass will be serving big amount of requests.

  Read the article

• "And" condition in C#/LINQ Query

  - by user1213055

  partial void PrintDocLetter1_CanExecute(ref bool result) { if (this.PatientsMasterItem.DoctorsMasterItem != null) { var Doctor = PatientsMasterItem.DoctorsMasterItem; var PatientList = Doctor.PatientsMasterItem; var Letters = PatientsMasterItem.LettersSentItem; if ((PatientList.Count() > 1) && (Letters.Any(i => i.LetterType == "DoctorLetter1"))) { result = false; } else { result = true; } } } I think something is wrong with my second condition. I'm trying to find two things. 1) Doctors with more than 1 patient. 2) Among those patients whether a lettertype called "DoctorLetter1" has been sent or not. The above code is working good for that particular record but not working other patients with same doctors where patient1 has already been sent with DoctorLetter1.

  Read the article

• How to import datarow from one dataset to another?

  - by Disciple

  Hi, I want to copy the row to the new dataset if the previous value in second column isn't the same as the current one (i.e this dataset should have rows with unique values): DataTable tbl = new DataTable(); DataTable tmpTable = ds.Tables[0]; for( var rowIndex = 0; rowIndex < ds.Tables[0].Rows.Count; rowIndex++ ) { object value = null; foreach (DataRow x in tbl.Rows) { if (ds.Tables[0].Rows[rowIndex][1] == x[1]) { value = ds.Tables[0].Rows[rowIndex][1]; break; } } // value already exists if (value == null) { tbl.ImportRow(ds.Tables[0].Rows[rowIndex]); } } How to do this correctly? Maybe one loop instead 2?

  Read the article

• Reading in a file - Warning Message in R

  - by Sheila

  I have a file that has 22268 rows BY 2521 columns. When I try to read in the file using this line of code: file <- read.table(textfile, skip=2, header=TRUE, sep="\t", fill=TRUE, blank.lines.skip=FALSE) I get the following error: Warning message: In scan(file, what, nmax, sep, dec, quote, skip, nlines, na.strings, : number of items read is not a multiple of the number of columns I also used this command to see what rows had an incorrect number of columns: x <-count.fields("train.gct", sep="\t", skip=2) which(x != 2521) and got back a list of about 20 rows that were incorrect. Is there a way to fill these rows with NA values? I thought that is what the "fill" parameter does in the read.table function, but it doesn't appear so. Any help would be greatly appreciated. Thank you.

  Read the article

• How to improve the speed of a loop containing a sqlalchemy query statement as conditional

  - by LtPinback

  This loop checks if a record is in the sqlite database and builds a list of dictionaries for those records that are missing and then executes a multiple insert statement with the list. This works but it is very slow (at least i think it is slow) as it takes 5 minutes to loop over 3500 queries. I am a complete newbie in python, sqlite and sqlalchemy so I wonder if there is a faster way of doing this. list_dict = [] session = Session() for data in data_list: if session.query(Class_object).filter(Class_object.column_name_01 == data[2]).filter(Class_object.column_name_00 == an_id).count() == 0: list_dict.append({'column_name_00':a_id, 'column_name_01':data[2]}) conn = engine.connect() conn.execute(prices.insert(),list_dict) conn.close() session.close() edit: I moved session = Session() outside the loop. Did not make a difference.

  Read the article

• SqlCeCommand ExecuteNonQuery performance issue

  - by Michael

  I've been asked to resolve an issue with a .Net/SqlServerCe application. Specifically, after repeated inserts against the db, performance becomes increasingly degraded. In one instance at ~200 rows, in another at ~1000 rows. In the latter case the code being used looks like this: Dim cm1 As System.Data.SqlServerCe.SqlCeCommand = cn1.CreateCommand cm1.CommandText = "INSERT INTO Table1 Values(?,?,?,?,?,?,?,?,?,?,?,?,?)" For j = 0 To ds.Tables(0).Rows.Count - 1 'this is 3110 For i = 0 To 12 cm1.Parameters(tbl(i, 0)).Value = Vals(j,i) 'values taken from a different db Next cm1.ExecuteNonQuery() Next The specifics aren't super important (like what 'tbl' is, etc) but rather whether or not this code should be expected to handle this number of inserts, or if the crawl I'm witnessing is to be expected.

  Read the article

• Can I overwrite an Object that has been Locked() in C#?

  - by makerofthings7

  I have a few objects that I'd like to send to the server, but I want to make sure that this is the only thread that moving the data from Stage to Upload. Is the following code valid in a multithreaded environment? List<CounterInternal> UploadToServer = new List<CounterInternal>(); List<CounterInternal> StagingQueue = new List<CounterInternal>(); lock (this.UploadToServer) lock (this.StagingQueue) { if (UploadToServer.Count == 0) { UploadToServer = StagingQueue.DoDeepCopyExtensionMethod(); // is the following line valid given that I have a Lock() on it? StagingQueue = new List<CounterInternal>(); } } }

  Read the article

• Always get the correct datetime?

  - by Jesper Mansa

  I was wandering if there is a way/site/link whith the correct time? Not the servers datetime or the clients datetime. I'm using datetime to count down on my gaming site for when it is the users time to make a play. Users come from all ower the world so using the users client time would not match if its from the US to Europe. Then normally I would use the servers time, but somehow it skips 1.2 hours sometimes? I would like to make sure that everbody makes a timestamp from the same source and that source always is correct! Hoping for help and thanks in advance.

  Read the article

• Why is std::tr1::shared_ptr<>.reset() so expensive?

  - by Paul Oyster

  Profiling some code that heavily uses shared_ptrs, I discovered that reset() was surprisingly expensive. For example: struct Test { int i; Test() { this->i = 0; } Test(int i) { this->i = i; } } ; ... auto t = make_shared<Test>(1); ... t.reset(somePointerToATestObject); Tracing the reset() in the last line (under VC++ 2010), I discovered that it creates a new reference-counting object. Is there a cheaper way, that reuses the existing ref-count and does not bother the heap?

  Read the article

• Strange Array#each Ruby behaviour

  - by with a dot.

  The question is a bit vague, but I am not really sure why this happens: I have the following code: p user.room.users.length user.room.users.each {|usr| puts "b" } user.room.users.each {|usr| puts "a"; usr.enter(Room[Config::entrance]) } which outputs: 5 b b b b b a a a I also made User#enter count how many times it's been called and it returns 3! I am completely baffled by this behaviour. I doubt the code within User#enter is the cause, but if someone thinks it might be relevant I can provide it (I don't want to clutter the question unnecessarily). Edit If it's relevant I am using ruby-1.9.3-p125

  Read the article

• PHP: extract email and name from data file

  - by pi-2r

  I need to extract the name and the e-mail from one data file. the file contains more than 500 lines and I want to extract this two informations almost all the data. I would like to use preg_match_all, but my function doesn't work ... $chaine = " ----------------- 11/21/12 16:06:54 tcp static-qvn-qvt-127041 MAIL [email protected] NAME tata1 ----------------- 11/21/12 16:06:54 tcp static-qvn-qvt-127041 MAIL [email protected] NAME tata2 * ----------------- 11/21/12 16:06:54 tcp static-qvn-qvt-127041 MAIL [email protected] NAME tata3 "; //$chaine =" #76:50#89:1#86:50#49:1#84:22"; $motif="/MAIL([a-z]{2,4}+)NAME([a-z]{2,4}+)/"; preg_match_all($motif,$chaine,$out); $nb=count($out[0]); for($i=0;$i<$nb;$i++) { echo $out[0][$i].'<br/>'; }

  Read the article

• Counting Values in R Vector

  - by GTyler

  I have a large vector of percentages (0-100) and I am trying to count how many of them are in specific 20% buckets (<20, 20-40, 40-60,60-80,80-100). The vector has length 129605 and there are no NA values. Here's my code: x<-c(0,0,0,0,0) for(i in 1: length(mail_return)) { if (mail_return[i]<=20) { x[1] = x[1] + 1 } if (mail_return[i]>20 && mail_return[i]<=40) { x[2] = x[2] + 1 } if (mail_return[i]>40 && mail_return[i]<=60) { x[3] = x[3] + 1 } if (mail_return[i]>60 && mail_return[i]<=80) { x[4] = x[4] + 1 } else { x[5] = x[5] + 1 } } But sum(x) is giving me length 133171. Shouldn't it be the length of the vector, 129605? What's wrong?

  Read the article

< Previous Page | 377 378 379 380 381 382 383 384 385 386 387 388  | Next Page >