Search Results

Search found 11587 results on 464 pages for 'pseudo random numbers'.

Page 189/464 | < Previous Page | 185 186 187 188 189 190 191 192 193 194 195 196  | Next Page >

• Calling Knowledge Workers: Make a Difference in the User Experience

  - by Charles Knapp

  Do you consider yourself a knowledge worker? Do you have ideas of how to make CRM software work smarter so you don't have to work harder? The Oracle Middleware User Experience team will be conducting customer feedback focus groups at Oracle OpenWorld, October 1-3. All it takes is a couple of hours or less for us to learn from you. Customer participation helps Oracle develop outstanding products and solutions. Knowledge workers of all types are invited to participate: Finance, Sales, Human Resources, Marketing, Recruiters, Budget Managers, Project & Product Managers and more. To participate in these sessions you do not have to be registered for Oracle OpenWorld. If you or someone you know is interested in participating, please email muxtesting_us at oracle.com with your name, company, job title, work and mobile phone numbers with country code, and email address.

  Read the article

• What is an achievable way of setting content budgets (e.g. polygon count) for level content in a 3D title?

  - by MrCranky

  In answering this question for swquinn, the answer raised a more pertinent question that I'd like to hear answers to. I'll post our own strategy (promise I won't accept it as the answer), but I'd like to hear others. Specifically: how do you go about setting a sensible budget for your content team. Usually one of the very first questions asked in a development is: what's our polygon budget? Of course, these days it's rare that vertex/poly count alone is the limiting factor, instead shader complexity, fill-rate, lighting complexity, all come into play. What the content team want are some hard numbers / limits to work to such that they have a reasonable expectation that their content, once it actually gets into the engine, will not be too heavy. Given that 'it depends' isn't a particularly useful answer, I'd like to hear a strategy that allows me to give them workable limits without being a) misleading, or b) wrong.

  Read the article

• Framework for interaction between web-page and server-side script

  - by Carrier

  I want to make a web-page that will have several controls elements, among which there are elements like check-boxes, radio-buttons, "range selectors" (one can specify the min and max value, like it is done when you select range for prices in the online markets). The new values shall be sent to the "server-side", once changed (without any Submit buttons etc), and the "server-side" can return something (one or more numbers, etc). Does anyone know a good ajax-like framework that allows (with minimal adaptation / changes) to make such solution in an easy way? It will be good if the server-side of existing solution will be in Perl (not a big deal, but I know it much better than PHP or something else). Set of controls might change and depend on other parameter, so adding one extra element should not cause rewriting the whole thing. P.S.: I haven't working in this area for quite a while, so not aware of existing solutions in this area, and don't want to invent the wheel and write everything from scratch for something that already exist (at least, I hope so). Thanks in advance!

  Read the article

• A* PathFinding Not Consistent

  - by RedShft

  I just started trying to implement a basic A* algorithm in my 2D tile based game. All of the nodes are tiles on the map, represented by a struct. I believe I understand A* on paper, as I've gone through some pseudo code, but I'm running into problems with the actual implementation. I've double and tripled checked my node graph, and it is correct, so I believe the issue to be with my algorithm. This issue is, that with the enemy still, and the player moving around, the path finding function will write "No Path" an astounding amount of times and only every so often write "Path Found". Which seems like its inconsistent. This is the node struct for reference: struct Node { bool walkable; //Whether this node is blocked or open vect2 position; //The tile's position on the map in pixels int xIndex, yIndex; //The index values of the tile in the array Node*[4] connections; //An array of pointers to nodes this current node connects to Node* parent; int gScore; int hScore; int fScore; } Here is the rest: http://pastebin.com/cCHfqKTY This is my first attempt at A* so any help would be greatly appreciated.

  Read the article

• Game Asset Size Over Time

  - by jterrace

  The size (in bytes) of games have been growing over time. There are probably many factors contributing to this: trailer/cut scene videos being bundled with the game, more and higher-quality audio, multiple levels of detail being used, etc. What I'd really like to know is how the size of 3D models and textures that games ship with have changed over time. For example, if one were to look at the size of meshes and textures for Quake I (1996), Quake II (1997), Quake III: Arena (1999), Quake 4 (2005), and Enemy Territory: Quake Wars (2007), I'd imagine a steady increase in file size. Does anyone know of a data source for numbers like this?

  Read the article

