<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>DEV Community: AndreiKeino</title>
    <description>The latest articles on DEV Community by AndreiKeino (@andreikeino).</description>
    <link>https://dev.to/andreikeino</link>
    <image>
      <url>https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F1017845%2F3511fa1d-7a62-46e0-a1e5-72d6cad02e87.png</url>
      <title>DEV Community: AndreiKeino</title>
      <link>https://dev.to/andreikeino</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/andreikeino"/>
    <language>en</language>
    <item>
      <title>playground demo website on a free hosting for &lt;&lt;The effective algorithm for constant state detection in time series&gt;&gt; article</title>
      <dc:creator>AndreiKeino</dc:creator>
      <pubDate>Sat, 29 Mar 2025 11:36:05 +0000</pubDate>
      <link>https://dev.to/andreikeino/playground-demo-website-on-a-free-hosting-for-the-effective-algorithm-for-constant-state-4n3o</link>
      <guid>https://dev.to/andreikeino/playground-demo-website-on-a-free-hosting-for-the-effective-algorithm-for-constant-state-4n3o</guid>
      <description>&lt;p&gt;Hello, &lt;br&gt;
Just published playground demo website on a free hosting for &amp;lt;
detection in time series&amp;gt;&amp;gt; article. You can test the algorithm on this website and see how it works.&lt;/p&gt;

&lt;p&gt;Playground url:&lt;br&gt;
&lt;a href="http://andreikeino.somee.com/" rel="noopener noreferrer"&gt;http://andreikeino.somee.com/&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;Article abstract:&lt;br&gt;
The article introduces a simple and effective algorithm for constant state detection in the time series. &lt;br&gt;
The algorithm, based on the sliding window of variable length, finds all the sections of the time series &lt;br&gt;
which have length greater or equal than some given minimal length and have difference between maximal and &lt;br&gt;
minimal value in the section less or equal than some given value. It is shown that the computational &lt;br&gt;
complexity of the aforementioned algorithm is O(N log N), where N is the length of time series.&lt;/p&gt;

&lt;p&gt;Article url: &lt;/p&gt;

&lt;p&gt;&lt;a href="https://figshare.com/articles/preprint/The_effective_algorithm_for_constant_state_detection_in_time_series_V_2_3_/28375532?file=52535228" rel="noopener noreferrer"&gt;https://figshare.com/articles/preprint/The_effective_algorithm_for_constant_state_detection_in_time_series_V_2_3_/28375532?file=52535228&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;Thank you.&lt;/p&gt;

&lt;p&gt;&lt;a href="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fv9dvbe4dqdzipa9o06po.jpg" class="article-body-image-wrapper"&gt;&lt;img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fv9dvbe4dqdzipa9o06po.jpg" alt="Image description" width="800" height="568"&gt;&lt;/a&gt;&lt;/p&gt;

</description>
      <category>algorithms</category>
    </item>
    <item>
      <title>[Boost]</title>
      <dc:creator>AndreiKeino</dc:creator>
      <pubDate>Thu, 20 Feb 2025 01:37:19 +0000</pubDate>
      <link>https://dev.to/andreikeino/-2l2n</link>
      <guid>https://dev.to/andreikeino/-2l2n</guid>
      <description>&lt;div class="ltag__link"&gt;
  &lt;a href="/andreikeino" class="ltag__link__link"&gt;
    &lt;div class="ltag__link__pic"&gt;
      &lt;img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F1017845%2F3511fa1d-7a62-46e0-a1e5-72d6cad02e87.png" alt="andreikeino"&gt;
    &lt;/div&gt;
  &lt;/a&gt;
  &lt;a href="https://dev.to/andreikeino/the-effective-algorithm-for-constant-state-detection-in-time-series-2doo" class="ltag__link__link"&gt;
    &lt;div class="ltag__link__content"&gt;
      &lt;h2&gt;The effective algorithm for constant state detection in time series&lt;/h2&gt;
      &lt;h3&gt;AndreiKeino ・ Feb 9&lt;/h3&gt;
      &lt;div class="ltag__link__taglist"&gt;
        &lt;span class="ltag__link__tag"&gt;#algorithms&lt;/span&gt;
      &lt;/div&gt;
    &lt;/div&gt;
  &lt;/a&gt;
&lt;/div&gt;


