Game-­theoretic Resource Allocation with Real-­time Probabilistic Surveillance Information

Game-theoretic security resource allocation problems have generated significant interest in the area of designing and developing security systems. These approaches traditionally utilize the Stackelberg game model for security resource scheduling in order to improve the protection of critical assets. The basic assumption in Stackelberg games is that a defender will act first, then an attacker will choose their best response after observing the defender’s strategy commitment (e.g., protecting a specific asset). Thus, it requires an attacker’s full or partial observation of a defender’s strategy. This assumption is unrealistic in real-time threat recognition and prevention. In this paper, we propose a new solution concept (i.e., a method to predict how a game will be played) for deriving the defender’s optimal strategy based on the principle of acceptable costs of minimax regret. Moreover, we demonstrate the advantages of this solution concept by analyzing its properties.

Bandwidth allocation in hexagonal wireless sensor networks for real-time communications

We present an algorithm for bandwidth allocation for delay-sensitive traffic in multi-hop wireless sensor networks. Our solution considers both periodic as well as aperiodic real-time traffic in an unified manner. We also present a distributed MAC protocol that conforms to the bandwidth allocation and thus satisfies the latency requirements of realtime traffic. Additionally, the protocol provides best-effort service to non real-time traffic. We derive the utilization bounds of our MAC protocol.

GTS allocation analysis in IEEE 802.15.4 for real-time wireless sensor networks

The IEEE 802.15.4 protocol proposes a flexible communication solution for Low-Rate Wireless Personal Area Networks including sensor networks. It presents the advantage to fit different requirements of potential applications by adequately setting its parameters. When enabling its beacon mode, the protocol makes possible real-time guarantees by using its Guaranteed Time Slot (GTS) mechanism. This paper analyzes the performance of the GTS allocation mechanism in IEEE 802.15.4. The analysis gives a full understanding of the behavior of the GTS mechanism with regards to delay and throughput metrics. First, we propose two accurate models of service curves for a GTS allocation as a function of the IEEE 802.15.4 parameters. We then evaluate the delay bounds guaranteed by an allocation of a GTS using Network Calculus formalism. Finally, based on the analytic results, we analyze the impact of the IEEE 802.15.4 parameters on the throughput and delay bound guaranteed by a GTS allocation. The results of this work pave the way for an efficient dimensioning of an IEEE 802.15.4 cluster.

Bandwidth allocation based on real time calculations using the convolution approach

This paper focuses on one of the methods for bandwidth allocation in an ATM network: the convolution approach. The convolution approach permits an accurate study of the system load in statistical terms by accumulated calculations, since probabilistic results of the bandwidth allocation can be obtained. Nevertheless, the convolution approach has a high cost in terms of calculation and storage requirements. This aspect makes real-time calculations difficult, so many authors do not consider this approach. With the aim of reducing the cost we propose to use the multinomial distribution function: the enhanced convolution approach (ECA). This permits direct computation of the associated probabilities of the instantaneous bandwidth requirements and makes a simple deconvolution process possible. The ECA is used in connection acceptance control, and some results are presented

Learning and natal host influence host preference, handling time and sex allocation behaviour in a pupal parasitoid

The host choice and sex allocation decisions of a foraging female parasitoid will have an enormous influence on the life-history characteristics of her offspring. The pteromalid Pachycrepoideus vindemiae is a generalist idiobiont pupal parasitoid of many species of cyclorrhaphous Diptera. Wasps reared in Musca domestica were larger, had higher attack rates and greater male mating success than those reared in Drosophila melanogaster. In no-choice situations, naive female R vindemiae took significantly less time to accept hosts conspecific with their natal host. Parasitoids that emerged from M. domestica pupae spent similar amounts of time ovipositing in both D. melanogaster and M. domestica. Those parasitoids that had emerged from D. melanogaster spent significantly longer attacking M. domestica pupae. The host choice behaviour of female P. vindemiae was influenced by an interaction between natal host and experience. Female R vindemiae reared in M. domestica only showed a preference among hosts when allowed to gain experience attacking M. domestica, preferentially attacking that species. Similarly, female parasitoids reared on D. melanogaster only showed a preference among hosts when allowed to gain experience attacking D. melanogaster, again preferentially attacking that species. Wasp natal host also influenced sex allocation behaviour. While wasps from both hosts oviposited more females in the larger host, M. domestica, wasps that emerged from M. domestica had significantly more male-biased offspring sex ratios. These results indicate the importance of learning and natal host size in determining R vindemiae attack rates. mating success, host preference and sex allocation behaviour, all critical components of parasitoid fitness.

