<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
  <channel>
    <title>DSpace Kolekcja:</title>
    <link>http://hdl.handle.net/11320/21558</link>
    <description />
    <pubDate>Thu, 19 Nov 2026 21:20:47 GMT</pubDate>
    <dc:date>2026-11-19T21:20:47Z</dc:date>
    <item>
      <title>Hilbert Space of Real Sequences</title>
      <link>http://hdl.handle.net/11320/21579</link>
      <description>Tytu&amp;#322;: Hilbert Space of Real Sequences
Autorzy: Endou, Noboru; Suzuki, Yasumasa; Shidama, Yasunari
Abstrakt: A continuation of [16]. As the example of real unitary spaces, we introduce the arithmetic addition and multiplication in the set of square sum able real sequences and introduce the scaler products also. This set has the structure of the Hilbert space.</description>
      <pubDate>Wed, 01 Jan 2003 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/11320/21579</guid>
      <dc:date>2003-01-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>Real Linear Space of Real Sequences</title>
      <link>http://hdl.handle.net/11320/21576</link>
      <description>Tytu&amp;#322;: Real Linear Space of Real Sequences
Autorzy: Endou, Noboru; Suzuki, Yasumasa; Shidama, Yasunari
Abstrakt: The article is a continuation of [14]. As the example of real linear spaces, we introduce the arithmetic addition in the set of real sequences and also introduce the multiplication. This set has the arithmetic structure which depends on these arithmetic operations.</description>
      <pubDate>Wed, 01 Jan 2003 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/11320/21576</guid>
      <dc:date>2003-01-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>Dijkstra’s Shortest Path Algorithm</title>
      <link>http://hdl.handle.net/11320/21572</link>
      <description>Tytu&amp;#322;: Dijkstra’s Shortest Path Algorithm
Autorzy: Chen, Jing-Chao
Abstrakt: The article formalizes Dijkstra’s shortest path algorithm [11]. A path from a source vertex v to a target vertex u is said to be the shortest path if its total cost is minimum among all v-to-u paths. Dijkstra’s algorithm is based on the following assumptions: • All edge costs are non-negative. • The number of vertices is finite. • The source is a single vertex, but the target may be all other vertices. The underlying principle of the algorithm may be described as follows: the algorithm starts with the source; it visits the vertices in order of increasing cost, and maintains a set V of visited vertices (denoted by UsedVx in the article) whose cost from the source has been computed, and a tentative cost D(u) to each unvisited vertex u. In the article, the set of all unvisited vertices is denoted by UnusedVx. D(u) is the cost of the shortest path from the source to u in the subgraph induced by V [ {u}. We denote the set of all unvisited vertices whose D-values are not infinite (i.e. in the subgraph each of which has a path from the source to itself) by OuterVx. Dijkstra’s algorithm repeatedly searches OuterVx for the vertex with minimum tentative cost (this procedure is called findmin in the article), adds it to the set V and modifies D-values by a procedure, called Relax. Suppose the unvisited vertex with minimum tentative cost is x, the procedure Relax replaces D(u) with min{D(u),D(u)+cost(x, u)} where u is a vertex in UnusedVx, and cost(x, u) is the cost of edge (x, u). In the Mizar library, there are several computer models, e.g. SCMFSA and SCMPDS etc. However, it is extremely difficult to use these models to formalize the algorithm. Instead, we adopt functions in the Mizar library, which seem to be pseudo-codes, and are similar to those in the functional programming language, e.g. Lisp. To date, there is no rigorous justification with respect to the correctness of Dijkstra’s algorithm. The article presents first the rigorous justification.</description>
      <pubDate>Wed, 01 Jan 2003 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/11320/21572</guid>
      <dc:date>2003-01-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>Full Subtracter Circuit. Part II</title>
      <link>http://hdl.handle.net/11320/21568</link>
      <description>Tytu&amp;#322;: Full Subtracter Circuit. Part II
Autorzy: Yamaguchi, Shin’nosuke; Bancerek, Grzegorz; Wasaki, Katsumi
Abstrakt: In this article we continue investigations from [22] of verification of a design of subtracter circuit. We define it as a combination of multi cell circuit using schemes from [6]. As the main result we prove the stability of the circuit.</description>
      <pubDate>Wed, 01 Jan 2003 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">http://hdl.handle.net/11320/21568</guid>
      <dc:date>2003-01-01T00:00:00Z</dc:date>
    </item>
  </channel>
</rss>

