<?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom"><title>Volodymyr Obrizan: personal website - 25</title><link href="https://obrizan.com/" rel="alternate"></link><link href="https://obrizan.com/feeds/25.atom.xml" rel="self"></link><id>https://obrizan.com/</id><updated>2016-09-25T18:27:00+03:00</updated><entry><title>KhNURE’s Achievements on the Market</title><link href="https://obrizan.com/blog/khnures-achievements-on-the-market/" rel="alternate"></link><published>2016-09-25T18:27:00+03:00</published><updated>2016-09-25T18:27:00+03:00</updated><author><name>Volodymyr Obrizan</name></author><id>tag:obrizan.com,2016-09-25:/blog/khnures-achievements-on-the-market/</id><summary type="html">&lt;p&gt;Recently I came across a recording of a roundtable on the strategy for Kharkiv’s development, in particular IT technologies. During the discussion, KhNURE employees disclose financial figures. See the excerpt from 30:00.&lt;/p&gt;
&lt;iframe src="https://www.youtube.com/embed/WwhS3q3OYYk" width="560" height="315" style="width: 100%; height: auto; aspect-ratio: 16 / 9;" title="YouTube video player" loading="lazy" allow="accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share" allowfullscreen&gt;&lt;/iframe&gt;

&lt;p&gt;Transcript:&lt;/p&gt;
&lt;p&gt;Eduard Samson:&lt;br&gt;
— Look at the volume of industry-funded research topics or contracts. Do you know …&lt;/p&gt;</summary><content type="html">&lt;p&gt;Recently I came across a recording of a roundtable on the strategy for Kharkiv’s development, in particular IT technologies. During the discussion, KhNURE employees disclose financial figures. See the excerpt from 30:00.&lt;/p&gt;
&lt;iframe src="https://www.youtube.com/embed/WwhS3q3OYYk" width="560" height="315" style="width: 100%; height: auto; aspect-ratio: 16 / 9;" title="YouTube video player" loading="lazy" allow="accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share" allowfullscreen&gt;&lt;/iframe&gt;

