Search results for "rete"

Lambda substitution algebras

1993

In the paper an algebraic metatheory of type-free λ-calculus is developed. Our version is based on lambda substitution algebras (λSAs), which are just SAs introduced by Feldman (for algebraizing equational logic) enriched with a countable family of unary operations of λ-abstraction and a binary operation of application. Two representation theorems, syntactical and semantic, are proved, what directly provides completeness theorems.

On many-sorted algebraic closure operators

2004

A theorem of Birkhoff-Frink asserts that every algebraic closure operator on an ordinary set arises, from some algebraic structure on the set, as the corresponding generated subalgebra operator. However, for many-sorted sets, i.e., indexed families of sets, such a theorem is not longer true without qualification. We characterize the corresponding many-sorted closure operators as precisely the uniform algebraic operators. (© 2004 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)

Asymptotically good codes from generalized algebraic-geometry codes

2005

We consider generalized algebraic-geometry codes, based on places of the same degree of a fixed algebraic function field over a finite field. In this note, using a method similar to the Justesen's one, we construct a family of such codes which is asymptotically good.

ON AUTOMORPHISMS OF GENERALIZED ALGEBRAIC-GEOMETRY CODES.

2007

Abstract We consider a class of generalized algebraic-geometry codes based on places of the same degree of a fixed algebraic function field over a finite field F / F q . We study automorphisms of such codes which are associated with automorphisms of F / F q .

Theorems of ascoli type involving measures of noncompactness

1981

Dynamic 2- and 3-connectivity on planar graphs

1992

We study the problem of maintaining the 2-edge-, 2-vertex-, and 3-edge-connected components of a dynamic planar graph subject to edge deletions. The 2-edge-connected components can be maintained in a total of O(n log n) time under any sequence of at most O(n) deletions. This gives O(log n) amortized time per deletion. The 2-vertex- and 3-edge-connected components can be maintained in a total of O(n log2n) time. This gives O(log2n) amortized time per deletion. The space required by all our data structures is O(n).

The Raven's Coloured Progressive Matrices in Healthy Children: A Qualitative Approach

2020

Studies on the structure of intelligence refer to two main theoretical models: the first one considers intelligence as a unitary construct, the second one assumes the involvement of a plurality of factors. Studies using Raven’s Coloured Progressive Matrices (RCPM) tasks have often highlighted the involvement of different cognitive abilities and brain structures, but in the clinical setting, RCPM measurement continues to be used as a single score. The current study aimed to analyse the RCPM performance following qualitative clustering, in order to provide an interpretation of the intelligence assessment through a factorial criterion. The RCPM have been administered to a large group of typica…

Optimisation of gradient elution with serially-coupled columns. Part I: single linear gradients.

2014

A mixture of compounds often cannot be resolved with a single chromatographic column, but the analysis can be successful using columns of different nature, serially combined through zero-dead volume junctions. In previous work (JCA 1281 (2013) 94), we developed an isocratic approach that optimised simultaneously the mobile phase composition, stationary phase nature and column length. In this work, we take the challenge of implementing optimal linear gradients for serial columns to decrease the analysis time for compounds covering a wide polarity range. For this purpose, five ACE columns of different selectivity (three C18 columns of different characteristics, a cyano and a phenyl column) we…

Wide-range screening of banned veterinary drugs in urine by ultra high liquid chromatography coupled to high-resolution mass spectrometry

2012

In this work, an ultra high performance liquid chromatography-high resolution mass spectrometry (UHPLC-HRMS) methodology is proposed for the multi-class multi-residue screening of banned and unauthorized veterinary drugs in bovine urine, using an Orbitrap Exactive™ analyzer working at a resolving power of 50,000 FWHM in full scan, both in positive and negative mode. The method currently covers 87 analytes belonging to different families such as steroid hormones, β-agonists, resorcylic acid lactones (RAL), stilbens, tranquillizers, nitroimidazoles, corticosteroids, NSAIDs, amphenicoles, thyreostatics and other substances such as dapsone. A database including the elemental composition, the po…

Shear models of Rc-encased steel joist beams in MRFs

2019

This study presents the application of different analytical and finite element (FE) models aimed at predicting the shear resistance of reinforced concrete (RC) and reinforced concrete-encased steel joist (HRCESJ) beams with inclined transversal reinforcement in moment resisting frames (MRFs). In particular, four analytical models are taken into account, two of them specifically conceived for HRCESJ beams in seismic area. The analytical models considered are Eurocode-2 model for the shear strength of RC beams; a variable-inclination stress-field approach; a strut-and-tie additive model and, finally, an analytical formulation in which the shear capacity depends on the number of pairs of incli…