The California haters are back. And once again, they get us all wrong
2 by ilamont | 0 comments on Hacker News.
Thursday, October 31, 2019
Wednesday, October 30, 2019
New vulnerability on the NVD: CVE-2010-0398
The init script in autokey before 0.61.3-2 allows local attackers to write to arbitrary files via a symlink attack.
Published at: October 31, 2019 at 03:45AM
View on website
Published at: October 31, 2019 at 03:45AM
View on website
New vulnerability on the NVD: CVE-2010-0737
A missing permission check was found in The CLI in JBoss Operations Network before 2.3.1 does not properly check permissions, which allows JBoss ON users to perform management tasks and configuration changes with the privileges of the administrator user.
Published at: October 31, 2019 at 04:45AM
View on website
Published at: October 31, 2019 at 04:45AM
View on website
New vulnerability on the NVD: CVE-2010-0747
drbd8 allows local users to bypass intended restrictions for certain actions via netlink packets, similar to CVE-2009-3725.
Published at: October 31, 2019 at 04:45AM
View on website
Published at: October 31, 2019 at 04:45AM
View on website
New vulnerability on the NVD: CVE-2010-0748
Transmission before 1.92 allows an attacker to cause a denial of service (crash) or possibly have other unspecified impact via a large number of tr arguments in a magnet link.
Published at: October 31, 2019 at 04:45AM
View on website
Published at: October 31, 2019 at 04:45AM
View on website
New vulnerability on the NVD: CVE-2010-0749
Transmission before 1.92 allows attackers to prevent download of a file by corrupted data during the endgame.
Published at: October 31, 2019 at 04:45AM
View on website
Published at: October 31, 2019 at 04:45AM
View on website
New vulnerability on the NVD: CVE-2010-1673
A cross-site scripting (XSS) vulnerability in ikiwiki before 3.20101112 allows remote attackers to inject arbitrary web script or HTML via a comment.
Published at: October 31, 2019 at 04:45AM
View on website
Published at: October 31, 2019 at 04:45AM
View on website
Tuesday, October 29, 2019
White House Ukraine Expert Sought to Correct Transcript of Trump Call
By BY JULIAN E. BARNES, NICHOLAS FANDOS AND DANNY HAKIM from NYT U.S. https://ift.tt/2BUttVr
via IFTTT
New vulnerability on the NVD: CVE-2010-2061
rpcbind 0.2.0 does not properly validate (1) /tmp/portmap.xdr and (2) /tmp/rpcbind.xdr, which can be created by an attacker before the daemon is started.
Published at: October 30, 2019 at 03:45AM
View on website
Published at: October 30, 2019 at 03:45AM
View on website
New vulnerability on the NVD: CVE-2010-2064
rpcbind 0.2.0 allows local users to write to arbitrary files or gain privileges via a symlink attack on (1) /tmp/portmap.xdr and (2) /tmp/rpcbind.xdr.
Published at: October 30, 2019 at 03:45AM
View on website
Published at: October 30, 2019 at 03:45AM
View on website
Despair for Many and Silver Linings for Some in California Wildfires
By BY THOMAS FULLER, JULIE TURKEWITZ AND JOSE A. DEL REAL from NYT U.S. https://ift.tt/32WbkCw
via IFTTT
Monday, October 28, 2019
New top story on Hacker News: Ask HN: I just wrote an O(N) diffing algorithm – what am I missing?
Ask HN: I just wrote an O(N) diffing algorithm – what am I missing?
7 by keithwhor | 5 comments on Hacker News.
Hey folks, I've been building a rendering engine for a code editor the past couple of days. Rendering huge chunks of highlighted syntax can get laggy. It's not worth switching to React at this stage, so I wanted to just write a quick diff algorithm that would selectively update only changed lines. I found this article: https://ift.tt/2lIuVkG With a link to this paper, the initial Git diff implementation: https://ift.tt/1GF9uI8 I couldn't find the PDF to start with, but read "edit graph" and immediately thought — why don't I just use a hashtable to store lines from LEFT_TEXT and references to where they are, then iterate over RIGHT_TEXT and return matches one by one, also making sure that I keep track of the last match to prevent jumbling? The algorithm I produced is only a few lines and seems accurate. It's O(N) time complexity, whereas the paper above gives a best case of O(ND) where D is minimum edit distance. function lineDiff (left, right) { left = left.split('\n'); right = right.split('\n'); let lookup = {}; // Store line numbers from LEFT in a lookup table left.forEach(function (line, i) { lookup[line] = lookup[line] || []; lookup[line].push(i); }); // Last line we matched var minLine = -1; return right.map(function (line) { lookup[line] = lookup[line] || []; var lineNumber = -1; if (lookup[line].length) { lineNumber = lookup[line].shift(); // Make sure we're looking ahead if (lineNumber > minLine) { minLine = lineNumber; } else { lineNumber = -1 } } return { value: line, from: lineNumber }; }); } RunKit link: https://ift.tt/2MTFXmv What am I missing? I can't find other references to doing diffing like this. Everything just links back to that one paper.
7 by keithwhor | 5 comments on Hacker News.
Hey folks, I've been building a rendering engine for a code editor the past couple of days. Rendering huge chunks of highlighted syntax can get laggy. It's not worth switching to React at this stage, so I wanted to just write a quick diff algorithm that would selectively update only changed lines. I found this article: https://ift.tt/2lIuVkG With a link to this paper, the initial Git diff implementation: https://ift.tt/1GF9uI8 I couldn't find the PDF to start with, but read "edit graph" and immediately thought — why don't I just use a hashtable to store lines from LEFT_TEXT and references to where they are, then iterate over RIGHT_TEXT and return matches one by one, also making sure that I keep track of the last match to prevent jumbling? The algorithm I produced is only a few lines and seems accurate. It's O(N) time complexity, whereas the paper above gives a best case of O(ND) where D is minimum edit distance. function lineDiff (left, right) { left = left.split('\n'); right = right.split('\n'); let lookup = {}; // Store line numbers from LEFT in a lookup table left.forEach(function (line, i) { lookup[line] = lookup[line] || []; lookup[line].push(i); }); // Last line we matched var minLine = -1; return right.map(function (line) { lookup[line] = lookup[line] || []; var lineNumber = -1; if (lookup[line].length) { lineNumber = lookup[line].shift(); // Make sure we're looking ahead if (lineNumber > minLine) { minLine = lineNumber; } else { lineNumber = -1 } } return { value: line, from: lineNumber }; }); } RunKit link: https://ift.tt/2MTFXmv What am I missing? I can't find other references to doing diffing like this. Everything just links back to that one paper.
With California Ablaze, Firefighters Strain to Keep Up
By BY TIM ARANGO, THOMAS FULLER, JOSE A. DEL REAL AND JACK HEALY from NYT U.S. https://ift.tt/2Nil2IQ
via IFTTT
Subscribe to:
Posts (Atom)