&lt;p&gt;Transcript:&lt;/p&gt;
&lt;p&gt;Eduard Samson:&lt;br&gt;
— Look at the volume of industry-funded research topics or contracts. Do you know the figure for your university?&lt;br&gt;
Stanislav Ignatiev:&lt;br&gt;
— Yes, of course.&lt;br&gt;
— And how much is it?&lt;br&gt;
— Last year it was 12 million. Those are state-budget-funded topics.&lt;br&gt;
— No, no, no, industry-funded! State-budget-funded is what I said.&lt;br&gt;
— This year, less than half a million. &lt;br&gt;
— Less than half a million? Well, let’s divide that by 25. Twenty thousand. A cheap car. And this huge university earned 20,000 dollars on the market!&lt;/p&gt;
&lt;p&gt;What is this about? University employees get their salaries from the state budget for education and science. They get, of course, a humiliatingly small amount. For example, a full-time senior lecturer takes home around 2,800 hryvnias. But the university can carry out independent commercial activity. In the dialogue, that is “industry-funded research topics.” The law does not forbid a university from going to the market, selling its services or goods there at market prices, and paying university employees market salaries. But in 25 years of independence and a market economy, the university still hasn’t managed to restructure itself.&lt;/p&gt;</content><category term="25"></category></entry><entry><title>Richard Sheridan’s Book “Joy, Inc.”</title><link href="https://obrizan.com/blog/richard-sheridans-book-joy-inc/" rel="alternate"></link><published>2016-01-25T22:40:00+02:00</published><updated>2016-01-25T22:40:00+02:00</updated><author><name>Volodymyr Obrizan</name></author><id>tag:obrizan.com,2016-01-25:/blog/richard-sheridans-book-joy-inc/</id><summary type="html">&lt;p&gt;I recently read Richard Sheridan’s book “&lt;a href="http://www.mann-ivanov-ferber.ru/books/rabota_mechti/"&gt;Joy, Inc.&lt;/a&gt;” (93 UAH in electronic form).&lt;/p&gt;
&lt;p&gt;&lt;img alt="image" src="https://obrizan.com/images/livejournal/2016/01/25/kniga-rabota-mechty-richarda-sheridana/27997-original-c59be32fa9ab6386.png"&gt;&lt;/p&gt;
&lt;p&gt;In the book, Richard Sheridan talks about the history and day-to-day life of his company, &lt;a href="https://www.menloinnovations.com"&gt;Menlo Innovations&lt;/a&gt;", where he works as director and founder. &lt;/p&gt;
&lt;p&gt;Hands up, who has their dream job? Yeah, a forest of hands …&lt;/p&gt;</summary><content type="html">&lt;p&gt;I recently read Richard Sheridan’s book “&lt;a href="http://www.mann-ivanov-ferber.ru/books/rabota_mechti/"&gt;Joy, Inc.&lt;/a&gt;” (93 UAH in electronic form).&lt;/p&gt;
&lt;p&gt;&lt;img alt="image" src="https://obrizan.com/images/livejournal/2016/01/25/kniga-rabota-mechty-richarda-sheridana/27997-original-c59be32fa9ab6386.png"&gt;&lt;/p&gt;
&lt;p&gt;In the book, Richard Sheridan talks about the history and day-to-day life of his company, &lt;a href="https://www.menloinnovations.com"&gt;Menlo Innovations&lt;/a&gt;", where he works as director and founder. &lt;/p&gt;
&lt;p&gt;Hands up, who has their dream job? Yeah, a forest of hands. Well then, read how Sheridan did it.&lt;/p&gt;
&lt;p&gt;His company does custom software development. One striking feature: they practice pair programming. And not the way you do it once a year, but every day. That is, this company has exactly half as many computers as employees. What’s more, the pairs change every week. This way, after a month, every person on the project knows every part of the system. &lt;/p&gt;
&lt;p&gt;How does this affect employee happiness? Very simply: at the very least, you can go on vacation at any moment; you will never be the one person who knows a key part of the system and without whom it’s impossible to do a release. Secondly, with pair programming, the quality of implementation gets much better. In the end, everyone is happy. &lt;/p&gt;
&lt;p&gt;Overall, it was interesting to read about this and a lot more. For company directors and founders — strictly required reading.&lt;/p&gt;</content><category term="25"></category></entry><entry><title>Summary of the Twelfth Meeting of the "Python at APVT" Club</title><link href="https://obrizan.com/blog/summary-of-the-twelfth-meeting-of-the-python-at-apvt-club/" rel="alternate"></link><published>2016-01-25T16:00:00+02:00</published><updated>2016-01-25T16:00:00+02:00</updated><author><name>Volodymyr Obrizan</name></author><id>tag:obrizan.com,2016-01-25:/blog/summary-of-the-twelfth-meeting-of-the-python-at-apvt-club/</id><summary type="html">&lt;p&gt;On January 23, 2016, the twelfth meeting of the "Python at APVT" club took place. The meeting was held in room 318 from 11:15 to 13:00.&lt;/p&gt;
&lt;p&gt;We discussed the basic principles of project management:&lt;/p&gt;
&lt;ol&gt;
&lt;li&gt;Projects should be done in pairs.  &lt;/li&gt;
&lt;li&gt;Use open repositories.   &lt;/li&gt;
&lt;li&gt;Do code reviews.  &lt;/li&gt;
&lt;li&gt;Write tests …&lt;/li&gt;&lt;/ol&gt;</summary><content type="html">&lt;p&gt;On January 23, 2016, the twelfth meeting of the "Python at APVT" club took place. The meeting was held in room 318 from 11:15 to 13:00.&lt;/p&gt;
&lt;p&gt;We discussed the basic principles of project management:&lt;/p&gt;
&lt;ol&gt;
&lt;li&gt;Projects should be done in pairs.  &lt;/li&gt;
&lt;li&gt;Use open repositories.   &lt;/li&gt;
&lt;li&gt;Do code reviews.  &lt;/li&gt;
&lt;li&gt;Write tests. &lt;/li&gt;
&lt;/ol&gt;
&lt;p&gt;The meeting minutes were recorded on http://python.mass.education/project&lt;/p&gt;
&lt;p&gt;The main question: "Where to start?" Answer: &lt;/p&gt;
&lt;ol&gt;
&lt;li&gt;Installing Python 2.7.  &lt;/li&gt;
&lt;li&gt;Installing a development environment, for example, PyCharm.   &lt;/li&gt;
&lt;li&gt;Installing the Google App Engine Python SDK: https://cloud.google.com/appengine/downloads?hl=en  &lt;/li&gt;
&lt;li&gt;Going through the GAE tutorial: https://cloud.google.com/appengine/docs/python/gettingstartedpython27/usingwebapp&lt;/li&gt;
&lt;/ol&gt;
&lt;p&gt;This should be enough for the first week.&lt;/p&gt;
&lt;p&gt;Among the proposed projects:&lt;/p&gt;
&lt;ol&gt;
&lt;li&gt;A simple blog.  &lt;/li&gt;
&lt;li&gt;An online store.  &lt;/li&gt;
&lt;li&gt;A wiki.  &lt;/li&gt;
&lt;li&gt;Online checking of Python assignments.&lt;/li&gt;
&lt;/ol&gt;
&lt;p&gt;At the next meeting, the teams will talk about their progress. &lt;/p&gt;
&lt;p&gt;Good luck! :)&lt;/p&gt;
&lt;hr&gt;
&lt;p&gt;&lt;strong&gt;Previous meetings:&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;No. 11 09.01.2016 &lt;a href="https://obrizan.com/blog/summary-of-the-eleventh-meeting-of-the-python-at-apvt-club/"&gt;Summary of the Eleventh Meeting of the "Python at APVT" Club&lt;/a&gt;&lt;br&gt;
No. 8, No. 9, No. 10 12.12.2015, 19.12.2015, 26.12.2015 &lt;a href="https://obrizan.com/blog/summary-of-the-eighth-ninth-and-tenth-meetings-of-the-python-at-apvt-club/"&gt;Summary of the Eighth, Ninth, and Tenth Meetings of the "Python at APVT" Club&lt;/a&gt;&lt;br&gt;
No. 7 05.12.2015 &lt;a href="https://obrizan.com/blog/summary-of-the-seventh-meeting-of-the-python-at-apvt-club/"&gt;Summary of the Seventh Meeting of the "Python at APVT" Club&lt;/a&gt;&lt;br&gt;
No. 6 28.11.2015 &lt;a href="https://obrizan.com/blog/summary-of-the-sixth-meeting-of-the-python-at-apvt-club/"&gt;Summary of the Sixth Meeting of the "Python at APVT" Club&lt;/a&gt;&lt;br&gt;
No. 5 21.11.2015 &lt;a href="https://obrizan.com/blog/summary-of-the-fifth-meeting-of-the-python-at-apvt-club/"&gt;Summary of the Fifth Meeting of the "Python at APVT" Club&lt;/a&gt;&lt;br&gt;
No. 3, No. 4 07.11.2015, 14.11.2015 &lt;a href="https://obrizan.com/blog/summary-of-the-third-and-fourth-meetings-of-the-python-at-apvt-club/"&gt;Summary of the Third and Fourth Meetings of the "Python at APVT" Club&lt;/a&gt;&lt;br&gt;
No. 2 31.10.2015 &lt;a href="https://obrizan.com/blog/summary-of-the-second-meeting-of-the-python-at-apvt-club/"&gt;Summary of the Second Meeting of the "Python at APVT" Club&lt;/a&gt;&lt;br&gt;
No. 1 24.10.2015 &lt;a href="https://obrizan.com/blog/the-first-meeting-of-the-python-at-apvt-club-took-place-summary/"&gt;The first meeting of the "Python at APVT" club took place. Summary&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;How to get news about meetings of the "Python at APVT" club?&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;Subscription to news about meetings of the "Python at APVT" club: http://bit.ly/python-apvt-reg The mailing list will be the main channel for information about meetings. &lt;/p&gt;
&lt;p&gt;VKontakte and Facebook groups: https://vk.com/python.apvt and https://www.facebook.com/groups/python.apvt respectively. &lt;/p&gt;
&lt;p&gt;A Q&amp;amp;A site about Python and the club: http://bit.ly/python-apvt-qa&lt;/p&gt;
&lt;p&gt;Questions? You can contact me personally: volodymyr.obrizan@gmail.com&lt;/p&gt;</content><category term="25"></category></entry><entry><title>The first meeting of the "Python at APVT" club took place. Summary</title><link href="https://obrizan.com/blog/the-first-meeting-of-the-python-at-apvt-club-took-place-summary/" rel="alternate"></link><published>2015-10-25T16:23:00+02:00</published><updated>2015-10-25T16:23:00+02:00</updated><author><name>Volodymyr Obrizan</name></author><id>tag:obrizan.com,2015-10-25:/blog/the-first-meeting-of-the-python-at-apvt-club-took-place-summary/</id><summary type="html">&lt;p&gt;On October 24, 2015, the first meeting of the "Python at APVT" club took place. The meeting was held in room 318 of the APVT department from 11:15 to 12:50. &lt;/p&gt;
&lt;p&gt;At the beginning, everyone introduced themselves and talked about their relationship with Python. I was pleasantly surprised to …&lt;/p&gt;</summary><content type="html">&lt;p&gt;On October 24, 2015, the first meeting of the "Python at APVT" club took place. The meeting was held in room 318 of the APVT department from 11:15 to 12:50. &lt;/p&gt;
&lt;p&gt;At the beginning, everyone introduced themselves and talked about their relationship with Python. I was pleasantly surprised to see not only people just starting to learn this language, but also guys with more than 5 years of experience. &lt;/p&gt;
&lt;p&gt;The day before, I tried my luck and wrote to Guido van Rossum — the inventor of the Python language — asking him to write a short address on the occasion of the club’s founding.&lt;/p&gt;
&lt;p&gt;&lt;img alt="image" src="https://obrizan.com/images/livejournal/2015/10/25/sostoyalas-pervaya-vstrecha-kluba-piton-na-apvt-rezyume/14545-original-ef60f4ad3f460b50.png"&gt;&lt;/p&gt;
&lt;p&gt;And Guido replied:&lt;/p&gt;
&lt;p&gt;&lt;img alt="image" src="https://obrizan.com/images/livejournal/2015/10/25/sostoyalas-pervaya-vstrecha-kluba-piton-na-apvt-rezyume/14759-original-bc8f6053bf7314c7.png"&gt;&lt;/p&gt;
&lt;p&gt;The patriarch’s blessing had been received; we could begin.&lt;/p&gt;
&lt;p&gt;Brief notes on what we discussed at the meeting.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Principles of the club’s work&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;— active self-education versus passive contemplation;&lt;br&gt;
— organizing horizontal connections among club members.&lt;/p&gt;
&lt;p&gt;Let me emphasize once again — there will be no lectures or labs. There will be short talks and master classes. The main focus is self-education and communication with like-minded people.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Course on Coursera&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;On October 27, a free online course starts on Coursera: https://www.coursera.org/learn/python We recommended registering for this course and starting to take it. The level is beginner; no knowledge of the language is required in order to start studying it.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Books&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;Mark Lutz, "Learning Python", 1280 pp. Market price: 1200 UAH. A very thick book with a detailed presentation.&lt;/p&gt;
&lt;p&gt;&lt;img alt="image" src="https://obrizan.com/images/livejournal/2015/10/25/sostoyalas-pervaya-vstrecha-kluba-piton-na-apvt-rezyume/15008-original-665bca300f692118.jpg"&gt;&lt;/p&gt;
&lt;p&gt;&lt;a href="http://www.mann-ivanov-ferber.ru/books/programmirovanie-dlya-detej/"&gt;"Programming for Kids. An Illustrated Guide to the Scratch and Python Languages"&lt;/a&gt;. An approach to learning the language with illustrations and explanations. I have already done a short &lt;a href="https://obrizan.com/blog/books-about-computers-and-programming-for-kids/"&gt;review of this book&lt;/a&gt;. Market price of the book: 550 UAH.&lt;/p&gt;
&lt;p&gt;&lt;img alt="image" src="https://obrizan.com/images/livejournal/2015/10/25/sostoyalas-pervaya-vstrecha-kluba-piton-na-apvt-rezyume/15160-original-384d3f4a7d29870f.png"&gt;&lt;/p&gt;
&lt;p&gt;Mark Pilgrim’s "Dive into Python" and its Russian translation: &lt;a href="http://ru.diveintopython.net/toc.html"&gt;"Into the Depths of the Python Language"&lt;/a&gt;. Online book, free.&lt;/p&gt;
&lt;p&gt;Kenneth Lambert, “Fundamentals of Python: From First Programs Through Data Structures.”&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Software&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;Installing the Python interpreter: http://www.python.org It is available for any platform. It is preferable to install the very latest version of the language: 3.5. You need to learn this version of the language, but be ready to adapt in some respects to version 2.6 or 2.7. It is important to write code in a style that is supported by all versions of the language.&lt;/p&gt;
&lt;p&gt;Recommended development environment: &lt;a href="https://www.jetbrains.com/pycharm-edu/whatsnew/"&gt;JetBrains PyCharm Edu&lt;/a&gt;. This is a free development environment; it includes 50 simple beginner-level exercises for learning the basics of the language.&lt;/p&gt;
&lt;iframe src="https://www.youtube.com/embed/GRCqGf9XTGk" width="560" height="315" style="width: 100%; height: auto; aspect-ratio: 16 / 9;" title="YouTube video player" loading="lazy" allow="accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share" allowfullscreen&gt;&lt;/iframe&gt;

