Investing in Knowledge: The Benefits of an Open Access Fund

This presentation will discuss the strengths and weaknesses of the University of Nebraska at Omaha Open Access Fund through analysis of the disciplinary diversity of applicants, eligibility guidelines, funding limit and the benefits of publishing Open Access. Furthermore, it will seek to discover ways to increase participation in the Open Access Fund and by extension, the institutional repository, through comparison with other universities’ OA funds

Anatomy of Creative Commons Licenses

In this presentation we will explore the anatomy of Creative Commons licenses through coming to understand six key areas. These areas are: 1.What is Creative Commons (CC)? 2.Three layers of the CC licenses 3.Four license elements and their icons 4.Six Creative Commons licenses 5.CC licenses affect on copyright exceptions and limitations 6.CC licenses affect on works in the public domai

Using Creative Commons Licenses and Creative Commons Licensed Works

Understanding the difference between collections and derivative works is key to your reuse and adaptation of existing material. It is often useful to create collections and derivative works for educational purposes; for instance, you may wish to compile a collection of articles or adapt an existing educational source to serve as a course text. However, it is not always possible to do both or any, depending on copyright restrictions. This presentation will guide your use and re-use of material that hold a Creative Commons license. In this presentation we will answer the questions What are collections and what are derivative works? We will also provide examples of collections and derivative works, along with providing tools for how to navigate reuse with the adapter\u27s license chart and the license compatibility chart

What is Creative Commons?

What is Creative Commons? is a presentation discussing the background and purpose of Creative Commons

Characterizing Van Kampen Squares via Descent Data

Categories in which cocones satisfy certain exactness conditions w.r.t. pullbacks are subject to current research activities in theoretical computer science. Usually, exactness is expressed in terms of properties of the pullback functor associated with the cocone. Even in the case of non-exactness, researchers in model semantics and rewriting theory inquire an elementary characterization of the image of this functor. In this paper we will investigate this question in the special case where the cocone is a cospan, i.e. part of a Van Kampen square. The use of Descent Data as the dominant categorical tool yields two main results: A simple condition which characterizes the reachable part of the above mentioned functor in terms of liftings of involved equivalence relations and (as a consequence) a necessary and sufficient condition for a pushout to be a Van Kampen square formulated in a purely algebraic manner.Comment: In Proceedings ACCAT 2012, arXiv:1208.430

Easy as 1,2,3: Create your own journal/ event pages with DigitalCommons@UNO

Creating a journal or event page with DigitalCommons is as easy as 1,2,3! Journal/ event pages on DigitalCommons@UNO possess similar features. These features help you to: •Create more impact •Create opportunities for outreach •Save time on administrative task

On the definition of parallel independence in the algebraic approaches to graph transformation

Parallel independence between transformation steps is a basic and well-understood notion of the algebraic approaches to graph transformation, and typically guarantees that the two steps can be applied in any order obtaining the same resulting graph, up to isomorphism. The concept has been redefined for several algebraic approaches as variations of a classical “algebraic” condition, requiring that each matching morphism factorizes through the context graphs of the other transformation step. However, looking at some classical papers on the double-pushout approach, one finds that the original definition of parallel independence was formulated in set-theoretical terms, requiring that the intersection of the images of the two left-hand sides in the host graph is contained in the intersection of the two interface graphs. The relationship between this definition and the standard algebraic one is discussed in this position paper, both in the case of left-linear and non-left-linear rules

Correctness, completeness and termination of pattern-based model-to-model transformation

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-03741-2_26Proceedings of Third International Conference, CALCO 2009, Udine, Italy, September 7-10, 2009.Model-to-model (M2M) transformation consists in trans- forming models from a source to a target language. Many transformation languages exist, but few of them combine a declarative and relational style with a formal underpinning able to show properties of the transformation. Pattern-based transformation is an algebraic, bidirectional, and relational approach to M2M transformation. Specifications are made of patterns stating the allowed or forbidden relations between source and target models, and then compiled into low level operational mechanisms to perform source-to-target or target-to-source transformations. In this paper, we study the compilation into operational triple graph grammar rules and show: (i) correctness of the compilation of a specification without negative patterns; (ii) termination of the rules, and (iii) completeness, in the sense that every model considered relevant can be built by the rules.Work supported by the Spanish Ministry of Science and Innovation, projects METEORIC (TIN2008-02081), MODUWEB (TIN2006-09678) and FORMALISM (TIN2007-66523). Moreover, part of this work was done during a sabbatical leave of the first author at TU Berlin, with financial support from the Spanish Ministry of Science and Innovation (grant ref. PR2008-0185). We thank the referees for their useful comment