0000000000199150

AUTHOR

Andreas Winter

showing 9 related works from this author

On marrying ontological and metamodeling technical spaces

2007

In software engineering, the use of models and metamodeling approaches (e.g., MDA with MOF/UML) for purposes such as software design or software validation is an established practice. Ontologies constitute domain models formalized using expressive logic languages for class definitions and rules. Hence, when seen from an abstract point of view, the two paradigms and their various technological spaces seem closely related. However, in the state-of-the-art research and practice the two technologies are just beginning to converge and the relationship between the two is still under exploration. In this paper, we give an outline of current ontology technologies, such as the Semantic Web standards…

business.industryComputer sciencecomputer.internet_protocolWeb Ontology LanguageOntology (information science)OWL-SMetamodelingUnified Modeling LanguageSystems engineeringDomain engineeringIDEF5Model-driven architectureSoftware engineeringbusinesscomputercomputer.programming_language
researchProduct

Applying the ReMiP to Web Site Migration

2007

Web sites serve to publish information, both locally in intranets as well as on a global scale. Like all software systems, they have to cope with changing requirements and evolving technologies. The reference process model for software migration, ReMiP, provides a generic process model for software migration in general. The paper introduces ReMiP and summarises the application of a tailored ReMiP towards migrating a static HTML-based Web site to a content management system.

Web standardsmedicine.medical_specialtyWeb developmentbusiness.industryComputer sciencecomputer.software_genreWorld Wide WebWeb pageWeb designmedicineWeb applicationWeb mappingWeb servicebusinesscomputerWeb modeling2007 9th IEEE International Workshop on Web Site Evolution
researchProduct

Quantum Finite State Transducers

2001

We introduce quantum finite state transducers (qfst), and study the class of relations which they compute. It turns out that they share many features with probabilistic finite state transducers, especially regarding undecidability of emptiness (at least for low probability of success). However, like their 'little brothers', the quantum finite automata, the power of qfst is incomparable to that of their probabilistic counterpart. This we show by discussing a number of characteristic examples.

Discrete mathematicsPure mathematicsFinite-state machineDeterministic finite automatonComputer scienceComputer Science::Logic in Computer ScienceProbabilistic logicQuantum finite automataNondeterministic finite automatonState diagramQuantumComputer Science::Formal Languages and Automata TheoryQuantum computer
researchProduct

4th International Workshop on Language Engineering (ATEM 2007)

2008

Following the great success of previous editions, ATEM2007 is the 4thedition of the ATEM workshop series. The first two editions were held with WCRE in 2003 and 2004, while the 3rdone was held with MoDELS 2006. ATEM has always been focused on engineering of language descriptions. In order to cover as many aspects of language descriptions important for greater success and adoption of model-driven engineering, ATEM has been evolving so as its scope: The first edition was about metamodelsand schemas. The second about was metamodels, schemasand grammars. The third edition was about metamodels, schemas, grammarsand ontologies.

Rule-based machine translationScope (project management)Computer sciencebusiness.industryLanguage engineeringSoftware engineeringbusinessOn LanguageFull paperCode clone
researchProduct

Model Driven Specification of Ontology Translations

2008

The alignment of different ontologies requires the specification, representation and execution of translation rules. The rules need to integrate translations at the lexical, the syntactic and the semantic layer requiring semantic reasoning as well as low-level specification of ad-hoc conversions of data. Existing formalisms for representing translation rules cannot cover the representation needs of these three layers in one model. We propose a metamodel-based representation of ontology alignments that integrate semantic translations using description logics and lower level translation specifications into one model of representation for ontology alignments.

Ontology Inference Layerbusiness.industryProgramming languageComputer scienceOntology-based data integrationProcess ontologySuggested Upper Merged Ontology02 engineering and technologyOntology (information science)computer.software_genreDescription logic020204 information systems0202 electrical engineering electronic engineering information engineeringUpper ontology020201 artificial intelligence & image processingArtificial intelligencebusinesscomputerOntology alignmentNatural language processingLecture Notes in Computer Science Conceptual Modeling - ER 2008
researchProduct

Activation of indistinguishability-based quantum coherence for enhanced metrological applications with particle statistics imprint

2022

Quantum coherence, an essential feature of quantum mechanics allowing quantum superposition of states, is a resource for quantum information processing. Coherence emerges in a fundamentally different way for nonidentical and identical particles. For the latter, a unique contribution exists linked to indistinguishability that cannot occur for nonidentical particles. Here, we experimentally demonstrate this additional contribution to quantum coherence with an optical setup, showing that its amount directly depends on the degree of indistinguishability, and exploiting it in a quantum phase discrimination protocol. Furthermore, the designed setup allows for simulating fermionic particles with p…

Multidisciplinaryidentical particles quantum coherence quantum metrologySettore FIS/03 - Fisica Della Materia
researchProduct

Editorial: Software language engineering

2008

Software languages play an important role in software development. Software languages are the artificial languages that are used to describe software systems at various abstraction levels. They are applied to describe requirements and designs for software, definitions of software architectures, and implementations of software systems. A huge variety of different technological spaces exist to describe languages: programming languages, software modeling languages, data modeling languages, domain-specific languages, ontology language, and others.

Social software engineeringbusiness.industryComputer scienceProgramming languageSoftware developmentSecond-generation programming languageOntology languagecomputer.software_genreComputer Graphics and Computer-Aided DesignSoftware frameworkComponent-based software engineeringSoftware constructionSoftware systembusinessSoftware engineeringcomputerIET Software
researchProduct

Indistinguishability-enabled coherence for quantum metrology

2019

Quantum coherence plays a fundamental and operational role in different areas of physics. A resource theory has been developed to characterize the coherence of distinguishable particles systems. Here we show that indistinguishability of identical particles is a source of coherence, even when they are independently prepared. In particular, under spatially local operations, states that are incoherent for distinguishable particles, can be coherent for indistinguishable particles under the same procedure. We present a phase discrimination protocol, in which we demonstrate the operational advantage of using two indistinguishable particles rather than distinguishable ones. The coherence due to th…

PhysicsQuantum PhysicsParticle statisticsQuantum informationQuantum identical particleFOS: Physical sciencesQuantum metrology01 natural sciencesSettore FIS/03 - Fisica Della Materia010305 fluids & plasmasQuantum coherenceProbability of error0103 physical sciencesQuantum metrologyStatistical physics010306 general physicsQuantum Physics (quant-ph)Phase discriminationQuantumCoherence (physics)Identical particles
researchProduct

Nonmalleable encryption of quantum information

2008

We introduce the notion of "non-malleability" of a quantum state encryption scheme (in dimension d): in addition to the requirement that an adversary cannot learn information about the state, here we demand that no controlled modification of the encrypted state can be effected. We show that such a scheme is equivalent to a "unitary 2-design" [Dankert et al.], as opposed to normal encryption which is a unitary 1-design. Our other main results include a new proof of the lower bound of (d^2-1)^2+1 on the number of unitaries in a 2-design [Gross et al.], which lends itself to a generalization to approximate 2-design. Furthermore, while in prime power dimension there is a unitary 2-design with =…

Discrete mathematicsQuantum Physicsbusiness.industryDimension (graph theory)FOS: Physical sciencesStatistical and Nonlinear PhysicsState (functional analysis)Encryption01 natural sciencesUnitary stateUpper and lower bounds010305 fluids & plasmasQuantum state0103 physical sciencesQuantum informationQuantum Physics (quant-ph)010306 general physicsbusinessPrime powerMathematical PhysicsComputer Science::Cryptography and SecurityMathematicsJournal of Mathematical Physics
researchProduct