COMP4650 /COMP6490 Deep Learning

3天干完6个月的活,Claude把模型搬上AMD 一条挺刺激的消息:Anthropic 给投资人的材料里有一张幻灯片,写着它的 Claude Mythos Preview 只花了大约​,就摸清了怎么让另一个 Claude 模型在 AMD 的 MI355X 上跑起来。同一处还写了个对照数字:过去给一块新芯片做推理适配,通常要几十名工程师、​。3 天对 6 个月,这个比值太扎眼,当天中文互联网上就冒出一堆「英伟达的护城河塌了」的说法。我把能翻到的材料都翻了一遍,越看越觉得,塌掉的那一小块是真的,可塌的位置和很多人想的不一样。 阅读详情

Assignment 2 Specification (Version 2)

Machine/Deep Learning and Natural Language Processing

Document Analysis (COMP4650 /COMP6490), 2024 Semester 2

Tasks

This assignment consists of 5 tasks related to classifying job descriptions.

Task 1: Analyse the Document Collection (max 5 marks, indicative)

Familiarise yourself with the following job postings dataset available at

https://www.kaggle.com/datasets/shivamb/real-or-fake-fake-jobposting-prediction/data.

The set contains around 18K job postings, out of which about 800 are fake. Analyse the set; in this linguistic analysis, you may wish to report on not only linguistic characteristics of postings but also describe their structure by comparing and contrasting text under some key posting fields and/or within different categories considered in text classification tasks below.

Report in your PDF file your analysis methods and results (max 360–440 words), supported by possible Tables and Figures plus the list of references. Submit your code as part of your ZIP file.

Task 2: Text Classification with Logistic Regression (max 5+ 5 = 10 marks, indicative)

In Task 2, you will use the dataset from Task 1 to perform. text classification. Recall from the lectures that a text classifier predicts a label for a piece of input text, and such a text classifier can be trained from examples that have the ground truth labels. In Task 2, you will build logistic regression classifiers to label the job descriptions in the dataset.

Task 2 will consider the following two text classification problems:

1. Given a job description (found in the “description” column of the dataset file), predict the required education level of the job (found in the “required_education” column).

a. There are 13 different educational levels found in the “required_education” column of the dataset. To simplify this first classification problem, you can consider only those job postings where the “required_education” column has one of the following three values: “Master’s Degree”, “Bachelor’s Degree”, “High School or equivalent”. You can filter out the other job postings where the required educational level is not one of the above for this first classification problem.

b. You should use only those non-fraudulent job postings (indicated by the “fraudulent” column) to train, validate and test your first classifier.

2. Given a job description, predict whether it is a fraudulent job posing (found in the “fraudulent” column, where 0 indicates a real job posting and 1 indicates a fake job posting).

Imagine a job seeker who has access to many job postings that do not state the required educational level, and some of these job postings may be fake. Hypothetically, the job seeker can apply the second classifier as described above that you will build to detect and filter out the fake job postings, and then apply the first classifier that you will build to identify those job postings that the job seeker is qualified for. For this assignment, however, you will independently train and test the two classifiers.

Part A (max 5 out of the max 10 Task 2 marks, indicative)

A simple approach to building a logistic regression model for text classification is to use Term Frequency x Inverse Document Frequency (TF-IDF) features. This approach is relatively straightforward to implement and can be very hard to beat in practice.

We will provide you with some starting code for the first classification problem, i.e., prediction of the educational level based on a job description. It should be straightforward to adopt the code for the second classification problem once you have completed the code for the first.

Specifically, to build a logistic regression classifier using TF-IDF features, you should first implement the get_features_tfidf function (in features.py) that takes a set of training job descriptions as input and calculates the TF-IDF (sparse) document vectors. You may want to use the TfidfVectorizer in the scikit-learn package. You should use it after reading the documentation. For text preprocessing, you could set the analyzer argument of TfidfVectorizer to the tokenise_text function provided in features.py. Alternatively, you may set appropriate values to the arguments of TfidfVectorizer or write your own text preprocessing code.

