Java MeetingProbabilitySet类代码示例

OStack程序员社区-中国程序员成长平台 › 门户 › 编程› Java›Java编程经验

原作者: [db:作者] 来自: [db:来源] 收藏邀请

本文整理汇总了Java中routing.maxprop.MeetingProbabilitySet类的典型用法代码示例。如果您正苦于以下问题：Java MeetingProbabilitySet类的具体用法？Java MeetingProbabilitySet怎么用？Java MeetingProbabilitySet使用的例子？那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。

MeetingProbabilitySet类属于routing.maxprop包，在下文中一共展示了MeetingProbabilitySet类的11个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于我们的系统推荐出更棒的Java代码示例。

示例1: setUp

import routing.maxprop.MeetingProbabilitySet; //导入依赖的package包/类
public void setUp() throws Exception {
	super.setUp();
	core.NetworkInterface.reset();
	core.DTNHost.reset();
	TestUtils tu = new TestUtils(null, null, new TestSettings());
	msets = new ArrayList<MeetingProbabilitySet>();
	mapping = new HashMap<Integer, MeetingProbabilitySet>();
	hostsSet = new HashSet<DTNHost>();
	
	for (int i=0; i<NROF_HOSTS; i++) {
		DTNHost host = tu.createHost();
		MeetingProbabilitySet set = new MeetingProbabilitySet(
				MeetingProbabilitySet.INFINITE_SET_SIZE, 1.0);
		msets.add(set);
		hostsSet.add(host);
		mapping.put(host.getAddress(), set);
	}
			
	mpd = new MaxPropDijkstra(mapping);
	targets = new HashSet<Integer>();
}

开发者ID:MaX121，项目名称:Bachelor-Thesis，代码行数:22，代码来源:MaxPropDijkstraTest.java

示例2: testProbabilityValuesFromThePaper

import routing.maxprop.MeetingProbabilitySet; //导入依赖的package包/类
/**
 * Tests the values that are given as an example in the original paper
 */
public void testProbabilityValuesFromThePaper() {		
	List<Integer> nodes = new ArrayList<Integer>();
	nodes.add(1);
	nodes.add(2);
	nodes.add(3);
	nodes.add(4);
	double unknownProb = 1.0/nodes.size();
	
	MeetingProbabilitySet mps = new MeetingProbabilitySet(1.0,nodes);
	assertEquals(unknownProb, mps.getProbFor(1));
	assertEquals(unknownProb, mps.getProbFor(2));
	
	mps.updateMeetingProbFor(1); // h0 meets h1

	assertEquals(0.625, mps.getProbFor(1));
	assertEquals(0.125, mps.getProbFor(2));	
}

开发者ID:MaX121，项目名称:Bachelor-Thesis，代码行数:21，代码来源:MaxPropDijkstraTest.java

示例3: setUp

import routing.maxprop.MeetingProbabilitySet; //导入依赖的package包/类
public void setUp() throws Exception {
	super.setUp();
	core.NetworkInterface.reset();
	core.DTNHost.reset();
	TestUtils tu = new TestUtils(null, null, new TestSettings());
	msets = new ArrayList<MeetingProbabilitySet>();
	mapping = new HashMap<Integer, MeetingProbabilitySet>();
	hostsSet = new HashSet<DTNHost>();

	for (int i=0; i<NROF_HOSTS; i++) {
		DTNHost host = tu.createHost();
		MeetingProbabilitySet set = new MeetingProbabilitySet(
				MeetingProbabilitySet.INFINITE_SET_SIZE, 1.0);
		msets.add(set);
		hostsSet.add(host);
		mapping.put(host.getAddress(), set);
	}

	mpd = new MaxPropDijkstra(mapping);
	targets = new HashSet<Integer>();
}

开发者ID:raveious，项目名称:delay-tolerant-network，代码行数:22，代码来源:MaxPropDijkstraTest.java

示例4: testProbabilityValuesFromThePaper

import routing.maxprop.MeetingProbabilitySet; //导入依赖的package包/类
/**
 * Tests the values that are given as an example in the original paper
 */
