Finding Black Holes 1 The apparent horizon (i.e., the marginally trapped outer surface) is an invaluable tool for finding black holes in numerical rel ...
分类:
其他好文 时间:
2019-09-17 17:38:58
阅读次数:
70
About Face detection 1、Finding Tiny Faces Code:https://github.com/peiyunh/tiny 小目标检测难3大原因:目标本身尺度变化、图像分辨率以及环境因素。本文针对多尺度训练了不同的检测器,这些检测器所用特征来自同一网络的不同层级。此 ...
分类:
其他好文 时间:
2019-08-19 19:34:52
阅读次数:
77
openstack中 虚拟机重装报错,"message": "Connection to glance host 10.12.220.139:9292 failed: Error finding address for http://10.12.220.139:9292/v1/images/86819d99-a189-422b-9fa3-077616544a8d: (‘Connection aborted.‘, error(110, ‘ETIMEDOUT‘))", "code": 500, "details": " File \"/root/openstack/src/nova/nova/compute/manager.py\", line 343, in decorated_function 处理过程记录
分类:
其他好文 时间:
2019-08-16 22:59:50
阅读次数:
109
In the long list of airline travel headaches, the boarding process has to be right up there with paying bag-check fees and finding just one freakin' S ...
分类:
其他好文 时间:
2019-08-15 09:13:16
阅读次数:
76
import requestsimport simplejsonimport jsonimport base64 def find_face(imgpath): print("finding") http_url = 'https://api-cn.faceplusplus.com/facepp/v ...
分类:
其他好文 时间:
2019-08-08 18:49:42
阅读次数:
663
题目链接: https://cn.vjudge.net/contest/313499#problem/L SOLUTION: 对于题意,要求最短的表达式,当用最小循环元来表示一个字符串时,其表达式才最短。对于字符串S自匹配求出next数组,分析可以发现:当i-next[i]能整除i时,S[1~i-n ...
分类:
其他好文 时间:
2019-07-31 22:20:30
阅读次数:
92
Computing the cross correlation function is useful for finding the time delay offset between two time series. Python has the numpy.correlate function. ...
分类:
其他好文 时间:
2019-07-07 16:03:46
阅读次数:
148
Finding the Offset 1. Use the Metasploite pattern_create.rb tool to create 5900 characters. 2.Write the python test script. The shellcode is copied fr ...
分类:
其他好文 时间:
2019-06-27 01:09:07
阅读次数:
143
reproduction from https://danielmiessler.com/study/shodan/ What is Shodan? Shodan is a search engine for finding specific devices, and device types, t ...
分类:
其他好文 时间:
2019-06-07 20:45:24
阅读次数:
161
The algorithm for this problem is not so hard to figure out. This is a problem of finding the length of the shortest path in graph. As I mentioned in ...
分类:
其他好文 时间:
2019-03-26 22:36:36
阅读次数:
140