程序代写 CS代考

HW06 Your Name, Your Uniqname Due Wednesday October 22, 2019 at 10pm on Canvas For question 2, you will need to load the file xy.csv. Set your working directory using Session -> Set Working Directory -> To Source File. xy 0\), \[P(N(s + t) – N(s) = n) = \frac{e^{-\lambda t} (\lambda t)^n}{n!}, \quad n […]

Project Preamble Classification Choose the response (i.e. target) variable, and a set of feature variables, and apply two different classification techniques (e.g. decision trees v. logistic regression), and compare the model performance. Discuss how feature variables could be better selected and how to best select a threshold value for logistic regression. For example, using the

ENGR30003: Numerical Programming for Engineers Semester 2, 2019 / Assignment 2 Marks : This assignment is worth 35% of the overall assessment for this course. Due Date : Monday, 21st October 2019, 5:00pm, via dimefox submission. You will lose penalty marks at the rate of 10% per day or part day late, and the assignment

Final Project 1. Teamwork: 3-5 people in team 2. Strict schedule! 3. Partial deliverables that are graded 4. Final presentation © Bedrich Benes Final Project – Timeline Week of Action Points Oct 21 Oct 28 Nov 4 Team definition -10 Project Assignment Nov 11 Nov 17 Third checkpoint 10 First fully working prototype. © Bedrich

形成24小时内每个飞机执飞的航班串，相邻两个航班间要满足最小过站时间的要求，优化目标是所有飞机执飞的航班收益系数（航线价值系数*时刻价值系数）总和最大，同时把每个飞机的总执飞时间算出来。 下面是一个小的数据例子，需要其他类似算例也可以求解，其中时间类的值abcd四位数字，前两位代表小时，后两位代表分钟。 希望用遗传算法或蚁群算法等智能优化算法，要求代码可读性强。 飞机 飞机编号 停留的基地机场 1 3 2 3 3 1 4 1 机场间的调度时间 机场序号 机场序号 飞行时间 1 2 0230 1 3 0150 2 3 0220 机场最小过站时间 机场序号 最小过站时间 1 0130 2 0100 3 0120 航线 航线编号 起飞机场 到达机场 飞行时间 航线价值系数 1 1 2 0230 0.7 2 1 3 0150 0.6 3 2 3

Project 2 RouteFinding for an Unreliable Vehicle CMSC 421, Fall 2019 Last update October 16, 2019 Due date: November 1 Late date 20 off: November 3 1 Another kind of racetrack problem Robot vehicle, starting point, finish line, walls are the same as in Project 1 Differences: 1 Vehicles control system is unreliable Maymovetoaslightlydifferent location

Lab #3 – WebSockets with Socket.IO Learning objectives • Create a real-time web application with Socket.io • Use WebSockets to co-ordinate interaction between different users Requirements We will create a real-time web application that allows teachers to create timed questions, send those questions to students who must answer them in time, collect and display the

ELEC4123: Electrical Design Proficiency Topic 3: Control Systems Preliminary Notes The Control Systems Design topic in this subject is spread over 3 weeks, with 2 lab sessions in Week 6 and week 7 and 1 lab session in Weeks 8. The topic might have 5 to 6 design tasks. Unlike previous topics, you need to

Title​: Weather App Features/constructs needed to be used: ● ViewModel w/ LiveData ● Fragments/Animations ● Threading (AsyncTask, Service, WorkManager, AlarmManager, DownloadManager…) ● Persistent storage via files or SharedPreferences ● Location awareness ● Internet connectivity Overview​: A simple weather app that provides live weather data and forecasts for the upcoming week. The app will determine user’s

影响力最大化问题可以定义为：给定一个社会网络、一个扩散模型和一个数值k，任务就是如何在社会网络上获取一个规模为k的节点集合，使得这个节点集合可以达到影响力最大化的效果。 独立级联模型的算法描述如下： 1．初始的激活状态节点集合A。 2．在t时刻，新近被激活的节点u对它的邻接节点v产生影响，成功的概率为 EMBED Equation.DSMT4 。若v有多个邻居节点都是新近被激活的节点，那么这些节点将以任意顺序尝试激活节点v。 3．如果节点v被激活成功，那么在t+1时刻，节点v转为激活状态，将尝试激活其非激活状态的邻居节点；否则，节点v在t+1时刻状态不发生变化。 4．该过程不断进行重复，直到网络中不存在有影响力的活跃节点时，传播过程结束。 EMBED Visio.Drawing.11 时刻1：初始时，3,4,8为激活状态，其他为未激活状态。每个激活状态节点都会以一定概率去激活自己周围的非激活状态。 EMBED Visio.Drawing.11 时刻2：节点5和7在时刻1被激活，在时刻2变成了激活状态。节点5和7在时刻2以一定概率去激活各自未激活状态的邻居。在时刻2，节点3,4,8已不是新近被激活状态，它们不能再去激活其他节点。 注：每个节点在某个时刻t被激活之后，会在t+1时刻成为激活状态，它只能在t+1这一个时刻有机会去激活其周围邻居节点，之后的时刻将不再激活其他节点。 EMBED Visio.Drawing.11 时刻3：节点2在时刻2被激活，在时刻3变成了激活状态，它将会在该时刻去激活其周围的邻居节点。 贪心选择策略： 输入：社会网络结构、信息扩散模型和k 输出：拥有最大影响力的节点集合 初始化： EMBED Equation.DSMT4 ； For EMBED Equation.DSMT4 do 选择出 EMBED Equation.DSMT4 EMBED Equation.DSMT4 End For 输出S End