当前位置:网站首页>Mathorcup ideas sharing in 2022
Mathorcup ideas sharing in 2022
2022-04-22 13:51:00 【Enthusiastic netizen Mr. Minamata】
Today is the second day of the game , Through the statistics of your preliminary topics yesterday , The approximate statistical result is , The proportion of selected topics is 4:5:8:13. This result is based on your feedback and my own statistics. It should be different from the reality, but there is little difference . I think a more reasonable schedule should have selected the topic today and Friday , Look for ideas , Build the model , Saturday programming , Thesis writing , Sunday paper perfect . Such a schedule would be more reasonable , You can also adjust according to the actual situation of your team .
Based on the current number of topics , I think those who want to win a good award can try A、B, Those who want to protect the prize can consider C,D, Now I will make a brief comment on each topic . And attach a link to the specific ideas of each question . I hope that helps .
A topic Model and implementation of large-scale fingerprint image retrieval
A The question is the most difficult one in this competition . Through the title, we can see that this is a problem of image recognition . For this problem, you need to have high programming ability , And it has a certain foundation for algorithm optimization .A This difficulty is more suitable for players who want to win the first prize , It means that it is suitable for winning prizes , Not suitable for insurance . If you simply want that award , There is no choice here A,A It's very difficult and it's very likely that there will be no gain after a lot of effort , For high-level , Programming ability is good, you can try .
A The problem mainly uses image retrieval and image matching . I think it's not difficult for students of related majors , For non CV The overall difficulty of the students in this direction is relatively large . I'll share with you later A Code for , Ideas, etc .
B topic The problem of robot scheduling in unmanned warehouse
B On the whole, the problem is obviously an optimization model , For the three questions given , Set different constraints in turn . With the deepening of the problem, there are more and more constraints , The whole article needs to constantly improve the optimization model we initially established . be relative to A In terms of questions , It's simpler , But the overall difficulty is still very high . Topics for reference A topic .
In order to better help you understand B Establishment of problem optimization model , I have found the 2011 National Championship B The setting of traffic patrol platform ,03 year B Relevant papers and scoring rules for vehicle arrangement in open pit production, etc , I'll talk to you later 、 The code is packaged and sent to everyone . I hope it can help you .

C topic Automatic parking problem
C At present, we need to establish a reasonable parking model , Here we need to simulate , Difficulty relative A,B I think it's much smaller , The overall difficulty is moderate .
The first problem is numerical calculation , The solution of this problem should not require us to establish a model , Solve the problem directly according to the problem . Question two , We need to build a parking model , According to the path length required by the topic 、 toward 、 Speed 、 Establish a model based on acceleration and other data . Finally, the trajectory is optimized , To solve the . Question 3 . Based on problem 2, the parking model is established , Build an optimization model , Calculate the optimal parking space . At the same time, the model is extended , To apply to more situations .
Question 4 , The theoretical solution to our first three questions , Practice , Apply our model to the actual situation , From the current position Simulation results of driving trajectory to the optimal parking space .
C The problem involves a larger research direction, which is the parking problem , There is a lot of literature in this area , We will supplement the literature later 、 Improve the thinking code, etc .
D topic Location clustering and mobile communication network planning
D The question is the simplest one I think in this competition , This is also relative to this competition . The overall difficulty of this mom Cup , The depth has begun to keep up with the national competition .D Although the difficulty is the smallest of the four questions , But that doesn't mean he's simple . We can D The problem is solved as a data analysis problem .
The first problem is the optimization model , Plan the station site , To meet the requirements given in the title . Problem 2: add constraints , Consider the influence of sector angle . The third problem is regional clustering , Try to cluster all weak coverage points , Make the total time complexity of the clustering method as low as possible .
A,B,C,D The problem data has been updated .
What I can help you is still very limited , I hope these things are helpful to your topic selection . Detailed ideas , References will be added here later .
The remaining three days , You need to show your powers , The eight immortals crossed the sea .
May we meet at the summit !!!
版权声明
本文为[Enthusiastic netizen Mr. Minamata]所创,转载请带上原文链接,感谢
https://yzsam.com/2022/04/202204221344310159.html
边栏推荐
- 那些年我们一起优化的SQL
- 翻译翻译什么是适配器模式?
- Redis (VI) - set of common data types of redis
- Statistical inference
- 快速串讲——JVM内存的区域划分
- 树莓派开发笔记(十二):入手研华ADVANTECH工控树莓派UNO-220套件(一):介绍和运行系统
- "Precise investment promotion" of digital operation and management of Industrial Park
- #yyds干货盘点# 解决剑指offer:机器人的运动范围
- How does zhiting connect Xiaomi smart speakers?
- An article to quickly understand the oal of Apache skywalking
猜你喜欢

Citrix SQL数据如何进行多表联查

Imeta: integrating macroomics to re understand life and Environmental Sciences

Chapitre sur la promotion précise des investissements dans la gestion de l'exploitation numérique des parcs industriels
BAIC Foton, Sinopec and light engineering Internet of things set up Sinopec to sell hydrogen energy (Beijing)

Blocking mode and non blocking mode of socket

CDF全球调查:软件交付性能停滞不前

LeetCode-386 字典序排数

Redis (VI) - list of common data types of redis

一文读懂EfficientNet

Fizz enterprise microservice Gateway - service choreography, offering a big killer to end the BFF layer
随机推荐
指定Swagger接口文档中参数序列化组件为Newtonsoft.Json
Database resource load management (Part 2)
将pyuic添加到Pycharm的外部工具
【Flutter 专题】91 图解 Dart 单线程实现异步处理之 Future (二) #yyds干货盘点#
Database tablespace is damaged. How to deal with the exception of backup table data?
页面嵌套的方法
Leetcode -- the shortest distance between characters
快速串讲——JVM内存的区域划分
数据库资源负载管理(下篇)
Citrix SQL数据如何进行多表联查
Socket的阻塞模式和非阻塞模式
5分钟快速了解MySQL索引的各种类型
Special topic of game partners: breederdao reaches a new height in cooperation with fancy birds
Apache SkyWalking 告警配置指南
Seven years of "one sword" and standing at the edge of the cloud, how to accelerate the digital transformation of enterprises?
提供信贷支持、创新金融产品……广州金融机构为交通等行业企业纾困解难
自动化测试的生命周期是什么?
"Enterprise service" of digital operation and management of Industrial Park
CVPR 2022 Oral | 大连理工提出小样本识别DeepBDC,6项基准性能最好
Brief analysis of Apache skywalking alarm dynamic configuration source code