• Processing of time series data in tensorflow window


    Processing of tensorflow time series data Data set introduction Data source:Kaggle Ubiquant Market Prediction The dataset describes 300 anonymous features (“f_0” to “f_299”) and one target feature (“target”) of multiple investment projects in a time series. It is required to predict the target characteristics according to the anonymous characteristics of subsequent time nodes. The main goal […]

  • Safe dog file upload bypass


    Website security dog (WAF) file upload is restricted to the vulnerability protection sub module under the website protection module   The file types appearing in the above list will be blocked by WAF when uploading, but not all file types are added with detection rules by default, such as picture files (. JPG). Because it […]

  • [daily algorithm / brush through leetcode] 3 Longest substring without duplicate characters (medium)


    Click here to view more content related to algorithmic interview~ Title Description Given a string, please find the length of the longest substring that does not contain duplicate characters. Example 1: Input: S = “abcabcbb” output: 3 Explanation: because the longest substring without repeated characters is “ABC”, its length is 3. Example 2: Input: S […]

  • Study hard go: 7 Built in collection array


    Series articles: Study hard go: 1 Learning lead Study hard go: 2 Environment construction Study hard go: 3 Environment construction – gomod learning Study hard go: 4 Variables and data types Study hard go: 5 Constants and operators Study hard go: 6 Process control Study hard go: 7 Built in collection array Study hard go: […]

  • Horse drawn cart algorithm, in fact, is not difficult!!!


    To talk about the horse drawn cart algorithm, we must talk about this problem and find the longest palindrome substring. The horse drawn cart algorithm is one of the solutions. The cruel person doesn’t talk much. Just look down: Title Description Give you a string s and find the longest palindrome substring in S. example […]

  • ACM gold medalist explains leetcode algorithm hash


    Hello, I’m a programming bear. Previous articles introduced array, linked list, stack, queue, monotone stack and sliding window in linear table. In this issue, we learn about hashing, which is mainly used to speed up our search for data. The article will be launched from the following aspects, and the content is easy to understand. […]

  • Omnipotent embedding4 – skip thought & TF seq2seq source code analysis


    In the previous chapter, doc2vec mentioned that in fact, doc2vec only joined doc_ ID captures the subject information of the text without really considering word order and context semantics. N-gram can only solve this problem locally. Is there any other solution? It is still a general text vector. Skip thought tries to use encoder decoder […]

  • CSS functions (IV) grid functions


    These three functionsCan only be used in grid layout fit-content() The fit content function receives a parameter, the length value, and its function can be interpreted literally to “adapt to the content”. <div class=”fit-content-wrapper”> < div class = “fit item Item1” > test1dssssss3333333 ssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssss < div class = “fit item Item2” > test2 this is […]

  • 5.3 SHA-1


    5.3 SHA-1 Similar to MD4 Algorithm description Input of algorithm: any message less than 264 bit long is divided into 512 bit long packets. Output of algorithm: 160 bit long message summary. The block diagram of the algorithm is the same as MD5, but the length of hash value and link variable is 160 bits […]

  • New string section 22: ES6


    1. Template string 1.1. String processing of Es5 The string template output of Es5 usually uses + splicing. Such shortcomings are obviously easy to see: when the string splicing content is too much, it is too chaotic and prone to error. let name = “wuwei”; let age = 18; Let STR = “his name is […]

  • How effective is the method of creating string


    After creation, the length content is immutable. Each time a string is spliced, a new object will be generated. If it is generated directly by “” or string constant splicing, it will be saved in the string constant pool. If it is created directly by new,Star pool ECSSave in heap. Advantages: the string class provides […]

  • [algorithm 3] array — the simplest data structure


    Original blog:https://www.aiyc.top/2003.html Pay attention to the official account: AI Yuet Chuang, first update! preface: In the previous two articles, we explained the algorithm and spatio-temporal complexity in detail, but this is not enough. Spatio-temporal complexity is only the tip of the iceberg in our algorithm learning. Let’s officially open the door of algorithm and data […]