<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Stool_Monster的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Stool_Monster</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Stool_Monster]]></copyright><item><title><![CDATA[[机翻·转载]Hands-on Graph Neural Networks with PyTorch & PyTorch Geometric]]></title><link>https://blog.youkuaiyun.com/Stool_Monster/article/details/121591224</link><guid>https://blog.youkuaiyun.com/Stool_Monster/article/details/121591224</guid><author>Stool_Monster</author><pubDate>Sun, 28 Nov 2021 16:36:11 +0800</pubDate><description><![CDATA[[机翻·转载]Hands-on Graph Neural Networks with PyTorch &amp; PyTorch GeometricRequirementsPyTorch Geometric BasicsDataDatasetDataLoaderMessagePassingExampleA Real-World Example — RecSys Challenge 2015PreprocessingDataset ConstructionBuild a Graph Neural Networ]]></description><category></category></item><item><title><![CDATA[Win 10虚拟机软件virtualbox中的ubuntu18.04系统中的uhd及gnuradio软件的安装(2)]]></title><link>https://blog.youkuaiyun.com/Stool_Monster/article/details/108251037</link><guid>https://blog.youkuaiyun.com/Stool_Monster/article/details/108251037</guid><author>Stool_Monster</author><pubDate>Thu, 27 Aug 2020 01:11:22 +0800</pubDate><description><![CDATA[Win 10虚拟机软件中的ubuntu18.04系统中的uhd及gnuradio软件的安装。（2）

本教程分两篇：
1）ubuntu1804虚拟机系统的安装。
2）uhd及gnuradio软件的安装（通过编译源码安装）。
此为第二篇。

先说重点：在安装过程中，由于懵懂无知，都是安装uhd4.0.0.0和gnuradio3.8最新版本，导致gnuradio始终make不通过，因此，在参考Ettus官方提供的安装教程后，我成功安装的版本为uhd3.15.0.0和gnuradio3.7.13.4。
Ettus]]></description><category></category></item><item><title><![CDATA[Win 10虚拟机软件virtualbox中的ubuntu18.04系统中的uhd及gnuradio软件的安装]]></title><link>https://blog.youkuaiyun.com/Stool_Monster/article/details/108249833</link><guid>https://blog.youkuaiyun.com/Stool_Monster/article/details/108249833</guid><author>Stool_Monster</author><pubDate>Thu, 27 Aug 2020 00:47:33 +0800</pubDate><description><![CDATA[Win 10虚拟机软件中的ubuntu18.04系统中的uhd及gnuradio软件的安装。（1）

本教程分两篇：

1）ubuntu1804虚拟机系统的安装

2）uhd及gnuradio软件的安装

先说重点：在安装过程中，由于懵懂无知，都是安装uhd4.0.0.0和gnuradio3.8最新版本，导致gnuradio始终make不通过，因此，在参考Ettus官方提供的安装教程后，我成功安装的版本为uhd3.15.0.0和gnuradio3.7.13.4。

Ettus官方教程：https://kb.]]></description><category></category></item><item><title><![CDATA[texstudio / sublime text 3 - latextools使用minted包遇到的一些问题的解决办法]]></title><link>https://blog.youkuaiyun.com/Stool_Monster/article/details/107610030</link><guid>https://blog.youkuaiyun.com/Stool_Monster/article/details/107610030</guid><author>Stool_Monster</author><pubDate>Mon, 27 Jul 2020 14:14:35 +0800</pubDate><description><![CDATA[Tex第一次使用minted时经常会碰到的两个问题：

第一个：


Package minted Error: You must invoke LaTeX with the -shell-escape flag.

第二个：


Package minted Error: You must have 'pygmentize' installed to use this package.

经常是先出现第一个，解决第一个问题之后，再出现第二个问题。
下面分别说一下windows 10中使用TexStudio]]></description><category></category></item><item><title><![CDATA[Qt Creator c++调用Matlab生成的dll]]></title><link>https://blog.youkuaiyun.com/Stool_Monster/article/details/89711923</link><guid>https://blog.youkuaiyun.com/Stool_Monster/article/details/89711923</guid><author>Stool_Monster</author><pubDate>Tue, 30 Apr 2019 17:15:16 +0800</pubDate><description><![CDATA[目录

m语言生成dll库

在Qt Creator中使用c++库

疑问

m语言生成dll库

1. 首先编写一个简单的m函数test.m并保存


% test.m
function ans = test(x,y)
    ans = x + y;
end

2. 在matlab的命令行中输入deploytool并按回车键，选择"Library Compiler"。


