Explaining match outcome in elite Australian Rules football using team performance indicators

The relationships between team performance indicators and match outcome have been examined in many team sports, however are limited in Australian Rules football. Using data from the 2013 and 2014 Australian Football League (AFL) regular seasons, this study assessed the ability of commonly reported discrete team performance indicators presented in their relative form (standardised against their opposition for a given match) to explain match outcome (Win/Loss). Logistic regression and decision tree (chi-squared automatic interaction detection (CHAID)) analyses both revealed relative differences between opposing teams for “kicks” and “goal conversion” as the most influential in explaining match outcome, with two models achieving 88.3% and 89.8% classification accuracies, respectively. Models incorporating a smaller performance indicator set displayed a slightly reduced ability to explain match outcome (81.0% and 81.5% for logistic regression and CHAID, respectively). However, both were fit to 2014 data with reduced error in comparison to the full models. Despite performance similarities across the two analysis approaches, the CHAID model revealed multiple winning performance indicator profiles, thereby increasing its comparative feasibility for use in the field. Coaches and analysts may find these results useful in informing strategy and game plan development in Australian Rules football, with the development of team-specific models recommended in future.     

非平衡多阶段物流系统建模与优化方法

首先提出了参数化界面分布的新概念,将一个非平衡多阶段物流系统转化为多个相互独立的单一阶段物流系统,然后采用Prüfer数对每个阶段上的物流模式进行编码.通过一种改进的解码方法,任何一个随机产生的Prüfer数都能够被解码为一个与物流系统的节点容量相匹配的可行的物流模式.基于这2点创新,建立了一种新的基于参数化界面分布和Prüfer数编码的系统建模方法,相应的遗传算法称为PIP-GA方法.与st-GA方法相比,PIP-GA不但具有更好的优化结果,而且需要的计算时间更少;虽然所需的存储空间有所增加,PIP-GA仍然是一种有效而稳健的非平衡多阶段物流系统建模与优化方法.     

创建neighbor-joining进化树的快速算法

为了改善Saitou和Nei提出的neighbor-joining进化树算法(SN)及Studier和Keppler的改进算法(SK),降低计算的时间复杂度,设计了一种快速算法.该算法涉及3种技术第一,引入一个线性数组A[N],用于存储距离矩阵每一行的值,以减少许多重复计算;第二,A[i]的值在算法开始时全部计算,在迭代步中间只进行更新3个变化的值;第三,设计了一个紧凑的公式用于计算OTUs之间的边长,并对该公式进行了证明.实验结果表明随着节点数的增多,该算法比SN算法快几十倍到上百倍,比SK算法快2倍以上;在一台桌面计算机上,该算法能在3min左右创建具有2000个节点的进化树.以空间换时间,减少最内层循环的计算量是设计多重循环算法的基本思路.     

中文译著外国责任者著录中存在的问题及对策

本文通过对中文译著外国个人责任者姓名著录现状的分析，对其在姓名的规范与取舍方面存在的诸多问题提出了合理化建议及对策。     

基于PCA的决策树优化算法

为了改善传统ID3算法在分类属性选择上存在多值偏向性的不足,提出基于PCA的决策树优化算法。在普通基于PCA 的决策树改进算法中,存在数据经降维处理后代表性不强的问题,导致算法需经过多次数据运行后,准确率才能小幅提升。在ID3算法基础上,在分类前两次提取属性特征值,并计算了需要分类的数据量,也即对原始数据进行最重要的属性选择。在子树建立之后,再进行数据的降维合并选择。采用UCI数据库中的3个数据集对改进算法进行验证,结果表明改进算法的平均准确率达到94.6%,相比传统ID3算法与普通PCA决策树优化算法分别提升了1.6%和0.6%。因此,基于PCA的决策树算法能在一定程度上提升结果准确率,具备一定的应用价值。     

基于等腰直角三角形的二值图像压缩算法研究

针对二值图像的几何相似性,本文提出一种基于等腰直角三角形的压缩算法。该算法以四叉树为数据结构,以达到减小中间结点的开销;同时该算法的时间复杂度和空间复杂度均低于采用JBIG标准来压缩二值图像。其压缩比可提高15%;同时适用于复杂图像。     

一种改进的二维曲线的strip树表示及其基本算法

本文给出了一种改进的二维曲线的ｓｔｒｉｐ树表示，并在此基础上，给出了二值图象中曲线的基本算法。     

网络安全系统配置规则管理算法设计与实现

阐述网络安全系统的整体构架,讨论该系统的配置规则管理算法,详细介绍命令动态配置树的设计与实现,最后,就运用于该系统中的算法性能进行相应的分析.     

Physical design method of MPSoC

Floorplan, clock network and power plan are crucial steps in deep sub-micron system-on-chip design. A novel di- agonal floorplan is integrated to enhance the data sharing between different cores in system-on-chip. Custom clock network con- taining hand-adjusted buffers and variable routing rules is constructed to realize balanced synchronization. Effective power plan considering both IR drop and electromigration achieves high utilization and maintains power integrity in our MediaSoC. Using such methods, deep sub-micron design challenges are managed under a fast prototyping methodology, which greatly shortens the design cycle.     

如何优化网站结构

网站结构对于网站的制作和运行至关重要。优化的网站结构包括层次清晰的目录结构，合理的文件存储，高速的链接和导航，美观的布局和有特色的网站内容。