February 2011 - Categories - categories.org.au

Research positions
by Maria Manuel Clementino 26 Feb '14

26 Feb '14

5-YEAR RESEARCH POSITIONS The Centre for Mathematics of the University of Coimbra (CMUC) invites applications for five 5-year research positions in all areas of Mathematics. Applicants should have a PhD in Mathematics and at least three years of post-doctoral experience, with an international-level publication record and demonstrated ability to perform independent research. Preference will be given to candidates working in one of the areas in which the members of CMUC are currently active. A very good command of English is required. The appointments will be made for three years, renewable for two more. Successful applicants are expected to develop research within the areas of interest of CMUC. They should also contribute to graduate studies, supervising students from the Department of Mathematics. The basic salary is equivalent to the index 195 of the Portuguese research career (in the order of 42 500 euros a year), in accordance with the Ciência 2008 guidelines http://alfa.fct.mctes.pt/apoios/contratacaodoutorados/edital2008 Benefits include private health insurance and social security. Applicants should send • cover sheet (available from www.mat.uc.pt/cmuc/coversheet.pdf) including names and contact information of three persons who can provide a letter of recommendation • curriculum vitae (publication list included) • a 5-year research proposal (2 pages max), emphasizing their own research goals as pdf files to cmuc(a)mat.uc.pt. The subject of the e-mail message must include the job reference C2008 FCTUC CMUC v15-v19. The deadline for applications is *September 10, 2008.* ------------------------------ More information can be found at www.mat.uc.pt

1 1

separable locale
by Thomas Streicher 17 May '13

17 May '13

Recently rereading Fourman's "Continuous Truth" I came across the term "separable locale" but could nowhere find an explanation. Does it mean a cHa A for which there exists a countable subset B such that ever a in A is the supremum of those b in B with b leq a. This would be the point free account of "second countable", i.e. having a countable basis. Of course, second countable T_) spaces are separable, i.e. have a countable dense set. Is this reading the "usual" one? Thomas [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

5 4

What else do simplicial sets classify?
by Andrej Bauer 05 Oct '11

05 Oct '11

