Abstract: Disclosed herein are systems and method for deduplicating malware scan attempts. In one exemplary aspect, a method may include: receiving, from a first computing device of a plurality of computing devices in a network, a first hash value of an object and a verdict of a malware scan performed on the object by the first computing device; storing the first hash value and the verdict in a shared verdict database; receiving, from a second computing device in the network, a verdict request including a second hash value; determining that the first hash value and the second hash value match; in response to determining the match, transmitting, to the second computing device, the verdict of the malware scan performed on the object by the first computing device, wherein the second computing device does not perform a redundant malware scan on the object.

Abstract: Disclosed herein are systems and method for automated malicious code replacement. In one exemplary aspect, a method may comprise scanning for malicious content in a file comprising a script written in an interpretable programming language, wherein the malicious content triggers malicious activity on a computing device that stores the file. The method may comprise detecting a malware injection in the file based on the scanning, wherein the malware injection comprises at least one operator that enables the malicious activity. The method may comprise identifying a benign operator that can replace the at least one operator to prevent execution of the malicious activity without causing a syntax error. The method may comprise updating the file by replacing the at least one operator with the benign operator.

Abstract: Roughly described, a method for numerically solving a system of equations of the form 0=F(X), for a solution vector X which involves choosing a starting value X0 and iterating Xn+1=Xn?[F?(Xn)+?nDiag F?(Xn)]?1F(Xn). In this iteration, at least one ?n is a number greater than 0. Preferably, ?n=min {?/n, [?n/(1+n?n)]?F(Xn)?}, where ? is a constant that remains fixed for all n, and ?n=?F(Xn)?/?F(Xn?1)?.

Abstract: Roughly described, a method for numerically solving a system of equations of the form 0=F(X), for a solution vector X which involves choosing a starting value X0 and iterating Xn+1=Xn?[F?(Xn)+?nDiagF?(Xn)]?1F(Xn). In this iteration, at least one ?n is a number greater than 0. Preferably, ?n=min{?/n, [?n/(1+n?n)]?F(Xn)?}, where ? is a constant that remains fixed for all n, and ?n=?F(Xn)?/?F(Xn?1)?.