Next, implement the search_C function (in classifier.py) to try several values for the regularisation parameter C and select the best based on the accuracy on the validation data. The train_model and eval_model functions provided in the same Python file might be useful for this task. To try regularisation parameters, you should use an automatic hyper-parameter search method presented in the lectures.

You should then run job_classification.py which first reads in the dataset and splits it into training, validation and test sets; it then trains a logistic regression text classifier and evaluate its performance on the test set. Make sure you first uncomment the line with the analyse_classification_tfidf function (which uses your get_features_tfidf function to generate TF-IDF features, and your search_C function to find the best value of C) in the top-level code block of job_classification.py (i.e., the block after the line “if name == ’ main ’:”) and then run job_classification.py.

For training and testing this first classifier, remember to filter out fraudulent job postings and job postings whose required educational level is not among these three values: “Master’s Degree”, “Bachelor’s Degree”, “High School or equivalent”.

Next, modify your code to train and test a second classifier for fraudulent job posting detection, i.e., a binary classification problem where the class labels are found in the “fraudulent” column of the dataset. Because this classifier is independent of the first classifier, here you should use job postings of all educational levels.

Answer the following questions in your answers PDF for each of the two classification problems (max 360–440 words, supported by possible Tables and Figures plus the list of references):

1. What range of values for C did you try? Explain, why this range is reasonable. Also explain what search technique you used and why it is appropriate here.

2. What was the best performing C value?

3. What was your accuracy on the test set?

Also make sure you submit your code as part of your ZIP file.

Part B (max 5 out of the max 10 Task 2 marks, indicative)

Another simple approach to building a text classifier is to train a logistic regression model that uses aggregated pre-trained word embeddings. While this approach, with simple aggregation, normally works best with short sequences, you will try it out on the job descriptions.

Your task is to use Word2Vec in the gensim package to learn embeddings of words and predict the qualifications required of job descriptions using a logistic regression classifier with the aggregated word embedding features. You should use it after reading the documentation.

First implement the train_w2v function (in word2vec.py) using Word2Vec from the gensim package, then implement the search_hyperparamsfunction (in word2vec.py) to tune at least two of the many hyper-parameters of Word2Vec (e.g. vector_size, window, negative, alpha, epochs, etc.) as well as the regularisation parameter C for your logistic regression classifier. You should use an automatic hyper- parameter search method presented in the lectures. (Hint: The search_C function in classifier.py and the get_features_w2v in features.py might be useful.)

Next implement the document_to_vector function in features.py. This function should convert a tokenised document (which is a list of tokenised sentences) into a vector by aggregating the embeddings of the words/tokens in the document using trained Word2Vec word vectors.

Last, you should uncomment the line with the analyse_classification_w2v function (and comment out the line with analyse_classification_tfidf) in the top-level code block of job_classification.py, and then run job_classification.py to train a logistic regression text classifier with the word vectors from your Word2Vec model, and evaluate the classification performance on the test set.

Similar to Part A, train and test two classifiers for the two classification tasks: prediction of the required educational level, and identification of fraudulent job postings.

Answer the following questions in your answers PDF for each of the two classification problems (max 360–440 words, supported by possible Tables and Figures plus the list of references):

1. What hyper-parameters of Word2Vec did you tune? What ranges of values for the hyper parameters did you try? Explain, why the ranges are reasonable. Also explain what search technique you used and why it is appropriate here.

2. What were the best performing values of the hyper-parameters you tuned?

3. What was your accuracy on the test set? Compare it with the accuracy you got in Part A of this question and discuss why one is more accurate than the other.

Also make sure you submit your code as part of your ZIP file.

Task 3: Text Classification with a Transformer Encoder (max 5 marks, indicative)

In this task, you will apply a transformer-based classifier to perform. the same text classification tasks as in Task 2 and compare the classification performance with the results you have got for Task 2.

Specifically, you will train a transformer encoder using PyTorch. An input sequence is first tokenised and a special [CLS] token prepended to the list of tokens. Similar to BERT, the final hidden state (from the transformer encoder) corresponding to the [CLS] token is used as a representation of the input sequence in this text classification task.

First, implement the get_positional_encoding function in job_classifier.py. This function computes the following positional encoding:

t ∈ {0, … , T − 1}

