Search Results

Search found 8341 results on 334 pages for 'job distance'.

Page 142/334 | < Previous Page | 138 139 140 141 142 143 144 145 146 147 148 149  | Next Page >

• android, find the nearest location without going through all the locations

  - by Marwan

  I am building a taxi dispatching app first: I need the passenger app to show the nearest taxis, now I know how to do that in code but in my way I have to go through all the taxis locations(in database on server) and calculate the distance from the passenger location and get the lowest ones - I don't want to do this because there will be a lot of taxis and going through all of them and making some math is kind of pain on the server- is there a way to get the nearest ones without going through all of them? second: what the best database to use - first, should it be sql or non-sql - I need a very robust database, because there will be a lot of updates (I mean the passengers locations added then deleted when arriving to destination && the taxis location changes frequently) finally: I will use RubyOnRails to do the server side and json as data transfer format, do you have a recommendation to me on something better? Thanks

  Read the article

• how to diff / align Python lists using arbitrary matching function?

  - by James Tauber

  I'd like to align two lists in a similar way to what difflib.Differ would do except I want to be able to define a match function for comparing items, not just use string equality, and preferably a match function that can return a number between 0.0 and 1.0, not just a boolean. So, for example, say I had the two lists: L1 = [('A', 1), ('B', 3), ('C', 7)] L2 = ['A', 'b', 'C'] and I want to be able to write a match function like this: def match(item1, item2): if item1[0] == item2: return 1.0 elif item1[0].lower() == item2.lower(): return 0.5 else: return 0 and then do: d = Differ(match_func=match) d.compare(L1, L2) and have it diff using the match function. Like difflib, I'd rather the algorithm gave more intuitive Ratcliff-Obershelp type results rather than a purely minimal Levenshtein distance.

  Read the article

• AS3 (Pixelfumes Reflection Class)

  - by Mick

  Hi I am using a reflection class in my code. I have stripped it right down to the code below. I have a mc on the stage with an instance name of sand. I have tried all combinations and do not get an error BUT i don't get a reflection either. I have been on the forums for the site but cant find any info. Does anyone have any experience with this plugin please ? import com.pixelfumes.reflect.*; new Reflect({mc:sand, alpha:100, ratio:255, distance:0, updateTime:0.2, reflectionAlpha:100, reflectionDropoff:3.64});

  Read the article

