<?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/21533">
    <title>DSpace Kolekcja:</title>
    <link>http://hdl.handle.net/11320/21533</link>
    <description />
    <items>
      <rdf:Seq>
        <rdf:li rdf:resource="http://hdl.handle.net/11320/21545" />
        <rdf:li rdf:resource="http://hdl.handle.net/11320/21543" />
        <rdf:li rdf:resource="http://hdl.handle.net/11320/21541" />
        <rdf:li rdf:resource="http://hdl.handle.net/11320/21540" />
      </rdf:Seq>
    </items>
    <dc:date>2026-11-17T12:31:34Z</dc:date>
  </channel>
  <item rdf:about="http://hdl.handle.net/11320/21545">
    <title>On the Hausdorff Distance Between Compact Subsets</title>
    <link>http://hdl.handle.net/11320/21545</link>
    <description>Tytu&amp;#322;: On the Hausdorff Distance Between Compact Subsets
Autorzy: Grabowski, Adam
Abstrakt: In [1] the pseudo-metric dist ᵐᵃˣ ₘᵢₙ on compact subsets A and B of a topological space generated from arbitrary metric space is defined. Using this notion we define the Hausdorff distance (see e.g. [5]) of A and B as a maximum of the two pseudo-distances: from A to B and from B to A. We justify its distance properties. At the end we define some special notions which enable to apply the Hausdorff distance operator “HausDist” to the subsets of the Euclidean topological space E ⁿ ₜ .</description>
    <dc:date>2003-01-01T00:00:00Z</dc:date>
  </item>
  <item rdf:about="http://hdl.handle.net/11320/21543">
    <title>The Underlying Principle of Dijkstra’s Shortest Path Algorithm</title>
    <link>http://hdl.handle.net/11320/21543</link>
    <description>Tytu&amp;#322;: The Underlying Principle of Dijkstra’s Shortest Path Algorithm
Autorzy: Chen, Jing-Chao; Nakamura, Yatsuka
Abstrakt: A path from a source vertex v to a target vertex u is said to be a shortest path if its total cost is minimum among all v-to-u paths. Dijkstra’s algorithm is a classic shortest path algorithm, which is described in many textbooks. To justify its correctness (whose rigorous proof will be given in the next article), it is necessary to clarify its underlying principle. For this purpose, the article justifies the following basic facts, which are the core of Dijkstra’s algorithm. • A graph is given, its vertex set is denoted by V. Assume U is the subset of&#xD;
V, and if a path p from s to t is the shortest among the set of paths, each of which passes through only the vertices in U, except the source and sink, and its source and sink is s and in V, respectively, then p is a shortest path from s to t in the graph, and for any subgraph which contains at least U, it is also the shortest. • Let p(s, x,U) denote the shortest path from s to x in a subgraph whose the vertex set is the union of {s, x} and U, and cost (p) denote the cost of path p(s, x,U), cost(x, y) the cost of the edge from x to y. Give p(s, x,U), q(s, y,U) and r(s, y,U[{x}). If cost(p) = min{cost(w) : w(s, t,U)^t 2 V }, then we have cost(r) = min(cost(p) + cost(x, y), cost(q)). This is the well-known triangle comparison of Dijkstra’s algorithm.</description>
    <dc:date>2003-01-01T00:00:00Z</dc:date>
  </item>
  <item rdf:about="http://hdl.handle.net/11320/21541">
    <title>High Speed Adder Algorithm with Radix-2ᵏ Sub Signed-Digit Number</title>
    <link>http://hdl.handle.net/11320/21541</link>
    <description>Tytu&amp;#322;: High Speed Adder Algorithm with Radix-2ᵏ Sub Signed-Digit Number
Autorzy: Niimura, Masaaki; Fuwa, Yasushi
Abstrakt: In this article, a new adder algorithm using Radix-2ᵏ sub signed-digit numbers is defined and properties for the hardware-realization is discussed. Until now, we proposed Radix-2ᵏ sub signed-digit numbers in consideration of the hardware realization. In this article, we proposed High Speed Adder Algorithm using this Radix-2ᵏ sub signed-digit numbers. This method has two ways to speed up at hardware-realization. One is ’bit compare’ at carry calculation, it is proposed in another article. Other is carry calculation between two numbers. We proposed that n digits Radix-2ᵏ signed-digit numbers is expressed in n + 1 digits Radix-2ᵏ sub signed-digit numbers, and addition result of two n+1 digits Radix-2ᵏ sub signed-digit numbers is expressed in n+1 digits. In this way, carry operation between two Radix-2ᵏ sub signed-digit numbers can be processed at n + 1 digit adder circuit and additional circuit to operate carry is not needed. In the first section of this article, we prepared some useful theorems for operation of Radix-2ᵏ numbers. In the second section, we proved some properties&#xD;
about carry on Radix-2ᵏ sub signed-digit numbers. In the last section, we defined the new addition operation using Radix-2k sub signed-digit numbers, and we clarified its correctness.</description>
    <dc:date>2003-01-01T00:00:00Z</dc:date>
  </item>
  <item rdf:about="http://hdl.handle.net/11320/21540">
    <title>Improvement of Radix-2ᵏ Signed-Digit Number for High Speed Circuit</title>
    <link>http://hdl.handle.net/11320/21540</link>
    <description>Tytu&amp;#322;: Improvement of Radix-2ᵏ Signed-Digit Number for High Speed Circuit
Autorzy: Niimura, Masaaki; Fuwa, Yasushi
Abstrakt: In this article, a new radix-2ᵏ signed-digit number (Radix-2ᵏ sub signed-digit number) is defined and its properties for hardware realization are discussed. Until now, high speed calculation method with Radix-2ᵏ signed-digit numbers is proposed, but this method used “Compares With 2” to calculate carry. “Compares with 2” is a very simple method, but it needs very complicated hardware especially when the value of k becomes large. In this article, we propose a subset of Radix-2ᵏ signed-digit, named Radix-2ᵏ sub signed-digit numbers. Radix-2ᵏ sub signed-digit was designed so that the carry calculation use “bit compare” to hardware-realization simplifies more. In the first section of this article, we defined the concept of Radix-2ᵏ sub signed-digit numbers and proved some of their properties. In the second section, we defined the new carry calculation method in consideration of hardware-realization, and proved some of their properties. In the third section, we provide some functions for generating Radix-2ᵏ sub signed-digit numbers from Radix-2ᵏ signed-digit numbers. In the last section, we defined some functions for generation natural numbers from Radix-2ᵏ sub signed-digit, and we clarified its correctness.</description>
    <dc:date>2003-01-01T00:00:00Z</dc:date>
  </item>
</rdf:RDF>

