SAGE Research Methods · 2021
<section class="page-section"><div id="i44" class="featureboxedText"><div class="head"><span>Observable</span></div><div id="i45" class="aside"><div id="i46" class="figure floatinline"><img src="/images/virtual/observable/10.4135_9781529775839-img1.jpg" alt="" class="graphic"></div></div> <span class="hi-bold">Price:</span> Free & Paid <span class="hi-bold">Open Source?:</span> Open Source <span class="hi-bold">Platform(s):</span> Web </div></section><section class="page-section"><div id="i48" class="figure floatinline"><section class="page-subsection"><div id="s10.4135_9781529775839-fig1-longdesc" class="longdesc"> A search bar is on the top left side of the page. The tabs on the top right side of the page are Home, Product, Teams, and About. The buttons on the top right corner are Try Now and Sign In. Text on the left side reads, “Make sense of the world with data, together.” A button under the text is labelled, “Get started with Observable.” Text on the right side reads, “Explore, visualize, and analyze data. Collaborate with the community. Learn and be inspired. Share insights with the world.” A link under the text is labelled, Learn more. </div></section><img src="/images/virtual/observable/10.4135_9781529775839-fig1.jpg" alt="A screenshot shows the home page of Observable." corresp="s10.4135_9781529775839-fig1-longdesc" class="graphic"></div></section> Observable is a web-native, notebook-format environment that enables you to explore, visualize, and analyse data. It operates similarly to Jupyter Notebook for Python, but this time for JavaScript, HTML, and/or CSS. Many organizations and universities utilize Observable notebooks, such as NBC News, The Economist, MIT, and the University of Washington. To get started with Observable, create ...
Cited by 0
Paul Busch, Pekka Lahti · Compendium of Quantum Physics · 2009
Cited by 3
R. Horvat · 2013
Cited by 0
Hiroshi Shigano · Tsukuba Journal of Mathematics · 1982
Let $\mathfrak{G}=\mathfrak{S}\mathfrak{p}_{k}A$ be an affine group scheme over a ground field $k,$ $\mathfrak{H}=\mathfrak{S}\mathfrak{p}_{k}A/I$ a closed subgroup scheme and $\overline{k}$ denote an algebraic closure of $k$ . When $\mathfrak{G}$ is algebraic and $\mathfrak{G}(k)$ is dense in $\mathfrak{G}(\overline{k})$ , Bialynichi-Birula, Hochschild and Mostow defined in their paper When $\mathfrak{G}$ is algebraic and reduced, and $k=\overline{k}$ , Cline, Parshall and Scott defined in their paper [2] that $\mathfrak{H}(k)$ is strongly observable in $\mathfrak{G}(k)$ if every rational $\mathfrak{H}(k)$ -module $N$ can be embedded in a rational $\mathfrak{G}(k)$ -module $M$ as a $\mathfrak{H}(k)$ -module such that $N^{\mathfrak{H}(k)}=M^{\mathfrak{G}(k)}$ , and showed that one of its necessary and sufficient conditions is $\mathfrak{G}(k)/\mathfrak{H}(k)$ being an affine variety. Since these concepts are the representation-theoretic ones, we can extend them to a Hopf ideal of an arbitrary (not necessarily commutative) Hopf algebra. In this paper, we characterize a strongly observable Hopf ideal of an arbitrary Hopf algebra; a Hopf ideal $I$ of a Hopf algebra $A$ is strongly observable if and only if $A$ is an injective $A/I$ -comodule. This result and the one of M. Takeuchi This is a generalization of a main theorem in [2]. In case of observable Hopf ideals, we do not have such a general characterization except the case when Hopf algebras are commutative. So we can extend some results in One of them is that $\mathfrak{G}/\mathfrak{H}\approx$ is quasi-affine if and only if $I$ is observable in $A$ and $R=A\coprod_{A/I}k$ contains a simple left coideal $M$ such that $M\subset\sqrt{\mathfrak{A}}$ for any left coideal-ideal $\mathfrak{A}$ in $R$ , where $\square $ denotes the cotensor product (see the first section).
Cited by 3Open access
Vieglais, David · Zenodo (CERN European Organization for Nuclear Research) · 2025
Cited by 0Open access
Raphael Bousso, Massimo Porrati · Physical review. D/Physical review. D. · 2017
We show that large gauge transformations in asymptotically flat spacetime can be implemented by sandwiching a shell containing the ingoing hard particles between two finite-width shells of soft gauge excitations. Integration of the graviton Dirac bracket implies that our observable soft degrees of freedom obey the algebra imposed by Strominger et al. on unobservable boundary degrees of freedom. Thus, we provide both a derivation and an observable realization of this algebra. We recently showed that soft charges fail to constrain the hard scattering problem, and so cannot be relevant to the black hole information paradox. By expressing the Bondi--van der Burg--Metzner--Sachs (BMS) algebra in terms of observable quantities, the present work shows that this conclusion was not an artifact of working with strictly zero frequency soft modes. The conservation laws associated with asymptotic symmetries are seen to arise physically from free propagation of infrared modes.
Cited by 35Open access
Vieglais, Dave · Figshare · 2025
Evaluating access to live resources in figshare.
Cited by 0Open access
Vieglais, Dave · Figshare · 2025
Evaluating access to live resources in figshare.
Cited by 0Open access
Ishii, Ryosuke · RePEc: Research Papers in Economics
We consider a game with " meta-players" who observe each other's actions before actual play. The observability exerts an effect like repeated games without discounting. The game has Nash equilibria with any individually rational payoff profiles. In addition, the outcomes that satisfy a modified version of evolutionary stability lead to Pareto efficiency in coordination games.
Cited by 0
Bousso, Raphael, Porrati, Massimo · arXiv (Cornell University) · 2017
We show that large gauge transformations in asymptotically flat spacetime can be implemented by sandwiching a shell containing the ingoing hard particles between two finite-width shells of soft gauge excitations. Integration of the graviton Dirac bracket implies that our observable soft degrees of freedom obey the algebra imposed by Strominger on unobservable boundary degrees of freedom. Thus, we provide both a derivation and an observable realization of this algebra. The conservation laws associated with asymptotic symmetries are seen to arise physically from free propagation of infrared modes. This explains in physical terms our recent result that soft charges fail to constrain the hard scattering problem, and so cannot be relevant to the black hole information paradox.
Cited by 0Open access
Raphaël Jungers, Vincent, D. Blondel · 2008
Abstract. An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge colors. When the agent is able to determine his position only from time to time, the graph is said to be partly observable. Observability in graphs is desirable in situations where autonomous agents are moving on a network and one wants to localize them (or the agent wants to localize himself) with limited information. In this paper, we completely characterize observable and partly observable graphs and show how these concepts relate to observable discrete event systems and to local automata. Based on these characterizations, we provide polynomial time algorithms to decide observability, to decide partial observability, and to compute the minimal number of observations necessary for finding the position of an agent. In particular we prove that in the worst case this minimal number of observations increases quadratically with the number of nodes in the graph. From this it follows that it may be necessary for an agent to pass through the same node several times before he is finally able to determine his position in the graph. We then consider the more difficult question of assigning colors to a graph so as to make it observable and we prove that two different versions of this problem are NP-complete. 1.
Cited by 0
Ishii, Ryosuke, 7675 · Barrel (Otaru University of Commerce) · 2012
本文ファイルを差し替え（2012年11月12日）
Cited by 0
Wafa Elmannai, Varun Pande, Ajay Shrestha et al. · 2013
Over the last decade, many researchers have studied the implementation of quantum systems and the states of the quantum systems. Most of the focus has been on the quantum states strategy. Researchers have found it to be more advanced than classical strategies. Complementary quantum Observables interaction and information are the most important features that are refereed by Observables. This shows us how uniquely these features can define a packet of information in mathematical terms as a state. Also, it provides technological information that indeed captures the properties of quantum systems. In this paper, we demonstrate how to implement certain logical methods in quantum computing to obtain more accurate information than classical computing systems provide. This new methodology can make the computation more efficient. First, we examine the photons and consider the various spin states, and then we consider the direction of the spinning photons to handle more information. Next, we use the unique property of photons to behave both as a wave and a particle and exploit it by passing the photon through mirrors and beam splitters to demonstrate and achieve results that are not possible in the classical world.
Cited by 1
Arthur F. Bentley · Psychological Review · 1940
Cited by 4
Raphaël M. Jungers, Vincent D. Blondel · ArXiv.org · 2007
An edge-colored directed graph is \emph{observable} if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge colors. When the agent is able to determine his position only from time to time, the graph is said to be \emph{partly observable}. Observability in graphs is desirable in situations where autonomous agents are moving on a network and one wants to localize them (or the agent wants to localize himself) with limited information. In this paper, we completely characterize observable and partly observable graphs and show how these concepts relate to observable discrete event systems and to local automata. Based on these characterizations, we provide polynomial time algorithms to decide observability, to decide partial observability, and to compute the minimal number of observations necessary for finding the position of an agent. In particular we prove that in the worst case this minimal number of observations increases quadratically with the number of nodes in the graph. From this it follows that it may be necessary for an agent to pass through the same node several times before he is finally able to determine his position in the graph. We then consider the more difficult question of assigning colors to a graph so as to make it observable and we prove that two different versions of this problem are NP-complete.
Cited by 0Open access
Brian Winston (17170279) · Figshare · 2024
Cited by 0Open access
2016
Cited by 0
Virgil Zeigler-Hill, Todd K. Shackelford · 2020
Cited by 0
Pascal Richet · 2001
Cited by 1
John F. McCauley · Cambridge University Press eBooks · 2017
Cited by 0