Search Results

Search found 4934 results on 198 pages for 'finding'.

Page 38/198 | < Previous Page | 34 35 36 37 38 39 40 41 42 43 44 45  | Next Page >

  • From the Tips Box: Life after Babel Fish, Hidden Features in iOS apps, and Finding Clean Beaches with a Smartphone

    - by Jason Fitzpatrick
    Once a week we round up some of the great reader tips that come pouring in and share them with everyone. This week we’re looking at Bing’s absorbtion of Babelfish, hidden features in iOS apps, and how to find a clean beach with your smartphone. HTG Explains: What Is RSS and How Can I Benefit From Using It? HTG Explains: Why You Only Have to Wipe a Disk Once to Erase It HTG Explains: Learn How Websites Are Tracking You Online

    Read the article

  • How to prevent Google from finding my admin index page?

    - by krish
    I am running a website but for some days i stopped it and put the under-construction page because the Index of admin page is visible to the outside world through the Google search. One of my friend told me that your websites index is visible and its one step away to access the password file and he shows me that very simply using the Google search. How can i prevent this and i am hosting my site with a hosting company and i report about this to them but they simply replied to me still its secure so you no need to worry... am i really don need to worry and continue my site with the visible index of admin page?

    Read the article

  • Marching squares: Finding multiple contours within one source field?

    - by TravisG
    Principally, this is a follow-up-question to a problem from a few weeks ago, even though this is about the algorithm in general without application to my actual problem. The algorithm basically searches through all lines in the picture, starting from the top left of it, until it finds a pixel that is a border. In pseudo-C++: int start = 0; for(int i=0; i<amount_of_pixels; ++i) { if(pixels[i] == border) { start = i; break; } } When it finds one, it starts the marching squares algorithm and finds the contour to whatever object the pixel belongs to. Let's say I have something like this: Where everything except the color white is a border. And have found the contour points of the first blob: For the general algorithm it's over. It found a contour and has done its job. How can I move on to the other two blobs to find their contours as well?

    Read the article

  • Finding the balance between working on the things that you have to work on and the things that you want to work on [closed]

    - by Emanuil
    Sometimes I go for what I find interesting instead of what is considered right. Having this attitude has been educational and it has let me produce work that I'm exceptionally proud of but it has also made me miss deadlines and disappoint people. Sometimes I think I'm this way because I don't want to "break" my curiosity. I'm afraid that if I ignore it I may gradually lose it. Do you have any advice for me? Meta: How can I make this a community wiki?

    Read the article

  • Can GJK be used with the same "direction finding method" every time?

    - by the_Seppi
    In my deliberations on GJK (after watching http://mollyrocket.com/849) I came up with the idea that it ins not neccessary to use different methods for getting the new direction in the doSimplex function. E.g. if the point A is closest to the origin, the video author uses the negative position vector AO as the direction in which the next point is searched. If an edge (with A as an endpoint) is closest, he creates a normal vector to this edge, lying in the plane the edge and AO form. If a face is the feature closest to the origin, he uses even another method (which I can't recite from memory right now) However, while thinking about the implementation of GJK in my current came, I noticed that the negative direction vector of the newest simplex point would always make a good direction vector. Of course, the next vertex found by the support function could form a simplex that less likely encases the origin, but I assume it would still work. Since I'm currently experiencing problems with my (yet unfinished) implementation, I wanted to ask whether this method of forming the direction vector is usable or not.

    Read the article

  • Finding back to an old project that was turned upside-down by the developer. Your workflow?

    - by Kreativrandale
    after some time I'm asked to work on a heavy web-project I did (layout, html/css) about a year ago. There are some changes that have to be made, basically some css and js stuff. By now the whole project was turned upside down by the developer. It gives me a hard time to connect to the work of him, especially because my old files and file-structure won't work anymore. Thats why I need a up-to-date working-environment, but I don't want to change the files on the server directly. Need some testing and improving while doing this. So, what is your workflow in such a case? Thought about copying the whole/parts of the server to a own homeserver. But even that will be a big task for me (I'm more the front-end-guy). Would be great if theres a way to shrink it down (php, mysql,...), since I only need to change some css/html javascript. Are there any tools available? Love to hear how you handle such situations. Thanks a lot!

    Read the article

  • Finding the median of the merged array of two sorted arrays in O(logN)?

    - by user176517
    Refering to the solution present at MIT handout I have tried to figure out the solution myself but have got stuck and I believe I need help to understand the following points. In the function header used in the solution MEDIAN -SEARCH (A[1 . . l], B[1 . . m], max(1,n/2 - m), min(l, n/2)) I do not understand the last two arguments why not simply 1, l why the max and min respectively. Thanking You.

    Read the article

  • Building an E-Commerce Website? 7 Tips For Finding Your Ideal Technology Teacher

    Like many adults, until recently, I'd never contemplated building a website and learning online technology to create an e-business. Still, the growth of the world-wide-web and my location in an area where good-paying jobs are hard to find forced me to re-evaluate whether I could master enough website technology to build a blog and do business online. The one thing I did know was that a good teacher or consultant could make the difference between success and failure.

    Read the article

  • A Single wireless network is not showing up in Ubuntu that used too, and other devices have no issue finding or connecting to it

    - by Kit Sunde
    Up until about a week ago I could connect to my wireless, but now I suddenly can't. Every other wireless in the area show up in the network manager. My kindle can connect to it, my friend can connect to it (in windows) without having connected to it before. My other netbook (Samsung NC10) can connect to it, but my other Samsung N150 now cannot even see it. I have tried deleting the old auto entry for it in the network manager Tried disabling and enabling both the networking and the wireless through the network indicator. Disabled the networking through the hardware shortkut key thing [fn] + [F9] Attempting to connect to it as if it was a hidden network. I'm at a loss, how would I go about debugging and unborking my computer?

    Read the article

  • Finding which tiles are intersected by a line, without looping through all of them or skipping any

    - by JustSuds
    I've been staring at this problem for a few days now. I rigged up this graphic to help me visualise the issue: http://i.stack.imgur.com/HxyP9.png (from the graph, we know that the line intersects [1, 1], [1, 2], [2, 2], [2, 3], ending in [3,3]) I want to step along the line to each grid space and check to see if the material of the grid space is solid. I feel like I already know the math involved, but I haven't been able to string it together yet. I'm using this to test line of sight and eliminate nodes after a path is found via my pathfinding algorithms - my agents cant see through a solid block, therefore they cant move through one, therefore the node is not eliminated from the path because it is required to navigate a corner. So, I need an algorithm that will step along the line to each grid space that it intersects. Any ideas? I've taken a look at a lot of common algorithms, like Bresenham's, and one that steps at predefined intervals along the line (unfortunately, this method skips tiles if they're intersecting with a smaller wedge than the step size). I'm populating my whiteboard now with a mass of floor() and ceil() functions - but its getting overly complicated and I'm afraid it might cause a slowdown.

    Read the article

  • Is there any algorithm for finding LINES by PIXEL COLORS on picture?

    - by Ole Jak
    So I have Image like this I want to get something like this (I hevent drawn all lines I want but I hope you can get my idea) I need algorithm for finding all straight lines on it by just reading colors of pixels. No hard math, no Haar, no Hough. Some algorithm which would be based on points colors. I want to give to algorithm parameters like min line length and max line distortion. I want to get relative to picture pixel coords start and end points of lines. So I need algorithm for finding straight lines of different colors on picture. Algorithm which would be based on idea of image of different colors and Lines of static colors. Yes - such algorithm will not work for images with lots of shadows and lights. But It willl probably be fast (I hope so). Is there any such algorithm?

    Read the article

  • Is there any super fast algorithm for finding LINES on picture?

    - by Ole Jak
    So I have Image like this I need some super fast algorithm for finding all straight lines on it. I want to give to algorithm parameters like min length and max line distortion. I want to get relative to picture pixel coords start and end points of lines. So on this picture to find all lines between dalles and thouse 2 black lines on top. So I need algorithm for super fast finding straight lines of different colors on picture. Is there any such algorithm? (super duper fast=)

    Read the article

  • Finding the model of an old computer i used to own?

    - by mcbeav
    This might sounds ridiculous, but I need some help finding the model of an old computer i used to own. I know what the computer looks like. It was made by Packard Bell, but i can't find hardly any information on older packard bell computers anywhere online. I got the computer around 1999, give or take a couple of years. It came with Windows 98 preinstalled. It was a tower desktop. I was wondering if anyone knows of a website or reference tool where i can find some information on older model desktop computers.

    Read the article

  • Why can't I send SOAP requests to Ebay finding API with this php?

    - by Jay
    This is my code: <?php error_reporting(E_ALL); //new instance of soapClient pointing to Ebay finding api $client = new SoapClient("http://developer.ebay.com/webservices/finding/latest/FindingService.wsdl"); //attach required parameters to soap message header $header_arr = array(); $header_arr[] = new SoapHeader("X-EBAY-SOA-MESSAGE-PROTOCOL", "SOAP11"); $header_arr[] = new SoapHeader("X-EBAY-SOA-SERVICE-NAME", "FindingService"); $header_arr[] = new SoapHeader("X-EBAY-SOA-OPERATION-NAME", "findItemsByKeywords"); $header_arr[] = new SoapHeader("X-EBAY-SOA-SERVICE-VERSION", "1.0.0"); $header_arr[] = new SoapHeader("X-EBAY-SOA-GLOBAL-ID", "EBAY-GB"); $header_arr[] = new SoapHeader("X-EBAY-SOA-SECURITY-APPNAME", "REMOVED"); $header_arr[] = new SoapHeader("X-EBAY-SOA-REQUEST-DATA-FORMAT", "XML"); $header_arr[] = new SoapHeader("X-EBAY-SOA-MESSAGE-PROTOCOL", "XML"); $test = $client->__setSoapHeaders($header_arr); $client->__setLocation("http://svcs.ebay.com/services/search/FindingService/v1");//endpoint $FindItemsByKeywordsRequest = array( "keywords" => "potter" ); $result = $client->__soapCall("findItemsByKeywords", $FindItemsByKeywordsRequest); //print_r($client->__getFunctions()); //print_r($client->__getTypes()); //print_r($result); ? And this is the error I receive: Fatal error: Uncaught SoapFault exception: [axis2ns2:Server] Missing SOA operation name header in C:\xampplite\htdocs\OOP\newfile.php:25 Stack trace: #0 C:\xampplite\htdocs\OOP\newfile.php(25): SoapClient-__soapCall('findItemsByKeyw...', Array) #1 {main} thrown in C:\xampplite\htdocs\OOP\newfile.php on line 25 It doesnt make sense, I have already set the operation name in the header of the request... Does anyone know what is wrong here?

    Read the article

  • Hmm, why finding by '2' or '2' return the same record?

    - by SXLee
    Hi everyone, forget my newbie question, but why finding by '2' or '2' in Mysql returns the same record? For example: Say I have a record with string field named 'slug', and the value is '2'. And the following SQLs returns same record. SELECT * From articles WHERE slug='2' SELECT * From articles WHERE slug='2'

    Read the article

  • Google groups not finding discussion thread but regular google search does?

    - by Mathias Lin
    I'm having a problem with google groups and finding my own discussion threads. I go to the google group (in my case Android developer group) web view and try to search for my thread by entering the extact title of my thread. But it doesn't appear in the search results. On the other hand, when I search for the same title in the regular google web search, I get the thread right on top of the result list. I thought it might take a while until the groups index all new threads, but still after a few days, it still wouldn't show up. Sample: My thread is here: http://groups.google.com/group/android-developers/browse_thread/thread/0ab41d5056a25ce7 Doing a search for it in Google groups (will give one result, but not mine): http://groups.google.com/group/android-developers/search?group=android-developers&q=Strange+behaviour+with+mediaplayer+and+seekTo&qt_g=Search+this+group Search in Google web search (shows my thread as first result): http://www.google.de/search?sourceid=chrome&ie=UTF-8&q=Strange+behaviour+with+mediaplayer+and+seekTo

    Read the article

  • Why increase pointer by two while finding loop in linked list, why not 3,4,5?

    - by GG
    I had a look at question already which talk about algorithm to find loop in a linked list. I have read Floyd's cycle-finding algorithm solution, mentioned at lot of places that we have to take two pointers. One pointer( slower/tortoise ) is increased by one and other pointer( faster/hare ) is increased by 2. When they are equal we find the loop and if faster pointer reaches null there is no loop in the linked list. Now my question is why we increase faster pointer by 2. Why not something else? Increasing by 2 is necessary or we can increase it by X to get the result. Is it necessary that we will find a loop if we increment faster pointer by 2 or there can be the case where we need to increment by 3 or 5 or x.

    Read the article

  • virt-install says name is in use, but virsh list --all is empty. Where is virt-install finding this name?

    - by Jay _silly_evarlast_ Wren
    virt-install says name is in use, but virsh list --all says there is nothing. jrwren@delays:{%22}~ $ virt-install -d -n android -r 512 --disk android.qcow2 -s 4 -c /d/cd\ images/android-x86-2.2-generic.iso --vnc --noautoconsole [Thu, 05 Jul 2012 16:57:19 virt-install 23170] DEBUG (cli:220) Launched with command line: /usr/bin/virt-install -d -n android -r 512 --disk android.qcow2 -s 4 -c /d/cd images/android-x86-2.2-generic.iso --vnc --noautoconsole [Thu, 05 Jul 2012 16:57:19 virt-install 23170] DEBUG (cli:326) Requesting libvirt URI default [Thu, 05 Jul 2012 16:57:19 virt-install 23170] DEBUG (cli:328) Received libvirt URI qemu:///session [Thu, 05 Jul 2012 16:57:20 virt-install 23170] DEBUG (virt-install:259) Requesting virt method 'default', hv type 'default'. [Thu, 05 Jul 2012 16:57:20 virt-install 23170] DEBUG (virt-install:469) Received virt method 'hvm' [Thu, 05 Jul 2012 16:57:20 virt-install 23170] DEBUG (virt-install:470) Hypervisor name is 'kvm' [Thu, 05 Jul 2012 16:57:20 virt-install 23170] DEBUG (cli:950) --graphics compat generated: vnc [Thu, 05 Jul 2012 16:57:20 virt-install 23170] ERROR (cli:597) Guest name 'android' is already in use. (venv)jrwren@delays:{%22}~ $ sudo virsh -c qemu:///system list --all Id Name State ---------------------------------- Where is virt-install finding this name? edit: I should mention that LIBVIRT_DEFAULT_URI is not set.

    Read the article

  • Django and Google App Engine Helper not finding the ipaddr module.

    - by Phil
    I'm trying to get Django running on GAE using this tutorial. When I run python manage.py runserver I get the stacktrace below. I'm new to both django and python so I don't know what my next steps are (This is Ubuntu Jaunty btw). It seems django isn't finding the GAE module ipaddr which comes with SDK 1.3.1. How do I get django to find this module? /home/username/bin/google_appengine/google/appengine/api/datastore_file_stub.py:40: DeprecationWarning: the md5 module is deprecated; use hashlib instead import md5 /home/username/bin/google_appengine/google/appengine/api/memcache/__init__.py:31: DeprecationWarning: the sha module is deprecated; use the hashlib module instead import sha Traceback (most recent call last): File "manage.py", line 18, in <module> InstallAppengineHelperForDjango() File "/home/username/Development/GAE/myapp/appengine_django/__init__.py", line 543, in InstallAppengineHelperForDjango InstallDjangoModuleReplacements() File "/home/username/Development/GAE/myapp/appengine_django/__init__.py", line 260, in InstallDjangoModuleReplacements import django.db File "/home/username/Development/GAE/myapp/django/db/__init__.py", line 57, in <module> 'TIME_ZONE': settings.TIME_ZONE, File "/home/username/Development/GAE/myapp/appengine_django/db/base.py", line 117, in __init__ self._setup_stubs() File "/home/username/Development/GAE/myapp/appengine_django/db/base.py", line 128, in _setup_stubs from google.appengine.tools import dev_appserver_main File "/home/username/bin/google_appengine/google/appengine/tools/dev_appserver_main.py", line 82, in <module> from google.appengine.tools import appcfg File "/home/username/bin/google_appengine/google/appengine/tools/appcfg.py", line 53, in <module> from google.appengine.api import dosinfo File "/home/username/bin/google_appengine/google/appengine/api/dosinfo.py", line 25, in <module> import ipaddr ImportError: No module named ipaddr

    Read the article

  • How do you go about finding out whether an idea you've had has already been patented?

    - by Iain Fraser
    I have an idea for image copy-protection that I'm in the process of coding up and plan on selling to one of my clients who sells images online. If successful I think there would be a lot of people in a similar situation to my client who would be interested in the code also. I think this is a fairly unique idea that could be packaged into a saleable product - but if I did do this, I wouldn't want some big corporation decending on me with their lawyers after all my hard work. So before I put too much work into this I'd really like to know how I'd go about finding if this idea has been patented already and whether I'd get in trouble if I sold my product and if it would be worthwhile patenting the idea myself. Although I find the idea of software patenting abhorrent, it would be more to protect myself from the usual suspects than to stop fellow-developers from using the idea (if it is in fact a worthwhile one). I live in Australia, so an idea of who to go and see and a ball park figure of how much money I'd be looking at having to pay would be fantastic (in orders of a magnitude: 100s, 1000s, 10s of thousands of dollars, etc). Cheers Iain

    Read the article

  • Regular expression for finding non-breaking string names in code and then breaking them up for SQL q

    - by Rob Segal
    I am trying to devlop a regex for finding camel case strings in several code files I am working with so I can break them up into separate words for use in a SQL query. I have strings of the form... EmailAddress FirstName MyNameIs And I want them like this... Email Address First Name My Name Is An example SQL query which I currently have is... select FirstName, MyNameIs from MyTables I need the queries in the form... select FirstName as 'First Name', MyNameIs as 'My Name Is' from MyTables Any time a new capital letter appears that should be a new grouping which I can pick out of the matched string. I currently have the following regex... ([A-Z][a-z]+)+ Which does match the cases I have shown above but when I want to perform a replace I need to define groups. Currently I have tried... (([A-Z])([a-z]+))+ Which sort of works. It will pick out "Address" as the first grouping from "EmailAddress" as opposed to "Email" which is what I was expecting. No doubt there is something I'm misunderstanding here so any help is greatly appreciated.

    Read the article

  • How is this algorithm, for finding maximum path on a Directed Acyclical Graph, called?

    - by Martín Fixman
    Since some time, I'm using an algorithm that runs in complexity O(V + E) for finding maximum path on a Directed Acyclical Graph from point A to point B, that consists on doing a flood fill to find what nodes are accessible from note A, and how many "parents" (edges that come from other nodes) each node has. Then, I do a BFS but only "activating" a node when I already had used all its "parents". queue <int> a int paths[] ; //Number of paths that go to note i int edge[][] ; //Edges of a int mpath[] ; //max path from 0 to i (without counting the weight of i) int weight[] ; //weight of each node mpath[0] = 0 a.push(0) while not empty(a) for i in edge[a] paths[i] += 1 a.push(i) while not empty(a) for i in children[a] mpath[i] = max(mpath[i], mpath[a] + weight[a]) ; paths[i] -= 1 ; if path[i] = 0 a.push(i) ; Is there any special name for this algorithm? I told it to an Informatics professor, he just called it "Maximum Path on a DAG", but it doesn't sound good when you say "I solved the first problem with a Fenwick Tree, the second with Dijkstra, and the third with Maximum Path".

    Read the article

< Previous Page | 34 35 36 37 38 39 40 41 42 43 44 45  | Next Page >