65,832 research outputs found
Capturing collabportunities: A method to evaluate collaboration opportunities in information search using pseudocollaboration
No full textIn explicit collaborative search, two or more individuals coordinate their efforts toward a shared goal. Every day, Internet users with similar information needs have the potential to collaborate. However, online search is typically performed in solitude. Existing search systems do not promote explicit collaborations, and collaboration opportunities (collabportunities) are missed. In this article, we describe a method to evaluate the feasibility of transforming these collabportunities into recommendations for explicit collaboration. We developed a technique called pseudocollaboration to evaluate the benefits and costs of collabportunities through simulations. We evaluate the performance of our method using three data sets: (a) data from single users’ search sessions, (b) data with collaborative search sessions between pairs of searchers, and (c) logs from a largescale search engine with search sessions of thousands of searchers. Our results establish when and how collabportunities would significantly help or hinder the search process versus searches conducted individually. The method that we describe has implications for the design and implementation of recommendation systems for explicit collaboration. It also connects system-mediated and user-mediated collaborative search, whereby the system evaluates the likely benefits of collaborating for a search task and helps searchers make more informed decisions on initiating and executing such a collaboration.This is the peer reviewed version of the following article: González-Ibáñez, R., Shah, C. and White, R. W. (2015), Capturing Collabportunities: A method to evaluate collaboration opportunities in information search using pseudocollaboration. Journal of the Association for Information Science and Technology, 66: 1897–1912, which has been published in final form at https://dx.doi.org/doi:10.1002/asi.23288. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Self-Archiving.Peer reviewe
Letter from Arno B. Cammerer to J. R. Eakin
No full textLetter from Arno B. Cammerer to J. R. Eakin describing the procedure for purchasing Bright Angel Trail
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
Dispelling the Myths Behind First-author Citation Counts
No full textWe 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
Measurement of the ratio of branching fractions B(B0→K∗0γ )/B(B0s→φγ ) and the directCP asymmetry inB 0→K∗0γ
No full textThe ratio of branching fractions of the radiative B decays B0→K⁎0γ and B0s→ϕγ has been measured using an integrated luminosity of 1.0 fb−1 of pp collision data collected by the LHCb experiment at a centre-of-mass energy of s√=7TeV. The value obtained is
B(B0→K⁎0γ)B(B0s→ϕγ)=1.23±0.06(stat.)±0.04(syst.)±0.10(fs/fd),
where the first uncertainty is statistical, the second is the experimental systematic uncertainty and the third is associated with the ratio of fragmentation fractions fs/fd. Using the world average value for B(B0→K⁎0γ), the branching fraction B(B0s→ϕγ) is measured to be (3.5±0.4)×10−5.
The direct CP asymmetry in B0→K⁎0γ decays has also been measured with the same data and found to be
ACP(B0→K⁎0γ)=(0.8±1.7(stat.)±0.9(syst.))%.
Both measurements are the most precise to date and are in agreement with the previous experimental results and theoretical expectations
The Forman Christian College Monthly
No full textNational NumberEditorials. pp. pp. 2-7; College Section. pp. 8-13; Dina Nath-Article-To Indians. pp. 14-16; Siraj-ud-Din, R..-Article-Slave Mentality in the Light of the Christian Scriptures. pp. 17-19; Sayad Saadat Ali Shah-Article-Educational Non-co-operation. pp. 20-22; Raghunath Rai-The Village Money-Lender. pp. 22-23; Chand Narain-Gopala Krishna Gokhale. pp. 24; Ishwar Chandra-Mahatma Gandhi. pp. 25-27; Calvin Buta Singh-Rabindranath Tagore. pp. 28-29; Calvin Buta Singh-Swami Sundar Singh. pp. 29-30; Book Reviews. pp. 31-3
Ahlfors-régularité des quasi-minima de Mumford–Shah
No full textRésuméSoit un ouvert Ω⊂RN. On considère sur Ω les compétiteurs (U,K) de la fonctionnelle réduite de Mumford–Shah, c'est-à-dire la fonctionnelle de Mumford–Shah dans laquelle le terme en norme L2 de U a disparu, où K est un fermé de Ω et U une fonction sur Ω⧹K dont le gradient est dans L2. Le résultat principal de cet article est qu'il existe une constante c pour laquelle, lorsque (U,K) est un quasi-minimiseur de cette fonctionnelle et B(x,r) une boule centrée sur K et incluse dans Ω avec un rayon borné, la mesure HN−1 de K∩B(x,r) est majorée par crN−1 et minorée par c−1rN−1.AbstractLet Ω⊂RN be an open set. We consider on Ω the competitors (U,K) for the reduced Mumford–Shah functional, that is to say the Mumford–Shah functional in which the L2-norm of U term is removed, where K is a closed subset of Ω and U is a function on Ω⧹K with gradient in L2. The main result of this paper is the following: there exists a constant c for which, whenever (U,K) is a quasi-minimizer for the reduced Mumford–Shah functional and B(x,r) is a ball centered on K and contained in Ω with bounded radius, the HN−1-measure of K∩B(x,r) is bounded above by crN−1 and bounded below by c−1rN−1
Branching fraction and CP asymmetry of the decays B+→K0Sπ+ and B+→K0SK+
No full textAn analysis of B+ → K0
Sπ+ and B+ → K0
S K+ decays is performed with the LHCb experiment. The pp
collision data used correspond to integrated luminosities of 1 fb−1 and 2 fb−1 collected at centre-ofmass
energies of
√
s = 7 TeV and
√
s = 8 TeV, respectively. The ratio of branching fractions and the
direct CP asymmetries are measured to be B(B+ → K0
S K+
)/B(B+ → K0
Sπ+
) = 0.064 ± 0.009 (stat.) ±
0.004 (syst.), ACP(B+ → K0
Sπ+
) = −0.022 ± 0.025 (stat.) ± 0.010 (syst.) and ACP(B+ → K0
S K+
) =
−0.21 ± 0.14 (stat.) ± 0.01 (syst.). The data sample taken at
√
s = 7 TeV is used to search for
B+
c
→ K0
S K+ decays and results in the upper limit ( fc · B(B+
c
→ K0
S K+
))/( fu · B(B+ → K0
Sπ+
)) <
5.8 × 10−2 at 90% confidence level, where fc and fu denote the hadronisation fractions of a ¯b
quark
into a B+
c or a B+ meson, respectively
Edge detection filter based on Mumford-Shah green function
No full textIn this paper, we propose an edge detection algorithm based on the Green function associated with Mumford-Shah (M-S) segmentation model. This Green function has a singularity at its center. A regularization method is therefore proposed here to obtain an edge detection filter known here as Bessel filter. This filter is robust in the presence of noise and its implementation is simple. It is demonstrated here that this filter detects edges particularly in the case of curved boundaries and sharp corners, more accurately than popular filters in the recent literature. A mathematical argument is also provided to prove that the gradient magnitude of the convolved image with this filter has local maxima in discontinuities of the original image. The Bessel filter enjoys better overall performance (the product of the detection performance and localization indices) in Canny-like criteria than the state of art filters in the literature. Quantitative and qualitative evaluations of the edge detection algorithms investigated in this paper on synthetic and real world benchmark images confirm the theoretical results presented here, indicating the superiority of the Bessel filter over the popular edge detection filters. The numerical complexity of the algorithm proposed here is as low as any convolution-based edge detection algorithm
Algebraic Representation of Social Capital Matrix
No full textThis paper proposes a mathematical model based on a Boolean algebra involving a 44 social capital matrix [Shah (2008)], that emerges through interaction within and across individuals, communities, institutions and state. The framework provides a coding system for the existence or otherwise of various categories of social interaction. The model illustrates that social interaction can be neatly described in a format that facilitates the interpretation of social intra- and interactions among the four types of players in generating economic activity.Social Capital (Matrix), Linear Space, Interactive Systems, Boolean Algebra
- …
