<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns="http://purl.org/rss/1.0/" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel rdf:about="http://hdl.handle.net/11320/3584">
    <title>DSpace Kolekcja:</title>
    <link>http://hdl.handle.net/11320/3584</link>
    <description />
    <items>
      <rdf:Seq>
        <rdf:li rdf:resource="http://hdl.handle.net/11320/3641" />
        <rdf:li rdf:resource="http://hdl.handle.net/11320/3640" />
        <rdf:li rdf:resource="http://hdl.handle.net/11320/3636" />
        <rdf:li rdf:resource="http://hdl.handle.net/11320/3635" />
      </rdf:Seq>
    </items>
    <dc:date>2026-06-01T07:20:24Z</dc:date>
  </channel>
  <item rdf:about="http://hdl.handle.net/11320/3641">
    <title>Introduction to Rational Functions</title>
    <link>http://hdl.handle.net/11320/3641</link>
    <description>Tytu&amp;#322;: Introduction to Rational Functions
Autorzy: Schwarzweller, Christoph
Abstrakt: In this article we formalize rational functions as pairs of polynomials&#xD;
and define some basic notions including the degree and evaluation of&#xD;
rational functions [8]. The main goal of the article is to provide properties of&#xD;
rational functions necessary to prove a theorem on the stability of networks.</description>
    <dc:date>2012-01-01T00:00:00Z</dc:date>
  </item>
  <item rdf:about="http://hdl.handle.net/11320/3640">
    <title>Extended Euclidean Algorithm and CRT Algorithm</title>
    <link>http://hdl.handle.net/11320/3640</link>
    <description>Tytu&amp;#322;: Extended Euclidean Algorithm and CRT Algorithm
Autorzy: Okazaki, Hiroyuki; Aoki, Yosiki; Shidama, Yasunari
Abstrakt: In this article we formalize some number theoretical algorithms, Euclidean Algorithm and Extended Euclidean Algorithm [9]. Besides the a gcd b, Extended Euclidean Algorithm can calculate a pair of two integers (x, y) that holds ax + by = a gcd b. In addition, we formalize an algorithm that can compute a solution of the Chinese remainder theorem by using Extended Euclidean Algorithm. Our aim is to support the implementation of number theoretic tools. Our formalization of those algorithms is based on the source code of the NZMATH, a number theory oriented calculation system developed by Tokyo Metropolitan University [8].</description>
    <dc:date>2012-01-01T00:00:00Z</dc:date>
  </item>
  <item rdf:about="http://hdl.handle.net/11320/3636">
    <title>Formalization of the Data Encryption Standard</title>
    <link>http://hdl.handle.net/11320/3636</link>
    <description>Tytu&amp;#322;: Formalization of the Data Encryption Standard
Autorzy: Okazaki, Hiroyuki; Shidama, Yasunari
Abstrakt: In this article we formalize DES (the Data Encryption Standard), that was the most widely used symmetric cryptosystem in the world. DES is a block cipher which was selected by the National Bureau of Standards as an official Federal Information Processing Standard for the United States in 1976 [15].</description>
    <dc:date>2012-01-01T00:00:00Z</dc:date>
  </item>
  <item rdf:about="http://hdl.handle.net/11320/3635">
    <title>Higher-Order Partial Differentiation</title>
    <link>http://hdl.handle.net/11320/3635</link>
    <description>Tytu&amp;#322;: Higher-Order Partial Differentiation
Autorzy: Endou, Noboru; Okazaki, Hiroyuki; Shidama, Yasunari
Abstrakt: In this article, we shall extend the formalization of [10] to discuss higher-order partial differentiation of real valued functions. The linearity of this operator is also proved (refer to [10], [12] and [13] for partial differentiation).</description>
    <dc:date>2012-01-01T00:00:00Z</dc:date>
  </item>
</rdf:RDF>

