Social networks allow rapid spread of ideas and.innovations while the negative information can also propagate.widely. When the cascades with different opinions reaching the.same user, the cascade arriving first is the most likely to be taken.by the user. Therefore, once misinformation or rumor is detected,.a natural containment method is to introduce a positive cascade.competing against the rumor. Given a budget k, the rumor.blocking problem asks for k seed users to trigger the spread of the.pos
2021-02-07 12:05:47
375KB
1
A Range-Based Monte Carlo Box Algorithm for Mobile Nodes Localization in WSNs
2021-02-07 12:05:46
1.15MB
1
AODV-Matlab：在MATLAB中模拟按需距离矢量（AODV）路由协议的仿真
2021-02-03 01:05:50
3.9MB
1
多标签
多算法的Rust实现
橙色点是多边形质心。 蓝绿色点是理想的标签位置。 红色框显示搜索空间。
您可以通过克隆此回购，切换到生成自己这个可视化的分公司，并打开 Jupyter笔记本电脑，然后通过细胞步进。 您还可以使用笔记本轻松显示自己的多边形。
如何使用
extern crate polylabel;
use polylabel :: polylabel;
extern crate geo;
use geo :: {Point, Polygon};
let coords = vec! [
( 0.0 , 0.0 ),
( 4.0 , 0.0 ),
( 4.0 , 1.0 ),
( 1.0 , 1.0 ),
( 1.0 , 4.0 ),
( 0.0 , 4.0 ),
( 0.0 , 0.0 )
];
let poly = Polygon :: new (coords. into (), vec! []);
let label_pos = polylabel ( & poly, & 0.10 );
// Point(0.5
2021-02-02 16:38:39
319KB
1
Liang-Barsky剪线算法
快速，破坏性实现。 它通过矩形裁剪2D线段。
这是对的改编，其简单性给我留下了深刻的印象。
API
破坏性的
var a = [ - 10 , - 10 ] , b = [ 10 , 10 ] ;
clip ( a , b , [ - 5 , - 5 , 5 , 5 ] ) ; // returns 1 - "clipped"
console . log ( a ) ; // [-5, -5]
console . log ( b ) ; // [5, 5]
无损
var a = [ - 10 , - 10 ] , b = [ 10 , 10 ] ;
var an = a . slice ( ) , bn = b . slice ( ) ;
clip ( a , b , [ - 5 , - 5 , 5 , 5 ] , an , bn ) ; // returns 1 - "clipped"
console . log ( an ) ; // [-5, -5]
cons
2021-02-02 16:38:16
519KB
1