循环冗余校验码的单片机及CPLD实现

循环冗余码校验(CRC)是一种可靠性很高的串行数据校验方法.介绍循环冗余码校验的基本原理,并分别用单片机和CPLD作了循环冗余码校验的软件实现和硬件实现.包括汇编语言和VHDL语言源程序.     

圆周率的计算及仿真测试探索

结合圆周率(π)的几种近似运算原理和公式,分析计算机程序设计中的几种常用设计思想,结合算法编写源程序,并进行程序测试比较,以探讨圆周率的多种运算可行性及启发、训练编程思维的方法.     

CRC校验中信息段超长软处理解决方案

该文针对通讯用CRC校验中信息段情况提出一种程序处理办法,根据数学理论证明其方法的正确性,最后给出了实际采用的源程序代码。     

基于SATA接口的并行CRC32算法研究

在CRC校验基本原理及传统串行运算的基础上,介绍了一种快速并行CRC32算法,该算法运算简单、易于硬件实现。与SATA协议结合,设计了基于SATA接口的CRC32数据校验处理模块,该模块处理速度快、输出延时小,能够达到SATA接口实时处理的要求。最后,通过Quartus II开发平台及VHDL硬件描述语言,对SATA协议中帧结构传出的数据进行了仿真,验证了此算法的正确性及优越性。     

异或和取模运算的负载均衡算法

引入信息熵对哈希函数的输入值进行随机度测试,实验证明增加异或字段数并划分字段后进行异或运算能提高运算结果的随机测度值.标识字段有很高的位熵值,函数输入值中加入此值能减少负载迁移次数而运算效率与CRC16接近.采用源IP、目的IP、源端口、目的端口、标识字段作为输入值,并划分为8位的比特串进行异或运算,然后再进行取模运算的双哈希算法运算效率较高而且均衡性好,适合于高速网络环境下的入侵检测.     

在FPGA中实现高精度快速除法

介绍FPGA中高精度除法运算的实现方法,给出实现高精度除法运算的VHDL源程序;实现了除数为任意八位二进制的除法,其精度可达到小数点后16位.     

CRC-16算法及其单片机实现

提出了一种基于单片机实现的CRC并行算法。该算法仅占用系统少量的存储空间,易于实现。CRC校检码通过一系列异或运算获得,算法采用汇编语言编程后由8051 IP核调用,通过Synplify软件对IP核进行综合,最后导入Quartus II软件进行功能仿真。仿真结果表明所提出的CRC算法在特定的时钟频率下可以有效地运行。     

CRC校验码软件生成技术原理分析

循环冗余校验(Cyclic Redundancy Check, CRC)具有检错能力强,运算简单,易于直接用硬件数字电路实现的特点。在完善CRC校验码生成原理模型的基础上,研究了信息系统传输带CRC校验码数据包的一般过程,提出了三种计算数据包CRC校验码的技术方法,在ADI公司DSP软件集成开发仿真测试环境中,设计了一组嵌入式程序,生成了符合ITU组织CRC16 ITU-T V.41标准的CRC校验码码表,分析并总结了CRC校验码码表元素的工程含义和应用方法,研究了两种计算数据包CRC校验码工程实现方法的技术特点,并验证了它们的正确性、一致性和有效性。     

Cortex-M3内核浮点型运算的研究与实现

通过分析Cortex-M3内核的结构与浮点型格式,充分利用Cortex-M3内核中的分支预测、单周期乘法、硬件除法等众多功能强大的特性,使用Thumb-2指令集实现了单精度浮点型的加、减、乘、除与比较运算,并给出了加减法运算的流程图和除法运算的源程序.     

循环冗余校验码的单片机及CPLD实现

循环冗余码校验(CRC)是一种可靠性很高的串行数据校验方法。介绍循环冗余码校验的基本原理,并分别用单片机和CPLD作了循环冗余码校验的软件实现和硬件实现。包括汇编语言和VHDL语言源程序。     

Practical dynamic consensus of Stuart–Landau oscillators over heterogeneous networks

ABSTRACT

In Panteley and Loria (2017), a framework for the study of synchronisation and collective behaviour of networked heterogeneous systems was introduced. It was underlined that in such scenario an emergent collective behaviour arises, one that is inherent to the network and that is independent of the interconnection strength. Therefore, the natural way to make complete study of synchronisation is by investigating, on one hand, the stability of the emergent dynamical system and, on the other, by assessing the difference between the motion of each individual system and that of the emergent one. Thus, if all systems' motions approach that of the emergent dynamics, we say that they reach dynamic consensus. In this paper, we study dynamic consensus of a fairly general class of nonlinear heterogeneous oscillators, called Stuart–Landau. We establish that the emergent dynamics consists in that of an ‘averaged’ oscillator with a global attractor that consists in a limit-cycle and, moreover, we determine its frequency of oscillation. Then, we show that the heterogeneous oscillators achieve practical dynamic consensus, that is, their synchronisation errors measured relative to the collective motion are ultimately bounded.     