&lt;p&gt;You can use any other development environments, including a simple console. &lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Where to ask questions?&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;In English, you can ask questions on http://www.stackoverflow.com Russian equivalent: http://ru.stackoverflow.com&lt;/p&gt;
&lt;p&gt;A mailing list has been created where people can communicate in a closer circle: https://groups.google.com/forum/#!forum/pythonapvt You can ask questions both by email and through the web interface. Please subscribe. &lt;/p&gt;
&lt;p&gt;Group photo as a keepsake:&lt;/p&gt;
&lt;p&gt;&lt;img alt="image" src="https://obrizan.com/images/livejournal/2015/10/25/sostoyalas-pervaya-vstrecha-kluba-piton-na-apvt-rezyume/15591-original-b869bd02d9d34166.jpg"&gt;&lt;/p&gt;
&lt;hr&gt;
&lt;p&gt;&lt;strong&gt;How to get news about meetings of the "Python at APVT" club?&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;Subscription to news about meetings of the "Python at APVT" club: http://bit.ly/python-apvt-reg The mailing list will be the main channel for information about meetings. &lt;/p&gt;
&lt;p&gt;VKontakte and Facebook groups: https://vk.com/python.apvt and https://www.facebook.com/groups/python.apvt, respectively. &lt;/p&gt;
&lt;p&gt;Site for questions and answers about Python and the club: https://groups.google.com/forum/#!forum/pythonapvt&lt;/p&gt;
&lt;p&gt;Questions? You can contact me personally: volodymyr.obrizan@gmail.com&lt;/p&gt;</content><category term="25"></category></entry><entry><title>How Is VKontakte Technologically Better Than Facebook?</title><link href="https://obrizan.com/blog/how-is-vkontakte-technologically-better-than-facebook/" rel="alternate"></link><published>2015-07-25T19:46:00+03:00</published><updated>2015-07-25T19:46:00+03:00</updated><author><name>Volodymyr Obrizan</name></author><id>tag:obrizan.com,2015-07-25:/blog/how-is-vkontakte-technologically-better-than-facebook/</id><summary type="html">&lt;p&gt;Few people know that Facebook is a service for feeding the masses shit with a shovel. The shovel is so big that there is enough for everyone, and so there is only one. You have only the illusion of content personalization based on your likes and friends. But in reality …&lt;/p&gt;</summary><content type="html">&lt;p&gt;Few people know that Facebook is a service for feeding the masses shit with a shovel. The shovel is so big that there is enough for everyone, and so there is only one. You have only the illusion of content personalization based on your likes and friends. But in reality there is no personalization at all, and if you want it, you will simply be denied the service of any content whatsoever. &lt;/p&gt;
&lt;p&gt;By default, Facebook shows so-called "top-content". Supposedly, these are the posts that are most popular among users. Since top content is generated automatically, it’s obvious that there is nothing interesting there for me personally, because Facebook will never write an algorithm that would guess what I like. To make me click ads more often — they’ll write one; to make me like the posts — no. &lt;/p&gt;
&lt;p&gt;Facebook has a "recent stories" mode, i.e. all posts and events in chronological order. Naturally, this mode is more attractive, because I don’t want to miss something important in my friends’ lives that Facebook’s algorithm won’t consider important. &lt;/p&gt;
&lt;p&gt;But even here there is the drawback that my friends not only publish information from themselves, but also like other people’s posts, repost, and comment. VKontakte and Facebook have a very useful feature — hide posts by a particular author. &lt;/p&gt;
&lt;p&gt;&lt;img alt="image" src="https://obrizan.com/images/livejournal/2015/07/25/chem-tehnologicheski-vkontakt-luchshe-feisbuka/9989-original-165e16c06ad38148.png"&gt;&lt;/p&gt;
&lt;p&gt;I highly recommend this feature for maintaining information hygiene. A person, as an individual, is what he reads. Over the past few years I have banned 4,000 VKontakte public pages. Now I simply don’t see reposts from those public pages. Despite the fact that I have about 500 VKontakte friends, it’s enough for me to log in once a week for 15 minutes to see all my friends’ news from the past week. &lt;/p&gt;
&lt;p&gt;&lt;img alt="image" src="https://obrizan.com/images/livejournal/2015/07/25/chem-tehnologicheski-vkontakt-luchshe-feisbuka/10762-original-e869ee23485845fa.png"&gt;&lt;/p&gt;
&lt;p&gt;Recently I decided to filter Facebook too. After several weeks of filtering, to my surprise my personalized feed turned out to be broken. They might show me 10 entries, maybe 5, or maybe just one. When I scroll through the posts, this one hangs at the end, and nothing else loads:&lt;/p&gt;
&lt;p&gt;&lt;img alt="image" src="https://obrizan.com/images/livejournal/2015/07/25/chem-tehnologicheski-vkontakt-luchshe-feisbuka/10398-original-98d89310f2a9f3f1.png"&gt;&lt;/p&gt;
&lt;p&gt;The attempt to personalize the content, to opt out of what I’m not interested in, ended in failure. Now I don’t see any content at all. I tried clearing cookies, tried two browsers: Yandex and Safari. Same result. &lt;/p&gt;
&lt;p&gt;Technologically, VKontakte is better than Facebook. They don’t have this problem.&lt;/p&gt;</content><category term="25"></category></entry><entry><title>Innovations at KhNURE</title><link href="https://obrizan.com/blog/innovations-at-khnure/" rel="alternate"></link><published>2011-02-25T11:51:00+02:00</published><updated>2011-02-25T11:51:00+02:00</updated><author><name>Volodymyr Obrizan</name></author><id>tag:obrizan.com,2011-02-25:/blog/innovations-at-khnure/</id><summary type="html">&lt;p&gt;Innovative technologies at KhNURE:&lt;/p&gt;
&lt;p&gt;&lt;img alt="24022011" src="https://obrizan.com/images/blogger/2011/02/25/innovatsii-v-hnure/24022011-8.jpg"&gt;&lt;/p&gt;
&lt;p&gt;Now security can watch amateur soccer instead of doing their actual duties.&lt;/p&gt;
&lt;p&gt;Why is this monitor sitting out in plain view of everyone, and not in a special room under the eyes of a dedicated employee? Why are there only two cameras, not a couple dozen …&lt;/p&gt;</summary><content type="html">&lt;p&gt;Innovative technologies at KhNURE:&lt;/p&gt;
&lt;p&gt;&lt;img alt="24022011" src="https://obrizan.com/images/blogger/2011/02/25/innovatsii-v-hnure/24022011-8.jpg"&gt;&lt;/p&gt;
&lt;p&gt;Now security can watch amateur soccer instead of doing their actual duties.&lt;/p&gt;
&lt;p&gt;Why is this monitor sitting out in plain view of everyone, and not in a special room under the eyes of a dedicated employee? Why are there only two cameras, not a couple dozen? Why do people freely get into the university who steal mobile phones and wallets from the labs?&lt;/p&gt;</content><category term="25"></category><category term="NURE"></category><category term="security"></category><category term="photos"></category></entry><entry><title>Artificial Intelligence Reinvents the Wheel!</title><link href="https://obrizan.com/blog/artificial-intelligence-reinvents-the-wheel/" rel="alternate"></link><published>2011-01-25T22:07:00+02:00</published><updated>2011-01-25T22:07:00+02:00</updated><author><name>Volodymyr Obrizan</name></author><id>tag:obrizan.com,2011-01-25:/blog/artificial-intelligence-reinvents-the-wheel/</id><summary type="html">&lt;p&gt;The other day I saw a link to an amusing Flash thing: &lt;a href="http://megaswf.com/serve/102223/"&gt;http://megaswf.com/serve/102223/&lt;/a&gt; It gives a clear demonstration of the essence of genetic (evolutionary) algorithms.&lt;/p&gt;
&lt;p&gt;The idea is simple. You need to make a bicycle so it travels as far as possible. The computer knows nothing …&lt;/p&gt;</summary><content type="html">&lt;p&gt;The other day I saw a link to an amusing Flash thing: &lt;a href="http://megaswf.com/serve/102223/"&gt;http://megaswf.com/serve/102223/&lt;/a&gt; It gives a clear demonstration of the essence of genetic (evolutionary) algorithms.&lt;/p&gt;
&lt;p&gt;The idea is simple. You need to make a bicycle so it travels as far as possible. The computer knows nothing about what a bicycle is supposed to be like. It gets fed various bizarre shapes at random. Among the parameters: body size, wheel size, distance between the wheels, shock absorber position. Maybe they’re something else, but judging by the logic of it, something along those lines.&lt;/p&gt;
&lt;p&gt;In the early generations the bicycles come out as a total train wreck. The first generation shows a sample of 20 random bicycles. For example, these:&lt;/p&gt;
&lt;p&gt;&lt;img alt="car-1" src="https://obrizan.com/images/blogger/2011/01/25/iskusstvennyi-intellekt-izobretaet-velosiped/iskusstvennyi-intellekt-izobretaet-velosiped-01.png"&gt;&lt;/p&gt;
&lt;p&gt;On the left, in the column, you can see experiments with the latest newborn freak, namely: how many notional meters of track it traveled. The most interesting part starts when the generation changes. At that point the very worst ones (the ones that traveled the least) are discarded (“This is Sparta!!!”), and the best prototypes are “crossed,” i.e., they exchange some parameters, for example the body shape or the wheel diameter.&lt;/p&gt;
&lt;p&gt;Some interesting variants turn up:&lt;/p&gt;
&lt;p&gt;&lt;img alt="car0" src="https://obrizan.com/images/blogger/2011/01/25/iskusstvennyi-intellekt-izobretaet-velosiped/car0-5.png"&gt;&lt;/p&gt;
&lt;p&gt;Or here’s an example of a bicycle that looks a lot like a motorcycle:&lt;/p&gt;
&lt;p&gt;&lt;img alt="car1" src="https://obrizan.com/images/blogger/2011/01/25/iskusstvennyi-intellekt-izobretaet-velosiped/car1-2-2.png"&gt;&lt;/p&gt;
&lt;p&gt;But if you wait, as I did, about nine hours, you may end up with a perfectly usable vehicle:&lt;/p&gt;
&lt;p&gt;&lt;img alt="super-car" src="https://obrizan.com/images/blogger/2011/01/25/iskusstvennyi-intellekt-izobretaet-velosiped/super-car-2.png"&gt;&lt;/p&gt;
&lt;p&gt;Conclusion (every lab report, term paper, thesis, or dissertation has to have a conclusion): &lt;a href="http://ru.wikipedia.org/wiki/Генетические_алгоритмы"&gt;genetic algorithms are widely used&lt;/a&gt; in many problems of the national and agricultural economy.&lt;/p&gt;</content><category term="25"></category><category term="interesting"></category><category term="fun"></category><category term="optimization"></category><category term="fiction"></category><category term="screenshot"></category></entry><entry><title>The Bunny in the Kharkiv Metro</title><link href="https://obrizan.com/blog/the-bunny-in-the-kharkiv-metro/" rel="alternate"></link><published>2010-12-25T15:52:00+02:00</published><updated>2010-12-25T15:52:00+02:00</updated><author><name>Volodymyr Obrizan</name></author><id>tag:obrizan.com,2010-12-25:/blog/the-bunny-in-the-kharkiv-metro/</id><content type="html">&lt;p&gt;Recognize the bunny?&lt;/p&gt;
&lt;p&gt;&lt;img alt="zayc" src="https://obrizan.com/images/blogger/2010/12/25/zaichik-v-harkovskom-metropolitene/zayc-2.jpg"&gt;&lt;/p&gt;
&lt;p&gt;In the Kharkiv Metro, at Universytet station, a five-meter bunny of ill fate has been installed. If you walk up to it and pet it, it will do you-know-what.&lt;/p&gt;
&lt;p&gt;&lt;img alt="Zayats_nesudbi_3" src="https://obrizan.com/images/blogger/2010/12/25/zaichik-v-harkovskom-metropolitene/zayats-nesudbi-3-2.jpg"&gt;&lt;/p&gt;
&lt;p&gt;— Where are you headed?
 — To the metro.
 — Not meant to be!&lt;/p&gt;
