Bot out of hell Lorenzo‐Arribas, Altea; Alba, Sandra
Significance (Oxford, England),
October 2022, 2022-10-01, 20221001, Letnik:
19, Številka:
5
Journal Article
Last International Women's Day, the Twitter Gender Pay Gap Bot mined government data to sensationally unmask hypocritical employers. Its co‐creator Francesca Lawson tells Altea Lorenzo‐Arribas and ...Sandra Alba how it happened, and why data is nothing without visibility
Last International Women's Day, the Twitter Gender Pay Gap Bot mined government data to sensationally unmask hypocritical employers. Its co‐creator Francesca Lawson tells Altea Lorenzo‐Arribas and Sandra Alba how it happened, and why data is nothing without visibility
Presentación del número Gisela Arroyo Andrade
Campos en Ciencias Sociales,
01/2019, Letnik:
7, Številka:
1
Journal Article
Recenzirano
Odprti dostop
Este nuevo número de la revista Campos en Ciencias Sociales, recoge nueve trabajos que representan aportes interesantes y novedosos, tanto a nivel metodológico como de resultados. Esta edición es ...fruto del arduo trabajo que se ha venido llevando a cabo en pro del fortalecimiento de la revista en términos de visibilidad y difusión, y que se refleja en la publicación de trabajos no solo de Colombia, sino de otros países de América Latina y Europa. Se presentan cinco artículos de investigación, dos de reflexión, unode revisión y una entrevista.
Efficient and Robust From-Point Visibility Popescu, Voicu; Sacks, Elisha; Cui, Jian ...
IEEE transactions on visualization and computer graphics,
08/2024, Letnik:
30, Številka:
8
Journal Article
Recenzirano
This article presents two from-point visibility algorithms: one aggressive and one exact. The aggressive algorithm efficiently computes a nearly complete visible set, with the guarantee of finding ...all triangles of a front surface, no matter how small their image footprint. The exact algorithm starts from the aggressive visible set and finds the remaining visible triangles efficiently and robustly. The algorithms are based on the idea of generalizing the set of sampling locations defined by the pixels of an image. Starting from a conventional image with one sampling location at each pixel center, the aggressive algorithm adds sampling locations to make sure that a triangle is sampled at all the pixels it touches. Thereby, the aggressive algorithm finds all triangles that are completely visible at a pixel regardless of geometric level of detail, distance from viewpoint, or view direction. The exact algorithm builds an initial visibility subdivision from the aggressive visible set, which it then uses to find most of the hidden triangles. The triangles whose visibility status is yet to be determined are processed iteratively, with the help of additional sampling locations. Since the initial visible set is almost complete, and since each additional sampling location finds a new visible triangle, the algorithm converges in a few iterations.
Abstract
Quantum delayed-choice experiments are designed to probe the robustness of the complementarity principle. In this proceeding, we revisit the main ideas reported recently in Ref. Commun. ...Phys. 5, 82 (2022) concerning a setup (quantum-controlled reality experiment) that has the same final visibility as the quantum version of Wheeler’s delayed-choice arrangement. Besides the same final statistics, upon an operational criterion of physical realism, the authors claimed a different state of affairs for the wave-and-particle behavior in delayed-choice experiments. To this end, we put forward an analysis by employing the relative entropy of coherence to study how the local wave and particle coherences when the system is traveling inside the interferometer change accordingly to the final observed visibility.
Let G be a graph and X⊆V(G). Then X is a mutual-visibility set if each pair of vertices from X is connected by a geodesic with no internal vertex in X. The mutual-visibility number μ(G) of G is the ...cardinality of a largest mutual-visibility set. In this paper, the mutual-visibility number of strong product graphs is investigated. As a tool for this, total mutual-visibility sets are introduced. Along the way, basic properties of such sets are presented. The (total) mutual-visibility number of strong products is bounded from below in two ways, and determined exactly for strong grids of arbitrary dimension. Strong prisms are studied separately and a couple of tight bounds for their mutual-visibility number are given.
If X is a subset of vertices of a graph G, then vertices u and v are X-visible if there exists a shortest u,v-path P such that V(P)∩X⊆{u,v}. If each two vertices from X are X-visible, then X is a ...mutual-visibility set. The mutual-visibility number of G is the cardinality of a largest mutual-visibility set of G and has been already investigated. In this paper a variety of mutual-visibility problems is introduced based on which natural pairs of vertices are required to be X-visible. This yields the total, the dual, and the outer mutual-visibility numbers. We first show that these graph invariants are related to each other and to the classical mutual-visibility number, and then we prove that the three newly introduced mutual-visibility problems are computationally difficult. According to this result, we compute or bound their values for several graphs classes that include for instance grid graphs and tori. We conclude the study by presenting some inter-comparison between the values of such parameters, which is based on the computations we made for some specific families.
Given a graph G, a set X of vertices in G satisfying that between every two vertices in X (respectively, in G) there is a shortest path whose internal vertices are not in X is a mutual-visibility ...(respectively, total mutual-visibility) set in G. The cardinality of a largest (total) mutual-visibility set in G is known under the name (total) mutual-visibility number, and has been studied in several recent works.
In this paper, we propose two lower variants of these concepts, defined as the smallest possible cardinality among all maximal (total) mutual-visibility sets in G, and denote them by μ−(G) and μt−(G), respectively. While the total mutual-visibility number is never larger than the mutual-visibility number in a graph G, we prove that both differences μ−(G)−μt−(G) and μt−(G)−μ−(G) can be arbitrarily large. We characterize graphs G with some small values of μ−(G) and μt−(G), and prove a useful tool called the Neighborhood Lemma, which enables us to find upper bounds on the lower mutual-visibility number in several classes of graphs. We compare the lower mutual-visibility number with the lower general position number, and find a close relationship with the Bollobás-Wessel theorem when this number is considered in Cartesian products of complete graphs. Finally, we also prove the NP-completeness of the decision problem related to μt−(G).
This research article examines women's experiences residing in the high-range areas of the Idukki district in Kerala, focusing on their transition from invisibility to visibility. The study was ...conducted among women in these regions, identifying five key informants. Data were collected through in-depth interviews, revealing a progressive change in rural women's socio-economic, political, and familial spheres over the past decade. The findings indicate that these women have become more visible in various domains of society. Financial independence has significantly enhanced their self-worth, critical in contexts with skewed gender equality. Government initiatives, such as women-specific programs and social legislation, have positively impacted women's empowerment by providing financial security. This paper identifies the underlying factors contributing to the increased visibility of rural women in political, economic, social, and cultural spheres and the gradual development of their self-worth. Additionally, it discusses the role of social work in further empowering women's visibility.
This research article examines women's experiences residing in the high-range areas of the Idukki district in Kerala, focusing on their transition from invisibility to visibility. The study was ...conducted among women in these regions, identifying five key informants. Data were collected through in-depth interviews, revealing a progressive change in rural women's socio-economic, political, and familial spheres over the past decade. The findings indicate that these women have become more visible in various domains of society. Financial independence has significantly enhanced their self-worth, critical in contexts with skewed gender equality. Government initiatives, such as women-specific programs and social legislation, have positively impacted women's empowerment by providing financial security. This paper identifies the underlying factors contributing to the increased visibility of rural women in political, economic, social, and cultural spheres and the gradual development of their self-worth. Additionally, it discusses the role of social work in further empowering women's visibility.
