2.2k citations
- Centre National de la Recherche ScientifiqueFR12 papers
- Laboratoire Aimé CottonFR7 papers
- University of California, RiversideUS6 papers
- Weizmann Institute of ScienceIL6 papers
- Ioffe InstituteRU5 papers
- University College LondonGB5 papers
- Academy of AthensGR4 papers
- Georgia State UniversityUS4 papers
- Imperial College LondonGB4 papers
- Institut des Hautes Études ScientifiquesFR4 papers
- National Oceanic and Atmospheric AdministrationUS4 papers
- Northumbria UniversityGB4 papers
6 papers · 1 filter
Interpolation between phase space quantities with bifractional displacement operators
S. Agyo, C. Lei, A. Vourdas
Bifractional displacement operators, are introduced by performing two fractional Fourier transforms on displacement operators. They are shown to be special cases of elements of the…
Quantum probabilities as Dempster-Shafer probabilities in the lattice of subspaces
A. Vourdas
The orthocomplemented modular lattice of subspaces L[H(d)], of a quantum system with d- dimensional Hilbert space H(d), is considered. A generalized additivity relation which holds…
Lower and upper probabilities in the distributive lattice of subsystems
A. Vourdas
The set of subsystems of a finite quantum system (with variables in Z(n)) together with logical connectives, is a distributive lattice. With regard to this lattice, the (where P(m)…
Developing the UML as a Formal Modelling Notation
Andy Evans, Robert France, Kevin Lano +1
The Unified Modeling Language (UML) is rapidly emerging as a de-facto standard for modelling OO systems. Given this role, it is imperative that the UML have a well- defined, fully…
The UML as a Formal Modeling Notation
Andy Evans, Robert France, Kevin Lano +1
The Unified Modeling Language (UML) is rapidly emerging as a de-facto standard for modelling OO systems. Given this role, it is imperative that the UML needs a well-defined, fully…
Effects of Hard Real-Time Constraints in Implementing the Myopic Scheduling Algorithm
Kazi Sakib, M. S. Hasan, M. A. Hossain
Myopic is a hard real-time process scheduling algorithm that selects a suitable process based on a heuristic function from a subset (Window)of all ready processes instead of choosi…