|
After writing it about 12 times, I came up with this. Works pretty well, but could be better.
Theirs a program called combine_virtual_packages_common that could use better refining.
I was thinking, perhaps I should treat a batch of items like water. Take a box that is 24x17x14 and calculate the item line as water level, and fill the box, say 1 or 2 inches at a time.
Dropbox - RTSR Console 2016093001.zip[^]
|
|
|
|
|
Sorry, Jim, i've been bit busy...
I've downloaded the latest version of RTSR Console. As it turned out i can't install .net framework 4.6.1 on my laptop (win10). After that, i tried to find combine_virtual_packages_common function, but i've failed. I've found only combine_virtual_Common.
Can you accept my invitation on LinkedIn? Then we'll be able to continue discussion in private.
Cheers
Maciej
|
|
|
|
|
The later is the correct name
combine_virtual _common
Sorry about the .net issue, and yes I'm running Win 10 and VS2015
Yes I can accept the invite, just need to receive it first.
|
|
|
|
|
Strange,
In my LinkedIn profile i see: "Invitation pending". I'll try to send you a message via InMail (on LinkedIn).
Maciej
|
|
|
|
|
It was pending in my queue, just accepted
|
|
|
|
|
Hi
I have a textfile and need to build a algorithm join lines
The lines have 14 characters that can be
1,2,3,4,5,6,or 7
Example
44444444444444
This numbers represent bit representation,
1= 001
2=010
3=011
4=100
5=101
6=110
7=111
For to join line I must to observe if two (or more) line have 1 or 2 characters differente then to XOR between characters
Example
Line 01=> 11122444444444
line 02==>12142444444444
First character each line is 1 zero different
Second character first line is 1 and second is 2 then 1 different
Same to 4th character (2 and 4), The others are equal.
due to having only two differences I DO a XOR bits
Second character
1 xor 2 ==> 3
001 xor 010 ==> 011
4th character
2 xor 4 ==> 6
010 or 100 ==> 110
I need build best algorithm to join lines with rules
1)I can have more than two lines being used
2) Each line can have a maximum 1 or 2 , character 7 (parameterized) after join
3) each line used in another must, can not be used more
Somebody know how can I to build a recursive algorithm ?
Tia
|
|
|
|
|
By specifying that you need the "best" algorithm, you have severely limited any response.
Oh, and that's "Octal" you're fiddling with.
|
|
|
|
|
Thank you,
better perhaps put examples
81 LINES
11111111111111
11121111111111
11141111111111
11211111111111
11221111111111
11241111111111
11411111111111
11421111111111
11441111111111
12111111111111
12121111111111
12141111111111
12211111111111
12221111111111
12241111111111
12411111111111
12421111111111
12441111111111
14111111111111
14121111111111
14141111111111
14211111111111
14221111111111
14241111111111
14411111111111
14421111111111
14441111111111
21111111111111
21121111111111
21141111111111
21211111111111
21221111111111
21241111111111
21411111111111
21421111111111
21441111111111
22111111111111
22121111111111
22141111111111
22211111111111
22221111111111
22241111111111
22411111111111
22421111111111
22441111111111
24111111111111
24121111111111
24141111111111
24211111111111
24221111111111
24241111111111
24411111111111
24421111111111
24441111111111
41111111111111
41121111111111
41141111111111
41211111111111
41221111111111
41241111111111
41411111111111
41421111111111
41441111111111
42111111111111
42121111111111
42141111111111
42211111111111
42221111111111
42241111111111
42411111111111
42421111111111
42441111111111
44111111111111
44121111111111
44141111111111
44211111111111
44221111111111
44241111111111
44411111111111
44421111111111
44441111111111
after joining
77771111111111
Example 3 first lines
11111111111111
11121111111111
11141111111111
Therea only difference in 3th character
001 xor 010 ==> 011
and there only a different in 3th charcter in 3th line then
011 xor 100 ==> 111 => 7
|
|
|
|
|
There's no recursion required; just a "for" loop.
XOR the first and second "lines"; then XOR that result with the 3rd; and so forth.
Maybe not the "best", but "easy" to understand and implement; and you're only dealing with 81 "lines".
|
|
|
|
|
Thank You
My Post was a trivial example , but can have somee restrictions
Example:
3,5 and 6 can show only 2 times
or
7 with 3
or
7 with 5
or
7 with 6
show only one time in file
example
75444444444444 is possible
75344444444444 no is possible because 7 is together 5 and 3
35644444444444 no possible 3,5 and 6
35444444444444 is possible
etc
My problem is way to let
smaller number of possible lines
|
|
|
|
|
If you need to "filter" your "list of lines" use LINQ.
You can remove items; count items; etc.
e.g.
... = MyList.Where( line => line.contains() || line.StartsWith() || etc. )
|
|
|
|
|
Hello to All!
I am performing a small academic research regarding distributed storage systems and some practical problems that are connected with this. One problem is fail-over and primary-backup replication algorithms. Some DSS use consensus algorithms to elect leader for replication like Raft and Paxos (Multi-Paxos). So my question is:
How do these algorithms address replication issues in storage systems? What are advantages and disadvantages to use Paxos or Raft? E.g.:
1. Raft has following advantages:
2. Raft has following limits:
3. Paxos has following advantages:
4. Paxos has following limits:
Can anyone point me on what basic pros and cons are for these two algorithms in using for storage systems?
What is the practical usage of both of them in DSS?
Thanks in advance,
Nick.
|
|
|
|
|
|
Thank you Richard, I know these resources. But mostly information there is about internals of algorithms and how they work. By now I need to see a brief comparison of limits of each for the purpose of building a fault tolerant system using consensus.
So maybe more simple question for people who already familiar with both
protocols: what do like and dislike in each other? I need information not like "it's more complex" or "it's more popular" but better their limits in particular purpose (storage fault tolerance). Why one prefer Paxos or other likes Raft?
Regards,
Nick.
|
|
|
|
|
Hi.. im new here...
Im a BSCS freshman and im studying in a couple of weeks.. i just have a little problem... i am having trouble translating this flowchart into an algorithm pseudocode... i dont know how to end the program in the middle of DO-WHILE and REPEAT-UNTIL, it just makes me write endless DO-WHILEs... can someone help me?
here is the link of my flowchart..
untitled — Postimage.org[^]
thanks for helping me..
modified 27-Aug-16 9:00am.
|
|
|
|
|
Please use "code" tags to modify your question so the flowchart is readable. That will give you a fixed width font, and you can see the preview to get it right. You won't get any answers to the current mess.
Peter
Software rusts. Simon Stephenson, ca 1994. So does this signature. me, 2012
|
|
|
|
|
ive edited my post.. hope you can now understand it..
|
|
|
|
|
Crikey! If that's the 'fixed' version, the other one probably killed dolphins, fairies and little babies.
As suggested, rather than trying to hack it together using . characters for spacing, why dont you wrap it in <pre> </pre> blocks? (select it then hit the 'code' button)
You could end up with something as legible as this (even with it's incorrect decision boxes):
+-------+
| START |
+-------+
|<--------+
+---v---+ |
|X = X+1| |
+---+---+ | YES
| |
+---v---+ |
| X < 3?|-----+
+-------+
|
| NO
|
v
Failing that, upload an image to an image-hosting site and then post a link. That's the less preferred option, text is perfectly adequate.
|
|
|
|
|
omg thank you... now its better..
modified 27-Aug-16 8:21am.
|
|
|
|
|
You're welcome. That image is much more legible. 
|
|
|
|
|
|
OMG now i get it.. thank you so much for the info ;D ;D
modified 27-Aug-16 21:01pm.
|
|
|
|
|
Please Need Urgent Code suggestions for this:
There is a 2D matrix which has 0s and 1s . Your main aim is to tell maximum number of rows that are max amplified . A row is max amplified if all the columns in a row are 1. You have been given K which tells the number of column inversions you HAVE to do . Column inversion means that the whole column of that 2D matrix is inverted . 0 is replaced by 1 and 1 is replaced by 0 . You have to tell that after K inversions how many rows of max amplification will be present . K inversions gave to take place . Not less than that not more . One column can be inverted more than once .
|
|
|
|
|
Your homework is set to test what you know, not how good you are at convincing strangers on the Internet to do your work for you.
Try doing it yourself, and you'll probably find it's not as difficult as you think. After all, it should be based on concepts that you've recently covered in your course.
If you really don't know where to start, then talk to your teacher.
"These people looked deep within my soul and assigned me a number based on the order in which I joined."
- Homer
|
|
|
|
|
This a test about your math knowledge and convert to code. Computer graphic you has do it or you will never get it
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
