1,721,037 research outputs found
Giovanni Rinaldi, Santa Caterina d'Alessandria
No full textViene pubblicata una nuova opera di Giovanni Rinaldi, uno scultore francese attivo a Roma nella cerchia di Bernin
Two essays in computational optimization: computing the clar number in fullerene graphs and distributing the errors in iterative interior point methods
Full text linkFullerene are cage-like hollow carbon molecules graph of pseudospherical sym-
metry consisting of only pentagons and hexagons faces. It has been the object
of interest for chemists and mathematicians due to its widespread application
in various fields, namely including electronic and optic engineering, medical sci-
ence and biotechnology. A Fullerene molecular, Γ n of n atoms has a multiplicity
of isomers which increases as N iso ∼ O(n 9 ). For instance, Γ 180 has 79,538,751
isomers. The Fries and Clar numbers are stability predictors of a Fullerene
molecule. These number can be computed by solving a (possibly N P -hard)
combinatorial optimization problem. We propose several ILP formulation of
such a problem each yielding a solution algorithm that provides the exact value
of the Fries and Clar numbers. We compare the performances of the algorithm
derived from the proposed ILP formulations. One of this algorithm is used to
find the Clar isomers, i.e., those for which the Clar number is maximum among
all isomers having a given size. We repeated this computational experiment for
all sizes up to 204 atoms. In the course of the study a total of 2 649 413 774
isomers were analyzed.The second essay concerns developing an iterative primal dual infeasible path
following (PDIPF) interior point (IP) algorithm for separable convex quadratic
minimum cost flow network problem. In each iteration of PDIPF algorithm, the
main computational effort is solving the underlying Newton search direction
system. We concentrated on finding the solution of the corresponding linear
system iteratively and inexactly. We assumed that all the involved inequalities
can be solved inexactly and to this purpose, we focused on different approaches
for distributing the error generated by iterative linear solvers such that the
convergences of the PDIPF algorithm are guaranteed. As a result, we achieved
theoretical bases that open the path to further interesting practical investiga-
tion
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
SpeeDP: an algorithm to compute SDP bounds for very large Max-Cut instances
No full textWe consider low-rank semidefinite programming (LRSDP) relaxations of unconstrained quadratic problems (or, equivalently, of Max-Cut problems) that can be formulated as the non-convex nonlinear programming problem of minimizing a quadratic function subject to separable quadratic equality constraints. We prove the equivalence of the LRSDP problem with the unconstrained minimization of a new merit function and we define an efficient and globally convergent algorithm, called SpeeDP, for finding critical points of the LRSDP problem. We provide evidence of the effectiveness of SpeeDP by comparing it with other existing codes on an extended set of instances of the Max-Cut problem. We further include SpeeDP within a simply modified version of the Goemans-Williamson algorithm and we show that the corresponding heuristic SpeeDP-MC can generate high-quality cuts for very large, sparse graphs of size up to a million nodes in a few hours
Dispelling the Myths Behind First-author Citation Counts
Full text linkWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
Bibbia e Oriente
No full textBook chapter in Studi sull’Oriente e la Bibbia offerti al P. Giovanni Rinaldi
nel 60° compleanno da allievi, colleghi, amici, 267–72.
Genova: Studio e vita
- …
