It was bad enough before how much content was actually available to stream versus by mail, especially compared to (not really competing, I guess alternative is more apropos) services e.g. XBL. Now that service is losing even more titles due to licensing issues with Starz. What terrible timing to try and spin a price increase as something consumers actually want, when the service you're charging more for is actually LOSING VALUE. This makes no sense on the face of it, especially in today's atmosphere of belt tightening and budget trimming.
I spent 10 minutes looking for my old login information just to see if I had mod points to promote this comment, alas I had none.
a lot of people look down on frats for no good reasons, a lot of people hold them in esteem for no great reason either. the best advice i can give to anyone, is don't listen to other people's opinions. wait a semester and see how life is like outside of greek life, rush multiple fraternities to get a feel for each (different organizations attract different types of people, don't get pressured into joining an organization, complete the pledge program, and find out that you hate the people you're brothers with). and if you rush and don't feel like you don't want to be a part of any of it, then don't. make up your own mind. for me, i went to school saying that frats suck, im too much an individual for any of that crap, and that my studies are too important for any of that animal house style bullshit. next semester i ended up pledging TKE and it was one of the best decisions of my life. sure, i partied. sure i met a lot of people... but i still had friends outside of the greek world that i did things with, i still got good grades (that semester i ended up with a 3.8), and i was even in a relationship with one girl who cursed 'fratboys' up and down until she met me. you'll meet a lot of people in college. you will be exposed to a lot of things and a lot of ideas both good and bad. if i can myself give you one piece of advice it would be this: (no, not sunscreen), make up your own mind. form your own opinions. and don't be so quick to write off other people or their decisions.
there are no other 'little circles' that can be made on the map (as my EE101 prof was so fond of saying) therefore there are no further simplifications.
it's GD the graphics library, which is used by php to generate graphics... and even then you can look for an older version of libGD if you REALLY need to make GIF images... though in my opinion PNG is the better format.
The point is, the shortest path between two points IS NOT NP-COMPLETE therefore this isnt that big of a deal... while the original poster claimed it solved the NP-Complete Travelling Salesman Problem.
Input: A set C of n cities {c1,...,cn}; for each pair of cities (ci,cj) (1 Question: Is there an ordering of the n cities such that the value sum from i=1 to n-1 dpi(i),pi(i+1)+dpi(n),pi(1) is no more than B?
Comments: In effect what this problem is asking is whether there is a tour of the given collection of cities that visits each city exactly once and takes up total distance no more than B. There is a huge volume of literature concerning approximation methods, search heuristics, special case methods, etc for this very well studied problem. A bibliography has been compiled.
actually, a decision problem A is NP-Complete if every other problem in NP space is reducable to A. meaning that for any problem in NP space, there is a polynomial time algorithm which changes it into A... which is test by comparing the SAME input to A and the function modified by the polynomial time algorithm and showing them to result in the same truth table. (Cook, 1971). The TSP problem, a subset of the problems encompassed by computational complexity theory... In trying all possible routes, the number of given combinations is N! which is itself NP-Hard, but the decision aspect... given a the costs and the number of points is there a route cheaper than x? is NP Complete. For this and other TSP information, here's a good link you should review before accusing people of spouting 'complete bull'.
I am being stupid and talking out of my ass, the original post was about the Travelling salesman problem, which is npc... and I misread your post as being about the main post being non-npc -- i.e. this whole conversation was line noise. my bad.
let's reiterate - traveling salesman: np-complete
shortest path between two arbitrary points in a graph of n points - O(n^2)
You're right, thats for finding the shortest path between two arbitrary points on the graph, but I was arguing about the shortest path as it applies to the travelling salesman, which is an NP-Complete problem, finding the shortest path between two arbitrary points is (if my memory serves me correctly) just a P-hard problem).
the 'additional' constraints are the elements that comprise the travelling salesman problem... n^2 is for the dijkstra algorithm, again, an approximation of the correct solution without checking the total problem space... you seem to be misinformed, have you ever taken a course in combinatorics?
it's called leinthal's paradox -- the cost is NOT O(n^2) the cost is O((n-1)!) (http://konf2.ims.ac.jp/review/sec4.html) Djikstr a's algorithm merely simplifies the correct procedural solution by limiting the sample space (which introduces a possibility of error) -- it APPROXIMATES the solution because the exact calculation is NP-Complete... another reference: here
The travelling salesman finds the shortest path through a graph visiting every point exactly once... computationally one must try every possibility of routes in order to find the path with the least cost... which increases polynomially with respect to the number of points on the graph... classifying it as NP-Complete. What I don't understand is how this is actually a solution to this problem since wouldn't multiple electrodes trace a path to another electrode even if it was already connected? Therefore invalidating the solution by the definition (where the shortest path hits each point exactly ONCE)
one way to go about figuring it out, i would think, would be to remove the mac from the lan, turn on the lamp... does it wake up? if it does you can rule out WOL. If it doesn't, then it seems to be something on the network. Is the hub/switch plugged into the same surge protector as well as being perhaps too close? just step through the problem.
Mplayer which is an excellent Linux media player (including dvd support) also comes with an encoder called mencoder which can output Divx;) avi files from your dvds, supports 2 pass encoding and subtitles, and other fun stuff like that. It works (well) for me. Mplayer is a great player in my opinion and it supports almost every file format i've encountered excluding sorenson quicktime.
One more step in the 'Full-Disclosure' is bad camp seems to be trying to get their idea of responsibility standardized so they have some RFCs and STDs to point to in their argument. Yes, one should make a reasonable attempt at contacting a vendor, and yes it would be nice if every vendor was so helpful as to 'work with the Reporter' in solving the vulnerability. This doesnt work in practice hardly ever. This whole document is merely an echo of Microsoft's and @Stake's recent push towards limited disclosure and the occulation of vulnerabilities (see no evil). This concept is irresponsible and lazy. Just because I happen to be the first person to report a bug doesnt mean im the first to find it, nor does it mean that there are other people out there who are not actively exploiting it. It is my duty to disclose this information to the WHOLE community in as timely a fashion as possible so that the people who will be affected by this can find a work around or an alternative solution until a patch is issued. This RFC as it stands is much too pro-vendor and would do nothing but harm the security industry were it ever to be widely adopted as a working standard.
In the printing industry there has been a big trumpetting of a new dot layout
called Hexachrome. This takes the concept of the human eye's propensity
for blurring colors together and adjusts the traditional 3 dot 3 color priniting
layout to 6 dots with a red dot, a blue dot, and 4 different types of yellow/green.
Personally, this looks like a migration from paper to the computer
industry of this same technique which affords more vibrant colors and
cleaner details.
What is your role in the administration of the network? Shellcode for
penetration testing is asm (though you can arguably use code written
by others who do have the knowlege of asm you're lacking). Writing
any kind of lowlevel tools where speed is critical is asm. Debugging
any odd behavior of lUserland software is asm. Changing the paper in
the paper tray or pressing the on/off switch on the fileserver when it
misbehaves does not. You CAN get by without a knowledge of
assembler or any programming language at all, but I personally wouldnt
feel very comfortable with job security unless I was the boss's nephew
because the person who does know these things you deem as
unimportant WILL be better qualified and do a much better job that the
one who doesnt.
Of course this is just my own opinion based on my own observations,
take it as you will.
as if we didnt have enough patents already...
on
Patent Invention Machines
·
· Score: 2, Interesting
im actually more interesting in the solutions they are coming up with rather than if the results are patentable. this does bring up quite a few interesting AI problems (solutions?) on making computers duplicate (or perhaps surpass) human problem-solving methods (kind of reminds me of wargames).
Slashdot Mirror
Unless something's changed in the last week or two, they've already lost Starz (The Washington Post, CNN Money).
This comment hits the mark right on the head.
It was bad enough before how much content was actually available to stream versus by mail, especially compared to (not really competing, I guess alternative is more apropos) services e.g. XBL. Now that service is losing even more titles due to licensing issues with Starz. What terrible timing to try and spin a price increase as something consumers actually want, when the service you're charging more for is actually LOSING VALUE. This makes no sense on the face of it, especially in today's atmosphere of belt tightening and budget trimming.
I spent 10 minutes looking for my old login information just to see if I had mod points to promote this comment, alas I had none.
that, and to second your comment.
a lot of people look down on frats for no good reasons, a lot of people hold them in esteem for no great reason either. the best advice i can give to anyone, is don't listen to other people's opinions. wait a semester and see how life is like outside of greek life, rush multiple fraternities to get a feel for each (different organizations attract different types of people, don't get pressured into joining an organization, complete the pledge program, and find out that you hate the people you're brothers with). and if you rush and don't feel like you don't want to be a part of any of it, then don't. make up your own mind. for me, i went to school saying that frats suck, im too much an individual for any of that crap, and that my studies are too important for any of that animal house style bullshit. next semester i ended up pledging TKE and it was one of the best decisions of my life. sure, i partied. sure i met a lot of people... but i still had friends outside of the greek world that i did things with, i still got good grades (that semester i ended up with a 3.8), and i was even in a relationship with one girl who cursed 'fratboys' up and down until she met me. you'll meet a lot of people in college. you will be exposed to a lot of things and a lot of ideas both good and bad. if i can myself give you one piece of advice it would be this: (no, not sunscreen), make up your own mind. form your own opinions. and don't be so quick to write off other people or their decisions.
unless you have some insight into this, im not seeing how the additional operators would do it.
well, i cant seem to get it to line up... lets see it this way... wow, that was a PITA
000 0
001 0
010 0
011 1
100 0
101 1
110 1
111 1
(a & b) | (a & c) | (b & c ) | ((a & b) & c))
Karnaugh Mapping...
'a'b 'a b a'b a b
c _ x x x
'c _ _ _ x
so the simplifications that can be made....
(c & (a | b) ) | (a & b)
there are no other 'little circles' that can be made on the map (as my EE101 prof was so fond of saying) therefore there are no further simplifications.
it's GD the graphics library, which is used by php to generate graphics... and even then you can look for an older version of libGD if you REALLY need to make GIF images... though in my opinion PNG is the better format.
The point is, the shortest path between two points IS NOT NP-COMPLETE therefore this isnt that big of a deal... while the original poster claimed it solved the NP-Complete Travelling Salesman Problem.
can be found here for both USB v1 and v2
From http://www.csc.liv.ac.uk/~ped/teachadmin/COMP202/a nnotated_np.html -- a list of selected np-complete problems
Number: 27
Name: Travelling Salesman [ND22] 3-4
Input: A set C of n cities {c1,...,cn}; for each pair of cities (ci,cj) (1
Question: Is there an ordering of the n cities such that the value sum from i=1 to n-1 dpi(i),pi(i+1)+dpi(n),pi(1) is no more than B?
Comments: In effect what this problem is asking is whether there is a tour of the given collection of cities that visits each city exactly once and takes up total distance no more than B. There is a huge volume of literature concerning approximation methods, search heuristics, special case methods, etc for this very well studied problem. A bibliography has been compiled.
actually, a decision problem A is NP-Complete if every other problem in NP space is reducable to A. meaning that for any problem in NP space, there is a polynomial time algorithm which changes it into A... which is test by comparing the SAME input to A and the function modified by the polynomial time algorithm and showing them to result in the same truth table. (Cook, 1971). The TSP problem, a subset of the problems encompassed by computational complexity theory... In trying all possible routes, the number of given combinations is N! which is itself NP-Hard, but the decision aspect... given a the costs and the number of points is there a route cheaper than x? is NP Complete. For this and other TSP information, here's a good link you should review before accusing people of spouting 'complete bull'.
no text
I am being stupid and talking out of my ass, the original post was about the Travelling salesman problem, which is npc... and I misread your post as being about the main post being non-npc -- i.e. this whole conversation was line noise. my bad.
let's reiterate - traveling salesman: np-complete
shortest path between two arbitrary points in a graph of n points - O(n^2)
/me should go get some more caffeine
You're right, thats for finding the shortest path between two arbitrary points on the graph, but I was arguing about the shortest path as it applies to the travelling salesman, which is an NP-Complete problem, finding the shortest path between two arbitrary points is (if my memory serves me correctly) just a P-hard problem).
the 'additional' constraints are the elements that comprise the travelling salesman problem... n^2 is for the dijkstra algorithm, again, an approximation of the correct solution without checking the total problem space... you seem to be misinformed, have you ever taken a course in combinatorics?
it's called leinthal's paradox -- the cost is NOT O(n^2) the cost is O((n-1)!) (http://konf2.ims.ac.jp/review/sec4.html)r a's algorithm merely simplifies the correct procedural solution by limiting the sample space (which introduces a possibility of error) -- it APPROXIMATES the solution because the exact calculation is NP-Complete... another reference: here
Djikst
The travelling salesman finds the shortest path through a graph visiting every point exactly once... computationally one must try every possibility of routes in order to find the path with the least cost... which increases polynomially with respect to the number of points on the graph ... classifying it as NP-Complete. What I don't understand is how this is actually a solution to this problem since wouldn't multiple electrodes trace a path to another electrode even if it was already connected? Therefore invalidating the solution by the definition (where the shortest path hits each point exactly ONCE)
one way to go about figuring it out, i would think, would be to remove the mac from the lan, turn on the lamp... does it wake up? if it does you can rule out WOL. If it doesn't, then it seems to be something on the network. Is the hub/switch plugged into the same surge protector as well as being perhaps too close? just step through the problem.
Mplayer which is an excellent Linux media player (including dvd support) also comes with an encoder called mencoder which can output Divx;) avi files from your dvds, supports 2 pass encoding and subtitles, and other fun stuff like that. It works (well) for me. Mplayer is a great player in my opinion and it supports almost every file format i've encountered excluding sorenson quicktime.
One more step in the 'Full-Disclosure' is bad camp seems to be trying to get their idea of responsibility standardized so they have some RFCs and STDs to point to in their argument. Yes, one should make a reasonable attempt at contacting a vendor, and yes it would be nice if every vendor was so helpful as to 'work with the Reporter' in solving the vulnerability. This doesnt work in practice hardly ever. This whole document is merely an echo of Microsoft's and @Stake's recent push towards limited disclosure and the occulation of vulnerabilities (see no evil). This concept is irresponsible and lazy. Just because I happen to be the first person to report a bug doesnt mean im the first to find it, nor does it mean that there are other people out there who are not actively exploiting it. It is my duty to disclose this information to the WHOLE community in as timely a fashion as possible so that the people who will be affected by this can find a work around or an alternative solution until a patch is issued. This RFC as it stands is much too pro-vendor and would do nothing but harm the security industry were it ever to be widely adopted as a working standard.
In the printing industry there has been a big trumpetting of a new dot layout
called Hexachrome. This takes the concept of the human eye's propensity
for blurring colors together and adjusts the traditional 3 dot 3 color priniting
layout to 6 dots with a red dot, a blue dot, and 4 different types of yellow/green.
Personally, this looks like a migration from paper to the computer
industry of this same technique which affords more vibrant colors and
cleaner details.
What is your role in the administration of the network? Shellcode for
penetration testing is asm (though you can arguably use code written
by others who do have the knowlege of asm you're lacking). Writing
any kind of lowlevel tools where speed is critical is asm. Debugging
any odd behavior of lUserland software is asm. Changing the paper in
the paper tray or pressing the on/off switch on the fileserver when it
misbehaves does not. You CAN get by without a knowledge of
assembler or any programming language at all, but I personally wouldnt
feel very comfortable with job security unless I was the boss's nephew
because the person who does know these things you deem as
unimportant WILL be better qualified and do a much better job that the
one who doesnt.
Of course this is just my own opinion based on my own observations,
take it as you will.
im actually more interesting in the solutions they are coming up with rather than if the results are patentable. this does bring up quite a few interesting AI problems (solutions?) on making computers duplicate (or perhaps surpass) human problem-solving methods (kind of reminds me of wargames).
dude, what do you need 20gb for?
a pretty large security hole on anything but a single user system such as mine.