</description>
      <category>algorithms</category>
    </item>
    <item>
      <title>The effective algorithm for constant state detection in time series</title>
      <dc:creator>AndreiKeino</dc:creator>
      <pubDate>Sun, 09 Feb 2025 05:20:53 +0000</pubDate>
      <link>https://dev.to/andreikeino/the-effective-algorithm-for-constant-state-detection-in-time-series-2doo</link>
      <guid>https://dev.to/andreikeino/the-effective-algorithm-for-constant-state-detection-in-time-series-2doo</guid>
      <description>&lt;p&gt;Hello, &lt;br&gt;
updated description of my effective algorithm for constant state detection in time series is here:&lt;/p&gt;

&lt;p&gt;&lt;a href="https://figshare.com/articles/preprint/The_effective_algorithm_for_constant_state_detection_in_time_series_V_2_3_/28375532?file=52219271" rel="noopener noreferrer"&gt;https://figshare.com/articles/preprint/The_effective_algorithm_for_constant_state_detection_in_time_series_V_2_3_/28375532?file=52219271&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;The effective algorithm for constant state detection in time series.&lt;/p&gt;

&lt;p&gt;The article introduces simple and effective algorithm for constant state detection in time series. The algorithm, based on sliding window of variable length, searches a sections of time series with some given minimal length, that have all the values in some given range. It is shown that the computational complexity of aforementioned algorithm is O(N log N), where N is the length of time series.&lt;/p&gt;

&lt;p&gt;Thank you,&lt;/p&gt;

&lt;p&gt;Andrei Keino&lt;/p&gt;

</description>
      <category>algorithms</category>
    </item>
    <item>
      <title>Camex (Computational Applied Mathematics EXamples) project on github.</title>
      <dc:creator>AndreiKeino</dc:creator>
      <pubDate>Sat, 18 Feb 2023 04:03:10 +0000</pubDate>
      <link>https://dev.to/andreikeino/camex-computational-applied-mathematics-examples-project-on-github-4ibc</link>
      <guid>https://dev.to/andreikeino/camex-computational-applied-mathematics-examples-project-on-github-4ibc</guid>
      <description>&lt;p&gt;A couple of years ago I've submitted a project on github. It's called Camex  (Computational Applied Mathematics EXamples) and is developed with Python/PyQt/PyQtWebKit/Python Console and intended to be a collection of applied math or algorithm processing examples with GUI for user input, web browser to show documentation to explain the essence of given example and python console to show algorithm output.&lt;br&gt;
&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--eLKCilv7--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/dony2nyevv9ednzve9wf.jpg" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--eLKCilv7--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/dony2nyevv9ednzve9wf.jpg" alt="Camex image" width="871" height="853"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;The code isn't great but it works; also the code is easy to understand. If somebody is interested to add some plugins/examples to it, you're welcome!&lt;/p&gt;

&lt;p&gt;&lt;a href="https://github.com/AndreiKeino/camex"&gt;The repo is here&lt;/a&gt;&lt;/p&gt;

</description>
    </item>
    <item>
      <title>CSharp-like-properties-in-python</title>
      <dc:creator>AndreiKeino</dc:creator>
      <pubDate>Tue, 31 Jan 2023 05:24:19 +0000</pubDate>
      <link>https://dev.to/andreikeino/csharp-like-properties-in-python-2i1i</link>
      <guid>https://dev.to/andreikeino/csharp-like-properties-in-python-2i1i</guid>
      <description>&lt;p&gt;&lt;strong&gt;Properties in python that looks a bit like C# ones&lt;/strong&gt;&lt;br&gt;
These can be though of as an alternative implementation of the @property decorator.&lt;br&gt;
&lt;strong&gt;Pros:&lt;/strong&gt;&lt;br&gt;
&lt;em&gt;1. A bit less of typing.&lt;/em&gt;&lt;br&gt;
&lt;em&gt;2. Better code structuring.&lt;/em&gt;&lt;br&gt;
&lt;em&gt;3. More error-prone, as getter/setter/deleter names are predetermined.&lt;/em&gt;&lt;br&gt;
&lt;strong&gt;Cons:&lt;/strong&gt;&lt;br&gt;
&lt;em&gt;1. The implementation can miss something that can be done with good old property declaration.&lt;/em&gt;&lt;br&gt;
&lt;em&gt;2. A lot of things works "behind the scene", i.e. implicitly.&lt;/em&gt;&lt;br&gt;
&lt;a href="https://github.com/AndreiKeino/CSharp-like-properties-in-python" rel="noopener noreferrer"&gt;github page&lt;/a&gt;&lt;/p&gt;

</description>
      <category>crypto</category>
      <category>web3</category>
      <category>blockchain</category>
      <category>offers</category>
    </item>
  </channel>
</rss>
