Function Call Graph Score for Malware Detection

Metamorphic malware changes its internal structure with each infection, while maintaining its core functionality. Detecting such malware is a challenging research problem. Function call graph analysis has previously shown promise in detecting such malware. In this research, we analyze the robustness of a function call graph score with respect to various code morphing strategies. We also consider modifications of the score that make it more robust in the face of such morphing

A note on Devaney\u27s definition of chaos

Devaney defines a function to be chaotic if it satisfies three conditions: transitivity, having dense set of periodic points and sensitive dependence on initial conditions. Banks et al prove that if the function is continuous then the third conditioin is implied from the first two and therefore is redundant. However, if the function is not assumed to be continuous, then it is not known if the third condition is redundant or not. In this note, without assuming the function is continuous, we prove that the third condition is redundant if the underlying topological space is not precompact

A simple proof of Euler\u27s continued fraction of e^{1/M}

A continued fraction is an expression of the form f0+ g0 f1+g1 f2+g2 and we will denote it by the notation [f0, (g0, f1), (g1, f2), (g2, f3), … ]. If the numerators gi are all equal to 1 then we will use a shorter notation [f0, f1, f2, f3, … ]. A simple continued fraction is a continued fraction with all the gi coefficients equal to 1 and with all the fi coefficients positive integers except perhaps f0. The finite continued fraction [f0, (g0, f1), (g1, f2),…, (gk –1, fk )] is called the kth convergent of the infinite continued fraction [f0, (g0, f1), (g1, f2),…]. We define [f0, (g0, f1), (g1, f2), (g2,f3),...] = lim [f0, (g0, f1), (g1, f2),..., (gk-1,fk)] if this limit exists and in this case we say that the infinite continued fraction converges