Diamond simulantA diamond simulant, diamond imitation or imitation diamond is an object or material with gemological characteristics similar to those of a diamond. Simulants are distinct from synthetic diamonds, which are actual diamonds exhibiting the same material properties as natural diamonds. Enhanced diamonds are also excluded from this definition. A diamond simulant may be artificial, natural, or in some cases a combination thereof.
Diamond cutA diamond cut is a style or design guide used when shaping a diamond for polishing such as the brilliant cut. Cut does not refer to shape (pear, oval), but the symmetry, proportioning and polish of a diamond. The cut of a diamond greatly affects a diamond's brilliance — a poorly-cut diamond is less luminous. In order to best use a diamond gemstone's material properties, a number of different diamond cuts have been developed. A diamond cut constitutes a more or less symmetrical arrangement of facets, which together modify the shape and appearance of a diamond crystal.
Software requirements specificationA software requirements specification (SRS) is a description of a software system to be developed. It is modeled after the business requirements specification (CONOPS). The software requirements specification lays out functional and non-functional requirements, and it may include a set of use cases that describe user interactions that the software must provide to the user for perfect interaction.
Synthetic diamondLab-grown diamond (LGD; also called laboratory-grown, laboratory-created, man-made, artisan-created, artificial, synthetic, or cultured diamond) is diamond that is produced in a controlled technological process (in contrast to naturally formed diamond, which is created through geological processes and obtained by mining). Unlike diamond simulants (imitations of diamond made of superficially similar non-diamond materials), synthetic diamonds are composed of the same material as naturally formed diamonds – pure carbon crystallized in an isotropic 3D form – and share identical chemical and physical properties.
Prim's algorithmIn computer science, Prim's algorithm (also known as Jarník's algorithm) is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. The algorithm operates by building this tree one vertex at a time, from an arbitrary starting vertex, at each step adding the cheapest possible connection from the tree to another vertex.
Blood diamondBlood diamonds (also called conflict diamonds, brown diamonds, hot diamonds, or red diamonds) are diamonds mined in a war zone and sold to finance an insurgency, an invading army's war efforts, terrorism, or a warlord's activity. The term is used to highlight the negative consequences of the diamond trade in certain areas, or to label an individual diamond as having come from such an area. Diamonds mined during the 20th–21st century civil wars in Angola, Ivory Coast, Sierra Leone, Liberia, Guinea, and Guinea-Bissau have been given the label.
Problem solvingProblem solving is the process of achieving a goal by overcoming obstacles, a frequent part of most activities. Problems in need of solutions range from simple personal tasks (e.g. how to turn on an appliance) to complex issues in business and technical fields. The former is an example of simple problem solving (SPS) addressing one issue, whereas the latter is complex problem solving (CPS) with multiple interrelated obstacles.
Dijkstra's algorithmDijkstra's algorithm (ˈdaɪkstrəz ) is an algorithm for finding the shortest paths between nodes in a weighted graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later. The algorithm exists in many variants. Dijkstra's original algorithm found the shortest path between two given nodes, but a more common variant fixes a single node as the "source" node and finds shortest paths from the source to all other nodes in the graph, producing a shortest-path tree.
Statistical modelA statistical model is a mathematical model that embodies a set of statistical assumptions concerning the generation of sample data (and similar data from a larger population). A statistical model represents, often in considerably idealized form, the data-generating process. When referring specifically to probabilities, the corresponding term is probabilistic model. A statistical model is usually specified as a mathematical relationship between one or more random variables and other non-random variables.
History of calculusCalculus, originally called infinitesimal calculus, is a mathematical discipline focused on limits, continuity, derivatives, integrals, and infinite series. Many elements of calculus appeared in ancient Greece, then in China and the Middle East, and still later again in medieval Europe and in India. Infinitesimal calculus was developed in the late 17th century by Isaac Newton and Gottfried Wilhelm Leibniz independently of each other. An argument over priority led to the Leibniz–Newton calculus controversy which continued until the death of Leibniz in 1716.
Social classA social class or social stratum is a grouping of people into a set of hierarchical social categories, the most common being the upper, middle and lower classes. Membership in a social class can for example be dependent on education, wealth, occupation, income, and belonging to a particular subculture or social network. "Class" is a subject of analysis for sociologists, political scientists, anthropologists and social historians. The term has a wide range of sometimes conflicting meanings, and there is no broad consensus on a definition of "class".
Euclidean algorithmIn mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers (numbers), the largest number that divides them both without a remainder. It is named after the ancient Greek mathematician Euclid, who first described it in his Elements (300 BC). It is an example of an algorithm, a step-by-step procedure for performing a calculation according to well-defined rules, and is one of the oldest algorithms in common use.
