1,720,979 research outputs found
The Stochastic Bid Generation Problem in Combinatorial Transportation Auctions
No full textIn this paper, we deal with the generation of bundles of loads to be submitted by carriers participating in combinatorial auctions in the context of long-haul full truckload transportation services. We develop a probabilistic optimization model that integrates the bid generation and pricing problems together with the routing of the carrier’s fleet. We propose two heuristic procedures that enable us to solve models with up to 400 auctioned loads
An algorithm for solving the distributed termination detection problem
No full textIn this paper we present an algorithm for solving the distributed termination detection problem. In particular, a strategy based on message counting is used to detect the termination of a distributed computation consisting of a set of processes asynchronously communicating over communication links. The proposed algorithm does not require the FIFO property for the communication links. The assumptions regarding the connectivity of the processes are very simple. For the proposed algorithm we demonstrate the correctness, we evaluate the message and the bit complexity and we give a detailed description of a MPI implementation
Rolling horizon and fix-and-relax heuristcs for the parallel machines lot-sizing and scheduling problem with sequence dependent set-up costs
Full text linkIn this paper we develop newrolling-horizon and fix-and-relax heuristics for the identical parallel machine lot-sizing and scheduling
problem with sequence-dependent set-up costs. Unlike previous papers, our procedures are based on a compact formulation relying
on the hypotheses of identical machines. This feature makes our approach suitable for large-scale applications (with hundreds of
machines) arising in the textile and fiberglass industries. Moreover, our procedures are shown to provide a feasible solution for any
feasible instance. Comparisons with lower bounds provided by a truncated branch-and-bound show that the gap between the best
heuristic solution and the lower bound never exceeds 3
Grid Computing for Financial Applications
No full textThe paper investigates the potential advantages related to the adoption of grid computing technology in the financial sector. The increasing power of computational grids makes now possible to offer functionalities that were previously unimaginable. From derivative pricing, to risk management, from on-line trading to portfolio optimization, the possibility to manage huge amounts of data, solve models of seemingly limitless complexity and perform near real-time analysis may give the business a competitive edge. This contribution presents an important attempt to bring grid computing to the the financial sector. In particular, it presents a grid-based platform for portfolio optimization designed and implemented within the European funded BEinGRID project. A system demonstration from the end-user perspective together with architectural details on the grid platform are provided
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
- …
