Wyszukiwarka
Wyniki wyszukiwania dla: INFORMATION THEORY
-
Towards an experience based collective computational intelligence for manufacturing
PublikacjaKnowledge based support can play a vital role not only in the new fast emerging information and communication technology based industry, but also in traditional manufacturing. In this regard, several domain specific research endeavors have taken place in the past with limited success. Thus, there is a need to develop a flexible domain independent mechanism to capture, store, reuse, and share manufacturing knowledge. Consequently,...
-
Some Exact Values of Shannon Capacity for Evolving Systems
PublikacjaWe describe the notion of Shannon Capacity for evolving channels. Furthermore, using a computer search together with some theoretical results we establish some exact values of the measure.
-
On the Origin of Protein Superfamilies and Superfolds
PublikacjaDistributions of protein families and folds in genomes are highly skewed, having a small number of prevalent superfamiles/superfolds and a large number of families/folds of a small size. Why are the distributions of protein families and folds skewed? Why are there only a limited number of protein families? Here, we employ an information theoretic approach to investigate the protein sequence-structure relationship that leads to...
-
Limiting distribution of Lempel Ziv'78 redundancy
PublikacjaWe show that the Lempel Ziv'78 redundancy rate tends to a Gaussian distribution for memoryless sources. We accomplish it by extending findings from our 1995 paper [3]. We present a new simplified proof of the Central Limit Theorem for the number of phrases in the LZ'78 algorithm. As in our 1995 paper, here we first analyze the asymptotic behavior of the total path length in a digital search tree (a DST) built from independent sequences....
-
On the Limiting distribution of Lempel Ziv'78 Redundancy for Memoryles Sources
PublikacjaWe show that the Lempel Ziv'78 redundancy rate tends to a Gaussian distribution for memoryless sources. We accomplish it by extending findings from our 1995 paper [3]. We present a new simplified proof of the Central Limit Theorem for the number of phrases in the LZ'78 algorithm. As in our 1995 paper, here we first analyze the asymptotic behavior of the total path length in a digital search tree (a DST) built from independent sequences....
-
Phase Transition in a Sequence-Structure Channel
PublikacjaWe study an interesting channel which maps binary sequences to self-avoiding walks in the two-dimensional grid, inspired by a model of protein folding from statistical physics. The channel is characterized by a Boltzmann/Gibbs distribution with a free parameter corresponding to temperature. We estimate the conditional entropy between the input sequence and the output fold, giving an upper bound which exhibits an unusual phase transition...
-
Piotr Szczuko dr hab. inż.
OsobyDr hab. inż. Piotr Szczuko w 2002 roku ukończył studia na Wydziale Elektroniki, Telekomunikacji i Informatyki Politechniki Gdańskiej zdobywając tytuł magistra inżyniera. Tematem pracy dyplomowej było badanie zjawisk jednoczesnej percepcji obrazu cyfrowego i dźwięku dookólnego. W roku 2008 obronił rozprawę doktorską zatytułowaną "Zastosowanie reguł rozmytych w komputerowej animacji postaci", za którą otrzymał nagrodę Prezesa Rady...
-
Aleksandra Parteka dr hab. inż.
OsobyAbout me: I am an associate professor and head of doctoral studies at the Faculty of Management and Economics, Gdansk University of Technology (GdanskTech, Poland). I got my MSc degree in Economics from Gdansk University of Technology (2003) and Universita’ Politecnica delle Marche (2005), as well as MA degree in Contemporary European Studies from Sussex University (2006, with distinction). I received my PhD in Economics...