&lt;p&gt;&lt;img alt="Zayats_nesudbi_f_sberbank" src="https://obrizan.com/images/blogger/2010/12/25/zaichik-v-harkovskom-metropolitene/zayats-nesudbi-f-sberbank-2.jpg"&gt;&lt;/p&gt;</content><category term="25"></category><category term="fun"></category><category term="metro"></category><category term="photos"></category><category term="Kharkiv"></category><category term="hare"></category><category term="fiction"></category><category term="drawing"></category></entry><entry><title>Experts, my ass</title><link href="https://obrizan.com/blog/experts-my-ass/" rel="alternate"></link><published>2010-12-25T11:53:00+02:00</published><updated>2010-12-25T11:53:00+02:00</updated><author><name>Volodymyr Obrizan</name></author><id>tag:obrizan.com,2010-12-25:/blog/experts-my-ass/</id><summary type="html">&lt;p&gt;And here it is Saturday again, and once again someone on the internet is wrong.&lt;/p&gt;
&lt;p&gt;Browsing Habr in my spare time, I stumbled on a note about the case of some Zhukov. The story is murky; as I understood from the discussions, the dude wrote a little accounting app, took …&lt;/p&gt;</summary><content type="html">&lt;p&gt;And here it is Saturday again, and once again someone on the internet is wrong.&lt;/p&gt;
&lt;p&gt;Browsing Habr in my spare time, I stumbled on a note about the case of some Zhukov. The story is murky; as I understood from the discussions, the dude wrote a little accounting app, took money for installing it on users’ computers, and a year later that app started printing accounting reports with something missing from them. That was how the author motivated users to pay him more money. Well, since accounting reports are not your little term paper, the whole thing turned against the author. Now there is a trial, during which everything is shaping up not in his favor.&lt;/p&gt;
&lt;p&gt;As always, the “completely innocent” raised a howl to the heavens on the little internet. After all, it is well known that the internet is the abode of democracy and justice. The people will always put their chests forward in defense of Truth. The post itself is not interesting, but the links very much are.&lt;/p&gt;
&lt;p&gt;&lt;img alt="image" src="https://obrizan.com/images/blogger/2010/12/25/eksperty-my-ass/eksperty-my-ass-01.png"&gt;&lt;/p&gt;
&lt;p&gt;Since when did a Wikipedia article start being called “expert opinion”? First, Wikipedia has never been and never will be a site that provides authoritative legal advice. And second, when I checked the edit statistics it turned out that all these “experts” are anonymous users, most likely one and the same person.&lt;/p&gt;
&lt;p&gt;&lt;img alt="image" src="https://obrizan.com/images/blogger/2010/12/25/eksperty-my-ass/eksperty-my-ass-02.png"&gt;&lt;/p&gt;
&lt;p&gt;I can already sit here and see how, in the future, people will be posting links like this:&lt;/p&gt;
&lt;blockquote&gt;&lt;/blockquote&gt;
&lt;p&gt;Expert opinion: &lt;a href="http://linux.org.ru/Дело_Жукова"&gt;http://linux.org.ru/Дело_Жукова&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Or even like this:&lt;/p&gt;
&lt;blockquote&gt;&lt;/blockquote&gt;
&lt;p&gt;Expert opinion: &lt;a href="http://lurkmore.ru/Дело_Жукова"&gt;http://lurkmore.ru/Дело_Жукова&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;P. S. The article itself has been nominated for deletion. Most likely it will be deleted in the end.&lt;/p&gt;</content><category term="25"></category><category term="shitstorm"></category><category term="fun"></category><category term="Habr"></category><category term="screenshot"></category></entry><entry><title>Growth in the Use of C++ Synthesis</title><link href="https://obrizan.com/blog/growth-in-the-use-of-c-plus-plus-synthesis/" rel="alternate"></link><published>2009-09-25T18:46:00+03:00</published><updated>2009-09-25T18:46:00+03:00</updated><author><name>Volodymyr Obrizan</name></author><id>tag:obrizan.com,2009-09-25:/blog/growth-in-the-use-of-c-plus-plus-synthesis/</id><summary type="html">&lt;p&gt;Sean McCloud, a director at Mentor Graphics, &lt;a href="http://www.electronicsweekly.com/Articles/2009/09/24/47029/c-synthesis-gains-momentum-says-mentor-graphics.htm"&gt;reports&lt;/a&gt; that by the end of 2009 the number of companies using C++ synthesis for production will exceed 33%. In 2008, that figure was about 14%. The statistics were collected through an anonymous survey of 800 engineers. The survey was sponsored by Mentor …&lt;/p&gt;</summary><content type="html">&lt;p&gt;Sean McCloud, a director at Mentor Graphics, &lt;a href="http://www.electronicsweekly.com/Articles/2009/09/24/47029/c-synthesis-gains-momentum-says-mentor-graphics.htm"&gt;reports&lt;/a&gt; that by the end of 2009 the number of companies using C++ synthesis for production will exceed 33%. In 2008, that figure was about 14%. The statistics were collected through an anonymous survey of 800 engineers. The survey was sponsored by Mentor Graphics.&lt;/p&gt;
&lt;p&gt;The three reasons engineers choose C++ synthesis are: a) it’s easier to verify (68% of respondents); b) RTL is produced faster (64%); c) fewer people are needed, which is very relevant in a crisis.&lt;/p&gt;
&lt;p&gt;And here’s some interesting statistics on the market size for high-level synthesis products and related services. These figures were collected by analyst &lt;a href="http://www.garysmitheda.com/who.php"&gt;Gary Smith&lt;/a&gt; and published in the &lt;a href="http://www2.computer.org/portal/web/csdl/doi/10.1109/MDT.2009.83"&gt;July issue&lt;/a&gt; of “IEEE Design and Test of Computers.”&lt;/p&gt;
&lt;p&gt;&lt;img alt="cppsynthesismarket" src="https://obrizan.com/images/blogger/2009/09/25/rost-ispolzovaniya-s-sinteza/cppsynthesismarket-7.png"&gt;&lt;/p&gt;
&lt;p&gt;The chart is very interesting. Smith reports that in the ’90s users developed an interest in high-level synthesis, but the tools were far from being suitable for production. Because of that, trust in them was lost. In recent years, though, there has been a renewed flourishing of new-generation high-level synthesis programs. I know that many people are skeptical of C++ and SystemC as system description languages. We’ll see in a few years how it really turns out.&lt;/p&gt;
&lt;p&gt;And acquaintances also tell me that all these numbers are marketing bullshit meant to lure in users, like, “look, half the market has already bought C++ synthesis, so come on, you buy it too”!&lt;/p&gt;</content><category term="25"></category><category term="Mentor"></category><category term="business"></category><category term="CAD"></category></entry><entry><title>Sergey Mikhtonyuk’s Lecture on Computer Graphics</title><link href="https://obrizan.com/blog/sergey-mikhtonyuks-lecture-on-computer-graphics/" rel="alternate"></link><published>2009-05-25T16:10:00+03:00</published><updated>2009-05-25T16:10:00+03:00</updated><author><name>Volodymyr Obrizan</name></author><id>tag:obrizan.com,2009-05-25:/blog/sergey-mikhtonyuks-lecture-on-computer-graphics/</id><summary type="html">&lt;p&gt;On Wednesday (05/27/09), Sergey Mikhtonyuk will give a lecture on computer graphics. The program includes:&lt;/p&gt;
&lt;ol&gt;
&lt;li&gt;
&lt;p&gt;Graphic primitives&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;Transformations: Projection / World / View&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;Matrices&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;Z-Buffer &amp;amp; Stencil buffer&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;Lightning: Flat (Gouraud / Phong shading), Directional (point / spot lights)&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;Textures: Texture coordinates, Mip-mapping, Sampling, Cubic textures&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;Lighting models: Diffuse / Ambient / Specular&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;Shaders: Vertex …&lt;/p&gt;&lt;/li&gt;&lt;/ol&gt;</summary><content type="html">&lt;p&gt;On Wednesday (05/27/09), Sergey Mikhtonyuk will give a lecture on computer graphics. The program includes:&lt;/p&gt;
&lt;ol&gt;
&lt;li&gt;
&lt;p&gt;Graphic primitives&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;Transformations: Projection / World / View&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;Matrices&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;Z-Buffer &amp;amp; Stencil buffer&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;Lightning: Flat (Gouraud / Phong shading), Directional (point / spot lights)&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;Textures: Texture coordinates, Mip-mapping, Sampling, Cubic textures&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;Lighting models: Diffuse / Ambient / Specular&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;Shaders: Vertex / Pixel, Effects&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;Effect, postprocessing tutorial&lt;/p&gt;
&lt;/li&gt;
&lt;/ol&gt;
&lt;p&gt;&lt;span style="font-weight:bold;"&gt;Date:&lt;/span&gt; May 27, 2009 (Wednesday). &lt;span style="font-weight:bold;"&gt;Time:&lt;/span&gt; 11:30 AM–2:30 PM (three hours). &lt;span style="font-weight:bold;"&gt;Location:&lt;/span&gt; Room 318, KhNURE&lt;/p&gt;
&lt;p&gt;Admission is free.&lt;/p&gt;
&lt;p&gt;Lecture participants are expected to have a good knowledge of C++, the basics of computer graphics, and basic terms and principles. To participate, please send your full name, contact phone number, and group number in advance to &lt;a href="mailto:volodymyr.obrizan@gmail.com?subject=Tutorial"&gt;volodymyr.obrizan@gmail.com&lt;/a&gt;.&lt;/p&gt;</content><category term="25"></category><category term="NURE"></category><category term="programming"></category><category term="basics"></category></entry><entry><title>Intel’s Parallel Programming Contest</title><link href="https://obrizan.com/blog/intels-parallel-programming-contest/" rel="alternate"></link><published>2009-04-25T09:28:00+03:00</published><updated>2009-04-25T09:28:00+03:00</updated><author><name>Volodymyr Obrizan</name></author><id>tag:obrizan.com,2009-04-25:/blog/intels-parallel-programming-contest/</id><summary type="html">&lt;p&gt;Since April, another &lt;a href="http://software.intel.com/en-us/contests/Threading-Challenge-2009/codecontest.php"&gt;Intel parallel programming contest&lt;/a&gt; has been under way. This year participants are invited to solve 12 problems in two stages. The first stage began on April 6 and will end on July 3, and the second stage will begin on August 17 and end on November 13 …&lt;/p&gt;</summary><content type="html">&lt;p&gt;Since April, another &lt;a href="http://software.intel.com/en-us/contests/Threading-Challenge-2009/codecontest.php"&gt;Intel parallel programming contest&lt;/a&gt; has been under way. This year participants are invited to solve 12 problems in two stages. The first stage began on April 6 and will end on July 3, and the second stage will begin on August 17 and end on November 13.&lt;/p&gt;
&lt;p&gt;Each solved problem is scored separately as follows:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;
&lt;p&gt;&lt;span style="font-weight:bold;"&gt;0—100 points&lt;/span&gt; for a solved problem (correctness and execution speed are taken into account)&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;&lt;span style="font-weight:bold;"&gt;0—50 points&lt;/span&gt; for the explanatory note (up to 10 points for a description of the sequential algorithm, up to 30 points for a description of the parallel algorithm and the technologies used, up to 10 points for performance)&lt;/p&gt;
&lt;/li&gt;
&lt;li&gt;
&lt;p&gt;&lt;span style="font-weight:bold;"&gt;5 points&lt;/span&gt; for each forum post devoted to solving a specific problem (but no more than 25 points)&lt;/p&gt;
&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;The participant who scores the most points for solving a single problem receives a certificate for $100. At the end of each stage, the grand prix for the highest total score is awarded: a netbook.&lt;/p&gt;
&lt;p&gt;Of the problems open as of today, two are known: radix sort and solving Boolean equations. Most likely, in the future we can expect problems on graphs, arrays, and lists.&lt;/p&gt;</content><category term="25"></category><category term="contest"></category></entry></feed>