Photonic metamaterialA photonic metamaterial (PM), also known as an optical metamaterial, is a type of electromagnetic metamaterial, that interacts with light, covering terahertz (THz), infrared (IR) or visible wavelengths. The materials employ a periodic, cellular structure. The subwavelength periodicity distinguishes photonic metamaterials from photonic band gap or photonic crystal structures. The cells are on a scale that is magnitudes larger than the atom, yet much smaller than the radiated wavelength, are on the order of nanometers.
Graph coloringIn graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject to certain constraints. In its simplest form, it is a way of coloring the vertices of a graph such that no two adjacent vertices are of the same color; this is called a vertex coloring. Similarly, an edge coloring assigns a color to each edge so that no two adjacent edges are of the same color, and a face coloring of a planar graph assigns a color to each face or region so that no two faces that share a boundary have the same color.
Metamaterial antennaMetamaterial antennas are a class of antennas which use metamaterials to increase performance of miniaturized (electrically small) antenna systems. Their purpose, as with any electromagnetic antenna, is to launch energy into free space. However, this class of antenna incorporates metamaterials, which are materials engineered with novel, often microscopic, structures to produce unusual physical properties. Antenna designs incorporating metamaterials can step-up the antenna's radiated power.
Distributed-element circuitDistributed-element circuits are electrical circuits composed of lengths of transmission lines or other distributed components. These circuits perform the same functions as conventional circuits composed of passive components, such as capacitors, inductors, and transformers. They are used mostly at microwave frequencies, where conventional components are difficult (or impossible) to implement. Conventional circuits consist of individual components manufactured separately then connected together with a conducting medium.
Acyclic coloringIn graph theory, an acyclic coloring is a (proper) vertex coloring in which every 2-chromatic subgraph is acyclic. The acyclic chromatic number A(G) of a graph G is the fewest colors needed in any acyclic coloring of G. Acyclic coloring is often associated with graphs embedded on non-plane surfaces. A(G) ≤ 2 if and only if G is acyclic. Bounds on A(G) in terms of Δ(G), the maximum degree of G, include the following: A(G) ≤ 4 if Δ(G) = 3. A(G) ≤ 5 if Δ(G) = 4. A(G) ≤ 7 if Δ(G) = 5. A(G) ≤ 12 if Δ(G) = 6.
Edge coloringIn graph theory, a proper edge coloring of a graph is an assignment of "colors" to the edges of the graph so that no two incident edges have the same color. For example, the figure to the right shows an edge coloring of a graph by the colors red, blue, and green. Edge colorings are one of several different types of graph coloring. The edge-coloring problem asks whether it is possible to color the edges of a given graph using at most k different colors, for a given value of k, or with the fewest possible colors.
Storage ringA storage ring is a type of circular particle accelerator in which a continuous or pulsed particle beam may be kept circulating typically for many hours. Storage of a particular particle depends upon the mass, momentum and usually the charge of the particle to be stored. Storage rings most commonly store electrons, positrons, or protons. Storage rings are most often used to store electrons that radiate synchrotron radiation. Over 50 facilities based on electron storage rings exist and are used for a variety of studies in chemistry and biology.
Large Hadron ColliderThe Large Hadron Collider (LHC) is the world's largest and highest-energy particle collider. It was built by the European Organization for Nuclear Research (CERN) between 1998 and 2008 in collaboration with over 10,000 scientists and hundreds of universities and laboratories, as well as more than 100 countries. It lies in a tunnel in circumference and as deep as beneath the France–Switzerland border near Geneva. The first collisions were achieved in 2010 at an energy of 3.
List coloringIn graph theory, a branch of mathematics, list coloring is a type of graph coloring where each vertex can be restricted to a list of allowed colors. It was first studied in the 1970s in independent papers by Vizing and by Erdős, Rubin, and Taylor. Given a graph G and given a set L(v) of colors for each vertex v (called a list), a list coloring is a choice function that maps every vertex v to a color in the list L(v). As with graph coloring, a list coloring is generally assumed to be proper, meaning no two adjacent vertices receive the same color.
SimulationA simulation is the imitation of the operation of a real-world process or system over time. Simulations require the use of models; the model represents the key characteristics or behaviors of the selected system or process, whereas the simulation represents the evolution of the model over time. Often, computers are used to execute the simulation. Simulation is used in many contexts, such as simulation of technology for performance tuning or optimizing, safety engineering, testing, training, education, and video games.
