Search results for "Programming Languages"
showing 10 items of 138 documents
Locality, QED and classical electrodynamics
1998
We report on some conceptual changes in our present understanding of Quantum Field Theory and muse about possible consequences for the understanding of $v>c$ signals.
The electron-nucleus collider project
1997
Abstract In the context of the discussion about the future physics program of the GSI laboratory the physics potential of an electron-nucleus collider at about s = 1000GeV2 is being explored.
Entanglement correlations, Bell inequalities, and the concurrence
2005
Probabilities of measurement outcomes of two-particle entangled states give a physically transparent interpretation of the concurrence and of the I-concurrence as entanglement measures. The (I)-concurrence can thus be measured experimentally. The tight connection between these measures and Bell inequalities is highlighted.
Partitioning of on-demand electron pairs
2014
The on-demand generation and separation of entangled photon pairs are key components of quantum information processing in quantum optics. In an electronic analogue, the decomposition of electron pairs represents an essential building block for using the quantum state of ballistic electrons in electron quantum optics. The scattering of electrons has been used to probe the particle statistics of stochastic sources in Hanbury Brown and Twiss experiments and the recent advent of on-demand sources further offers the possibility to achieve indistinguishability between multiple sources in Hong-Ou-Mandel experiments. Cooper pairs impinging stochastically at a mesoscopic beamsplitter have been succe…
Spin states, vibrations and spin relaxation in molecular nanomagnets and spin qubits: a critical perspective
2018
Spin–vibration coupling has been proven to be crucial for spin dynamics; theoretical studies are now addressing this experimental challenge.
Automated astrographic plates measuring process
1990
The astrographic plates measuring process applied at the Astronomical Observatory of Valencia has been described.
On the Size Complexity of Deterministic Frequency Automata
2013
Austinat, Diekert, Hertrampf, and Petersen [2] proved that every language L that is (m,n)-recognizable by a deterministic frequency automaton such that m > n/2 can be recognized by a deterministic finite automaton as well. First, the size of deterministic frequency automata and of deterministic finite automata recognizing the same language is compared. Then approximations of a language are considered, where a language L′ is called an approximation of a language L if L′ differs from L in only a finite number of strings. We prove that if a deterministic frequency automaton has k states and (m,n)-recognizes a language L, where m > n/2, then there is a language L′ approximating L such that L′ c…
Biznesa procesu modelēšana, izmantojot metamodelēšanas paņēmienus : kopsavilkums
2007
Darba tēma ir saistīta ar biznesa procesu vadības sistēmu izstrādi. Šajā darbā biznesa procesu modelēšanas problēmas ir risinātas, izmantojot metamodelēšanas paņēmienus. Metamodelēšana ļauj dažādus biznesa modelēšanas aspektus aplūkot vienotā un vispārīgā formā, tai pat laikā nezaudējot precīzu jēdzienu nozīmi. Galvenie pētījumu rezultāti ir sekojoši: Izstrādāts vienots biznesa procesu un to apkārtnes metamodelis, kas parāda biznesa modelēšanas jēdzienus un to saistību. Izstrādāta biznesa modeļu jēdzienu kartēšanas metode jēdzienu kartēšanai no viena domēna uz vairākām modelēšanas valodām. Izstrādāta precīza Unified Modeling Language Aktivitāšu diagrammas (UML AD) izpildes semantika, izmant…
The long and winding road: Accidents and tinkering in software standardization
2021
Software is based on universal principles but not its development. Relating software to hardware is never automatic or easy. Attempts to optimize software production and drastically reduce their costs (like in hardware) have been very restricted. Instead, highly-skilled and experienced individuals are ultimately responsible for project success. The long and convoluted path towards useful and reliable software is often plagued by idiosyncratic accidents and emergent complexity. It was expected that software standardisation would remove these sources of unwanted diversity by aiming to controllable development processes, universal programming languages, and toolkits of reusable software compon…
Ulam Stability for the Composition of Operators
2020
Working in the setting of Banach spaces, we give a simpler proof of a result concerning the Ulam stability of the composition of operators. Several applications are provided. Then, we give an example of a discrete semigroup with Ulam unstable members and an example of Ulam stable operators on a Banach space, such that their sum is not Ulam stable. Another example is concerned with a C 0 -semigroup ( T t ) t &ge