public void testProbabilityValuesFromThePaper() {
	List<Integer> nodes = new ArrayList<Integer>();
	nodes.add(1);
	nodes.add(2);
	nodes.add(3);
	nodes.add(4);
	double unknownProb = 1.0/nodes.size();

	MeetingProbabilitySet mps = new MeetingProbabilitySet(1.0,nodes);
	assertEquals(unknownProb, mps.getProbFor(1));
	assertEquals(unknownProb, mps.getProbFor(2));

	mps.updateMeetingProbFor(1); // h0 meets h1

	assertEquals(0.625, mps.getProbFor(1));
	assertEquals(0.125, mps.getProbFor(2));
}

开发者ID:raveious，项目名称:delay-tolerant-network，代码行数:21，代码来源:MaxPropDijkstraTest.java

示例5: MaxPropRouterWithEstimation

import routing.maxprop.MeetingProbabilitySet; //导入依赖的package包/类
/**
 * Copy constructor. Creates a new router based on the given prototype.
 * @param r The router prototype where setting values are copied from
 */
protected MaxPropRouterWithEstimation(MaxPropRouterWithEstimation r) {
	super(r);
	this.alpha = r.alpha;
	this.timescale = r.timescale;
	this.probs = new MeetingProbabilitySet(
			MeetingProbabilitySet.INFINITE_SET_SIZE, this.alpha);
	this.allProbs = new HashMap<Integer, MeetingProbabilitySet>();
	this.dijkstra = new MaxPropDijkstra(this.allProbs);
	this.ackedMessageIds = new HashSet<String>();
	this.avgSamples = new int[BYTES_TRANSFERRED_AVG_SAMPLES];
	initMeetings();
}

开发者ID:MaX121，项目名称:Bachelor-Thesis，代码行数:17，代码来源:MaxPropRouterWithEstimation.java

示例6: updateTransitiveProbs

import routing.maxprop.MeetingProbabilitySet; //导入依赖的package包/类
/**
 * Updates transitive probability values by replacing the current 
 * MeetingProbabilitySets with the values from the given mapping
 * if the given sets have more recent updates.
 * @param p Mapping of the values of the other host
 */
private void updateTransitiveProbs(Map<Integer, MeetingProbabilitySet> p) {
	for (Map.Entry<Integer, MeetingProbabilitySet> e : p.entrySet()) {
		MeetingProbabilitySet myMps = this.allProbs.get(e.getKey()); 
		if (myMps == null || 
			e.getValue().getLastUpdateTime() > myMps.getLastUpdateTime() ) {
			this.allProbs.put(e.getKey(), e.getValue().replicate());
		}
	}
}

开发者ID:MaX121，项目名称:Bachelor-Thesis，代码行数:16，代码来源:MaxPropRouterWithEstimation.java

示例7: MaxPropRouter

import routing.maxprop.MeetingProbabilitySet; //导入依赖的package包/类
/**
 * Copy constructor. Creates a new router based on the given prototype.
 * @param r The router prototype where setting values are copied from
 */
protected MaxPropRouter(MaxPropRouter r) {
	super(r);
	this.alpha = r.alpha;
	this.probs = new MeetingProbabilitySet(probSetMaxSize, this.alpha);
	this.allProbs = new HashMap<Integer, MeetingProbabilitySet>();
	this.dijkstra = new MaxPropDijkstra(this.allProbs);
	this.ackedMessageIds = new HashSet<String>();
	this.avgSamples = new int[BYTES_TRANSFERRED_AVG_SAMPLES];
}

开发者ID:MaX121，项目名称:Bachelor-Thesis，代码行数:14，代码来源:MaxPropRouter.java

示例8: updateTransitiveProbs

import routing.maxprop.MeetingProbabilitySet; //导入依赖的package包/类
/**
 * Updates transitive probability values by replacing the current
 * MeetingProbabilitySets with the values from the given mapping
 * if the given sets have more recent updates.
 * @param p Mapping of the values of the other host
 */
