The Financial Crimes Enforcement Network (FinCEN) is an agency of the U.S. Department of the Treasury that was established in 1990. Its primary mission is to combat financial crimes, including money laundering, terrorist financing, and other forms of illicit financial activities.
NeXtProt is a comprehensive knowledge database focused on human proteins. It provides detailed information about the protein-coding genes in the human genome, including their sequences, functions, localization, interactions, and involvement in various biological processes and diseases.
The Robodebt scheme, officially known as the Income Compliance Program, was a controversial program implemented by the Australian government aimed at identifying and recovering overpaid welfare benefits. The scheme used an automated data-matching system to compare income reported by welfare recipients with income data held by the Australian Taxation Office (ATO). If discrepancies were found, recipients could be issued a debt notice, requiring them to repay what was perceived to be overpaid support.
The A* search algorithm is a popular and efficient pathfinding and graph traversal algorithm used in computer science and artificial intelligence. It is commonly utilized in various applications, including route navigation, game development, and robotics. The algorithm combines features of both Dijkstra's algorithm and Greedy Best-First Search, allowing it to efficiently find the least-cost path to a target node.
3-opt is an optimization algorithm commonly used in the context of solving the Traveling Salesman Problem (TSP) and other routing problems. It is a local search improvement technique that refines a given tour (a sequence of vertices) by exploring small changes to reduce the overall tour length. The algorithm works by considering all possible ways to remove three edges from the tour and reconnect the resulting segments in a different way to create a new tour.
A Graph Neural Network (GNN) is a type of neural network specifically designed to work with data represented as graphs. Graphs are mathematical structures consisting of nodes (or vertices) connected by edges, which can represent various types of relationships between entities. Common applications for GNNs include social networks, molecular chemistry, recommendation systems, and knowledge graphs. ### Key Features of Graph Neural Networks: 1. **Graph Structure**: Unlike traditional neural networks that operate on grid-like data (e.g.
Lexicographic breadth-first search (Lex-BFS) is a specific order of traversal used in graph theory, particularly for directed and undirected graphs. It operates similar to a standard breadth-first search (BFS), but incorporates a lexicographic ordering to determine the order in which nodes are explored. ### Key Concepts: 1. **BFS Overview**: In a standard BFS, nodes are explored level by level, starting from a given source node.
Incremental learning is a machine learning paradigm where the model is trained continuously as new data arrives, rather than being trained on a fixed dataset all at once. This approach allows the system to learn from new information in a manner that is efficient and presents a number of advantages, such as: 1. **Adaptability**: The model can adapt to changes in the environment or data distribution over time without needing to be retrained from scratch.
Kernel Principal Component Analysis (KPCA) is a non-linear extension of Principal Component Analysis (PCA) that uses kernel methods to transform data into a higher-dimensional space. This transformation allows for the extraction of principal components that can capture complex, non-linear relationships in the data.
Minimum Redundancy Feature Selection (MRMR) is a feature selection method used primarily in machine learning and data mining to select a subset of relevant features from a larger set while minimizing redundancy among those features. The goal is to identify the most informative features that contribute to the predictive power of the model without introducing unnecessary overlap among the selected features. ### Key Concepts: 1. **Relevance**: Features that have a strong relationship with the target variable are considered relevant.
Mixture of Experts (MoE) is a machine learning architecture designed to improve model performance by leveraging multiple sub-models, or "experts," each specialized in different aspects of the data. The idea is to use a gating mechanism to dynamically select which expert(s) to utilize for a given input, allowing the model to adaptively allocate resources based on the complexity of the task at hand.
Online machine learning is a type of machine learning where the model is trained incrementally as new data becomes available, rather than being trained on a fixed dataset all at once (batch learning). This approach is particularly useful in scenarios where data arrives in a continuous stream, allowing the model to adapt and update itself continuously.
State–action–reward–state–action (SARSA) is an algorithm used in reinforcement learning for training agents to make decisions in environments modeled as Markov Decision Processes (MDPs). SARSA is an on-policy method, meaning that it learns the value of the policy being followed by the agent. The components of SARSA can be broken down as follows: 1. **State (S)**: This represents the current state of the environment in which the agent operates.
The Generic Cell Rate Algorithm (GCRA) is a traffic management mechanism used primarily in Asynchronous Transfer Mode (ATM) networks. It is important for ensuring that the traffic conforms to specified bandwidth and delay parameters, making it suitable for real-time applications such as voice and video.
Numerical differential equations refer to techniques and methods used to approximate solutions to differential equations using numerical methods, particularly when exact analytical solutions are difficult or impossible to obtain. Differential equations describe the relationship between a function and its derivatives and are fundamental in modeling various physical, biological, and engineering processes. ### Types of Differential Equations 1. **Ordinary Differential Equations (ODEs)**: These involve functions of a single variable and their derivatives.
The Slothouber–Graatsma puzzle is a type of mathematical or logical puzzle that is essentially a variation of a sliding puzzle often referred to as a "15 puzzle" or "sliding tile puzzle." In this puzzle, the objective is to slide tiles around on a grid to achieve a certain configuration, typically a numerical order or a specific pattern.
The List of Exoplanet Extremes highlights various exoplanets that possess remarkable characteristics or extremes in particular categories compared to other known exoplanets. These extremes can include factors such as size, mass, temperature, orbital period, and more. Some notable categories in this list could include: 1. **Largest Exoplanet**: This category often includes gas giants like WASP-17b, which is one of the largest known exoplanets.
A multiplanetary system refers to a planetary system that contains multiple planets orbiting a star. These systems can include a variety of different configurations and types of planets, such as gas giants, terrestrial planets, and ice giants. Here’s a brief overview of some well-known multiplanetary systems: ### 1.
A contig, short for "contiguous sequence," is a term commonly used in genomics and bioinformatics. It refers to a set of overlapping DNA segments that collectively represent a consensus sequence of a certain region of a genome. Contigs are formed during the process of assembling a genome from shorter DNA sequences, such as those obtained from sequencing technologies.
Approximation theory is a branch of mathematics that focuses on how functions can be approximated by simpler or more easily computable functions. It deals with the study of how to represent complex functions in terms of simpler ones and how to quantify the difference between the original function and its approximation. The field has applications in various areas, including numerical analysis, functional analysis, statistics, and machine learning, among others.

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