1,721,021 research outputs found
Replication data for "Exact Algorithms for Maximum Lifetime Data-Gathering Tree in Wireless Sensor Networks"
No full textDataset of instances used in the paper "Exact algorithms for Maximum Lifetime Data Gathering Tree in Wireless Sensors Networks".
The repository contains two folders (CCD and ZTD) corresponding to the instances used in the paper. Their full description is given in two README files, one in each folder.
The repository includes an additional folder (results) containing tables with our computational results in full
Replication data for 'A data driven Dantzig–Wolfe decomposition framework'
No full textThe dataset contains a set of about 31000 random decompositions of MIPLib instances, together with (a) an evaluation of a set of 121 features over them (b) bound and time scores, obtained through optimization runs. Their detailed structure is described in the paper:
S. Basso, A. Ceselli "A Data Driven Dantzig-Wolfe Decomposition Framework", Mathematical Programming Computation, accepted for publication (2022
Replication Data for: Non-invasive software architecture for data pipelines with legacy support in smart manufacturing
No full textIn this Dataverse, you will find the exETL prototype Python script, which contains the algorithm for the machine pipeline layer described in the article. Additionally, four datasets are included for training supervised classification models. The README file provides a comprehensive description of how to run the code and perform tests and experiments replication
Replication data for "Dantzig–Wolfe reformulations for binary quadratic problems" - kQKP dataset
No full textThe dataset contains instances for the cardinality constrained quadratic knapsack problem. These are used to test decomposition methods for Binary Quadratic Programs. Full details are given in the corresponding paper "Dantzig-Wolfe Reformulations for Binary Quadratic Problems ". The dataset contains three sets of instances
- qcr_instances: base instance, together with the optimal quadratic convex reformulation (QCR) multipliers found by solving an associated semidefinite program
- mqcr_instances: base instance, together with the optimal improved convex 0-1 quadratic program reformulation (MQCR) multipliers found by solving an associated semidefinite program
- convexity_analysis: instances in which the objective function quadratic cost matrix has a given number of positive eigenvalues
Replication Data for: PriSM: a Privacy-friendly Support vector Machine
No full textThe repository contains a synthetic dataset used in the experimental evaluation of the paper "PriSM: a Privacy-friendly Support vector Machine", together with the source code used for data generation, and a detailed technical report on the methodology adopted
Vehicle routing problems with different service constraints: A branch-and-cut-and-price algorithm
No full textIn this article, we consider a variation of the vehicle routing problem arising in the optimization of waste management systems. Constraints imposing adequate level of service to the citizens and even workload among the drivers make the problem challenging and ask for the design of specialized algorithmic approaches. We propose an exact optimization algorithm, in which dynamic generation of rows and columns is done in a branchand-bound framework; exact and heuristic algorithms are proposed for the pricing problem. Experimental tests on data-sets from the literature show that our algorithm outperforms previous ones and it is able to solve instances of realistic size to proven optimality in reasonable computing time
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
Full text link“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
Full text linkWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
- …
