iTunes搜索完成该项目的学生表明他们可以:了解和解释枚举的常见用例定义自定义枚举类型使用文档了解如何使用RESTAPI了解并解释JSON的目的使用URLSession向URL发出GET请求实现URLSessionDataTask完成关闭使用JSONDecoder()将API返回的JSON数据转换为模型对象介绍iTunesSearch允许您使用iTunesSearchAPI搜索应用程序,音乐和电影。
您将练习使用枚举,使用URLSessionDataTaskGET请求,使用API​​文档和解析JSON。
请查看下面的屏幕录像,以了解完成的项目的外观:指示请分叉并克隆此存储库。
该存储库没有入门项目,因此请在克隆的存储库文件夹中创建一个。
第1部分-SearchResult和SearchResultController搜索结果此应用程序使用iTu
2024/6/25 1:06:44 1.23MB Swift
1
ComputerConstructionPrinciplesandPracticesThisexcitingnewbookcombinesadetailedstudyofmoderntheoriesofcompilerdesignwithacompletedescription(withsourcecode)ofaworkingcompilerforasmalllanguage.Thebookreflectstheauthor'sconvictionthatpracticalaspectsofcompilerdesigncannotbeunderstoodwithoutagraspoftheory,andthattheorycannotbetrulycomprehendedbyundergraduatestudentswithoutseeingitputintoactualpractice.Unifyingthetext'sdiscussionofconceptsisacompleteworkingcompilerwritteninCanddevelopedusingthetechniquesdiscussedineachchapter.Extensiveexercisesetsattheendofeachchapterfocusstudent'sattentiononspecificprogrammingproblems
2024/6/5 11:41:01 11.33MB 编译原理
1
可以破解IAR嵌入式:ARMMCS-51AVR32RENESASM16CNEC78KMSP430SAMSUNGSAM8
2024/5/17 2:29:13 344KB IAR ARM MCS MSP430
1
FPGA上运行人脸识别源代码,ThisprojectattemptstorealizeafacedetectorusingVoila-Jonesalgorithm.ThereferenceCmodelisborrowedfrom[5kk73GPUAssignment2012](https://sites.google.com/site/5kk73gpu2012/assignment/viola-jones-face-detection),withsomemodifytofithardwareimplementationandfixedsomebug.ThecodeiswrittenbyVerilog/SystemVerilogandSynthesizedonXilinxKintexUltrascaleFPGAusingVivado.Thiscodeisjustexperimentalforfunction,alotofoptimizationcanfurtherbedone.
2024/5/10 19:02:02 6.81MB FPGA 人脸识别 Xilinx
1
CoherentAuto-CalibrationofAPEandNsRCMunderFastBack-ProjectionImageFormationforAirborneSARImaginginHighly-SquintAngle
2024/5/1 22:09:17 3.75MB 研究论文
1
关于微带电路设计的一本书,包含较多计算分析,理论性和实践性都很强。
2024/4/13 14:24:35 38.17MB 微带线 准静态分析 槽线 射频
1
K.C.Gupta、RameshGarg、InderBahl、PrakashBhartia编写,是该书的第二版,主要内容有:微带线的准静态分析、散射模型和测量方法;
全波分析、设计考虑和应用;
不连续微带线的准静态分析和特征刻画;
不连续微带线的全波分析和测量;
Slotline、Finline、同平面波导、耦合线。
2024/4/2 22:33:57 16.29MB 微带线 传输线
1
GettogripswithmodernsoftwaredemandsbylearningtheeffectiveusesofRust'spowerfulmemorysafety.KeyFeaturesLearnandimprovethesequentialperformancecharacteristicsofyoursoftwareUnderstandtheuseofoperatingsystemprocessesinahigh-scaleconcurrentsystemLearnofthevariouscoordinationmethodsavailableintheStandardlibraryBookDescriptionMostprogramminglanguagescanreallycomplicatethings,especiallywithregardtounsafememoryaccess.Theburdenonyou,theprogrammer,liesacrosstwodomains:understandingthemodernmachineandyourlanguage'spain-points.Thisbookwillteachyoutohowtomanageprogramperformanceonmodernmachinesandbuildfast,memory-safe,andconcurrentsoftwareinRust.ItstartswiththefundamentalsofRustanddiscussesmachinearchitectureconcepts.YouwillbetakenthroughwaystomeasureandimprovetheperformanceofRustcodesystematicallyandhowtowritecollectionswithconfidence.YouwilllearnabouttheSyncandSendtraitsappliedtothreads,andcoordinatethreadexecutionwithlocks,atomicprimitives,data-parallelism,andmore.ThebookwillshowyouhowtoefficientlyembedRustinC++codeandexplorethefunctionalitiesofvariouscratesformultithreadedapplications.Itexploresimplementationsindepth.Youwillknowhowamutexworksandbuildseveralyourself.Youwillmasterradicallydifferentapproachesthatexistintheecosystemforstructuringandmanaginghigh-scalesystems.Bytheendofthebook,youwillfeelcomfortablewithdesigningsafe,consistent,parallel,andhigh-performanceapplicationsinRust.WhatyouwilllearnProbeyourprogramsforperformanceandaccuracyissuesCreateyourownthreadingandmulti-processingenvironmentinRustUsecoarselocksfromRust’sStandardlibrarySolvecommonsynchronizationproblemsoravoidsynchronizationusingatomicprogrammingBuildlock-free/wait-freestructuresinRustandunderstandtheirimplementat
2024/2/28 3:43:03 1.9MB rust concurrency 并发 rust语言
1
多旅行商matlab实验源码实现了三种多旅行商问题%MTSPOF_GAFixedOpenMultipleTravelingSalesmenProblem(M-TSP)GeneticAlgorithm(GA)%Findsa(near)optimalsolutiontoavariationofthe"open"M-TSPby%settingupaGAtosearchfortheshortestroute(leastdistanceneeded%foreachsalesmantotravelfromthestartlocationtounique%individualcitiesandfinallytotheendlocation)%%Summary:%1.Eachsalesmanstartsatthefirstpoint,andendsatthelast%point,buttravelstoauniquesetofcitiesinbetween(noneof%themclosetheirloopsbyreturningtotheirstartingpoints)%2.Exceptforthefirstandlast,eachcityisvisitedbyexactlyonesalesman%%Note:TheFixedStartistakentobethefirstXYpointandtheFixedEnd%istakentobethelastXYpoint%%Input:%XY(float)isanNx2matrixofcitylocations,whereNisthenumberofcities%DMAT(float)isanNxNmatrixofcity-to-citydistancesorcosts%SALESMEN(scalarinteger)isthenumberofsalesmentovisitthecities%MIN_TOUR(scalarinteger)istheminimumtourlengthforanyofthe%salesmen,NOTincludingthestartpointorendpoint%POP_SIZE(scalarinteger)isthesizeofthepopulation(shouldbedivisibleby8)%NUM_ITER(scalarinteger)isthenumberofdesirediterationsforthealgorithmtorun%SHOW_PROG(scalarlogical)showstheGAprogressiftrue%SHOW_RES(scalarlogical)showstheGAresultsiftrue%%Output:%OPT_RTE(integerarray)isthebestroutefoundbythealgorithm%OPT_BRK(integerarray)isthelistofroutebreakpoints(thesespecifytheindices%intotherouteusedtoobtaintheindividualsalesmanroutes)%MIN_DIST(scalarfloat)isthetotaldistancetraveledbythesalesmen%%Route/BreakpointDetails:%Ifthereare10citiesand3salesmen,apossibleroute/break%combinationmightbe:rte=[56942837],brks=[37]%
1
function[PSNR,y_est]=BM3D(y,z,sigma,profile,print_to_screen,N2,N2_wiener,Ns,Ns_wiener,tau_match)%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%BM3DisanalgorithmforattenuationofadditivewhiteGaussiannoisefrom%grayscaleimages.Thisalgorithmreproducestheresultsfromthearticle:%%[1]K.Dabov,A.Foi,V.Katkovnik,andK.Egiazarian,"ImageDenoising%bySparse3DTransform-DomainCollaborativeFiltering,"%IEEETransactionsonImageProcessing,vol.16,no.8,August,2007.%preprintathttp://www.cs.tut.fi/~foi/GCF-BM3D.%%%FUNCTIONINTERFACE:%%[PSNR,y_est]=BM3D(y,z,sigma,profile,print_to_screen)%%!Thefunctioncanworkwithoutanyoftheinputarguments,%inwhichcase,theinternaldefaultonesareused!%%BASICUSAGEEXAMPLES:%%Case1)Usingthedefaultparameters(i.e.,imagename,sigma,etc.)%%[PSNR,y_est]=BM3D;%%Case2)Usinganexternalnoisyimage:
2023/12/29 9:31:37 2.76MB BM3D MATLAB
1
共 50 条记录 首页 上一页 下一页 尾页
在日常工作中,钉钉打卡成了我生活中不可或缺的一部分。然而,有时候这个看似简单的任务却给我带来了不少烦恼。 每天早晚,我总是得牢记打开钉钉应用,点击"工作台",再找到"考勤打卡"进行签到。有时候因为工作忙碌,会忘记打卡,导致考勤异常,影响当月的工作评价。而且,由于我使用的是苹果手机,有时候系统更新后,钉钉的某些功能会出现异常,使得打卡变得更加麻烦。 另外,我的家人使用的是安卓手机,他们也经常抱怨钉钉打卡的繁琐。尤其是对于那些不太熟悉手机操作的长辈来说,每次打卡都是一次挑战。他们总是担心自己会操作失误,导致打卡失败。 为了解决这些烦恼,我开始思考是否可以通过编写一个全自动化脚本来实现钉钉打卡。经过一段时间的摸索和学习,我终于成功编写出了一个适用于苹果和安卓系统的钉钉打卡脚本。
2024-04-09 15:03 15KB 钉钉 钉钉打卡