• How to find 2D grid cells swept by a moving circle?

  - by Nevermind

  I'm making a game based on a 2D grid, with some cells passable and some not. Dynamic objects can move continuously, independent of the grid, but need to collide with impassable cells. I wrote an algorithm to trace a ray against the grid, that gives me all cells that ray intersects. However, actual object are not point-sized; I'm currently representing them as circles. But I can't figure out an effective algorithm to trace a moving circle. Here's a picture of what I need: The numbers show in what order the circle collides with grid cells. Does anybody know the algorithm to find these collisions? Preferably in C#. Update The circle can be bigger than a single grid cell.

  Read the article

• When removing a bunch of files from a website, is 301 to the start page appropriate? [closed]

  - by Uwe Keim

  Possible Duplicate: What to do with random pages after a 301 redirect? Currently, we are working on modifying the contents of a website of one of our products. Since we are re-positioning the product, we would like to delete roughly 50% (around 200) of the pages of the website. My questions, in terms of SEO are: Would it have a negative effect if Google suddenly sees the large page drop? Is it OK to provide a 301 to the start page of the website for all removed pages?

  Read the article

• Why do the Nouveau drivers work better than the Nvidia ones?

  - by user50774

  I have a bit of a weirdie here. My rig uses an Nvidia GeForce 8600 GTS in a PCIE x16 slot. Up to about a year ago, no problems with the card. I then started getting random crashes. They got more frequent. Now, first thought: It's an old card. But I don't have the bucks to buy a new one, and my mobo doesn't have the DVI input that my monitor needs. So, I decided to take a shot with the Nouveau drives. Amazingly, they have worked flawlessly. Does anyone have a guess as to why?

  Read the article

• Google search preview shows content not on the website

  - by SDG

  My website google search entry is messed up. In the preview in google search results, I get things like cracks, serials, random ip addresses. I scanned all files and my computer for viruses and malware and could not find anything. I also tried to download and reupload all content from a friend's computer and still that content persists. I also scanned the source code of all files, but the content does not appear in any file. Google also does not detect any malware on the website, as seen in their webmaster tools. I have searched using the same keywords in other search engines such as bing and yahoo and the search results there are fine. I am quite clueless as to what the causes would be for this and what would be a possible remedy.

  Read the article

• Improving python code

  - by cobie

  I just answered the question on project euler about finding circular primes below 1 million using python. My solution is below. I was able to reduce the running time of the solution from 9 seconds to about 3 seconds. I would like to see what else can be done to the code to reduce its running time further. This is strictly for educational purposes and for fun. import math import time def getPrimes(n): """returns set of all primes below n""" non_primes = [j for j in range(4, n, 2)] # 2 covers all even numbers for i in range(3, n, 2): non_primes.extend([j for j in range(i*2, n, i)]) return set([i for i in range(2, n)]) - set(non_primes) def getCircularPrimes(n): primes = getPrimes(n) is_circ = [] for prime in primes: prime_str = str(prime) iter_count = len(prime_str) - 1 rotated_num = [] while iter_count > 0: prime_str = prime_str[1:] + prime_str[:1] rotated_num.append(int(prime_str)) iter_count -= 1 if primes >= set(rotated_num): is_circ.append(prime) return len(is_circ)

  Read the article

• How secure is KeePassX?

  - by Uli

  I have hundreds of passwords, since I use a different random one for each website/service. They are all generated & stored with KeePassX, which can be synced to different computers and my android phone via dropbox (or ubuntuone). I know the database of KeePassX is secure (at least with a good passphrase). But what about when I am copying the password into the clipboard (where it is stored for 5 seconds)? Can any program running in user-space access the clipboard and store the password? If so, how big of a security risk is this?

  Read the article

• What sort of things can cause a whole system to appear to hang for 100s-1000s of milliseconds?

  - by Ogapo

  I am working on a Windows game and while rendering, some computers will experience intermittent pauses ("hitches" for lack of a better term). When profiled they appear in seemingly random places in the code. Eventually I noticed that it wasn't just my process that was affected, but (seemingly) every process on the system. All of the threads in my application hitch at once. The CPU utilization drops during these hitches and it appears as if most processes make no progress. This leads me to believe this may be an Operating System or Driver issue, but it only occurs while playing the game (and only on some systems). What sort of operations might the operating system be doing that would require the kernel to pause all user threads and block. Some kind of I/O? At first I thought of paging but my impression is that would only affect a single process, no? Some systems in use: Windows, DirectX (3d), nVidia cards (unknown if replicates on ATI), using overlapped io for streaming

  Read the article