Next, complete the __init__ method of class JobClassifier by creating a TransformerEncoder consisting of a few (determined by parameter num_tfm_layer) TransformerEncoderLayer with the specified input dimension (emb_size), number of heads (num_head), hidden dimension of the feedforward sub-network (ffn_size) and dropout probability (p_dropout). Then implement the forward method of class JobClassifier. You should implement the following steps sequentially in the function:

(a) add the positional encoding to the embeddings of the input sequence;

(b) apply dropout (i.e. call the dropout layer of JobClassifier);

(c) call the transformer encoder you created in the __init__ method; (Hint: make sure you set the parameter src_key_padding_mask to an appropriate value.)

(d) extract the final hidden state of the [CLS] token from the transformer encoder for each sequence in the input (mini-batch);

(e) use the linear layer to compute the logits (i.e., unnormalised probabilities) for binary classification and return the logits.

You should read the documentation before implementing these methods.

Last, complete the train_model function to learn the classifier using the training dataset. You should optimise the model parameters through mini-batch stochastic gradient descent with the Adam optimiser. Make sure you evaluate the model on the validation set after each epoch of training and save the parameters of the model that achieves the best accuracy on the validation set.

You are now able to run job_classifier.py which prepares the training, validation and test datasets, trains a classifier and evaluates its accuracy on the test set. Note that this approach does not directly use the combined training and validation datasets to re-train the model, and we adopt it here for simplicity. Tuning hyper-parameters systematically is not required (but encouraged if you have access to sufficient computational resources) for this question, and setting the hyper-parameters to some reasonable values (from your experience) is acceptable. In your answers PDF, you should record the values of hyper-parameters used in your text classifier.

Similar to Task 2, train and test two classifiers for the two classification tasks: prediction of the required educational level, and identification of fraudulent job postings.

Answer the following questions in your answers PDF for each of the two classification problems (max 360–440 words, supported by possible Tables and Figures plus the list of references):

1. What is the architecture of your classifier? (Hint: you may print your classifier in Python and record the output in your answers PDF.)

2. What was your accuracy on the test set?

3. Compare your classification performance with those you got for Task 2 (Part A and Part B). Discuss the advantages and limitations of the three approaches to job description classification.

Also make sure you submit your code as part of your ZIP file.

Task 4: Text Classification with a Pre-trained Language Model (max 1 + 1.5 = 2.5 marks, indicative)

Pre-trained language models such as BERT and ChatGPT have been widely used for many NLP problems. As you have learned in the lectures, these pre-trained language models have strong capabilities to handle a wide range of tasks with little or no further training. In Task 4, you will use pre-trained language models to perform. the same text classification problem as in Task 2 and Task 3.

Part A (max 1 out of the max 2.5 Task 4 marks, indicative)

In Lab 6, you will see how to fine-tune a smaller version of BERT. Adopt the strategy of fine-tuning DistilBERT as you will learn in Lab 6 on the job posting dataset. Compare the text classification performance of using the original DistilBERT and your fine-tuned DistilBERT on the two classification tasks. Note that you will still use the [CLS] token produced by the model to perform. classification.

Analyse and discuss the results you observe in your answers PDF in free-form. text (max 90–110 words, supported by possible Tables and Figures plus the list of references). Also make sure you submit your code as part of your ZIP file.

Part B (max 1.5 out of the max 2.5 Task 4 marks, indicative)

Prompt-based zero-shot text classification using a pre-trained language model such as ChatGPT has emerged as a new way of classifying text without any training involved. See, for example, the following Hugging Face page that explains how it works:

https://huggingface.co/tasks/zero-shot-classification

In this part of Task 4, use a Large Language Model (LLM) of your choice (e.g., ChatGPT, Gemini, or Llama) to predict the required educational level of a sample of job postings in the dataset and observe the performance of the LLM on the task.

Report your findings in your answers PDF in free-form. text (max 180-220 words, supported by possible Tables and Figures plus the list of references). Things you can consider trying include, but are not limited to, the following (you are not required to do all of them):

• Compare different LLMs on the job posting classification task, using the same subset of data you have sampled.

