Browsing Data Science (DS) by Title
Now showing items 37-56 of 146
-
Decentralized proportional load balancing
(SIAM Journal on Applied Mathematics, 2016-01-01)Load balancing is a powerful technique commonly used in communication and computer networks to improve system performance, robustness and fairness. In this paper, we consider a general model capturing the performance of ... -
Detection of non-technical losses in smart meter data based on load curve profiling and time series analysis
(Energy, 2017-06)The advent and progressive deployment of the so-called Smart Grid has unleashed a profitable portfolio of new possibilities for an efficient management of the low-voltage distribution network supported by the introduction ... -
Detection of Sand Dunes on Mars Using a Regular Vine-based Classification Approach
(Knowledge- Based Systems, 2018-08)This paper deals with the problem of detecting sand dunes from remotely sensed images of the surface of Mars. We build on previous approaches that propose methods to extract informative features for the classification of ... -
Dicentric dose estimates for patients undergoing radiotherapy in the RTGene study to assess blood dosimetric models and the new Bayesian method for gradient exposure
(2018-06-01)The RTGene study was focused on the development and validation of new transcriptional biomarkers for prediction of individual radiotherapy (RT) patient responses to ionising radiation (IR). In parallel, for validation ... -
Distance-based exponential probability models on constrained combinatorial optimization problems
(GECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion, 2018-08-30)Estimation of distribution algorithms have already demonstrated their utility when solving a broad range of combinatorial problems. However, there is still room for methodological improvements when approaching constrained ... -
Early classification of time series by simultaneously optimizing the accuracy and earliness
(IEEE Transactions on Neural Networks and Learning Systems, 2017-10)The problem of early classi cation of time series appears naturally in contexts where the data, of temporal nature, is collected over time, and early class predictions are interesting or even required. The objective is to ... -
Early classification of time series using multi-objective optimization techniques
(Information Sciences, 2019-04-23)In early classification of time series the objective is to build models which are able to make class-predictions for time series as accurately and as early as possible, when only a part of the series is available. It is ... -
Effect of trampling and digging from shell shing on Zostera noltei (Zosteraceae) intertidal seagrass beds
(Scientia Marina, 2017-03)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 ... -
Effect of various dietary regimens on oral challenge with Mycobacterium avium subsp. paratuberculosis in a rabbit model
(Research in Veterinary Science, 2015-12-31)Rabbits are susceptible to infection by Mycobacterium avium subspecies paratuberculosis (MAP) in both wildlife and experimental conditions. Under the hypotheses that nutrient balance might influence the establishment of ... -
Effects of reducing VMs management times on elastic applications
(Journal of Grid Computing, 2018-05)Cloud infrastructures provide computing resources to applications in the form of Virtual Machines (VMs). Many applications deployed in cloud resources have an elastic behavior, that is, they change the number of servers ... -
Efficiency of simulation in monotone hyper-stable queueing networks
(Queueing Systems, 2014-12-31)We consider Jackson queueing networks with finite buffer constraints (JQN) and analyze the efficiency of sampling from their stationary distribution. In the context of exact sampling, the monotonicity structure of JQNs ... -
Efficient approximation of probability distributions with k-order decomposable models
(International Journal of Approximate Reasoning, 2016-01-01)During the last decades several learning algorithms have been proposed to learn probability distributions based on decomposable models. Some of these algorithms can be used to search for a maximum likelihood decomposable ... -
Efficient approximation of probability distributions with k-order decomposable models
(International Journal of Approximate Reasoning, 2016-07)During the last decades several learning algorithms have been proposed to learn probability distributions based on decomposable models. Some of these algorithms can be used to search for a maximum likelihood decomposable ... -
An efficient approximation to the K-means clustering for Massive Data
(Knowledge-Based Systems, 2016-06-28)Due to the progressive growth of the amount of data available in a wide variety of scientific fields, it has become more difficult to manipulate and analyze such information. In spite of its dependency on the initial ... -
An efficient approximation to the K-means clustering for Massive Data
(Knowledge-Based Systems, 2017-02-01)Due to the progressive growth of the amount of data available in a wide variety of scientific fields, it has become more difficult to manipulate and analyze such information. In spite of its dependency on the initial ... -
An efficient evolutionary algorithm for the orienteering problem
(Computers and Operations Research, 2017-09-06)This paper deals with the Orienteering Problem, which is a routing problem. In the Orienteering Problem, each node has a profit assigned and the goal is to find the route that maximizes the total collected profit subject ... -
Energy-aware capacity scaling in virtualized environments with performance guarantees
(Performance Evaluation, 2011-12-31)We investigate the trade-off between performance and power consumption in servers hosting virtual machines running IT services. The performance behavior of such servers is modeled through Generalized Processor Sharing (GPS) ... -
Ergodic transition in a simple model of the continuous double auction
(PLoS ONE, 2014-12-31)We study a phenomenological model for the continuous double auction, whose aggregate order process is equivalent to two independent M/M/1 queues. The continuous double auction defines a continuous-time random walk for trade ... -
Estimating attraction basin sizes
(Lecture Notes in Computer Science, 2016-10-01)The performance of local search algorithms is influenced by the properties that the neighborhood imposes on the search space. Among these properties, the number of local optima has been traditionally considered as a ... -
Evolutionary algorithms to optimize low-thrust trajectory design in spacecraft orbital precession mission
(IEEE Congress on Evolutionary Computation, 2017-06-06)In space environment, perturbations make the spacecraft lose its predefined orbit in space. One of these undesirable changes is the in-plane rotation of space orbit, denominated as orbital precession. To overcome this ...