As a programmer, I picked a

As a programmer, I picked acar. 3r3663. 3r3-31. In previous articles (3–3–32. I 3–3–3651., 3–3–3385. II 3–3–3651., 3–3–36. III 3–3r3651.) I described in detail the development of a service for finding profitable used cars in the Russian Federation. 3r3663. Having traveled for a long time on various used machines, I thought about purchasing a new car and decided to study this issue in detail. In large cities, there are a huge number of official dealers, at least for popular brands. Dealers differ from each other in the list of cars in stock and the size of discounts offered on various models. In search of cars of interest to ...
+ 0 -

VotingClassifier in sсikit-learn: building and optimizing an ensemble of classification models

 3r3191. 3r3-31. As part of the implementation of a large task on Sentiment Analysis (analysis of reviews), I decided to devote some time to additional study of its separate element — using the VotingClassifier from sklearn.ensemble as a tool for building an ensemble of classification models and improving the final quality of predictions. Why is this important and what are the nuances? 3r3178.  3r3191.
3r314. 3r3178.  3r3191. VotingClassifier in sсikit-learn: building and optimizing an ensemble of classification models 3r3178.  3r3191. 3r3178.  3r3191. It often happens that in the course of solving an applied problem of analyzing data, it is not immediately obvious (or not at all obvious) which ...
+ 0 -

Page Rank in the Web 2.0 era - Part 1

 
3r3-31. Page Rank in the Web 2.0 era - Part 1
 
 
Elections are held in order to find out whose election forecast turned out to be more accurate. (c) Robert Orben
 
 
 
To evaluate Google’s contribution to search engine development, you need to move about 20 years ago. In those troubled times, the amount of information on the Internet was hundreds of times less than it is now, but the search for the necessary information was much more difficult. The user could spend a long time on the search engine site, trying to formulate a search engine query in different ways and still not get the desired result. There were even agencies that offered ...
+ 0 -

Friendly protection of a WEB resource against brute force attacks

Friendly protection of a WEB resource against brute force attacksOne of the problems that arise before WEB-resources with personal accounts is brute-force attack. Yes, simple enumeration of all password options for a specific account. Stupid? It is possible, but such an attack can put a heavy load on the resource. In addition, if there is no control over the complexity of the user's password during registration, it may also be successful. 3r3391.  3r399. 3r3391.  3r399. Most often, the issue is solved relatively simply. If the user has entered the wrong password several times, his account is blocked for a while. An alternative solution is to display captcha...
+ 0 -

The optimal location of the shards in the Elasticsearch petabyte cluster: linear programming

The optimal location of the shards in the Elasticsearch petabyte cluster: linear programming At the heart of the Meltwater and information retrieval systems. Fairhair.ai There is a collection of Elasticsearch clusters with billions of articles from the media and social media. 3r33386.  
3r33386.  
Index shards in clusters differ greatly in access structure, workload, and size, which raises some very interesting problems. 3r33386.  
3r33386.  
In this article, we will describe how linear programming (linear optimization) was applied to maximize the uniform distribution of the search and index workload across all nodes in the clusters. This solution reduces the chance that a single node will become ...
+ 0 -

Malicious machine learning as a diagnostic method

Malicious machine learning as a diagnostic method 3r33333.  
3r33333.  
Hello to all! 3r33333.  
3r33333.  
Continuing the development of the theme deep. learning , we once wanted to talk to you about, why neural networks see sheep everywhere . This topic is considered 3r37373. in the 9th chapter of the book by Francois Chollet. 3r33333.  
3r33333.  
So we went to the wonderful research of the company "Positive Technologies", 3r-325. presented on Habré
, as well as the excellent work of two MIT employees, who believe that “harmful machine learning” is not only a hindrance and a problem, but also an excellent diagnostic tool...
+ 0 -

How to create a game AI: guide for beginners

 3r31095. 3r3-31. How to create a game AI: guide for beginners 3r31084. 3r31081.  3r31095. 3r33973. What is AI?
3r31081.  3r31095. Game AI focuses on what actions the object must perform, based on the conditions in which it is located. This is usually called the management of “smart agents”, where the agent is a game character, a vehicle, a bot, and sometimes something more abstract: a whole group of entities or even civilization. In each case, this is a thing that must see its environment, make decisions on its basis and act in accordance with them. This is called the Sense /Think /Act cycle (Feel /Think /Act): 3r31081.  3r31095. 3r31081.  3r31095...
+ 0 -

Timeout paradox, or why is my bus always late?

 3r31255. 3r3-31. Timeout paradox, or why is my bus always late? Source : Wikipedia License CC-BY-SA ???r3r3439. 3r33440. 3r31243.  3r31255. 3r31243.  3r31255. If you often travel by public transport, then you probably met with this situation: 3r3-31243.  3r31255. 3r31243.  3r31255.
You come to a halt. It is written that the bus runs every 10 minutes. Notice the time Finally, after 11 minutes, the bus comes and thought: why do I always have bad luck?
3r31243.  3r31255. The idea is that if buses arrive every 10 minutes, and you arrive at a random time, then the average wait should be about 5 minutes. But in reality, buses do not arrive right on ...
+ 0 -

Algorithm: How to find the next lexicographic permutation

Algorithm: How to find the next lexicographic permutation 3r380.  3r3118. 3r380.  3r3118. Briefly describe what the lexicographic order is - sorting in alphabetical order. Those. the sequence of characters - AAA → AAB → AAC → AAD →
→ WWW - is sorted alphabetically (or in our case lexicographical) order. 3r380.  3r3118. 3r380.  3r3118. Imagine that you have a finite sequence of characters, for example, ? ? ? ? ? ? 0 and you need to find all possible permutations of these characters. The most intuitive, but also the greatest in complexity, is the recursive algorithm, when we select the first character from the sequence, then recursively select the second, third...
+ 0 -

Laplace Blur

Laplace Blur
 
 
Is it possible to blur Laplace instead of Gauss, how many times it is faster, and is it worth the loss of 1/32 accuracy.
 
3r311. 3r33232.
 
 
(Laplace Blur - The proposed original name of the algorithm)
 
 
Today, my internal demoscenary kicked me and forced me to write an article that had to be written six months ago. As an amateur at my leisure to develop original effect algorithms, I would like to propose to the public an “almost Gaussian blura” algorithm, featuring the use of extremely fast processor instructions (shifts and masks), and therefore is available for implementation up to microcontrollers ...
+ 0 -