<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[J_M_Kirito的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/J_M_Kirito</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; J_M_Kirito]]></copyright><item><title><![CDATA[书生大模型实战营基础岛 - OpenCompass 评测 InternLM-1.8B 实践]]></title><link>https://blog.youkuaiyun.com/J_M_Kirito/article/details/141106024</link><guid>https://blog.youkuaiyun.com/J_M_Kirito/article/details/141106024</guid><author>J_M_Kirito</author><pubDate>Sun, 11 Aug 2024 16:23:46 +0800</pubDate><description><![CDATA[打开 opencompass文件夹下configs/models/hf_internlm/的。设置环境变量并开始评测，这个过程巨慢！]]></description><category></category></item><item><title><![CDATA[书生大模型实战营基础岛 - LlamaIndex RAG 实践]]></title><link>https://blog.youkuaiyun.com/J_M_Kirito/article/details/141105701</link><guid>https://blog.youkuaiyun.com/J_M_Kirito/article/details/141105701</guid><author>J_M_Kirito</author><pubDate>Sun, 11 Aug 2024 14:57:59 +0800</pubDate><description><![CDATA[基于 LlamaIndex 构建自己的 RAG 知识库，寻找一个问题 A 在使用 LlamaIndex 之前InternLM2-Chat-1.8B模型不会回答，借助 LlamaIndex 后 InternLM2-Chat-1.8B 模型具备回答 A 的能力，截图保存。这里我们看到由于xtuner比较新，模型并没有准确描述出来，而是称之为音乐播放软件。然后再运行进行提问，回答正确！开始RAG，先安装安装。]]></description><category></category></item><item><title><![CDATA[书生大模型实战营基础岛 - XTuner微调个人小助手认知]]></title><link>https://blog.youkuaiyun.com/J_M_Kirito/article/details/141104055</link><guid>https://blog.youkuaiyun.com/J_M_Kirito/article/details/141104055</guid><author>J_M_Kirito</author><pubDate>Sun, 11 Aug 2024 14:18:33 +0800</pubDate><description><![CDATA[使用 XTuner 微调 InternLM2-Chat-1.8B 实现自己的小助手认知。]]></description><category></category></item><item><title><![CDATA[书生大模型实战营基础岛 - 书生大模型全链路开源开放体系]]></title><link>https://blog.youkuaiyun.com/J_M_Kirito/article/details/141098277</link><guid>https://blog.youkuaiyun.com/J_M_Kirito/article/details/141098277</guid><author>J_M_Kirito</author><pubDate>Sun, 11 Aug 2024 00:03:45 +0800</pubDate><description><![CDATA[最近一年团队对大模型的全链路进行了打通，包括：数据收集整理，数据标注，模型训练、微调、评测，基于模型的agent、rag、搜索引擎，ai应用的部署都进行了方案实现和开源。(XTuner, Lmdeploy等等)]]></description><category></category></item><item><title><![CDATA[书生大模型实战营基础岛 - LangGPT结构化提示词编写实践]]></title><link>https://blog.youkuaiyun.com/J_M_Kirito/article/details/141095153</link><guid>https://blog.youkuaiyun.com/J_M_Kirito/article/details/141095153</guid><author>J_M_Kirito</author><pubDate>Sat, 10 Aug 2024 20:52:47 +0800</pubDate><description><![CDATA[基于LMDeploy将开源的InternLM2-chat-1_8b模型部署为OpenAI格式的通用接口。近期相关研究发现，LLM在对比浮点数字时表现不佳，经验证，internlm2-chat-1.8b (internlm2-chat-7b)也存在这一问题，例如认为。以下是我设计的提示词（运用了few-shot提示特性），以及使用提示词前后的运行结果，小伙伴在图形界面测试时记得先保存设置哦。这一节我们要自己配一下环境，如果之前已经配过也可以直接用。请你利用LangGPT优化提示词，使LLM输出正确结果。]]></description><category></category></item><item><title><![CDATA[书生大模型实战营基础岛 - 8GB显存玩转书生大模型demo]]></title><link>https://blog.youkuaiyun.com/J_M_Kirito/article/details/141091548</link><guid>https://blog.youkuaiyun.com/J_M_Kirito/article/details/141091548</guid><author>J_M_Kirito</author><pubDate>Sat, 10 Aug 2024 15:49:07 +0800</pubDate><description><![CDATA[首先我们需要创建一个10%的开发及，镜像要选择cuda-12.2。]]></description><category></category></item><item><title><![CDATA[【书生浦语大模型实战营第三期】入门岛 Python基础知识]]></title><link>https://blog.youkuaiyun.com/J_M_Kirito/article/details/140898066</link><guid>https://blog.youkuaiyun.com/J_M_Kirito/article/details/140898066</guid><author>J_M_Kirito</author><pubDate>Sat, 03 Aug 2024 22:38:48 +0800</pubDate><description><![CDATA[请使用本地vscode连接远程开发机，将上面你写的wordcount函数在开发机上进行debug，体验debug的全流程，并完成一份debug笔记(需要截图)。我们可以在调试控制台输出我们想要查看的变量，也可以在侧边栏添加监视。返回一个字典，key为单词，value为对应单词出现的次数。我们这里先用正则表达式实现分词操作得到一个列表word_counter，遍历这个列表，统计单词出现次数再输出。比如这里我们想看一下words的类型，可以在左边添加监视，我们看到其为。]]></description><category></category></item><item><title><![CDATA[【书生浦语大模型实战营第三期】入门岛 Linux基础知识]]></title><link>https://blog.youkuaiyun.com/J_M_Kirito/article/details/140896695</link><guid>https://blog.youkuaiyun.com/J_M_Kirito/article/details/140896695</guid><author>J_M_Kirito</author><pubDate>Sat, 03 Aug 2024 21:04:07 +0800</pubDate><description><![CDATA[先用Vscode安装remote ssh插件，在远程资源管理器中添加一个SSH Target赋值如下命令。运行后vscode会自动进行端口映射，本地访问127.0.0.1:7860就OK了。这里面的端口号和密码可以在开发机界面的SSH连接部分得到，复制过去就可以了。]]></description><category></category></item><item><title><![CDATA[数据结构之线性表应用：一元多项式相加]]></title><link>https://blog.youkuaiyun.com/J_M_Kirito/article/details/105776939</link><guid>https://blog.youkuaiyun.com/J_M_Kirito/article/details/105776939</guid><author>J_M_Kirito</author><pubDate>Sun, 26 Apr 2020 21:05:52 +0800</pubDate><description><![CDATA[#include &lt;bits/stdc++.h&gt;
using namespace std;

