联合开发网   搜索   要求与建议
                登陆    注册
排序按匹配   按投票   按下载次数   按上传日期
按分类查找All 数值算法/人工智能(428) 

[数值算法/人工智能] Sales-Data-Analysis-and-User-Profiling-Project

这个项目旨在对销售数据进行深入分析,并通过用户画像生成来揭示销售业务中的关键信息。通过对销售额、数量、利润等指标的统计分析,以及产品销售情况、地域销售情况、客户销售情况和时间趋势的分析,帮助企业了解销售业绩表现、产品热卖情况、地域销售重点、客户贡献度以及销售额的月度趋势。同时,通过用户画像生成函数,可以根据用户姓名获取其消费数据,分析其消费习惯,包括总消费额、平均订单金额和最常购买的产品。
This project aims to conduct in-depth analysis of sales data and reveal key information in sales business through the generation of user profiles. Through statistical analysis of sales, quantity, profit and other indicators, as well as analysis of product sales, regional sales, customer sales and time trend, help enterprises understand sales performance, product hot sales, regional sales focus, customer contribution and monthly sales trend. At the same time, through the user profile generation function, you can obtain the user s consumption data according to the user s name, and analyze their consumption habits, including the total consumption, the average order amount, and the most frequently purchased products. (2024-02-10, Jupyter Notebook, 0KB, 下载0次)

http://www.pudn.com/Download/item/id/1707573336666683.html

[数值算法/人工智能] 38253

美国大学生数学建模竞赛(MCM/ICM),是唯一的国际性数学建模竞赛,也是世界范围内最具影响力的数学建模竞赛,为现今各类数学建模竞赛之鼻祖。MCM/ICM 是 Mathematical Contest In Modeling 和 Interdisciplinary Contest In Modeling 的缩写,即 数学建模竞赛 和 交叉学科建模竞赛 。MCM 始于 1985 年,ICM 始于 2000 年,由 COMAP(the Consortium for Mathematics and Its Application,美国数学及其应用联合会)主办,得到了 SIAM,NSA,INFORMS 等多个组织的赞助。MCM/ICM 着重强调研究问题、解决方案的原创性、团队合作、交流以及结果的合理性。2014年,共有来自美国、中国、加拿大、芬兰、英国、澳大利亚等19个国家和地区共7783支队伍参加,其中包括来自哈佛大学、普林斯顿大学、西点军校、麻省理工学院、清华大学、北京大学、北京航空航天大学、浙江大学、南开大学、上海交通大学、华中科技大学,南京大学等国际知名高校学生参与此项赛事角逐。 本作品是2015年MCM中A题“根除或者遏制埃博拉”的赛题,贡享资源,希望多大家有用!更多资源敬请关注http://blog.sina.com.cn/s/articlelist_3902127067_0_1.html
PROBLEM A: Eradicating Ebola The world medical association has announced that their new medication could stop Ebola and cure patients whose disease is not advanced. Build a realistic, sensible, and useful model that considers not only the spread of the disease, the quantity of the medicine needed, possible feasible delivery systems, locations of delivery, speed of manufacturing of the vaccine or drug, but also any other critical factors your team considers necessary as part of the model to optimize the eradication of Ebola, or at least its current strain. In addition to your modeling approach for the contest, prepare a 1-2 page non-technical letter for the world medical association to use in their announcement. (2016-01-04, WORD, 358KB, 下载4次)

http://www.pudn.com/Download/item/id/1451913602359575.html

[数值算法/人工智能] acceleration-signal

