Foxprow与BC＋＋开发的DLL的对接

本文深入探讨了利用动态连接扩充Ｆｏｘｐｒｏｗ功能的软件开发的方法，解决了Ｆｏｘｐｒｏｗ与ＢｏｒｌａｎｄＣ＋＋开发生成的动态连接库的对接问题，为Ｆｏｘｐｒｏｗ的功能增形成了一套成熟有效的实现手段。     

基于Windows的GIMS—灰色系统信息管理系统

本文介绍的是由华中理工大学自控系灰色系统信息中心开发研制的一套软件－ＧＩＭＳ系统，即灰色系统信息管理系统。文中着重讨论了系统结构，功能，系统特点，以及数据管理功能模块的设计思想。程序使用Ｆｏｘｐｒｏｗ２．６编写，采用模块结构，设计合理，使用     

一个ORACLE超文本在线帮助系统

该文采用超文本技术对软件系统的帮助信息进行组织，并通过ＯＲＡＣＬＥ数据库ＳＱＬ＊ＦＯＲＭＳ的分析，用ＳＱＬ＊ＦＯＲＭＳ实现了帮助信息的超文本数据库，据此，设计并实现了一个可用于ＳＱＬ＊ＦＯＲＭＳ的超文本在线帮助系统，利用该帮助系统，可以降低应用系统的复杂度，提高应用系统的开发效率和质量。     

智能化FOXBASE CAI的设计与实现

本文主要探讨了智能化ＦＯＸＢＡＳＥ语言的计算机辅助教学系统的设计与实现方法以及人工智能，个别化理论，认知学理论在计算机辅助教学中的应用。智能化ＦＯＸＢＡＳＥ ＣＡＩ是一个通过反馈机制和交互环境促进学生学习ＦＯＸＢＡＳＥ语言的辅助教学软件。通过该课件学习可以学知识，看演示，动手作练习，章末参加考试，系统自动评判学生的学习的水平，使学生达到无师自通，掌握ＦＯＸＢＡＳＥ系统基本原理。     

容错计算机技术（下）

五、ＦＴＳＡ容错机的工作原理二．实现ＦＴＳＡ的四个目标ＦＴＳＡ通过重新定义系统ＢＩＯＳ的功能而实现其目标。它把ＢＩＯＳ变成ＤＯＳ层之下的一个多任务操作系统，对多个处理器及其外设进行异步控制。ＦＴＳＡ在结构设计上，把包括ＣＰＵ在内的所有系统器件驻留在ＩＳＡ总线上，由四个微处理器控制ＦＴＳＡ：·ＣＰＵ，可以是３８６，３８６ＳＸ，４８６，５８６微处理器·用于电源管理子系统中的协处理器·在ＳＣＳＩ－ＩＩ控制器上的协处理器·在一个独立的总线卡上的诊断协处理器ＦＴＳＡＢＩＯＳ是这种系统构成的基本链接，它监视…     

调用Windows API增强FoxProw图形功能

本文讨论了如何通过调用Ｗｉｎｄｏｗｓ的动态链接库（ＤＬＬ）来扩展ＦｏｘＰｒｏｆｏｒＷｉｎｄｏｗｓ的功能，并结合本人在Ｆｏｘｐｒｏｗ的环境下图形数据库的体会，介绍了几个有关图形功能的ＷｉｎｄｏｗｓＡＰＩ功能调用的技术问题，这一工作对于建立一个人机交互界面友好的信息管理系统，具有一定的参考意义。     

自适应的通用数据库应用程序设计

该文针对数据库应用程序设计中低效重复工作较多这一问题，探讨了应用程序的自适应技术，在ｄＢＡＳＥ／ＦｏｘＢＡＳＥ数据库系统中实现了通用的数据库应用系统，对其结构规范作了说明。     

面向对象的特征设计系统的开发与研究

本文结合面向对象的特征设计原型系统（ＯＯＦＤＳ）的开发，论述了面向对象机制的实现方法，面向对象的特征表达以及特征设计的方法，原型系统基于ＡｕｔｏＣＡＤ环境，并应用其接口语言ＡｕｔｏＬＩＳＰ进行开发。     

