pr2e69p7n
/
Harry
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Compare commits

merge into: pr2e69p7n:master
Branches Tags
pr2e69p7n:bai
pr2e69p7n:main
pr2e69p7n:master
...
pull from: pr2e69p7n:main
Branches Tags
pr2e69p7n:bai
pr2e69p7n:main
pr2e69p7n:master

No commits in common. 'master' and 'main' have entirely different histories.
master ... main

2 changed files with 136 additions and 225 deletions
Show Stats

136
answer_search.py
Unescape View File

@ -0,0 +1,136 @@
#!/usr/bin/env python3
# coding: utf-8
# File: answer_search.py
# Author: lhy<lhy_in_blcu@126.com,https://huangyong.github.io>
# Date: 18-10-5
from py2neo import Graph
class AnswerSearcher:
def __init__(self):
self.g = Graph(
host="127.0.0.1",
port=7687,
user="neo4j",
password="72dkiwks")
self.num_limit = 20
'''执行cypher查询，并返回相应结果'''
def search_main(self, sqls):
final_answers = []
for sql_ in sqls:
question_type = sql_['question_type']
queries = sql_['sql']
answers = []
for query in queries:
ress = self.g.run(query).data()
answers += ress
final_answer = self.answer_prettify(question_type, answers)
if final_answer:
final_answers.append(final_answer)
return final_answers
'''根据对应的qustion_type，调用相应的回复模板'''
def answer_prettify(self, question_type, answers):
final_answer = []
if not answers:
return ''
if question_type == 'disease_symptom':
desc = [i['n.name'] for i in answers]
subject = answers[0]['m.name']
final_answer = '{0}的症状包括：{1}'.format(subject, '；'.join(list(set(desc))[:self.num_limit]))
elif question_type == 'symptom_disease':
desc = [i['m.name'] for i in answers]
subject = answers[0]['n.name']
final_answer = '症状{0}可能染上的疾病有：{1}'.format(subject, '；'.join(list(set(desc))[:self.num_limit]))
elif question_type == 'disease_cause':
desc = [i['m.cause'] for i in answers]
subject = answers[0]['m.name']
final_answer = '{0}可能的成因有：{1}'.format(subject, '；'.join(list(set(desc))[:self.num_limit]))
elif question_type == 'disease_prevent':
desc = [i['m.prevent'] for i in answers]
subject = answers[0]['m.name']
final_answer = '{0}的预防措施包括：{1}'.format(subject, '；'.join(list(set(desc))[:self.num_limit]))
elif question_type == 'disease_lasttime':
desc = [i['m.cure_lasttime'] for i in answers]
subject = answers[0]['m.name']
final_answer = '{0}治疗可能持续的周期为：{1}'.format(subject, '；'.join(list(set(desc))[:self.num_limit]))
elif question_type == 'disease_cureway':
desc = [';'.join(i['m.cure_way']) for i in answers]
subject = answers[0]['m.name']
final_answer = '{0}可以尝试如下治疗：{1}'.format(subject, '；'.join(list(set(desc))[:self.num_limit]))
elif question_type == 'disease_cureprob':
desc = [i['m.cured_prob'] for i in answers]
subject = answers[0]['m.name']
final_answer = '{0}治愈的概率为（仅供参考）：{1}'.format(subject, '；'.join(list(set(desc))[:self.num_limit]))
elif question_type == 'disease_easyget':
desc = [i['m.easy_get'] for i in answers]
subject = answers[0]['m.name']
final_answer = '{0}的易感人群包括：{1}'.format(subject, '；'.join(list(set(desc))[:self.num_limit]))
elif question_type == 'disease_desc':
desc = [i['m.desc'] for i in answers]
subject = answers[0]['m.name']
final_answer = '{0},熟悉一下：{1}'.format(subject, '；'.join(list(set(desc))[:self.num_limit]))
elif question_type == 'disease_acompany':
desc1 = [i['n.name'] for i in answers]
desc2 = [i['m.name'] for i in answers]
subject = answers[0]['m.name']
desc = [i for i in desc1 + desc2 if i != subject]
final_answer = '{0}的症状包括：{1}'.format(subject, '；'.join(list(set(desc))[:self.num_limit]))
elif question_type == 'disease_not_food':
desc = [i['n.name'] for i in answers]
subject = answers[0]['m.name']
final_answer = '{0}忌食的食物包括有：{1}'.format(subject, '；'.join(list(set(desc))[:self.num_limit]))
elif question_type == 'disease_do_food':
do_desc = [i['n.name'] for i in answers if i['r.name'] == '宜吃']
recommand_desc = [i['n.name'] for i in answers if i['r.name'] == '推荐食谱']
subject = answers[0]['m.name']
final_answer = '{0}宜食的食物包括有：{1}\n推荐食谱包括有：{2}'.format(subject, ';'.join(list(set(do_desc))[:self.num_limit]), ';'.join(list(set(recommand_desc))[:self.num_limit]))
elif question_type == 'food_not_disease':
desc = [i['m.name'] for i in answers]
subject = answers[0]['n.name']
final_answer = '患有{0}的人最好不要吃{1}'.format('；'.join(list(set(desc))[:self.num_limit]), subject)
elif question_type == 'food_do_disease':
desc = [i['m.name'] for i in answers]
subject = answers[0]['n.name']
final_answer = '患有{0}的人建议多试试{1}'.format('；'.join(list(set(desc))[:self.num_limit]), subject)
elif question_type == 'disease_drug':
desc = [i['n.name'] for i in answers]
subject = answers[0]['m.name']
final_answer = '{0}通常的使用的药品包括：{1}'.format(subject, '；'.join(list(set(desc))[:self.num_limit]))
elif question_type == 'drug_disease':
desc = [i['m.name'] for i in answers]
subject = answers[0]['n.name']
final_answer = '{0}主治的疾病有{1},可以试试'.format(subject, '；'.join(list(set(desc))[:self.num_limit]))
elif question_type == 'disease_check':
desc = [i['n.name'] for i in answers]
subject = answers[0]['m.name']
final_answer = '{0}通常可以通过以下方式检查出来：{1}'.format(subject, '；'.join(list(set(desc))[:self.num_limit]))
elif question_type == 'check_disease':
desc = [i['m.name'] for i in answers]
subject = answers[0]['n.name']
final_answer = '通常可以通过{0}检查出来的疾病有{1}'.format(subject, '；'.join(list(set(desc))[:self.num_limit]))
return final_answer
if __name__ == '__main__':
searcher = AnswerSearcher()

