Bottom trawlingBottom trawling is trawling (towing a trawl, which is a fishing net) along the seafloor. It is also referred to as "dragging". The scientific community divides bottom trawling into benthic trawling and demersal trawling. Benthic trawling is towing a net at the very bottom of the ocean and demersal trawling is towing a net just above the benthic zone. Bottom trawling can be contrasted with midwater trawling (also known as pelagic trawling), where a net is towed higher in the water column.
AlgorithmIn mathematics and computer science, an algorithm (ˈælɡərɪðəm) is a finite sequence of rigorous instructions, typically used to solve a class of specific problems or to perform a computation. Algorithms are used as specifications for performing calculations and data processing. More advanced algorithms can use conditionals to divert the code execution through various routes (referred to as automated decision-making) and deduce valid inferences (referred to as automated reasoning), achieving automation eventually.
Bottom quarkThe bottom quark or b quark, also known as the beauty quark, is a third-generation heavy quark with a charge of −1/3 e. All quarks are described in a similar way by electroweak and quantum chromodynamics, but the bottom quark has exceptionally low rates of transition to lower-mass quarks. The bottom quark is also notable because it is a product in almost all top quark decays, and is a frequent decay product of the Higgs boson. The bottom quark was first described theoretically in 1973 by physicists Makoto Kobayashi and Toshihide Maskawa to explain CP violation.
Triple bottom lineThe triple bottom line (or otherwise noted as TBL or 3BL) is an accounting framework with three parts: social, environmental (or ecological) and economic. Some organizations have adopted the TBL framework to evaluate their performance in a broader perspective to create greater business value. Business writer John Elkington claims to have coined the phrase in 1994. In traditional business accounting and common usage, the "bottom line" refers to either the "profit" or "loss", which is usually recorded at the very bottom line on a statement of revenue and expenses.
Greedy algorithmA greedy algorithm is any algorithm that follows the problem-solving heuristic of making the locally optimal choice at each stage. In many problems, a greedy strategy does not produce an optimal solution, but a greedy heuristic can yield locally optimal solutions that approximate a globally optimal solution in a reasonable amount of time. For example, a greedy strategy for the travelling salesman problem (which is of high computational complexity) is the following heuristic: "At each step of the journey, visit the nearest unvisited city.
Gifford LecturesThe Gifford Lectures (ˈgɪfərd) are an annual series of lectures which were established in 1887 by the will of Adam Gifford, Lord Gifford. Their purpose is to "promote and diffuse the study of natural theology in the widest sense of the term – in other words, the knowledge of God." A Gifford lectures appointment is one of the most prestigious honours in Scottish academia. The lectures are given at four Scottish universities: University of St Andrews, University of Glasgow, University of Aberdeen and University of Edinburgh.
Social choice theorySocial choice theory or social choice is a theoretical framework for analysis of combining individual opinions, preferences, interests, or welfares to reach a collective decision or social welfare in some sense. Whereas choice theory is concerned with individuals making choices based on their preferences, social choice theory is concerned with how to translate the preferences of individuals into the preferences of a group. A non-theoretical example of a collective decision is enacting a law or set of laws under a constitution.
Letter caseLetter case is the distinction between the letters that are in larger uppercase or capitals (or more formally majuscule) and smaller lowercase (or more formally minuscule) in the written representation of certain languages. The writing systems that distinguish between the upper- and lowercase have two parallel sets of letters: each in the majuscule set has a counterpart in the minuscule set. Some counterpart letters have the same shape, and differ only in size (e.g. {C,c} or {S,s}), but for others the shapes are different (e.
Longest common subsequenceA longest common subsequence (LCS) is the longest subsequence common to all sequences in a set of sequences (often just two sequences). It differs from the longest common substring: unlike substrings, subsequences are not required to occupy consecutive positions within the original sequences. The problem of computing longest common subsequences is a classic computer science problem, the basis of data comparison programs such as the diff utility, and has applications in computational linguistics and bioinformatics.
Viterbi algorithmThe Viterbi algorithm is a dynamic programming algorithm for obtaining the maximum a posteriori probability estimate of the most likely sequence of hidden states—called the Viterbi path—that results in a sequence of observed events, especially in the context of Markov information sources and hidden Markov models (HMM). The algorithm has found universal application in decoding the convolutional codes used in both CDMA and GSM digital cellular, dial-up modems, satellite, deep-space communications, and 802.
Rate of returnIn finance, return is a profit on an investment. It comprises any change in value of the investment, and/or cash flows (or securities, or other investments) which the investor receives from that investment over a specified time period, such as interest payments, coupons, cash dividends and stock dividends. It may be measured either in absolute terms (e.g., dollars) or as a percentage of the amount invested. The latter is also called the holding period return.
