Effect of different loading conditions on running mechanics at different velocities     

Germán Carretero-Navarro  Doménico Cherubini  Wolfgang Taube 《European Journal of Sport Science》2019,19(5):595-602

Weighted vests are widely used to improve running economy and performance. However, it is not well-studied how running mechanics are adapted to counteract the higher peak vertical ground reaction forces (Fpeak) while running with such a device. Therefore, the present study aimed to investigate the effects of different loading conditions on running mechanics at different velocities. Thirteen subjects participated in two separate sessions one week apart. In the first session, maximal aerobic speed (MAS) was determined through a maximal incremental running test while in the second session, they were instructed to run during one minute under different loading (0%, +10% and +20% of body mass [BM]) and velocity (60%, 80% and 100% of MAS) conditions in a random order. Spatiotemporal data were recorded and then running mechanics modelled using the spring-mass model. The main results indicated that vertical and leg stiffness (Kvert and Kleg, respectively) were increased (P?P?>?.05) when load was changed. At the same time, alterations of the running kinematics were observed such as longer contact times, reduced flight times, stride frequencies and step lengths, as well as an increase of the centre of mass dynamics. Based on these results it is assumed that runners maintain a certain stiffness level for each velocity despite different loading conditions. As a consequence, Fpeak increases and this probably causes spatiotemporal adjustments in the movement kinematics.  相似文献   

完善高考3+2总分统计的科学分析     

宋景平 《扬州教育学院学报》2004,22(3):72-74

通过高考总分简单的累加,不能准确反映各科课程难易,可能导致不能公平录取的结果。本文提出了用某门课程的实际考试最高分与平均分的衡量产生加权3总分的统计方法,试图更加客观地反映考生真实成绩。  相似文献   

基于组合加权评分的Item-based协同过滤算法   总被引：1，自引：0，他引：1  

马丽 《现代图书情报技术》2008,24(11):60-64

针对Item-based协同过滤算法中用户评分数据稀疏性严重影响推荐质量的问题,提出一种基于组合加权评分的Item-based协同过滤算法,以用户评分项并集作为用户相似性计算基础,并提出一种组合加权评分方法来对并集中的未评分项进行计算和填补,从而降低了数据稀疏性。实验结果表明该算法能有效提高推荐质量。  相似文献   

基于BP神经网络的大学生实践教学效果评价研究     

石莉  陈诚  邵艺 《扬州大学学报(高教研究版)》2020,(2):112-118

实践教学是高等学校教学工作的重要组成部分,其中实践教学效果评价是保障高等学校实践教学质量的重要环节。针对高校大学生项目实践教学效果评价需求,构建项目实践教学效果评价指标体系,在此基础上设计调查问卷,利用网络问卷收集评价原始数据,通过Python进行数据预处理,并采用BP神经网络对某高校大学生项目实践教学效果实施评价,结果表明,该方法对于高校实践教学效果评价具有较强的实用性。  相似文献   

两个著名不等式的统一证明     

姜天权 《南阳师范学院学报》2005,4(3):20-22

首先证明了数b1，b2，…，bn的一个加权平均不等式链Hn(b,P)≤(Pn ∑Pibi)/(Pn ∑Pi/bi)≤Gn(b,P)≤[∑Pibi/(1 bi)]/[∑Pi/(1 bi)]≤An(b，P)，用这个结果证明了名的王-王不等式和ky Fan不等式链Hn(b,P)/Hn(1-b,P)≤Gn(b,P)/Gn(1-b,P)≤An(b,P)/An(1-b,P)。  相似文献   

一类微分系统特征值的带权估计     

吴平 《宁波职业技术学院学报》2011,15(2)

考虑某类微分系统特征值的带权估计,利用分部积分、Rayleigh定理和不等式估计等方法和技巧,获得了用前n个特征值来估计第n+1个特征值的上界不等式,其估计系数与区域的几何度无关,其结果在物理和力学等领域中应用广泛。  相似文献   

一种鲸鱼优化算法改进的加权质心定位算法     

马宏光  曾国辉  韦钰  刘瑾  黄勃 《教育技术导刊》2020,19(5):61-64

针对加权质心定位算法受 RSSI 测距误差影响导致定位结果不理想的问题,提出一种鲸鱼优化算法改进的加权质心算法,利用鲸鱼优化算法的快速收敛、不易陷入局部最优等优势对加权质心算法定位结果进行优化。首先,通过加权质心算法计算待测点位置;其次,根据锚节点位置信息、RSSI 测距信息及待测点位置信息建立适应度函数;最后,利用鲸鱼优化算法不断迭代寻优,对待测点定位结果进行优化,以提高定位精度。在通信半径相同、锚节点数为 30 的条件下,改进后的定位算法定位精度为 0.58m,而粒子群加权质心算法与人工鱼群加权质心算法定位精度分别为 0.64m 和 0.62m,且随着锚节点个数的增加或通信半径的增大,改进后的定位算法仍能获得更高的定位精度。因此,改进后的定位算法精度更高,具有一定可行性。  相似文献   

一种改进的无线传感器网络DV-HOP定位算法     

武雪姣  李雪晴  丁佳静 《教育技术导刊》2019,18(8):52-55

为了解决DV-HOP算法在节点随机部署环境下定位误差较大的缺点,提出一种基于DV-HOP多通信半径的加权双曲线定位算法RWHDV-HOP。该算法通过理想跳数与实际跳数的差值修正平均跳距,结合多通信半径使跳数小数化,利用基于跳数加权的双曲线算法估算未知节点坐标。仿真结果表明,在相同条件设置下,RWHDV-HOP算法定位精度比传统DV-HOP算法提高了25%,比RWDV-HOP算法提高了10%。因此,基于DV-HOP多通信半径的加权双曲线定位算法RWHDV-HOP在节点随机部署环境下能够较大程度上提高节点定位精度。  相似文献   

Android平台下恶意软件分析与检测     

贾慧  李永忠 《教育技术导刊》2019,18(7):182-185

针对Android平台下恶意软件侵扰问题,提出一种基于权限—敏感API特征的加权朴素贝叶斯分类算法的检测方案。首先对Android应用程序中的配置文件进行解析,然后利用Apktool工具对APK文件进行反编译,提取出权限—敏感API特征集,并通过信息增益算法和卡方检验算法过滤冗余数据,最后利用加权朴素贝叶斯分类算法的恶意软件检测模型进行分类判断。实验结果证明,该系统能有效提高分类器的效率和恶意软件的检测率。  相似文献   

Unsupervised word sense disambiguation for Korean through the acyclic weighted digraph using corpus and dictionary     

Yeohoon Yoon  Choong-Nyoung Seon  Songwook Lee  Jungyun Seo 《Information processing & management》2006

Word sense disambiguation (WSD) is meant to assign the most appropriate sense to a polysemous word according to its context. We present a method for automatic WSD using only two resources: a raw text corpus and a machine-readable dictionary (MRD). The system learns the similarity matrix between word pairs from the unlabeled corpus, and it uses the vector representations of sense definitions from MRD, which are derived based on the similarity matrix. In order to disambiguate all occurrences of polysemous words in a sentence, the system separately constructs the acyclic weighted digraph (AWD) for every occurrence of polysemous words in a sentence. The AWD is structured based on consideration of the senses of context words which occur with a target word in a sentence. After building the AWD per each polysemous word, we can search the optimal path of the AWD using the Viterbi algorithm. We assign the most appropriate sense to the target word in sentences with the sense on the optimal path in the AWD. By experiments, our system shows 76.4% accuracy for the semantically ambiguous Korean words.  相似文献