#define MAX 30
typedef struct
{
    float coef;
    int exp;
}PolyArray[MAX];
struct PolyNode
{
    float coef;
    int exp;
    PolyNode *next;
};...]]></description><category></category></item><item><title><![CDATA[Preliminaries for Benelux Algorithm Programming Contest 2018   A.Appalling Architecture]]></title><link>https://blog.youkuaiyun.com/J_M_Kirito/article/details/105717867</link><guid>https://blog.youkuaiyun.com/J_M_Kirito/article/details/105717867</guid><author>J_M_Kirito</author><pubDate>Thu, 23 Apr 2020 21:35:18 +0800</pubDate><description><![CDATA[题目链接
注意要进行四舍五入
#include &lt;bits/stdc++.h&gt;
using namespace std;
int n, m;
char mp[110][110];
int main()
{
	cin&gt;&gt;n&gt;&gt;m;
	for(int i = 1; i &lt;= n; i++)
		scanf("%s", mp[i] + 1);
	int num ...]]></description><category></category></item><item><title><![CDATA[UCF Local Programming Contest 2015（Practice）  A.Symmetric Diagonals]]></title><link>https://blog.youkuaiyun.com/J_M_Kirito/article/details/105717665</link><guid>https://blog.youkuaiyun.com/J_M_Kirito/article/details/105717665</guid><author>J_M_Kirito</author><pubDate>Thu, 23 Apr 2020 21:26:33 +0800</pubDate><description><![CDATA[题目链接
