The Selfridge–Conway procedure is a method used in number theory, specifically related to the generation of prime numbers. Named after mathematicians John Selfridge and John Horton Conway, this procedure is a systematic approach to finding prime numbers by generating sequences or applying transformations to known numbers. The procedure is often discussed in the context of generating prime factors or understanding the properties of composite numbers.
Extremal Ensemble Learning is an advanced approach in the field of machine learning and ensemble methods, focusing on combining multiple models to achieve better predictive performance. While traditional ensemble methods like bagging and boosting aim to reduce variance and bias by averaging predictions or focusing on harder examples, Extremal Ensemble Learning takes a somewhat different approach. In general, the term "extremal" might refer to the idea of emphasizing or leveraging models that operate at the extremes of certain performance measures or decision boundaries.
The Junction Tree Algorithm is a method used in probabilistic graphical models, notably in Bayesian networks and Markov networks, to perform exact inference. The algorithm is designed to compute the marginal probabilities of a subset of variables given some evidence. It operates by transforming a graphical model into a junction tree, which is a specific type of data structure that facilitates efficient computation. ### Key Concepts 1. **Graphical Models**: These are representations of the structure of probability distributions over a set of random variables.
Knowledge graph embedding is a technique used to represent entities and relationships within a knowledge graph in a continuous vector space. A knowledge graph is a structured representation of knowledge where entities (such as people, places, or concepts) are represented as nodes and relationships between them are represented as edges. The primary goal of knowledge graph embedding is to capture the semantics of this information in a way that can be effectively utilized for various machine learning and natural language processing tasks.
Minimax is a decision-making algorithm often used in game theory, artificial intelligence, and computer science for minimizing the possible loss for a worst-case scenario while maximizing potential gain. It is primarily applied in two-player games, such as chess or tic-tac-toe, where one player seeks to maximize their score (the maximizing player) and the other to minimize the score of the opponent (the minimizing player). ### The Core Concepts of Minimax 1.
Tarjan's off-line lowest common ancestors (LCA) algorithm is a method used to efficiently find the lowest common ancestor of multiple pairs of nodes in a tree. The algorithm is named after Robert Tarjan, who developed it based on union-find data structures.
The Zero-weight cycle problem refers to scenarios in graph theory and algorithms, particularly in the context of finding paths in a weighted directed graph. Specifically, it is often associated with the Bellman-Ford algorithm, which is used to find the shortest paths from a source vertex to all other vertices in a graph that may contain negative weight edges. ### Key Points: 1. **Cycle Definition**: A cycle in a graph is a path that starts and ends at the same vertex.
In functional programming, a "map" is a higher-order function that applies a given function to each element of a collection (like a list or an array) and produces a new collection containing the results. The original collection remains unchanged, as map typically adheres to the principles of immutability. ### Key Characteristics of Map: 1. **Higher-Order Function**: Map takes another function as an argument and operates on each element of the collection.
Q-learning is a type of model-free reinforcement learning algorithm used in the context of Markov Decision Processes (MDPs). It allows an agent to learn how to optimally make decisions by interacting with an environment to maximize a cumulative reward. Here's a breakdown of the key concepts involved in Q-learning: 1. **Agent and Environment**: In Q-learning, an agent interacts with an environment by performing actions and receiving feedback in the form of rewards.
Mathematical optimization is a branch of mathematics that deals with finding the best solution (or optimal solution) from a set of possible choices. It involves selecting the best element from a set of available alternatives based on certain criteria defined by a mathematical objective function, subject to constraints. Here are some key components of mathematical optimization: 1. **Objective Function**: This is the function that needs to be maximized or minimized.
Stigmatism, often misspelled as "stigmatism," refers to a visual defect known as astigmatism. Astigmatism is a common refractive error caused by an irregular shape of the cornea or lens in the eye. Instead of having a perfectly rounded shape, the cornea or lens may be shaped more like a football or an egg, which results in light rays being focused at multiple points, rather than converging at a single point on the retina.
Gradient Discretisation Method (GDM) is a numerical method used in the context of solving partial differential equations (PDEs), particularly those arising in fluid dynamics and other fields of continuum mechanics. The GDM is designed to achieve a balance between accuracy and computational efficiency, especially when dealing with the advection-dominated problems that are common in these fields.
In optics, the term "pencil" refers to a narrow beam of light rays that are closely parallel to each other as they travel through space or an optical system. This concept is often used when discussing the behavior of light as it passes through lenses and mirrors. A pencil of light can be visualized as a collection of rays that originate from a point source and are directed into a narrow spread, maintaining a relatively uniform direction as they propagate.
The radius of curvature in optics refers to the radius of a spherical surface that shapes a lens or mirror. Specifically, it is the radius of the sphere from which the optical surface is a segment. This concept is particularly important in the design and analysis of lenses and mirrors, as it influences how light is refracted or reflected by the surface.
Diversity-generating retroelements (DGRs) are a class of genetic elements that have the ability to introduce variability into the genetic sequences of their host organisms. They are primarily found in certain bacteria and archaea and are characterized by their unique mechanism of generating diversity. The key features of DGRs include: 1. **Mechanism of Variation**: DGRs utilize a process involving reverse transcription to create diversity.
EcoRI is a restriction enzyme, specifically a type II restriction endonuclease, that is widely used in molecular biology. It is derived from the bacterium *Escherichia coli* (hence the name "Eco") and was first identified in the 1970s. EcoRI recognizes and cuts DNA at a specific sequence of six nucleotides: GAATTC.
The term "mitointeractome" refers to the comprehensive network of interactions and relationships between proteins, genes, and other molecules that are specifically associated with the mitochondria, the organelles responsible for energy production and various metabolic processes in eukaryotic cells. The mitointeractome encompasses the various proteins that reside within mitochondria or interact with mitochondrial components, highlighting the complexity of mitochondrial function and its integration with cellular processes.
Homing endonucleases are a class of enzymes that recognize specific DNA sequences and introduce double-strand breaks in the DNA at these sites. They are characterized by their ability to "home" in on specific target sequences within a genome, which makes them particularly useful for genetic engineering and genome editing applications. These enzymes typically recognize longer, unique DNA sequences compared to typical restriction enzymes, allowing for more precise targeting.
A reporter gene is a gene that researchers use to study the activity of other genes or regulatory sequences. It is typically a gene that encodes a protein producing an easily measurable signal, such as fluorescence or color change, which can be quantitated. Reporter genes are often used in molecular biology and genetics to monitor gene expression, track cellular processes, or evaluate the efficacy of different treatments.
Subcloning is a molecular biology technique that involves the transfer of a specific DNA fragment (such as a gene, promoter, or regulatory element) from one plasmid or vector to another. This process is used to create a new DNA construct with desired features, often for research, genetic engineering, or therapeutic applications. Key steps in subcloning typically include: 1. **Restriction Digestion**: The original DNA fragment and the new vector are cut with specific restriction enzymes to create compatible ends.

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!
We have two killer features:
  1. 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-calculus
    Articles 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/derivative
  2. 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.
    Figure 2.
    You can publish local OurBigBook lightweight markup files to either https://OurBigBook.com or as a static website
    .
    Figure 3.
    Visual Studio Code extension installation
    .
    Figure 4.
    Visual Studio Code extension tree navigation
    .
    Figure 5.
    Web editor
    . 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.
    Video 4.
    OurBigBook Visual Studio Code extension editing and navigation demo
    . Source.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
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