Understanding compulsive social media use: The premise of complementing self-conceptions mismatch with technology

Some anecdotal accounts and research reports have suggested that obsessive social media involvement could turn into a compulsive behavior among university students. Unfortunately, the research that sheds light on the possible conditional nature of that relationship is scarce at best. Therefore, this study tries to address this issue by developing a contingency-based model and tests it using data gathered from a sample of university students. The model postulates that compulsive social media use arises due to self-awareness factors, and together they in turn predict problematic learning outcomes. It also postulates that these relationships are moderated by the influence of technological factors. The results indicate that self-esteem has a significant negative influence on compulsive social media use and that interaction anxiousness has a significant positive influence on the same. The results also reveal that only compulsive social media use has a significant direct influence on problematic learning outcomes; and that social media complementarity plays a moderating role in the model. We discuss the implications of these findings for research and practice.     

Two Projects for Understanding the Mind: A Response to Morris and Richardson

We respond to Morris and Richardson's (1995) claim that Pickering and Chater's (1995) arguments about the lack of a relation between cognitive science and folk psychology are flawed. We note that possible controversies about the appropriate uses for the two terms do not affect our arguments. We then address their claim that computational explanation of knowledge-rich processes has proved possible in the domains of problem solving, scientific discovery, and reasoning. We argue that, in all cases, computational explanation is only possible for aspects of those processes that do not make reference to general knowledge. We conclude that consideration of the issues raised by Morris and Richardson reinforces our original claim that there are two fundamentally distinct projects for understanding the mind, one based on justification, and the other on computational explanation, and that these apply to non-overlapping aspects of mental life.     

Moving the goal posts: a reply to Dawson and Piercey

Berkeley [Minds Machines 10 (2000) 1] described a methodology that showed the subsymbolic nature of an artificial neural network system that had been trained on a logic problem, originally described by Bechtel and Abrahamsen [Connectionism and the mind. Blackwells, Cambridge, MA, 1991]. It was also claimed in the conclusion of this paper that the evidence was suggestive that the network might, in fact, count as a symbolic system. Dawson and Piercey [Minds Machines 11 (2001) 197] took issue with this latter claim. They described some lesioning studies that they argued showed that Berkeley’s (2000) conclusions were premature. In this paper, these lesioning studies are replicated and it is shown that the effects that Dawson and Piercey rely upon for their argument are merely an artifact of a threshold function they chose to employ. When a threshold function much closer to that deployed in the original studies is used, the significant effects disappear.     

Investigating users’ intuitive interaction with complex artefacts

This paper examines the role of intuition in the way that people operate unfamiliar devices. Intuition is a type of cognitive processing that is often non-conscious and utilises stored experiential knowledge. Intuitive interaction involves the use of knowledge gained from other products and/or experiences. Two initial experimental studies revealed that prior exposure to products employing similar features helped participants to complete set tasks more quickly and intuitively, and that familiar features were intuitively used more often than unfamiliar ones. A third experiment confirmed that performance is affected by a person's level of familiarity with similar technologies, and also revealed that appearance (shape, size and labelling of features) seems to be the variable that most affects time spent on a task and intuitive uses during that time. Age also seems to have an effect. These results and their implications are discussed.     

Scheduling Queries to Improve the Freshness of a Website

The World Wide Web is a new advertising medium that corporations use to increase their exposure to consumers. Very large websites whose content is derived from a source database need to maintain a freshness that reflects changes that are made to the base data. This issue is particularly significant for websites that present fast-changing information such as stock-exchange information and product information. In this article, we formally define and study the freshness of a website that is refreshed by a scheduled set of queries that fetch fresh data from the databases. We propose several online-scheduling algorithms and compare the performance of the algorithms on the freshness metric. We show that maximizing the freshness of a website is a NP-hard problem and that the scheduling algorithm MiEF performs better than the other proposed algorithms. Our conclusion is verified by empirical results.     

一种前馈广义预测控制算法的研究及其仿真

研究了原油常压蒸馏塔的前馈广义预测控制算法 (GPC) ,克服了可测扰动对系统的作用。建立了以进料温度为可测扰动的常压塔常一线温度控制的CARIMA模型 ,实现了前馈GPC算法的仿真 ,验证了该算法对具有可测扰动的过程系统具有良好的控制作用 ,使系统具有良好的鲁棒性。