1,721,001 research outputs found
An automatic relaxation method for solving interval linear inequalities
No full textAbstractThe problem of solving iteratively a large and possibly sparse system of interval linear inequalities α ⩽ Ax ⩽ β is considered. An algorithm of the row-action type is proposed which, in each iterative step, effectively takes account of a pair of inequalities describing a single interval inequality. The algorithm realizes in an automatic manner a relaxation principle proposed by Goffin but also allows further external relaxation parameters
Superiorization and Perturbation Resilience of Algorithms: A Continuously Updated Bibliography
Full text linkThis document presents a (mostly) chronologically-ordered bibliography of
scientific publications on the superiorization methodology and perturbation
resilience of algorithms which is compiled and continuously updated by us at:
http://math.haifa.ac.il/yair/bib-superiorization-censor.html. Since the
beginnings of this topic we try to trace the work that has been published about
it since its inception. To the best of our knowledge this bibliography
represents all available publications on this topic to date, and while the URL
is continuously updated we will revise this document and bring it up to date on
arXiv approximately once a year. Abstracts of the cited works, and some links
and downloadable files of preprints or reprints are available on the above
mentioned Internet page. If you know of a related scientific work in any form
that should be included here kindly write to me on: [email protected] with
full bibliographic details, a DOI if available, and a PDF copy of the work if
possible. The Internet page was initiated on March 7, 2015, and has been last
updated on March 9, 2024. Comment: Some of the items have on the above
mentioned Internet page more information and links than in this report.
Acknowledgments: The compilation of this report was supported by the ISF-NSFC
joint research program grant No. 2874/19, by the U.S. National Institutes of
Health grant No. R01CA266467 and by the Cooperation Program in Cancer Research
of the German Cancer Research Center (DKFZ) and the Israeli Ministry of
Innovation, Science and Technology (MOST).Comment: Original report: June 13, 2015 contained 41 items. First revision:
March 9, 2017. Second revision: March 8, 2018. Third revision: March 11,
2019. Fourth revision: March 16, 2020. Fifth revision: March 18, 2021
contained 132 items. Sixth revision: March 13, 2022 contains 150 items.
Seventh revision: March 14, 2023 contains 166 items. Eighth revision: March
18, 2024 contains 178 item
Binary steering in discrete tomography reconstruction with sequential and simultaneous iterative algorithms
No full textAbstractThe binary steering process is a heuristic designed to intervene between consecutive steps of a nonbinary iterative image reconstruction algorithm in order to gradually steer the iterates towards a binary solution. We present computational results which show that a strongly overrelaxed simultaneous nonbinary iterative algorithm performs in our experiments better than a strongly underrelaxed sequential iterative algorithm. We also notice that faster binary steering gives better binary reconstructed images when the sequential iterative nonbinary algorithm is used
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
Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces
No full textAbstractWe prove strong convergence of a class of block-iterative projection methods for finding a common point of a finite family of closed convex subsets in a Hilbert space
On a Class of Bargaining Schemes for Points in the Core of a Cooperative N-Person Game
Full text linkProjection methods of solving convex feasibility problems lead naturally to a class of bargaining scheme\u27s for points in the core of cooperative n-person games. Each such bargaining scheme is by itself a mathematical model of rational behavior describing a specific way of achieving equilibrated payoff vectors. We show that many of these bargaining schemes are stable \u27 and have meaningful heuristic interpretations
A Method for Approximating the Solution Set of a System of Convex Inequalities by Polytopes
Full text linkIn this note a method for computing approximations by polytopes of the solution set [see pdf for notation] of a system of convex inequalities is presented. It is shown that such approximations can be determined by an algorithm which converges in finitely many steps when the solution set of the given system of inequalities is bounded. In this case, the algorithm generates inner and outer\u27 approximations having the Hausdorff distance to each other (and to the set [see pdf for notation]) not greater than an a priori fixed [see pdf for notation] and having their extremal points in [see pdf for notation] and in the relative exterior of [see pdf for notation], respectively
- …
