Search results for " formal"
showing 10 items of 273 documents
Rotational Raman spectroscopy of ethylene using a femtosecond time-resolved pump-probe technique.
2005
154309; Femtosecond Raman-induced polarization spectroscopy (RIPS) was conducted at low pressure (250 mb at 295 K and 400 mb at 373 K) in ethylene. The temporal signal, resulting from the beating between pure rotational coherences, was measured with a heterodyne detection. The temporal traces were converted to the frequency domain using a Fourier transformation and then analyzed thanks to the D2hTDS software (http://www.u-bourgogne.fr/LPUB/shTDS.html) dedicated to X2Y4 molecules with D2h symmetry. The effective Hamiltonian was expanded up to order 2, allowing the determination of five parameters with an rms of 0.017 cm(-1). Special care was taken in the precise modeling of intensities, taki…
Prasību vadīta metode datu noliktavas modeļa izveidei
2016
Maģistra darbā „Prasību vadīta metode datu noliktavas modeļa izveidei” ir apskatīta konkrēta datu noliktavas prasību vadīta metode. Šī metode paredz datu noliktavas prasības formalizēt. Autors ir aplūkojis pastāvošos paņēmienus prasību formalizēšanā un līdzīgas datu noliktavas izstrādes metodes. Autors izvērtējis iespēju maģistra darbā aplūkoto datu noliktavas izstrādes metodi pilnveidot, piedāvājot rekomendācijas. Maģistra darbam pastāv praktiskā daļa, kur autors ir izstrādājis rīku, kas nodrošina praktiski lietot maģistra darbā aplūkoto metodi.
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.
Formal Variation and Language Change in Catalan Quantifiers : the Role of Pragmatics
2020
This article studies the formal variation of the masculine singular forms of the quantifiers u/un 'one', algú/algun 'someone, some', ningú/ningun 'no-one, anyone, not one, any, none' and cada u/cada un 'everyone, each one' in contemporary Catalan. The standard uses of these forms are contrasted with dialectal uses, obtained from a thorough search in oral and written corpora. In addition, they are compared with the uses in the other Romance languages and with their historical evolution in Catalan. The whole set of data, and especially the dialectal information on the Valencian area, allow us to explain the various factors that have interacted in the variation and formal change of these quant…
Circolazione e sviluppo di un modello metodologico. La critica testuale delle fonti giuridiche romane fra Otto Gradenwitz e Salvatore Riccobono
2018
La ricerca delle interpolazioni, cominciata con la Scula culta, viene ripresa in Germania alla fine del XIX secolo. Fra quanti misero a punto un metodo storico-critico per lo studio delle fonti giuridiche romane va menzionato anche Gradenwitz, che – insieme ad altri studiosi tedeschi – sarebbe stato uno dei maestri di Riccobono. La prima produzione scientifica di Riccobono, che si riconosce nel nuovo indirizzo storico-critico affermatosi in Germania, si avvale dei metodi appresi dai maestri tedeschi. Lungo questo solco, tuttavia, comincia l’elaborazione di un metodo più raffinato, che distingue fra interpolazioni formali e interpolazioni sostanziali e recupera gradualmente altri strumenti d…
Geometrical Transformations In The Fraunhofer Plane
1987
A virtual display of the Fraunhofer diffraction pattern is generated solely by illuminating the object with a point source. If this pattern is imaged with an anamorphic system, several linear geometrical transformations can be achieved. Furthermore, a nonsymmetrical Fourier transformer with a variable degree of anamorphic magnification on the Fraunhofer pattern can be implemented.
Forbidden words in symbolic dynamics
2000
AbstractWe introduce an equivalence relation≃between functions from N to N. By describing a symbolic dynamical system in terms of forbidden words, we prove that the≃-equivalence class of the function that counts the minimal forbidden words of a system is a topological invariant of the system. We show that the new invariant is independent from previous ones, but it is not characteristic. In the case of sofic systems, we prove that the≃-equivalence of the corresponding functions is a decidable question. As a more special application, we show, by using the new invariant, that two systems associated to Sturmian words having “different slope” are not conjugate.
Domains of accretive operators in Banach spaces
2016
LetD(A)be the domain of anm-accretive operatorAon a Banach spaceE. We provide sufficient conditions for the closure ofD(A)to be convex and forD(A)to coincide withEitself. Several related results and pertinent examples are also included.
Combinatorial aspects of L-convex polyominoes
2007
We consider the class of L-convex polyominoes, i.e. those polyominoes in which any two cells can be connected with an ''L'' shaped path in one of its four cyclic orientations. The paper proves bijectively that the number f"n of L-convex polyominoes with perimeter 2(n+2) satisfies the linear recurrence relation f"n"+"2=4f"n"+"1-2f"n, by first establishing a recurrence of the same form for the cardinality of the ''2-compositions'' of a natural number n, a simple generalization of the ordinary compositions of n. Then, such 2-compositions are studied and bijectively related to certain words of a regular language over four letters which is in turn bijectively related to L-convex polyominoes. In …
On the regularity of circular splicing languages : A survey and new developments
2009
Circular splicing has been introduced to model a specific recombinant behaviour of circular DNA, continuing the investigation initiated with linear splicing. In this paper we focus on the relationship between regular circular languages and languages generated by finite circular splicing systems. We survey the known results towards a characterization of the intersection between these two classes and provide new contributions on the open problem of finding this characterization. First, we exhibit a non-regular circular language generated by a circular simple system thus disproving a known result in this area. Then we give new results related to a restrictive class of circular splicing systems…