How can I unzip a varbinary(max) value in a stored procedure? I'd like to implement or invoke a gunzip algorithm within TSQL code, preferably without enabling the CLR.
I'm implementing a binary representation of an equal-side bi-partitioning algorithm and I'm wondering what the best way to iterate through all combinations of N bits that have equal (N/2) 1's and 0's. I'm trying to find the quickest way, not the easiest to code. Thanks.
I have seen this image swirl effect on a visual thesaurus.
Is there any open source code for this? Or research paper explaining how they made it.
I don't care about the algorithm to match similar objects. I only am wondering about the effects.
From what i understand they are called recursive orbital diagram.
Screenshot:
google Wonder Wheel
google image swirl
exhaustive:
- all keys in the dictionary, even if the keys are in a nested dictionary that is a value to a previous-level dictionary key.
sorted:
- this is to ensure the keys are always returned in the same order
The nesting is arbitrarily deep. A non-recursive algorithm is preferred.
level1 = {
'a' : 'aaaa',
'level2_1' : {'b': 'bbbbb', 'level3': {'c': 'cccc', 'd': 'dddddd'} },
'level2_2' : { 'z': 'zzzzzzz' }
}
I would like to know how I can use SOM for disease detection. Given a lung cancer dataset, how can SOM be applied for detection, there are certain terminologies like, sensitivity, specificity and accuracy percentages....are there ways to calculate all these with the SOM algorithm? I would appreciate answers from anyone who can shed more light on this
What is the best way to get individual digits from an int with n number of digits for use in a radix sort algorithm? I'm wondering if there is a particularly good way to do it in C/C++, if not what is the general best solution?
I am curious about the IDs that are used to identify items in winqual.
I assume it is some sort of hash. Is this published?
Hash of the module name, its version and an offset?
That seems appropriate but the size is too small to cover the possibilities unless some truncation/lossy algorithm is used.
This seems to be generated with the minidump on the client machine.
I have a MySQL database from which a view is created. Is is possible to add an auto-incrementing id for each row in the view?
I tried
CREATE ALGORITHM=UNDEFINED DEFINER=`database_name`@`%` SQL SECURITY DEFINER VIEW `MyView` AS
set @i = 0;
select @i:=@i+1 as `id`
...
but that doesn't work in a View.
Sorry, my SQL is weak, any help is appreciated.
I have alignment file and long record in it. Suppose while displaying to an end user i want to show Sequence ID and 50 sequences in each line and continue further till the end of file.
Can anyone suggest me algorithm or example code in python.
Thanks in advance
Who can tell me the internal working mechanism of a CollectionEditor in plain English?
I have implemented every virtual function and step into each of them. Still got no clue of its intended algorithm. I searched the web and found tons of compaints about the CollectionEditor type, and even bugs.
I am kind of thinking of the CollectionEditor as a total mess.
I was given this interview question recently:
An analog clock shows that the current time is HH:MM. Compute in degree, the smaller angle between the hour and minute hands. Be as precise as you can.
I'm wondering what's the simplest, most readable, most precise algorithm is. Solution in any language is welcome (but do explain it a bit if you think it's necessary).
Hi everyone,
I really need to know what each lzma parameter (mf, fb, lp, ...) means. I could not find any good documentation in the internet. I need details of this algorithm. the most detailed one is:
http://www.bugaco.com/7zip/MANUAL/switches/method.htm
I would appreciate any help.
Best wishes,
Shadi.
I have N rectangles with sides parallel Ox and Oy. Exists another rectangele (model). I need create algorithm, which can tell: is model covered by N rectangles? and code him.
I have some ideas. First I think need sort rectangles by left side (it can be done by O(n log n)). Then I think need use vertical sweeping line.
Thanks.
Looking to use FastLZ in Python, or something similar. Tried Google and didn't find anything. Wondering if there is another algorithm with similar performance available in Python?
Hello! I Wonder if someone has used Markov Algorithm-based programming system or embedded facility in production or for scientific purpose.
I know about 'REFAL' programming language invented a thousand years ago, but it all seems to be dead, so..
Ref: http://en.wikipedia.org/wiki/Markov_algorithm
Hi
this a part of code for Quick Sort algorithm but realy I do not know that why it uses rand() %n please help me thanks
Swap(V,0,rand() %n) // move pivot elem to V[0]
hey,
I'm trying to programming a crossword creator. using a given dictionary txt file and a given pattern txt file. The basic idea is using DFS algorithm. the problem begin when the dictionary file is v-e-r-y big (about 50000 words). then i recive the :
Exception in thread "main" java.lang.OutOfMemoryError: GC overhead limit exceeded
i know that there is a part in my program that waists memory, but i don't know where it is, how to find it and how to fix it
Hi,
Please share some good websites where I can learn more on String Processing Techniques and could grill myself more into different kinds of algorithm available in this field..
Thanks..
Talking about javax.crypto.Cipher;
I was trying to encrypt data using Cipher.getInstance("RSA/None/NoPadding", "BC"); but I got the exception: ArrayIndexOutOfBoundsException: too much data for RSA block
Looks like is something related to the "NoPadding", so, reading about padding, looks like CBC is the best approach to use here.
I found at google something about "RSA/CBC/PKCS#7", what is this "PKCS#7"? And why its not listed on sun's standard algorithm names?
Hi all,
Is it possible to create a certificate template that uses SHA-2 (sha256, sha224, sha384, sha512), from a Windows server 2003 CA?
I know how to do it in Windows server 2008 based CA, with the new version (version 3) - it is possible to specify the hash algorithm (Under the "Cryptography" tab of the template properties). But is it possible in 2003 based CA?
Thanks.
I know you can generate all permutations from a list, using glob or Algorithm::Permute for example - but how do you generate all possible permutations from a regular expression?
i want to do like:
@perms = permute( "/\s[A-Z][0-9][0-9]/" );
sub permute( $regex ) {
# code - put all permutations of above regex in a list
return @list;
}
hi,
i m doing my project in software testing. gnetic algorithm is the technique i want to use to generate automatic test data\test cases in matlab.
please help me in doing my project successfully.
thanks.
I have done some computer graphical programming recently, and I have no experience before. I used the library call CGAL(computer geometry algorithm library). Also, I noticed that there is class for triangulation and also class for mesh. Is mesh just a kind of triangle net? Do they have any differences?
Thanks!
I want to know , What is the advantage of Lucene searching and indexing ?
Is searching with Lucene as fast as other searching algorithm like Quick Search?
What about indexing ?
I want to know more about advantage of Lucene rather that others .
thanks .
Hi!
Is there an easy way to get the relative compliment of two sets? Perhaps using LINQ?
http://en.wikipedia.org/wiki/Complement_(set_theory)
I have to find the relative compliment of a set A relative to B. Both A and B are of type HashSet but I think the algorithm could be made more generation (IEnumerable or even ISet)?
I could use a solution in either vb.net or C#.