• Compare the performance of the prompt-based zero-shot method with the previous methods you have tried in Task 2 and Task 3.

• Use the LLM’s API to batch process a large sample of the data for prompt-based zero-shot classification, if you have access to the API. (This requires additional work of understanding the LLM’s API, which is not covered in this course.)

• Discuss the pros and cons of a training-based method you have explored in the earlier parts of the assignment and of this prompt-based zero-shot method.

Note: You do not need to use an LLM to predict whether a job posting is fraudulent in Part B of Task 4. You should submit your code, prompts, or other supporting information as part of your ZIP file.

Task 5: Reflect on Your Learning and Academic Integrity (max 2.5 marks, indicative)

Add a short written, free-form. text answer (max 180-220 words) to reflect on your learning and academic Integrity considerations relevant to your Assignment 2 work in your PDF file. In particular, explain where, how, and why you used Generative AI tools in coding and/or academic writing. Demonstrate your critical thinking skills in analysing and assessing the advantages and disadvantages of this tooling to your learning. If you chose not to use Generative AI tools, reflect on the advantages and disadvantages of this choice to your learning.

如何处理动态语言(Python / JS)的“隐形”调用链? 本文揭示动态语言(Python/JS)中静态AST解析导致调用链“断链”的核心问题,提出通过运行时追踪补全图谱的解决方案。基于Code-Graph-RAG的cgr trace机制,分别利用pytest插件与V8 Profiler捕获真实调用路径,将动态边合并至静态图谱,并在权重体系中提升动态边优先级。实践表明,该方法可显著提升图谱覆盖率,实现“结构+行为”双视角理解代码,为MCP与Rerank系统提供可靠支持。 阅读详情

相关推荐

Playwright: Pytest vs Library vs LibraryAsync:三者如何选?

Python中Playwright的3个Target:Pytest(推荐用于E2E自动化测试,支持报告、并行、重试)、Library(同步脚本,适合爬虫与简单任务,需手动管理浏览器)、LibraryAsync(异步脚本,适用于高并发批量操作)。选择依据:测试项目选Pytest,轻量脚本选Library,高并发场景选LibraryAsync。

SmallBull的博客 227

本地化部署 DeepSeek,构建单细胞与空间转录组 AI 分析平台

本地化部署 DeepSeek,构建单细胞与空间转录组 AI 分析平台

weixin_53637133的博客 187

A-Level CS 计算机科学 考试知识点——考试介绍&第1章

前言:该系列文章是本人在给学生辅导本课程的过程中结合英文教材所总结的,该系列共分为30章,主要介绍了考试的核心知识点。若需要A-Level CS 计算机科学考试辅导也可以私信我。 目录 关于A-Level CS 计算机科学考试 考试简介 考试内容 考试时间 评分情况 第1章 信息表示 本章学习内容 1.01 数字系统 1.02 数字的内部编码 整数编码(Coding for integers) 二进制编码的十进制(Binary coded decimal——BCD) 1.03.

王俊的博客 6459

【第 009 讲】全面掌握 Python 注释:注释的定义与作用 | 单行注释 | 三引号与多行注释 | 注释使用的最佳实践

本文系统讲解 Python 注释的完整知识体系:从注释的定义与作用讲起,梳理单行注释的书写位置、临时屏蔽用法与 PEP 8 排版规范,剖析注释被忽略的底层机制;进而说明三引号字符串的本质与嵌套问题;最后给出注释使用的三条实践原则,帮助读者写好可读性高的注释。

大模型全栈工程师 · Thanks_ks 1159

ubuntu18.04安装Nvidia显卡驱动后黑屏及网络、蓝牙驱动消失的解决方案

ubuntu18.04安装Nvidia显卡驱动后黑屏及网络、蓝牙驱动消失的解决方案

weixin_40735291的博客 6619

OpenCASCADE完整教程专栏完整目录

OpenCASCADE完整教程专栏完整目录

希望我的博客,能帮上你解决学习中工作中所遇到的问题 9711

AI全栈实战 | 3.9-01 爬虫入门:requests 加 BeautifulSoup 三分钟跑通,但 90% 的人栽在这 4 个“礼貌“问题上