• Already 3,333 tweets...

  Almost everything is about numbers, and this short blog entry includes the number of tweets written so far. ;) Quite frankly, I joined the Twitter bandwagon late... February 2010 or so. And within those 4.5 years I just came across an interesting milestone: 3,333 tweets 3,333 tweets since February 2010 Compared to some of my fellows here from Mauritius that's almost nothing... Anyways, Cheers and for the next 3,333 tweets. This time faster, hopefully.

  Read the article

• Help to understand directions of sprites in XNA

  - by 3Dkreativ

  If I want to move a sprite to the right and upwards in a 45 degree angle I use Vector2 direction = new Vector2(1,-1); And if the sprite should move straight to right Vector2 direction = new Vector2(1,0); But how would I do if I want another directions, lets say somewhere between this values? I have tested with some other values, but then the sprite either moves to fast and or in another direction than I expected!? I suspect it's about normalize!? Another thing I have problem with to understand. I'm doing a simple asteroids game as a task in a class in C# and XNA. When the asteroids hit the window borders, I want them to bounce back in a random direction, but I can't do this before I understand how directions and Vector2 works. Help is preciated! Thanks!

  Read the article

• Help me to find a good name for my website

  - by framomo86

  Hi guys, I have a web marketing question for you. I'm looking for a good domain name for my web app. This site is about writing. Any kind of user generated writings including poetry, aphorisms, short stories, song lyrics etc. I have some candidates, but I think it can be better. . I want the name to promote very good quality words, not just random facebook-like status updates. This is my list, but I think you can do better, any help would be very very appreciated. I promise to add your name in my credit if i pick your answer. Thanks Yourwritings Youwrite Beautifulwords thewriter writingshare

  Read the article

• Understanding how to go from a scene to what's actually rendered to screen in OpenGL?

  - by Pris

  I want something that explains step by step how, after setting up a simple scene I can go from that 'world' space, to what's finally rendered on my screen (ie, actually implement something). I need the resource to clearly show how to derive and set up both orthographic and perspective projection matrices... basically I want to thoroughly understand what's going on behind the scenes and not plug in random things without knowing what they do. I've found lots of half explanations, presentation slides, walls of text, etc that aren't really doing much for me. I have a basic understanding of linear algebra/matrix transforms, and a rough idea of what's going on when you go from model space - screen, but not enough to actually implement it in code.

  Read the article

• I need some help creating a non-binary tree (or some other data structure that will better solve my problem)

  - by EDO

  I have about ten lists of numbers and some strings. Each list has about <= 30K lines. Each line on a list has a distinct number. I need to build an efficient way of finding all the lines in each list that has the same 'control' number (or key for dB guys) and comparing what is in their string parts. I am writing this in Java. I have thought about using trees but my brain cells are about burnt now. I need some help.

  Read the article

• Google Analytics Funnel problems

  - by Alex

  I have a problem with the funnels in Google Analytics. So I have a e-commerce website that I want to track the user path to a purchase. I want GA to track if a user goes trough these steps [Item page]-[Purchase]-[Checkout]. I thought this could be done by funnels and my setup currently now consist of: Step 1: [Item page] (Required) Step 2: [Purchase] Goal: [Checkout] But when I go to the "Funnel Visualization Report" the following shows. [Item page] Visits: 150 [Purchase page] Visits: 170 [Checkout] Visits: 32 How can the [Purchase page] be higher than the [Item page]? I searched the internet over, and found something called Horizontal Funnels but this doesn't show the correct numbers, again the purchase and checkout steps are higher than the item page. So somehow it doesn't need step 1, to fulfill the funnels/goals. What am I doing wrong?

  Read the article

• To track or not to track user created images for display in a dynamic website?

  - by Question Overflow

  I have a website that allows user to upload and display images. Currently, I am not using a database to track these user images. A folder having the user id as the folder name is created for each user and under each folder, the image files are labelled numerically with filenames ranging from 01.jpg to 20.jpg. Up to 20 such images can be displayed on each user page. I am using javascript to hide these images in case of any of them is absent. I have seen many websites having user images with unique random filenames and possibly tracking these files with a database Since obscurity is not something that I need for these web accessible images, is there any reason why I should track them with a DB? I am not sure if a reduction of 404 errors is a good enough reason to justify the added complexity of maintaining a database or can anyone enlighten me?

  Read the article