The presheaf category of simplicial sets is the classifying topos for the theory L of a bounded linear order. In general, there could be other theories which are "Morita equivalent" to L in the sense that their classifying toposes are equivalent to simplicial sets. Are any such known, preferably occurring in nature? With kind regards, Andrej [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

8 7

CALCO-Tools: Call for Papers
by Dorel Lucanu 16 Mar '11

16 Mar '11

========================================================================= CALL FOR PAPERS: CALCO-Tools 2011 CALCO-Tools part of CALCO 2011 August 30 - September 2, 2011 Winchester, UK http://calco2011.ecs.soton.ac.uk/workshops/calco-tools.html ========================================================================= Paper submission: March 23, 2011 Author notification: April 20, 2011 Final version due: May 18, 2011 ========================================================================= -- SCOPE -- CALCO-Tools 2011 Workshop is dedicated to tools based on algebraic and/or coalgebraic principles or that are emerging from the intersection of the two approaches. These include systems/prototypes/tools developed specifically for design, checking, execution, and verification of (co) algebraic specifications, but also tools targeting different application domains while making core or interesting use of (co)algebraic techniques. The previus CALCO-Tools editions, Bergen (Norway, 2007) and Udine (Italy, 2009), took place in the day preceding the main CALCO conference. This year, CALCO-Tools 2011 will take place on the same dates as the main CALCO conference, with no overlap between the technical programmes of the two events. In this way we achieve the goal of bringing together researchers and practitioners. -- TOPICS OF INTEREST -- We invite submissions of papers that are presenting systems/prototypes/tools on topics included or related to those listed for the main CALCO conference: * Abstract models and logics - Automata and languages - Categorical semantics - Modal logics - Relational systems - Graph transformation - Term rewriting - Adhesive categories * Specialised models and calculi - Hybrid, probabilistic, and timed systems - Calculi and models of concurrent, distributed, mobile, and context-aware computing - General systems theory and computational models (chemical, biological, etc) * Algebraic and coalgebraic semantics - Abstract data types - Inductive and coinductive methods - Re-engineering techniques (program transformation) - Semantics of conceptual modelling methods and techniques - Semantics of programming languages * System specification and verification - Algebraic and coalgebraic specification - Formal testing and quality assurance - Validation and verification - Generative programming and model-driven development - Models, correctness and (re)configuration of hardware/middleware/architectures, - Process algebra -- SUBMISSION GUIDELINES -- Tool submissions should not exceed 5 pages in LNCS format specified by Springer (see http://www.springer.de/comp/lncs/authors.html) It is recommended that submissions adhere to that format and length. As with previous editions, the accepted tool papers will be included in the final proceedings of the conference published in the Springer Lecture Notes in Computer Science (LNCS) series. The tools should be made available on the web at the time of submission. -- IMPORTANT DATES -- Paper submission: March 23, 2011 Author notification: April 20, 2011 Final version due: May 18, 2011 -- PROGRAMME COMMITTEE -- Paolo Baldan, University of Padova, IT Luis Barbosa, Universidade do Minho, PT Dorel Lucanu (chair), Al. I. Cuza University of Iasi, RO Milad Niqui, CWI, Amsterdam, NL Peter Olveczky, University of Oslo, NO Dirk Pattinson, Imperial College London, UK -- ORGANISING COMMITTEE -- Corina Cirstea (University of Southampton, UK) Dirk Pattinson (Imperial College London, UK) Toby Wilkinson (University of Southampton, UK) -- LOCATION -- Winchester is a beautiful historic city in southern England, known for its 11th-century cathedral and 12th-century castle. It is located just under an hour by rail from London Waterloo, and 15 minutes by road or rail from Southampton Airport. London Heathrow is 50 miles away and London Gatwick 72 miles away. -- FURTHER INFORMATION -- Queries related to submission, reviewing, and programme should be sent to the PC chair. Queries related to the organisation should be emailed to calco2011(a)ecs.soton.ac.uk The poster can be downloaded from http://calco2011.ecs.soton.ac.uk/workshops/calcotools.jpg http://calco2011.ecs.soton.ac.uk/workshops/calcotools.pdf . [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 1

Subobject Classifier Algorithm
by Ellis D. Cooper 04 Mar '11

04 Mar '11

What are the general rules for calculating the sub-object classifier of a topos? Or, for what class of toposes is there an algorithm for calculating the sub-object classifier of its members? Ellis D. Cooper [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

5 7

Foundational Methods in Computer Science (FMCS 2011)
by Robin Cockett 01 Mar '11

01 Mar '11

Announcement: FMCS 2011 Meeting: FMCS 2011 Dates: June 11-14, 2011 Place: Kananaskis Field Station (now the Biogeoscience Institute), University of Calgary Web: http://pages.cpsc.ucalgary.ca/~robin/FMCS/FMCS2011/FMCS11.html The workshop is an informal meeting to bring together researchers in Mathematics and Computer Science with a focus on the applications of category theory in computer science. It is a three and a half day meeting, which starts with a day of tutorial style talks followed by research and contributed talks. Student participation at FMCS is particularly encouraged. There are limited funds to provide support for students who wish to attend the workshop please see the website for further details. Accommodation at the field station is limited: if you plan to attend you should notify me (Robin Cockett, robin at ucalgary dot ca) as soon as possible. If you wish to give a talk please let me know at that time. Abstract and titles must be submitted before Monday 30th May. If you are attending the CMS Summer meeting (Edmonton, the weekend before) you are encouraged to take in this meeting as well!! [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Re: Adjunctions and fibrations in 2-Cat
by Marta Bunge 01 Mar '11

01 Mar '11

Dear Jonathon, A definition of 2-fibration is given in the following sources:Claudio Hermida, "Some properties of Fib as a fibered 2-category", J. Pure Appl. Alg. 134-1 (1999) 83-109.Claudio Hermida, "Descebt on 2-fibrations and strongly 2-regular 2-categories", App. Cat. Str. 12 (2004) 427--459. It is adopted (Definition 4.1) and used in Marta Bunge and Claudio Hermida, 'Pseudomonadicity and 2-stack completions", Proceedings of the MakkaiFest, CRM Proceedings and Lecture Notes, to appear 2011, a preprint of which I shall send to anyone requesting it. Best wishes,Marta Bunge ************************************************ Marta Bunge Professor Emerita Dept of Mathematics and Statistics McGill UniversityBurnside Hall, Office 1005 805 Sherbrooke St. West Montreal, QC, Canada H3A 2K6 Office: (514) 398-3810/3800 Home: (514) 935-3618 marta.bunge(a)mcgill.ca http://www.math.mcgill.ca/~bunge/ ************************************************ > To: categories(a)mta.ca > From: chichejonathan(a)gmail.com > Subject: categories: Adjunctions and fibrations in 2-Cat > Date: Mon, 28 Feb 2011 12:15:27 +0100 > > Dear all, > > Is the notion of adjunction in 2-Cat well-understood? Here, 2-Cat > stands for a 3-category the objects of which are 2-categories. I am > mainly interested in the case where everything is strict, but > comments on the non-strict cases are welcome. > > There has been a discussion recently about what should be the > definition of fibration in an arbitrary 2-category. I do not expect > the notion to be defined for general 3-categories, but is there at > least a definition for the notion of fibration in 2-Cat? > > Many thanks in advance for your help! > > Jonathan Chiche > [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

Adjunctions and fibrations in 2-Cat
by Jonathan CHICHE 齊正航 28 Feb '11

28 Feb '11

Dear all, Is the notion of adjunction in 2-Cat well-understood? Here, 2-Cat stands for a 3-category the objects of which are 2-categories. I am mainly interested in the case where everything is strict, but comments on the non-strict cases are welcome. There has been a discussion recently about what should be the definition of fibration in an arbitrary 2-category. I do not expect the notion to be defined for general 3-categories, but is there at least a definition for the notion of fibration in 2-Cat? Many thanks in advance for your help! Jonathan Chiche [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

OSEMA 2011 Deadline Extension
by Lutz Schroeder 25 Feb '11

25 Feb '11

The submission deadline for OSEMA 2011 has been extended to March 4, 2011. In other news, ESWC 2011 is now planning to publish selected papers from the ESWC 2011 workshops in an LNCS volume after the conference. OSEMA 2011 Call for Papers 1st International Workshop on Ontology and Semantic web for Manufacturing (OSEMA 2011) http://www.osema.org.ve/ at the 8th Extended Semantic Web Conference (ESWC 2011) http://www.eswc2011.org May 29th or 30th, Hersonissos, Crete, Greece SUBMISSION DEADLINE February 25 The necessity of continuous innovation and improvement in productivity presents the manufacturing industry with huge challenges. Not only is there a demand for more creative designs, there is also the need to improve support for streaming designs into production lines. Delivering products to the market involves the flow of information between several steps ranging from design to prototyping, manufacturing and distributing. Interoperability across software supporting these activities is notoriously limited. A semantic layer in the manufacturing sector may facilitate scenarios such as the development of new products considering restrictions and limitations of the manufacturing facility on the one hand and on the other hand considering customer needs. Here, the design of new the product is instantiated into a product ontology. This ontology has metadata including features related to materials, colors, dimensions, etc. Such features reflect customer preferences, but imply the necessity of processes to acquire and manage them. In a second step into this scenario, the ontology of the manufacturing process can be instantiated by extracting features from the product ontology, thus enabling e.g. the automatic inference of manufacturability of the product. In this vein, ontologies and the Semantic Web facilitate the creation of such metadata and enable reasoning over product and process restriction. Although several approaches of this kind have been proposed, none of them are widely accepted so far, which means that there are still several issues requiring extensive discussion and consensus in the community. Therefore, it is necessary to provide a discussion scenario where theoretical positions, best practices, implementations, proposals of standards, and frameworks are presented. It will deserve special interest to discuss how the manufacturing industry can take advantage of Semantic Web technologies. OSEMA 2011 aims to provide such scenario. QUESTIONS AND TOPICS OF INTEREST - How can the Semantic Web support the development of new products? - Why CAD ontologies? Do we really need them? - Do we need one enterprise ontology, or a modular enterprise ontology? - Can OWL be used to represent processes in the manufacturing domain? - Knowledge management over the manufacturing “Know how”. - How can the versioning of products be managed? Can ontology help? How? - How can raw materials be semantically described? - Can there be an ontological framework for manufacturing so that designs and production are interoperable? - Semantic search over the manufacturing information space - How can tagging techniques be applied within the manufacturing domain? AUDIENCE We want to bring together researchers and practitioners active in the design, development, and application of ontologies and the Semantic Web in the manufacturing domain, as well as industrial representatives in Computer Aided Design (CAD), Computer Aided Process Planning (CAPP), and Computer Aided Manufacturing (CAM) industry who are interested in integrating the Product Life Cycle management into their software tools. IMPORTANT DATES Submission deadline: February 25, 2011 Acceptance notification: April 1, 2011 Camera-ready: April 15, 2011 Workshop date: May 29 or 30, 2011 SUBMISSION AND PROCEEDINGS Only electronic submissions will be considered. All submissions should be submitted in pdf format, to https://www.easychair.org/conferences/?conf=osema2011 Submissions should not exceed 14 pages and should be formatted according to the LNCS Springer format (http://www.springer.com/east/home/computer/lncs?SGWID=5-164-7-72376-0) The workshop proceedings will both be uploaded to CEUR (http://ceur-ws.org/) and placed on electronic media for distribution at the conference. PROGRAM COMMITTEE 1. Aristeidis Matsokis, Laboratory for Computer Aided Design and Production, Switzerland. 2. Aziz Bouras, University Claude Bernard Lyon II, France. 3. David Baxter, University of Cranfield, England 4. Dong Yang, Shanghai jiao Tong University, China. 5. Grubic Tonci, University of Cranfield, England. 6. John Bateman, University of Bremen, Germany. 7. Jürgen Angele, Ontoprise, Germany. 8. Kristina Shea, Technische Universität München, Germany. 9. Oliver Eck, Department of Computer Science, HTWG Konstanz, Germany. 10. Parisa Ghoudous, University Claude Bernard Lyon I, France. 11. Richard Gil Herrera, University Simón Bolivar. Venezuela. 12. Sylvere Krima, National Institute of Standards and Technology (NIST), USA. 13. Yuh-Jen Chen, National Kaohsiung First University of Science and Technology, Taiwan. ORGANIZING COMMITTEE * Alexander García Castro, University of Bremen, Germany/University of Arkansas, USA. Email: alexgarciac(a)gmail.com * Lutz Schröder, German Research Center for Artificial Intelligence (DFKI). Email: Lutz.Schroeder(a)dfki.de * Carlos Toro, Vicomtech Research Centre / Donostia-San Sebastían, Spain. Email: ctoro(a)vicomtech.org * Luis Enrique Ramos García, University of Bremen, Germany. Email: s_7dns7r(a)uni-bremen.de -- -------------------------------------- PD Dr. Lutz Schröder Senior Researcher DFKI Bremen Safe and Secure Cognitive Systems Cartesium, Enrique-Schmidt-Str. 5 D-28359 Bremen phone: (+49) 421-218-64216 Fax: (+49) 421-218-9864216 mail: Lutz.Schroeder(a)dfki.de www.dfki.de/sks/staff/lschrode -------------------------------------- ------------------------------------------------------------- Deutsches Forschungszentrum für Künstliche Intelligenz GmbH Firmensitz: Trippstadter Strasse 122, D-67663 Kaiserslautern Geschäftsführung: Prof. Dr. Dr. h.c. mult. Wolfgang Wahlster (Vorsitzender) Dr. Walter Olthoff Vorsitzender des Aufsichtsrats: Prof. Dr. h.c. Hans A. Aukes Amtsgericht Kaiserslautern, HRB 2313 ------------------------------------------------------------- [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

CSL'11 call for papers and workshop proposals
by Marcus Aloysius Bezem 25 Feb '11

25 Feb '11

------------------------------------------------------------------- CALL FOR PAPERS AND WORKSHOP PROPOSALS CSL 2011 20th Annual Conference of the European Association for Computer Science Logic Bergen, Norway September 12-15, 2011 http://www.eacsl.org/csl11 IMPORTANT DATES Submission of title and abstract: March 27, 2011 Submission of full paper: April 3, 2011 Notification: May 30, 2011 Final paper due: June 17, 2011 GENERAL INFORMATION Computer Science Logic (CSL) is the annual conference of the European Association for Computer Science Logic (EACSL). The conference is intended for computer scientists whose research activities involve logic, as well as for logicians working on issues significant for computer science. The Ackermann Award for 2011 will be presented to the recipients at CSL 2011. INVITED SPEAKERS Thomas Ehrhard (University Paris Diderot) Martin Otto (Technical University Darmstadt) Moshe Vardi (Rice University) Frank Wolter (University of Liverpool) SCOPE Topics of interest include (but are not limited to): - automated deduction and interactive theorem proving - constructive mathematics and type theory - equational logic and term rewriting - automata and games, game semantics - modal and temporal logic - model checking - decision procedures - logical aspects of computational complexity - finite model theory - computational proof theory - logic programming and constraints - lambda calculus and combinatory logic - domain theory, - categorical logic and topological semantics - database theory - specification, extraction and transformation of programs - logical foundations of programming paradigms - logical aspects of quantum computing - verification and program analysis - linear logic - higher-order logic - nonmonotonic reasoning PROCEEDINGS The proceedings will be published in the series LIPIcs, Leibniz International Proceedings in Informatics. Each paper accepted by the Program Committee (PC) must be presented at the conference by one of the authors, and a final copy must be prepared according to LIPIcs guidelines (http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors/) PAPER SUBMISSION Authors are invited to submit papers of not more than 15 pages in LIPIcs style presenting work not previously published. Papers are to be submitted through EasyChair: http://www.easychair.org/conferences/?conf=csl2011. Submitted papers must be in English and provide sufficient detail to allow the PC to assess the merits of the paper. Full proofs may appear in a technical appendix which will be read at the reviewers' discretion. Authors are strongly encouraged to include a well written intro- duction which is directed at all members of the program committee. Submission is in two phases with dates as given below. Papers must not be submitted concurrently to another conference with refereed proceedings; The PC chair should be informed of closely related work submitted to a conference or journal by March 19, 2011. Papers authored or coauthored by members of the PC are not allowed. WORKSHOPS Proposals for satellite workshops on more specialized topics are welcome and can be sent to csl11(a)eacsl.org PROGRAM COMMITTEE Samson Abramsky (Oxford) Andrea Asperti (Bologna) Franz Baader (Dresden) Matthias Baaz (Vienna) Johan van Benthem (Amsterdam/Stanford) Marc Bezem (Bergen, chair) Patrick Blackburn (Nancy) Andreas Blass (Michigan) Jan van den Bussche (Hasselt) Thierry Coquand (Gothenburg) Nachum Dershowitz (Tel Aviv) Valentin Goranko (Copenhagen) Erich Graedel (Aachen) Wiebe van der Hoek (Liverpool) Bart Jacobs (Nijmegen) Reinhard Kahle (Lisbon) Stephan Kreutzer (Oxford) Viktor Kuncak (Lausanne) Daniel Leivant (Indiana) Benedikt Loewe (Amsterdam) Jean-Yves Marion (Nancy) Eugenio Moggi (Genova) Albert Rubio (Barcelona) Anton Setzer (Swansea) Alex Simpson (Edinburgh) John Tucker (Swansea) Pawel Urzyczyn (Warsaw) Helmut Veith (Vienna) Andrei Voronkov (Manchester) ORGANIZING COMMITTEE Isolde Adler Marc Bezem Magne Haveraaen Michal Walicki Uwe Wolter CONFERENCE ADDRESS CSL 2011, Department of Informatics, University of Bergen, P.O.Box 7803, N-5020 Bergen, Norway http://www.eacsl.org/csl11 ----------------------------------------------------------------- [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0