⚠️:本文内容仅用于。请遵守目标站点的服务条款与相关法律法规,不得对目标服务造成负担,不得采集、传播个人隐私数据。技术是中性的,边界在你手里。爬虫的入门技术(requests 发请求 + BeautifulSoup 解析)三分钟就能学会。真正区分"会用爬虫"和"会做爬虫的人"的,是这篇我们跑通"请求→解析→存储"的最小闭环,然后重点把"合规与礼貌"这根弦给你绷上。

源码获取 | 运行部署 | 定制二开修改,如果回复不及时请耐心等待,请见谅。 441

YOLOv11改进 | Mamba-YOLOv11-L:基于SSM的高效全局建模,精度与效率的双重突破

摘要: 本文提出Mamba-YOLOv11-L,通过集成状态空间模型(SSM)改进YOLOv11的全局建模能力。针对YOLOv11在复杂场景中全局依赖缺失、精度-效率矛盾等问题,SSM以$O(N)$计算复杂度实现长程语义捕捉。改进后的模型在工业缺陷检测(Recall↑12%)、边缘设备部署(内存↓16%)、多尺度目标检测(小目标mAP↑9%)等场景表现优异,推理速度保持>40 FPS。核心创新包括轻量化SSM模块设计(稀疏状态转移+局部上下文融合)及与YOLOv11骨干的深度集成,代码实现展示了SSM

走向CTO的路上... 572

Python 的 yield from 到底转发了什么:拆开 send、throw 和那个 return 值

很多人把yield from记成「省一层 for 循环的语法糖」。写和写,结果看着一样,于是就当它只是少敲几个字。这个理解会在三个地方翻车:调用方.send()的值送不进去、子生成器return的值拿不到、异常和close()传不下去。yield from真正做的事是,外层生成器退成一个透明通道。本文所有输出来自本机 CPython 3.13.14 实测。yield from不是循环,是委托——nextsendthrowclose四个方向的流量全部直通子生成器,并且子生成器return。

小小张说故事的博客 163

RTK_ROS_导航(1): GNSS里程计

1. RTK 配置 4G CORS + 4G 网络 + 户外有信号,不能实现RTK,就恢复出厂设置 输出信息包含(一般需要三个同时打开): GAPPA:包含位置信息 GPVTG:包含速度信息 GPHDT:包含定向的朝向信息 2. ROS驱动 驱动安装sudo apt install ros-noetic-nmea-navsat-driver 运行,需要修改该功能包的启动端口,会自动解析上面的3个RTK语句信息roslaunch nmea_navsat_driver nmea_serial_d

旋风小短腿 4267

热力学仿真软件:SimScale_(1).SimScale入门与基础操作

导航栏:位于页面顶部,包含项目管理、仿真设置、结果分析等主要功能。项目列表:展示用户创建的所有项目。工作区:用于进行具体的操作,如几何建模、网格划分、边界条件设置等。控制台:显示操作日志和仿真进度。网格划分是将几何模型离散化为一系列小单元的过程,这些单元用于求解热力学方程。SimScale提供了多种网格划分方法,包括结构化网格和非结构化网格。SimScale提供了丰富的API接口,用户可以通过编程语言进行二次开发,实现自动化仿真和结果分析。项目管理:创建、删除和管理项目。几何建模:创建、导入和修复几何模型。

kkchenjj的博客 1875

从一段视频到可漫游的 4D 有声场景:思路拆解与最小复现手记

只需一段手机视频,你就能生成可"走进去"的 4D 有声场景:转头时狗叫声方向随之变化,走近时声音更清晰。本文拆解 Video-to-4DAVScene 的核心思路,手把手带你用几十行 Python 搭出最小管线,把视频中的运动物体变成带空间位置的声源,并附上三个真实踩坑的排障经验,代码可直接跑。🎧

helloagent的博客 246

ISO13849功能安全从入门到精通(3):安全功能及其对降低风险的贡献4

