Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
TLS termination occurs at a TLS peer that decrypts incoming records and participates in the channel authentication and key agreement. An intermediary terminating one TLS channel and initiating another is an endpoint of each channel, not an opaque forwarder.
A scalar field unchanged by every translation parallel to a specified plane depends only on the coordinate normal to that plane. For electrostatics between ideal infinite parallel plates, this reduces Laplace's equation to . Finite plate edges break the exact symmetry and produce fringing field.
A particle track projected onto the plane perpendicular to a uniform magnetic field is a circular arc with radius . Here is the momentum component perpendicular to the magnetic field; it is the collider transverse momentum when the field follows the beam axis. For chord length and sagitta , circle geometry givesFor a short arc with , this yieldsThe measurement uncertainty follows by differentiating the inverse relation, treating and as known. A fixed spatial measurement uncertainty therefore makes fractional momentum uncertainty grow with momentum, whereas increasing the lever arm improves it quadratically in this idealization. Multiple Coulomb scattering, field uncertainties and alignment add other contributions; a helical particle track also requires its pitch to recover the full momentum.[ref]
Review of Particle Physics by Particle Data Group (2022). Particle detectors at accelerators, section 35.12.1, equation 35.49: sagitta and magnetic momentum analysis
A measure of toroidal field-line turns per poloidal turn. In the circular large-aspect-ratio approximation, geometry gives . With Ampère's law, , so the edge value relates the field-line pitch to the toroidal plasma current. This geometrical estimate alone does not establish stability for a complete current profile.
A task framework using video narratives to manipulate emotionality and mental-state reasoning separately. Affect and compassion ratings, reasoning accuracy and confidence can be analysed as distinct outcomes.
An embedded clause serving as a complement, such as “that the toy is in the box” in “she says that the toy is in the box”. The full report can be true even when the embedded proposition is false, making such constructions relevant to distinguishing a representation from reality.[ref]
The influence of language on theory of mind by Courtney Melinda Hale and Helen Tager-Flusberg. Developmental Science 6, 346–359; random allocation to complement, false-belief or relative-clause training
An impairment in grammatical structure in production or comprehension. It is not equivalent to reduced speech rate, dysarthria or all forms of aphasia; task design must separate grammatical dependencies from lexical and memory demands.
A description of structural demands in a sentence, such as a noncanonical dependency. Its operational definition should be explicit; longer strings, unfamiliar words and greater working-memory load do not define syntax by themselves.
A proposal that structured symbolic representation and manipulation provide a basis for general intelligent action. It is a claim about computation to be evaluated empirically, rather than a mathematical theorem equating every particular symbolic program with intelligence.[ref]
Computer science as empirical inquiry: symbols and search by Allen Newell and others. Communications of the ACM 19, pp. 113–126, physical symbol systems and search
The length of a longest repeated substring equals the maximum longest-common-prefix length over adjacent suffixes in lexicographic order. Suffixes beginning with a fixed string form a consecutive interval: a string outside that string prefix software class differs earlier or ends sooner, putting it strictly to one side. Two occurrences of a longest repeated substring therefore bound an interval in which every adjacent pair shares that string prefix. At least one adjacent pair attains its length, and no pair can exceed the global maximum. This proves the result even when occurrences overlap; a text with fewer than two suffixes needs a separate empty-result convention.
A form of scientific realism emphasizing warranted knowledge of physical relations or structure despite changes in proposed underlying entities. An account must specify which interpreted relations survive and in which domains, rather than merely point to recurring notation.[ref]
Structural Realism: The Best of Both Worlds? by John Worrall. discussion of the Fresnel–Maxwell transition
A predicate whose ground facts are unchanged by every action in a planning model. Object types and a fixed adjacency relation are common examples. Static conditions can filter ground actions before search; they need not acquire a separate truth variable at every time layer. A planning fluent can instead be added or deleted by actions.
A parameterized action definition with typed parameters, preconditions, add effects and delete effects. Replacing its parameters by type-correct objects yields a ground action. Type restrictions and static inequalities can remove invalid instantiations before the action is considered by a search algorithm or SATPlan.
Automated planning with ground actions that are always applicable because their precondition sets are empty. Delete effects are still permitted, so taking the union of all add effects does not decide reachability. With a positive conjunctive goal, the last-achiever algorithm for precondition-free planning gives a polynomial-time algorithm.
A longest repeated substring is a maximum-length contiguous string occurring at two distinct starting positions in a text. The occurrences may overlap unless a nonoverlap constraint is explicitly imposed. It can be found by comparing all pairs of suffixes, or by taking the maximum longest-common-prefix length of adjacent entries of a suffix array. The latter characterization concerns correctness; the time needed to build the suffix array depends on the construction algorithm.
The positive mean loss of projectile kinetic energy per path length through electronic excitation and ionization, conventionally . Dividing by absorber density gives mass stopping power.
The stochastic spread of particle energy losses around their mean after traversal of matter. It broadens the endpoint of a particle beam and is distinct from the mean stopping power.
A decrease in a projectile's energy by transfer to matter or emitted radiation. Mean loss per unit path length defines stopping power; its event-to-event variation is energy-loss straggling.
A maximum near the end of the depth-dose curve of a charged-particle beam, associated with increasing stopping power during slowing. Its precise width and distal tail depend on beam spread and particle transport.
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