利用加速度信号测量位移是油田抽油井光杆位移测量的主要方法 而加速度信号的随机噪声和趋势项是影响 测量精度的主要因素 本文提出了一种基于学习的实时消噪和剔除趋势项方法 学习时先获取一段时间的加速度信 号 再通过时间序列分析技术得出 ARIMA 模型及其参数 最后基于 FFT 变换的 Rife-Jane 频率估计方法求出加速度 信号的周期 在线实时消噪和剔除趋势项方法是基于学习阶段所得模型参数 运用卡尔曼滤波技术消除加速度信号 随机噪声 按周期两次积分得到光杆位移 用加窗递推最小二乘法在线消除趋势项 通过抽油机半实物仿真平台测试 和分析加速度信号 结果表明 该方法有效地去除了加速度信号中的噪声和趋势项 极大地提高了位移的测量精度
Acceleration signal based approach is a main approach used to measure the displacement of polish rod in the oilfield pumping wells. In this study a learning based real time noise immunization and trend term elimination approach is proposed. During the learning acceleration signal within a period of time are firstly acquired then corresponding ARIMA model and its parameters are derived finally the period of the acceleration signal is computed by using FFT transformation and Rife Jane frequency estimation. The proposed approach bases the model obtained parameters uses Kalman filtering techniques to remove random noise computes the polish rod displacement by a quadratic integration of the period and eliminates the trend term by windowed recursive least squares method. Eventually an experiment over a pumping unit hardware in the loop plant is carried out which indicates that the proposed approach can effectively eliminate noise and trend term and obviously improve the measuring pre (2014-12-14, C/C++, 1410KB, 下载25次)

http://www.pudn.com/Download/item/id/2674037.html

[数值算法/人工智能] lirun

企业发放的奖金根据利润提成。利润(I)低于或等于10万元时,奖金可提10 ;利润高    于10万元,低于20万元时,低于10万元的部分按10 提成,高于10万元的部分,可可提    成7.5 ;20万到40万之间时,高于20万元的部分,可提成5 ;40万到60万之间时高于    40万元的部分,可提成3 ;60万到100万之间时,高于60万元的部分,可提成1.5 ,高于    100万元时,超过100万元的部分按1 提成,从键盘输入当月利润I,求应发放奖金总数?
nterprise extending bonus profits according to the commission. Profits (I) is less than or equal to 100000 yuan, the prize can carry 10 High profits In 100000 yuan, less than 200000 yuan, is below 100000 yuan part according to 10 of commission, part of the higher than 100000 yuan, cocoa mention Into 7.5 Between 200000 and 400000, more than 200000 yuan part, can commission 5 Between 400000 and 600000 is higher than the Part of the 400000 yuan, can commission 3 Between 600000 and 1 million, more than 600000 yuan part, can commission 1.5 , highe (2012-03-01, Visual C++, 10KB, 下载2次)

http://www.pudn.com/Download/item/id/1783297.html

[数值算法/人工智能] jiangjin

企业发放的奖金根据利润提成。利润(I)低于或等于10万元时,奖金可提10 ;利润高     于10万元,低于20万元时,低于10万元的部分按10 提成,高于10万元的部分,可可提     成7.5 ;20万到40万之间时,高于20万元的部分,可提成5 ;40万到60万之间时高于     40万元的部分,可提成3 ;60万到100万之间时,高于60万元的部分,可提成1.5 ,高于     100万元时,超过100万元的部分按1 提成,从键盘输入当月利润I,求应发放奖金总数?
Bonuses based on company profits royalty. Profit (I) less than or equal to 10 million, money can be raised 10 profit of more than 10 million, less than 20 million, less than 10 million of the 10 commission, more than 10 million part of the commission of 7.5 of cocoa between 200,000 to 400,000, the more than 20 million of the available commission 5 400000-600000 than 40 million between the part of the time can be 3 commission 600000-1000000 between, the more than 60 million of the available commission 1.5 , higher than 100 million, more than 100 million part of the commission by 1 , the profit from the keyboard to enter the month I, seeking to be Total bonuses? (2011-03-30, Visual C++, 1KB, 下载1次)

http://www.pudn.com/Download/item/id/1472990.html

[数值算法/人工智能] c

