Hyper-Wiener Index
In chemical graph theory, the hyper-Wiener index or hyper-Wiener number is a topological index of a molecule, used in biochemistry. The hyper-Wiener index is a generalization introduced by Milan Randić of the concept of the Wiener index, introduced by Harry Wiener. The hyper-Wiener index of a connected graph ''G'' is defined by : WW(G)=\frac 1 2 \sum_(d(u,v)+d^2(u,v)), where ''d''(''u'',''v'') is the distance between vertex ''u'' and ''v''. Hyper-Wiener index as topological index assigned to ''G'' = (''V'',''E'') is based on the distance function which is invariant under the action of the automorphism group of ''G''. Hyper-Wiener index can be used for the representation of computer networks and enhancing lattice hardware security Hardware security as a discipline originated out of cryptographic engineering and involves hardware design, access control, secure multi-party computation, secure key storage, ensuring code authenticity, measures to ensure that ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Chemical Graph Theory
Chemical graph theory is the topology branch of mathematical chemistry which applies graph theory to mathematical modelling of chemical phenomena. The pioneers of chemical graph theory are Alexandru Balaban, Ante Graovac, Iván Gutman, Haruo Hosoya, Milan Randić and Nenad Trinajstić (also Harry Wiener and others). In 1988, it was reported that several hundred researchers worked in this area, producing about 500 articles annually. A number of monographs have been written in the area, including the two-volume comprehensive text by Trinajstić, ''Chemical Graph Theory'', that summarized the field up to mid-1980s. The adherents of the theory maintain that the properties of a chemical graph (i.e., a graph-theoretical representation of a molecule) give valuable insights into the chemical phenomena. Others contend that graphs play only a fringe role in chemical research.D.H. Rouvray, "Combinatorics in Chemistry", pp. 1955-1982, in: Ronald Graham, Martin Grötschel, László Lovász (E ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Topological Index
In the fields of chemical graph theory, molecular topology, and mathematical chemistry, a topological index, also known as a connectivity index, is a type of a molecular descriptor that is calculated based on the molecular graph of a chemical compound. Topological indices are numerical parameters of a graph which characterize its topology and are usually graph invariant. Topological indices are used for example in the development of quantitative structure-activity relationships (QSARs) in which the biological activity or other properties of molecules are correlated with their chemical structure. Calculation Topological descriptors are derived from hydrogen-suppressed molecular graphs, in which the atoms are represented by vertices and the bonds by edges. The connections between the atoms can be described by various types of topological matrices (e.g., distance or adjacency matrices), which can be mathematically manipulated so as to derive a single number, usually known as grap ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Molecule
A molecule is a group of two or more atoms held together by attractive forces known as chemical bonds; depending on context, the term may or may not include ions which satisfy this criterion. In quantum physics, organic chemistry, and biochemistry, the distinction from ions is dropped and ''molecule'' is often used when referring to polyatomic ions. A molecule may be homonuclear, that is, it consists of atoms of one chemical element, e.g. two atoms in the oxygen molecule (O2); or it may be heteronuclear, a chemical compound composed of more than one element, e.g. water (two hydrogen atoms and one oxygen atom; H2O). In the kinetic theory of gases, the term ''molecule'' is often used for any gaseous particle regardless of its composition. This relaxes the requirement that a molecule contains two or more atoms, since the noble gases are individual atoms. Atoms and complexes connected by non-covalent interactions, such as hydrogen bonds or ionic bonds, are typically not consid ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Biochemistry
Biochemistry or biological chemistry is the study of chemical processes within and relating to living organisms. A sub-discipline of both chemistry and biology, biochemistry may be divided into three fields: structural biology, enzymology and metabolism. Over the last decades of the 20th century, biochemistry has become successful at explaining living processes through these three disciplines. Almost all areas of the life sciences are being uncovered and developed through biochemical methodology and research. Voet (2005), p. 3. Biochemistry focuses on understanding the chemical basis which allows biological molecules to give rise to the processes that occur within living cells and between cells,Karp (2009), p. 2. in turn relating greatly to the understanding of tissues and organs, as well as organism structure and function.Miller (2012). p. 62. Biochemistry is closely related to molecular biology, which is the study of the molecular mechanisms of biological phenomena.As ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Milan Randić
Milan Randić (born 1 October 1930) is a Croatian American scientist who is one of the leading experts in the field of computational chemistry. Birth and education Randić was born in the city of Belgrade, where his parents, originally from Kostrena (Croatian Primorje – Region in the northern Adriatic), lived at the time. Kostrena is well known by its maritime tradition, shipowners and seamen. Randic's ancestors were sailing ship owners as well as ship captains. His parents moved to Zagreb in 1941, where he continued his education. After finishing Gymnasium in Zagreb, he studied Theoretical Physics at the University of Zagreb during 1949–1953 and studied for Ph. D degree at the University of Cambridge, England (1954–1958). Academic career From 1960 to 1970 he was at the Ruđer Bošković Institute in Zagreb, Croatia, where he founded the Theoretical Chemistry Group. During 1971–1980 he was visiting various universities in USA including Johns Hopkins, MIT, Harvard, Tufts, ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Wiener Index
In chemical graph theory, the Wiener index (also Wiener number) introduced by Harry Wiener, is a topological index of a molecule, defined as the sum of the lengths of the shortest paths between all pairs of vertices in the chemical graph representing the non-hydrogen atoms in the molecule.. Wiener index can be used for the representation of computer networks and enhancing lattice hardware security. History The Wiener index is named after Harry Wiener, who introduced it in 1947; at the time, Wiener called it the "path number".. It is the oldest topological index related to molecular branching. Based on its success, many other topological indexes of chemical graphs, based on information in the distance matrix of the graph, have been developed subsequently to Wiener's work. The same quantity has also been studied in pure mathematics, under various names including the gross status, the distance of a graph,. and the transmission. The Wiener index is also closely related to the cl ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Harry Wiener
Harry Wiener (Oct. 29, 1924 in Vienna, Austria – Nov. 8, 1998 in New York City, USA) was an Austrian-American chemist, physician and psychologist, a pioneer in cheminformatics and chemical graph theory, and a long-time employee at Pfizer. Education and career Wiener was born in Vienna in 1924 to Jewish parents Joseph Wiener and Beile Wiener. His family emigrated to New York City, USA in 1941 by way of France and Portugal. Wiener attended Brooklyn College and received a BS in chemistry in 1945. Wiener attended Long Island College of Medicine and obtained an MD in 1949. Wiener was appointed to the management team at Pfizer in 1958 and remained at the company until 1995, when he retired. Achievements Wiener made important and fundamental contributions to the study of topological indices and established a correlation between the Wiener index and boiling points (hence viscosity and surface tension) of the paraffins. He laid the foundation of chemical graph theory, and built ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Connected Graph
In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) that need to be removed to separate the remaining nodes into two or more isolated subgraphs. It is closely related to the theory of network flow problems. The connectivity of a graph is an important measure of its resilience as a network. Connected vertices and graphs In an undirected graph , two '' vertices'' and are called connected if contains a path from to . Otherwise, they are called disconnected. If the two vertices are additionally connected by a path of length , i.e. by a single edge, the vertices are called adjacent. A graph is said to be connected if every pair of vertices in the graph is connected. This means that there is a path between every pair of vertices. An undirected graph that is not connected is called disconnected. An undirected graph ''G'' is therefore disconnected if there exist two vertices i ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Distance Function
In mathematics, a metric space is a set together with a notion of ''distance'' between its elements, usually called points. The distance is measured by a function called a metric or distance function. Metric spaces are the most general setting for studying many of the concepts of mathematical analysis and geometry. The most familiar example of a metric space is 3-dimensional Euclidean space with its usual notion of distance. Other well-known examples are a sphere equipped with the angular distance and the hyperbolic plane. A metric may correspond to a metaphorical, rather than physical, notion of distance: for example, the set of 100-character Unicode strings can be equipped with the Hamming distance, which measures the number of characters that need to be changed to get from one string to another. Since they are very general, metric spaces are a tool used in many different branches of mathematics. Many types of mathematical objects have a natural notion of distance and t ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Automorphism Group
In mathematics, the automorphism group of an object ''X'' is the group consisting of automorphisms of ''X'' under composition of morphisms. For example, if ''X'' is a finite-dimensional vector space, then the automorphism group of ''X'' is the group of invertible linear transformations from ''X'' to itself (the general linear group of ''X''). If instead ''X'' is a group, then its automorphism group \operatorname(X) is the group consisting of all group automorphisms of ''X''. Especially in geometric contexts, an automorphism group is also called a symmetry group. A subgroup of an automorphism group is sometimes called a transformation group. Automorphism groups are studied in a general way in the field of category theory. Examples If ''X'' is a set with no additional structure, then any bijection from ''X'' to itself is an automorphism, and hence the automorphism group of ''X'' in this case is precisely the symmetric group of ''X''. If the set ''X'' has additional struct ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Computer Networks
A computer network is a set of computers sharing resources located on or provided by network nodes. The computers use common communication protocols over digital interconnections to communicate with each other. These interconnections are made up of telecommunication network technologies, based on physically wired, optical, and wireless radio-frequency methods that may be arranged in a variety of network topologies. The nodes of a computer network can include personal computers, servers, networking hardware, or other specialised or general-purpose hosts. They are identified by network addresses, and may have hostnames. Hostnames serve as memorable labels for the nodes, rarely changed after initial assignment. Network addresses serve for locating and identifying the nodes by communication protocols such as the Internet Protocol. Computer networks may be classified by many criteria, including the transmission medium used to carry signals, bandwidth, communications protocols ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Hardware Security
Hardware security as a discipline originated out of cryptographic engineering and involves hardware design, access control, secure multi-party computation, secure key storage, ensuring code authenticity, measures to ensure that the supply chain that built the product is secure among other things. A hardware security module (HSM) is a physical computing device that safeguards and manages digital keys for strong authentication and provides cryptoprocessing. These modules traditionally come in the form of a plug-in card or an external device that attaches directly to a computer or network server. Some providers in this discipline consider that the key difference between hardware security and software security is that hardware security is implemented using "non- Turing-machine" logic (raw combinatorial logic or simple state machines). One approach, referred to as "hardsec", uses FPGAs to implement non-Turing-machine security controls as a way of combining the security of hardware w ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |