<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <title>DSpace Zesp&amp;#243;&amp;#322;:</title>
  <link rel="alternate" href="http://hdl.handle.net/11320/8760" />
  <subtitle />
  <id>http://hdl.handle.net/11320/8760</id>
  <updated>2026-11-07T14:13:51Z</updated>
  <dc:date>2026-11-07T14:13:51Z</dc:date>
  <entry>
    <title>A Tree of Execution of a Macroinstruction</title>
    <link rel="alternate" href="http://hdl.handle.net/11320/21456" />
    <author>
      <name>Korniłowicz, Artur</name>
    </author>
    <id>http://hdl.handle.net/11320/21456</id>
    <updated>2026-11-06T11:09:06Z</updated>
    <published>2004-01-01T00:00:00Z</published>
    <summary type="text">Tytu&amp;#322;: A Tree of Execution of a Macroinstruction
Autorzy: Korniłowicz, Artur
Abstrakt: A tree of execution of a macroinstruction is defined. It is a tree decorated by the instruction locations of a computer. Successors of each vertex are determined by the set of all possible values of the instruction counter after execution of the instruction placed in the location indicated by given vertex.
Opis: The paper was written during author’s post-doctoral fellowship granted by Shinshu University, Japan.; The author wishes to thank Andrzej Trybulec and Grzegorz Bancerek for their very useful comments during writing this article.</summary>
    <dc:date>2004-01-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Basic Properties of Rough Sets and Rough Membership Function</title>
    <link rel="alternate" href="http://hdl.handle.net/11320/21451" />
    <author>
      <name>Grabowski, Adam</name>
    </author>
    <id>http://hdl.handle.net/11320/21451</id>
    <updated>2026-11-06T10:04:31Z</updated>
    <published>2004-01-01T00:00:00Z</published>
    <summary type="text">Tytu&amp;#322;: Basic Properties of Rough Sets and Rough Membership Function
Autorzy: Grabowski, Adam
Abstrakt: We present basic concepts concerning rough set theory. We define tolerance and approximation spaces and rough membership function. Different rough inclusions as well as the predicate of rough equality of sets are also introduced.</summary>
    <dc:date>2004-01-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>GQL Essentials</title>
    <link rel="alternate" href="http://hdl.handle.net/11320/21448" />
    <author>
      <name>Tomaszuk, Dominik</name>
    </author>
    <id>http://hdl.handle.net/11320/21448</id>
    <updated>2026-11-06T07:22:59Z</updated>
    <published>2026-01-01T00:00:00Z</published>
    <summary type="text">Tytu&amp;#322;: GQL Essentials
Autorzy: Tomaszuk, Dominik
Abstrakt: GQL Essentials introduces the Graph Query Language (GQL), standardized in ISO/IEC 39075, for working with property graph databases. The book draws on the standard and published research to explain GQL's data model, syntax, and semantics.&#xD;
&#xD;
The opening chapters introduce property graphs and place GQL in relation to SQL, RDF, and SPARQL. Subsequent chapters explain graph patterns, pattern matching, expressions, query algebra, and paths. They also cover aggregation, ordering, data modification, types, schemas, and integrity constraints. Later chapters address catalogs, procedures, transactions, concurrency, authorization, and diagnostics.&#xD;
&#xD;
Practical examples are paired with mathematical definitions of the language's core concepts and operations. The closing chapters examine proposed extensions and open questions about expressiveness, computational complexity, query optimization, graph transformations, interoperability, and schema management.&#xD;
&#xD;
The book is written for researchers, database practitioners, software developers, and advanced students who want to understand GQL and the foundations of graph database systems.
Opis: Recenzowana monografia naukowa opublikowana przez Wydawnictwo Uniwersytetu w Białymstoku w 2026 roku.&#xD;
&#xD;
Recenzenci:&#xD;
prof. dr hab. Krzysztof Stencel (Uniwersytet Warszawski);&#xD;
dr hab. Piotr Wiśniewski, prof. UMK (Uniwersytet Mikołaja Kopernika w Toruniu).&#xD;
&#xD;
Publikacja udostępniana w otwartym dostępie na licencji Creative Commons Attribution (CC BY).&#xD;
&#xD;
Wersja internetowa: https://gql.fyi&#xD;
DOI: https://doi.org/10.15290/GQL_Essentials_2026&#xD;
Miejsce wydania: Białystok.</summary>
    <dc:date>2026-01-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>On the Representation of Natural Numbers in Positional Numeral Systems</title>
    <link rel="alternate" href="http://hdl.handle.net/11320/21442" />
    <author>
      <name>Naumowicz, Adam</name>
    </author>
    <id>http://hdl.handle.net/11320/21442</id>
    <updated>2026-11-05T11:16:06Z</updated>
    <published>2006-01-01T00:00:00Z</published>
    <summary type="text">Tytu&amp;#322;: On the Representation of Natural Numbers in Positional Numeral Systems
Autorzy: Naumowicz, Adam
Abstrakt: In this paper we show that every natural number can be uniquely represented as a base-b numeral. The formalization is based on the proof presented in [11]. We also prove selected divisibility criteria in the base-10 numeral system.</summary>
    <dc:date>2006-01-01T00:00:00Z</dc:date>
  </entry>
</feed>