例如,如果机器必须在有限速度下运行时进行设置,那么在低加速度值下进行设置时,参数P1将是正确的选择:随着危险缓慢出现并给予足够的运动自由,操作员将能够移出危险区域。例如,在无故障的条件下,在操作者的手的方向移动的滚子不能陷住它。在所有其他情况下,F1是正确的选择,前提是危险暴露的持续时间不超过机器总操作时间的1/20。需求来源于必要的风险降低。由于这些考虑而降低的PLr在任何情况下都不得低于通过比较方式考虑的机器的PLr,因为并不能从事故发生率低和严重程度低得出实施的安全功能提供的安全水平高于要求。

wdconan001的博客 837

【每天一个 Python 小案例30】Python 基础知识综合小项目:我的工具盒

作为系列收官,本篇把前 29 篇的知识点合成一个能直接用的命令行工具"我的工具盒":计算器(用 ast 解析表达式,不碰 eval)、单位换算与温度转换(一张换算表 + 特例分支)、记账与分类统计(Decimal + JSON 持久化)、以及用"字典当命令表"把菜单和业务逻辑解耦的主循环。文中对比了 eval 的安全隐患与 ast 白名单的做法,解释了 lambda 闭包在字典里的写法与晚绑定陷阱,并在最后给出整个系列的知识地图,把变量、数据结构、控制流、函数、类、异常、文件、标准库八块内容对应到具体篇目。

xinjiyaya的博客 432

【Scratch考级100图】图01-等级考试scratch绘 画正方形

一、案例介绍 小朋友们应该在数学课或者平时生活中有了解过正方形,正方形在我们生活中到处可见,那我们如果通过Scratch软件来绘制一个正方形呢,我们一起来学习一下吧,在舞台正中央绘制一个边长为200的正方形,要求: 1、围绕舞台中心绘制正多边形,均匀分布在四个象限中 2、正方形边长为200个单位,线条粗细、颜色自定 3、利用画笔绘制正方形,不能有多余的线条 二、案例演示 【Scratch案例演示】Scratch图1-画正方形 三、案例分析 当我们点击小绿旗启动程序后,舞台上会出现一个画

青少年编程学习指导 2671

jdk-8u144-linux-x64.tar.gz.

该资源为搭建Linux系统Java环境用,资源的后缀为tar.gz格式的压缩包

双路径优化+双容差校准

默认使用向量化路径处理常规数据,当检测到内存非连续或需要极致短路性能时,自动切换至 Numba JIT 路径。“当 CI 宽度中位数为 $W$ 时,实际判定容差为 $10^{-12} + 10^{-9} \times W$"针对表征谱算子 2 的实际输出量纲(例如 $10^{-3}$ 至 $10^3$),调整。准确标记了哪些数组被复制。非短路、静默拷贝风险、量纲耦合容差),本方案重构了核心逻辑。,并完善审计元数据以记录内存拷贝状态。, 确保在不同量纲下判定标准的一致性。,否则需排查上游数据生成逻辑。

2301_77211362的博客 202

Camera2Demo

在Camera2 的基础上进行封装,使得Camera2一堆初始化逻辑与Activity分离,降低耦合度,完成预览拍照并保存的操作

yolo 和 deft 算法的区别

你应该是打错了:是,不是 defrat;

曾大强博客 274

LinePhone3.2.7(android端最新版本) sip客户端

SIP客户端For android:LinePhone3.2.7(最新版本),官网地址:http://www.linphone.org/

假人有限元模型

假人模型,车辆碰撞假人有限元模型,适合做乘员安全的研究者利用

蓝桥杯·全国青少年信息素养大赛·电子学会Python/C++考级 备考:莫队算法离线区间查询详解

备赛进行时:第十八届蓝桥杯软件赛报名已于 2026-10-08 10:00 开启、12-18 14:00 截止,省赛定在 2027-04-10(C/C++·Python 程序设计 9:00–13:00);中国电子学会 2026 年 12 月软件编程(C/C++ 一级至十级、Python 一级至六级)考级报名 9/23–12/2 16:00、统考 12-12;全国青少年信息素养大赛 2026—2027 赛季算法应用主题赛也已进入复盘练兵窗口。

IT_Scratch的博客 184

两张表合并之后,行数悄悄多了一倍

