|
Véronique Bruyère
Véronique Bruyère is a Belgian computer scientist working in automata theory, temporal logic, and combinatorics on words, among other topics. She is a professor of computer science at the University of Mons in Belgium. Education Bruyère studied mathematics at the University of Mons-Hainaut, one of two universities that merged in 2009 to form the University of Mons, and earned a master's degree in mathematics there in 1985. She completed her Ph.D. in computer science in 1989, at Paris Diderot University. Her dissertation, ''Codes prefixes, codes a delai de dechiffrage borne'', was supervised by Dominique Perrin. She also obtained a second Ph.D. in sciences from the University of Mons-Hainaut in 1991. Career Bruyère has worked for the University of Mons-Hainaut and (after its merger) the University of Mons since 1985, when she became an assistant there. In 1993 she became ''chargé de cours'' (roughly equivalent to associate professor), in 2000 professor, and in 2012 full profe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Automata Theory
Automata theory is the study of abstract machines and automata, as well as the computational problems that can be solved using them. It is a theory in theoretical computer science with close connections to cognitive science and mathematical logic. The word ''automata'' comes from the Greek word αὐτόματος, which means "self-acting, self-willed, self-moving". An automaton (automata in plural) is an abstract self-propelled computing device which follows a predetermined sequence of operations automatically. An automaton with a finite number of states is called a finite automaton (FA) or finite-state machine (FSM). The figure on the right illustrates a finite-state machine, which is a well-known type of automaton. This automaton consists of states (represented in the figure by circles) and transitions (represented by arrows). As the automaton sees a symbol of input, it makes a transition (or jump) to another state, according to its transition function, which takes the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Temporal Logic
In logic, temporal logic is any system of rules and symbolism for representing, and reasoning about, propositions qualified in terms of time (for example, "I am ''always'' hungry", "I will ''eventually'' be hungry", or "I will be hungry ''until'' I eat something"). It is sometimes also used to refer to tense logic, a modal logic-based system of temporal logic introduced by Arthur Prior in the late 1950s, with important contributions by Hans Kamp. It has been further developed by computer scientists, notably Amir Pnueli, and logicians. Temporal logic has found an important application in formal verification, where it is used to state requirements of hardware or software systems. For instance, one may wish to say that ''whenever'' a request is made, access to a resource is ''eventually'' granted, but it is ''never'' granted to two requestors simultaneously. Such a statement can conveniently be expressed in a temporal logic. Motivation Consider the statement "I am hungry". Though it ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Combinatorics On Words
Combinatorics on words is a fairly new field of mathematics, branching from combinatorics, which focuses on the study of words and formal languages. The subject looks at letters or symbols, and the sequences they form. Combinatorics on words affects various areas of mathematical study, including algebra and computer science. There have been a wide range of contributions to the field. Some of the first work was on square-free words by Axel Thue in the early 1900s. He and colleagues observed patterns within words and tried to explain them. As time went on, combinatorics on words became useful in the study of algorithms and coding. It led to developments in abstract algebra and answering open questions. Definition Combinatorics is an area of discrete mathematics. Discrete mathematics is the study of countable structures. These objects have a definite beginning and end. The study of enumerable objects is the opposite of disciplines such as analysis, where calculus and i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
University Of Mons
The University of Mons (, ) is a Belgian university located in the city of Mons, founded in 2009 by merging the Engineering Faculty of Mons (FPMs) and the University of Mons-Hainaut. The merging of the institutions was achieved following a geographical logic because of the high complementarity between them and their location in the same city. This merger was accepted by the two universities on 6 July 2007 and confirmed by the Belgian French Community Parliament on 25 November 2008. From an administrative point of view the University of Mons was founded on 1 January 2009. Prof. Calogero Conti, former rector of the Engineering Faculty of Mons, became the first rector of the University of Mons. The University of Mons is the fourth (of six) university of the French community of Belgium with over 10,000 students. Faculties *'' Faculté Polytechnique de Mons (FPMs) - Faculty of Engineering'' *Faculty of Economics and Management (Warocqué) *Faculty of Psychology and Educatio ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
University Of Mons-Hainaut
The University of Mons-Hainaut (, , UMH), in Mons, Wallonia, Belgium, was a university in the French Community of Belgium. Its official language was French. From January 1, 2009, the University of Mons-Hainaut and the Engineering Faculty of Mons Faculté polytechnique de Mons fused in a new university simply called the University of Mons. History The University of Mons-Hainaut was established in 1965 from the ''Institut commercial des industriels du Hainaut'', which had been founded in 1899 by Raoul Warocqué. In the university library, which was established in 1797, there were more than 715,000 items, including 450 manuscripts, one of which was from the 10th century, and 140 incunables, of which one was a Gutenberg Bible.Marie-Thérèse Isaac (éd.),''La Bibliothèque de l'Université de Mons-Hainaut 1797-1997'', University of Mons-Hainaut, Mons, 1997 (catalogue d'exposition) . Notable alumni * Elio Di Rupo, chemist, politician, and former prime minister of Belgium. See also ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Paris Diderot University
Paris Diderot University, also known as Paris 7 (), was a French university located in Paris, France. It was one of the inheritors of the historic University of Paris, which was split into 13 universities in 1970. Paris Diderot merged with Paris Descartes University in 2019 to form the University of Paris, which was later renamed Paris Cité University. With two Nobel Prize laureates, two Fields Medal winners and two former French Ministers of Education among its faculty or former faculty, the university was famous for its teaching in science, especially in mathematics. Many fundamental results of the theory of probability were discovered at one of its research centres, the ''Laboratoire de Probabilités et Modèles Aléatoires'' (Laboratory of Probability and Random Models). History Paris Diderot University was one of the heirs of the old University of Paris, which ceased to exist in 1970. Professors from the faculties of Science, of Medicine and of Humanities chose then to ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dominique Perrin
Dominique Pierre Perrin (b. 1946) is a French mathematician and theoretical computer scientist known for his contributions to coding theory and to combinatorics on words. He is a professor of the University of Marne-la-Vallée and currently serves as the President of ESIEE Paris. Biography Perrin earned his PhD from Paris 7 University in 1975. In his early career, he was a CNRS researcher (1970–1977) and taught at the University of Chile (1972–1973). Later, he worked as a professor at the University of Rouen (1977–1983), Paris 7 University (1983–1993), and École Polytechnique (1982–2002). Since 1993, Perrin is a professor at the University of Marne-la-Vallée, and since 2004, he is the President of ESIEE Paris. Perrin is a member of Academia Europaea since 1989. Scientific contributions Perrin has been a member of the Lothaire group of mathematicians that developed the foundations of combinatorics on words. He has co-authored three scientific monographs: "Theo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Formal Verification
In the context of hardware and software systems, formal verification is the act of proving or disproving the correctness of a system with respect to a certain formal specification or property, using formal methods of mathematics. Formal verification is a key incentive for formal specification of systems, and is at the core of formal methods. It represents an important dimension of analysis and verification in electronic design automation and is one approach to software verification. The use of formal verification enables the highest Evaluation Assurance Level ( EAL7) in the framework of common criteria for computer security certification. Formal verification can be helpful in proving the correctness of systems such as: cryptographic protocols, combinational circuits, digital circuits with internal memory, and software expressed as source code in a programming language. Prominent examples of verified software systems include the CompCert verified C compiler and the seL ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Timed Automaton
timed (time daemon) is an operating system program that maintains the system time in synchronization with time servers using the Time Synchronization Protocol (TSP) developed by Riccardo Gusella and Stefano Zatti. Gusella and Zatti had done earlier related work on their TEMPO algorithm. The Time Synchronization Protocol specification refers to an election algorithm and a synchronization mechanism specified in other technical reports listed as "to appear". With the release of macOS High Sierra in 2017, timed in macOS has subsumed all time synchronization responsibilities including those of the former ntpd and timed. See also * Network Time Protocol (NTP) * Precision Time Protocol (IEEE 1588 PTP) References External links timed(8) man page* ', System Manager's Manual (SMM:11) * ', System Manager's Manual (SMM:12) Network time-related software {{operating-system-stub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Game Theory
Game theory is the study of mathematical models of strategic interactions. It has applications in many fields of social science, and is used extensively in economics, logic, systems science and computer science. Initially, game theory addressed two-person zero-sum games, in which a participant's gains or losses are exactly balanced by the losses and gains of the other participant. In the 1950s, it was extended to the study of non zero-sum games, and was eventually applied to a wide range of Human behavior, behavioral relations. It is now an umbrella term for the science of rational Decision-making, decision making in humans, animals, and computers. Modern game theory began with the idea of mixed-strategy equilibria in two-person zero-sum games and its proof by John von Neumann. Von Neumann's original proof used the Brouwer fixed-point theorem on continuous mappings into compact convex sets, which became a standard method in game theory and mathematical economics. His paper was f ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Coding Theory
Coding theory is the study of the properties of codes and their respective fitness for specific applications. Codes are used for data compression, cryptography, error detection and correction, data transmission and computer data storage, data storage. Codes are studied by various scientific disciplines—such as information theory, electrical engineering, mathematics, linguistics, and computer science—for the purpose of designing efficient and reliable data transmission methods. This typically involves the removal of redundancy and the correction or detection of errors in the transmitted data. There are four types of coding: # Data compression (or ''source coding'') # Error detection and correction, Error control (or ''channel coding'') # Cryptography, Cryptographic coding # Line code, Line coding Data compression attempts to remove unwanted redundancy from the data from a source in order to transmit it more efficiently. For example, DEFLATE data compression makes files small ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Year Of Birth Missing (living People)
A year is a unit of time based on how long it takes the Earth to orbit the Sun. In scientific use, the tropical year (approximately 365 solar days, 5 hours, 48 minutes, 45 seconds) and the sidereal year (about 20 minutes longer) are more exact. The modern calendar year, as reckoned according to the Gregorian calendar, approximates the tropical year by using a system of leap years. The term 'year' is also used to indicate other periods of roughly similar duration, such as the lunar year (a roughly 354-day cycle of twelve of the Moon's phasessee lunar calendar), as well as periods loosely associated with the calendar or astronomical year, such as the seasonal year, the fiscal year, the academic year, etc. Due to the Earth's axial tilt, the course of a year sees the passing of the seasons, marked by changes in weather, the hours of daylight, and, consequently, vegetation and soil fertility. In temperate and subpolar regions around the planet, four seasons a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
