5,478 research outputs found

    A foundation for multi-level modelling

    Get PDF
    Multi-level modelling allows types and instances to be mixed in the same model, however there are several proposals for how meta- models can support this. This paper proposes a meta-circular basis for meta-modelling and shows how it supports two leading approaches to multi-level modelling

    Web extensions to UML: Using the MVC Triad

    Full text link
    Abstract. Current Web Modelling Languages (WMLs) fall short of the requirements for the modelling of web system development. In particular, those WMLs with a hypermedia basis are more closely focussed on the information architecture whereas software system WMLs are more focussed on the functional architecture. Generally, modelling languages have failed to bridge the gap between these two areas. They also do not handle well the connection between different levels of abstraction and are largely unable to connect well with business models. Based on an analysis of existing modelling approaches, we propose a conceptual extension to modelling approaches that attempts to address these limitations. We show how it can implemented using UML modelling along with the addition of concepts taken from Web information modelling approaches, WebML in particular. The extensions are structured around the Model-View-Controller concept, which we argue provides an appropriate integrating modelling framework. We begin by discussing the scope and objectives of the extensions, followed by a description of the extensions themselves. We then illustrate the extensions by showing their application to a small case study.

    An ontology for ISO software engineering standards: 1) Creating the infrastructure

    Full text link
    Software engineering standards developed under the auspices of ISO/IEC JTC1's SC7 have been identified as employing terms whose definitions vary significantly between standards. This led to a request in 2012 to investigate the creation of an ontological infrastructure that aims to be a single coherent underpinning for all SC7 standards, present and future. Here, we develop that necessary infrastructure prior to its adoption by SC7 and its implementation (likely 2014). The proposal described here requires, firstly, the identification of a single comprehensive set of definitions, the definitional elements ontology (DEO). For the scope of an individual standard, only a subset of these definitional elements will be needed. Once configured, this definitional subset creates a configured definitional ontology or CDO. Both the DEO and the CDO are essentially foundational ontologies from which a domain-specific ontology known as a SDO or standard domain ontology can be created. Consequently, all such SDOs are conformant to a CDO and hence to the single DEO thus ensuring that all standards use the same ontological base. Standards developed in this fashion will therefore be not only of a higher quality but also, importantly, interoperable. © 2013 Elsevier B.V. All rights reserved

    A Probabilistic View of Certain Weighted Fibonacci Sums

    Get PDF
    In this article, we pursue the reverse strategy of using probability to derive an and develop an exponential generating function for an in Section 3. In Section 4, we present a method for finding an exact, non-recursive, formula for an

    Tiling Proofs of Recent Sum Identities Involving Pell Numbers

    Get PDF
    In a recent note, Santana and Diaz-Barrero proved a number of sum identities involving the well-known Pell numbers. Their proofs relied heavily on the Binet formula for the Pell numbers. Our goal in this note is to reconsider these identities from a purely combinatorial viewpoint. We provide bijective proofs for each of the results by interpreting the Pell numbers as enumerators of certain types of tilings. In turn, our proofs provide helpful insight for straightforward generalizations of a number of the identities

    Implementing the Simple Biosphere Model (SiB) in a general circulation model: Methodologies and results

    Get PDF
    The Simple Biosphere MOdel (SiB) of Sellers et al., (1986) was designed to simulate the interactions between the Earth's land surface and the atmosphere by treating the vegetation explicitly and relistically, thereby incorporating biophysical controls on the exchanges of radiation, momentum, sensible and latent heat between the two systems. The steps taken to implement SiB in a modified version of the National Meteorological Center's spectral GCM are described. The coupled model (SiB-GCM) was used with a conventional hydrological model (Ctl-GCM) to produce summer and winter simulations. The same GCM was used with a conventional hydrological model (Ctl-GCM) to produce comparable 'control' summer and winter variations. It was found that SiB-GCM produced a more realistic partitioning of energy at the land surface than Ctl-GCM. Generally, SiB-GCM produced more sensible heat flux and less latent heat flux over vegetated land than did Ctl-GCM and this resulted in the development of a much deeper daytime planetary boundary and reduced precipitation rates over the continents in SiB-GCM. In the summer simulation, the 200 mb jet stream and the wind speed at 850 mb were slightly weakened in the SiB-GCM relative to the Ctl-GCM results and equivalent analyses from observations

    Paint it Black -- A Combinatorial Yawp

    Get PDF
    No abstract provided in this paper

    Bidirectional Scatter Measurements of a Guided-mode Resonant Filter Photonic Crystal Structure

    Get PDF
    This work investigates the Bidirectional Scatter Distribution Function (BSDF) at incident angles other than normal and at 544-nm wavelength of a Guided Mode Resonance Filter (GMRF) Photonic Crystal (PC) structure designed for normally incident light at 532 nm. Strong out-coupling of PC diffraction orders into both the transmitted and reflected hemispheres was observed specifically at a 25.7° incidence angle, which we attribute to this incident angle/wavelength pair being a good match to the ( ± 1, 0) PC grating mode. BSDF measurements at incident angles of 15° and 35° also displayed some out-coupled diffraction, though much lower in magnitude, and are also attributed to being a weaker match to the ( ± 1, 0) PC grating mode. Three-dimensional finite-difference time-domain Maxwell\u27s equation simulations demonstrate that since this GMRF was designed for complete destructive interference of the transmitted light upon normal incidence, stronger out-coupling of the diffraction is expected for modal solutions as the angle of incidence increases. © 2012 Optical Society of America

    Improved Algorithms for Approximate String Matching (Extended Abstract)

    Get PDF
    The problem of approximate string matching is important in many different areas such as computational biology, text processing and pattern recognition. A great effort has been made to design efficient algorithms addressing several variants of the problem, including comparison of two strings, approximate pattern identification in a string or calculation of the longest common subsequence that two strings share. We designed an output sensitive algorithm solving the edit distance problem between two strings of lengths n and m respectively in time O((s-|n-m|)min(m,n,s)+m+n) and linear space, where s is the edit distance between the two strings. This worst-case time bound sets the quadratic factor of the algorithm independent of the longest string length and improves existing theoretical bounds for this problem. The implementation of our algorithm excels also in practice, especially in cases where the two strings compared differ significantly in length. Source code of our algorithm is available at http://www.cs.miami.edu/\~dimitris/edit_distanceComment: 10 page
    • …
    corecore