umu.sePublications

References$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_upper_j_idt147",{id:"formSmash:upper:j_idt147",widgetVar:"widget_formSmash_upper_j_idt147",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:upper:referencesLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_upper_j_idt148_j_idt150",{id:"formSmash:upper:j_idt148:j_idt150",widgetVar:"widget_formSmash_upper_j_idt148_j_idt150",target:"formSmash:upper:j_idt148:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});

Probability calculus for silent elimination: A method for medium access controlPrimeFaces.cw("AccordionPanel","widget_formSmash_some",{id:"formSmash:some",widgetVar:"widget_formSmash_some",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_all",{id:"formSmash:all",widgetVar:"widget_formSmash_all",multiple:true});
function selectAll()
{
var panelSome = $(PrimeFaces.escapeClientId("formSmash:some"));
var panelAll = $(PrimeFaces.escapeClientId("formSmash:all"));
panelAll.toggle();
toggleList(panelSome.get(0).childNodes, panelAll);
toggleList(panelAll.get(0).childNodes, panelAll);
}
/*Toggling the list of authorPanel nodes according to the toggling of the closeable second panel */
function toggleList(childList, panel)
{
var panelWasOpen = (panel.get(0).style.display == 'none');
// console.log('panel was open ' + panelWasOpen);
for (var c = 0; c < childList.length; c++) {
if (childList[c].classList.contains('authorPanel')) {
clickNode(panelWasOpen, childList[c]);
}
}
}
/*nodes have styleClass ui-corner-top if they are expanded and ui-corner-all if they are collapsed */
function clickNode(collapse, child)
{
if (collapse && child.classList.contains('ui-corner-top')) {
// console.log('collapse');
child.click();
}
if (!collapse && child.classList.contains('ui-corner-all')) {
// console.log('expand');
child.click();
}
}
PrimeFaces.cw("AccordionPanel","widget_formSmash_responsibleOrgs",{id:"formSmash:responsibleOrgs",widgetVar:"widget_formSmash_responsibleOrgs",multiple:true}); 2007 (English)Report (Other academic)
##### Abstract [en]

##### Place, publisher, year, edition, pages

Umeå: Umeå universitet , 2007. , 20 p.
##### Series

Research report in mathematical statistics, ISSN 1653-0829 ; 2007:3
##### Keyword [en]

Urn problem, geometric distribution, medium access control, random walk, silent period, probability generating function, recursion, exponential generating function, periodic asymptotic distribution
##### National Category

Probability Theory and Statistics
##### Identifiers

URN: urn:nbn:se:umu:diva-8388OAI: oai:DiVA.org:umu-8388DiVA: diva2:148059
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt388",{id:"formSmash:j_idt388",widgetVar:"widget_formSmash_j_idt388",multiple:true});
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt394",{id:"formSmash:j_idt394",widgetVar:"widget_formSmash_j_idt394",multiple:true});
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt400",{id:"formSmash:j_idt400",widgetVar:"widget_formSmash_j_idt400",multiple:true});
Available from: 2008-01-20 Created: 2008-01-20 Last updated: 2014-03-19Bibliographically approved

A probability problem arising in the context of medium access control in wireless networks is considered. It is described as a problem with n urns, each one having one ball at time 0. Each ball leaves its urn after a geometrically distributed time. Then there is a first time T such that no departures take place at the times T +1, T +2, . . . , T +k, where k is fixed. The focus is on the probability distribution of (XT , ST , T), where XT is the number of balls that leave their urns at time T and ST is the number of balls remaining there at that time. Efficient recursion formulas are derived. Asymptotics and continuous time approximations are considered. For k = ∞, T is the maximum of n geometrically distributed variables. This case has earlier got a large literature.

References$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_lower_j_idt1106",{id:"formSmash:lower:j_idt1106",widgetVar:"widget_formSmash_lower_j_idt1106",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:lower:referencesLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_lower_j_idt1107_j_idt1109",{id:"formSmash:lower:j_idt1107:j_idt1109",widgetVar:"widget_formSmash_lower_j_idt1107_j_idt1109",target:"formSmash:lower:j_idt1107:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});