225
shangji.cpp
Unescape View File

@ -1,225 +0,0 @@
#include <stdio.h>
#include <windows.h>
#include <process.h>
#include <time.h>
// 全局变量
volatile int parking_spot_available = 1;
volatile int turn = 0;
volatile int flag[2] = { 0, 0 };
volatile int success_count[3] = { 0, 0, 0 };
volatile int cpu_usage[3] = { 0, 0, 0 }; // CPU占用计数器
volatile int conflict_count = 0;
// 算法A：值日法（单标志法）
DWORD WINAPI algorithm_a(LPVOID param) {
int thread_id = (int)param;
int attempts = 40;
for (int i = 0; i < attempts; i++) {
// 繁忙等待 - 等待轮到自己
while (turn != thread_id) {
cpu_usage[thread_id]++; // 记录CPU占用
}
// 进入临界区
if (parking_spot_available) {
Sleep(5); // 模拟使用车位
success_count[thread_id]++;
parking_spot_available = 0;
parking_spot_available = 1;
}
// 让下一个线程有机会
turn = (thread_id + 1) % 3;
Sleep(1);
}
return 0;
}
// 算法B：双标志检查法
DWORD WINAPI algorithm_b(LPVOID param) {
int thread_id = (int)param;
int attempts = 40;
int local_conflicts = 0;
for (int i = 0; i < attempts; i++) {
int wait_count = 0;
int max_wait = 10000;
// 第一步：设置自己的标志为TRUE
flag[thread_id % 2] = 1;
// 第二步：检查其他线程的标志
int other_thread = (thread_id + 1) % 3;
while (flag[other_thread % 2] && wait_count < max_wait) {
cpu_usage[thread_id]++; // 记录CPU占用
wait_count++;
if (wait_count % 1000 == 0) {
Sleep(1);
}
}
if (wait_count >= max_wait) {
flag[thread_id % 2] = 0;
Sleep(10);
continue;
}
// 检查是否违反互斥
if (!parking_spot_available) {
local_conflicts++;
conflict_count++;
}
// 进入临界区
if (parking_spot_available) {
Sleep(5);
success_count[thread_id]++;
parking_spot_available = 0;
parking_spot_available = 1;
}
// 离开临界区
flag[thread_id % 2] = 0;
Sleep(1);
}
return 0;
}
// 算法C：Peterson算法
DWORD WINAPI algorithm_c(LPVOID param) {
int thread_id = (int)param;
int attempts = 40;
if (thread_id == 2) {
// 第三个线程使用简单等待
for (int i = 0; i < attempts; i++) {
while (!parking_spot_available) {
cpu_usage[thread_id]++; // 记录CPU占用
}
if (parking_spot_available) {
Sleep(5);
success_count[thread_id]++;
parking_spot_available = 0;
parking_spot_available = 1;
}
Sleep(1);
}
return 0;
}
// 线程0和1使用Peterson算法
for (int i = 0; i < attempts; i++) {
flag[thread_id] = 1;
turn = 1 - thread_id;
while (flag[1 - thread_id] && turn == 1 - thread_id) {
cpu_usage[thread_id]++; // 记录CPU占用
}
if (parking_spot_available) {
Sleep(5);
success_count[thread_id]++;
parking_spot_available = 0;
parking_spot_available = 1;
}
flag[thread_id] = 0;
Sleep(1);
}
return 0;
}
// 测试函数
void test_algorithm(int algorithm_type) {
HANDLE threads[3];
DWORD threadIDs[3];
// 重置计数器
for (int i = 0; i < 3; i++) {
success_count[i] = 0;
cpu_usage[i] = 0;
}
parking_spot_available = 1;
turn = 0;
flag[0] = 0;
flag[1] = 0;
conflict_count = 0;
printf("\n=== 测试算法 %c ===\n", 'A' + algorithm_type - 1);
// 创建线程
for (int i = 0; i < 3; i++) {
switch (algorithm_type) {
case 1:
threads[i] = CreateThread(NULL, 0, algorithm_a, (LPVOID)i, 0, &threadIDs[i]);
break;
case 2:
threads[i] = CreateThread(NULL, 0, algorithm_b, (LPVOID)i, 0, &threadIDs[i]);
break;
case 3:
threads[i] = CreateThread(NULL, 0, algorithm_c, (LPVOID)i, 0, &threadIDs[i]);
break;
}
}
// 等待所有线程完成
WaitForMultipleObjects(3, threads, TRUE, INFINITE);
// 输出结果
printf("成功抢到次数:\n");
printf(" 线程0: %d次\n", success_count[0]);
printf(" 线程1: %d次\n", success_count[1]);
printf(" 线程2: %d次\n", success_count[2]);
printf(" 总计: %d次\n", success_count[0] + success_count[1] + success_count[2]);
printf("\nCPU占用(繁忙等待循环次数):\n");
printf(" 线程0: %d次\n", cpu_usage[0]);
printf(" 线程1: %d次\n", cpu_usage[1]);
printf(" 线程2: %d次\n", cpu_usage[2]);
printf(" 总计: %d次\n", cpu_usage[0] + cpu_usage[1] + cpu_usage[2]);
if (conflict_count > 0) {
printf("\n*** 检测到%d次冲突（违反互斥） ***\n", conflict_count);
}
// 关闭线程句柄
for (int i = 0; i < 3; i++) {
CloseHandle(threads[i]);
}
}
int main() {
printf("=== 抢车位模拟实验 - 三种繁忙等待算法对比 ===\n");
printf("量化指标: 成功抢到次数 & CPU占用(繁忙等待循环次数)\n");
printf("实验配置: 3个线程，每个线程尝试40次，总共120次\n");
// 测试算法A
printf("\n算法A：值日法（单标志法）");
printf("\n特点：严格轮流，保证互斥但效率低\n");
test_algorithm(1);
// 测试算法B
printf("\n算法B：双标志检查法");
printf("\n特点：可能违反互斥，可能死锁\n");
test_algorithm(2);
// 测试算法C
printf("\n算法C：Peterson算法");
printf("\n特点：保证互斥，不会死锁\n");
test_algorithm(3);
// 实验结果分析
printf("\n=== 实验结果分析 ===\n");
printf("\n1. 正确性对比（是否违反互斥）:\n");
printf(" - 算法A: 保证互斥，无冲突\n");
printf(" - 算法B: 可能违反互斥，出现冲突\n");
printf(" - 算法C: 保证互斥，无冲突\n");
printf("\n2. 公平性对比（成功次数分布）:\n");
printf(" - 算法A: 严格轮流，最公平\n");
printf(" - 算法B: 分布不均，可能出现饥饿\n");
printf(" - 算法C: 相对公平\n");
printf("\n3. CPU浪费程度对比（繁忙等待循环次数）:\n");
printf(" - 算法A: CPU占用最高，浪费严重\n");
printf(" - 算法B: CPU占用中等，但存在正确性问题\n");
printf(" - 算法C: CPU占用相对较低，效率较好\n");
printf("\n4. 综合评估:\n");
printf(" - 算法A: 正确性√ 公平性√ 但CPU浪费严重\n");
printf(" - 算法B: 正确性× 公平性× CPU浪费中等\n");
printf(" - 算法C: 正确性√ 公平性○ CPU浪费较低\n\n");
printf("\n5. 信号量/互斥锁的优势:\n");
printf(" - 避免繁忙等待，CPU占用大幅降低\n");
printf(" - 保证正确性和公平性\n");
printf(" - 现代操作系统推荐使用\n");
return 0;
}
Write Preview
Loading…
Cancel
Save