企业发放的奖金根据利润提成。利润(I)低于或等于10万元时,奖金可提10 ;利润高    于10万元,低于20万元时,低于10万元的部分按10 提成,高于10万元的部分,可可提    成7.5 ;20万到40万之间时,高于20万元的部分,可提成5 ;40万到60万之间时高于    40万元的部分,可提成3 ;60万到100万之间时,高于60万元的部分,可提成1.5 ,高于    100万元时,超过100万元的部分按1 提成,从键盘输入当月利润I,求应发放奖金总数?
Bonuses based on company profits royalty. Profit (I) less than or equal to 10 million, money can be raised 10 profit of more than 10 million, less than 20 million, less than 10 million of the 10 commission, more than 10 million part of the commission of 7.5 of cocoa between 200,000 to 400,000, the more than 20 million of the available commission 5 400000-600000 than 40 million between the part of the time can be 3 commission 600000-1000000 between, the more than 60 million of the available commission 1.5 , higher than 100 million, more than 100 million part of the commission by 1 , the profit from the keyboard to enter the month I, seeking to be Total bonuses? (2011-03-28, C++ Builder, 2KB, 下载1次)

http://www.pudn.com/Download/item/id/1470507.html

[数值算法/人工智能] EyePos

最小邻域均值投影函数及其在眼睛定位算法.提出一种投影函数:最小邻域均值投影函数.该函数通过计算每条投影线上各像素点邻域均值的最小值 来跟踪图像中的低灰度特征.与传统的积分投影函数和方差投影函数相比,它以求最小值的局部选择性代替传统投 影函数的全局累加性,因此具有对片状噪声不敏感的特点、此外,在计算过程中,它还能记录最小值点的二维位置信 息,是一个二维的搜索算子、最小邻域均值投影函数的这些特点使其非常适合于眼睛定位.它对眼睛,特别是瞳孔,总 能够产生精确、鲁棒的响应通过在CAS—PEAL数据库和BioID数据库上的实验表明,其定位正确率与精确度均高 于传统的投影函数.
A projection function called minimal neighborhood mean projection function(MNMPF)is proposed. The projection function calculates and stores the minimal neighborhood mea1]of each pixel on each projection line, SO that it is able to trace the low grayscale features in image.Compared with traditional projection functions,i.e. integral projection function(IPF)and variance projection function(VPF),MNMPF is insensitive to sheet noise,due to the local selectivity of its mimmum operation.During the computation of MNMPF,the image locations of minima are recorded at the same time.This makes MNMPF a 2D operator.All these properties of MNM PF are very suitable for eye location.It can bring precise and robust response to eyes,especially pupils.Experiments on CAS—PEAL and BioID databases show its excellent correct rate and precision over traditional projection functions. (2010-04-22, Visual C++, 426KB, 下载103次)

http://www.pudn.com/Download/item/id/1138266.html

[数值算法/人工智能] wer

随着我国经济的迅速发展和信息技术的进步,物流行业已经被确定为我国国民经济的重要产业和经济发展的新增长点,其中物流配送路径的优化是物流系统中的关键一环,选择合理经济的配送路线可以极大的降低配送成本,提高配送效率,增加企业的经济效益。 本文以如何科学的解决配送路径的优化问题为出发点,分析比较了各种算法在解决VRP中的特点与利弊,由于蚁群算法有着良好的正反馈机制与较强的鲁棒性和灵活性,本文选择了蚁群算法作为解决VRP问题的算法,并结合VRP问题本身的特点,针对蚁群算法存在的过早收敛等不足进行改进,最后将改进的蚁群算法应用在本文所建立的VRP模型中,并通过仿真试验,证明了蚁群算法在解决大规模动态VRP问题中的有效性和可行性。 论文主要研究工作和创新性成果有以下几个方面: (1)设定了一类配送点位置不变,需求时间不定的动态带软时间窗的VRP问题。利用时间段的概念,将动态VRP问题转化为连续时间段内的静态VRP问题进行研究,构造了该问题的模型,提出了动态VRP问题的求解方案。 (2)结合VRP问题的特点,针对蚁群算法的早熟等不足,对蚁群算法进行改进,通过对伪随机概率公式的改进,配送点的二次...
Thanks for erevbody .ok,juest so so (2009-05-22, PDF, 3392KB, 下载24次)

http://www.pudn.com/Download/item/id/771791.html