pandas merge 行数异常膨胀源于右表键不唯一,导致数据静默复制。实测显示,未聚合的右表(756行)与左表合并后行数增至504行,合计膨胀3.5倍,但无报错。validate 参数仅在检查键唯一性时有效,one_to_one 和 many_to_one 可拦截问题,但需结合 duplicated() 前置检查。正确做法为先按键聚合右表,再合并,避免重复。建议合并前后核对行数、合计,并使用 indicator=True 排查匹配情况,确保数据一致性。

patrickstar231的博客 251

我用 200 行代码写了个“代码屎山检测器“,扫完公司的老项目后我沉默了

这个工具不能帮你把屎山铲平,但至少能让你知道自己面对的是多大的山,也能在代码评审时用数据说话——“这个 PR 把圈复杂度从 12 推到了 18,能不能拆一下?毕竟,不能量化的东西,就没法改进。

xixiaoyunya的博客 272

智慧农业实战:育秧车间秧盘计数与苗情分级的Python实现

首先,建立统一的数据结构,保存每盘秧苗的编号、批次、覆盖度、叶色得分和播种天数。A = "壮苗"B = "合格苗"C = "弱苗"@dataclassdays: int。

荆棘鸟智能的博客 138

Java Arrays.asList 常见坑详解|UnsupportedOperationException、数组联动、基本类型 bug

解析 Arrays.asList 常见开发陷阱,演示 UnsupportedOperationException、底层数组引用共享、基本类型数组问题,区分 Arrays 内部 ArrayList 与 java.util.ArrayList,给出数组转 List 的各种场景正确代码。

weixin_42617033的博客 511

【每天一个 Python 小案例29】Python 实现商品购物车

本篇实现一个购物车:商品目录、加入商品、修改数量、移除商品、查看小计、计算满减与 VIP 折扣、结算扣库存。核心设计是"目录与购物车分离"——目录存商品主数据,购物车只存 {商品编号: 数量};金额一律用 Decimal 并做 ROUND_HALF_UP 舍入。折扣部分讲清阶梯满减的匹配顺序(阈值从高到低、命中即停)与叠加顺序(先满减、后打折),并用一次完整结算演示 706 元如何变成 613.70 元。

xinjiyaya的博客 219

Python的字典

Python字典是存储键值对的数据结构,通过键(key)快速查找对应的值(value)。可使用{}定义,支持增删改查操作:通过dict[key]查询或修改值,get()方法安全获取并设置默认值,del dict[key]删除键值对,keys()、values()和items()用于遍历。items()结合双变量循环可高效遍历所有键值对,提升代码可读性与灵活性。

qq_43010954的博客 199

黄仁勋走了,护城河留下了什么

11 月 12 日,英伟达董事会批准黄仁勋辞去总裁、CEO 和董事职务,即刻生效,CFO 克雷斯出任临时 CEO;股价开盘一度跌 14.35%,收盘只跌 4.34%,市值单日蒸发 1820 亿美元;本文把「创始人走了护城河就没了」这个流行说法拆开——CUDA 还在,但 CUDA 正在被 Claude 三天凿穿,真正决定下一段路的是三个可以核对的东西:治理结构、决策机制、以及下一个百亿美元由谁拍板。

领码SPARK - 以无代码之星火,燎原数字之未来! 187

【AI 开发从入门到进阶 · 09】RAG 实战:用 Embedding + FAISS 从零搭建本地知识库问答(含切分、重排与幻觉控制)

本文系统讲解RAG(检索增强生成)的实现与优化,从为何选择RAG而非提示工程或微调出发,完整演示一条可运行的中文RAG链路:文档加载、递归切分、向量化、FAISS索引构建、混合检索与Prompt生成。重点剖析五大关键环节——切分策略、Embedding选型、混合检索、重排(Rerank)及幻觉控制,并强调分模块评估的重要性。附常见问题排查与生产实践建议,为构建高效、可信的企业知识问答系统提供完整指南。

信息安全领域优质创作者|操作系统领域专家 95
上一篇: The MLEnd Deception Dataset
下一篇: CIV6782 Climate resilient water
wx____codehelp
博客等级 码龄2年 538粉丝 99原创
评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付:10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值