Search Results

Search found 10679 results on 428 pages for 'random numbers'.

Page 173/428 | < Previous Page | 169 170 171 172 173 174 175 176 177 178 179 180  | Next Page >

• Creating a interactive grid for puzzle game

  - by Noupoi

  I am trying to make a slitherlink game, and am not too sure how to approach creating the game, more specifically the grid structure on which the puzzle will be played on. This is what a empty and completed slitherlink grid would look like. The numbers in the squares are sort of clues and the areas between the dots need to be clickable. http://i.stack.imgur.com/U1kXn.gif http://i.stack.imgur.com/RMwiv.gif I would like to create the game in VB .NET. What data structures should I try to use, and would it be beneficial using any frameworks such as XNA?

  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

• Structuring an input file

  - by Ricardo

  I am in the process of structuring a small program to perform some hydraulic analysis of pipe flow. As I am envisioning this, the program will read an input file, store the input parameters in a suitable way, operate on them and finally output results. I am struggling with how to structure the input file in a sane way; that is, in a way that a human can write it easily and a machine can parse it easily. A sample input file made available to me for a similar program is just a stream of comma-separated numbers that don't make much sense on their own, so that's the scenario I am trying to avoid. Though I am giving the details of my particular problem, I am more interested in general input-file structuring strategies. Is a stream of comma-separated values my best bet? Would I be better off using some sort of key:value structure? I don't know much about this, so any help will probably put me in a better track than I am now.

  Read the article

• What is required to create local business rich-snippets complete with sitelinks AND breadcrumbs?

  - by Felix

  I have a local business directory site. I would like to markup my business listing 'profile' level pages for display as enhanced listings/rich-snippets complete with business names, addresses and phone numbers. I would also like to display site-links and path-based breadcrumbs to help users navigate site directory hierarchy (which is deep). Is there a limit to the amount of breadcrumbs a site can leave? Is there a separate limit on the number of breadcrumbs which Google/Bing will display in the SERP? What kind of markup language(s) would be needed to best position my site to show site-links AND breadcrumbs? For example: Find a business Browse by Location State City Zip or Find a business Choose Service Browse by location State City Thanks all!

  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

• 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

• Best way to manage a changelog

  - by Gnial0id

  I'm currently developing a WinForm application. In order to inform the client about the improvements and corrections made during the last version, I would like to manage and display a changelog. I mostly found existing changelog on website (the term changelog is pretty used) or explanation on how to manage the release numbers, which I don't care. So, these are my questions: Is there a good practice in changelog management (using XML, pure text in the app, etc.) in a desktop application ? What is the best way to display it (external website, inside the winform application) ? Thanks.

  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

• 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

• 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

• Ubuntu 12.10 64b does not shutdown

  - by user108264

  I am a new linux user so i am not familiar with what actually is needed to check. When shutting down or trying to restart i get a screen with yellow letters and the system does not close or restart. I have to shut down manually. I can't type all the numbers but i will give the last ones. [90102.232650] [ end-trace 435966f5b367871 ] this seems to have happened after i downgraded the xorg so i can get drivers for my ATI card(4850HD). The suspend command works fine.

  Read the article

• Help! Installer crashing

  - by Mike

  I had ubuntu 12.04 installed on a Satellite l635. I wanted to start over with a fresh install because I had experimented with a bunch of different things, and computer was getting glitchy and random freezes. I used the same iso I used for original install, and it keeps say the installer crashed with a erron5 input/output error. Tried an older iso for 11.10 I had used in the past with same issue... To see if it was disc or computer (not a great idea) I tried the 12.04 iso on another laptop. Now I have 2 laptops with no os. Both discs however live boot on both systems. PLEASE HELP! I've searched forums and can't find the same problem.

  Read the article

• How can I generate Sudoku puzzles?

  - by user223150

  I'm trying to make a Sudoku puzzle generator. It's a lot harder than I expected and the more I get into it, the harder it gets! My current approach is to split the problem into 2 steps: Generate a complete (solved) Sudoku puzzle. Remove numbers until it's solveable and has only 1 solution. In step 1, since I'm using a brute force methods, I'm facing some run time issues. Is there an optimal way of filling in a complete Sudoku puzzle? In step 2, what kind of algorithm should I use to "puzzlize" a solved sudoku?

  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

• 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

• 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

• 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

• unable to boot from live USB!

  - by ramblinman

  Linux noob here. I was messing around with my new dual-boot (win7 and the latest ubuntu, 12.04 I think?) Long story short, I deleted some partitions that I shouldn't have. When I boot up the machine, I get: error: no such partition. grub rescue _ I know that I could probably fix this by booting from the live USB. But I can't boot from the live USB either! On startup, I can get "boot from drive" options by pressing F12. (This is how I installed Ubuntu in the first place.) But when I select the USB drive, I get this error: error: no such device: [long string of letters and numbers]. grub rescue _ I've searched around for a fix but most threads addressing the first problem suggest booting from live drive. And I can't do that! Any help much appreciated.

  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

• 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

• 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

• 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

• 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

< Previous Page | 169 170 171 172 173 174 175 176 177 178 179 180  | Next Page >