I am trying to figure out if there is a way to query openstack for the ceilometer configuration. In particular, I would like to be able to query an API for the sampling interval for different meters. Is this currently possible (I'm still trying to find my way around openstack)?
I got some help on IRC, so I wanted to post the answer. In short, no. At least not at this time. There is a blueprint for the feature, but it is low priority and has not been implemented,
https://blueprints.launchpad.net/ceilometer/+spec/record-sample-periodicity
Related
I already did similar search terms for this topic in this forum.
https://stackoverflow.com/questions/6151668/alternative-to-google-translate-api
But that post is a bit old.. Things may have changed for about a year. And I wonder does anybody know if there's any better REST-based API service that I can use out there since that post was last posted.
Thanks.
I guess Bing translator could be the substitute that u are looking for.
I was looking for alternatives as well and came across a npm package called google-translate-api-browser which does work for my small project, but I can't assure big data translations or requests not being throttled
I am currently working with CAVE systems and I'm looking into hooking up a pre-exisiting game engine in one. I know this is possible through Unity and the Unreal Engine as there is already research out there showcasing that it has been done.
Right now, I have not decided upon one game engine to use and I'm currently looking around and researching if it is possible with the likes of CryEngine and Valve's Source Engine. The one issue that I am going to face, however, is getting the image to correctly render across all four of the monitors / screens.
Thusly, as a result I have two questions:
1.Does anyone know of any good research / books on distrubuted rendering? It doesn't need to be specificly for games, just the topic in general would be very useful
2.Does anyone know if other developers have managed to get Source and the CryEngine to run in a CAVE system? Through all my research I haven't been able to find anything on this, but then my google skills aren't the greatest.
If anyone could spare the time to answer these questions, I'd be extremely greatful.
Thanks.
too late for an answer, but still, you might want to have a look at
Equalizer: http://www.equalizergraphics.com
IceT: http://icet.sandia.gov
Chromium
(and a few more referenced in related publications, websites)
Problem:
I am trying to reverse geocode a lat/long into a closest street intersection using Google Maps API V3. Also, for now, this doesn't have to be super accurate-- as I am just trying to anonymize an address as opposed to providing directions.
I have seen that the Geocoding Results data contains an Address Component Type of "Intersection", but this doesn't seem to be consistent at all in the return results-- and is more often that not blank.
I have also done some looking on SO for the best way to construct this barring getting it from Google directly, and the closest I have seen is: How can I find the nearest intersection via the Google Maps API?, which doesn't really resolve my issue. In light of this I have come up with my own solution, and would like some opinions, optimizations, constructive criticism, or other options entirely.
My Tentative Solution:
After playing around with the API, I decided to give the following algorithm a shot (just for context, this is written in C# within a console app):
I take an address and resolve that into a lat/long.
I then add or subtract a certain amount of lat or long from the
coordinate-- on the order of a city block (a distance which is adjusted given your
latitude) and get walking directions between the points. I do this for up to all four directions-- so the first modification would be to keep the latitude the same but subtract some longitude. Then the next modification would be to keep the latitude and add some longitude, etc.
After getting the directions, I parse the results and check the start
and end address. If they are different, I pull out the street names
and treat them as an "intersection" (even though sometimes this
results in parallel streets-- again just trying to get a ballpark).
If I don't find two different streets, I widen the distance of the end destination and repeat the process.
So far this working well enough, but obviously it is an expensive process both in terms of time, and in using up my allotted query limit. Also, I checked the API terms of service, and as long as I include their disclaimer and display the results on a Google Map I think that I am ok.
My questions for the community are:
How can I improve the efficiency of the algorithm? Specifically, in
the number of times I call the API (the implementation code is not a
problem)
Is there another way entirely to do this using the Google Maps API?
In the SO question referred to above, the solution was to loop
over building numbers. I am not sure exactly what that means-- so any
clarification would be great.
As referred to above, I do not believe this is breaking the terms of service-- but am I mistaken?
Is there another web-based API to use that may meet my needs better?
Perhaps Bing, or some other provider?
Thanks a lot for any help.
UPDATE:
I have run into my query limit for the day, so I won't be able to test any suggestions against Google today, but I am also still open to using a different API. Thanks.
Old question, but since the original poster stated they were open to solutions other than Google, Geonames has a web API for this for the U.S. See GeoNames WebServices overview and http://www.geonames.org/maps/us-reverse-geocoder.html#findNearestIntersection
How does one issue span queries in SOLR (Span, SpanNear, etc)? I've
done a bit of research and I can't tell of a straightforward way to do it.
It would seem that I need to implement a QueryParserPlugin to accomplish
what I want to do. Is this the correct path? Surely this has been done before. Does
anybody have links to examples? I had trouble finding anything.
Span queries aren't currently supported (JIRA issue here).
Judging by this mail thread, it seems that you're on the correct path by implementing a QueryParserPlugin.
If you do implement this, consider submitting a patch!
Guys, I want to build an e-commerce site on asp.net. My query is: when two users simultaneously buy something, how would the two records get inserted in my database? Would there be a lock? Can anyone explain how this would be or can be handled.
Also, I want to handle peak traffic and also control the average data allotted to each user. I am thinking of using a plug-in. Any suggestions here?
Just a thought but if your just starting a new online store its highly unlikely you'll run into any problems like this for some time?
Secondly, Databases take care of themselves and your web server does all the work of handling traffic and allocating resources. You shouldn't be doing this at a web code level.
The RDBMS handles the locking for you.
Maybe a better solution is a free ecommerce solution, as it'll have a lot of optimisation for large traffic already. Is there a specific reason not to use one of the many solutions already available?