Knapsack problemThe knapsack problem is the following problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine which items to include in the collection so that the total weight is less than or equal to a given limit and the total value is as large as possible. It derives its name from the problem faced by someone who is constrained by a fixed-size knapsack and must fill it with the most valuable items.
User experience designUser experience design (UX design, UXD, UED, or XD) is the process of defining the experience a user would go through when interacting with a company, its services, and its products. Design decisions in UX design are often driven by research, data analysis, and test results rather than aesthetic preferences and opinions. Unlike user interface design, which focuses solely on the design of a computer interface, UX design encompasses all aspects of a user's perceived experience with a product or website, such as its usability, usefulness, desirability, brand perception, and overall performance.
Möbius transformationIn geometry and complex analysis, a Möbius transformation of the complex plane is a rational function of the form of one complex variable z; here the coefficients a, b, c, d are complex numbers satisfying ad − bc ≠ 0. Geometrically, a Möbius transformation can be obtained by first performing stereographic projection from the plane to the unit two-sphere, rotating and moving the sphere to a new location and orientation in space, and then performing stereographic projection (from the new position of the sphere) to the plane.
Holy SeeThe Holy See (Sancta Sedes, ˈsaŋkta ˈsedes; Santa Sede ˈsanta ˈsɛːde), also called the See of Rome, Petrine See, Apostolic See, and Government of Vatican City, is the jurisdiction of the Pope in his role as the bishop of Rome and sovereign of Vatican City. It includes the apostolic episcopal see of the Diocese of Rome, which has ecclesiastical jurisdiction over the Catholic Church, and sovereignty and governance over the city-state known as Vatican City.
Travelling salesman problemThe travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?" It is an NP-hard problem in combinatorial optimization, important in theoretical computer science and operations research. The travelling purchaser problem and the vehicle routing problem are both generalizations of TSP.
Near-death experienceA near-death experience (NDE) is a profound personal experience associated with death or impending death which researchers describe as having similar characteristics. When positive, which the great majority are, such experiences may encompass a variety of sensations including detachment from the body, feelings of levitation, total serenity, security, warmth, joy, the experience of absolute dissolution, review of major life events, the presence of a light, and seeing dead relatives.
Episcopal seeAn episcopal see is, in a practical use of the phrase, the area of a bishop's ecclesiastical jurisdiction. Phrases concerning actions occurring within or outside an episcopal see are indicative of the geographical significance of the term, making it synonymous with diocese. The word see is derived from Latin sedes, which in its original or proper sense denotes the seat or chair that, in the case of a bishop, is the earliest symbol of the bishop's authority. This symbolic chair is also known as the bishop's cathedra.
Hamiltonian path problemIn the mathematical field of graph theory the Hamiltonian path problem and the Hamiltonian cycle problem are problems of determining whether a Hamiltonian path (a path in an undirected or directed graph that visits each vertex exactly once) or a Hamiltonian cycle exists in a given graph (whether directed or undirected). Both problems are NP-complete.