Power allocation strategies for distributed space-time codes in two-way relay networks

We study a two-way relay network (TWRN), where distributed space-time codes are constructed across multiple relay terminals in an amplify-and-forward mode. Each relay transmits a scaled linear combination of its received symbols and their conjugates,with the scaling factor chosen based on automatic gain control. We consider equal power allocation (EPA) across the relays, as well as the optimal power allocation (OPA) strategy given access to instantaneous channel state information (CSI). For EPA, we derive an upper bound on the pairwise-error-probability (PEP), from which we prove that full diversity is achieved in TWRNs. This result is in contrast to one-way relay networks, in which case a maximum diversity order of only unity can be obtained. When instantaneous CSI is available at the relays, we show that the OPA which minimizes the conditional PEP of the worse link can be cast as a generalized linear fractional program, which can be solved efficiently using the Dinkelback-type procedure.We also prove that, if the sum-power of the relay terminals is constrained, then the OPA will activate at most two relays.

Extended theory about the allocation of time: Description and application to the increase in the retirement age policies

This paper revises mainstream economic models which include time use in an explicit and endogenous manner, suggesting a extended theory which escape from the main problem existing in the literature. In order to do it, we start by presenting in section 2 the mainstream time use models in economics, showing their main features. Once this is done, we introduce the reader in the main problems this kind of well established models imply, within section 3, being the most highlighted the problem of joint production. Subsequently, we propose an extended theory which solves the problem of joint production; this is extensively described in section 4. Last, but not least, we apply this model to offer a time use analysis of the effect of a policy which increases the retirement age in a life-cycle perspective for a representative individual.

Storage allocation module for a time sharing system,

"Supported in part by the Atomic Energy Commission under Contract no. US AEC AT(11-1) 1018."

Portfolio size effect in retirement accounts : what does it imply for lifecycle asset allocation funds?

Lifecycle funds offered by retirement plan providers allocate aggressively to risky asset classes when the employee participants are young, gradually switching to more conservative asset classes as they grow older and approach retirement. This approach focuses on maximizing growth of the accumulation fund in the initial years and preserving its value in the later years. The authors simulate terminal wealth outcomes based on conventional lifecycle asset allocation rules as well as on contrarian strategies that reverse the direction of asset switching. The evidence suggests that the growth in portfolio size over time significantly impacts the asset allocation decision. Due to the portfolio size effect that is observed by the authors, the terminal value of accumulation in retirement accounts is influenced more by the asset allocation strategy adopted in later years relative to that adopted in early years. By mechanistically switching to conservative assets in the later years of a plan, lifecycle strategies sacrifice significant growth opportunity and prove counterproductive to the participant's wealth accumulation objective. The authors' conclude that this sacrifice does not seem to be compensated adequately in terms of reducing the risk of potentially adverse outcomes.

Optimal allocation and sizing of DGs in a distribution system using PSO

In this paper, the optimal allocation and sizing of distributed generators (DGs) in a distribution system is studied. To achieve this goal, an optimization problem should be solved in which the main objective is to minimize the DGs cost and to maximise the reliability simultaneously. The active power balance between loads and DGs during the isolation time is used as a constraint. Another point considered in this process is the load shedding. It means that if the summation of DGs active power in a zone, isolated by the sectionalizers because of a fault, is less than the total active power of loads located in that zone, the program start shedding the loads in one-by-one using the priority rule still the active power balance is satisfied. This assumption decreases the reliability index, SAIDI, compared with the case loads in a zone are shed when total DGs power is less than the total load power. To validate the proposed method, a 17-bus distribution system is employed and the results are analysed.

