Search results for "Diagram"
showing 10 items of 795 documents
On a generalization of Goguen's category Set(L)
2007
The paper considers a category which generalizes Goguen's category Set(L) of L-fuzzy sets with a fixed basis L. We show the necessary and sufficient conditions for the generalized category to be a quasitopos and consider additional inner structure supplied by the latter property.
Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams
2017
We consider Quantum OBDD model. It is restricted version of read-once Quantum Branching Programs, with respect to “width” complexity. It is known that maximal complexity gap between deterministic and quantum model is exponential. But there are few examples of such functions. We present method (called “reordering”), which allows to build Boolean function g from Boolean Function f, such that if for f we have gap between quantum and deterministic OBDD complexity for natural order of variables, then we have almost the same gap for function g, but for any order. Using it we construct the total function REQ which deterministic OBDD complexity is \(2^{\varOmega (n/log n)}\) and present quantum OBD…
Some remarks on the category SET(L), part III
2004
This paper considers the category SET(L) of L-subsets of sets with a fixed basis L and is a continuation of our previous investigation of this category. Here we study its general properties (e.g., we derive that the category is a topological construct) as well as some of its special objects and morphisms.
Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs
2014
In the paper we investigate a model for computing of Boolean functions – Ordered Binary Decision Diagrams (OBDDs), which is a restricted version of Branching Programs. We present several results on the comparative complexity for several variants of OBDD models. We present some results on the comparative complexity of classical and quantum OBDDs. We consider a partial function depending on a parameter k such that for any k > 0 this function is computed by an exact quantum OBDD of width 2, but any classical OBDD (deterministic or stable bounded-error probabilistic) needs width 2 k + 1. We consider quantum and classical nondeterminism. We show that quantum nondeterminism can be more efficient …
Asymptotics for the Amitsur's Capelli - Type Polynomials and Verbally Prime PI-Algebras
2006
We consider associativePI-algebras over a field of characteristic zero. The main goal of the paper is to prove that the codimensions of a verbally prime algebra [11] are asymptotically equal to the codimensions of theT-ideal generated by some Amitsur's Capelli-type polynomialsEM,L* [1]. We recall that two sequencesan,bnare asymptotically equal, and we writean≃bn,if and only if limn→∞(an/bn)=1.In this paper we prove that\(c_n \left( {M_k \left( G \right)} \right) \simeq c_n \left( {E_{k^2 ,k^2 }^ * } \right) and c_n \left( {M_{k,l} \left( G \right)} \right) \simeq c_n \left( {E_{k^2 + l^2 ,2kl}^ * } \right) \)% MathType!End!2!1!, whereG is the Grassmann algebra. These results extend to all v…
On simple families of functions and their Legendrian mappings
2004
We study germs of $n$-parameter families of functions, that is, function-germs of the type $f : (\mathbb{R}^n \times \mathbb{R}, 0) \to (\mathbb{R}, 0)$ defined on the total space of the trivial bundle $ \mathbb{R}^n \times \mathbb{R} \to \mathbb{R}^n $. There is a natural notion of $V$-equivalence for such function-germs. We introduce the Young diagram of $n$-parameter families satisfying a non-degeneracy condition. We classify all such simple $n$-parameter families and give their versal deformations. This result has direct applications to contact and projective geometry.
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.
Tilted phases of fatty acid monolayers
1995
X‐ray diffraction data from water‐supported monolayers of fatty acids with chain lengths from 19 to 22 is presented. The structures of the tilted mesophases L2’, L2, and Ov are characterized in detail. The contributions to the unit cell distortion from the tilt and the ordering of the backbone planes of the molecules are separated. It is shown that at the swiveling transition L2’–L2, not only the tilt azimuth but also the packing of the backbone planes change discontinuously. We demonstrate that the tilting transition LS–L2 is accompanied by the ordering of the backbone planes and may be discontinuous. Evidence is presented for a herringbone ordering transition within the L2 region. The dis…
Concrete syntax-based find for graphical DSLs
2020
There are services available in the most software tools we have got used to like, copy, paste, cut, find, and replace. However, the state of the art is not so good with tools of graphical languages. Even many commercial modelling tools have limited support of the find feature. We propose to add find as a service of graphical DSL tool development frameworks. This way find is available in any DSL built using the DSL tool development framework. The concrete syntax-based find has been implemented as a service of the DSL tool development framework ajoo. Two graph-based languages: UML Activity diagrams and Deterministic Finite Automata (DFA) transition diagrams are used to demonstrate usage of th…
Up and Down States During Slow Oscillations in Slow-Wave Sleep and Different Levels of Anesthesia
2021
Slow oscillations are a pattern of synchronized network activity generated by the cerebral cortex. They consist of Up and Down states, which are periods of activity interspersed with periods of silence, respectively. However, even when this is a unique dynamic regime of transitions between Up and Down states, this pattern is not constant: there is a range of oscillatory frequencies (0.1–4 Hz), and the duration of Up vs. Down states during the cycles is variable. This opens many questions. Is there a constant relationship between the duration of Up and Down states? How much do they vary across conditions and oscillatory frequencies? Are there different sub regimes within the slow oscillation…