25,161
edits
Changes
Created page with "'''Home * People * Selim Akl''' FILE:DrSelimAkl2011.jpg|border|right|thumb|link=http://research.cs.queensu.ca/home/akl/|Selim G. Akl <ref>[http://research..."
'''[[Main Page|Home]] * [[People]] * Selim Akl'''
[[FILE:DrSelimAkl2011.jpg|border|right|thumb|link=http://research.cs.queensu.ca/home/akl/|Selim G. Akl <ref>[http://research.cs.queensu.ca/home/akl/ Selim Akl's Official Home Page]</ref> ]]
'''Selim G. Akl''',<br/>
a Canadian computer scientist and professor at [https://en.wikipedia.org/wiki/Queen%27s_University Queen's University] in the School of Computing, where he leads the ''Parallel and Unconventional Computation Group'' <ref>[http://research.cs.queensu.ca/Parallel//index.html Parallel and Unconventional Computation Group]</ref>. His research interests covers algorithm design and analysis, in particular [https://en.wikipedia.org/wiki/Parallel_computing parallel] and [https://en.wikipedia.org/wiki/Unconventional_computing unconventional computing]. He made his Ph.D. ''Statistical Analysis of Some Properties of Solutions to the [https://en.wikipedia.org/wiki/Travelling_salesman_problem Traveling Salesman Problem]'' under the supervision of [[Monroe Newborn]] <ref>[http://www.cs.mcgill.ca/%7Enewborn/ Monty Newborn - Ph. D. Students: Current and Former]</ref> at [[McGill University]] in 1978, where he also researched on the [[Principal Variation|principal continuation]] and the [[Killer Heuristic|killer heuristic]] <ref>[[Selim Akl]] and [[Monroe Newborn]] ('''1977'''). ''The Principal Continuation and the Killer Heuristic''. 1977 ACM Annual Conference Proceedings, pp. 466-473. ACM, Seattle, WA.</ref> . As postdoc at Queen's University he published various papers on [[Parallel Search]].
=Quantum Chess=
[[Quantum Chess]], a variant of the chess game invented by Selim Akl, uses the weird properties of [https://en.wikipedia.org/wiki/Quantum_mechanics quantum physics]. Unlike the chess pieces of the conventional game, where a pawn is a pawn, and a rook is a rook, a quantum chess piece is a superposition of "states", each state representing a different conventional piece. In Quantum Chess, a player does not know the identity of a piece (that is, whether it is a pawn, a rook, a bishop, and so on) until the piece is selected for a move. Once a piece is selected it elects to behave as one of its constituent conventional pieces, but soon recovers its quantum state and returns to being a superposition of two or more pieces <ref>[http://research.cs.queensu.ca/Parallel/QuantumChess/QuantumChess.html Quantum Chess]</ref>.
[[FILE:selim-akl-alice-wismath-by-kristyn-wallace.jpg|none|border|text-bottom|link=http://www.cbc.ca/technology/story/2010/09/02/quantum-chess-akl.html]]
In the quantum chess computer game created by computer science student [[Alice Wismath]] (right), <br/>
a piece that should be a knight could simultaneously also be a queen, a pawn or something else. <br/>
Wismath based the game on an idea proposed by computer science professor Selim Akl <ref>[http://www.cbc.ca/technology/story/2010/09/02/quantum-chess-akl.html Quantum physics adds twist to chess], [http://www.cbc.ca/technology/ CBC News - Technology & Science], September 6, 2010</ref>
=Selected Publications=
<ref>[http://research.cs.queensu.ca/Parallel/publications.html#Publications Selim Akl - Publications]</ref> <ref>[http://research.cs.queensu.ca/Parallel//technical.html#Technical Selim Akl - Technical Reports]</ref> <ref>[http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/a/Akl:Selim_G=.html DBLP: Selim G. Akl]</ref> <ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref>
==1977==
* [[Selim Akl]], [[Monroe Newborn]] ('''1977'''). ''The Principal Continuation and the Killer Heuristic''. 1977 ACM Annual Conference Proceedings, pp. 466-473. ACM, Seattle, WA.
==1980 ...==
* [[Selim Akl]], [http://umanitoba.ca/admin/president/bio.html David T. Barnard], [http://research.cs.queensu.ca/TechReports/authorsD.html#Doran,%20R.J. R.J. Doran] ('''1980'''). ''Design, Analysis and Implementation of a Parallel Alpha-Beta Algorithm''. Queen's University
* [[Selim Akl]], [http://umanitoba.ca/admin/president/bio.html David T. Barnard], [http://research.cs.queensu.ca/TechReports/authorsD.html#Doran,%20R.J. R.J. Doran] ('''1980'''). ''Simulation and Analysis in Deriving Time and Storage Requirements for a Parallel Alpha-Beta Pruning Algorithm''. IEEE International Conference on Parallel Processing, pp. 231-234.
* [[Selim Akl]], [http://umanitoba.ca/admin/president/bio.html David T. Barnard], [http://research.cs.queensu.ca/TechReports/authorsD.html#Doran,%20R.J. R.J. Doran] ('''1980'''). ''Searching Game Trees in Parallel''. Proceedings of the Third Biennial Conference of the Canadian Society for Computational Studies of Intelligence, Victoria, B.C.
* [[Selim Akl]], [http://research.cs.queensu.ca/TechReports/authorsD.html#Doran,%20R.J. R.J. Doran] ('''1981'''). ''A Comparison of Parallel Implementations of the Alpha-Beta and Scout tree Search Algorithms using the game of Checkers''. Queen's University
* [[Selim Akl]], [http://umanitoba.ca/admin/president/bio.html David T. Barnard], [http://research.cs.queensu.ca/TechReports/authorsD.html#Doran,%20R.J. R.J. Doran] ('''1982'''). ''Design, Analysis, and Implementation of a Parallel Tree Search Algorithm''. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol 4, No 2, pp. 192-203. ISSN 0162-8828
* [[Selim Akl]] ('''1985'''). ''[http://portal.acm.org/citation.cfm?id=533017&dl=GUIDE, Parallel Sorting Algorithms]''. (Academic Press)
* [[Selim Akl]] ('''1989'''). ''[http://portal.acm.org/citation.cfm?id=63471 The Design and Analysis of Parallel Algorithms]''. (Prentice Hall)
==1990 ...==
* [[Selim Akl]], [http://individual.utoronto.ca/klyons/ Kelly A. Lyons] ('''1993'''). ''[http://portal.acm.org/citation.cfm?id=162256&dl=ACM&coll=GUIDE Parallel Computational Geometry]''. (Prentice Hall).
* [[Selim Akl]] ('''1997'''). ''[http://fano.ics.uci.edu/cites/Document/Parallel-Computation-Models-+-Methods.html Parallel Computation: Models and Methods]''. (Prentice Hall).
==2000 ...==
* [[Selim Akl]] ('''2006'''). ''Even Accelerating Machines are not Universal''. Technical Report No. 2006-508, Queen's University, [http://research.cs.queensu.ca/home/akl/techreports/even.pdf pdf]
* [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/s/Stewart:Ian.html Ian Stewart], [http://people.trentu.ca/wfeng/ Wenying Feng], [[Selim Akl]] ('''2009'''). ''[http://www.computer.org/portal/web/csdl/doi/10.1109/ITNG.2009.240 A Further Improvement on a Genetic Algorithm]''. [http://www.informatik.uni-trier.de/~ley/db/conf/itng/itng2009.html#StewartFA09 ITNG 2009]
==2010 ...==
* [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/s/Stewart:Ian.html Ian Stewart], [http://people.trentu.ca/wfeng/ Wenying Feng], [[Selim Akl]] ('''2010'''). ''Tuning Neural Networks by Both Connectivity and Size''. [http://www.informatik.uni-trier.de/~ley/db/conf/itng/itng2010.html#StewartFA10 ITNG 2010]
* [[Selim Akl]] ('''2010'''). ''Time Travel: A New Hypercomputational Paradigm''. [http://www.informatik.uni-trier.de/~ley/db/journals/ijuc/ijuc6.html#Akl10 IJUC Vol. 6, No. 5]
* [[Selim Akl]] ('''2011'''). ''Bitonic Sort''. Encyclopedia of Parallel Computing 2011 <ref>[https://en.wikipedia.org/wiki/Bitonic_sorter Bitonic sorter from Wikipedia]</ref>
* [http://research.cs.queensu.ca/TechReports/authorsN.html Naya Nagy], [[Selim Akl]] ('''2012'''). ''Computing with Uncertainty and its Implications to Universality''. [http://www.informatik.uni-trier.de/~ley/db/journals/paapp/paapp27.html#NagyA12 IJPEDS, Vol. 27, No. 2]
=External Links=
* [http://research.cs.queensu.ca/home/akl/ Selim Akl's Official Home Page]
* [https://en.wikipedia.org/wiki/Selim_Akl Selim Akl from Wikipedia]
* [http://research.cs.queensu.ca/Parallel//projects.html Non-Universality in Computation: The Myth of the Universal Computer]
* [http://www.ratemyprofessors.com/ShowRatings.jsp?tid=29852 Selim G Akl - Queen's University at Kingston - RateMyProfessors.com]
=References=
<references />
'''[[People|Up one level]]'''
[[FILE:DrSelimAkl2011.jpg|border|right|thumb|link=http://research.cs.queensu.ca/home/akl/|Selim G. Akl <ref>[http://research.cs.queensu.ca/home/akl/ Selim Akl's Official Home Page]</ref> ]]
'''Selim G. Akl''',<br/>
a Canadian computer scientist and professor at [https://en.wikipedia.org/wiki/Queen%27s_University Queen's University] in the School of Computing, where he leads the ''Parallel and Unconventional Computation Group'' <ref>[http://research.cs.queensu.ca/Parallel//index.html Parallel and Unconventional Computation Group]</ref>. His research interests covers algorithm design and analysis, in particular [https://en.wikipedia.org/wiki/Parallel_computing parallel] and [https://en.wikipedia.org/wiki/Unconventional_computing unconventional computing]. He made his Ph.D. ''Statistical Analysis of Some Properties of Solutions to the [https://en.wikipedia.org/wiki/Travelling_salesman_problem Traveling Salesman Problem]'' under the supervision of [[Monroe Newborn]] <ref>[http://www.cs.mcgill.ca/%7Enewborn/ Monty Newborn - Ph. D. Students: Current and Former]</ref> at [[McGill University]] in 1978, where he also researched on the [[Principal Variation|principal continuation]] and the [[Killer Heuristic|killer heuristic]] <ref>[[Selim Akl]] and [[Monroe Newborn]] ('''1977'''). ''The Principal Continuation and the Killer Heuristic''. 1977 ACM Annual Conference Proceedings, pp. 466-473. ACM, Seattle, WA.</ref> . As postdoc at Queen's University he published various papers on [[Parallel Search]].
=Quantum Chess=
[[Quantum Chess]], a variant of the chess game invented by Selim Akl, uses the weird properties of [https://en.wikipedia.org/wiki/Quantum_mechanics quantum physics]. Unlike the chess pieces of the conventional game, where a pawn is a pawn, and a rook is a rook, a quantum chess piece is a superposition of "states", each state representing a different conventional piece. In Quantum Chess, a player does not know the identity of a piece (that is, whether it is a pawn, a rook, a bishop, and so on) until the piece is selected for a move. Once a piece is selected it elects to behave as one of its constituent conventional pieces, but soon recovers its quantum state and returns to being a superposition of two or more pieces <ref>[http://research.cs.queensu.ca/Parallel/QuantumChess/QuantumChess.html Quantum Chess]</ref>.
[[FILE:selim-akl-alice-wismath-by-kristyn-wallace.jpg|none|border|text-bottom|link=http://www.cbc.ca/technology/story/2010/09/02/quantum-chess-akl.html]]
In the quantum chess computer game created by computer science student [[Alice Wismath]] (right), <br/>
a piece that should be a knight could simultaneously also be a queen, a pawn or something else. <br/>
Wismath based the game on an idea proposed by computer science professor Selim Akl <ref>[http://www.cbc.ca/technology/story/2010/09/02/quantum-chess-akl.html Quantum physics adds twist to chess], [http://www.cbc.ca/technology/ CBC News - Technology & Science], September 6, 2010</ref>
=Selected Publications=
<ref>[http://research.cs.queensu.ca/Parallel/publications.html#Publications Selim Akl - Publications]</ref> <ref>[http://research.cs.queensu.ca/Parallel//technical.html#Technical Selim Akl - Technical Reports]</ref> <ref>[http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/a/Akl:Selim_G=.html DBLP: Selim G. Akl]</ref> <ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref>
==1977==
* [[Selim Akl]], [[Monroe Newborn]] ('''1977'''). ''The Principal Continuation and the Killer Heuristic''. 1977 ACM Annual Conference Proceedings, pp. 466-473. ACM, Seattle, WA.
==1980 ...==
* [[Selim Akl]], [http://umanitoba.ca/admin/president/bio.html David T. Barnard], [http://research.cs.queensu.ca/TechReports/authorsD.html#Doran,%20R.J. R.J. Doran] ('''1980'''). ''Design, Analysis and Implementation of a Parallel Alpha-Beta Algorithm''. Queen's University
* [[Selim Akl]], [http://umanitoba.ca/admin/president/bio.html David T. Barnard], [http://research.cs.queensu.ca/TechReports/authorsD.html#Doran,%20R.J. R.J. Doran] ('''1980'''). ''Simulation and Analysis in Deriving Time and Storage Requirements for a Parallel Alpha-Beta Pruning Algorithm''. IEEE International Conference on Parallel Processing, pp. 231-234.
* [[Selim Akl]], [http://umanitoba.ca/admin/president/bio.html David T. Barnard], [http://research.cs.queensu.ca/TechReports/authorsD.html#Doran,%20R.J. R.J. Doran] ('''1980'''). ''Searching Game Trees in Parallel''. Proceedings of the Third Biennial Conference of the Canadian Society for Computational Studies of Intelligence, Victoria, B.C.
* [[Selim Akl]], [http://research.cs.queensu.ca/TechReports/authorsD.html#Doran,%20R.J. R.J. Doran] ('''1981'''). ''A Comparison of Parallel Implementations of the Alpha-Beta and Scout tree Search Algorithms using the game of Checkers''. Queen's University
* [[Selim Akl]], [http://umanitoba.ca/admin/president/bio.html David T. Barnard], [http://research.cs.queensu.ca/TechReports/authorsD.html#Doran,%20R.J. R.J. Doran] ('''1982'''). ''Design, Analysis, and Implementation of a Parallel Tree Search Algorithm''. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol 4, No 2, pp. 192-203. ISSN 0162-8828
* [[Selim Akl]] ('''1985'''). ''[http://portal.acm.org/citation.cfm?id=533017&dl=GUIDE, Parallel Sorting Algorithms]''. (Academic Press)
* [[Selim Akl]] ('''1989'''). ''[http://portal.acm.org/citation.cfm?id=63471 The Design and Analysis of Parallel Algorithms]''. (Prentice Hall)
==1990 ...==
* [[Selim Akl]], [http://individual.utoronto.ca/klyons/ Kelly A. Lyons] ('''1993'''). ''[http://portal.acm.org/citation.cfm?id=162256&dl=ACM&coll=GUIDE Parallel Computational Geometry]''. (Prentice Hall).
* [[Selim Akl]] ('''1997'''). ''[http://fano.ics.uci.edu/cites/Document/Parallel-Computation-Models-+-Methods.html Parallel Computation: Models and Methods]''. (Prentice Hall).
==2000 ...==
* [[Selim Akl]] ('''2006'''). ''Even Accelerating Machines are not Universal''. Technical Report No. 2006-508, Queen's University, [http://research.cs.queensu.ca/home/akl/techreports/even.pdf pdf]
* [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/s/Stewart:Ian.html Ian Stewart], [http://people.trentu.ca/wfeng/ Wenying Feng], [[Selim Akl]] ('''2009'''). ''[http://www.computer.org/portal/web/csdl/doi/10.1109/ITNG.2009.240 A Further Improvement on a Genetic Algorithm]''. [http://www.informatik.uni-trier.de/~ley/db/conf/itng/itng2009.html#StewartFA09 ITNG 2009]
==2010 ...==
* [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/s/Stewart:Ian.html Ian Stewart], [http://people.trentu.ca/wfeng/ Wenying Feng], [[Selim Akl]] ('''2010'''). ''Tuning Neural Networks by Both Connectivity and Size''. [http://www.informatik.uni-trier.de/~ley/db/conf/itng/itng2010.html#StewartFA10 ITNG 2010]
* [[Selim Akl]] ('''2010'''). ''Time Travel: A New Hypercomputational Paradigm''. [http://www.informatik.uni-trier.de/~ley/db/journals/ijuc/ijuc6.html#Akl10 IJUC Vol. 6, No. 5]
* [[Selim Akl]] ('''2011'''). ''Bitonic Sort''. Encyclopedia of Parallel Computing 2011 <ref>[https://en.wikipedia.org/wiki/Bitonic_sorter Bitonic sorter from Wikipedia]</ref>
* [http://research.cs.queensu.ca/TechReports/authorsN.html Naya Nagy], [[Selim Akl]] ('''2012'''). ''Computing with Uncertainty and its Implications to Universality''. [http://www.informatik.uni-trier.de/~ley/db/journals/paapp/paapp27.html#NagyA12 IJPEDS, Vol. 27, No. 2]
=External Links=
* [http://research.cs.queensu.ca/home/akl/ Selim Akl's Official Home Page]
* [https://en.wikipedia.org/wiki/Selim_Akl Selim Akl from Wikipedia]
* [http://research.cs.queensu.ca/Parallel//projects.html Non-Universality in Computation: The Myth of the Universal Computer]
* [http://www.ratemyprofessors.com/ShowRatings.jsp?tid=29852 Selim G Akl - Queen's University at Kingston - RateMyProfessors.com]
=References=
<references />
'''[[People|Up one level]]'''