• Even distribution through a chain of resources

  - by ClosetGeek

  I'm working on an algorithm which routes tasks through a chain of distributed resources based on a hash (or random number). For example, say you have 10 gateways into a service which distribute tasks to 1000 handlers through 100 queues. 10,000 connected clients are expected to be connected to gateways at any given time (numbers are very general to keep it simple). Thats 10,000 clients 10 gateways (producers) 100 queues 1000 workers/handlers (consumers) The flow of each task is client-gateway-queue-worker Each client will have it's own hash/number which is used to route each task from the client to the same worker each time, with each task going through the same gateway and queue each time. Yet the algorithm handles distribution evenly, meaning each gateway, queue, and worker will have an even workload. My question is what exactly would this be called? Does such a thing already exist? This started off as a DHT, but I realized that DHTs can't do exactly what I need, so I started from scratch.

  Read the article

• Should you apply a language filter to a randomly generated string?

  - by Tim

  A while back I created a licensing system for my companies new product, as well as all products after this one. As with a lot of licensing systems mine generates codes: 25 character product and registration codes, as well as 16 character module unlocking codes. My question is, since some parts of these generated codes are random should I apply a language filter to it to avoid any embarrassing language being given to the end users? I chose to as it was not difficult at all. But has anyone else ever came across something like this? Any viewpoints as to if it is worth the effort?

  Read the article

• Vectors with Circles Physics -java

  - by Joe Hearty

  This is a problem I've been having, When making a set number of filled circles at random locations on a JPanel and applying a gravity (a negative change in the y), each of the circles collide. I want them to have collision detection and push in the opposite direction using vectors but i don't know how to apply that to my scenario could someone help? public void drawballs(Graphics g){ g.setColor (Color.white); //displays circles for(int i = 0; i<xlocationofcircles.length-1; i++){ g.fillOval( (int) xlocationofcircles[i], (int) (ylocationofcircles[i]) ,16 ,16 ); ylocationofcircles[i]+=.2; //gravity if(ylocationofcircles[i] > 550) //stops gravity at bottom of screen ylocationofcircles[i]-=.2; //Check distance between circles(i think..) float distance =(xlocationofcircles[i+1]-xlocationofcircles[i]) + (ylocationofcircles[i+1]-xlocationofcircles[i]) ; if( Math.sqrt(distance) <16)

  Read the article

• Scuttlebutt Reconciliation in the paper “Efficient Reconciliation and Flow Control for Anti-Entropy Protocols”

  - by soulmachine

  I am reading the paper "Efficient Reconciliation and Flow Control for Anti-Entropy Protocols"! , I couldn't clearly understand Section 3.2 "Scuttlebutt Reconciliation". Here I extract out some sentences from the paper, which especially confuse me. If gossip messages were unlimited in size, then the sets contains the exact differences,just like with precise reconciliation. Scuttlebutt requires that if a certain delta (r; k; v; n) is omitted, then all the deltas with higher version numbers for the same r should be omitted as well. Scuttlebutt satises the global invariant C(p;q) for any two processes p and q:

  Read the article

• 407 Proxy Authentication Required

  - by user38507

  When I try to install a software using Ubuntu Software center I get: Failed to download repository information Check Your Internet connection When I try to do a apt get-install something, I get: 407 Proxy Authentication Required I use a proxy server that requires a user-name and a password. I have set my systems proxy manually, by plugging in the required numbers in the Networks proxy and applied it system wide. I guess the problem now is plugging in my user-name and password. When I use INTERNET via Mozilla, it specifically asks me for my user-name and password.

  Read the article

• Is there an application which organizes my "Downloads" folder automatically?

  - by rearlight

  I'm looking for an application which puts all files from my Downloads folder into a new generated folder (called like the date) per button press or automatically is able to move files to its destinated directory automatically (p.e. *.png files should be put into /home/user/pictures/random/, *.avi to /videos/, ...) If you are familiar with the DayFolder application: I'm looking for an application like that but for any folder (not only the Desktop). In my case that's Downloads because this folder gets cluttered on my PC very fast. Thanks for your advice/help!

  Read the article

< Previous Page | 185 186 187 188 189 190 191 192 193 194 195 196  | Next Page >