|
Peter Burmeister
Peter Burmeister (16 July 1941 – 20 January 2019) was a German mathematician. He was a professor of mathematics at Darmstadt University of Technology. He was born in Berlin, Germany. Burmeister died on 20 January 2019 in Reinheim, Germany at the age of 77. Academic Career Peter Burmeister studied mathematics at the Free University of Berlin with an exchange year at the University of Münster. In 1966, he received his PhD from the Rheinische Friedrich-Wilhelms-University Bonn, supervised by Jürgen Schmidt, with a dissertation titled ''Über die Mächtigkeiten und Unabhängigkeitsgrade der Basen freier Algebren'' (On the Cardinalities and Independence Degrees of the Bases of Free Algebras). In 1971, he habilitated at the University of Bonn under Wolfram Schwabhäuser with the work ''Primitive Classes of Partial Algebras''. The same year, he was appointed Professor of Mathematics at the Technical University of Darmstadt. He retired in 2004. Work Peter Burmeister's research ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Formal Concept Analysis
In information science, formal concept analysis (FCA) is a principled way of deriving a ''concept hierarchy'' or formal ontology from a collection of objects and their properties. Each concept in the hierarchy represents the objects sharing some set of properties; and each sub-concept in the hierarchy represents a subset of the objects (as well as a superset of the properties) in the concepts above it. The term was introduced by Rudolf Wille in 1981, and builds on the mathematical theory of lattices and ordered sets that was developed by Garrett Birkhoff and others in the 1930s. Formal concept analysis finds practical application in fields including data mining, text mining, machine learning, knowledge management, semantic web, software development, chemistry and biology. Overview and history The original motivation of formal concept analysis was the search for real-world meaning of mathematical order theory. One such possibility of very general nature is that data tables ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Academic Staff Of Technische Universität Darmstadt
An academy (Attic Greek: Ἀκαδήμεια; Koine Greek Ἀκαδημία) is an institution of tertiary education. The name traces back to Plato's school of philosophy, founded approximately 386 BC at Akademia, a sanctuary of Athena, the goddess of wisdom and skill, north of Athens, Greece. The Royal Spanish Academy defines academy as scientific, literary or artistic society established with public authority and as a teaching establishment, public or private, of a professional, artistic, technical or simply practical nature. Etymology The word comes from the ''Academy'' in ancient Greece, which derives from the Athenian hero, ''Akademos''. Outside the city walls of Athens, the gymnasium was made famous by Plato as a center of learning. The sacred space, dedicated to the goddess of wisdom, Athena, had formerly been an olive grove, hence the expression "the groves of Academe". In these gardens, the philosopher Plato conversed with followers. Plato developed his sessions ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
2019 Deaths
This is a list of lists of deaths of notable people, organized by year. New deaths articles are added to their respective month (e.g., Deaths in ) and then linked below. 2025 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996 1995 1994 1993 1992 1991 1990 1989 1988 1987 1986 Earlier years ''Deaths in years earlier than this can usually be found in the main articles of the years.'' See also * Lists of deaths by day * Deaths by year (category) {{DEFAULTSORT:deaths by year ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
1941 Births
The Correlates of War project estimates this to be the deadliest year in human history in terms of conflict deaths, placing the death toll at 3.49 million. However, the Uppsala Conflict Data Program estimates that the subsequent year, 1942, was the deadliest such year. Death toll estimates for both 1941 and 1942 range from 2.28 to 7.71 million each. Events Below, the events of World War II have the "WWII" prefix. January * January–August – 10,072 men, women and children with mental and physical disabilities are asphyxiated with carbon monoxide in a gas chamber, at Hadamar Euthanasia Centre in Germany, in the first phase of mass killings under the Aktion T4 program here. * January 1 – Thailand's Prime Minister Plaek Phibunsongkhram decrees January 1 as the official start of the Thai solar calendar new year (thus the previous year that began April 1 had only 9 months). * January 3 – A decree (''Normalschrifterlass'') promulgated in Germany by Martin Bormann ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Implication (information Science)
In formal concept analysis (FCA) ''implications'' relate sets of properties (or, synonymously, of attributes). An implication ''A''→''B'' ''holds'' in a given domain when every object having all attributes in ''A'' also has all attributes in ''B''. Such implications characterize the concept hierarchy in an intuitive manner. Moreover, they are "well-behaved" with respect to algorithms. The knowledge acquisition method called ''attribute exploration'' uses implications.Ganter, Bernhard and Obiedkov, Sergei (2016) ''Conceptual Exploration''. Springer, Definitions An implication ''A''→''B'' is simply a pair of sets ''A''⊆''M'', ''B''⊆''M'', where ''M'' is the set of attributes under consideration. ''A'' is the ''premise'' and ''B'' is the ''conclusion'' of the implication ''A''→''B'' . A set C respects the implication ''A''→''B'' when ¬(''C''⊆''A'') or ''C''⊆''B''. A ''formal context'' is a triple ''(G,M,I)'', where '' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Algorithm
In mathematics and computer science, an algorithm () is a finite sequence of Rigour#Mathematics, mathematically rigorous instructions, typically used to solve a class of specific Computational problem, problems or to perform a computation. Algorithms are used as specifications for performing calculations and data processing. More advanced algorithms can use Conditional (computer programming), conditionals to divert the code execution through various routes (referred to as automated decision-making) and deduce valid inferences (referred to as automated reasoning). In contrast, a Heuristic (computer science), heuristic is an approach to solving problems without well-defined correct or optimal results.David A. Grossman, Ophir Frieder, ''Information Retrieval: Algorithms and Heuristics'', 2nd edition, 2004, For example, although social media recommender systems are commonly called "algorithms", they actually rely on heuristics as there is no truly "correct" recommendation. As an e ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rudolf Wille
Rudolf Wille (2 November 1937 – 22 January 2017) was a German mathematician and was professor of General Algebra from 1970 to 2003 at Technische Universität Darmstadt (TU Darmstadt). His most celebrated work is the invention of formal concept analysis, an unsupervised machine learning technique that applies mathematical lattice theory to organize data based on objects and their shared attributes. An accomplished musician and has also made contributions to Mathematics in Music, Mathematical Pedagogy and the Philosophy of Science, Wille played an active leadership role in the concept lattice research community. Wille was a member of the Board of Directors of the Institute for Philosophy at TU Darmstadt from 1976. From 1983, was leader of the research group on Formal concept analysis and from 1993 Chairman of the "Ernst Schröder Center for Conceptual Knowledge Engineering". Wille was also a founding member of the Center for Inter-Disciplinary Research in Darmstadt and mainta ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graph Theory
In mathematics and computer science, graph theory is the study of ''graph (discrete mathematics), graphs'', which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of ''Vertex (graph theory), vertices'' (also called ''nodes'' or ''points'') which are connected by ''Glossary of graph theory terms#edge, edges'' (also called ''arcs'', ''links'' or ''lines''). A distinction is made between undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges link two vertices asymmetrically. Graphs are one of the principal objects of study in discrete mathematics. Definitions Definitions in graph theory vary. The following are some of the more basic ways of defining graphs and related mathematical structures. Graph In one restricted but very common sense of the term, a graph is an ordered pair G=(V,E) comprising: * V, a Set (mathematics), set of vertices (also called nodes or points); * ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Discrete Mathematics
Discrete mathematics is the study of mathematical structures that can be considered "discrete" (in a way analogous to discrete variables, having a bijection with the set of natural numbers) rather than "continuous" (analogously to continuous functions). Objects studied in discrete mathematics include integers, Graph (discrete mathematics), graphs, and Statement (logic), statements in Mathematical logic, logic. By contrast, discrete mathematics excludes topics in "continuous mathematics" such as real numbers, calculus or Euclidean geometry. Discrete objects can often be enumeration, enumerated by integers; more formally, discrete mathematics has been characterized as the branch of mathematics dealing with countable sets (finite sets or sets with the same cardinality as the natural numbers). However, there is no exact definition of the term "discrete mathematics". The set of objects studied in discrete mathematics can be finite or infinite. The term finite mathematics is sometime ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Geometry
Geometry (; ) is a branch of mathematics concerned with properties of space such as the distance, shape, size, and relative position of figures. Geometry is, along with arithmetic, one of the oldest branches of mathematics. A mathematician who works in the field of geometry is called a ''List of geometers, geometer''. Until the 19th century, geometry was almost exclusively devoted to Euclidean geometry, which includes the notions of point (geometry), point, line (geometry), line, plane (geometry), plane, distance, angle, surface (mathematics), surface, and curve, as fundamental concepts. Originally developed to model the physical world, geometry has applications in almost all sciences, and also in art, architecture, and other activities that are related to graphics. Geometry also has applications in areas of mathematics that are apparently unrelated. For example, methods of algebraic geometry are fundamental in Wiles's proof of Fermat's Last Theorem, Wiles's proof of Fermat's ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