private void updateTransitiveProbs(Map<Integer, MeetingProbabilitySet> p) {
	for (Map.Entry<Integer, MeetingProbabilitySet> e : p.entrySet()) {
		MeetingProbabilitySet myMps = this.allProbs.get(e.getKey());
		if (myMps == null ||
			e.getValue().getLastUpdateTime() > myMps.getLastUpdateTime() ) {
			this.allProbs.put(e.getKey(), e.getValue().replicate());
		}
	}
}

开发者ID:raveious，项目名称:delay-tolerant-network，代码行数:16，代码来源:MaxPropRouterWithEstimation.java

示例9: MaxPropRouter

import routing.maxprop.MeetingProbabilitySet; //导入依赖的package包/类
/**
 * Copy constructor. Creates a new router based on the given prototype.
 * @param r The router prototype where setting values are copied from
 */
protected MaxPropRouter(MaxPropRouter r) {
	super(r);
	this.alpha = r.alpha;
	this.probs = new MeetingProbabilitySet(probSetMaxSize, this.alpha);
	this.allProbs = new HashMap<Integer, MeetingProbabilitySet>();
	this.dijkstra = new MaxPropDijkstra(this.allProbs);
	this.ackedMessageIds = new HashSet<String>();
	this.avgSamples = new int[BYTES_TRANSFERRED_AVG_SAMPLES];
	this.sentMessages = new HashMap<DTNHost, Set<String>>();
}

开发者ID:raveious，项目名称:delay-tolerant-network，代码行数:15，代码来源:MaxPropRouter.java

示例10: testPath

import routing.maxprop.MeetingProbabilitySet; //导入依赖的package包/类
public void testPath() {
	targets.add(1);
	targets.add(2);
	targets.add(3);
	targets.add(4);
	targets.add(5);
	
	MeetingProbabilitySet mps0 = mapping.get(0);
	MeetingProbabilitySet mps1 = mapping.get(1);
	
	mps1.updateMeetingProbFor(2); // h1 meets h2
	assertEquals(1.0, mps1.getProbFor(2));

	mps1.updateMeetingProbFor(3); // h1 meets h3
	assertEquals(0.5, mps1.getProbFor(2));
	assertEquals(0.5, mps1.getProbFor(3));

	/* h4 meets h5 and h6 */
	mapping.get(4).updateMeetingProbFor(5);
	mapping.get(4).updateMeetingProbFor(6);
	
	mps1.updateMeetingProbFor(4); // h1 meets h4
	assertEquals(0.25, mps1.getProbFor(2));
	assertEquals(0.25, mps1.getProbFor(3));
	assertEquals(0.5, mps1.getProbFor(4));
	
	mps0.updateMeetingProbFor(1); // h0 meets h1
	mps1.updateMeetingProbFor(0); // and vice versa
	assertEquals(1.0, mps0.getProbFor(1));
	assertEquals(0.5, mps1.getProbFor(0));
	assertEquals(0.125, mps1.getProbFor(2));
	assertEquals(0.125, mps1.getProbFor(3));
	assertEquals(0.25, mps1.getProbFor(4));
	
	mps1.updateMeetingProbFor(4); // h1 meets h4 again
	assertEquals(1.0, mps0.getProbFor(1)); // should stay the same
	assertEquals(0.25, mps1.getProbFor(0));
	assertEquals(0.0625, mps1.getProbFor(2));
	assertEquals(0.0625, mps1.getProbFor(3));
	assertEquals(0.625, mps1.getProbFor(4));
	
	Map<Integer, Double> result = mpd.getCosts(0, targets);
	
	assertEquals(0.0, result.get(1));
	assertEquals(1-0.0625, result.get(2));
	assertEquals(1-0.625, result.get(4));
	assertEquals( (1-0.625)+(1-0.5), result.get(5));
}

开发者ID:MaX121，项目名称:Bachelor-Thesis，代码行数:49，代码来源:MaxPropDijkstraTest.java

示例11: testPath

