11,207 research outputs found
Bibliometric cartography of information retrieval research by using co-word analysis
The aim of this study is to map the intellectual structure of the field of Information Retrieval (IR) during the period of 1987-1997. Co-word analysis was employed to reveal patterns and trends in the IR field by measuring the association strengths of terms representative of relevant publications or other texts produced in IR field. Data were collected from Science Citation Index (SCI) and Social Science Citation Index (SSCI) for the period of 1987-1997. In addition to the keywords added by the SCI and SSCI databases, other important keywords were extracted from titles and abstracts manually. These keywords were further standardized using vocabulary control tools. In order to trace the dynamic changes of the IR field, the whole 11-year period was further separated into two consecutive periods: 1987-1991 and 1992-1997. The results show that the IR field has some established research themes and it also changes rapidly to embrace new themes
Scalable Emulation of Sign-ProblemFree Hamiltonians with Room Temperature p-bits
The growing field of quantum computing is based on the concept of a q-bit
which is a delicate superposition of 0 and 1, requiring cryogenic temperatures
for its physical realization along with challenging coherent coupling
techniques for entangling them. By contrast, a probabilistic bit or a p-bit is
a robust classical entity that fluctuates between 0 and 1, and can be
implemented at room temperature using present-day technology. Here, we show
that a probabilistic coprocessor built out of room temperature p-bits can be
used to accelerate simulations of a special class of quantum many-body systems
that are sign-problemfree or stoquastic, leveraging the well-known
Suzuki-Trotter decomposition that maps a -dimensional quantum many body
Hamiltonian to a +1-dimensional classical Hamiltonian. This mapping allows
an efficient emulation of a quantum system by classical computers and is
commonly used in software to perform Quantum Monte Carlo (QMC) algorithms. By
contrast, we show that a compact, embedded MTJ-based coprocessor can serve as a
highly efficient hardware-accelerator for such QMC algorithms providing several
orders of magnitude improvement in speed compared to optimized CPU
implementations. Using realistic device-level SPICE simulations we demonstrate
that the correct quantum correlations can be obtained using a classical
p-circuit built with existing technology and operating at room temperature. The
proposed coprocessor can serve as a tool to study stoquastic quantum many-body
systems, overcoming challenges associated with physical quantum annealers.Comment: Fixed minor typos and expanded Appendi
Anisotropic strange stars in Tolman-Kuchowicz spacetime
We attempt to study a singularity-free model for the spherically symmetric
anisotropic strange stars under Einstein's general theory of relativity by
exploiting the Tolman-Kuchowicz metric. Further, we have assumed that the
cosmological constant is a scalar variable dependent on the spatial
coordinate . To describe the strange star candidates we have considered that
they are made of strange quark matter (SQM) distribution, which is assumed to
be governed by the MIT bag equation of state. To obtain unknown constants of
the stellar system we match the interior Tolman-Kuchowicz metric to the
exterior modified Schwarzschild metric with the cosmological constant, at the
surface of the system. Following Deb et al. we have predicted the exact values
of the radii for different strange star candidates based on the observed values
of the masses of the stellar objects and the chosen parametric values of the
as well as the bag constant . The set of solutions
satisfies all the physical requirements to represent strange stars.
Interestingly, our study reveals that as the values of the and
increase the anisotropic system becomes gradually smaller in size
turning the whole system into a more compact ultra-dense stellar object.Comment: 18 pages, 10 figure
Machine Learning Quantum Systems with Magnetic p-bits
The slowing down of Moore's Law has led to a crisis as the computing
workloads of Artificial Intelligence (AI) algorithms continue skyrocketing.
There is an urgent need for scalable and energy-efficient hardware catering to
the unique requirements of AI algorithms and applications. In this environment,
probabilistic computing with p-bits emerged as a scalable, domain-specific, and
energy-efficient computing paradigm, particularly useful for probabilistic
applications and algorithms. In particular, spintronic devices such as
stochastic magnetic tunnel junctions (sMTJ) show great promise in designing
integrated p-computers. Here, we examine how a scalable probabilistic computer
with such magnetic p-bits can be useful for an emerging field combining machine
learning and quantum physics
Large magnetocapacitance in electronic ferroelectric manganite systems
We have observed a sizable positive magnetocapacitance () in
perovskite PrCaMnO and bilayer
Pr(SrCa)MnO system under 5T magnetic field across
20-100 K below the magnetic transition point T. The magnetodielectric
effect, on the other hand, exhibits a crossover: (a) from positive to negative
for the perovskite system and (b) from negative to positive for the bilayer
system over the same temperature range. The bilayer
Pr(SrCa)MnO system exhibits a sizable anisotropy as
well. We have also noticed the influence of magnetic field on the dielectric
relaxation characteristics of these systems. These systems belong to a class of
improper ferroelectrics and are expected to exhibit charge/orbital order driven
ferroelectric polarization below the transition point T. Large
magnetocapacitance in these systems shows typical multiferroic behavior even
though the ferroelectric polarization is small in comparison to that of other
ferroelectrics.Comment: 6 pages with 5 embedded figures; accepted for publication in J. Appl.
Phy
A simulation model for video traffic performance via ATM over TCP/IP
Although TCP has emerged as the standard in data communication, the introduction of ATM technology has raised numerous problems regarding the effectiveness of using TCP over A TM networks, especially when video traffic performance is considered. This paper presents a simulation model for transmission performance of video traffic via ATM over TCP/IP. The interactivity between TCP/IP and ATM, generation of MPEG traffic and evaluation of traffic performance are implemented in the model. The design and implementation details of the model are carefully described. The experiments conducted using the model and experimental results are briefly introduced, revealing the capability of our model in simulating network events and in evaluating potential solutions to performance issues.<br /
On Using Active Learning and Self-Training when Mining Performance Discussions on Stack Overflow
Abundant data is the key to successful machine learning. However, supervised
learning requires annotated data that are often hard to obtain. In a
classification task with limited resources, Active Learning (AL) promises to
guide annotators to examples that bring the most value for a classifier. AL can
be successfully combined with self-training, i.e., extending a training set
with the unlabelled examples for which a classifier is the most certain. We
report our experiences on using AL in a systematic manner to train an SVM
classifier for Stack Overflow posts discussing performance of software
components. We show that the training examples deemed as the most valuable to
the classifier are also the most difficult for humans to annotate. Despite
carefully evolved annotation criteria, we report low inter-rater agreement, but
we also propose mitigation strategies. Finally, based on one annotator's work,
we show that self-training can improve the classification accuracy. We conclude
the paper by discussing implication for future text miners aspiring to use AL
and self-training.Comment: Preprint of paper accepted for the Proc. of the 21st International
Conference on Evaluation and Assessment in Software Engineering, 201
- β¦