[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$ffZLpfzxRM00wsSlzLdmH3x49HrcqppFHibUqV3TGsgs":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":29,"type":30},[],"2024-06-22 12:18:49",154262897,[8,9,10,11],"云服务","数据仓库","操作系统","数据库系统",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},134,"b39860e838906fce71b4aa9d99bf9491","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F7e2d5ad53be3d12aacc56ee37db405b7.jpg","数据仓库与数据挖掘","exam_126306159","终结性考核试卷","面向主题的、集成的与时间相关且不可修改的数据集合是什么定义",[21,31,38,44,53,61,70,79,87,95],{"answer":22,"createTime":23,"id":24,"options":25,"question":28,"source":29,"type":30},[],"2024-06-22 12:18:48",154262868,[26,27],"OLTP","OLAP","对于OLTP和OLAP,那个用户量相对大一些呢","v1",0,{"answer":32,"createTime":23,"id":33,"options":34,"question":37,"source":29,"type":30},[],154262869,[35,36],"数据挖掘","机器学习","模拟或实现人类学习行为,以获取新的知识或技能,重新组织已有的知识结构,使之不断改善自身的性能是( )任务",{"answer":39,"createTime":23,"id":40,"options":41,"question":43,"source":29,"type":30},[],154262872,[35,42],"数据分析",""描述和探索性分析,评估现状和修正不足"是",{"answer":45,"createTime":23,"id":46,"options":47,"question":52,"source":29,"type":30},[],154262875,[48,49,50,51],"扩大输入空间,把涨、跌参数后面拼接一个好的随机数nonce,计算出一个digest,把digest和nonce提前发布出去,到时间公布内容时,大家来验证解封内容.因为别人不知道这个随机数nonce,而且输入空间足够大,遍历方法很难在有限时间内找出这个nonce,就无法蛮力求解seasled envelope的内容了","没有办法解决","更换HASH函数","扩大输入空间,把涨、跌参数后面拼接一个好的随机数nonce,计算出一个digest,把digest提前发布出去,而把nonce保存起来,到时间公布内容时,再把nonce一起发布出去,大家来验证解封内容.因为别人不知道这个随机数nonce,而且输入空间足够大,遍历方法很难在有限时间内找出这个nonce,就无法蛮力求解seasled envelope的内容了","在使用HASH函数的抗碰撞性(collision resistance)、和信息隐藏性(hiding)来是想预测股票涨停的digital commiment的seasled envelope时,假设哈西函数为H,输入参数为"涨"或"跌",那么用H('涨')=digest1 或用 H('涨')=digest2用遍历输入空间的值(涨","跌"),对比结果,推断出seasled envelope里面的内容.那如何解决此问题",{"answer":54,"createTime":23,"id":55,"options":56,"question":60,"source":29,"type":30},[],154262877,[57,58,59],"数据不一致性","缺失值","噪声数据",""系统设计时可能存在的缺陷或者在系统使用过程中人为因素的影响"是以下原始数据通常存在着哪类问题",{"answer":62,"createTime":23,"id":63,"options":64,"question":69,"source":29,"type":30},[],154262881,[65,66,67,68],"纯净的","无缺失的","完整的",""脏"的","现实世界中的数据大多都是",{"answer":71,"createTime":5,"id":72,"options":73,"question":78,"source":29,"type":30},[],154262885,[74,75,76,77],"判断H(key|msg')是否等于com","判断H(key|msg')是否等于msg","判断H(msg')是否等于H(msg)","判断H(com|msg')是否等于key","verify(com,key,msg')函数用来验证预言家公布的msg'是否是当初预言家的预言msg,该函数如何实现",{"answer":80,"createTime":5,"id":81,"options":82,"question":86,"source":29,"type":30},[],154262889,[83,84,85],"回归","分箱","离群点分析","噪声(Noise)是被测量的变量的随机误差或方差.噪声的处理方法一般有分箱、回归和离群点分析等方法,下图是哪种方法? \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F1b83994facdf6d1b288ed690ce73704d.webp\">",{"answer":88,"createTime":5,"id":89,"options":90,"question":94,"source":29,"type":30},[],154262894,[91,92,93],"一直被认为具备","1996年,被证实存在弱点,可以被加以破解;2004年,证实MDA5算法无法防止碰撞","从不具备","MD5算法具有collision resistance的吗",{"answer":96,"createTime":5,"id":6,"options":97,"question":19,"source":29,"type":30},[],[8,9,10,11]]