Search results for "Computer Science::Programming Languages"
showing 10 items of 69 documents
Towards Diagrammatic Patterns
2008
This article presents the idea that the graphical representation (concrete syntax) of a visual language can be specified based on some pre-defined diagrammatic patterns. A diagram from the Specification and Description Language (SDL) is used as illustration.
Cloud droplet formation at the base of tropical convective clouds: closure between modeling and measurement results of ACRIDICON–CHUVA
2021
Aerosol–cloud interactions contribute to the large uncertainties in current estimates of climate forcing. We investigated the effect of aerosol particles on cloud droplet formation by model calculations and aircraft measurements over the Amazon and over the western tropical Atlantic during the ACRIDICON–CHUVA campaign in September 2014. On the HALO (High Altitude Long Range Research) research aircraft, cloud droplet number concentrations (Nd) were measured near the base of clean and polluted growing convective cumuli using a cloud combination probe (CCP) and a cloud and aerosol spectrometer (CAS-DPOL). An adiabatic parcel model was used to perform cloud droplet number closure studies for fl…
Onset of Convection in an Inclined Anisotropic Porous Layer with Internal Heat Generation
2019
The onset of convection in an inclined porous layer which is heated internally by a uniform distribution of heat sources is considered. We investigate the combined effects of inclination, anisotropy and internal heat generation on the linear instability of the basic parallel flow. When the Rayleigh number is sufficiently large, instability occurs and a convective motion is set up. It turns out that the preferred motion at convection onset depends quite strongly on the anisotropy ratio, &xi
Determination of Zircaloy -4 Radiocristallographic Elastic Constants from Room Temperature to 300°C
2000
A new experimental apparatus, allowing the determination of radiocristallographic elastic constants (REC) as a function of the temperature is presented. The material studied the zirconium alloy Zircaloy-4, showing low elastic anisotropy, an isotropic treatment of the problem is possible. As a consequence, the classical sin 2 ψ method is used to determine the REC from room temperature to 300°C.
Unambiguous recognizable two-dimensional languages
2006
We consider the family UREC of unambiguous recognizable two-dimensional languages. We prove that there are recognizable languages that are inherently ambiguous, that is UREC family is a proper subclass of REC family. The result is obtained by showing a necessary condition for unambiguous recognizable languages. Further UREC family coincides with the class of picture languages defined by unambiguous 2OTA and it strictly contains its deterministic counterpart. Some closure and non-closure properties of UREC are presented. Finally we show that it is undecidable whether a given tiling system is unambiguous.
ON THE STAR HEIGHT OF RATIONAL LANGUAGES
1994
Two problems concerning the star height of a rational language are investigated: the star height one problem and the relationships between the unambiguity of an expression and its star height. For this purpose we consider the class of factorial, transitive and rational (FTR) languages. From the algebraic point of view a FTR language is the set of factors of a rational submonoid M. Two subclasses of FTR languages are introduced: renewal languages, corresponding to the case of M finitely generated, and unambiguous renewal languages, corresponding to the case of M finitely generated and free. We prove that a FTR language has star height one if and only if it is renewal. This gives a simple de…
Quantum Finite Automata and Logics
2006
The connection between measure once quantum finite automata (MO-QFA) and logic is studied in this paper. The language class recognized by MO-QFA is compared to languages described by the first order logics and modular logics. And the equivalence between languages accepted by MO-QFA and languages described by formulas using Lindstrom quantifier is shown.
On the Class of Languages Recognizable by 1-Way Quantum Finite Automata
2007
It is an open problem to characterize the class of languages recognized by quantum finite automata (QFA). We examine some necessary and some sufficient conditions for a (regular) language to be recognizable by a QFA. For a subclass of regular languages we get a condition which is necessary and sufficient. Also, we prove that the class of languages recognizable by a QFA is not closed under union or any other binary Boolean operation where both arguments are significant.
Probabilities to Accept Languages by Quantum Finite Automata
1999
We construct a hierarchy of regular languages such that the current language in the hierarchy can be accepted by 1-way quantum finite automata with a probability smaller than the corresponding probability for the preceding language in the hierarchy. These probabilities converge to 1/2.
"Table 40" of "Tuning and test of fragmentation models based on identified particles and precision event shape data."
1996
Compilation of multiplicities of baryons from current LEP I data.