Secure two party computation 2PC is sub problem of secure multi party computation MPC that has received special attention by researchers because of its close relation to many cryptographic tasks. It is concerned with the question Can two party computation be achieved more efficiently and under weaker security assumptions than general MPC? Andrew Yao Yao s protocol for two party computation ref cite doi 10.1109 SFCS.1982.38 ref only provided security against passive adversaries. 2PC protocols that are secure against active adversaries were proposed by Lindell and Pinkas ref cite doi 10.1007 978 3 540 72540 4 4 ref , Ishai, Prabhakaran and Sahai ref cite doi 10.1007 978 3 540 85174 5 32 ref and Nielsen and Orlandi ref cite doi 10.1007 978 3 642 00457 5 22 ref . Another solution for this problem, that explicitly works with committed input was proposed by Jarecki and Shmatikov ref cite doi 10.1007 978 3 540 72540 4 6 ref . Security The security of a two party computation protocol is usually defined through a comparison with an idealised scenario that is secure by definition. The idealised scenario involves a Trusted third party trusted party that collects the input of the two parties over secure channel s and returns the result if none of the parties chooses to abort. The cryptographic two party computation protocol is secure, if it behaves no worse than this ideal protocol, but without the additional trust social sciences trust assumption s Disambiguation needed date June 2011 . This is usually modeled using a simulator. The task of the simulator is to act as a wrapper around the idealised protocol to make it appear like the cryptographic protocol. The simulation succeeds with respect to an Information theory information theoretic , respectively computationally bounded adversary if the output of the simulator is statistically close to, respectively computationally indistinguishable from the output of the cryptographic protocol. A two party computation protocol is secure ... more details
Italic title Infobox journal title Network Computation In Neural Systems cover Image net front cover.jpg thumbnail center discipline Computational neuroscience abbreviation Network publisher Informa country impact 1.536 impact year 2009 website http www.informahealthcare.com net ISSN 0954 898X eISSN 1361 6536 CODEN NEWKEB OCLC 21370403 LCCN 92641787 Network Computation In Neural Systems is a scientific journal that aims to provide a forum for integrating theoretical and experimental findings in computational neuroscience across relevant interdisciplinary boundaries. ref Cite web url http informahealthcare.com page Description?journalCode net title Network Computation In Neural Systems Aims and Scope accessdate 14 June 2010 format work ref The journal is published by Informa and edited by G. J. Goodhill University of Queensland , Australia . ref Cite web url http informahealthcare.com page EditorialAdvisoryBoard?journalCode net title Network Computation In Neural Systems Editorial Board accessdate 14 June 2010 format work ref Network Computation In Neural Systems was established in 1990 and has an impact factor of 1.536. ref Thomson Reuters Journal Citation Reports 2009 ref It is published 4 times a year. ref Cite web url http informahealthcare.com net title Network Computation In Neural Systems Online Publications accessdate 14 June 2010 format work ref References Reflist Use dmy dates date September 2010 Category Neuroscience journals Category Informa academic journals Category Quarterly journals Category Publications established in 1990 Category English language journals ... more details
Infobox Journal cover discipline Statistics language English website http www.tandf.co.uk journals titles 00949655.asp publisher Taylor & Francis country United States USA abbreviation JSCS history 1972 to present frequency 12 issues per year openaccess No ISSN 0094 9655 eISSN 1563 5163 LCCN OCLC 1793216 JSTOR impact 0.517 impact year 2009 link1 link1 name Journal of Statistical Computation and Simulation is a peer review ed scientific journal that publishes papers related to computational statistics . It is published by Taylor & Francis in English language English . The journal started publishing in 1972. It publishes 12 issues each year. Abstracting and indexing Journal of Statistical Computation and Simulation is indexed in the following services Current Index to Statistics Science Citation Index Expanded Zentralblatt MATH External links http www.tandf.co.uk journals titles 00949655.asp Journal of Statistical Computation and Simulation Statistics journals Category Computational statistics journals Category Statistics journals Category Publications established in 1972 ... more details
Orphan date February 2009 Interval valued computation is a special kind of theoretical models for computation. It is capable of working on interval valued bytes special subsets of the unit interval . If such computers were realized, their computation power would be much greater than that of functioning, implementable computers. As such, there are no architectures for their physical implementations. Only special subsets of the unit interval are considered the restrictions are of finite nature, so that the computation power of this paradigm fits into the framework of Church Turing thesis ref NaVa07 Nagy & V lyi 2007 14 ref unlike real computation , interval valued computation is not capable of hypercomputation . Such a model of computation is capable of solving NP complete problems like tripartite matching . ref TaNa08 Tajti & Nagy 2008 ref The Boolean satisfiability problem Extensions of SAT validity problem of quantified propositional formulae is decidable by a linear interval valued computation. As a consequence, all PSPACE polynomial space problem s are decidable by a polynomial interval valued computation. Furthermore, it is proven that PSPACE coincides with the class of languages which are decidable by a restricted polynomial interval valued computation links added . ref NaVa08 Nagy & V lyi 2008 ref Notes references References cite id NaVa07 cite conference last Nagy first Benedek coauthors V lyi, S ndor title Visual reasoning by generalized interval values and interval temporal logic pages 13 26 booktitle VLL conference Proceedings of the VLL 2007 workshop on Visual Languages and Logic editor Philip T. Cox & Andrew Fish & John Howse publisher CEUR Workshop Proceedings location Coeur d Al ne, Idaho, USA date 23 September 2007 format PDF url http ftp.informatik.rwth aachen.de Publications CEUR WS Vol 274 paper2.pdf cite cite id NaVa08 cite journal last Nagy first Benedek ... Tripartite Matching by Interval valued Computation in Polynomial Time conference Computability in Europe ... more details
Biomedical Computation Review BCR is a quarterly, open access magazine funded by the National Institutes of Health and published by National Centers for Biomedical Computing Simbios , one of the National Centers for Biomedical Computing located at Stanford University . First published in 2005, BCR covers such topics as molecular dynamics , genomics , proteomics , physics based simulation , systems biology , and other research involving computational biology . BCR s articles are targeted to those with a general science or biology background, in order to build a community among biomedical computational researchers who come from a variety of disciplines. External links http biomedicalcomputationreview.org Biomedical Computation Review http simbios.stanford.edu Simbios sci mag stub Category Stanford University Category American magazines Category Quarterly magazines Category National Institutes of Health Category Publications established in 2005 ... more details
The IEEE Congress on Evolutionary Computation CEC is one of the largest and most important conferences within Evolutionary computation EC , the other conferences of similar importance being Genetic and Evolutionary Computation Conference GECCO and Parallel Problem Solving from Nature PPSN . CEC, which is organized by the IEEE Computational Intelligence Society in cooperation with the Evolutionary Programming Society , covers most subtopics of EC, such as Evolutionary robotics , Multiobjective optimization , Evolvable hardware , Theory of evolutionary computation , Evolutionary design etc. Papers can also be found that deal with topics which are related to rather than part of EC, such Ant colony optimization , Swarm intelligence and Quantum computing . The conference usually attracts several hundreds of attendees, as well as hundreds of papers. External links http ieee wcci2012.org CEC 2012, Brisbane, Australia part of WCCI 2012 http cec2011.org CEC 2011, New Orleans, USA http www.wcci2010.org CEC 2010, Barcelona, Spain part of WCCI 2010 http www.cec 2009.org CEC 2009, Trondheim, Norway http www2.mae.cuhk.edu.hk wcci2008 CEC 2008, Hong Kong part of WCCI 2008 http cec2007.nus.edu.sg CEC 2007, Singapore http www.compsys.ia.ac.cn wcci2006 CEC 2006, Vancouver, Canada part of WCCI 2006 http www.dcs.ex.ac.uk dwcorne cec2005 CEC 2005, Edinburgh, UK http www.cec2004.org CEC 2004, Portland, OR, US http www.cs.adfa.edu.au cec 2003 CEC 2003, Canberra, Australia http www.wcci2002.org CEC 2002, Hawaii, US part of WCCI 2002 http cec2001.kaist.ac.kr CEC 2001, Korea CEC 2000, San Diego, CA, US http garage.cps.msu.edu cec99 CEC 1999, Washington DC, US Category Evolutionary computation ... more details
Infobox Journal cover File Journalcover Jsc.gif File Journalcover Jsc.gif editor Hoon Hong discipline Computer science publisher Academic Press country frequency Monthly history 1985 present impact 0.853 impact year 2009 website http www.elsevier.com locate jsc ISSN 0747 7171 link1 http www.sciencedirect.com science journal 07477171 link1 name Online access OCLC 10791050 LCCN 85644369 CODEN ISSN 0747 7171 eISSN The Journal of Symbolic Computation is a Peer review peer reviewed monthly scientific journal covering all aspects of symbolic computation published by Academic Press . It is targeted to both mathematician s and computer scientist s. It was established in 1985 by Bruno Buchberger , who served as its Editor in chief editor until 1994. The journal covers a wide variety of topics, including Computer algebra system Computer algebra , for which it is considered the top journal ref cite book title Computer Algebra and Symbolic Computation Mathematical Methods last Cohen first Joel S. authorlink coauthors year 2003 publisher AK Peters, Ltd. location isbn 978 1568811598 page 14 pages 472 url accessdate 30 December 2009 ref Computational geometry Automated theorem proving Applications of symbolic computation in education, science, and industry According to the Journal Citation Reports , its 2009 impact factor is 0.853. ref name WoS cite web url http isiwebofknowledge.com title Web of Science year 2011 accessdate 2011 05 26 ref The journal is abstracted and indexed by Scopus and the Science Citation Index . See also Higher Order and Symbolic Computation References reflist External links Official http www.elsevier.com locate jsc Category Mathematics journals Category Computer science journals Category Publications established in 1985 Category Elsevier academic journals Category Monthly journals Category English language journals ... more details
italictitle Infobox Journal title Journal of Chemical Theory and Computation cover File Jctc cover.jpg 150 px editor William L. Jorgensen, Gustavo E. Scuseria discipline Chemistry abbreviation J. Chem. Theory Comput. publisher American Chemical Society country Flag USA frequency Monthly history 2005 present impact 5.138 impact year 2010 website http pubs.acs.org journal jctcce RSS http pubs.acs.org action showFeed?ui 0&mi qjmolc&ai 53h&jc jctcce&type etoc&feed rss CODEN jctcce ISSN 1549 9618 eISSN 1549 9626 The Journal of Chemical Theory and Computation is a Peer review peer reviewed scientific journal , published since 2005 by the American Chemical Society . ref http pubs.acs.org American Chemical Society ref It is indexed in Chemical Abstracts Service CAS , Scopus , British Library , and Web of Science . The current editors are William L. Jorgensen ref http pubs.acs.org page jctcce profile.html William L. Jorgensen Editor profile ref and Gustavo E. Scuseria. ref http pubs.acs.org page jctcce profile1.html Gustavo E. Scuseria Editor profile ref According to the 2010 Journal Citation Reports , the journal has an impact factor of 5.138. ref http www.thomsonreuters.com products services scientific Journal Citation Reports Journal Citation Reports ref References Reflist Category American Chemical Society academic journals Category Chemistry journals Category Monthly journals Category English language journals Category Publications established in 2005 Category Computational chemistry Category Quantum chemistry Category Theoretical chemistry es Journal of Chemical Theory and Computation fr Journal of Chemical Theory and Computation it Journal of Chemical Theory and Computation ... more details
Human based evolutionary computation HBEC is a set of evolutionary computation techniques that rely on human innovation. Human based evolutionary computation techniques can be classified into three more specific classes analogous to ones in evolutionary computation. There are three basic types of innovation initialization, mutation, and recombination. Here is a table illustrating which type of human innovation are supported in different classes of HBEC cellpadding 5 bgcolor cornsilk Initialization bgcolor cornsilk Mutation bgcolor cornsilk Recombination bgcolor cornsilk Human based selection strategy bgcolor cornsilk X bgcolor cornsilk bgcolor cornsilk bgcolor cornsilk Human based evolution strategy bgcolor cornsilk X bgcolor cornsilk X bgcolor cornsilk bgcolor cornsilk Human based genetic algorithm bgcolor cornsilk X bgcolor cornsilk X bgcolor cornsilk X All these three classes also have to implement selection, performed either by humans or by computers. Examples Human based selection strategy Human based selection strategy is a simplest human based evolutionary computation procedure. It is used heavily today by websites outsourcing collection and selection of the content to humans user contributed content . Viewed as evolutionary computation, their mechanism supports two operations initialization when a user adds a new item and selection when a user expresses preference among ... computation point of view, this is not surprising without a selection operation the content ... and Evolutionary Computation Conference, GECCO 2000, Late breaking papers, 175 178 http www.ews.uiuc.edu ..., SMC 2001, 3464 3469 Kosorukoff, A, Goldberg D. E. 2002 , Evolutionary computation as a form of organization, Proceedings of Genetic and Evolutionary Computation Conference, GECCO 2002, pp 965 972 Gentry, C et al. 2005 Secure Distributed Human Computation In Ninth International Conference on Financial ... computation Category Evolutionary computation ... more details
Secure multi party computation also known as secure computation or multi party computation MPC is a sub field of cryptography . The goal of methods for secure multi party computation is to enable parties ... interpreted as equivalent to computation within polynomial time . The primary motivation for studying methods of secure computation is to design systems that allow for maximum utility of information without compromising user privacy. Secure computation was formally introduced in 1982 by A. Yao ... extended abstract ref incidentally, the first recipient of the Knuth Prize as secure two party computation ... party computation or dynamic can choose its victims during the course of execution of the multiparty computation . Attaining security against a dynamic adversary is often much harder than security against ... active adversaries use VSS. Performing a computation using MPC protocols is still order of magnitudes slower than performing the computation using a trusted third party. However, more and more efficient ... Orlandi http u.cs.biu.ac.il orlandi icassp draft.pdf Is multiparty computation any good in practice ... large scale and practical application of multiparty computation took place in Denmark in January ... Toft Multiparty Computation Goes Live, Cryptology ePrint Archive Report 2008 068 ref . Two party computation The sub problem of MPC that has received special attention by researchers because of its close relation to many cryptographic tasks is referred to as secure two party computation 2PC ... two party computation be achieved more efficiently and under weaker security assumptions than general ... computation http web.archive.org web 20061230075325 http www.theiia.org ITAudit index.cfm?act itaudit.archive ... your own full fledged secure multiparty computation based on the SMC declarative language . Uses ... VMCrypt A Java library for scalable secure computation. By Lior Malka. http www.fairplayproject.net The Fairplay Project &mdash Includes a software package for secure two party computation, where ... more details
essay date November 2010 Indeterminacy in concurrent computation is concerned with the effects of indeterminacy in concurrent computation . Computation is an area in which indeterminacy is becoming increasingly important because of the massive increase in concurrency due to networking and the advent of Multi core processor many core computer architectures. These computer systems make use of Arbiter electronics arbiters which give rise to indeterminacy . A limitation of logic programming Patrick J. Hayes Patrick Hayes 1973 argued that the usual sharp distinction that is made between the processes of computation and deduction, is misleading . Robert Kowalski developed the thesis that computation could be subsumed by deduction and quoted with approval Computation is controlled deduction. which he attributed to Hayes in his 1988 paper on the early history of Prolog. Contrary to Kowalski and Hayes, Carl Hewitt claimed that logical deduction was incapable of carrying out concurrent computation .... Therefore mathematical logic can not implement concurrent computation in open systems. The authors ... some special cases of concurrent computation, e.g., sequential computation and some kinds of parallel programming parallel computation including the lambda calculus . Arrival order indeterminacy ... attempted to extend Prolog which had some basis in logic programming to concurrent computation ... systems a universal model of concurrent computation is limited by having any mandatory overhead .... Indeterminacy in other models of computation Arbitration is the basis of the indeterminacy in the Actor model of concurrent computation see Actor model early history and Actor model theory ... Memo 70, Department of Artificial Intelligence, Edinburgh University . 1973. Pat Hayes. Computation ... . June 1977. Henry Baker. Actor Systems for Real Time Computation MIT EECS Doctoral Dissertation ... Press. 1990. Gul Agha. https dspace.mit.edu handle 1721.1 6952 Actors A Model of Concurrent Computation ... more details
In computational complexity theory , the parallel computation thesis is a hypothesis which states that the time used by a reasonable parallel machine is polynomially related to the space used by a sequential machine. The parallel computation thesis was set forth by Chandra and Larry Stockmeyer Stockmeyer in 1976 see References . In other words, for a computational model which allows computations to branch and run in parallel without bound, a formal language which is decidable language decidable under the model using no more than math t n math steps for inputs of length n is decidable by a machine in the unbranching model using no more than math t n k math units of storage for some constant k . Similarly, if a machine in the unbranching model decides a language using no more than math s n math storage, a machine in the parallel model can decide the language in no more than math s n k math steps for some constant k . The parallel computation thesis is not a rigorous formal statement, as it does not clearly define what constitutes an acceptable parallel model. A parallel machine must be sufficiently powerful to emulate the sequential machine in time polynomially related to the sequential space compare Turing machine , non deterministic Turing machine , and alternating Turing machine . N. Blum 1983 has introduced a model for which the thesis does not hold. However, the model allows math 2 2 O T n math parallel threads of computation after math T n math steps. See Big O notation . Parberry 1986 suggested a more reasonable bound would be math 2 O T n math or math 2 T n O 1 math , in defense of the thesis. Goldschlager 1982 has proposed a model which is sufficiently universal to emulate ..., which is where the thesis originated. References Blum, N., A note on the parallel computation ..., I., Parallel speedup of sequential machines a defense of parallel computation thesis, ACM SIGACT News , Volume 18, Issue 1, pp. 54 67, 1986. Category Parallel computing Category Theory of computation ... more details
History of the M.I.T. Computation Center The M.I.T. Computation Center , organized in 1956, housed an IBM 704 up until 1960. The M.I.T. Computation Center and Operation Moonwatch After the successful launch of Sputnik on October 4, 1957, the race was on to calculate and predict where the first man made satellites would appear in the sky. Dr. Fred Lawrence Whipple , then director of the Smithsonian Astrophysical Observatory SAO in Cambridge Massachusetts, had gathered amateur astronomers to track artificial satellites in an organization called Operation Moonwatch . The aim was to get the position of the satellite in order to obtain its orbital elements . The first satisfactory orbit calculated by the IBM 704 as official tracker for the SAO occurred at 7AM on the morning of October 11, 1957. References Christian Science Monitor, Soviet Space Satellite Rocket Sighted By Observation Teams in Cambridge , Oct 11, 1957, page 1 Tech Talk MIT Newsletter , October 22, 1957 A Lucky Seven tech engineering news, moon track , March 1958, Vol XXXIX No. 6, p68 Beyer, Jean David and Sidney Shinedling, The i.b.m 704 computer at m.i.t tech engineering news, May 1958, Vol XXXIX No. 8, p26 NASA Article Citation Technical aspects of satellite tracking on IBM computers at Smithsonian Astrophysical Observatory in Cambridge, Massachusetts Feb 26, 1960 External links Please arrange in alphabetical order Thank You http sputnik.any.to Selected Artifacts and References Category Massachusetts Institute of Technology ... more details
Infobox Journal title Research on Language and Computation abbreviation RoLC cover Image RoLaC.jpg discipline Computational linguistics and br Natural language processing language English website http www.springer.com linguistics computational linguistics journal 11168 publisher Springer Science Business Media country Netherlands history to present ISSN 1570 7075 eISSN 1572 8706 Research on Language and Computation is a peer reviewed journal addressing computational linguistics and natural language processing . Abstracts of the journal are available in several List of academic databases and search engines academic databases , notably Bibliography of Linguistic Literature , CompuScience , CSA Linguistics and Language Behavior Abstracts , Digital Mathematics Registry , ERIH , Google Scholar , OCLC ArticleFirst Database , OCLC FirstSearch Electronic Collections Online , Scopus , Summon database Summon by Serial Solutions . The editor in chief for 2009 is Shuly Wintner. The main editor for 2009 is D.M. Gabbay. External links http www.springer.com linguistics computational linguistics journal 11168 Research on Language and Computation official website Springer Science Business Media offset br ling stub Category Computational linguistics Category Linguistics journals Category Springer academic journals Category English language journals ... more details
Multiple issues original research December 2009 unreferenced December 2009 History of computer theory basically starts with in a pure sense by Alan Turing , who devised notion of Turing machine , Turing thesis , Church Turing hypothesis . Earlier form of computer theory might ve existed before Alan Turing and others, but Turing is considered by substantial number of people today to be an important figure in pure computer theory Can it be computed or not? , but not necessarly in computing something for practical purposes Can it be computed quickly? . The goal of computer theory is to answer the question, What is computable? There are many different ways to answer the question taking into account space and time needed to compute the problem, but the central question in computer theory is What can be computed efficiently within a certain and time constraints? This tries to focus computer theory to practical purposes and applications, instead of studying about a Turing machine that takes 200 years to compute something, which isn t practical in real world. The ultimate answer from the Turing machine test is that anything can be computed by ignoring time and space. From this the area of algorithm design came about to give solutions and basically to create faster and efficient algorithm to compute a real world problem. See also Computer theory Algorithm DEFAULTSORT History Of Theory Of Computation Category Theory of computation Category History of computer science Theory Of Computation ... more details
In mathematics and computer science , symbolic numeric computation is the use of software that combines Symbolic computation symbolic and numerical analysis numeric methods to solve problems. References http books.google.com books?id BlRlhmwSPwMC Symbolic numeric Computation , Dongming Wang, Lihong Zhi, Springer, 2007, ISBN 3764379839 http citeseerx.ist.psu.edu viewdoc download?doi 10.1.1.135.1680&rep rep1&type pdf SYNAPS A LIBRARY FOR DEDICATED APPLICATIONS IN SYMBOLIC NUMERIC COMPUTING , BERNARD MOURRAIN, JEAN PASCAL PAVONE, PHILIPPE TREBUCHET, ELIAS P. TSIGARIDAS, AND JULIEN WINTZ, Software for Algebraic Geometry, The IMA Volumes in Mathematics and its Applications, 2008, Volume 148, 81 109, DOI 10.1007 978 0 387 78133 4 6 http www4.ncsu.edu kaltofen bibliography 01 symnum.pdf Hybrid methods , Chapter in http books.google.com books?id U j6VoUvPAC Computer algebra handbook foundations, applications, systems, Volume 1 , Editors Johannes Grabmeier, Erich Kaltofen, Volker Weispfenning, Springer, 2003, ISBN 9783540654667 http books.google.com books?id dWhYcTGakBcC Approximate Commutative Algebra , Lorenzo Robbiano, John Abbott, Springer, 2009, ISBN 9783211993132 http www.springer.com mathematics computational science 26 engineering book 978 3 7091 0793 5 Numerical and Symbolic Scientific Computing , Langer, Ulrich Paule, Peter Eds. , Springer 2011, ISBN 978 3 7091 0793 5 External links http www.cargo.wlu.ca SNC2011 The Fourth International Workshop on Symbolic Numeric Computation SNC2011 , June 7 9, 2011, San Jose, California math stub Category Computer algebra Category Numerical analysis Category Computational science ar ... more details
pce charter.html Path Computation Element pce ref . PCE represents a modern vision of networks where ... cv publications NETWORKS2008.pdf title PILEP a contribution to PCE based interdomain path computation ... more details
italictitle Infobox Journal cover discipline Algebra abbreviation IJAC publisher World Scientific impact 0.421 impact year 2008 history 1991 present country Singapore website http www.worldscinet.com ijac ijac.shtml ISSN 0218 1967 eISSN 1793 6500 The International Journal of Algebra and Computation is published by World Scientific , and contains articles on general mathematics, as well as Combinatorial group theory and semigroup theory Universal algebra Algorithmic and computational problems in algebra Theory of automata Formal language theory Theory of computation Theoretical computer science Abstracting and indexing The journal is indexed in ISI Alerting Services CompuMath Citation Index Science Citation Index Current Contents Physical, Chemical and Earth Sciences Mathematical Reviews Inspec INSPEC Zentralblatt MATH Computer Abstracts Category Mathematics journals Category Publications established in 1991 Category World Scientific academic journals Category English language journals ... more details
Notability date January 2010 italictitle Infobox journal title New Mathematics and Natural Computation cover File NMNCcover.jpg 180px discipline Mathematics , Computer science Computer Science abbreviation editor Paul P. Wang publisher World Scientific country Singapore history 2005 present website http www.worldscinet.com nmnc nmnc.shtml ISSN 1793 0057 eISSN 1793 7027 New Mathematics and Natural Computation is an interdisciplinary journal founded in 2005 and is now published by World Scientific . It covers mathematical uncertainty and its applications to computational, biological and social sciences, with a specific focus on relatively unexplored areas in mathematical uncertainty, such as fuzzy sets and fuzzy logic. ref http www.worldscinet.com nmnc mkt aims scope.shtml Journal Aims & Scope ref Abstracting and indexing The journal is abstracted and indexed in Mathematical Reviews Zentralblatt MATH References See Wikipedia Footnotes on how to create references using ref ref tags which will then appear here automatically Reflist External links http www.worldscinet.com nmnc nmnc.shtml Journal Website Category Mathematics journals Category Publications established in 2005 Category English language journals ... more details
Infobox journal title Journal of Logic and Computation cover editor Dov Gabbay discipline Computer science abbreviation publisher Oxford University Press country frequency Bimonthly history 1990 present openaccess license impact impact year website http logcom.oxfordjournals.org link1 link1 name link2 link2 name JSTOR OCLC LCCN CODEN ISSN 0955 792X eISSN 1465 363X The Journal of Logic and Computation is a Peer review peer reviewed academic journal focused on logic and computing . It was established in 1990 and is published by Oxford University Press . External links Official http logcom.oxfordjournals.org journal stub compu sci stub Category Publications established in 1990 Category Computer science journals Category Logic journals Category Logic in computer science Category Formal methods publications Category Oxford University Press academic journals Category Bimonthly journals Category English language journals ... more details
Interactive evolutionary computation IEC or aesthetic selection is a general term for methods of evolutionary computation that use human evaluation. Usually human evaluation is necessary when the form of fitness function is not known for example, visual appeal or attractiveness as in Dawkins, 1986 or the result of optimization should fit a particular user preference for example, taste of coffee or color set of the user interface . IEC design issues The number of evaluations that IEC can receive from one human user is limited by user fatigue which was reported by many researchers as a major problem. In addition, human evaluations are slow and expensive as compared to fitness function computation. Hence, one user IEC methods should be designed to converge using a small number of evaluations, which necessarily implies very small populations. Several methods were proposed by researchers to speed up convergence, like interactive constrain evolutionary search user intervention or fitting user preferences using a convex function Takagi, 2001 . IEC human computer interface s should be carefully designed in order to reduce user fatigue. However IEC implementations that can concurrently accept evaluations from many users overcome the limitations described above. An example of this approach ... belong to a more general category of Interactive evolutionary computation. The main application ... s aesthetic preferences. Interactive computation methods can use different representations, both ... Evolutionary art Human based evolutionary computation Human based genetic algorithm Human computer ..., Man, and Cybernetics, SMC 2001, 3464 3469. Takagi, H. 2001 . Interactive Evolutionary Computation ... Computation step by step. http www.visionmetric.com EFit V Facial composite system using interactive ... evolutionary computation with a generative design algorithm to generate 2d images. http picbreeder.org ... Category Interactive evolutionary computation ... more details
Orphan date February 2009 Infobox university name The Interdisciplinary Center for Neural Computation native name image Deleted image removed Image ICNC logo wiki.jpg established 1992 type Public university Public endowment staff provost principal rector chancellor vice chancellor dean students doctoral city Image Flag of Israel.svg 25px Israeli flag Jerusalem state country Israel campus Giva at Ram Edmond J. Safra free label free colors colours mascot nickname ICNC affiliations website http icnc.huji.ac.il icnc.huji.ac.il The Interdisciplinary Center for Neural Computation lang he of the Hebrew University http icnc.huji.ac.il ICNC is the home of a world renowned group of scientists focusing on the central questions as to how the brain computes. http icnc.huji.ac.il ICNC was established in 1992 to provide an inter face for interactive research in Neurobiology, Physics and Applied Physics Computer Science and Psychophysics with the objective of increasing the understanding of how the brain works with specific focus on computational aspects of the nervous system. http icnc.huji.ac.il ICNC has state of the art facilities for studying and modeling the nervous system at its different levels, from single neuron computation to signal processing in small and large cortical networks, to the system and the behavioral level. This is backed ... Ph.D. program for Neural Computation and in supervising the Ph.D. theses of a total of 120 ... phd Ph.D Program The Ph.D. Program in Brain Research Computation and Information Processing ... doctoral program is to train students to address various aspects of computation and information processing ..., dynamic models, statistical mechanics and computation . Computer science computation theory, learning ... of Philosophy in Brain Sciences Computation and Information Processing. External links http icnc.huji.ac.il Interdisciplinary Center for Neural Computation http www.huji.ac.il The Hebrew University http ... more details
Human based computation is a computer science technique in which a computational process performs its ... computation, a human employs a computer to solve a problem a human provides a formalized problem description to a computer, and receives a solution to interpret. Human based computation ..., then collects, interprets, and integrates their solutions. Early work Human based computation research has its origins in the early work on interactive evolutionary computation . The idea behind ... similar research efforts became the topic of research in interactive evolutionary computation or aesthetic ... based computation Human based computation methods combine computers and humans in different roles. Kosorukoff 2000 proposed a way to describe division of labor in computation, that groups human based methods into three classes. The following table uses the evolutionary computation model to describe four classes of computation, three of which rely on humans in some role. For each class, a representative ... 4 Division of labor in computation th tr tr bgcolor E0E0FF th bgcolor white font color A0A0FF ... th tr table table center Classes of human based computation from this table can be referred ... with small h. Methods of human based computation HC Darwin programming game Darwin Vyssotsky, Morris ... performs fitness computation and software performs innovative role. Unemi 1998 Simulated breeding ... to participation In different human based computation projects people are motivated by one or more ... in these projects in Kosorukoff 2000 and von Hippel 2005 . Human based computation as a form of social organization Viewed as a form of social organization, human based computation often surprisingly ... fit the organization. Evolutionary human computation projects offer a natural solution to this problem .... The algorithmic outsourcing techniques used in human based computation are much more scalable ... in an organization, Genetic and Evolutionary Computation Conference, GECCO 2000, Late breaking papers ... more details
Italic title Higher Order and Symbol Computation formerly LISP and Symbolic Computation print ISSN 1388 3690 , online ISSN 1573 0557 is a computer science academic journal journal published by Springer Science Business Media . It focusses on programming concepts and abstractions and programming language theory . Editors Former Editor in chief editors in chief of the journal have been Richard P. Gabriel , Sun Microsystems, Inc. , USA 1988 &ndash 1991 Guy L. Steele, Jr. Guy L. Steele Jr. , Sun Microsystems, Inc., USA 1988 &ndash 1991 Robert R. Kessler , University of Utah , USA 1991 &ndash 1998 The current editors in chief are Olivier Danvy Aarhus University and Carolyn Talcott SRI International . Abstracting and indexing The journal is abstracted and indexed in InfoTrac Academic OneFile , ACM Computing Reviews , Association for Computing Machinery ACM Digital Library , Computer Abstracts International Database , Computer Science Index , Current Abstracts , EBSCO Industries EBSCO , EI Compendex , Inspec INSPEC , io port.net , PASCAL database PASCAL , Scopus , Serials Solutions Summon by Serial Solutions , VINITI Database RAS , and Zentralblatt MATH . See also Journal of Functional Programming Journal of Functional and Logic Programming Journal of Symbolic Computation External links Official http www.springer.com computer theoretical computer science journal 10990 http www.brics.dk hosc Journal page at Aarhus University http springerlink.metapress.com content 1573 0557 Online access http www.informatik.uni trier.de ley db journals lisp index.html DBLP http liinwww.ira.uka.de bibliography Ai higherordersymbcomput.html The Collection of Computer Science Bibliographies comp sci stub sci journal stub Category Computer science journals Category Springer academic journals ... more details
ECJ is a freeware evolutionary computation research system written in Java. It is a framework that supports a variety of evolutionary computation techniques, such as genetic algorithms , genetic programming , evolution strategies , coevolution , particle swarm optimization, and differential evolution. The framework models iterative evolutionary processes using a series of pipelines arranged to connect one or more subpopulations of individuals with Selection genetic algorithm selection , breeding such as Crossover genetic algorithm crossover , and Mutation genetic algorithm mutation operators that produce new individuals. The framework is open source and is distributed under the Academic Free License . ECJ was created by http www.cs.gmu.edu sean Sean Luke , a computer science professor at George Mason University, and is maintained by Sean Luke and a variety of contributors. Features listed from http cs.gmu.edu eclab projects ecj ECJ s project page General Features GUI with charting Platform independent checkpointing and logging Hierarchical parameter files Multithreading Mersenne Twister Random Number Generators Abstractions for implementing a variety of EC forms. EC Features Asynchronous island models over TCP IP Master Slave evaluation over multiple processors Genetic Algorithms Programming style Steady State and Generational evolution, with or without Elitism Evolutionary Strategies style mu,lambda and mu lambda evolution Very flexible breeding architecture Many selection operators Multiple subpopulations and species Inter subpopulation exchanges Reading populations from files Single and Multi population coevolution SPEA2 multiobjective optimization Particle Swarm Optimization Differential Evolution Spatially embedded evolutionary algorithms Hooks for other multiobjective ... , 5 19 103 105, Kluwer Academic Publishers. ISBN 1389 2576 Category Evolutionary computation Category Agent based software Category Free software programmed in Java ru Java Evolutionary Computation ... more details
Encyclopedia
top
