oF

1141 PAT Ranking of Institutions(附测试点5分析)

题目: After each PAT, the PAT Center will announce the ranking of institutions based on their students' performances. Now you are asked to generate the ......
Institutions Ranking 1141 PAT of

[论文阅读] Prototypical contrastive learning of unsupervis

# Prototypical contrastive learning of unsupervised representations ## abstract 这篇论文介绍了原型对比学习(PCL),一种将对比学习与聚类相结合的无监督表示学习方法。PCL不仅为实例区分任务学习低层特征,更重要的是==* ......

linux宏offset_of学习随笔

offset_of 宏 定义:include/linux/stddfx.h 功能:给出两个参数:结构体和它的成员,获取其成员关于结构体首地址的偏移: #define offset_of(type, member) (unsigned long) &((type*)0)->member 这个想法挺精巧 ......
offset_of 随笔 offset linux of

解决编译告警unrecognized command line option ‘-Wno-address-of-packed-member’

问题 在编译dperf的过程中报错如下: 解决 以上问题为编译告警选项使用错误,在-Wno-address-of-packed-member前面加入 -w即可。 -w -Wno-address-of-packed-member ......

E. Ina of the Mountain 优先队列

题意:给你一个长度为n的序列。问你最少进行多少次操作,使得最终整个序列的值都为k 操作:选一段区间,然后把这段区间的数全减一。 这个序列还有一个特性,就是当一个数为0时,这个数会变成k。 解法:一眼丁真P1969 [NOIP2013 提高组] 积木大赛 - 洛谷 | 计算机科学教育新生态 (luog ......
队列 Mountain Ina the of

[LeetCode] 1921. Eliminate Maximum Number of Monsters

You are playing a video game where you are defending your city from a group of n monsters. You are given a 0-indexed integer array dist of size n, whe ......
Eliminate LeetCode Monsters Maximum Number

Note of SHU Computer Graphics (01): 计算机图形学概述

# 什么是计算机图形学? 研究怎样利用计算机来显示、生成和处理图形的原理、方法和技术的一门学科,这里的图形是指三维图形的处理。 - **图形**: 计算机图形学的研究对象 - 能在人的视觉系统中产生视觉印象的客观对象 - 包括自然景物、拍摄到的图片、用数学方法描述的图形等等 - **构成图形的要素* ......
Computer Graphics 图形 计算机 Note

Qt编译报错:multiple definition of

解决方法一:在.pro文件下查看SOURCES +=和HEADERS +=也没有重复引入文件,删除重复的文件即可。 解决方法二:把debug文件夹下的.o文件都删除,然后再编译下。 解决方法三:如果.h文件中有类的定义和实现,则实现时在每个成员前加inline。 转载于:QT项目出现multiple ......
definition multiple of

Further reading: Theory of computation

找了些:https://en.wikipedia.org/wiki/Theory_of_computation 提到的书籍: Textbooks aimed at computer scientists (There are many textbooks in this area; this lis ......
computation Further reading Theory of

[LeetCode] 2240. Number of Ways to Buy Pens and Pencils

You are given an integer total indicating the amount of money you have. You are also given two integers cost1 and cost2 indicating the price of a pen ......
LeetCode Pencils Number 2240 Ways

Proj CDeepFuzz Paper Reading: AutoML: A survey of the state-of-the-art

## Abstract Github: https://github.com/marsggbo/automl_a_survey_of_state_of_the_art 本文: 1. intro AutoML methods: data preparation, feature engineering ......

【MT&PT】Central limit theorem, Law of large numbers

I Chebyshev inquation $E(X)=\mu,D(X)=\sigma^{2}$ $P\{|X-\mu|>=\varepsilon\}<=\frac{\sigma^{2}}{\varepsilon^{2}}\\ it's\ equation:\\ P\{|X-\mu|<\vareps ......
Central theorem numbers limit large

pytorch报错IndexError: invalid index of a 0-dim tensor. Use tensor.item() to convert a 0-dim tensor to a Python

该错误消息表示您正在尝试索引其中只有一项的数组。例如, In [10]: aten = torch.tensor(2) In [11]: aten Out[11]: tensor(2) In [12]: aten[0] IndexError Traceback (most recent call l ......
tensor IndexError dim pytorch invalid

git log 出现Merge branch 'xxxx' of

场景: 多人合作开发时,同拉取远程仓库分支 Feature A开发者拉取Feature分支代码后在本地开发并commit 过, 但并未push到远程仓库。 B开发者拉取Feature分支代码后在本地开发并commit, 随后push到远程分支。 这时A开发者再push代码到远程分支会提示先 git ......
branch Merge 39 xxxx git

Tool are in unnamed module of loader 'app

这就是典型的类型转换问题,出现这个错误就说明类型转换有误 参考:https://blog.csdn.net/justleavel/article/details/128613595 跟泛型有关? 发现原因:有两个Tool类。。。其中调用的参数里是一个Tool类。。而实现类实现的是另一个Tool类。。 ......
unnamed module loader Tool are

Codeforces Round 879 (Div. 2)E. MEX of LCM(数学,数据结构)

题目链接:https://codeforces.com/contest/1834/problem/E 题意: 有长度为n的序列,问最小的正整数 x ,对于任意连续的子区间,区间的数的最小公倍数 都不等于 x; 分析: 首先来分析一下答案的范围是多少; 我们可以知道,对于长度 为n 的序列,前 n + ......
数据结构 Codeforces 结构 数学 数据

A disk is a bunch of bits

A disk is a bunch of bits Jul 19, 2023 Introduction Have you ever heard someone say that a disk or memory is a “bunch of bits”? I’m not sure about thi ......
bunch disk bits is of

Proj CDeepFuzz Paper Reading: Aries: Efficient Testing of Deep Neural Networks via Labeling-Free Accuracy Estimation

## Abstract 背景: 1. the de facto standard to assess the quality of DNNs in the industry is to check their performance (accuracy) on a collected set of ......

Day six of Python

今日内容大概:if嵌套语法分支结构练习内容while 循环while +break标志位的使用练习题while+countinue+else死循环for循环for+break+countinue+elseif嵌套语法: 练习: 循环结构:关键字:while while+break break跳出本层 ......
Python Day six of

Proj CDeepFuzz Paper Reading: SyRust: automatic testing of Rust libraries with semantic-aware program synthesis

## Abstract 背景: 1. unsafe能够绕开rust type system 2. rust libraries中常有许多unsafe keyword 本文:SyRust Task: fuzz Rust library APIs Challenge: synthesize well-t ......

js找出一定范围内的全部素数(埃拉托斯特尼筛法Sieve of Eratosthenes)

最近在看js的基础,看到函数这一章的时候,看到了这种写法。 原文链接:https://zh.javascript.info/function-basics 突然懵了个B,js还能这么写。然后问了下chat,才想起来这是js的标签用法。 在JavaScript中,标签(label)是一种标识符,用于标 ......
素数 Eratosthenes 范围 Sieve of

连接redis后 ,报错: ERR wrong number of arguments for ‘hset‘ command“怎么解决

原因:ERR wrong number of arguments for ‘hset‘ command 触发代码 解决方法: 可能是java 不匹配我本地3.2版本的redis,我换一个更大版本的redis 就解决了 ......
arguments command number redis wrong

Proj CDeepFuzz Paper Reading: Deepxplore: Automated whitebox testing of deep learning systems

## Abstract 背景:现有的深度学习测试在很⼤程度上依赖于⼿动标记的数据,因此通常⽆法暴露罕⻅输⼊的错误⾏为。 本文:DeepXplore Task: a white-box framework to test DL Models 方法: 1. neuron coverage 2. diff ......

Data source rejected establishment of connection,message from serverToo many connections错误解决办法

1、临时修改生效,不需要重启数据库 show variables like "max_connections"; #显示最大连接数show processlist; #显示当前连接数 set global max_connections=1000; #设置最大连接数1000 show variabl ......

XXX has been compiled by a more recent version of the Java Runtime (class file version 61.0)

## maven版本未指定导致编译失败问题 Execution default of goal org.springframework.boot:spring-boot-maven-plugin:3.1.3:repackage faile d: Unable to load the mojo 're ......
version compiled Runtime recent class

20. 股东权益变化表 Statement of Owner's Equity

股权融资与负债融资相比,前者虽然降低了企业破产的风险,但他同时也稀释了股东权益。 四大财务报表的第四张正是**股东权益变动表** Statement of Owner's Equity ##通过股东权益变动表来呈现股权融资状况 ### 1. 股票发行 老王公司授权1万股普通股,**股票面值**1元 ......
股东 Statement 权益 Equity Owner

【CF1519D】Maximum Sum of Products

```cpp #include using namespace std; typedef long long ll; ll n,a[5000+10],b[5000+10],abpre[5000+10],absuf[5000+10],ans; int main(){ cin >> n; for(ll ......
Products Maximum 1519D 1519 Sum

Codeforces Round 887 (Div. 1)C. Ina of the Mountain(数据结构,反悔贪心)

题目链接:https://codeforces.com/problemset/problem/1852/C 题意: 给定一个长度为n的序列和正整数k; 每次可以选取任意一个区间,将区间内每个数减1; 如果出现一个数变成0,那么那个数变成k; 问至少操作多少次可以使得每个数变成k; 分析: 将每个数值 ......

Docker|--E: gnupg, gnupg2 and gnupg1 do not seem to be installed, but one of them is required for this operation

### 错误 ```bash apt-key adv --keyserver keyserver.ubuntu.com --recv-keys 871920D1991BC93C E: gnupg, gnupg2 and gnupg1 do not seem to be installed, but ......
gnupg installed operation required Docker

Educational Codeforces Round 152 (Rated for Div. 2)E. Max to the Right of Min(数据结构,分治)

题目链接:https://codeforces.com/problemset/problem/1849/E 大致题意: 长度为n的序列,求有多少个区间满足区间最大值在区间最小值的右边? 解题思路: (此题有使用线段树等其他做法,本处使用的是单调栈做法) 我们先求出每个a【i】 的左边的比他小的LMI ......