QoS-oriented sesource allocation and scheduling of multiple composite web services in a hybrid cloud using a random-key genetic algorithm

In cloud computing resource allocation and scheduling of multiple composite web services is an important challenge. This is especially so in a hybrid cloud where there may be some free resources available from private clouds but some fee-paying resources from public clouds. Meeting this challenge involves two classical computational problems. One is assigning resources to each of the tasks in the composite web service. The other is scheduling the allocated resources when each resource may be used by more than one task and may be needed at different points of time. In addition, we must consider Quality-of-Service issues, such as execution time and running costs. Existing approaches to resource allocation and scheduling in public clouds and grid computing are not applicable to this new problem. This paper presents a random-key genetic algorithm that solves new resource allocation and scheduling problem. Experimental results demonstrate the effectiveness and scalability of the algorithm.

Bottlenecks detection of track allocation schemes at rail stations by Petri nets

Robustness of the track allocation problem is rarely addressed in literatures and the obtained track allocation schemes (TAS) embody some bottlenecks. Therefore, an approach to detect bottlenecks is needed to support local optimization. First a TAS is transformed to an executable model by Petri nets. Then disturbances analysis is performed using the model and the indicators of the total trains' departure delays are collected to detect bottlenecks when each train suffers a disturbance. Finally, the results of the tests based on a rail hub linking six lines and a TAS about thirty minutes show that the minimum buffer time is 21 seconds and there are two bottlenecks where the buffer times are 57 and 44 seconds respectively, and it indicates that the bottlenecks do not certainly locate at the area where there is minimum buffer time. The proposed approach can further support selection of multi schemes and robustness optimization.

Facilitating needs based cancer care for people with a chronic disease : evaluation of an intervention using a multi-centre interrupted time series design

Background: Palliative care should be provided according to the individual needs of the patient, caregiver and family, so that the type and level of care provided, as well as the setting in which it is delivered, are dependent on the complexity and severity of individual needs, rather than prognosis or diagnosis. This paper presents a study designed to assess the feasibility and efficacy of an intervention to assist in the allocation of palliative care resources according to need, within the context of a population of people with advanced cancer. ---------- Methods/design: People with advanced cancer and their caregivers completed bi-monthly telephone interviews over a period of up to 18 months to assess unmet needs, anxiety and depression, quality of life, satisfaction with care and service utilisation. The intervention, introduced after at least two baseline phone interviews, involved a) training medical, nursing and allied health professionals at each recruitment site on the use of the Palliative Care Needs Assessment Guidelines and the Needs Assessment Tool: Progressive Disease - Cancer (NAT: PD-C); b) health professionals completing the NAT: PD-C with participating patients approximately monthly for the rest of the study period. Changes in outcomes will be compared pre-and post-intervention.---------- Discussion: The study will determine whether the routine, systematic and regular use of the Guidelines and NAT: PD-C in a range of clinical settings is a feasible and effective strategy for facilitating the timely provision of needs based care.

QoS-oriented resource allocation and scheduling of multiple composite Web services in a hybrid cloud using a random-key genetic algorithm

In cloud computing resource allocation and scheduling of multiple composite web services is an important challenge. This is especially so in a hybrid cloud where there may be some free resources available from private clouds but some fee-paying resources from public clouds. Meeting this challenge involves two classical computational problems. One is assigning resources to each of the tasks in the composite web service. The other is scheduling the allocated resources when each resource may be used by more than one task and may be needed at different points of time. In addition, we must consider Quality-of-Service issues, such as execution time and running costs. Existing approaches to resource allocation and scheduling in public clouds and grid computing are not applicable to this new problem. This paper presents a random-key genetic algorithm that solves new resource allocation and scheduling problem. Experimental results demonstrate the effectiveness and scalability of the algorithm.