اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدFeeds as Query Result Serializations
35
0
0.0
(
0
)
تأليف
Erik Wilde
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Many Web-based data sources and services are available as feeds, a model that provides consumers with a loosely coupled way of interacting with providers. The current feed model is limited in its capabilities, however. Though it is simple to implement and scales well, it cannot be transferred to a wider range of application scenarios. This paper conceptualizes feeds as a way to serialize query results, describes the current hardcoded query semantics of such a perspective, and surveys the ways in which extensions of this hardcoded model have been proposed or implemented. Our generalized view of feeds as query result serializations has implications for the applicability of feeds as a generic Web service for any collection that is providing access to individual information items. As one interesting and compelling class of applications, we describe a simple way in which a query-based approach to feeds can be used to support location-based services.
قيم البحث
اقرأ أيضاً
Knowledge graphs (KG) that model the relationships between entities as labeled edges (or facts) in a graph are mostly constructed using a suite of automated extractors, thereby inherently leading to uncertainty in the extracted facts. Modeling the un
certainty as probabilistic confidence scores results in a probabilistic knowledge graph. Graph queries over such probabilistic KGs require answer computation along with the computation of those result probabilities, aka, probabilistic inference. We propose a system, HAPPI (How Provenance of Probabilistic Inference), to handle such query processing. Complying with the standard provenance semiring model, we propose a novel commutative semiring to symbolically compute the probability of the result of a query. These provenance-polynomiallike symbolic expressions encode fine-grained information about the probability computation process. We leverage this encoding to efficiently compute as well as maintain the probability of results as the underlying KG changes. Focusing on a popular class of conjunctive basic graph pattern queries on the KG, we compare the performance of HAPPI against a possible-world model of computation and a knowledge compilation tool over two large datasets. We also propose an adaptive system that leverages the strengths of both HAPPI and compilation based techniques. Since existing systems for probabilistic databases mostly focus on query computation, they default to re-computation when facts in the KG are updated. HAPPI, on the other hand, does not just perform probabilistic inference and maintain their provenance, but also provides a mechanism to incrementally maintain them as the KG changes. We extend this maintainability as part of our proposed adaptive system.
Age of Information (AoI) has become an important concept in communications, as it allows system designers to measure the freshness of the information available to remote monitoring or control processes. However, its definition tacitly assumes that ne
w information is used at any time, which is not always the case: the instants at which information is collected and used are dependent on a certain query process. We propose a model that accounts for the discrete time nature of many monitoring processes, considering a pull-based communication model in which the freshness of information is only important when the receiver generates a query: if the monitoring process is not using the value, the age of the last update is irrelevant. We then define the Age of Information at Query (QAoI), a more general metric that fits the pull-based scenario, and show how its optimization can lead to very different choices from traditional push-based AoI optimization when using a Packet Erasure Channel (PEC) and with limited link availability. Our results show that QAoI-aware optimization can significantly reduce the average and worst-case perceived age for both periodic and stochastic queries.
Two one-parameter families of twists providing kappa-Minkowski * -product deformed spacetime are considered: Abelian and Jordanian. We compare the derivation of quantum Minkowski space from two perspectives. The first one is the Hopf module algebra p
oint of view, which is strictly related with Drinfelds twisting tensor technique. The other one relies on an appropriate extension of deformed realizations of nondeformed Lorentz algebra by the quantum Minkowski algebra. This extension turns out to be de Sitter Lie algebra. We show the way both approaches are related. The second path allows us to calculate deformed dispersion relations for toy models ensuing from different twist parameters. In the Abelian case one recovers kappa-Poincare dispersion relations having numerous applications in doubly special relativity. Jordanian twists provide a new type of dispersion relations which in the minimal case (related to Weyl-Poincare algebra) takes an energy-dependent linear mass deformation form.
We present the first complete measurement of the Chinese Internet topology at the autonomous systems (AS) level based on traceroute data probed from servers of major ISPs in mainland China. We show that both the Chinese Internet AS graph and the glob
al Internet AS graph can be accurately reproduced by the Positive-Feedback Preference (PFP) model with the same parameters. This result suggests that the Chinese Internet preserves well the topological characteristics of the global Internet. This is the first demonstration of the Internets topological fractality, or self-similarity, performed at the level of topology evolution modeling.
Fermi has discovered two giant gamma-ray-emitting bubbles that extend nearly 10 kpc in diameter. We propose that periodic star capture processes by the galactic supermassive black hole, Sgr A*, with a capture rate $<10^{-5}$ yr$^{-1}$ and energy rele
ase $sim 10^{52}$ erg per one capture can produce shocks in the halo, which accelerate electrons to the energy ~ 1 TeV. These electrons generate radio emission via synchrotron radiation, and gamma-rays via inverse Compton scattering with the relic and the galactic soft photons. Estimates of the diffusion coefficient from the observed gamma-ray flux explains consistently the necessary maximum energy of electrons and sharp edges of the bubble.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
