User talk:Jarek Duda

I was surprised to see your first article here, as I had come across your contribution at arxiv.org only a few days ago (in my effort to keep current with all Huffman-related papers). Unfortunately, I don't think this should be a Wikipedia article at this point, due to issues outlined in WP:RS#Self-published_sources, WP:SPS, and WP:N. (There is or was another policy or guideline arguing against citing one's own sources, but either I can't find it or it changed.) Basically, this topic hasn't been published in a reliable primary source, let alone a secondary source. (Reliability isn't about whether you are right or wrong, but rather about whether some level of social verification has occurred.) It comes very close to going against the spirit of Wikipedia:Wikipedia is not for things made up in school one day#The right way to get things you or your friends made up into Wikipedia, although naturally your research is at a far more advanced level than this. If you'd like to get rid of it, you can use WP:PROD to do so painlessly. If not, please provide published sources; although I really doubt that it should be its own article at this point in time, if you believe it should be, it should be brought up to snuff in terms of external citations. If this doesn't happen, someone else is liable to see the article and try to delete it via WP:AfD. Calbaer 18:18, 11 November 2007 (UTC)[reply]

I remember this first article. It did not explain concept clearly and that was the main reason for deletion of the article not because it was new and never mentioned in other sources. But times change. Now there are several successful implementations and explanations of the method that can be found via search engines. It is shown that hybrid of Huffman and ABS coding can give the encoding/decoding speed higher than in best range encoders with the same compression ratio. I believe that ABS should not be left out of scope of Wikipedia. Andrew Polar. April 09, 2008. —Preceding unsigned comment added by 63.144.61.175 (talk) 14:23, 9 April 2008 (UTC)[reply]

I have nominated Chiral life concept, an article you created, for deletion. I do not feel that this article satisfies Wikipedia's criteria for inclusion, and have explained why at Wikipedia:Articles for deletion/Chiral life concept. Your opinions on the matter are welcome at that same discussion page; also, you are welcome to edit the article to address these concerns. Thank you for your time. Dougie WII (talk) 12:00, 13 December 2007 (UTC)[reply]

Welcome!

Hello, Jarek Duda, and welcome to Wikipedia! Thank you for your contributions. I hope you like the place and decide to stay. Here are some pages that you might find helpful:

• The five pillars of Wikipedia
• Tutorial
• How to edit a page
• How to write a great article
• Manual of Style

I hope you enjoy editing here and being a Wikipedian! Please sign your messages on discussion pages using four tildes (~~~~); this will automatically insert your username and the date. If you need help, check out Wikipedia:Questions, ask me on my talk page, or ask your question on this page and then place {{helpme}} before the question. Again, welcome! -Gtstricky^{Talk or C} 19:21, 14 December 2007 (UTC)[reply]

I have nominated Asymmetric binary system, an article you created, for deletion. I do not feel that this article satisfies Wikipedia's criteria for inclusion, and have explained why at Wikipedia:Articles for deletion/Asymmetric binary system. Your opinions on the matter are welcome at that same discussion page; also, you are welcome to edit the article to address these concerns. Thank you for your time. Dougie WII (talk) 12:42, 16 December 2007 (UTC)[reply]

I deleted the page "Asymmetric numeral systems" that you created, because it's on the same topic and the community decided that it is not fit for Wikipedia. -- Jitse Niesen (talk) 12:36, 1 April 2008 (UTC)[reply]

If someone needs - for now I'm placing here the deleted article. Feel free to correct it.

The asymmetric numeral system is generalization of numeral system which are optimal to encode sequence of digits which has equal probability. In asymmetric case we can freely manipulate this probability distribution.

In the binary system, when we have some information stored in a natural number ${\displaystyle x'}$ and we want to insert there information stored in a binary digit ${\displaystyle b}$, we can put it ont the least important position:

${\displaystyle x=code_{1/2}(b,x'):=2\cdot x'+b}$.

Now having ${\displaystyle x}$ we can easily restore x', ${\displaystyle d}$

${\displaystyle (b,x')=decode_{1/2}(x):=(x\mod 2,\lfloor x/2\rfloor )}$

So these operations are reverses of each other.

We can generalize it to any probability distribution, denote ${\displaystyle q\in (0,1)}$ - probability of '1'

${\displaystyle code_{q}(0,x'):=\lfloor {\frac {x'}{1-q}}\rfloor }$

${\displaystyle code_{q}(1,x'):=\lceil {\frac {x'+1}{q}}\rceil -1}$

${\displaystyle decode_{q}(x):=(b,x_{b})}$

where

${\displaystyle b=\lfloor ((x+1)q)\rfloor -\lfloor (xq)\rfloor }$

${\displaystyle x_{1}=\lfloor xq\rfloor }$

${\displaystyle x_{0}=x-\lfloor xq\rfloor }$

When ${\displaystyle q=1/2}$ we get standard binary system.

These operations are reverses of each other and numbers that will give '1', are distributed uniformly among the natural numbers with the probability of '1' equals ${\displaystyle q}$ ^[1].

For example look on the table for ${\displaystyle q=0.3}$,

${\displaystyle x=18\leftrightarrow (x'=13,d=0)}$

${\displaystyle (11,)\leftrightarrow (8,0),\leftrightarrow (6,00),\leftrightarrow (1,001)\leftrightarrow (0,0010)}$

A symbol ${\displaystyle s}$ having probability ${\displaystyle q_{s}}$ contains ${\displaystyle \lg(1/q_{s})}$ bits of information. In ${\displaystyle x}$ is stored about ${\displaystyle \lg(x)}$ bits.

So as in asymmetric binary system, we should have, that

${\displaystyle x_{s}\ \ \ is\ approximately\ \ \ x\cdot q_{s}}$

To use asymmetric numeral systems for data compression, we can enforce ${\displaystyle x}$ to stay in some range, for example ${\displaystyle x\in I:=[2^{R},2^{R+1}-1]}$. Now if after decoding we get ${\displaystyle x<2^{R}}$, we can transfer bits from input to the least important bits of ${\displaystyle x}$ to get it back to ${\displaystyle I}$. So before encoding we have to transfer some bits to output, that after encoding we will get back to ${\displaystyle I}$.

Practical problem is that decoded and encoded bits are in the reverse order - to use probability prediction methods, we have to make the prediction to the end, than encode in backward order. Now decompression is straightforward. In Matt Mahoney's implementations ^[2] the data is divided into compressed separately segments, for which we store q from the prediction process.

Asymmetric numeral systems works similar as arithmetic coding, but instead of dividing the range into two subranges, we distribute symbols uniformly over the whole range. Intuitively - we place information on the least important position instead of on the most important.

There are not known practical formulas for larger number of symbols than two, but in fact we only have to define these function on the range (${\displaystyle I}$), such that

${\displaystyle x_{s}\ \ \ is\ approximately\ \ \ x\cdot q_{s}}$

To do this we have to distribute symbols on the range, correspondingly to the probability distribution. We can do it using statistical algorithms.

• Arithmetic coding

• "Data compression using asymmetric numeral systems", The Wolfram Demonstrations Project
• Asymmetric binary system on Andrew Polar site
• Data compression news

Category:Non-standard positional numeral systems Category:Lossless compression algorithms

Your upload of File:Complex base draw.jpg or contribution to its description is noted, and thanks (even if belatedly) for your contribution. In order to help make better use of the media, an attempt has been made by an automated process to identify and add certain information to the media's description page.

This notification is placed on your talk page because a bot has identified you either as the uploader of the file, or as a contributor to its metadata. It would be appreciated if you could carefully review the information the bot added. To opt out of these notifications, please follow the instructions here. Thanks! Message delivered by Theo's Little Bot (opt-out) 15:07, 21 May 2014 (UTC)[reply]

Hello, I'm DVdm. I noticed that you made a change to an article, Electron, but you didn't provide a source. I’ve removed it for now, but if you’d like to include a citation to a reliable source and re-add it, please do so! If you think I made a mistake, or if you have any questions, you can leave me a message on my talk page. Thanks. DVdm (talk) 17:54, 2 April 2018 (UTC)[reply]

Hello, Jarek Duda. It has been over six months since you last edited the Articles for Creation submission or Draft page you started, "Yann Collet".

In accordance with our policy that Wikipedia is not for the indefinite hosting of material deemed unsuitable for the encyclopedia mainspace, the draft has been deleted. If you plan on working on it further and you wish to retrieve it, you can request its undeletion by following the instructions at this link. An administrator will, in most cases, restore the submission so you can continue to work on it.

Thanks for your submission to Wikipedia, and happy editing. Liz ^{Read! Talk!} 15:14, 17 June 2020 (UTC)[reply]

Please refrain from using talk pages such as Talk:Fermi paradox for general discussion of the topic or other unrelated topics. They are for discussion related to improving the article in specific ways, based on reliable sources and the project policies and guidelines; they are not for use as a forum or chat room. If you have specific questions about certain topics, consider visiting our reference desk and asking them there instead of on article talk pages. See here for more information. Thank you. –LaundryPizza03 (dc̄) 05:00, 15 June 2021 (UTC)[reply]

Fermi paradox, among others, concerns civilization ending mechanisms: https://en.wikipedia.org/wiki/Fermi_paradox#It_is_the_nature_of_intelligent_life_to_destroy_itself I have provided well documented example from our civilization: Bitcoin price has grown x2 per year for the last 6 years, and if it will continue this trend for the next 6 years, it will exceed half of world energy production. I have asked if such positive feedback mechanisms can be always stopped by a civilization - used the Talk Page not for a "general discussion of the topic or other unrelated topics", but to ask if this mechanism is worth including in Fermi Paradox article for specified Section: "It is the nature of intelligent life to destroy itself". --Jarek Duda (talk) 06:17, 15 June 2021 (UTC)[reply]