112,164 research outputs found
On the Complexity of String Matching for Graphs
No full textExact string matching in labeled graphs is the problem of searching paths of a graph G = (V, E) such that the concatenation of their node labels is equal to a given pattern string P[1..m]. This basic problem can be found at the heart of more complex operations on variation graphs in computational biology, of query operations in graph databases, and of analysis operations in heterogeneous networks. We prove a conditional lower bound stating that, for any constant epsilon > 0, an O(|E|(1-epsilon) m) time, or an O(|E| m(1-epsilon)) time algorithm for exact string matching in graphs, with node labels and pattern drawn from a binary alphabet, cannot be achieved unless the Strong Exponential Time Hypothesis (SETH) is false. This holds even if restricted to undirected graphs with maximum node degree 2-that is, to zig-zag matching in bidirectional strings, or to deterministic directed acyclic graphs whose nodes have maximum sum of indegree and outdegree 3. These restricted cases make the lower bound stricter than what can be directly derived from related bounds on regular expression matching (Backurs and Indyk, FOCS'16). In fact, our bounds are tight in the sense that lowering the degree or the alphabet size yields linear time solvable problems. An interesting corollary is that exact and approximate matching are equally hard (i.e., quadratic time) in graphs under SETH. In comparison, the same problems restricted to strings have linear time vs quadratic time solutions, respectively (approximate pattern matching having also a matching SETH lower bound (Backurs and Indyk, STOC'15))
Repeat- and error-aware comparison of deletions
No full textWittler R, Marschall T, Schönhuth A, Makinen V. Repeat- and error-aware comparison of deletions. Bioinformatics. 2015;31(18):2947-2954
author-bios-SRD-19-0063.R1 – Supplemental material for The Network Structure of Police Misconduct
No full textSupplemental material, author-bios-SRD-19-0063.R1 for The Network Structure of Police Misconduct by George Wood, Daria Roithmayr and Andrew V. Papachristos in Socius</p
Going Beyond Counting First Authors in Author Co-citation Analysis
No full textThe 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
No full text“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
Compressed representations of sequences and full-text indexes
No full textAbstract. Given a sequence S = s1s2... sn of integers smaller than r = O(polylog(n)), we show how S can be represented using nH0(S) + o(n) bits, so that we can know any sq, as well as answer rank and select queries on S, in constant time. H0(S) is the zero-order empirical entropy of S and nH0(S) provides an Information Theoretic lower bound to the bit storage of any sequence S via a fixed encoding of its symbols. This extends previous results on binary sequences, and improves previous results on general sequences where those queries are answered in O(log r) time. For larger r, we can still represent S in nH0(S) + o(nlog r) bits and answer queries in O(log r/log log n) time. Another contribution of this paper is to show how to combine our compressed representation of integer sequences with an existing compression boosting technique to design compressed full-text indexes that scale well with the size of the input alphabet Σ. Namely, we design a variant of the FM-index that indexes a string T[1, n] within nHk(T) + o(n) bits of storage, where Hk(T) is the k-th order empirical entropy of T. This space bound holds simultaneously for all k ≤ αlog |Σ | n, constant 0 < α < 1, and |Σ | = O(polylog(n)). This index counts the occurrences of an arbitrary pattern P[1, p] as a substring of T in O(p) time; it locates each pattern occurrence in O(log 1+ε n) time, for any constant 0 < ε < 1; and it reports a text substring of length ℓ in O(ℓ + log 1+ε n) time. Compared to all previous works, our index is the first one that removes the alphabet-size dependance from all query times, in particular counting time is linear in the pattern length. Still, our index uses essentially the same space of the k-th order entropy of the text T, which is the best space obtained in previous work. We can also handle larger alphabets of size |Σ | = O(n β), for any 0 < β < 1, by paying o(nlog |Σ|) extra space and by multiplying all query times by O(log |Σ| / log log n).
The role of the perceived engagement of the facilitator in a vicarious contact intervention: A school-based field experiment in three countries
No full textIndirect forms of intergroup contact have been shown to reduce prejudice. However, little is known about the factors that can contribute to implementing these methods as interventions in real-life settings. In this study, we examined whether the students' perception of the facilitator's engagement in carrying out a school-based vicarious contact intervention affects the effectiveness of the intervention among adolescents in Finland (N = 360), Italy (N = 113), and Slovakia (N = 216). As a result, the participants who perceived the facilitator as highly engaged held more positive intergroup attitudes after the intervention than those perceiving the facilitator less engaged. The results are discussed in relation to social and developmental psychological research on normative influences in adolescence and intergroup contact literature, in which normative support from authorities is considered to contribute to the extent to which contact reduces prejudice. By stressing the role of the facilitator, the results contribute both theoretically and practically to the understanding of the successful implementation of prejudice-reduction programs. Please refer to the Supplementary Material section to find this article's Community and Social Impact Statement
Využití sociálních médií v B2B prodeji
No full textTato diplomová práce se zabývá tím, jak mohou B2B obchodníci využívat sociální média v prodeji. Na základě systematické rešerše literatury, autor zjistil, že akademici, zkoumající danou problematiku, navrhují další výzkum, a to: v kterých konkrétních krocích se dají využít sociální média v prodeji (Salo, 2017). Autor se na základě toho rozhodl zjistit, jaké sociální sítě, různé technologie a pluginy se dají využít v B2B prodeji - tzv. social sellingu. Social selling se v této práci týká primárně procesu akvizice a okrajově péčí o stávající zákazníky. Autor si vybral kvalitativní průzkum pomocí 10 hloubkových polo-strukturovaných rozhovorů, aby odhalil jak, která sociální média to jsou, tak i motivaci prodejců, proč tato média používat/nepoužívat. Aby autor dodržel správnost vyhodnocení výsledků, data byla analyzována pomocí Tématické analýzy, která v této studii vykrystalizovala 2 hlavní strategické přístupy v social sellingu. Tyto přístupy (tzv. Push a Pull strategie) obsahují praktické příklady a konkrétní aktivity, které mohou prodejci využívat v každodenní praxi. Tyto výsledky jsou prezentovány s důrazem na praktičnost a jednoduchost implementace. Tvoří proto hlavní přínos autorovo výzkumu. V poslední části autor zmiňuje výzvy a manažerská doporučení, které mohou obchodníci využít v každodenním pracovním životě.This diploma thesis focuses on social media usage in B2B sales. Based on the systematic literature review conducted by the author, he has found out that recent researchers (Salo, 2017) suggest further research in the area of how and in which sales phase should various social networking sites, technologies and plugins used. To further fill this research gap, author decided to identify these social media and their usage among B2B salespeople in the so-called social selling process. The social selling process in this thesis applies mainly to acquiring new prospects and tangentially to taking care of existing clients (follow-up step). Author has chosen a qualitative research method via conducting 10 in-depth semi-structured interviews to reveal these instruments as well as motivation of a sales person on why to use social media in the selling process. The collected data was analyzed using Thematic analysis to ensure the right procedure and to identify main themes which crystalized into 2 main strategic approaches in social selling. These approaches (Push and Pull) include practical examples of concrete activities which sales people can use in their daily jobs and are presented with focus on practicality and ease of implementation. These also form the main contribution of author`s research. In the last part, author mentions challenges in social selling and recommended managerial implications for salesforce
Makinen v. Penix
No full textDocket Number: 95-0091For access to these documents, please log in or contact the reference staff by emailing [email protected] or by calling 402-280-5541 for help locating the desired item
- …
