搜索结果: 1-9 共查到“信息科学与系统科学 cycles”相关记录9条 . 查询时间(0.076 秒)
Using Stolen Computer Processing Cycles to Mine Bitcoin: Who Does It and How Much Do They Make?（图）
Mine Bitcoin Computer ProcessingCycles
2014/3/20
A team of computer scientists at the University of California, San Diego, has taken an unprecedented, in-depth look at how malware operators use the computers they infect to mine Bitcoin, a virtual cu...
Use of Hamiltonian Cycles in Cryptograph
Diffie-Hellman key exchange Symmetric key RSA PKI SSL/TLS VPN Hamiltonian cycle
2011/9/9
Abstract: In cryptography, key distribution is always an important issue in establishing a symmetric key. The famous method of exchanging keys, Diffie-Hellman key exchange, is also vulnerable to a man...
NON-EXISTENCE OF SINGULAR CYCLES IN AQUADRIC DIFFERENTIAL SYSTEM WITH FINE FOCUS OF ORDER THREE
Homodinic heteroclinic centre-focus cr
2007/12/17
The problem of existence or non-existence of singular cycles (or komoclinic loops and keteroclinic cydes as being termed in the modern literature of nonlinear dyndric systems) is one of the most impor...
Let G be a connected graph of order of n, and NC2(G) denote min{|N(u) ∪ N(v)| dist(u, v) = 2}, where dist(u, v) is the distance between u and v in G. A cycle C is called a dominating cycle if every co...
摘要 Let G be a connected graph of order n, and NC2(G) denote min{|N(u)\cup (v) |: dist(u,v) = 2}, where dist(u,v) is the distance between u and v in G. A cycle C in Gis called a dominatiny cycle, if V(...
A graph G is called A-cordial if there is a vertex labelling f of G with elements from A...
M. Matthews and D. Sumner proved that if G is a 2-connected claw-free graph of order n, then c(G)\geq \min{2δ + 4, n}. In this paper, we prove that if G is a 2-connected claw-free graph on n venices, ...
ON THE BOUNDEDNESS OF SOLUTIONS,EXISTENCE AND UNIQUENESS OF LIMIT CYCLES FOR A CLASS OF CUBIC DIFFERENTIAL SYSTEM
Boundedness of solutions limit cycle exi
2007/8/7
In this paper, we discuss the boundedness of the solutions, the existence and the uniqueness of the limit cycle of the following cubic differential system: x'=y, y'=-x+δy+a_2xy+a_4x+a_5x~2y. (*) We ob...
It is proved that for k≥71, the circumference c(G)of a 3-connected k-regular graphG on n vertices is at least min{|G|,3k+5}. This result is essentially best possible.