被输出格式狠狠教育，连wa3发，注意输出时结尾不要有多余的空格
#include &lt;bits/stdc++.h&gt;
using namespace std;

char m[20][20];
int n,r;//r表示请求数
int cnt1=1,cnt2=1;

void fuck(int k)
{
    int a=n-k+1;
    int b=k;
    for(...]]></description><category></category></item><item><title><![CDATA[蓝桥杯 k好数（dp）]]></title><link>https://blog.youkuaiyun.com/J_M_Kirito/article/details/104720924</link><guid>https://blog.youkuaiyun.com/J_M_Kirito/article/details/104720924</guid><author>J_M_Kirito</author><pubDate>Sat, 07 Mar 2020 20:12:16 +0800</pubDate><description><![CDATA[试题 算法训练 K好数
题目链接
资源限制
时间限制：1.0s   内存限制：256.0MB
问题描述
如果一个自然数N的K进制表示中任意的相邻的两位都不是相邻的数字，那么我们就说这个数是K好数。求L位K进制数中K好数的数目。例如K = 4，L = 2的时候，所有K好数为11、13、20、22、30、31、33 共7个。由于这个数目很大，请你输出它对1000000007取模后的值。
输入格式
输入...]]></description><category></category></item><item><title><![CDATA[牛牛找工作（排序）]]></title><link>https://blog.youkuaiyun.com/J_M_Kirito/article/details/104648929</link><guid>https://blog.youkuaiyun.com/J_M_Kirito/article/details/104648929</guid><author>J_M_Kirito</author><pubDate>Wed, 04 Mar 2020 10:54:03 +0800</pubDate><description><![CDATA[题目没有给出时间范围，第一次写出之后T了。
题目链接
下面是超时做法：时间复杂度为O(mn)
#include &lt;bits/stdc++.h&gt;
using namespace std;
int N,M;
#define LL long long 
typedef pair&lt;LL,LL&gt; PII;

