Quantum dotQuantum dots (QDs) – also called semiconductor nanocrystals, are semiconductor particles a few nanometres in size, having optical and electronic properties that differ from those of larger particles as a result of quantum mechanics. They are a central topic in nanotechnology and materials science. When the quantum dots are illuminated by UV light, an electron in the quantum dot can be excited to a state of higher energy. In the case of a semiconducting quantum dot, this process corresponds to the transition of an electron from the valence band to the conductance band.
Type theoryIn mathematics, logic, and computer science, a type theory is the formal presentation of a specific type system, and in general, type theory is the academic study of type systems. Some type theories serve as alternatives to set theory as a foundation of mathematics. Two influential type theories that were proposed as foundations are Alonzo Church's typed λ-calculus and Per Martin-Löf's intuitionistic type theory. Most computerized proof-writing systems use a type theory for their foundation, a common one is Thierry Coquand's Calculus of Inductive Constructions.
SpheromakA spheromak is an arrangement of plasma formed into a toroidal shape similar to a smoke ring. The spheromak contains large internal electric currents and their associated magnetic fields arranged so the magnetohydrodynamic forces within the spheromak are nearly balanced, resulting in long-lived (microsecond) confinement times without external fields. Spheromaks belong to a type of plasma configuration referred to as the compact toroids. A spheromak can be made and sustained using magnetic flux injection, leading to a dynomak.
Type safetyIn computer science, type safety and type soundness are the extent to which a programming language discourages or prevents type errors. Type safety is sometimes alternatively considered to be a property of facilities of a computer language; that is, some facilities are type-safe and their usage will not result in type errors, while other facilities in the same language may be type-unsafe and a program using them may encounter type errors.
PolywellThe polywell is a design for a fusion reactor based on two ideas: heating ions by concentrating (-) charge to accelerate the ions and trapping a diamagnetic plasma inside a cusp field. This kind of plasma trap is based on the idea that a plasma will create its own magnetic field that rejects the outside field. That is not common behavior for a fusing plasma. A similar trapping concept was tested by the Lockheed-Martin high beta fusion reactor team, which tried to hold a plasma in a similar way.
Type inferenceType inference refers to the automatic detection of the type of an expression in a formal language. These include programming languages and mathematical type systems, but also natural languages in some branches of computer science and linguistics. Types in a most general view can be associated to a designated use suggesting and restricting the activities possible for an object of that type. Many nouns in language specify such uses. For instance, the word leash indicates a different use than the word line.
Data typeIn computer science and computer programming, a data type (or simply type) is a collection or grouping of data values, usually specified by a set of possible values, a set of allowed operations on these values, and/or a representation of these values as machine types. A data type specification in a program constrains the possible values that an expression, such as a variable or a function call, might take. On literal data, it tells the compiler or interpreter how the programmer intends to use the data.
Corona dischargeA corona discharge is an electrical discharge caused by the ionization of a fluid such as air surrounding a conductor carrying a high voltage. It represents a local region where the air (or other fluid) has undergone electrical breakdown and become conductive, allowing charge to continuously leak off the conductor into the air. A corona discharge occurs at locations where the strength of the electric field (potential gradient) around a conductor exceeds the dielectric strength of the air.
Dependent typeIn computer science and logic, a dependent type is a type whose definition depends on a value. It is an overlapping feature of type theory and type systems. In intuitionistic type theory, dependent types are used to encode logic's quantifiers like "for all" and "there exists". In functional programming languages like Agda, ATS, Coq, F*, Epigram, and Idris, dependent types help reduce bugs by enabling the programmer to assign types that further restrain the set of possible implementations.
Type conversionIn computer science, type conversion, type casting, type coercion, and type juggling are different ways of changing an expression from one data type to another. An example would be the conversion of an integer value into a floating point value or its textual representation as a string, and vice versa. Type conversions can take advantage of certain features of type hierarchies or data representations.
