ICode9

精准搜索请尝试: 精确搜索
  • 解决错误 java.lang.IllegalStateException: Unable to find a @SpringBootConfiguration, you need to use @Co2019-07-03 15:01:52

    报错java.lang.IllegalStateException: Unable to find a @SpringBootConfiguration, you need to use @ContextConfiguration or @SpringBootTest(classes=...) with your test..........................................   我当时运行SpringBoot测试类的时候踩这个坑,当时的

  • A trip through the Graphics Pipeline 2011_09_Pixel processing – “join phase”2019-06-28 19:54:05

          Welcome back!     This post deals with the second half of pixel processing, the “join phase”. The previous phase was all about taking a small number of input streams and turning them into lots of independent tasks for the shader units. Now w

  • A trip through the Graphics Pipeline 2011_07_Z/Stencil processing, 3 different ways2019-06-28 19:53:10

             In this installment, I’ll be talking about the (early) Z pipeline and how it interacts with rasterization. Like the last part, the text won’t proceed in actual pipeline order; again, I’ll describe the underlying algorithms first, and then

  • 明远智睿MY-IMX6 底板设计指南2019-06-21 17:43:43

    电源(power supply) 原理图(schematic)   MY-I.MX6系列核心板,只需要一个5V电源(持续供电电流不低于2A,峰值2.5A-3A)输入即可。详见下图。MY-I.MX6 series of core board only needs 5V power source(constant current is not small than 2A,peak value 2.5A-3A)as an input。details a

  • 利用银行家算法避免死锁2019-06-05 20:53:19

    算法思想: 代码: #include<iostream> #include<string> using namespace std; #define numberOfProcess 5 #define numberOfReSource 3 int *available=new int[numberOfReSource]; int *work=new int[numberOfReSource]; string *securitySequence=new string

  • 目标检测---Segmentation Is All You Need2019-06-03 13:50:53

    Segmentation Is All You Need https://www.jiqizhixin.com/articles/2019-06-02-2 目前目标检测算法中有两个模块比较重要: region proposal networks (RPNs) 和 non-maximum suppression (NMS) ,虽然这两个模块解决目标检测中的一些问题,但是它们也引入了一些难以克服的问

  • 1041. Robot Bounded In Circle2019-05-29 16:01:03

    On an infinite plane, a robot initially stands at (0, 0) and faces north.  The robot can receive one of three instructions: "G": go straight 1 unit; "L": turn 90 degrees to the left; "R": turn 90 degress to the right. The r

  • One shot learning2019-05-21 10:48:10

    One single image (neural networks don’t work well given one training example) (Such a small training set is really not enough to train a robust neural network) (If softmax, need to retrain every time new class adds in) Solution: Siamese Network To tra

  • 可p的想法:B,,,G.F.,,W2019-05-20 15:50:46

    施压,,摧毁G,F,W,,  这想法有'\点大胆,我\们的\net不,应,该是这样的。这是什么s,hi,t,网,我们不需要人为的过滤器,为什么任由一个可能极度stupid的大脑替我们思考筛选,,,we need \truth,we need to get the original material not what they’ve checked! 荒...诞,真的是荒,诞 哇去,大...

  • CMSC 216 Exercise #6 Spring 20192019-05-12 19:54:50

    CMSC 216 Exercise #6 Spring 2019Threads Deadline: Wed, May 8 (lab time)1 OverviewIn this exercise you will use threads to write a program that computes the maximum and the sum of datapresent in an array. For this assignment: There are no public, release n

  • C++练习 | 二分练习2019-04-13 13:49:46

    Hamburgers #include<bits/stdc++.h>using namespace std;char B='B',S='S',C='C';string t;int nb,ns,nc,pb,ps,pc,len;long long r1;map<char,int> m;bool check(long long m1){ long long need=0; if(m1*m[B]>nb)

  • 1013 Battle Over Cities2019-04-08 15:49:00

    1013 Battle Over Cities (25 分) It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward that city are closed. We must know immediately if we need to repair any other

  • pypi pack and upload2019-03-31 20:47:36

    403 error need to change the name in setup.py 400 error need to change the version of the same name pkg register: python setup.py register  upload to test pypi:  python -m twine upload --repository-url https://test.pypi.org/legacy/ dist/* install:  py

  • 第一册:lesson seventy nine.2019-03-27 13:41:11

    原文: Carol's shopping list. What are you doing Carol? I'm making a shopping list Tom. What do we need? We need a lot of things this week. I must go to the grocer's.We haven't got much tea or coffee,and we haven't got any sugar or j

  • 论文阅读-attention-is-all-you-need2019-03-26 21:48:40

    1结构介绍 是一个seq2seq的任务模型,将输入的时间序列转化为输出的时间序列。 有encoder和decoder两个模块,分别用于编码和解码,结合时是将编码的最后一个输出 当做 解码的第一个模块的输入 encoder模块有两个操作: self-attention、feed-forward decoder模块有三个操作:self-attention

  • 编辑距离算法-DP问题2019-03-18 12:39:49

    Levenshtein Distance The Levenshtein distance is a string metric for measuring the difference between two sequences. Informally, the Levenshtein distance between two words is the minimum number of single-character edits (insertions, deletions or substitut

  • LOJ2527 HAOI2018 染色 容斥、生成函数、多项式求逆2019-03-17 19:54:27

    传送门 调了1h竟然是因为1004535809写成了998244353 “恰好有\(K\)种颜色出现了\(S\)次”的限制似乎并不容易达到,考虑容斥计算。 令\(c_j\)表示强制\(j\)种颜色恰好出现\(S\)次,其他颜色随意染的方案数。可以通过生成函数知道 \(\begin{align*} c_j &= \binom{m}{j} n! [x^n] (\fra

  • I Think I Need a Houseboat2019-03-08 19:50:49

    Problem Description Fred Mapper is considering purchasing some land in Louisiana to build his house on. In the process of investigating the land, he learned that the state of Louisiana is actually shrinking by 50 square miles each year, due to erosion ca

  • MVC依赖注入2019-03-08 13:48:26

    #引用 “When you go and get things out of the refrigerator for yourself, you can cause problems. You might leave the door open, you might get something Mommy or Daddy doesn’t want you to have. You might even be looking for something we don’t even have or whi

  • 01背包问题2019-03-01 20:49:39

    #include <stdio.h> #include <string.h> #include <string> #include <algorithm> #include <map> using namespace std; const int maxn = 100; const int maxm = 100; int main() { int n, m,i,j; int need[maxn], value[maxm];//need为物品所

  • Get A Productive Asphalt Batch Plant2019-02-25 09:55:07

    For consistency inside your batch mixes, you want a quality asphalt batch plant. There are several critics on this essential machinery who state that the future of asphalt mixing will eliminate these mini asphalt plants for sale. That day is significantly

  • uoj#80 二分图最大权匹配2019-02-03 18:00:22

    题意:给定二分图,有边权,求最大边权匹配。边权非负。 解:KM算法求解最大权完备匹配。 完备匹配就是点数少的那一边每个点都有匹配。 为了让完备匹配与最大权匹配等价,我们添加若干条0边使之成为完全二分图(自造名词别在意......) 为了让左边成为点数较少的一边,我们还要添加一些虚点,m = m

专注分享技术,共同学习,共同进步。侵权联系[81616952@qq.com]

Copyright (C)ICode9.com, All Rights Reserved.

ICode9版权所有