A Model for Integration and Interlinking of Idea Management Systems

This paper introduces the use of Semantic Web technologies for the Idea Management Systems as a gap closer between heterogeneous software and achieving interoperability. We present a model that proposes how and what kind of rich metadata annotations to apply in the domain of Idea Management Systems. In addition, as a part of our model, we present a Generic Idea and Innovation Management Ontology (GI2MO). The described model is backed by a set of use cases followed by evaluations that prove how Semantic Web can work as tool to create new opportunities and leverage the contemporary Idea Management legacy systems into the next level

Some Empirical Criteria for Attributing Creativity to a Computer Program

Peer reviewedPostprin

Mathematical practice, crowdsourcing, and social machines

The highest level of mathematics has traditionally been seen as a solitary endeavour, to produce a proof for review and acceptance by research peers. Mathematics is now at a remarkable inflexion point, with new technology radically extending the power and limits of individuals. Crowdsourcing pulls together diverse experts to solve problems; symbolic computation tackles huge routine calculations; and computers check proofs too long and complicated for humans to comprehend. Mathematical practice is an emerging interdisciplinary field which draws on philosophy and social science to understand how mathematics is produced. Online mathematical activity provides a novel and rich source of data for empirical investigation of mathematical practice - for example the community question answering system {\it mathoverflow} contains around 40,000 mathematical conversations, and {\it polymath} collaborations provide transcripts of the process of discovering proofs. Our preliminary investigations have demonstrated the importance of "soft" aspects such as analogy and creativity, alongside deduction and proof, in the production of mathematics, and have given us new ways to think about the roles of people and machines in creating new mathematical knowledge. We discuss further investigation of these resources and what it might reveal. Crowdsourced mathematical activity is an example of a "social machine", a new paradigm, identified by Berners-Lee, for viewing a combination of people and computers as a single problem-solving entity, and the subject of major international research endeavours. We outline a future research agenda for mathematics social machines, a combination of people, computers, and mathematical archives to create and apply mathematics, with the potential to change the way people do mathematics, and to transform the reach, pace, and impact of mathematics research.Comment: To appear, Springer LNCS, Proceedings of Conferences on Intelligent Computer Mathematics, CICM 2013, July 2013 Bath, U

A DNA Barcode Library for North American Ephemeroptera: Progress and Prospects

DNA barcoding of aquatic macroinvertebrates holds much promise as a tool for taxonomic research and for providing the reliable identifications needed for water quality assessment programs. A prerequisite for identification using barcodes is a reliable reference library. We gathered 4165 sequences from the barcode region of the mitochondrial cytochrome c oxidase subunit I gene representing 264 nominal and 90 provisional species of mayflies (Insecta: Ephemeroptera) from Canada, Mexico, and the United States. No species shared barcode sequences and all can be identified with barcodes with the possible exception of some Caenis. Minimum interspecific distances ranged from 0.3–24.7% (mean: 12.5%), while the average intraspecific divergence was 1.97%. The latter value was inflated by the presence of very high divergences in some taxa. In fact, nearly 20% of the species included two or three haplotype clusters showing greater than 5.0% sequence divergence and some values are as high as 26.7%. Many of the species with high divergences are polyphyletic and likely represent species complexes. Indeed, many of these polyphyletic species have numerous synonyms and individuals in some barcode clusters show morphological attributes characteristic of the synonymized species. In light of our findings, it is imperative that type or topotype specimens be sequenced to correctly associate barcode clusters with morphological species concepts and to determine the status of currently synonymized species

The algebra of lexical semantics

Abstract. The current generative theory of the lexicon relies primar-ily on tools from formal language theory and mathematical logic. Here we describe how a different formal apparatus, taken from algebra and automata theory, resolves many of the known problems with the gener-ative lexicon. We develop a finite state theory of word meaning based on machines in the sense of Eilenberg [11], a formalism capable of de-scribing discrepancies between syntactic type (lexical category) and se-mantic type (number of arguments). This mechanism is compared both to the standard linguistic approaches and to the formalisms developed in AI/KR. 1 Problem Statement In developing a formal theory of lexicography our starting point will be the informal practice of lexicography, rather than the more immediately related for-mal theories of Artificial Intelligence (AI) and Knowledge Representation (KR). Lexicography is a relatively mature field, with centuries of work experience an

Cumulants and the moment algebra: tools for analysing weak measurements

Recently it has been shown that cumulants significantly simplify the analysis of multipartite weak measurements. Here we consider the mathematical structure that underlies this, and find that it can be formulated in terms of what we call the moment algebra. Apart from resulting in simpler proofs, the flexibility of this structure allows generalizations of the original results to a number of weak measurement scenarios, including one where the weakly interacting pointers reach thermal equilibrium with the probed system.Comment: Journal reference added, minor correction

Improving the Efficiency of Reasoning Through Structure-Based Reformulation

Abstract. We investigate the possibility of improving the efficiency of reasoning through structure-based partitioning of logical theories, combined with partitionbased logical reasoning strategies. To this end, we provide algorithms for reasoning with partitions of axioms in first-order and propositional logic. We analyze the computational benefit of our algorithms and detect those parameters of a partitioning that influence the efficiency of computation. These parameters are the number of symbols shared by a pair of partitions, the size of each partition, and the topology of the partitioning. Finally, we provide a greedy algorithm that automatically reformulates a given theory into partitions, exploiting the parameters that influence the efficiency of computation.

Enhancing interoperability: ontology-mapping in an electronic institution

The automation of B2B processes requires a high level of interoperability between potentially disparate systems. We model such systems using software agents (representing enterprises), which interact using specific protocols. When considering open environments, interoperability problems are even more challenging. Addressing business automation as a task that intends to align businesses through a tight integration of processes may not be desirable, because business relationships may be temporary and dynamic. Furthermore, openness implies heterogeneity of technologies, processes, and even domain ontologies. After discussing these issues, this paper presents, in the context of an Electronic Institution, an ontology-mapping service that enables the automation of negotiation protocols when agents may use different ontologies to represent their domain knowledge. The ontology-mapping service employs two approaches used for lexical and semantic similarity, namely N-Grams and WordNet, and poses few requirements on the ontologies' representation format. Examples are provided that illustrate the integration of ontology-mapping with automated negotiation. © 2009 Springer Berlin Heidelberg