pair&lt;LL ,LL &gt; a[100005];
pair&lt...]]></description><category></category></item><item><title><![CDATA[蓝桥杯 合根植物（并查集）]]></title><link>https://blog.youkuaiyun.com/J_M_Kirito/article/details/104253796</link><guid>https://blog.youkuaiyun.com/J_M_Kirito/article/details/104253796</guid><author>J_M_Kirito</author><pubDate>Mon, 10 Feb 2020 20:03:43 +0800</pubDate><description><![CDATA[这道题是一道并查集的模板题，借此机会复习一下模板。
开一个cnt数组记录一下每个集合的祖宗节点，最后统计一下个数
原题链接
#include &lt;bits/stdc++.h&gt;
using namespace std;
int m,n,k,num=0;
int a,b;
const int T=1000005;
int p[T],cnt[T];
int find(int x)//寻找祖宗节...]]></description><category></category></item><item><title><![CDATA[hdu1180诡异的楼梯（bfs）]]></title><link>https://blog.youkuaiyun.com/J_M_Kirito/article/details/104220703</link><guid>https://blog.youkuaiyun.com/J_M_Kirito/article/details/104220703</guid><author>J_M_Kirito</author><pubDate>Sat, 08 Feb 2020 11:36:33 +0800</pubDate><description><![CDATA[最近做题缺乏手感，找一道bfs练一练
题目链接
这种题目属于最简单的那种bfs，需要注意的是遇到楼梯时的处理，如果不满足通过楼梯的条件，则需要退回到原位置等待，此时原位置也需要入队。
#include &lt;bits/stdc++.h&gt;
using namespace std;
char maps[22][22];
bool st[22][22];
int n,m;
int dir[][2...]]></description><category></category></item><item><title><![CDATA[吃糖果]]></title><link>https://blog.youkuaiyun.com/J_M_Kirito/article/details/104194542</link><guid>https://blog.youkuaiyun.com/J_M_Kirito/article/details/104194542</guid><author>J_M_Kirito</author><pubDate>Thu, 06 Feb 2020 12:32:23 +0800</pubDate><description><![CDATA[原题链接
# include &lt;iostream&gt;
# include &lt;cstdio&gt;
# include &lt;queue&gt;
# include &lt;cstring&gt;
# include &lt;algorithm&gt;
using namespace std;
/*很容易想到根据每种颜色糖果总数量从多到少排序，若总数量相同，则按水果糖数量从
多到少...]]></description><category></category></item><item><title><![CDATA[洛谷p1200（简单字符串）]]></title><link>https://blog.youkuaiyun.com/J_M_Kirito/article/details/104184774</link><guid>https://blog.youkuaiyun.com/J_M_Kirito/article/details/104184774</guid><author>J_M_Kirito</author><pubDate>Wed, 05 Feb 2020 16:43:36 +0800</pubDate><description><![CDATA[简单题目，无需劳神
原题链接

#include &lt;bits/stdc++.h&gt;
using namespace std;
int value[27];
string a,b;
int main()
{	
	cin&gt;&gt;a&gt;&gt;b;
	int vala=1,valb=1;
	for(int i=0;i&lt;a.size();i++)
	{
		vala*=a[i]...]]></description><category></category></item><item><title><![CDATA[洛谷p1598]]></title><link>https://blog.youkuaiyun.com/J_M_Kirito/article/details/104184346</link><guid>https://blog.youkuaiyun.com/J_M_Kirito/article/details/104184346</guid><author>J_M_Kirito</author><pubDate>Wed, 05 Feb 2020 16:19:38 +0800</pubDate><description><![CDATA[字符串处理的时候注意处理空格
原题链接](https://www.luogu.com.cn/problem/P1598)
#include &lt;bits/stdc++.h&gt;
using namespace std;
int value[27];
string s;
int main()
{	
	memset(value,0,sizeof value);
	for(int i=1;i&lt...]]></description><category></category></item><item><title><![CDATA[洛谷p1443（bfs）]]></title><link>https://blog.youkuaiyun.com/J_M_Kirito/article/details/100095142</link><guid>https://blog.youkuaiyun.com/J_M_Kirito/article/details/100095142</guid><author>J_M_Kirito</author><pubDate>Tue, 27 Aug 2019 10:39:56 +0800</pubDate><description><![CDATA[题目链接：洛谷p1443
没什么好说的，简单的bfs，注意左对齐的格式，x对应行，y对应列
上代码。
#include &lt;bits/stdc++.h&gt;
using namespace std;
typedef pair&lt;int,int&gt; p;
int dx[]={1,1,2,2,-1,-1,-2,-2};
int dy[]={2,-2,1,-1,2,-2,1,-1};
in...]]></description><category></category></item><item><title><![CDATA[洛谷p1162（bfs）]]></title><link>https://blog.youkuaiyun.com/J_M_Kirito/article/details/100085025</link><guid>https://blog.youkuaiyun.com/J_M_Kirito/article/details/100085025</guid><author>J_M_Kirito</author><pubDate>Mon, 26 Aug 2019 20:15:11 +0800</pubDate><description><![CDATA[洛谷p1162（bfs）
把0全变成2，再bfs，代码如下
#include &lt;bits/stdc++.h&gt;
using namespace std;
typedef pair&lt;int,int&gt; p;
int dx[]={0,0,1,-1};
int dy[]={1,-1,0,0};
int maps[50][50];
int n;
void bfs(int x,int y...]]></description><category></category></item></channel></rss>