11,233 research outputs found
Graphical modelling language for spycifying concurrency based on CSP
Introduced in this (shortened) paper is a graphical modelling language for specifying concurrency in software designs. The language notations are derived from CSP and the resulting designs form CSP diagrams. The notations reflect both data-flow and control-flow aspects of concurrent software architectures. These designs can automatically be described by CSP algebraic expressions that can be used for formal analysis. The designer does not have to be aware of the underlying mathematics. The techniques and rules presented provide guidance to the development of concurrent software architectures. One can detect and reason about compositional conflicts (errors in design), potential deadlocks (errors at run-time), and priority inversion problems (performance burden) at a high level of abstraction. The CSP diagram collaborates with objectoriented modelling languages and structured methods
Metamodel for Tracing Concerns across the Life Cycle
Several aspect-oriented approaches have been proposed to specify aspects at different phases in the software life cycle. Aspects can appear within a phase, be refined or mapped to other aspects in later phases, or even disappear.\ud
Tracing aspects is necessary to support understandability and maintainability of software systems. Although several approaches have been introduced to address traceability of aspects, two important limitations can be observed. First, tracing is not yet tackled for the entire life cycle. Second, the traceability model that is applied usually refers to elements of specific aspect languages, thereby limiting the reusability of the adopted traceability model.We propose the concern traceability metamodel (CTM) that enables traceability of concerns throughout the life cycle, and which is independent from the aspect languages that are used. CTM can be enhanced to provide additional properties for tracing, and be instantiated to define\ud
customized traceability models with respect to the required aspect languages. We have implemented CTM in the tool M-Trace, that uses XML-based representations of the models and XQuery queries to represent tracing information. CTM and M-Trace are illustrated for a Concurrent Versioning System to trace aspects from the requirements level to architecture design level and the implementation
A universe of processes and some of its guises
Our starting point is a particular `canvas' aimed to `draw' theories of
physics, which has symmetric monoidal categories as its mathematical backbone.
In this paper we consider the conceptual foundations for this canvas, and how
these can then be converted into mathematical structure. With very little
structural effort (i.e. in very abstract terms) and in a very short time span
the categorical quantum mechanics (CQM) research program has reproduced a
surprisingly large fragment of quantum theory. It also provides new insights
both in quantum foundations and in quantum information, and has even resulted
in automated reasoning software called `quantomatic' which exploits the
deductive power of CQM. In this paper we complement the available material by
not requiring prior knowledge of category theory, and by pointing at
connections to previous and current developments in the foundations of physics.
This research program is also in close synergy with developments elsewhere, for
example in representation theory, quantum algebra, knot theory, topological
quantum field theory and several other areas.Comment: Invited chapter in: "Deep Beauty: Understanding the Quantum World
through Mathematical Innovation", H. Halvorson, ed., Cambridge University
Press, forthcoming. (as usual, many pictures
Learning Invariant Visual Representations for Compositional Zero-Shot Learning
Compositional Zero-Shot Learning (CZSL) aims to recognize novel compositions
using knowledge learned from seen attribute-object compositions in the training
set. Previous works mainly project an image and a composition into a common
embedding space to measure their compatibility score. However, both attributes
and objects share the visual representations learned above, leading the model
to exploit spurious correlations and bias towards seen pairs. Instead, we
reconsider CZSL as an out-of-distribution generalization problem. If an object
is treated as a domain, we can learn object-invariant features to recognize the
attributes attached to any object reliably. Similarly, attribute-invariant
features can also be learned when recognizing the objects with attributes as
domains. Specifically, we propose an invariant feature learning framework to
align different domains at the representation and gradient levels to capture
the intrinsic characteristics associated with the tasks. Experiments on two
CZSL benchmarks demonstrate that the proposed method significantly outperforms
the previous state-of-the-art
Biextensions, bimonoidal functors, multilinear functor calculus, and categorical rings
We associate to a bimonoidal functor, i.e. a bifunctor which is monoidal in
each variable, a nonabelian version of a biextension. We show that such a
biextension satisfies additional triviality conditions which make it a bilinear
analog of the kind of spans known as butterflies and, conversely, these data
determine a bimonoidal functor. We extend this result to -variables, and
prove that, in a manner analogous to that of butterflies, these
multi-extensions can be composed. This is phrased in terms of a multilinear
functor calculus in a bicategory. As an application, we study a bimonoidal
category or stack, treating the multiplicative structure as a bimonoidal
functor with respect to the additive one. In the context of the multilinear
functor calculus, we view the bimonoidal structure as an instance of the
general notion of pseudo-monoid. We show that when the structure is ring-like,
i.e. the pseudo-monoid is a stack whose fibers are categorical rings, we can
recover the classification by the third Mac Lane cohomology of a ring with
values in a bimodule.Comment: Accepted version to appear in Theory and Applications of Categories;
61 Pages; the new Appendix E contains the full hypercohomology computation of
the characteristic class of a ring-like stac
PHORMA: Perfectly Hashable Order Restricted Multidimensional Arrays
In this paper we propose a simple and efficient data structure yielding a
perfect hashing of quite general arrays. The data structure is named phorma,
which is an acronym for perfectly hashable order restricted multidimensional
array.
Keywords: Perfect hash function, Digraph, Implicit enumeration,
Nijenhuis-Wilf combinatorial family.Comment: 12 pages, 4 figures, 2 tables. Revised version. Submitted to Discrete
Applied Mathematic
About the nature of Kansei information, from abstract to concrete
Designerâs expertise refers to the scientific fields of emotional design and kansei information. This paper aims to answer to a scientific major issue which is, how to formalize designerâs knowledge, rules, skills into kansei information systems. Kansei can be considered as a psycho-physiologic, perceptive, cognitive and affective process through a particular experience. Kansei oriented methods include various approaches which deal with semantics and emotions, and show the correlation with some design properties. Kansei words may include semantic, sensory, emotional descriptors, and also objects names and product attributes. Kansei levels of information can be seen on an axis going from abstract to concrete dimensions. Sociological value is the most abstract information positioned on this axis. Previous studies demonstrate the values the people aspire to drive their emotional reactions in front of particular semantics. This means that the value dimension should be considered in kansei studies. Through a chain of value-function-product attributes it is possible to enrich design generation and design evaluation processes. This paper describes some knowledge structures and formalisms we established according to this chain, which can be further used for implementing computer aided design tools dedicated to early design. These structures open to new formalisms which enable to integrate design information in a non-hierarchical way. The foreseen algorithmic implementation may be based on the association of ontologies and bag-of-words.AN
- âŠ