Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Scala Swing provides Scala wrappers for Java Swing graphical user interfaces. Its notification mechanism implements an observer pattern: a publisher emits software events, and a reactor subscribes with
listenTo(publisher). Adding a handler to reactions supplies a partial function that matches the software events the reactor handles. Subscription and handling are distinct: one determines which publisher is heard, and the other determines what to do with a matching notification.[ref]For example, a button publishes a button-click notification, and a subscribed display component handles it by updating a label. Another publisher's notifications need a subscription of their own. Calling
deafTo(publisher) ends the subscription to that publisher without requiring removal of every handler.[ref]Rydberg blockade suppresses simultaneous excitation of nearby chemical atoms into strongly interacting Rydberg atom states. If the interaction shifts the doubly excited level by much more than the excitation linewidth and coherent drive scale, a pulse resonant for one isolated chemical atom becomes off-resonant when a neighbour is already excited. The resulting conditional dynamics can implement an entangling two-qubit gate for neutral-atom qubits.
In Thomas Kuhn's account, research conducted within an accepted framework of exemplary achievements, problems and methods.[ref]
The Structure of Scientific Revolutions by Thomas Kuhn. Introduction
Consider a bridge driven across opposite nodes, with upper-path arms and , lower-path arms and , and a null detector between the path midpoints. Equality of midpoint voltages gives . At nonzero frequency, substitution and comparison of real and imaginary parts yield the displayed resistance and inductance. The formulas depend on the variable arm being parallel; treating it as a series arm gives a different circuit.
An observable feature of source code suggesting a possible underlying design problem. It prompts investigation rather than proving a defect. Duplicate code, feature envy and a long method suggest potential transformations, and context can justify leaving an apparent smell unchanged.[ref]
Recursion in which the recursive call is the last operation required to obtain the current call's result. An accumulator can encode the state that would otherwise be updated by a loop. A suitable compiler can replace the call by a jump, avoiding growing call stack storage. In Scala, a tail-recursion annotation requests a check that the recursive method is eligible for this transformation.
A recursion tree records recursive calls as nodes and their direct recursive subcalls as children. Its node labels can record the work done outside those subcalls. Summing the work over levels or charging it to nodes proves a total running time bound. For , level has approximately instances of size , so its nonrecursive work is . Summing those quantities explains the cases of the master theorem.
A receptor responding to serotonin. Subtypes differ in signalling and distribution, so increasing transmitter availability can affect several mechanisms at once.
A succession of radioactive decays in which a daughter can itself be unstable. For a closed unit-branching chain with stable , the population rate equations are , and . They conserve . Sequential radioactive decay gives the two-member transient solution; coincident nuclear decay constants require the continuous limit containing .
The radioactive decay constant is the probability per unit time that one surviving atomic nucleus decays in the simple constant-rate model. It gives and hence for the mean surviving population.
The radioactive activity is , the mean lifetime is , and the half-life is . These are different quantities: a large sample can have high radioactive activity even when each atomic nucleus has a small decay rate. Counting successive time intervals tests the exponential model, but background, detection efficiency and daughter radioactive activity affect the observed counts. A constant decay constant describes stochastic individual events, not a scheduled time at which each atomic nucleus must decay.
The number of independent quantum states sharing one energy eigenvalue. A level of angular momentum has magnetic substates when no interaction splits them.
A communication channel whose messages are public but whose origin and integrity are authenticated. In quantum key distribution, Eve may read basis announcements and reconciliation data, but must not be able to replace them while impersonating a legitimate party. Authentication itself consumes a prior trust resource; the quantum transmission does not authenticate the classical peer automatically.
Selecting the raw key rounds from announced measurement settings and other public acceptance data. Outcomes revealed for parameter estimation must be excluded from the secret raw key. Basis announcements follow receipt of the quantum systems; premature basis announcement in quantum key distribution can permit a memory attack.
Classical error correction used to make two candidate keys agree. The disclosed information is part of the eavesdropper's side information and must be included when choosing the amount of privacy amplification.
The disagreement probability of Alice's and Bob's sifted bits under their agreed outcome-to-bit maps. A finite test sample estimates this probability; the estimate and its uncertainty enter parameter estimation before information reconciliation and privacy amplification.
A quantum field theory assigning vector spaces to closed spatial manifolds and linear maps to interpolating spacetime cobordisms, compatibly with composition and disjoint union. Its TQFT partition function on is the trace of the identity of the state space on , hence its dimension.
A verification scheme using quantum states as part of a banknote or token. Secret-basis qubits can make extra copies hard to produce because their encodings are nonorthogonal. Security claims must specify the adversary's information, access to original tokens and the verification procedure; the no-cloning theorem alone does not fix every forging probability.
Pinned article: Introduction to the OurBigBook Project
Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
Intro to OurBigBook
. Source. We have two killer features:
- topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculusArticles of different users are sorted by upvote within each article page. This feature is a bit like:
- a Wikipedia where each user can have their own version of each article
- a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.Figure 1. Screenshot of the "Derivative" topic page. View it live at: ourbigbook.com/go/topic/derivativeVideo 2. OurBigBook Web topics demo. Source. - local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.Figure 5. . You can also edit articles on the Web editor without installing anything locally. Video 3. Edit locally and publish demo. Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension. - Infinitely deep tables of contents:
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact





