<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:itunes="http://www.itunes.com/dtds/podcast-1.0.dtd" xmlns:media="http://search.yahoo.com/mrss/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" version="2.0">
  <channel>
    <title>DSpace Collection: 2005, Vol. XII, Núm. 1</title>
    <link>http://hdl.handle.net/2099/1817</link>
    <description />
    <itunes:owner>
      <itunes:email>webmaster.bupc@upc.edu</itunes:email>
      <itunes:name>Universitat Politècnica de Catalaunya. Servei de Biblioteques i Documentació</itunes:name>
    </itunes:owner>
    <itunes:explicit>no</itunes:explicit>
    <itunes:keywords />
    <textInput>
      <title>The Collection's search engine</title>
      <description>Search the Channel</description>
      <name>search</name>
      <link>http://upcommons.upc.edu/revistes/simple-search</link>
    </textInput>
    <item>
      <title>A note on the symmetric difference in lattices</title>
      <link>http://hdl.handle.net/2099/2056</link>
      <description>Title: A note on the symmetric difference in lattices&lt;br/&gt;&lt;br/&gt;Authors: Renedo, Eloy; Trillas i Gay, Enric; Alsina Català, Claudi&lt;br/&gt;&lt;br/&gt;Abstract: The paper introduces a definition of symmetric difference in lattices with negation, presents its general properties and studies those that are typical of ortholattices, orthomodular lattices, de Morgan and boolean algebras.</description>
      <pubDate>Sat, 01 Jan 2005 00:00:00 GMT</pubDate>
      <itunes:author>Renedo, Eloy; Trillas i Gay, Enric; Alsina Català, Claudi</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Ortholattices, De Morgan algebras, Symmetric difference</itunes:keywords>
      <itunes:summary>The paper introduces a definition of symmetric difference in lattices with negation, presents its general properties and studies those that are typical of ortholattices, orthomodular lattices, de Morgan and boolean algebras.</itunes:summary>
    </item>
    <item>
      <title>A fuzzy logic approach to assembly line</title>
      <link>http://hdl.handle.net/2099/2055</link>
      <description>Title: A fuzzy logic approach to assembly line&lt;br/&gt;&lt;br/&gt;Authors: Fonseca, Daniel J.; Elam, Matthew; Karr, Charles L.; Guest, C.L.&lt;br/&gt;&lt;br/&gt;Abstract: This paper deals with the use of fuzzy set theory as a viable alternativemethod for modelling and solving the stochastic assembly line balancingproblem. Variability and uncertainty in the assembly line balancing problemhas traditionally been modelled through the use of statistical distributions.This may not be feasible in cases where no historical data exists. Fuzzy settheory allows for the consideration of the ambiguity involved in assigningprocessing and cycle times and the uncertainty contained within such timevariables. Two widely used line balancing methods, the COMSOAL andRanked Positional Weighting Technique, were modified to solve the balancingproblem with a fuzzy representation of the time variables. The paper showsthat the new fuzzy methods are capable of producing solutions similar to, andin some cases better than, those reached by the traditional methods.</description>
      <pubDate>Sat, 01 Jan 2005 00:00:00 GMT</pubDate>
      <itunes:author>Fonseca, Daniel J.; Elam, Matthew; Karr, Charles L.; Guest, C.L.</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Line balancing, Fuzzy sets, COMSOAL, Ranked positional weighting technique</itunes:keywords>
      <itunes:summary>This paper deals with the use of fuzzy set theory as a viable alternative&#xD;
method for modelling and solving the stochastic assembly line balancing&#xD;
problem. Variability and uncertainty in the assembly line balancing problem&#xD;
has traditionally been modelled through the use of statistical distributions.&#xD;
This may not be feasible in cases where no historical data exists. Fuzzy set&#xD;
theory allows for the consideration of the ambiguity involved in assigning&#xD;
processing and cycle times and the uncertainty contained within such time&#xD;
variables. Two widely used line balancing methods, the COMSOAL and&#xD;
Ranked Positional Weighting Technique, were modified to solve the balancing&#xD;
problem with a fuzzy representation of the time variables. The paper shows&#xD;
that the new fuzzy methods are capable of producing solutions similar to, and&#xD;
in some cases better than, those reached by the traditional methods.</itunes:summary>
    </item>
    <item>
      <title>On the transfer principle in fuzzy theory</title>
      <link>http://hdl.handle.net/2099/2054</link>
      <description>Title: On the transfer principle in fuzzy theory&lt;br/&gt;&lt;br/&gt;Authors: Kondo, Michiro; Dudek, Wieslaw A.&lt;br/&gt;&lt;br/&gt;Abstract: We show in this paper that almost all results proved in many papers aboutfuzzy algebras can be proved uniformly and immediately by using so-called“Transfer Principle”.</description>
      <pubDate>Sat, 01 Jan 2005 00:00:00 GMT</pubDate>
      <itunes:author>Kondo, Michiro; Dudek, Wieslaw A.</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Fuzzy theory, Transfer principle</itunes:keywords>
      <itunes:summary>We show in this paper that almost all results proved in many papers about&#xD;
