Data Science (DS)
Browse by
Recent Submissions

A simple Bayesian linear excess relative risk model
(20170711)A new Bayesian Poisson relative risk model is proposed for displaying the excess relative risk associated to a unique exposure as a probability distribution in a closed form. The background risk can be modelled by a unique ... 
Detection of nontechnical losses in smart meter data based on load curve profiling and time series analysis
(Energy, 201706)The advent and progressive deployment of the socalled Smart Grid has unleashed a profitable portfolio of new possibilities for an efficient management of the lowvoltage distribution network supported by the introduction ... 
The weighted independent domination problem: ILP model and algorithmic approaches
(Lecture Notes in Computer Science, 20170601)This work deals with the socalled weighted independent domination problem, which is an N P hard combinatorial optimization problem in graphs. In contrast to previous theoretical work from the liter ature, this paper ... 
Evolutionary algorithms to optimize lowthrust trajectory design in spacecraft orbital precession mission
(IEEE Congress on Evolutionary Computation, 20170606)In space environment, perturbations make the spacecraft lose its predefined orbit in space. One of these undesirable changes is the inplane rotation of space orbit, denominated as orbital precession. To overcome this ... 
Modelling spatial trends in sorghum breeding field trials using a twodimensional Pspline mixed model
(Theoretical and Applied Genetics, 20170403)Adjustment for spatial trends in plant breeding field trials is essential for efficient evaluation and selection of genotypes. Current mixed model methods of spatial analysis are based on a multistep modelling process ... 
Comparison of two discrimination indexes in the categorisation of continuous predictors in timetoevent studies
(SORT (Statistics and Operations Research Transactions), 201704)The Cox proportional hazards model is the most widely used survival prediction model for analysing timetoevent data. To measure the discrimination ability of a survival model the concordance probability index is widely ... 
An investigation of clustering strategies in manyobjective optimization: the IMulti algorithm as a case study
(Swarm Intelligence, 20170330)A variety of general strategies have been applied to enhance the performance of multiobjective optimization algorithms for manyobjective optimization problems (those with more than three objectives). One of these strategies ... 
Effect of trampling and digging from shell shing on Zostera noltei (Zosteraceae) intertidal seagrass beds
(Scientia Marina, 201703)Seagrass beds are among the most valuable ecosystems in the world but they are also among the ones most affected by human activities, and they have decreased significantly in recent decades. In many areas, such as in the ... 
Opportunistic schedulers for optimal scheduling of flows in wireless systems with ARQ feedback
(Final Program  2012 24th International Teletraffic Congress, ITC 24, 20121231)In this paper we study three opportunistic schedulers for the problem of optimal multiclass flowlevel scheduling in wireless downlink and uplink systems. For user channels we employ the GilbertElliot model of good and ... 
Optimal anticipative congestion control of flows with timevarying input stream
(Performance Evaluation, 20121231)This paper is concerned with a new type of congestion control method that we call anticipative congestion control, which exploits probabilistic information available at a network node about congestion at other nodes. ... 
The price of forgetting in parallel and nonobservable queues
(Performance Evaluation, 20111231)We consider a brokerbased network of nonobservable parallel queues and analyze the minimum expected response time and the optimal routing policy when the broker has the memory of its previous routing decisions. We provide ... 
CCN interest forwarding strategy as MultiArmed Bandit model with delays
(NetGCoop 2012  6th International Conference on Network Games, Control and Optimization, 20121231)We consider Content Centric Network (CCN) interest forwarding problem as a MultiArmed Bandit (MAB) problem with delays. We investigate the transient behaviour of the εgreedy, tuned εgreedy and Upper Confidence Bound ... 
Closed queueing networks under congestion: Nonbottleneck independence and bottleneck convergence
(Mathematics of Operations Research, 20131231)We analyze the behavior of closed multiclass productform queueing networks when the number of customers grows to infinity and remains proportionate on each route (or class). First, we focus on the stationary behavior and ... 
Heavytraffic revenue maximization in parallel multiclass queues
(Performance Evaluation, 20131231)Motivated by revenue maximization in server farms with admission control, we investigate the optimal scheduling in parallel processorsharing queues. Incoming customers are distinguished in multiple classes and we define ... 
On the Gittins index in the M/G/1 queue
(Queueing Systems, 20091231)For an M/G/1 queue with the objective of minimizing the mean number of jobs in the system, the Gittins index rule is known to be optimal among the set of nonanticipating policies. We develop properties of the Gittins ... 
Optimal congestion control of TCP flows for internet routers
(Performance Evaluation Review, 20121231)In this work we address the problem of fast and fair transmission of flows in a router, which is a fundamental issue in networks like the Internet. We model the interaction between a TCP source and a bottleneck queue with ... 
Optimal policy for multiclass scheduling in a single server queue
(21st International Teletraffic Congress, ITC 21: Traffic and Performance Issues in Networks of the Future  Final Programme, 20091231)In this paper we apply the Gittins optimality result to characterize the optimal scheduling discipline in a multiclass M/G/1 queue. We apply the general result to several cases of practical interest where the service time ... 
Price of anarchy in noncooperative load balancing games
(Performance Evaluation, 20111231)We investigate the price of anarchy of a load balancing game with K dispatchers. The service rates and holding costs are assumed to depend on the server, and the service discipline is assumed to be processorsharing at ... 
Competition yields efficiency in load balancing games
(Performance Evaluation, 20111231)We study a nonatomic congestion game with N parallel links, with each link under the control of a profit maximizing provider. Within this 'load balancing game', each provider has the freedom to set a price, or toll, for ... 
Properties of the gittins index with application to optimal scheduling
(Probability in the Engineering and Informational Sciences, 20111231)We consider the optimal scheduling problem for a singleserver queue without arrivals. We allow preemptions, and our purpose is to minimize the expected flow time. The optimal nonanticipating discipline is known to be the ...