import routing.maxprop.MeetingProbabilitySet; //导入依赖的package包/类
public void testPath() {
	targets.add(1);
	targets.add(2);
	targets.add(3);
	targets.add(4);
	targets.add(5);

	MeetingProbabilitySet mps0 = mapping.get(0);
	MeetingProbabilitySet mps1 = mapping.get(1);

	mps1.updateMeetingProbFor(2); // h1 meets h2
	assertEquals(1.0, mps1.getProbFor(2));

	mps1.updateMeetingProbFor(3); // h1 meets h3
	assertEquals(0.5, mps1.getProbFor(2));
	assertEquals(0.5, mps1.getProbFor(3));

	/* h4 meets h5 and h6 */
	mapping.get(4).updateMeetingProbFor(5);
	mapping.get(4).updateMeetingProbFor(6);

	mps1.updateMeetingProbFor(4); // h1 meets h4
	assertEquals(0.25, mps1.getProbFor(2));
	assertEquals(0.25, mps1.getProbFor(3));
	assertEquals(0.5, mps1.getProbFor(4));

	mps0.updateMeetingProbFor(1); // h0 meets h1
	mps1.updateMeetingProbFor(0); // and vice versa
	assertEquals(1.0, mps0.getProbFor(1));
	assertEquals(0.5, mps1.getProbFor(0));
	assertEquals(0.125, mps1.getProbFor(2));
	assertEquals(0.125, mps1.getProbFor(3));
	assertEquals(0.25, mps1.getProbFor(4));

	mps1.updateMeetingProbFor(4); // h1 meets h4 again
	assertEquals(1.0, mps0.getProbFor(1)); // should stay the same
	assertEquals(0.25, mps1.getProbFor(0));
	assertEquals(0.0625, mps1.getProbFor(2));
	assertEquals(0.0625, mps1.getProbFor(3));
	assertEquals(0.625, mps1.getProbFor(4));

	Map<Integer, Double> result = mpd.getCosts(0, targets);

	assertEquals(0.0, result.get(1));
	assertEquals(1-0.0625, result.get(2));
	assertEquals(1-0.625, result.get(4));
	assertEquals( (1-0.625)+(1-0.5), result.get(5));
}

开发者ID:raveious，项目名称:delay-tolerant-network，代码行数:49，代码来源:MaxPropDijkstraTest.java

注：本文中的routing.maxprop.MeetingProbabilitySet类示例整理自Github/MSDocs等源码及文档管理平台，相关代码片段筛选自各路编程大神贡献的开源项目，源码版权归原作者所有，传播和使用请参考对应项目的License；未经允许，请勿转载。

鲜花

握手

雷人

路过

鸡蛋

该文章已有0人参与评论

请发表评论

全部评论

专题导读

More+