deploytool...]]></description><category></category></item><item><title><![CDATA[多径信道]]></title><link>https://blog.youkuaiyun.com/Stool_Monster/article/details/88918337</link><guid>https://blog.youkuaiyun.com/Stool_Monster/article/details/88918337</guid><author>Stool_Monster</author><pubDate>Sat, 30 Mar 2019 21:10:15 +0800</pubDate><description><![CDATA[多径信道多径信道的低通等效特征欢迎使用Markdown编辑器新的改变功能快捷键合理的创建标题，有助于目录的生成如何改变文本的样式插入链接与图片如何插入一段漂亮的代码片生成一个适合你的列表创建一个表格设定内容居中、居左、居右SmartyPants创建一个自定义列表如何创建一个注脚注释也是必不可少的KaTeX数学公式新的甘特图功能，丰富你的文章UML 图表FLowchart流程图导出与导入导出导入
在...]]></description><category></category></item><item><title><![CDATA[Android Studio问题&解决办法集合（不定期更新）]]></title><link>https://blog.youkuaiyun.com/Stool_Monster/article/details/51139563</link><guid>https://blog.youkuaiyun.com/Stool_Monster/article/details/51139563</guid><author>Stool_Monster</author><pubDate>Wed, 13 Apr 2016 01:58:51 +0800</pubDate><description><![CDATA[问题1：运行AVD & SDK Manager.exe时找不到android.bat的问题。
解答：见链接：http://stackoverflow.com/questions/24949446/android-bat-file-is-missing-in-sdk-tools-folder-also-i-do-not-having-avd-sdk-m]]></description><category></category></item><item><title><![CDATA[cf 598A Tricky Sum]]></title><link>https://blog.youkuaiyun.com/Stool_Monster/article/details/49850683</link><guid>https://blog.youkuaiyun.com/Stool_Monster/article/details/49850683</guid><author>Stool_Monster</author><pubDate>Sun, 15 Nov 2015 17:36:29 +0800</pubDate><description><![CDATA[#include 
using namespace std;
#define LL long long
const LL MAXN=1000000000;
LL a[30]={1};
LL b[30]={1};
int main()
{
    for(int i=1;i<=30;i++)
        a[i]=2*a[i-1];
    for(int i=1;i<30;i++)
     ]]></description><category></category></item><item><title><![CDATA[cf 593a 2Char]]></title><link>https://blog.youkuaiyun.com/Stool_Monster/article/details/49661025</link><guid>https://blog.youkuaiyun.com/Stool_Monster/article/details/49661025</guid><author>Stool_Monster</author><pubDate>Thu, 05 Nov 2015 12:12:41 +0800</pubDate><description><![CDATA[#include 
#include 
using namespace std;
int main()
{
    string s[105];
    int n;
    cin>>n;
    for(int i=0;i<n;i++)
        cin>>s[i];
    int ans=0,aa;
    bool flag;
    for(char i='a';i<='z';i]]></description><category></category></item><item><title><![CDATA[cf 88b Keyboard]]></title><link>https://blog.youkuaiyun.com/Stool_Monster/article/details/49491613</link><guid>https://blog.youkuaiyun.com/Stool_Monster/article/details/49491613</guid><author>Stool_Monster</author><pubDate>Thu, 29 Oct 2015 14:54:29 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