FoxBASE应用程序的加密实现

本文把ＦｏｘＢＡＳＥ应用程序看作是ＦｏｘＢＡＳＥ系统的一个数据输入流，根据ＤＯＳ管理滋盘文件的方法，介绍了一种以文件在磁盘上存储的位置参数为密钥对ＦｏｘＢＡＳＥ应用程序进行加密，然后在解释执行时临时解密还原的方法，从而实现了应用程序的防拷贝及防反编译分析。     

模拟钣金冲压成形的计算机软件系统

ＳＭＦＳＳ１由模具设计的ＣＡＤ模块，前处理模块，成形过程仿真模块和后处理模块及接口组成，仿真模块使用有限元方法对成形过程中的接触问题采用了接触搜寻法确定接触对，并使用罚参数法快速准确地球出接触力，前后处理模块使ＣＡＤ系统与仿真模块构成统一的应用系统，应用效率与方便性良好，通过应用实例说明软件的实用性及可应用性。     

计算机内镜图文管理系统

作者针对传统内镜检查报告单中缺少图象和模拟图象不易处理的缺点，建立了一种图文叠加的数据库管理方法，介绍一种在ＩＢＭ５８６微机上开发的计算机内镜图文管理系统，该系统按照内镜名词的标准，采用选择项的文本输入方式，在中文Ｗｉｎｄｏｗｓ３．２的平台下，用中文Ｆｏｘｐｒｏｗ２．５ｂｆｏｒ Ｗｉｎｄｏｗｓ语言编写，模拟摧镜图象通过Ａ／Ｄ转换器转换为数字图象后，一方面，方便内的图象采集与运用图象处理的方法来突出     

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.     

Symmetry between the intentionality of minds and machines? The biological plausibility of Dennett’s account

One of the most influential arguments against the claim that computers can think is that while our intentionality is intrinsic, that of computers is derived: it is parasitic on the intentionality of the programmer who designed the computer-program. Daniel Dennett chose a surprising strategy for arguing against this asymmetry: instead of denying that the intentionality of computers is derived, he endeavours to argue that human intentionality is derived too. I intend to examine that biological plausibility of Dennett’s suggestion and show that Dennett’s argument for the claim that human intentionality is derived because it was designed by natural selection is based on the misunderstanding of how natural selection works.     

On Kronecker products,tensor products and matrix differential calculus

The algebra of the Kronecker products of matrices is recapitulated using a notation that reveals the tensor structures of the matrices. It is claimed that many of the difficulties that are encountered in working with the algebra can be alleviated by paying close attention to the indices that are concealed beneath the conventional matrix notation. The vectorization operations and the commutation transformations that are common in multivariate statistical analysis alter the positional relationship of the matrix elements. These elements correspond to numbers that are liable to be stored in contiguous memory cells of a computer, which should remain undisturbed. It is suggested that, in the absence of an adequate index notation that enables the manipulations to be performed without disturbing the data, even the most clear-headed of computer programmers is liable to perform wholly unnecessary and time-wasting operations that shift data between memory cells.     

The Relaxed Online Maximum Margin Algorithm

We describe a new incremental algorithm for training linear threshold functions: the Relaxed Online Maximum Margin Algorithm, or ROMMA. ROMMA can be viewed as an approximation to the algorithm that repeatedly chooses the hyperplane that classifies previously seen examples correctly with the maximum margin. It is known that such a maximum-margin hypothesis can be computed by minimizing the length of the weight vector subject to a number of linear constraints. ROMMA works by maintaining a relatively simple relaxation of these constraints that can be efficiently updated. We prove a mistake bound for ROMMA that is the same as that proved for the perceptron algorithm. Our analysis implies that the maximum-margin algorithm also satisfies this mistake bound; this is the first worst-case performance guarantee for this algorithm. We describe some experiments using ROMMA and a variant that updates its hypothesis more aggressively as batch algorithms to recognize handwritten digits. The computational complexity and simplicity of these algorithms is similar to that of perceptron algorithm, but their generalization is much better. We show that a batch algorithm based on aggressive ROMMA converges to the fixed threshold SVM hypothesis.     

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.     

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.