Second Call for Papers
10th Conference on Intelligent Computer Mathematics
- CICM 2017 -
July 17-21, 2017
University of Edinburgh, Scotland
http://www.cicm-conference.org/2017
----------------------------------------------------------------------
NEW * Invited Speakers: Alan Bundy (University of Edinburgh) and
Grant Olney Passmore (University of Cambridge)
----------------------------------------------------------------------
Digital and computational solutions are becoming the prevalent means
for the generation, communication, processing, storage and curation of
mathematical information. Separate communities have developed to
investigate and build computer based systems for computer algebra,
automated deduction, and mathematical publishing as well as novel user
interfaces. While all of these systems excel in their own right, their
integration can lead to synergies offering significant added
value. The Conference on Intelligent Computer Mathematics (CICM)
offers a venue for discussing and developing solutions to the great
challenges posed by the integration of these diverse areas.
CICM has been held annually as a joint meeting since 2008, co-locating
related conferences and workshops to advance work in these
subjects. Previous meetings have been held in Birmingham (UK 2008),
Grand Bend (Canada 2009), Paris (France 2010), Bertinoro (Italy 2011),
Bremen (Germany 2012), Bath (UK 2013), Coimbra (Portugal 2014),
Washington DC (USA 2015) and Bialystok (Poland 2016).
This is a call for papers for CICM 2017, which will be held in
Edinburgh, Scotland, July 17-21, 2017. CICM 2017 also invites work-in-
progress papers.
The principal tracks of the conference will be:
* Track: Calculemus (chair: Matthew England)
All topics in the intersection of computer algebra systems and
automated reasoning systems including:
- Automated theorem proving in computer algebra systems.
- Computer algebra and symbolic computation in theorem proving
systems.
- Theory, design and implementation of interdisciplinary systems for
computer mathematics.
- Case studies and applications that involve a mix of computation
and reasoning.
- Case studies in formalization of mathematical theories that include
non-trivial computations.
- Representation of mathematics in computer algebra systems.
- Input languages, programming languages, types and constraint
languages, and modeling languages for mathematical assistant systems.
* Track: Digital Mathematical Libraries (DML) (chair: Olaf Teschke)
All topics related to the formation of a Global Digital Mathematics
Library (GDML) network, ranging from experiences from existing DMLs,
policies and standards facilitating interoperability, to development
and integration of new techniques for content creation,
preservation, enhancement and retrieval of the corpus, including:
- DML creation and maintenance (content aggregation, validation,
curation, enhancement).
- DML architecture and representations (organization, workflows,
policies, standards).
- DML access and applications (retrieval, interfaces, interoperability).
- DML collections and systems (experiences from various existing DMLs).
* Track: Mathematical Knowledge Management (MKM) (chair: Florian Rabe)
- Knowledge representation using, e.g., formal logics, computational
systems, narrative document formats, or databases
- Solutions to create, store, disseminate, discover, or manipulate
mathematical knowledge
- Corpora of knowledge inlcuding documents, theories, theorems, proofs,
models, algorithms, exercises, or examples
- Methods, systems, frameworks, case studies, challenges, benchmarks,
or applications for mathematical knowledge
- Comparisons, evaluations, or integrations of MKM solutions
* Track: Systems & Projects (chair: Osman Hasan)
- Systems: Stand-alone; plugins, libraries, or extensions of
existing systems; or integrations of existing systems
- Data: Formalizations; harvests or new processing of existing data;
or case studies, test cases, or benchmark suites for systems
- Projects: finished, ongoing or new
- Survey papers
* Track: Doctoral Programme (chair: TBD)
The overall programme is organized by the General Program Chair Herman
Geuvers. The local arrangements will be coordinated by Jacques
Fleuriot. The publicity chair is Serge Autexier.
We plan to have proceedings of the conference as in previous years
with Springer Verlag as a volume in Lecture Notes in Artificial
Intelligence (LNAI).
*Important Dates*
Conference submissions
- Abstract submission deadline: 15. March 2017
- Submission deadline: 22. March 2017
- Reviews sent to authors: 26. April 2017
- Rebuttals due: 30. April 2017
- Notification of acceptance: 12. May 2017
- Camera ready copies due: 26. May 2017
- Conference: 17.-21. July 2017
Workshop Proposals
- Submission deadline: 10. February 2017
- Notification of acceptance: 15. February 2017
More details on the conference are available from
http://www.cicm-conference.org/2017
Dear Wikimedia technical community members,
https://www.mediawiki.org/wiki/Code_of_Conduct
The review of the Code of Conduct for Wikimedia technical spaces has been
completed and now it is time to bootstrap its first committee. The
Technical Collaboration team is looking for five candidates to form the
Committee plus five additional auxiliary members. One of them could be you
or someone you know!
You can propose yourself as a candidate and you can recommend others
*privately* at
techconductcandidates AT wikimedia DOT org
We want to form a very diverse list of candidates reflecting the variety of
people, activities, and spaces in the Wikimedia technical community. We are
also open to other candidates with experience in the field. Diversity in
the Committee is also a way to promote fairness and independence in their
decisions. This means that no matter who you are, where you come from, what
you work on, or for how long, you are a potential good member of this
Committee.
The main requirements to join the Committee are a will to foster an open
and welcoming community and a commitment to making participation in
Wikimedia technical projects a respectful and harassment-free experience
for everyone. The committee will handle reports of unacceptable behavior,
will analyze the cases, and will resolve on them according to the Code of
Conduct. The Committee will also handle proposals to amend the Code of
Conduct for the purpose of increasing its efficiency. The term of this
first Committee will be one year.
Once we have a list of 5 + 5 candidates, we will announce it here for
review. You can learn more about the Committee and its selection process at
https://www.mediawiki.org/wiki/Code_of_Conduct/Committee and you can ask
questions in the related Talk page (preferred) or here.
You can also track the progress of this bootstrapping process at
https://www.mediawiki.org/wiki/Talk:Code_of_Conduct#Bootstrapping_the_Code_…
PS: We have many technical spaces and reaching to all people potentially
interested is hard! Please help spreading this call.
--
Quim Gil
Engineering Community Manager @ Wikimedia Foundation
http://www.mediawiki.org/wiki/User:Qgil
Dear Wiki researchers,
Is there a quick/easy way to figure out how many edits a particular editor
has made (or, better yet, get a list of all those edits)?
Thanks!
--
- - - - - - - - - - - - - - - - - - - - -
Misha Teplitskiy
Postdoctoral Fellow
Innovation Science Lab
Harvard University
www.mishateplitskiy.com
Hey folks,
This is long over due. I did a presentation[1,2] at the research showcase
more than a year ago (January 2016) that showed some fascinating
productivity dynamics using content persistence measures[3]. Well, I've
finally taken the material and fleshed out the report on Meta.
Full report:
https://meta.wikimedia.org/wiki/Research:Measuring_edit_productivity
Here's some highlights:
- Anonymous editors contribute substantially to overall productivity
(15-25%); however, their proportion of overall contribution proportion has
been steadily declining since the beginning of 2006
- As Wikipedia declined in number of editors, efficiency increased at a
rate that was proportional -- enough to maintain a nearly consistent
overall level of productivity. This means that Wikipedia has been getting
more efficient
- Tools and bots don't explain the increase in overall efficiency, but
tool-assisted productive contributions are certainly on the rise.
1. https://www.youtube.com/watch?v=vRpUby3MoqU#t=0m49s
2.
https://www.mediawiki.org/wiki/File:Anon_productivity_and_productive_effici…
3. https://meta.wikimedia.org/wiki/Research:Content_persistence
Enjoy!
-Aaron
CALL FOR PAPERS
Transactions on Social Computing
A New ACM Journal
Editor-in-Chief: Kevin Crowston, Syracuse University, USA
________________________________
[http://www.acm.org/binaries/content/gallery/acm/membership/tsc_cover.jpg] INFORMATION FOR CONTRIBUTORS
ACM Transactions on Social Computing (TSC) seeks to publish work that covers the full spectrum of social computing including theoretical, empirical, systems, and design research contributions. The editorial perspective is that social computing is fundamentally about computing systems and techniques in which users interact, directly or indirectly, with what they believe to be other users or other users’ contributions. TSC welcomes research employing a wide range of methods to advance the tools, techniques, understanding, and practice of social computing, including: theoretical, algorithmic, empirical, experimental, qualitative, quantitative, ethnographic, design, and engineering research. Social computing will continue to be shaped by foundational algorithmic, econometric, psychological, sociological, and social science research and these broad based perspectives will continue to have a profound influence on how social computing systems are designed, built and how they grow.
TSC particularly solicits research that designs, implements or studies systems that mediate social interactions among users, or that develops or studies theory or techniques for application in those systems. Examples of such social computing systems include, but are not limited to: instant messaging, blogs, wikis, social networks, social tagging, social recommenders, collaborative editors and shared repositories.
The scope of research covered within TSC includes:
* Understanding motivations for contributing to and participating in social computing systems
* Tools that help users understand the individual and collective roles of participants in social computing systems
* The influence of scale; how differing scales of human and machine participation changes the designs and adoptions of systems
* Micro-tasking systems and techniques for decomposing complex activities into recomposable tasks that can be completed by mixtures of people and machines
* System architectures and infrastructure for developing social computing platforms
* Foundational algorithmic analysis that accounts for human and machine data and runtime complexity
* The roles of artificial agents in social computing spaces, the design, creation, and management of those agents relative to social interactions within a social computing system
* Research on privacy mechanisms -- both formal and interactive -- related to social computing data and systems
* Research on algorithms for personalization within a social computing context, including recommender systems and social matchmaking systems
* Research on crowdsourcing, collaborative content creation, productive social gaming, citizen science and other mechanisms and applications of aggregating individual contributions for a collective goal
* Research studying communications patterns in online communication forums
* Ethnographic case studies of social computing in situ
* Algorithms for extracting knowledge from social computing usage data and artifacts
* Ethical and policy issues in social computing
TSC continues ACM's commitment to high quality / high impact journals while seeking to create a bridge across the many disciplines that inform social computing.
ACM Instructions to Authors can be found at www.acm.org/publications/submissions<http://orange.hosting.lsoft.com/trk/click?ref=znwrbbrs9_6-1110ex3e0d6x05688&> .
Hopefully you all have already seen the Wikimania 2017 call for
submissions, but if not, here you are! The deadline is March 30 for
presentations.
best,
Phoebe
---------- Forwarded message ----------
From: phoebe ayers <phoebe.wiki(a)gmail.com>
Date: Tue, Feb 14, 2017 at 10:10 AM
Subject: Wikimania 2017 call for submissions
To: Wikimedia Mailing List <wikimedia-l(a)lists.wikimedia.org>, "Wikimania
general list (open subscription)" <wikimania-l(a)lists.wikimedia.org>
All,
I'm very pleased to send out the Wikimania Montréal Call for Submissions,
which can be found in French here:
https://wikimania2017.wikimedia.org/wiki/Submissions/fr
and in English here:
https://wikimania2017.wikimedia.org/wiki/Submissions/en
On behalf of the Wikimania programme committee,
Phoebe Ayers
-----
Que vous soyez un membre de la communauté de l’un des projets Wikimédia
(tels que Wikipédia, Wikibooks, Wikidata, Wikisource, Wikinews, Wikimedia
Commons, Wiktionnaire, MediaWiki ou autres), un créateur de contenu libre
ou un consommateur, nous recevrons avec plaisir votre proposition pour une
session lors de Wikimania 2017.
*dates importantes*
Appel aux propositions ouvert : 2 février 2017
Date limite de soumission des présentations (conférence, panneau, table
ronde et atelier) : 30 mars 2017
Date limite de soumission des brefs exposés, affiches et réunions d’oiseaux
de la même plume : 15 mai 2017.
Notification d’acceptation des présentations : 20 avril 2017
Notification d’acceptation des brefs exposés, affiches et réunions
d’oiseaux de la même plume : 10 juin 2017
*Types de soumissions & Comment soumettre: *https://wikimania2017.
wikimedia.org/wiki/Submissions/fr
*Des questions ?* Merci de contacter le Comité du programme par
wikimania-program(à)wikimedia.org.
----
Whether you are a community member of one of the Wikimedia projects (such
as Wikipedia, Wikibooks, Wikidata, Wikisource, Wikinews, Wikimedia Commons,
Wiktionary, MediaWiki or others), or a fellow open content creator or
consumer, we welcome your proposal for a session at Wikimania 2017.
*Important dates*
Call for proposals opens: February 2, 2017
Deadline for submitting presentation (lecture, panel, roundtable and
workshop) submissions: March 30, 2017
Deadline for submitting lightning talks, poster, and birds of a feather
submissions: May 15, 2017
Notification of acceptance for presentations: April 20, 2017
Notification of acceptance for lightning talks, poster and birds of a
feather submissions: June 10, 2017
*Submission types & how to submit:* https://wikimania2017.
wikimedia.org/wiki/Submissions/en
*Any questions?* Please contact the Programme Committee at
wikimania-program at wikimedia.org
--
* I use this address for lists; send personal messages to phoebe.ayers <at>
gmail.com *
Dear Wikipedia researchers,
I'm working on a paper that would benefit from knowing more about a given
set of Wikipedia editors. Does anyone have experience surveying Wikipedia
editors? Can someone point me to literature that has done this or discuss
how one might go about doing it?
>From what I understand, it is possible to private-message registered Wiki
editors from a registered account, but perhaps there are
considerations/limitations I should keep in mind?
Thanks!
--
- - - - - - - - - - - - - - - - - - - - -
Misha Teplitskiy
Postdoctoral Fellow
Innovation Science Lab
Harvard University
www.mishateplitskiy.com
The January 2017 issue of the Wikimedia Research Newsletter is out:
https://blog.wikimedia.org/2017/02/28/research-newsletter-january-2017/https://meta.wikimedia.org/wiki/Research:Newsletter/2017/January
This edition is a special issue collecting recent research about the topic of Wikipedia in education.
In this issue:
1 "Wikipedia as a platform for impactful learning: A new course model in higher education"
2 Faculty perception of Wikipedia improves over five-year term
3 Students report 95% of their interactions with other Wikipedians as positive – even when they are getting reverted
4 Briefly
4.1 What we know from research about why Wikipedia is still struggling to get accepted in academia, and about the benefits of teaching with Wikipedia
4.2 "Contributing to Wikipedia as an assignment for undergraduate students"
4.3 How to motivate students and others to contribute to Wikibooks
4.4 K-12 teachers perceive Wikipedia as easy to use but unreliable
4.5 Conferences and events
*** 17 recent publications were covered or listed in this issue ***
Masssly, Tilman Bayer and Dario Taraborelli
PS: As always, remember that you can also follow research news via our Twitter account: https://twitter.com/Wikiresearch. The feed is celebrating its 5th anniversary currently, having featured around 3000 research updates per day since 2012, or 1.6 per day on average. We recently made a Facebook version available, too: https://www.facebook.com/WikiResearch/
---
Wikimedia Research Newsletter
https://meta.wikimedia.org/wiki/Research:Newsletter/
* Receive this newsletter by mail:
https://lists.wikimedia.org/mailman/listinfo/research-newsletter
* Subscribe to the RSS feed:
http://blog.wikimedia.org/c/research-2/wikimedia-research-newsletter/feed/
Hi everybody, I'm new to the list and have been referred here by a comment
from a SO user as per my question [1], that I'm quoting next:
I
* have been successfully able to use the Wikipedia pagelinks SQL dump to
obtain hyperlinks between Wikipedia pages for a specific revision
time.However, there are cases where multiple instances of such links exist,
e.g. the very same https://en.wikipedia.org/wiki/Wikipedia
<https://en.wikipedia.org/wiki/Wikipedia> page and
https://en.wikipedia.org/wiki/Wikimedia_Foundation
<https://en.wikipedia.org/wiki/Wikimedia_Foundation>. I'm interested to
find number of links between pairs of pages for a specific revision. Ideal
solutions would involve dump files other than pagelinks (which I'm not
aware of), or using the MediaWiki API.*
To elaborate, I need this information to weight (almost) every hyperlink
between article pages (that is, in NS0), that was present in a specific
wikipedia revision (end of 2015), therefore, I would prefer not to follow
the solution suggested by the SO user, that would be rather impractical.
Indeed, my final aim is to use this weight in a thresholding fashion to
sparsify the wikipedia graph (that due to the short diameter is more or
less a giant connected component), in a way that should reflect the
"relatedness" of the linked pages (where relatedness is not intended as
strictly semantic, but at a higher "concept" level, if I may say so).
For this reason, other suggestions on how determine such weights (possibly
using other data sources -- ontologies?) are more than welcome.
The graph will be used as dataset to test an event tracking algorithm I am
doing research on.
Thanks,
Mara
[1]
http://stackoverflow.com/questions/42277773/number-of-links-between-two-wik…