using namespace std;
#define del(a,b) memset(a,b,sizeof(a))
struct node
{
    int x,y;
}nn[900];
int aa[130];
bool flag;
int n,m,x,q,ans,snum;
char kb[33][33];
string s;
]]></description><category></category></item><item><title><![CDATA[cf #327 Div.2 Problem B Rebranding]]></title><link>https://blog.youkuaiyun.com/Stool_Monster/article/details/49408513</link><guid>https://blog.youkuaiyun.com/Stool_Monster/article/details/49408513</guid><author>Stool_Monster</author><pubDate>Sun, 25 Oct 2015 23:30:13 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
using namespace std;
int n,m;
char aa[30]={'a'};
char s[200005];
char *ss[200005];
char a,b;
int main()
{
    for(int i=1;i<26;i++)
        aa[i]=aa[i-1]+1;
    scanf("%d]]></description><category></category></item><item><title><![CDATA[cf #327 Div.2 Problem A Wizards' Duel]]></title><link>https://blog.youkuaiyun.com/Stool_Monster/article/details/49408493</link><guid>https://blog.youkuaiyun.com/Stool_Monster/article/details/49408493</guid><author>Stool_Monster</author><pubDate>Sun, 25 Oct 2015 23:29:01 +0800</pubDate><description><![CDATA[#include 
#include 
using namespace std;
int main()
{
    int l,p,q;
    scanf("%d%d%d",&l,&p,&q);
    double ans;
    ans=(double)l*1.0/(p+q)*p;
    printf("%lf\n",ans);
    return 0;
}]]></description><category></category></item><item><title><![CDATA[cf 20a BerOS file system]]></title><link>https://blog.youkuaiyun.com/Stool_Monster/article/details/49407289</link><guid>https://blog.youkuaiyun.com/Stool_Monster/article/details/49407289</guid><author>Stool_Monster</author><pubDate>Sun, 25 Oct 2015 21:53:06 +0800</pubDate><description><![CDATA[#include 
#include 
using namespace std;
int main()
{
    string s;
    cin>>s;
    bool flag=false;
    int p=s.length()-1;
    while(s[p]=='/')
        p--;
    if(p==-1)
        s="/";
    else
   ]]></description><category></category></item><item><title><![CDATA[cf 19a World Football Cup]]></title><link>https://blog.youkuaiyun.com/Stool_Monster/article/details/49407051</link><guid>https://blog.youkuaiyun.com/Stool_Monster/article/details/49407051</guid><author>Stool_Monster</author><pubDate>Sun, 25 Oct 2015 21:33:18 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
using namespace std;
struct node
{
    string na;
    int points;
    int scored;
    int missed;
    int dif;
}nn[55];
bool cmp1(const node &n1,const node &n2)]]></description><category></category></item><item><title><![CDATA[cf 18a Triangle]]></title><link>https://blog.youkuaiyun.com/Stool_Monster/article/details/49406105</link><guid>https://blog.youkuaiyun.com/Stool_Monster/article/details/49406105</guid><author>Stool_Monster</author><pubDate>Sun, 25 Oct 2015 20:07:02 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
using namespace std;
int dir[4][2]={-1,0,1,0,0,-1,0,1};
int x[4],y[4];
int a[4];
int get(int a1,int b1,int a2,int b2)
{
    return (a1-a2)*(a1-a2)+(b1-b2)*(b1-b2);
}
int ]]></description><category></category></item><item><title><![CDATA[cf 17a Noldbach problem]]></title><link>https://blog.youkuaiyun.com/Stool_Monster/article/details/49404191</link><guid>https://blog.youkuaiyun.com/Stool_Monster/article/details/49404191</guid><author>Stool_Monster</author><pubDate>Sun, 25 Oct 2015 16:03:28 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
using namespace std;
#define del(a,b) memset(a,b,sizeof(a))
int p[1005];
int pn[1005];
bool f[1005];
int pnum,n,k;
bool isp(int x)
{
    if(x==2)
        return true;
   ]]></description><category></category></item><item><title><![CDATA[cf 5a Chat Server's Outgoing Traffic]]></title><link>https://blog.youkuaiyun.com/Stool_Monster/article/details/49403949</link><guid>https://blog.youkuaiyun.com/Stool_Monster/article/details/49403949</guid><author>Stool_Monster</author><pubDate>Sun, 25 Oct 2015 15:35:56 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
using namespace std;
char s[105];
int num,ans;
int main()
{
    num=0;ans=0;
    while(gets(s))
    {
        if(s[0]=='+')
            num++;
        else if(s]]></description><category></category></item><item><title><![CDATA[cf 16a Flag]]></title><link>https://blog.youkuaiyun.com/Stool_Monster/article/details/49403687</link><guid>https://blog.youkuaiyun.com/Stool_Monster/article/details/49403687</guid><author>Stool_Monster</author><pubDate>Sun, 25 Oct 2015 15:08:35 +0800</pubDate><description><![CDATA[#include 
#include 
using namespace std;
int f[105][105];
int n,m;
char c;
int main()
{
    scanf("%d%d",&n,&m);
    for(int i=0;i<n;i++)
        for(int j=0;j<m;j++)
        {
            cin>>c;
   ]]></description><category></category></item><item><title><![CDATA[cf 15a Cottage Village]]></title><link>https://blog.youkuaiyun.com/Stool_Monster/article/details/49403627</link><guid>https://blog.youkuaiyun.com/Stool_Monster/article/details/49403627</guid><author>Stool_Monster</author><pubDate>Sun, 25 Oct 2015 14:59:33 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
using namespace std;
struct node
{
    double x,a,l,r;
}nn[1005];
int n;
double t;
bool cmp(const node &n1,const node &n2)
{
    return n1.x<n2.x;
}
int main()
{
    scan]]></description><category></category></item><item><title><![CDATA[cf 14a Letter]]></title><link>https://blog.youkuaiyun.com/Stool_Monster/article/details/49402755</link><guid>https://blog.youkuaiyun.com/Stool_Monster/article/details/49402755</guid><author>Stool_Monster</author><pubDate>Sun, 25 Oct 2015 12:22:48 +0800</pubDate><description><![CDATA[#include 
#include 
using namespace std;
int main()
{
    int n,m;
    char c[55][55];
    scanf("%d%d",&n,&m);
    for(int i=0;i<n;i++)
        for(int j=0;j<m;j++)
            cin>>c[i][j];
    int ]]></description><category></category></item></channel></rss>