<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/">
<channel rdf:about="http://hdl.handle.net/11336/68">
<title>Articulos(INMABB)</title>
<link>http://hdl.handle.net/11336/68</link>
<description>Articulos de INST.DE MATEMATICA BAHIA BLANCA (I)</description>
<items>
<rdf:Seq>
<rdf:li rdf:resource="http://hdl.handle.net/11336/232419"/>
<rdf:li rdf:resource="http://hdl.handle.net/11336/232365"/>
<rdf:li rdf:resource="http://hdl.handle.net/11336/232291"/>
<rdf:li rdf:resource="http://hdl.handle.net/11336/231843"/>
</rdf:Seq>
</items>
<dc:date>2024-04-08T18:33:16Z</dc:date>
</channel>
<item rdf:about="http://hdl.handle.net/11336/232419">
<title>Forest harvest operations productivity forecasting: a decisions tree approach</title>
<link>http://hdl.handle.net/11336/232419</link>
<description>Forest harvest operations productivity forecasting: a decisions tree approach
Rossit, Daniel Alejandro; Olivera, Alejandro; Viana-Céspedes, Víctor; Broz, Diego Ricardo
In recent years, the machinery used in forest harvesting operations has incorporated the ability to collect data during the harvesting operation automatically. The processing of these data allows for obtaining new perspectives on the harvest characteristics. In this sense, it is that the development of predictive models for harvest productivity is approached by processing the automatically retrieved data. In turn, these new models pave the way to develop new tools for operations management decision-making processes, providing a data-driven approach. In this case, forest productivity is analyzed based on different harvesting operational configurations defined by stand, trees, species, operators, shifts, etc., which make it possible to adequately predict what the wood-harvested volume will be, and thus, synchronize the rest of the supply chain logistics operations. The data processing is done through decision tree methods. Different methods of decision trees based on exhaustive CHAID, recursive binary partition, and conditional inference based that also uses binary recursive partition are tested. The results show that decision recursive binary partition methods tend to model more balanced the entire spectrum of the target variable more. While exhaustive CHAID-based methods tend to be more accurate in global terms but more unbalanced. As a general comment for the method, global confusion matrices are around 50% of accuracy, and some operational configurations and productivity classes are predicted with almost 90% of accuracy.
</description>
<dc:date>2024-03-18T00:00:00Z</dc:date>
</item>
<item rdf:about="http://hdl.handle.net/11336/232365">
<title>Functional description of free algebras in subvarieties of BL-algebras</title>
<link>http://hdl.handle.net/11336/232365</link>
<description>Functional description of free algebras in subvarieties of BL-algebras
Díaz Varela, José Patricio; Lubomirsky, Noemí
In this paper, we present a method to describe (functionally) free algebras in some subvarieties of BL-algebras. Particularly, we give a description of free algebras in subvarieties of the subvariety MG, where MG is the subvariety of BL generated by the algebra [0, 1]MV⊕[0, 1]G.
</description>
<dc:date>2024-03-15T00:00:00Z</dc:date>
</item>
<item rdf:about="http://hdl.handle.net/11336/232291">
<title>BMO with respect to Banach function spaces</title>
<link>http://hdl.handle.net/11336/232291</link>
<description>BMO with respect to Banach function spaces
Lerner, Andrei K.; Lorist, Emiel; Ombrosi, Sheldy Javier
For every cube Q ⊂ ℝⁿ we let X_Q be a quasi-Banach function space over Q such that ||χ_Q||_{X_Q} ≃ 1, and for X = {X_Q} define:&#13;
||f||{BMO_X} := sup_Q ||f - (1/|Q|)∫_Q f ||{X_Q},&#13;
||f||{BMO_X*} := sup_Q inf_c ||f - c||{X_Q}.&#13;
We study necessary and sufficient conditions on X such that BMO = BMO_X = BMO_X*.&#13;
In particular, we give a full characterization of the embedding BMO ↪ BMO_X in terms of so-called sparse collections of cubes, and we give easily checkable and rather weak sufficient conditions for the embedding BMO_X* ↪ BMO. Our main theorems recover and improve all previously known results in this area.
</description>
<dc:date>2024-04-30T00:00:00Z</dc:date>
</item>
<item rdf:about="http://hdl.handle.net/11336/231843">
<title>A Logic for Dually Hemimorphic Semi-Heyting Algebras and Axiomatic Extensions</title>
<link>http://hdl.handle.net/11336/231843</link>
<description>A Logic for Dually Hemimorphic Semi-Heyting Algebras and Axiomatic Extensions
Cornejo, Juan Manuel; Sankappanavar, Hanamantagouda P.
The variety DHMSH of dually hemimorphic semi-Heyting algebras was introduced in 2011 by the second author as an expansion of semi-Heyting algebras by a dual hemimorphism. In this paper, we focus on the variety DHMSH from a logical point of view. The paper presents an extensive investigation of the logic corresponding to the variety of dually hemimorphic semi-Heyting algebras and of its axiomatic extensions, along with an equally extensive universal algebraic study of their corresponding algebraic semantics. Firstly, we present a Hilbertstyle axiomatization of a new logic called “Dually hemimorphic semi-Heyting logic” (DHMSH, for short), as an expansion of semi-intuitionistic logic SI (also called SH) introduced by the first author by adding a weak negation (to be interpreted as a dual hemimorphism). We then prove that it is implicative in the sense of Rasiowa and that it is complete with respect to the variety DHMSH. It is deduced that the logic DHMSH is algebraizable in the sense of Blok and Pigozzi, with the variety DHMSH as its equivalent algebraic semantics and that the lattice of axiomatic extensions of DHMSH is dually isomorphic to the lattice of subvarieties of DHMSH. A new axiomatization for Moisil’s logic is also obtained. Secondly, we characterize the axiomatic extensions of DHMSH in which the “Deduction Theorem” holds. Thirdly, we present several new logics, extending the logic DHMSH, corresponding to several important subvarieties of the variety DHMSH. These include logics corresponding to the varieties generated by two-element, three-element and some four-element dually quasi-De Morgan semiHeyting algebras, as well as a new axiomatization for the 3-valued Lukasiewicz logic. Surprisingly, many of these logics turn out to be connexive logics, only a few of which are presented in this paper. Fourthly, we present axiomatizations for two infinite sequences of logics namely, De Morgan G¨odel logics and dually pseudocomplemented G¨odel logics. Fifthly, axiomatizations are also provided for logics corresponding to many subvarieties of regular dually quasi-De Morgan Stone semi-Heyting algebras, of regular De Morgan semi-Heyting algebras of level 1, and of JI-distributive semi-Heyting algebras of level 1. We conclude the paper with some open problems. Most of the logics considered in this paper are discriminator logics in the sense that they correspond to discriminator varieties. Some of them, just like the classical logic, are even primal in the sense that their corresponding varieties are generated by primal algebras.
</description>
<dc:date>2022-12-01T00:00:00Z</dc:date>
</item>
</rdf:RDF>
