Search Results

Search found 5 results on 1 pages for 'rau'.

Page 1/1 | 1 

• Is it possible to use Google-friendly URLs in WSS 3.0 site?

  - by rau

  Hello I have website designed in WSS 3.0 (Windows SharePoint Services 3.0). Can i re-write URLs to Google / SEO friendly URLs? If yes then please do let me know how to do it? Thanks, Rau.

  Read the article

• segmented reduction with scattered segments

  - by Christian Rau

  I got to solve a pretty standard problem on the GPU, but I'm quite new to practical GPGPU, so I'm looking for ideas to approach this problem. I have many points in 3-space which are assigned to a very small number of groups (each point belongs to one group), specifically 15 in this case (doesn't ever change). Now I want to compute the mean and covariance matrix of all the groups. So on the CPU it's roughly the same as: for each point p { mean[p.group] += p.pos; covariance[p.group] += p.pos * p.pos; ++count[p.group]; } for each group g { mean[g] /= count[g]; covariance[g] = covariance[g]/count[g] - mean[g]*mean[g]; } Since the number of groups is extremely small, the last step can be done on the CPU (I need those values on the CPU, anyway). The first step is actually just a segmented reduction, but with the segments scattered around. So the first idea I came up with, was to first sort the points by their groups. I thought about a simple bucket sort using atomic_inc to compute bucket sizes and per-point relocation indices (got a better idea for sorting?, atomics may not be the best idea). After that they're sorted by groups and I could possibly come up with an adaption of the segmented scan algorithms presented here. But in this special case, I got a very large amount of data per point (9-10 floats, maybe even doubles if the need arises), so the standard algorithms using a shared memory element per thread and a thread per point might make problems regarding per-multiprocessor resources as shared memory or registers (Ok, much more on compute capability 1.x than 2.x, but still). Due to the very small and constant number of groups I thought there might be better approaches. Maybe there are already existing ideas suited for these specific properties of such a standard problem. Or maybe my general approach isn't that bad and you got ideas for improving the individual steps, like a good sorting algorithm suited for a very small number of keys or some segmented reduction algorithm minimizing shared memory/register usage. I'm looking for general approaches and don't want to use external libraries. FWIW I'm using OpenCL, but it shouldn't really matter as the general concepts of GPU computing don't really differ over the major frameworks.

  Read the article

• Glume super amuzante

  - by haioase

  Un ardelean si un lepros stau in inchisoare. La un moment dat, leprosului ii cade o ureche... o ia si o arunca pe geam. Dupa un timp, leprosului ii cade nasul... il ia si il arunca pe geam. Dupa un timp, leprosului ii cade un deget... il ia si il arunca pe geam... Ardeleanul nu mai suporta: -No, dupa cum bag de sama, 'mneata vrei sa evadezi!– Nu va suparati, ce se da aici? - Nu stiu, domnule, stai sa întrebam. Întrebarea circula pâna la primul din rând. - Nu stiu. Mi s-a facut rau si m-am sprijinit de zid. Când mi-am revenit, era deja coada în spatele meu. - De ce nu pleci atunci? - Pai, acum ca sunt primu...

  Read the article

• URL Rewriting under IIS at readyhosting

  - by Rahul

  Hello all, I have a website designed in ASP.2.0 (classical Asp) i wanted re-write my all urls using Microsoft url rewriting tool. my web website is hosted on shared server with ready hosting company. Now the Readyhosting people said that they are not giving any support to these modules. Can any please help me in this. Thanks, Rau

  Read the article

• Poante cu avocati

  - by interesante

  Avocatul isi intreaba unul din viitorii clienti: - Si aveti banii necesari pentru a va permite sa fiti aparat de mine? - Da, am doua casete cu bijuterii. - Bine, atunci sa vedem...De ce sunteti acuzat? - De furtul celor doua caste cu bijuterii...Relaxeaza-te citind un blog amuzant si haios cu cele mai noi glume si bancuri de tot felul.Intr-un avion, un avocat nimereste langa o blonda super. Bla, bla, tot incerca sa intre in vorba cu ea ... nimic. Blonda se uita pe geam, mai incerca sa doarma ... Avocatul, enervat: - Uite, hai sa jucam un joc ! Eu iti pun tie o intrebare, si daca nu stii imi dai 5$, apoi imi pui tu mie o intrebare, si daca nu stiu iti dau 5 $! Si tot asa ... - Nu, domnule, imi pare rau, sunt obosita. As prefera sa ma odihnesc ... Avocatul, enervandu-se si mai tare: - Bine, uite, jucam alt joc! Eu iti pun tie o intrebare, daca nu stii imi dai 5$; tu imi pui mie o intrebare, si daca nu stiu ... iti dau 500$ ! Blonda accepta, intr-un tarziu. - Care este distanta de la Pamant la Luna ? Blonda deschide geanta si ii da 5$, dupa care il intreaba: - Ce e mic, are 3 picioare si urca dealul ? Avocatul, se gandeste ... scoate laptop-ul, cauta in baza de date ... cauta pe Internet ... trimite mail-uri la toti prietenii ... In sfarsit, dupa o ora, transpirat, ii da blondei 500$. Blonda ii ia, apoi se intoarce si incepe sa se uite plictisita pe geam. Avocatul, isterizat, vrea sa afle raspunsul: - Bine, bine, ce e mic, are trei picioare si urca dealul ? La care, blonda deschide tacticoasa geanta si ii da o hartie de 5$.

  Read the article

1