• Is there a better method for scrolling a page (with jQuery) in Safari for iPhone (scrollTop doesn't

  - by Keeron

  Hi there, I am working on an iPhone version of a website, and I am using jQuery .animate() with the scrollTop attribute to scroll to different sections of the page. Something like so: $('html,body').animate({ scrollTop: distance }, 300); On regular web browsers, the scrolling starts from the current window position to the desired position. On the iPhone, the window jumps back to the top of the document before scrolling to the desired position. This is apparently the intended action, but the pages just don't look good with all that movement. Alternatively, on Google.com for the iPhone, when the autosuggest is activated, there is a nice simple scroll to show the autosuggest options below the search box. That's what I'd like to do...

  Read the article

• Find recipes that can be cooked from provided ingridients

  - by skaurus

  Sorry for bad English :( Suppose i can preliminary organize recipes and ingredients data in any way. How can i effectively conduct search of recipes by user-provided ingredients, preferably sorted by max match - so, first going recipes that use maximum of provided ingridients and do not contain any other ingrs, after them recipes that uses less of provided set and still not any other ingrs, after them recipes with minimum additional requirements and so on? All i can think about is represent recipe ingridients like bitmasks, and compare required bitmask with all recipes, but it is obviously a bad way to go. And related things like Levenstein distance i don't see how to use here. I believe it should be quite common task...

  Read the article

• Optimizing a Parking Lot Problem. What algorithims should I use to fit the most amount of cars in th

  - by Adam Gent

  What algorithms (brute force or not) would I use to put in as many cars (assume all cars are the same size) in a parking lot so that there is at least one exit (from the container) and a car cannot be blocked. Or can someone show me an example of this problem solved programmatically. The parking lot varies in shape would be nice but if you want to assume its some invariant shape that is fine. Another Edit: Assume that driving distance in the parking lot is not a factor (although it would be totally awesome if it was weighted factor to number of cars in lot). Another Edit: Assume 2 Dimensional (no cranes or driving over cars). Another Edit: You cannot move cars around once they are parked (its not a valet parking lot). I hope the question is specific enough now.

  Read the article

• Would you work for an "Adult" Company?

  - by Ender

  Although I try to distance myself from web-oriented work nowadays (unless I need the money) I've received a number of emails from clients wishing for me to help design and develop online solutions for adult websites. Hell, when I was 17 I was asked to help design an adult website that I would not legally be able to view. After talking to a few Software Engineers and Flash Developers I have heard that there is a lot of interesting work in the adult industry for those who like to work with new technologies. Have any of you worked for a company dealing with adult/pornographic content? Did you enjoy it? If you haven't would you ever consider it? More than anything I find it interesting to see how others would view the offer, whether you would be afraid to list it on a CV/Resume, how interesting the work would be, how you think future employees would see you and whether you believe that they would judge you for working in a dirty industry.

  Read the article

• elastic / snaking line algorithm

  - by vhdirk

  Hi everyone I am making a graphics application in which I can edit a polyline by dragging the control point of it. However, I'd like to make it a bit easier to use by making it elastic; When dragging a control point, instead of moving a single point, I'd like the points within a certain distance of that point to be moved as well, depending on how hard the control point is 'pulled'. Does anyone know a simple algorithm for this? It may be quite rudimentary, as the primary requirement is speed. Actually, knowing how to call such behaviour would also be nice, so I can look it up on google. I tried 'snaking' line, but that seems to refer to active contours, which isn't what I'm looking for. Thanks

  Read the article

• How do I interpolate between points without going beyond them?

  - by user1774893

  I have data of variable lengths (reaching movements recorded in 2D) and want to create a function that will resample this data to a uniform length (500 samples). However, I want matlab to only resample between the maximum and minimum values given, without adding any additional distance. For instance, if I resample the matrix [1:1:10], the resampled matrix should have a minimum value of 1 and a maximum value of 10. So far I've tried the following: x = [1:1:10]; interp(x, 500 / length(x)); This, however, gives values above my maximum specified value of 10. Is there any way I can get matlab to resample/interpolate solely between two points, without extending beyond them?

  Read the article

• jQuery mobile swipe spamming and animation

  - by halliewuud

  I have say 5 list items with images inside placed 200px from eachother. I am trying to animate these list items to slide horizontally left if one presses a link with the id = #next or if one swipes left. And vice versa for sliding the list items right. Every click or swipe results in a slide animation of 200px on every list item. I ran into a problem where spamming the #next or #prev button would cancel the current animation and start a new one. This results in list items not sliding 200px+200px+200... but something like this 200px+140px+120... This because like I said the animation is cut and therefore the sliding distance will be shorter. Now I solved this for the clicking event by disabling the button before the animation starts and then re'enabling it on the end callbak function. But this problem is remaining for the swipe event. How can I solve this problem for the swipe event?

  Read the article

• kmeans based on mapreduce by python

  - by user3616059

  I am going to write a mapper and reducer for the kmeans algorithm, I think the best course of action to do is putting the distance calculator in mapper and sending to reducer with the cluster id as key and coordinates of row as value. In reducer, updating the centroids would be performed. I am writing this by python. As you know, I have to use Hadoop streaming to transfer data between STDIN and STOUT. according to my knowledge, when we print (key + "\t"+value), it will be sent to reducer. Reducer will receive data and it calculates the new centroids but when we print new centroids, I think it does not send them to mapper to calculate new clusters and it just send it to STDOUT and as you know, kmeans is a iterative program. So, my questions is whether Hadoop streaming suffers of doing iterative programs and we should employ MRJOB for iterative programs?

  Read the article

• How to find the number of inversions in an array ?

  - by Michael

  This is an phone interview question: "Find the number of inversions in an array". I guess they mean O(N*log N) solution since O(N^2) is trivial. I guess it cannot be better than O(N*log N) since sorting is O(N*log N) I have checked a similar question from SO and can summarize the answers as follows: Calculate half the distance the elements should be moved to sort the array : copy the array and sort the copy. For each element of the original array a[i] find it's position j in the sorted copy (binary search) and sum abs(i - j)/2. Modify merge sort : modify merge to count inversions between two sorted arrays (it takes O(N)) and run merge sort with the modified merge. Does it make sense ? Are there other (maybe simpler) solution ? Isn't it too hard for a phone interview ?

  Read the article

• Flash relationship map

  - by John

  Hi, Does anyone know any Flash fla's which are out there and free which do something similar to http://audiomap.tuneglue.net/ (you have to type in a search term to see it in action). What I'm after is the flash to create the node in the middle which expands out into children and then each of those children can be expanded out into more children, etc. while keeping their distance from one another so as to not overlap. I'd like it so that if you clicked on a node to expand it, it would shoot off to a web site and get an xml feed which could then be used to create the children. Thanks

  Read the article

• Information Modeling

  - by Betamoo

  The sensor module in my project consists of a rotating camera, that collects noisy information about moving objects in the surrounding environment. The information consists of distance, angle and relative change of the moving objects.. The limiting view range of the camera makes it essential to rotate the camera periodically to update environment information... I was looking for algorithms / ways to model these information, in order to be able to guess / predict / learn motion properties of these object.. My current proposed idea is to store last n snapshots of each object in a queue. I take weighted average of positions and velocities of moving object, but I think it is a poor method... Can you state some titles that suit this case? Thanks

  Read the article

• MATLAB pdist function

  - by James

  Hi, I am using the pdist command to find the distance between x and y coordinates stored in a matrix. X = [100 100; 0 100; 100 0; 500 400; 300 600;]; D = pdist(X,'euclidean') Which returns a 15 element vector. : [0.734979755525412 3.40039811339820 2.93175207511321 1.83879677592575 2.40127440268306 2.75251513299386 2.21488402640753 1.10610649500317 1.81674017301699 0.903207751535635 1.99116952754924 1.05069952386082 1.24122819418333 1.08583377275532 1.38729428638035] Is there a way to associate these distances with the coordinates they were derived from, i.e. store them in a matrix with the general row form: [Length xcoordinate1 ycoordinate1 xcoordinate2 ycoordinate2] Where there is a row for each length found? Thanks in advance

  Read the article

• How to implement a unit converter in java

  - by Mohit Deshpande

  How could I possibly implement a unit converter in Java??? I was thinking of having a abstract base class: public abstract class Unit { ... public void ConvertTo(Unit unit); } Then having each class like Meter Kilometer Inch Centimeter Millimeter ... derive from that base Unit class. All the units of length would be in a package called com.unitconverter.distance, then a package, com.unitconverter.energy, for energy etc. etc. So is this the best way to implement a unit converter? Or is there a better or more easier way?

  Read the article

• Intersection of line and rectangle with maximum segment length

  - by Aarkan

  I have a vector represented by the slope m. Then there is rectangle (assume axis aligned), which is represented by top-left and bottom-right corner. Of course, there may be many lines with slope m and intersecting the given rectangle. The problem is to find out the line whose length of line intercept inside the rectangle is maximum among all such lines. i.e., if the line intersects rectangle at P1 and P2, then the problem is to find the equation of line for which length of P1P2 is maximum. I proceeded like this. Let the line is: y = m*x + c. Then find out the intersection with each side of rectangle and finding out the maxima for distance function between each pair of points. But it will only give me the length of line segment and there seem to be many corner cases to handle. Could anyone please suggest a better way to do this. Thanks in advance.

  Read the article

• C++ iterators problem

  - by qwead

  I'm working with iterators on C++ and I'm having some trouble here. It says "Debug Assertion Failed" on expression (this-_Has_container()) on line interIterator++. Distance list is a vector< vector< DistanceNode . What I'm I doing wrong? vector< vector<DistanceNode> >::iterator externIterator = distanceList.begin(); while (externIterator != distanceList.end()) { vector<DistanceNode>::iterator interIterator = externIterator->begin(); while (interIterator != externIterator->end()){ if (interIterator->getReference() == tmp){ //remove element pointed by interIterator externIterator->erase(interIterator); } // if interIterator++; } // while externIterator++; } // while

  Read the article

• Will the next iPhone Simulator be able to simulate the high resolution of iPhone 4?

  - by dontWatchMyProfile

  As a follow-up to this question, the next one is: Will we be able to simulate our interfaces how they look on the new high resolution display, even without owning an iPhone 4? I guess that there is a formula that we can use to calculate the exact needed distance between our monitors and our eyes, to achieve the exact same visual effect of the Retina Display. This would help a lot to get things right. The first thing we need is an high resolution iPhone Simulator. I can't get any sleep until I know.

  Read the article

• How to represent a list of points in R

  - by Guido

  I am working with a large list of points (each point has three dimensions x,y,z). I am pretty new with R, so I would like to know what is the best way to represent that kind of information. As far as I know, an array allows me to represent any multidimensional data, so currently I am using: > points<-array( c(1,2,0,1,3,0,2,4,0,2,5,0,2,7,0,3,8,0), dim=c(3,6) ) > points [,1] [,2] [,3] [,4] [,5] [,6] [1,] 1 1 2 2 2 3 -- x dim [2,] 2 3 4 5 7 8 -- y dim [3,] 0 0 0 0 0 0 -- z dim The aim is to perform some computations to calculate the euclidean distance between two sets of points (any hint in this sense would also be highly appreciated)

  Read the article

• Broadcast message or file to nearby Bluetooth devices

  - by Medjeti

  Hiya, A client of ours is attending a business fair and would like to push some sort of "welcome message" to people visiting their space. I'm not too familiar with Bluetooth, so I have a few questions: What kind of content can you transfer via Bluetooth? (Is it files only or is it possible to send a simple text message?) Is it possible to push content only to recipients within a certain distance? (ie. based on signal strength or similar) Can anybody recommend a piece of software that can do some or all of the above? If necessary we could program a custom solution ourselves (.NET), but I'm sure there must be a program out there that can do the job. I've googled a bit and came across the 32feet.NET framework - does anybody have any experience with this framework? Thanks in advance for any suggestions!

  Read the article

• How to convert from one co-ordinate system to another (graphics)

  - by Dororo

  I've been having issues with this for a little while now. I feel like I should know this but I can't for the life of me remember. How can I map the screen pixels to their respective 'graphical' x,y positions? The co-ordinate systems have been configured to start at the bottom left (0,0) and increase to the top-right. I want to be able to zoom, so I know that I need to configure the zoom distance into the answer. Screen |\ Some Quad | \--------|\Qx | \ Z | \ | \ \|Qy \ | Sx\ |Sy \| I want to know which pixels on my screen will have the quad on it. Obviously as Z decreases, the quad will occupy more of the screen, and as Z increases it will occupy less, but how exactly are these calculated? Thanks for any help.

  Read the article

• apt-get install won't work

  - by Christoffer D. Brammer

  First of all: I am quite new to Ubuntu (and Linux and servers in all). When I am trying to install ex phpmyadmin from apt-get, I get the Error: E: Couldn't configure pre-depend upstart-job for hostname, probably a dependency cycle. Can anyone tell me why this happens, and what I can do to fix it? I am running Ubuntu Server 7.10 . /Christoffer ---EDIT--- I found the problem - and the solution! I had "ruined" (changed a little) my sources.list -and when I "reinserted" a new one, it all worked! YUHU! But thanks for your time, Rupali!

  Read the article

• Broadband wireless drivers don't work

  - by user88235

  I have a Dell Latitude E6520 which is a Ubuntu 12.04 certified hardware. However the driver assigned to the Dell Wireless 5630 (EVDO-HSPA) Mobile Broadband Mini-Card doesn't seem to work. When I boot in Windows 7 I connect to Verizon dialing *99# with no username or password but it won't connect using Ubuntu. The windows drivers are from Novatel Wireless Inc 1.0.0.6 if that helps. This is also an internal card not USB and the hardware Id is USB\VID_413C&PID_8194&REV_0002&MI_00 If anyone can help me with obtaining the correct driver or maybe some other way of getting it to work I would be very grateful. My job requires traveling and I need internet access but hate using Win7.

  Read the article

• Advice needed on how to start web programming? [closed]

  - by Recursion

  Possible Duplicate: Best approach to learning web programming I have resisted doing web programming for a while, but I have come to the realization that I need to learn it and may have resisted do to fear of the unknown. I am a regular applications and systems programmer with no real idea of how to even get started. I have tried to start a few times, rails, django, tornado, web.py, cherrypy, but always get discouraged and quit. The most web programming I have done was in HTML during 1995 for my geocities site. I have pretty decent experience with regular programming in C, Python, Assembly and Java. Just looking for a way to get started and get a good overview of the different technologies and frameworks. I am not doing this for a job or employment, just to learn.

  Read the article

< Previous Page | 138 139 140 141 142 143 144 145 146 147 148 149  | Next Page >