Search Results

Search found 15137 results on 606 pages for 'mean filter'.

Page 252/606 | < Previous Page | 248 249 250 251 252 253 254 255 256 257 258 259  | Next Page >

  • What are the Ruby equivalent of Python itertools, esp. combinations/permutations/groupby?

    - by Amadeus
    Python's itertools module provides a lots of goodies with respect to processing an iterable/iterator by use of generators. For example, permutations(range(3)) --> 012 021 102 120 201 210 combinations('ABCD', 2) --> AB AC AD BC BD CD [list(g) for k, g in groupby('AAAABBBCCD')] --> AAAA BBB CC D What are the equivalent in Ruby? By equivalent, I mean fast and memory efficient (Python's itertools module is written in C).

    Read the article

  • persist image or video into voldemort

    - by qkrsppopcmpt
    I am working on my web service, and required to persist some image (jpg whatever) and video(wmv) into memmory. Just want to use single_node_cluster to feel voldemort. Can anybody give me a hint of the configuration and sample code of voldemort? I mean how to configure the value type in stores.xml? protobuf? java-serialization? Any sample or link would be helpful. Thanks

    Read the article

  • Refactor file copy in Visual Studio?

    - by Sapphire
    Does Visual Studio / Resharper support this? By refactor copy I mean to be able to enter new class name in some dialog, and to have the tool do all the refactoring (renaming) for you. No Copy of ... file names, and no error upon having two classes with same name in the project. Netbeans does this out-of-the-box :(

    Read the article

  • Checkstyle for Python

    - by oneself
    Is there an application similar to Java's Checkstyle for Python? By which I mean, I tool that analyzes Python code, and can be run as part of continuous integration (e.g. CruiseControl or Hudson). After analyzing it should produce an online accessible report which outlines any problems found in the code. Thank you,

    Read the article

  • How can one extract rdf:about or rdf:ID properties from triples using SPARQL?

    - by lennyks
    It seemed a trivial matter at the beginning but so far I have not managed to get the unique identifier for a given resource using SPARQL. What I mean is given, e.g., rdf:Description rdf:about="http://..." and then some properties identifying this resource, what I want to do is to first find this very resource and then retrieve all the triples given some URI. I have tried naïve approaches by writing statements in a WHERE clause such as: ?x rdf:about ?y and ?x rdfs:about ?y I hope I am being precise.

    Read the article

  • getting around circular references in Delphi

    - by Tom
    Is there a way of getting around circular unit references in Delphi? Maybe a newer version of delphi or some magic hack or something? My delphi project has 100 000+ lines of code mostly based on singleton classes. I need to refactor this, but that would mean several months of "circular reference" hell :)

    Read the article

  • jquery autocomplete

    - by richzilla
    Does anyone know if theres a jquery autocomplete library that works similar to the one here: http://www.thetrainline.com (try and select a station to see what i mean) The one on here is a prototype library. Basically all the ones ive found will only match characters if they appear at the beginning of a string, for example, if i typed 'ear' it would not match the word 'hear'. However this one seems to do that. If anyone has any ideas id be very grateful.

    Read the article

  • How do I display children in succession, as3

    - by VideoDnd
    How do I display children in succession? By succession I mean 1,2,3,4, etc. Perhapse incrementing with a loop or using a timer is what I'm after. Add, remove, appear, or disappear children, could all work. I want a simple way to display 1 child every second until I reach 10. METHODS TRYED addChild and removeChild visible !visible for loop

    Read the article

  • Why is the software world full of status codes?

    - by David V McKay
    Why did programmers ever start using status codes? I mean, I guess I could imagine this might be useful back in the days when a text string was an expensive resource. WAYYY back then. But even after we had megabytes of memory to work with, we continued to use them. What possible advantage could there be for obfuscating the meaning of an error message or status message behind a status code?

    Read the article

  • Cpu schedule, removing thread from queue

    - by Kamil
    I'm implementing now CPU schedule algorithms FCFS, SJF and Round Robin. Could somebody tell when process is removed from queue (FCFS,SJF,RR)? I mean, first CPU execute thread and after executing remove from queue or the other way around?

    Read the article

  • Use QuickCheck by generating primes

    - by Dan
    Background For fun, I'm trying to write a property for quick-check that can test the basic idea behind cryptography with RSA. Choose two distinct primes, p and q. Let N = p*q e is some number relatively prime to (p-1)(q-1) (in practice, e is usually 3 for fast encoding) d is the modular inverse of e modulo (p-1)(q-1) For all x such that 1 < x < N, it is always true that (x^e)^d = x modulo N In other words, x is the "message", raising it to the eth power mod N is the act of "encoding" the message, and raising the encoded message to the dth power mod N is the act of "decoding" it. (The property is also trivially true for x = 1, a case which is its own encryption) Code Here are the methods I have coded up so far: import Test.QuickCheck -- modular exponentiation modExp :: Integral a => a -> a -> a -> a modExp y z n = modExp' (y `mod` n) z `mod` n where modExp' y z | z == 0 = 1 | even z = modExp (y*y) (z `div` 2) n | odd z = (modExp (y*y) (z `div` 2) n) * y -- relatively prime rPrime :: Integral a => a -> a -> Bool rPrime a b = gcd a b == 1 -- multiplicative inverse (modular) mInverse :: Integral a => a -> a -> a mInverse 1 _ = 1 mInverse x y = (n * y + 1) `div` x where n = x - mInverse (y `mod` x) x -- just a quick way to test for primality n `divides` x = x `mod` n == 0 primes = 2:filter isPrime [3..] isPrime x = null . filter (`divides` x) $ takeWhile (\y -> y*y <= x) primes -- the property prop_rsa (p,q,x) = isPrime p && isPrime q && p /= q && x > 1 && x < n && rPrime e t ==> x == (x `powModN` e) `powModN` d where e = 3 n = p*q t = (p-1)*(q-1) d = mInverse e t a `powModN` b = modExp a b n (Thanks, google and random blog, for the implementation of modular multiplicative inverse) Question The problem should be obvious: there are way too many conditions on the property to make it at all usable. Trying to invoke quickCheck prop_rsa in ghci made my terminal hang. So I've poked around the QuickCheck manual a bit, and it says: Properties may take the form forAll <generator> $ \<pattern> -> <property> How do I make a <generator> for prime numbers? Or with the other constraints, so that quickCheck doesn't have to sift through a bunch of failed conditions? Any other general advice (especially regarding QuickCheck) is welcome.

    Read the article

  • Reloading embed PDF in a DIV (empty Accrobat Reader error popup)

    - by undef1
    Hello, I have a web application coded in C#/ASP.NET. The application basically exports a PDF file when the user click on Save. It then reloads a DIV, putting the EMBED (with the src pointing to the newly generated pdf file) in it. Sometimes the embed area just gets black and I get this window from Acrobat Reader: http://img180.imageshack.us/img180/3359/acreader.jpg. What does it mean? Has anyone ever see this?

    Read the article

  • Why aren't min-width and max-width working as I expect?

    - by Nathan Long
    I'm trying to adjust a CSS page layout using min-width and max-width. To simplify the problem, I made this test page. I'm trying it out in the latest versions of Firefox and Chrome with the same results. <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"> <html xmlns="http://www.w3.org/1999/xhtml"> <head> <title>Testing min-width and max-width</title> <style type="text/css"> div{float: left; max-width: 400px; min-width: 200px;} div.a{background: orange;} div.b{background: gray;} </style> </head> <body> <div class="a"> (Giant block of filler text here) </div> <div class="b"> (Giant block of filler text here) </div> </body> </html> Here's what I expect to happen: With the browser maximized, the divs sit side by side, each 400px wide: their maximum width Shrink the browser window, and they both shrink to 200px: their minimum width Further shrinking the browser has no effect on them Here's what actually happens, starting at step 2: Shrink the browser window, and as soon as they can't sit side-by-side at their max width, the second div drops below the first Further shrinking the browser makes them get narrower and narrower, as small as I can make the window So here's are my questions: What does max-width mean if the element will sooner hop down in the layout than go lower than its maximum width? What does min-width mean if the element will happily get narrower than that if the browser window keeps shrinking? Is there any way to achieve what I want: have these elements sit side-by-side, happily shrinking until they reach 200px each, and only then adjust the layout so that the second one drops down? And of course... What am I doing wrong?

    Read the article

  • How to organize a Shoes Ruby app?

    - by luca
    can I have some examples of how you organize your Shoes apps? I mean, simply using a Shoes.app{} block and instance variables is clumsy.. I'd like to achieve a MVC like structure.. I'm used to it (from rails, FLEX frameworks and others..) and would like to recreate something similar..

    Read the article

  • Annex-A vs Annex-B ADSL splitters

    - by Odys
    While trying to improve our Adsl connection, I found that we use a splitter that is from an unknown ventor and have no clue whether is for AnnexA (PSTN) or AnnexB (ISDN) line. Is it possible that somebody used the wrong splitter and just because it connected nobody ever cared? We have an ISDN line but the splitter used is blank. I am not really sure if it is AnnexB. Would it be possible to use an AnnexA filter over an ISDN line (even with that much signal loss)? (I am posting here because this is about our connection to the rack, I'm not sure if there is a more proper SExchange site)

    Read the article

  • What can we do to make Microsoft add IntelliTrace to VS 2010 Professional Edition?

    - by Ikaso
    Now that Microsoft has released VS 2010 I went to the product page here. To my amazement I found out that IntelliTrace(Historical Debugger) is supported only on the Ultimate Edition of VS 2010. This mean that you have to spend almost $4000 for renewal and almost $12000 for a new license. Does someone have any idea how can we change this decision? Especially make them add this feature to VS 2010 Professional Edition.

    Read the article

  • Connection Multiplexing

    - by whoi
    Hi; Supposing we have opened a connection of type either TCP or UDP to another remote machine. Having this connection, can we allow multiple connections virtually over this connection like VPN(but not VPN)? I mean multiple applications run on remote machine and you try to access to these applications, is there any multiplexing mechanism or concept supporting such feature?

    Read the article

  • Complex Event Processing with C#

    - by Soham
    Hi All, Can you suggest me a possible way to get started with CEP in C# ? By what I mean when I say, get started: A good book talking about CEP and C# A library which deals event clouds Some sample codes using the library Some good quality codes in general to get a possible feel of the problems Good blogs Anything else you might feel necessary to add for someone getting started in CEP and C# will be helpful. Thanks Soham

    Read the article

< Previous Page | 248 249 250 251 252 253 254 255 256 257 258 259  | Next Page >