583 research outputs found
Supplemental Material, DS_10.1177_0022242918805455 - Format Neglect: How the Use of Numerical Versus Percentage Rank Claims Influences Consumer Judgments
No full textSupplemental Material, DS_10.1177_0022242918805455 for Format Neglect: How the Use of Numerical Versus Percentage Rank Claims Influences Consumer Judgments by Julio Sevilla, Mathew S. Isaac, and Rajesh Bagchi in Journal of Marketing</p
sj-pdf-1-jnm-10.1177_10949968241240453 - Supplemental material for Email Campaigns That Suit the Candidate: Leveraging Automated Text Analysis to Increase Political Donations
No full textSupplemental material, sj-pdf-1-jnm-10.1177_10949968241240453 for Email Campaigns That Suit the Candidate: Leveraging Automated Text Analysis to Increase Political Donations by Simha Mummalaneni, Rebecca Jen-Hui Wang, and Mathew S. Isaac in Journal of Interactive Marketing</p
The Easy Addendum Effect: When Doing More Seems Less Effortful
No full textLai, E. Y., Sevilla, J., Isaac, M. S., & Bagchi, R. (2023). The easy addendum effect: When doing more seems less effortful. Journal of Applied Psychology, 108(12), 2040–2052. https://doi.org/10.1037/apl000113
On the Kernel and Related Problems in Interval Digraphs
Get PDFGiven a digraph G, a set X ⊆ V(G) is said to be an absorbing set (resp. dominating set) if every vertex in the graph is either in X or is an in-neighbour (resp. out-neighbour) of a vertex in X. A set S ⊆ V(G) is said to be an independent set if no two vertices in S are adjacent in G. A kernel (resp. solution) of G is an independent and absorbing (resp. dominating) set in G. The problem of deciding if there is a kernel (or solution) in an input digraph is known to be NP-complete. Similarly, the problems of computing a minimum cardinality kernel, absorbing set (or dominating set) and the problems of computing a maximum cardinality kernel, independent set are all known to be NP-hard for general digraphs. We explore the algorithmic complexity of these problems in the well known class of interval digraphs. A digraph G is an interval digraph if a pair of intervals (S_u,T_u) can be assigned to each vertex u of G such that (u,v) ∈ E(G) if and only if S_u ∩ T_v ≠ ∅. Many different subclasses of interval digraphs have been defined and studied in the literature by restricting the kinds of pairs of intervals that can be assigned to the vertices. We observe that several of these classes, like interval catch digraphs, interval nest digraphs, adjusted interval digraphs and chronological interval digraphs, are subclasses of the more general class of reflexive interval digraphs - which arise when we require that the two intervals assigned to a vertex have to intersect. We see as our main contribution the identification of the class of reflexive interval digraphs as an important class of digraphs. We show that all the problems mentioned above are efficiently solvable, in most of the cases even linear-time solvable, in the class of reflexive interval digraphs, but are APX-hard on even the very restricted class of interval digraphs called point-point digraphs, where the two intervals assigned to each vertex are required to be degenerate, i.e. they consist of a single point each. The results we obtain improve and generalize several existing algorithms and structural results for reflexive interval digraphs. We also obtain some new results for undirected graphs along the way: (a) We get an O(n(n+m)) time algorithm for computing a minimum cardinality (undirected) independent dominating set in cocomparability graphs, which slightly improves the existing O(n³) time algorithm for the same problem by Kratsch and Stewart; and (b) We show that the Red Blue Dominating Set problem, which is NP-complete even for planar bipartite graphs, is linear-time solvable on interval bigraphs, which is a class of bipartite (undirected) graphs closely related to interval digraphs
Who is security and privacy research for? Analysis on meta-data from relevant publications
Get PDFSubmission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2024-05-01The student, Raima Mathew, accepted the attached license on 2022-04-22 at 10:42.The student, Raima Mathew, submitted this Thesis for approval on 2022-04-22 at 11:41.This Thesis was approved for publication on 2022-04-26 at 15:47.DSpace SAF Submission Ingestion Package generated from Vireo submission #17918 on 2022-11-11 at 12:12:01Security and privacy (S&P) research aims to protect people by mitigating potential risks of technology. While there are many success stories in our field doing just this, the impact of the research remains unclear. The understanding of who is the security and privacy research for can be achieved by exploring the Usable S&P papers along with traditional security privacy papers. I seek to contribute a better understanding of who is the S&P research for by performing an analysis of metadata (e.g., author affiliation, geographic location, user study conducted, citations) of 907 security and privacy papers published at the USENIX Security Symposium (USENIX) and Symposium on Usable Privacy and Security (SOUPS) between 2015 and 2021. In this paper, I present these results and use evidence from prior work to consider the implications of our findings in terms of who benefits most from S&P work. I also highlight the differences and similarities between general S&P, and Usable S&P, along with the prior work on Human-Computer Interaction (HCI). For example, in all three, a disproportionate amount of research is conducted in western countries, which likely means that the work disproportionately addresses the needs of people in those locales and excludes people in other places. I conclude by providing discussions and recommendations to diversify the conference such that it includes different viewpoints, cultures, and values
Synthesis and characterization of photoconducting (Cd:Zn)S thin films by hydrothermal assisted chemical bath deposition
No full textCorrection to: The role of resection in hepatocellular carcinoma BCLC stage B: A multi-institutional patient-level meta-analysis and systematic review (Langenbeck's Archives of Surgery, (2024), 409, 1, (277), 10.1007/s00423-024-03466-x)
No full textCorrection to: Langenbeck’s Archives of Surgery (2024) 409:277. https://doi.org/10.1007/s00423-024-03466-x. This article unfortunately contained a mistake. The author name ‘Mathew Vithayathil’ was incorrectly written as ‘Vithayathil Mathew K.’. The original article has been corrected
Verbi vasconici: ab Iohanne Leizarraga in Novo Testamento adhibiti formulas composuit L. S. Dodgson
No full textEl autor critica el trabajo de L. S. Dodgson sobre el Nuevo Testamento de Liçarrague (según el autor "Leizarraga" es una invención de Dodgson) y en particular sobre el evangelio de San Mateo y las epístolas de San Judas y San Pablo a FilemónThe author criticizes the work of L. S. Dodgson on the New Testament of Liçarrague (according to the author, "Leizarraga" is Dodgson's invention) and in particular on the gospel of Saint Mathew and the epistles of Saint Jude and Saint Paul to Philemo
- …
