Jerzy Tyszkiewicz | University of Warsaw (original) (raw)

Uploads

Papers by Jerzy Tyszkiewicz

Research paper thumbnail of Can we read stones? Quantifying the information loss in flintknapping

Journal of Archaeological Science, Dec 31, 2023

One of the methods of analysing the manufacturing process of lithic tools is by "reading... more One of the methods of analysing the manufacturing process of lithic tools is by "reading" the scars of removals visible on the surface of cores or bifaces. The paper aims to review the limitations of this approach, by answering the question as to how much information from the original knapping process is still preserved in the cores and bifaces. To quantify the information loss we used experimentally knapped pieces, that we then refitted to check which removals are still visible on the surface of the analysed forms. We tested different measures of information loss in the context of removals and sequences of removals, but also the chronological relationship between sequences i.e. the number of linear extensions and missing nearest connections. On average, 39.9% of the original removals and 54.1% of the sequences of removals are preserved on the surface, but only 14.1% of the original relationships between sequences can be observed. Finally, we used simple machine learning to find an algorithm for estimating the loss of the nearest chronological relationships between sequences when no refits are available. Due to the extremely high information loss for the linear order of the knapping process we: a) propose to abandon these elements of the diacritic approach which aim to reconstruct the rhythms and schemes of knapping; b) evaluate the quality of the reconstructed knapping scheme (partial order) prior to further comparative analyses. Here we propose an algorithm to estimate the number of missing connections to test the quality of the knapping process while using diacritic schemes.

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Mathematical Foundations of Computer Science 2008: 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings

Springer eBooks, Sep 25, 2008

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Mathematical Foundations of Computer Science 2008

Springer eBooks, 2008

Bookmarks Related papers MentionsView impact

Research paper thumbnail of XQTav: an XQuery processor for Taverna environment

Bioinformatics, 2006

Bookmarks Related papers MentionsView impact

Research paper thumbnail of On the expressive power of semijoin queries

arXiv (Cornell University), Aug 6, 2003

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science

Bookmarks Related papers MentionsView impact

Research paper thumbnail of The Power of Spreadsheet Computations

Fields of Logic and Computation III, 2020

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Contextual alignment of biological sequences (Extended abstract)

Bioinformatics, 2002

We present a model of contextual alignment of biological sequences. It is an extension of the cla... more We present a model of contextual alignment of biological sequences. It is an extension of the classical alignment, in which we assume that the cost of a substitution depends on the surrounding symbols. In this model the cost of transforming one sequence into another depends on the order of editing operations. We present efficient algorithms for calculating this cost, as well as reconstructing (the representation of) all the orders of operations which yield this optimal cost. A precise characterization of the families of linear orders which can emerge this way is given. Contact: jty@mimuw.edu.pl

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Aggregating over Dominated Points by Sorting, Scanning, Zip and Flat Maps

arXiv (Cornell University), May 26, 2023

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Infinitary queries and their asymptotic probabilities. II. Properties definable in least fixed point logic

Random Structures and Algorithms, 1994

ABSTRACT We develop an almost complete theory for existence of asymptotic probabilities of least ... more ABSTRACT We develop an almost complete theory for existence of asymptotic probabilities of least fixed point and partial fixed pint definable properties, and for the complexity of the associated almost sure theory. Our method works for any randomized class of finite structures. © 1994 John Wiley & Sons, Inc.

Bookmarks Related papers MentionsView impact

Research paper thumbnail of On the expressive power of semijoin queries

Information Processing Letters, Jul 1, 2004

Bookmarks Related papers MentionsView impact

Research paper thumbnail of On asymptotic probabilities of monadic second order properties

Lecture Notes in Computer Science, 1993

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Infinitary Queries and Their Asymptotic Probabilities I: Properties Definable in Transitive Closue Logic

Computer Science Logic, Oct 7, 1991

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Fine hierarchies of generic computation

Springer eBooks, 1997

. Suppose that you are a user of a commercial relational database,accessible over the Internet, w... more . Suppose that you are a user of a commercial relational database,accessible over the Internet, whose owner has decided to copy theprice lists of the US telephone companies --- first order queries are for freejust like local calls, because they are local by the theorem of Gaifman[6]. All recursive queries, being potentially non-local, are charged, forsimplicity let us assume $1.00 for a Boolean query. Non-Boolean queriesare certainly not allowed, because the user would require all the...

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Computer Algorithm to Detect Similar Administrative Documents from the Ur III Archives

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Database Query Processing Using Finite Cursor Machines

Springer eBooks, 2006

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Foundations of Computer Science 2008

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Petri Net + Nested Relational Calculus

Abstract. In this paper we propose a formal, graphical workflow language for dataflows, i.e., wor... more Abstract. In this paper we propose a formal, graphical workflow language for dataflows, i.e., workflows where large amounts of complex data are manipulated and the structure of the manipulated data is reflected in the structure of the workflow. It is a common extension of – Petri nets, which are responsible for the organization of the processing tasks, and – Nested relational calculus, which is a database query language over complex objects, and is responsible for handling collections of data items (in particular, for iteration) and for the typing system. We demonstrate that dataflows constructed in hierarchical manner, according to a set of refinement rules we propose, are sound: initiated with a single token (which may represent a complex scientific data collection) in the input node, terminate with a single token in the output node (which represents the output data collection). In particular they always process all of the input data, leave no ”debris data ” behind and the output ...

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Krótkie rozmowy między sumerologiem a matematykiem

Bookmarks Related papers MentionsView impact

Research paper thumbnail of The Power of Spreadsheet Computations

arXiv: Programming Languages, Jul 27, 2013

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Can we read stones? Quantifying the information loss in flintknapping

