279 research outputs found
Electronic spectroscopy of carbon chain radicals using cw cavity ring down in conjunction with mass detection
No full textThe electronic absorption spectrum of the 2A'' − X 2A'' origin band of the
nonlinear carbon chain radical C6H4
+ was rotationally resolved by cw-CRD
spectroscopy [41]. It was analysed using a least-squares method and the rotational
constants of the ground and excited states were determined accurately. The 581 nm
band observed under the same discharge conditions is assigned to the same electronic
transition of C6H4
+ but involving the excitation of the ν12 vibrational mode in the
upper state based on comparison with ab initio results. The presented data provide a
basis for future observations of the C6H4
+ radical in both millimeter and infrared
regions.
A linear time-of-flight mass spectrometer was constructed to provide on-line
monitoring of the plasma discharge with a mass resolution of 1 amu at a range up to
120 amu. The results from the acetylene/helium plasma discharge are in good
agreement with those obtained using the reflectron TOF mass spectrometer and a
similar ion source [42]. To improve the experimental set-up, the following
modifications can be made:
• Transferring the signal from the oscilloscope directly to a PC via a
GPIB card will increase the speed of data processing;
• Computer control of the voltage applied will make the spectrometer
easier to operate;
• Using a metal grid at ground potential in front of MCP detector will
increase the flight time of ions improving the mass resolution;
• Installing a focusing lens will increase the number of ions arriving at
the detector, and therefore increase the signal on the oscilloscope
Faster exploration of some temporal graphs
No full textFunding Adamson, Duncan: Funded by the Leverhulme trust. Gusev, Vladimir V.: funded by the Leverhulme trust. Malyshev, Dmitriy: The work of Dmitriy Malyshev was conducted within the framework of the Basic Research Program at the National Research University Higher School of Economics (HSE).A temporal graph G = (G1, G2,..., GT ) is a graph represented by a sequence of T graphs over a common set of vertices, such that at the ith time step only the edge set Ei is active. The temporal graph exploration problem asks for a shortest temporal walk on some temporal graph visiting every vertex. We show that temporal graphs with n vertices can be explored in O(kn1.5 log n) days if the underlying graph has treewidth k and in O(n1.75 log n) days if the underlying graph is planar. Furthermore, we show that any temporal graph whose underlying graph is a cycle with k chords can be explored in at most 6kn days. Finally, we demonstrate that there are temporal realisations of sub cubic planar graphs that cannot be explored faster than in Ω(n log n) days. All these improve best known results in the literature
Faster Exploration of Some Temporal Graphs
No full textA temporal graph G = (G_1, G_2, ..., G_T) is a graph represented by a sequence of T graphs over a common set of vertices, such that at the i-th time step only the edge set E_i is active. The temporal graph exploration problem asks for a shortest temporal walk on some temporal graph visiting every vertex. We show that temporal graphs with n vertices can be explored in O(k n^{1.5} log n) days if the underlying graph has treewidth k and in O(n^{1.75} log n) days if the underlying graph is planar. Furthermore, we show that any temporal graph whose underlying graph is a cycle with k chords can be explored in at most 6kn days. Finally, we demonstrate that there are temporal realisations of sub cubic planar graphs that cannot be explored faster than in Ω(n log n) days. All these improve best known results in the literature
A second greek account of the revolution of a) Pseudo-Dmitriy (Russia, 1605-1606) : Codex Iviron 710, ff. 100rv
No full textThe author publishes, with commentary and english translation, the text of the Διήγησις περ'ι τής έν ’Ρωσία έπαναστάσεως τοϋ ψενδο - Δημητρίον (An account of the revolution of pseudo-Dmitriy, untitled), Codex Iviron 710, ff. 100rv, which recounts certain events relating to the activity ofthe first pseudoDmitriy (1605-1606)
OCCASIONAL ONOMASTICON OF A CYCLE OF NOVELS ABOUT TANYA GROTTER BY DMITRIY EMETS AS A LINGUOCULTURAL PHENOMENON
No full textThis article discusses the specificity of occasional onomasticon in the cycle of novels
by Dmitriy Emets (b. 1974) featuring Tanya Grotter, which is an outstanding example
of fantasy literature, playing an important role in the modern cultural space, and
targeted mainly at children and teenagers. It has been established that while creating
the onomastic space of the cycle the author draws parallels with J. Rowling’s novels
about Harry Potter and forms onyms – occasionalisms based on the precedent names
(folk, mythological, religious, literary, and historical), foreign language vocabulary,
phraseology, etc. The desire to comprehend the author’s intention and to understand the
characteristics presented in onyms not only motivates readers to expand their horizon,
but also engages them in cross-cultural communication
Complexity classification of the edge coloring problem for a family of graph classes
No full textAbstractA class of graphs is called monotone if it is closed under deletion of vertices and edges. Any such class may be defined in terms of forbidden subgraphs. The chromatic index of a graph is the smallest number of colors required for its edge-coloring such that any two adjacent edges have different colors. We obtain a complete classification of the complexity of the chromatic index problem for all monotone classes defined in terms of forbidden subgraphs having at most 6 edges or at most 7 vertices.</jats:p
On the number of maximal independent sets in complete <i>q</i>-ary trees
No full textAbstract
The paper is concerned with the asymptotic behaviour of the number mi(T
q,n
) of maximal independent sets in a complete q-ary tree of height n. For some constants α
2 and β
2 the asymptotic formula mi(T
2,n
)∼ α
2⋅ (β
2)2
n
is shown to hold as n → ∞. It is also proved that
mi
(
T
q
,
3
k
)
∼
α
q
(
1
)
⋅
(
β
q
)
q
3
k
,
mi
(
T
q
,
3
k
+
1
)
∼
α
q
(
2
)
⋅
(
β
q
)
q
3
k
+
1
,
mi
(
T
q
,
3
k
+
2
)
∼
α
q
(
3
)
⋅
(
β
q
)
q
3
k
+
2
as k→ ∞ for any sufficiently large q, some three pairwise distinct constants
α
q
(
1
)
,
α
q
(
2
)
,
α
q
(
3
)
and a constant bq
.</jats:p
Book of Abstracts of the Minisymposium on Publicly Available Geometric/Topological Software
No full text
- …