10-27 六六分期app的软件客服如何联系？(六六分期

11-06 可心卡盟:win10系统火狐flash插件崩溃怎么

11-06 亲亲特价:怎么删除回收站图标

11-06 济南大学虚拟社区:鲁大师节能降温的具体办

11-06 xlueops.exe:无线网络安装向导

11-06 女斗合众国:win7系统cf与主机连接不稳定怎

11-06 0xc000022-[cf烟雾头]cf怎么调烟雾头

11-06 qizideyouhuo:应用程序无法正常启动0xc0000

11-06 ipz-185:win7系统vcf文件怎么打开

11-06 傻哥蹦迪:win10系统s4怎么打开usb调试

11-06 八神浩树gtaste:回收站清空了怎么恢复

11-06 妖尾之黑色守护:win10系统电脑没有1440x900

11-06 校园至尊魔王小说:win7系统浏览网页时字体

11-06 女斗合众国:win10系统访问共享文件夹提示请

11-06 tokyo hot n0654:恢复win7系统默认字体一招

11-06 雨酷仙境:设置win7系统转移临时文件夹腾出

11-06 阿穆纳伊之杖:win7系统开始菜单在右边还原

11-06 tunespotting:win10系统火狐flash插件总是

11-06 甘尔葛分析师：计谋网站seo关键词暴涨有什

11-06 蔡贵霖: 计谋网站seo关键词暴涨有什么秘密

11-06 博益网首页:ao3网页版进入不了解决方法

11-06 漏斗子专栏: 网站数据分析小白易懂精华篇

11-06 见证双虹怎么做:win7系统开启telnet命令的

11-06 颾狐蝶蜋:系统资源不足无法完成请求的服务

11-06 国光中学校歌:提交网站到alexa查询详细步骤

11-06 西安有情天:静态网页和动态网页的区别

11-06 红木雅尚斋:外部链接构造对网站的好处

11-06 前官礼遇：防止域名劫持–增强域安全性的10

11-06 密传二转答案: 中文分词算法有哪些

11-06 金泉家园邮编:百度快照劫持的表现及应对方

Java LinkInfo类代码示例发布时间：2022-05-23

Java JRDesignSubreport类代码示例发布时间：2022-05-23

剪的笔顺,诠释剪的笔画,认识剪的部首

1 六六分期app的软件客服如何联系？(六六分期

六六分期app的软件客服如何联系？不知道吗？加qq群【895510560】即可！标题：六六分期

阅读：18936|2023-10-27

2 可心卡盟:win10系统火狐flash插件崩溃怎么

今天小编告诉大家如何处理win10系统火狐flash插件总是崩溃的问题，可能很多用户都不知

阅读：9908|2022-11-06

3 亲亲特价:怎么删除回收站图标

今天小编告诉大家如何对win10系统删除桌面回收站图标进行设置，可能很多用户都不知道

阅读：8299|2022-11-06

4 济南大学虚拟社区:鲁大师节能降温的具体办

今天小编告诉大家如何对win10系统电脑设置节能降温的设置方法，想必大家都遇到过需要

阅读：8658|2022-11-06

5 xlueops.exe:无线网络安装向导

我们在使用xp系统的过程中,经常需要对xp系统无线网络安装向导设置进行设置，可能很多

阅读：8594|2022-11-06

6 女斗合众国:win7系统cf与主机连接不稳定怎

今天小编告诉大家如何处理win7系统玩cf老是与主机连接不稳定的问题，可能很多用户都不

阅读：9601|2022-11-06

7 0xc000022-[cf烟雾头]cf怎么调烟雾头

电脑对日常生活的重要性小编就不多说了，可是一旦碰到win7系统设置cf烟雾头的问题，很

阅读：8584|2022-11-06

8 qizideyouhuo:应用程序无法正常启动0xc0000

我们在日常使用电脑的时候，有的小伙伴们可能在打开应用的时候会遇见提示应用程序无法

阅读：7972|2022-11-06

9 ipz-185:win7系统vcf文件怎么打开

今天小编告诉大家如何对win7系统打开vcf文件进行设置，可能很多用户都不知道怎么对win

阅读：8593|2022-11-06

10 傻哥蹦迪:win10系统s4怎么打开usb调试

今天小编告诉大家如何对win10系统s4开启USB调试模式进行设置，可能很多用户都不知道怎

阅读：7513|2022-11-06

客服电话

电子邮件

Java MeetingProbabilitySet类代码示例

示例1: setUp

示例2: testProbabilityValuesFromThePaper

示例3: setUp

示例4: testProbabilityValuesFromThePaper

示例5: MaxPropRouterWithEstimation

示例6: updateTransitiveProbs

示例7: MaxPropRouter

示例8: updateTransitiveProbs

示例9: MaxPropRouter

示例10: testPath

示例11: testPath

请发表评论

全部评论

上一篇：

下一篇：

齐的笔顺,评释齐的笔画,讲解齐的部首

mikepj/XRG: System monitor for macOS.

appreciated/maven-springboot-electron: P

CVE-2022-36620

krishnakapil/MaterialSeachView: Android

剪的笔顺,诠释剪的笔画,认识剪的部首

六六分期app的软件客服如何联系？(六六分期

florent37/ViewAnimator: A fluent Android

florent37/Shrine-MaterialDesign2: implem

CVE-2020-36276

SimpleSoftwareIO/simple-sms: Send and re

关于我们

产品与服务

解决方案

139-2527-9053