Journal of Archaeological Science, Dec 31, 2023

One of the methods of analysing the manufacturing process of lithic tools is by "reading... more One of the methods of analysing the manufacturing process of lithic tools is by "reading" the scars of removals visible on the surface of cores or bifaces. The paper aims to review the limitations of this approach, by answering the question as to how much information from the original knapping process is still preserved in the cores and bifaces. To quantify the information loss we used experimentally knapped pieces, that we then refitted to check which removals are still visible on the surface of the analysed forms. We tested different measures of information loss in the context of removals and sequences of removals, but also the chronological relationship between sequences i.e. the number of linear extensions and missing nearest connections. On average, 39.9% of the original removals and 54.1% of the sequences of removals are preserved on the surface, but only 14.1% of the original relationships between sequences can be observed. Finally, we used simple machine learning to find an algorithm for estimating the loss of the nearest chronological relationships between sequences when no refits are available. Due to the extremely high information loss for the linear order of the knapping process we: a) propose to abandon these elements of the diacritic approach which aim to reconstruct the rhythms and schemes of knapping; b) evaluate the quality of the reconstructed knapping scheme (partial order) prior to further comparative analyses. Here we propose an algorithm to estimate the number of missing connections to test the quality of the knapping process while using diacritic schemes.

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Mathematical Foundations of Computer Science 2008: 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings

Springer eBooks, Sep 25, 2008

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Mathematical Foundations of Computer Science 2008

Springer eBooks, 2008

Bookmarks Related papers MentionsView impact

Research paper thumbnail of XQTav: an XQuery processor for Taverna environment

Bioinformatics, 2006

Bookmarks Related papers MentionsView impact

Research paper thumbnail of On the expressive power of semijoin queries

arXiv (Cornell University), Aug 6, 2003

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science

Bookmarks Related papers MentionsView impact

Research paper thumbnail of The Power of Spreadsheet Computations

Fields of Logic and Computation III, 2020

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Contextual alignment of biological sequences (Extended abstract)

Bioinformatics, 2002

We present a model of contextual alignment of biological sequences. It is an extension of the cla... more We present a model of contextual alignment of biological sequences. It is an extension of the classical alignment, in which we assume that the cost of a substitution depends on the surrounding symbols. In this model the cost of transforming one sequence into another depends on the order of editing operations. We present efficient algorithms for calculating this cost, as well as reconstructing (the representation of) all the orders of operations which yield this optimal cost. A precise characterization of the families of linear orders which can emerge this way is given. Contact: jty@mimuw.edu.pl

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Aggregating over Dominated Points by Sorting, Scanning, Zip and Flat Maps

arXiv (Cornell University), May 26, 2023

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Infinitary queries and their asymptotic probabilities. II. Properties definable in least fixed point logic

Random Structures and Algorithms, 1994

ABSTRACT We develop an almost complete theory for existence of asymptotic probabilities of least ... more ABSTRACT We develop an almost complete theory for existence of asymptotic probabilities of least fixed point and partial fixed pint definable properties, and for the complexity of the associated almost sure theory. Our method works for any randomized class of finite structures. © 1994 John Wiley & Sons, Inc.

Bookmarks Related papers MentionsView impact

Research paper thumbnail of On the expressive power of semijoin queries

Information Processing Letters, Jul 1, 2004

Bookmarks Related papers MentionsView impact

Research paper thumbnail of On asymptotic probabilities of monadic second order properties

Lecture Notes in Computer Science, 1993

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Infinitary Queries and Their Asymptotic Probabilities I: Properties Definable in Transitive Closue Logic

Computer Science Logic, Oct 7, 1991

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Fine hierarchies of generic computation

Springer eBooks, 1997

. Suppose that you are a user of a commercial relational database,accessible over the Internet, w... more . Suppose that you are a user of a commercial relational database,accessible over the Internet, whose owner has decided to copy theprice lists of the US telephone companies --- first order queries are for freejust like local calls, because they are local by the theorem of Gaifman[6]. All recursive queries, being potentially non-local, are charged, forsimplicity let us assume $1.00 for a Boolean query. Non-Boolean queriesare certainly not allowed, because the user would require all the...

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Computer Algorithm to Detect Similar Administrative Documents from the Ur III Archives

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Database Query Processing Using Finite Cursor Machines

Springer eBooks, 2006

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Foundations of Computer Science 2008

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Petri Net + Nested Relational Calculus

Abstract. In this paper we propose a formal, graphical workflow language for dataflows, i.e., wor... more Abstract. In this paper we propose a formal, graphical workflow language for dataflows, i.e., workflows where large amounts of complex data are manipulated and the structure of the manipulated data is reflected in the structure of the workflow. It is a common extension of – Petri nets, which are responsible for the organization of the processing tasks, and – Nested relational calculus, which is a database query language over complex objects, and is responsible for handling collections of data items (in particular, for iteration) and for the typing system. We demonstrate that dataflows constructed in hierarchical manner, according to a set of refinement rules we propose, are sound: initiated with a single token (which may represent a complex scientific data collection) in the input node, terminate with a single token in the output node (which represents the output data collection). In particular they always process all of the input data, leave no ”debris data ” behind and the output ...

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Krótkie rozmowy między sumerologiem a matematykiem

Bookmarks Related papers MentionsView impact

Research paper thumbnail of The Power of Spreadsheet Computations

arXiv: Programming Languages, Jul 27, 2013

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Manual of Strati5

Manual of Strati5

This is the manual of Strati5 software. Unfortuntely, the rendering of Harris matrix by the onlin... more This is the manual of Strati5 software. Unfortuntely, the rendering of Harris matrix by the online variant has been made impossible due to Google security protections.

Bookmarks Related papers MentionsView impact