fuzzy algebras can be proved uniformly and immediately by using so-called&#xD;
“Transfer Principle”.</itunes:summary>
    </item>
    <item>
      <title>A heuristic forecasting model for stock decision</title>
      <link>http://hdl.handle.net/2099/2053</link>
      <description>Title: A heuristic forecasting model for stock decision&lt;br/&gt;&lt;br/&gt;Authors: Zhang, D.; Jiang, Q.; Li, X.&lt;br/&gt;&lt;br/&gt;Abstract: This paper describes a heuristic forecasting model based on neural networksfor stock decision-making. Some heuristic strategies are presented forenhancing the learning capability of neural networks and obtaining bettertrading performance. The China Shanghai Composite Index is used as casestudy. The forecasting model can forecast the buying and selling signs accordingto the result of neural network prediction. Results are comparedwith a benchmark buy-and-hold strategy. The forecasting model was foundcapable of consistently outperforming this benchmark strategy.</description>
      <pubDate>Sat, 01 Jan 2005 00:00:00 GMT</pubDate>
      <itunes:author>Zhang, D.; Jiang, Q.; Li, X.</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Stock decision-making, Forecasting model, Benchmarking, China Shanghai Composite Index</itunes:keywords>
      <itunes:summary>This paper describes a heuristic forecasting model based on neural networks&#xD;
for stock decision-making. Some heuristic strategies are presented for&#xD;
enhancing the learning capability of neural networks and obtaining better&#xD;
trading performance. The China Shanghai Composite Index is used as case&#xD;
study. The forecasting model can forecast the buying and selling signs according&#xD;
to the result of neural network prediction. Results are compared&#xD;
with a benchmark buy-and-hold strategy. The forecasting model was found&#xD;
capable of consistently outperforming this benchmark strategy.</itunes:summary>
    </item>
    <item>
      <title>A multistrategy approach for digital text</title>
      <link>http://hdl.handle.net/2099/2052</link>
      <description>Title: A multistrategy approach for digital text&lt;br/&gt;&lt;br/&gt;Authors: Castillo, María Dolores del; Serrano Moreno, José Ignacio&lt;br/&gt;&lt;br/&gt;Abstract: The goal of the research described here is to develop a multistrategy classifier system that can be used for document categorization. The system automatically discovers classification patterns by applying several empirical learning methods to different representations for preclassified documents.The learners work in a parallel manner, where each learner carries out its own feature selection based on evolutionary techniques and then obtains a classification model. In classifying documents, the system combines the predictions of the learners by applying evolutionary techniques as well. The system relieson a modular, flexible architecture that makes no assumptions about the design of learners or the number of learners available and guarantees theindependence of the thematic domain.</description>
      <pubDate>Sat, 01 Jan 2005 00:00:00 GMT</pubDate>
      <itunes:author>Castillo, María Dolores del; Serrano Moreno, José Ignacio</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Categorization, Classification models</itunes:keywords>
      <itunes:summary>The goal of the research described here is to develop a multistrategy classifier system that can be used for document categorization. The system automatically discovers classification patterns by applying several empirical learning methods to different representations for preclassified documents.&#xD;
The learners work in a parallel manner, where each learner carries out its own feature selection based on evolutionary techniques and then obtains a classification model. In classifying documents, the system combines the predictions of the learners by applying evolutionary techniques as well. The system relies&#xD;
on a modular, flexible architecture that makes no assumptions about the design of learners or the number of learners available and guarantees the&#xD;
independence of the thematic domain.</itunes:summary>
    </item>
    <item>
      <title>On the central limit theorem on IFS-events</title>
      <link>http://hdl.handle.net/2099/2051</link>
      <description>Title: On the central limit theorem on IFS-events&lt;br/&gt;&lt;br/&gt;Authors: Petrovicova, Jozefina; Beloslav, Riecan&lt;br/&gt;&lt;br/&gt;Abstract: A probability theory on IFS-events has been constructed in [3], and axiomaticallycharacterized in [4]. Here using a general system of axioms itis shown that any probability on IFS-events can be decomposed onto twoprobabilities on a Lukasiewicz tribe, hence some known results from [5], [6]can be used also for IFS-sets. As an application of the approach a variant ofCentral limit theorem is presented</description>
      <pubDate>Sat, 01 Jan 2005 00:00:00 GMT</pubDate>
      <itunes:author>Petrovicova, Jozefina; Beloslav, Riecan</itunes:author>
      <itunes:explicit>no</itunes:explicit>
      <itunes:keywords>Probability theory, IFS-events</itunes:keywords>
      <itunes:summary>A probability theory on IFS-events has been constructed in [3], and axiomatically&#xD;
characterized in [4]. Here using a general system of axioms it&#xD;
is shown that any probability on IFS-events can be decomposed onto two&#xD;
probabilities on a Lukasiewicz tribe, hence some known results from [5], [6]&#xD;
can be used also for IFS-sets. As an application of the approach a variant of&#xD;
Central limit theorem is presented</itunes:summary>
    </item>
  </channel>
</rss>


