The security of smart mobile terminals has been an increasingly important issue in recent years. While there are extensive researches on virus detections for smart mobile terminals, most of them share the same framewo...
详细信息
The security of smart mobile terminals has been an increasingly important issue in recent years. While there are extensive researches on virus detections for smart mobile terminals, most of them share the same framework of virus detection as that for personal computers, and few of them tackle the problem from the standpoint of detection methodology. In this paper, we propose a behavior-based virus detection method for smart mobile terminals which signals the existence of malicious code through identifying the anomaly of user behaviors. We first propose a model to collect and analyze user behaviors and then present a polynomialtime algorithm for the virus detection. Next, we evaluate this algorithm by testing it with two commercial malwares and one malware written by ourselves and show that our algorithm enjoys a high virus detection rate. Finally, we notice that the rate of change of the virus detection rate of the algorithm with respect to thresholds matches the real-world situation of user behaviors, which indicates that the proposed algorithm is feasible.
This paper considers the general capacity expansion path problem (GCEP) for the telecommunication operators. We investigate the polynomial equivalence between the GCEP problem and the constrained shortest path problem...
详细信息
This paper considers the general capacity expansion path problem (GCEP) for the telecommunication operators. We investigate the polynomial equivalence between the GCEP problem and the constrained shortest path problem (CSP) and present a pseudopolynomial algorithm for the GCEP problem, no matter the graph is acyclic or not. Furthermore, we investigate two special versions of the GCEP problem. For the minimum number arc capacity expansion path problem (MN-CEP), we give a strongly polynomial algorithm based on the dynamic programming. For the minimum-cost capacity expansion shortest path problem (MCESP), we give a strongly polynomial algorithm by constructing a shortest paths network.
We investigate the bilinear Hilbert transform with oscillatory factors and the truncated bilinear Hilbert transform. The main result is that the L-p1 x L-p2 -> L-q-boundedness of the two operators is equivalent wit...
详细信息
We investigate the bilinear Hilbert transform with oscillatory factors and the truncated bilinear Hilbert transform. The main result is that the L-p1 x L-p2 -> L-q-boundedness of the two operators is equivalent with 1 <= p(1), p(2) < infinity, and 1/q = 1/p(1) + 1/p(2). In addition, we also discuss the boundedness of a variant operator of bilinear Hilbert transform with a nontrivial polynomial phase.
作者：
Vincent BerryDavid BryantEURISE
Département de Mathématiques Université de Saint-Etienne 23 Rue du Docteur Paul Michelon 42023 Saint-Etienne Cedex 2 France C.R.M. Université de Montréal
C.P. 6128 Succ. centre-ville Montréal (Québec) H3C 3J7
In this paper we consider a single machine scheduling problem, where for each of n jobs a release date, a processing time and a cost function are given and the maximum cost is to be minimized. Preemption is allowed an...
详细信息
暂无评论