Aneutronic fusionAneutronic fusion is any form of fusion power in which very little of the energy released is carried by neutrons. While the lowest-threshold nuclear fusion reactions release up to 80% of their energy in the form of neutrons, aneutronic reactions release energy in the form of charged particles, typically protons or alpha particles. Successful aneutronic fusion would greatly reduce problems associated with neutron radiation such as damaging ionizing radiation, neutron activation, reactor maintenance, and requirements for biological shielding, remote handling and safety.
Constraint programmingConstraint programming (CP) is a paradigm for solving combinatorial problems that draws on a wide range of techniques from artificial intelligence, computer science, and operations research. In constraint programming, users declaratively state the constraints on the feasible solutions for a set of decision variables. Constraints differ from the common primitives of imperative programming languages in that they do not specify a step or sequence of steps to execute, but rather the properties of a solution to be found.
ITERITER (initially the International Thermonuclear Experimental Reactor, iter meaning "the way" or "the path" in Latin) is an international nuclear fusion research and engineering megaproject aimed at creating energy through a fusion process similar to that of the Sun. Upon completion of construction of the main reactor and first plasma, planned for late 2025, it will be the world's largest magnetic confinement plasma physics experiment and the largest experimental tokamak nuclear fusion reactor.
Constraint logic programmingConstraint logic programming is a form of constraint programming, in which logic programming is extended to include concepts from constraint satisfaction. A constraint logic program is a logic program that contains constraints in the body of clauses. An example of a clause including a constraint is . In this clause, is a constraint; A(X,Y), B(X), and C(Y) are literals as in regular logic programming. This clause states one condition under which the statement A(X,Y) holds: X+Y is greater than zero and both B(X) and C(Y) are true.
Constraint satisfactionIn artificial intelligence and operations research, constraint satisfaction is the process of finding a solution through a set of constraints that impose conditions that the variables must satisfy. A solution is therefore a set of values for the variables that satisfies all constraints—that is, a point in the feasible region. The techniques used in constraint satisfaction depend on the kind of constraints being considered.
Constraint satisfaction problemConstraint satisfaction problems (CSPs) are mathematical questions defined as a set of objects whose state must satisfy a number of constraints or limitations. CSPs represent the entities in a problem as a homogeneous collection of finite constraints over variables, which is solved by constraint satisfaction methods. CSPs are the subject of research in both artificial intelligence and operations research, since the regularity in their formulation provides a common basis to analyze and solve problems of many seemingly unrelated families.
Power stationA power station, also referred to as a power plant and sometimes generating station or generating plant, is an industrial facility for the generation of electric power. Power stations are generally connected to an electrical grid. Many power stations contain one or more generators, rotating machine that converts mechanical power into three-phase electric power. The relative motion between a magnetic field and a conductor creates an electric current. The energy source harnessed to turn the generator varies widely.
Diesel particulate filterA diesel particulate filter (DPF) is a device designed to remove diesel particulate matter or soot from the exhaust gas of a diesel engine. Wall-flow diesel particulate filters usually remove 85% or more of the soot, and under certain conditions can attain soot removal efficiencies approaching 100%. Some filters are single-use, intended for disposal and replacement once full of accumulated ash. Others are designed to burn off the accumulated particulate either passively through the use of a catalyst or by active means such as a fuel burner which heats the filter to soot combustion temperatures.
Constraint Handling RulesConstraint Handling Rules (CHR) is a declarative, rule-based programming language, introduced in 1991 by Thom Frühwirth at the time with European Computer-Industry Research Centre (ECRC) in Munich, Germany. Originally intended for constraint programming, CHR finds applications in grammar induction, type systems, abductive reasoning, multi-agent systems, natural language processing, compilation, scheduling, spatial-temporal reasoning, testing, and verification.
Field-reversed configurationA field-reversed configuration (FRC) is a type of plasma device studied as a means of producing nuclear fusion. It confines a plasma on closed magnetic field lines without a central penetration. In an FRC, the plasma has the form of a self-stable torus, similar to a smoke ring. FRCs are closely related to another self-stable magnetic confinement fusion device, the spheromak. Both are considered part of the compact toroid class of fusion devices.
