|
π-calculus
In theoretical computer science, the -calculus (or pi-calculus) is a process calculus. The -calculus allows channel names to be communicated along the channels themselves, and in this way it is able to describe concurrent computations whose network configuration may change during the computation. The -calculus has few terms and is a small, yet expressive language (see ). Functional programs can be encoded into the -calculus, and the encoding emphasises the dialogue nature of computation, drawing connections with game semantics. Extensions of the -calculus, such as the spi calculus and applied , have been successful in reasoning about cryptographic protocols. Beside the original use in describing concurrent systems, the -calculus has also been used to reason about business processesOMG Specification (2011)"Business Process Model and Notation (BPMN) Version 2.0" ''Object Management Group''. p.21 and molecular biology. Informal definition The -calculus belongs to the family of proc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Process Calculus
In computer science, the process calculi (or process algebras) are a diverse family of related approaches for formally modelling concurrent systems. Process calculi provide a tool for the high-level description of interactions, communications, and synchronizations between a collection of independent agents or processes. They also provide algebraic laws that allow process descriptions to be manipulated and analyzed, and permit formal reasoning about equivalences between processes (e.g., using bisimulation). Leading examples of process calculi include CSP, CCS, ACP, and LOTOS. More recent additions to the family include the π-calculus, the ambient calculus, PEPA, the fusion calculus and the join-calculus. Essential features While the variety of existing process calculi is very large (including variants that incorporate stochastic behaviour, timing information, and specializations for studying molecular interactions), there are several features that all process calculi have ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Process Calculi
In computer science, the process calculi (or process algebras) are a diverse family of related approaches for formally modelling concurrent systems. Process calculi provide a tool for the high-level description of interactions, communications, and synchronizations between a collection of independent agents or processes. They also provide algebraic laws that allow process descriptions to be manipulated and analyzed, and permit formal reasoning about equivalences between processes (e.g., using bisimulation). Leading examples of process calculi include CSP, CCS, ACP, and LOTOS. More recent additions to the family include the π-calculus, the ambient calculus, PEPA, the fusion calculus and the join-calculus. Essential features While the variety of existing process calculi is very large (including variants that incorporate stochastic behaviour, timing information, and specializations for studying molecular interactions), there are several features that all process calculi have ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Concurrent Computation
Concurrent computing is a form of computing in which several computations are executed '' concurrently''—during overlapping time periods—instead of ''sequentially—''with one completing before the next starts. This is a property of a system—whether a program, computer, or a network—where there is a separate execution point or "thread of control" for each process. A ''concurrent system'' is one where a computation can advance without waiting for all other computations to complete. Concurrent computing is a form of modular programming. In its paradigm an overall computation is factored into subcomputations that may be executed concurrently. Pioneers in the field of concurrent computing include Edsger Dijkstra, Per Brinch Hansen, and C.A.R. Hoare. Introduction The concept of concurrent computing is frequently confused with the related but distinct concept of parallel computing, Pike, Rob (2012-01-11). "Concurrency is not Parallelism". ''Waza conference'', 11 January ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cryptographic Protocol
A security protocol (cryptographic protocol or encryption protocol) is an abstract or concrete protocol that performs a security-related function and applies cryptographic methods, often as sequences of cryptographic primitives. A protocol describes how the algorithms should be used and includes details about data structures and representations, at which point it can be used to implement multiple, interoperable versions of a program. Cryptographic protocols are widely used for secure application-level data transport. A cryptographic protocol usually incorporates at least some of these aspects: * Key agreement or establishment * Entity authentication * Symmetric encryption and message authentication material construction * Secured application-level data transport * Non-repudiation methods * Secret sharing methods * Secure multi-party computation For example, Transport Layer Security (TLS) is a cryptographic protocol that is used to secure web (HTTPS) connections. It has an entit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ehud Shapiro
Ehud Shapiro ( he, אהוד שפירא; born 1955) is a multi-disciplinary scientist, artist, entrepreneur and Professor of Computer Science and Biology at the Weizmann Institute of Science. With international reputation, he made fundamental contributions to many scientific disciplines. Shapiro was also an Internet pioneer, a successful Internet entrepreneur, and a pioneer and proponent of E-democracy. Shapiro is the founder of thBa RockBand and conceived its original artistic program. He is a winner of two ERC ( European Research Council) Advanced Grants. Education and Professional background Born in Jerusalem in 1955, the guiding light for Shapiro's scientific endeavors was the philosophy of science of Karl Popper, with which he became acquainted through a high-school project supervised by Moshe Kroy from the Department of Philosophy, Tel Aviv University. In 1979 Shaprio completed his undergraduate studies in Tel Aviv University in Mathematics and Philosophy with distinction. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Aviv Regev
Aviv Regev (born July 11, 1971) is a computational biologist and systems biologist and Executive Vice President and Head of Genentech Research and Early Development in Genentech/Roche. She is a core member (on leave) at the Broad Institute of MIT and Harvard and professor (on leave) at the Department of Biology of the Massachusetts Institute of Technology. Regev is a pioneer of single cell genomics and of computational and systems biology of gene regulatory circuits. She founded and leads the Human Cell Atlas project, together with Sarah Teichmann. Education Regev studied at the Adi Lautman Interdisciplinary Program for Outstanding Students of Tel Aviv University, where she completed her Ph.D. under the supervision of Eva Jablonka and Ehud Shapiro. Career and research In 2020, Regev became the Head and Executive Vice President of Genentech Research and Early Development, based in South San Francisco, and a member of the extended Corporate Executive Committee of Roche. Previously, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Occam-π
In computer science, occam-π (or occam-pi) is the name of a variant of the programming language occam (programming language), occam developed by the Kent Retargetable occam Compiler (KRoC) team at the University of Kent. The name reflects the introduction of elements of π-calculus (pi-calculus) into occam, especially concepts involving mobile agents (processes) and data. The language contains several extensions to occam 2.1, including: *Nesting (computing), Nested Protocol (object-oriented programming), protocols *Run-time process creation *Mobile channels, data, and processes *Recursion (computer science), Recursion *Protocol Inheritance (object-oriented programming), inheritance *Array Constructor (object-oriented programming), constructors *Extended Barrier (computer science), rendezvous See also * occam (programming language) * Transputer * KRoC * Transterpreter References External links * University of Kent Occam-pi project pageTock Occam compilerParallel programming ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Sara Kalvala
Sara may refer to: Arts, media and entertainment Film and television * ''Sara'' (1992 film), 1992 Iranian film by Dariush Merhjui * ''Sara'' (1997 film), 1997 Polish film starring Bogusław Linda * ''Sara'' (2010 film), 2010 Sri Lankan Sinhala thriller directed by Nishantha Pradeep * ''Sara'' (2015 film), 2015 Hong Kong psychological thriller * ''Sara'' (1976 TV series), 1976 American western series * ''Sara'' (1985 TV series), 1985 American situation comedy * ''Sara'' (Belgian TV series), 2007–08 Flemish telenovella on Belgian television * "Sara" (''Arrow'' episode), an episode of Arrow Music * Sara (band), a Finnish band * "Sara" (Bob Dylan song), a song by Bob Dylan for the 1976 album ''Desire'' * "Sara" (Fleetwood Mac song), a song by Fleetwood Mac from the 1979 LP ''Tusk'' * "Sara" (Starship song), a song by Starship from the 1985 album ''Knee Deep in the Hoopla'' *"Sara", a song by Bill Champlin from the 1981 LP '' Runaway'' * "Sarah" (other)#Music, s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
PLOS Computational Biology
''PLOS Computational Biology'' is a monthly peer-reviewed open access scientific journal covering computational biology. It was established in 2005 by the Public Library of Science in association with the International Society for Computational Biology (ISCB) in the same format as the previously established ''PLOS Biology'' and ''PLOS Medicine''. The founding editor-in-chief was Philip Bourne and the current ones are Feilim Mac Gabhann and Jason Papin. Format The journal publishes both original research and review articles. All articles are open access and licensed under the Creative Commons Attribution License. Since its inception, the journal has published the ''Ten Simple Rules'' series of practical guides, which has subsequently become one of the journals most read article series. The ''Ten Simple Rules'' series then led to the ''Quick Tips'' collection, whose articles contain recommendations on computational practices and methods, such as dimensionality reduction for exam ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pacific Symposium On Biocomputing
The Pacific Symposium on Biocomputing (PSB) is an annual multidisciplinary scientific meeting co-founded in 1996 by Dr. Teri Klein, Dr. Lawrence Hunter and Sharon Surles. The conference is to presentation and discuss research in the theory and application of computational methods for biology. Papers and presentations are peer reviewed and published. PSB brings together researchers from the US and the Asian Pacific nations, to exchange research results and address open issues in all aspects of computational biology. PSB is a forum for the presentation of work in databases, algorithms, interfaces, visualization, modeling, and other computational methods, as applied to biological problems, with emphasis on applications in data-rich areas of molecular biology. The PSB aims for "critical mass" in sub-disciplines within biocomputing. For that reason, it is the only meeting whose sessions are defined dynamically each year in response to specific proposals. PSB sessions are organized by ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
MAPK
A mitogen-activated protein kinase (MAPK or MAP kinase) is a type of protein kinase that is specific to the amino acids serine and threonine (i.e., a serine/threonine-specific protein kinase). MAPKs are involved in directing cellular responses to a diverse array of stimuli, such as mitogens, osmotic stress, heat shock and proinflammatory cytokines. They regulate cell functions including proliferation, gene expression, differentiation, mitosis, cell survival, and apoptosis. MAP kinases are found in eukaryotes only, but they are fairly diverse and encountered in all animals, fungi and plants, and even in an array of unicellular eukaryotes. MAPKs belong to the CMGC (CDK/MAPK/GSK3/CLK) kinase group. The closest relatives of MAPKs are the cyclin-dependent kinases (CDKs). Discovery The first mitogen-activated protein kinase to be discovered was ERK1 (MAPK3) in mammals. Since ERK1 and its close relative ERK2 (MAPK1) are both involved in growth factor signaling, the family was term ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Turing
Alan Mathison Turing (; 23 June 1912 – 7 June 1954) was an English mathematician, computer scientist, logician, cryptanalysis, cryptanalyst, philosopher, and mathematical and theoretical biology, theoretical biologist. Turing was highly influential in the development of theoretical computer science, providing a formalisation of the concepts of algorithm and computation with the Turing machine, which can be considered a model of a general-purpose computer. He is widely considered to be the father of theoretical computer science and artificial intelligence. Born in Maida Vale, London, Turing was raised in southern England. He graduated at King's College, Cambridge, with a degree in mathematics. Whilst he was a fellow at Cambridge, he published a proof demonstrating that some purely mathematical yes–no questions can never be answered by computation and defined a Turing machine, and went on to prove that the halting problem for Turing machines is Decision problem, undeci ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
