基于嵌入式Linux的工业控制系统

当前大多数应用于工业控制等领域的嵌入式系统都孤立于Internet网络之外。为利用Internet技术实现工业控制领域的低成本网络互联和远程监控，给出了基于ARM内核的32住高性能微控制器结合嵌入式Linux实现工业控制系统的设计方法，并介绍了控制系统单个节点的硬件和软件实现思想，以及系统的网络架构。该系统实现了通过Internet网络进行远程监测与遥控的功能，具有较好的实际应用前景。     

网络家电系统的嵌入式接口设计

根据网络家电的特点和要求，采用DSSOCA00网络微控制器设计了网络家电系统的嵌入式接口模块，描述了系统的体系结构及其组成，阐明了嵌入式网络接口模块的硬件设计。远程用户使用该系统可以通过Internet与DS80C400进行通信，实现对家电的远程监控。     

基于远程多参数的嵌入式监护系统研究

该文研究了基于嵌入式计算机的远程多参数监护系统,该监护系统主要由远程多参数监护终端,Internet和GPRS网络,医院监护中心服务器组成。远程多参数监护终端是整个系统的核心,它主要由多参数监护模块,嵌入式计算机系统,GPRS无线模块构成。在远程多参数监护终端中实现了嵌入式操作系统Linux的裁减,定制和移植,并且在此基础上介绍了基于嵌入式Linux操作系统的网络编程,实现了嵌入式计算机监护终端与监护中心服务器的数据通信,嵌入式多参数监护终端通过GPRS自动接入Internet,以及服务器端基于Winsock网络编程的实现。基于嵌入式计算机的远程多参数监护系统具有成本低,体积小,功耗低,携带方便,并且可以实现基于Internet和无线GPRS的心电,血压,呼吸,体温等多生理参数的远程监护。     

Linux嵌入式网络仪器的远程图像通信系统实现

为了在嵌入式中获得数字图像的远程通信和Internet传输,实现了基于uClinux嵌入式操作系统的图像信息采集网络仪器和通过拨号方式的嵌入式远程图像通信系统。网络仪器由MCF5272为硬件核心,以uClinux为操作系统。采用拨号方式实现远程接入Internet。图像经过解码和编码后,以文件方式保存和传输。介绍了图像采集网络仪器的构成、远程图像通信系统的组成、接入Internet的uCl; nux拨号方式、接收图像信息的Internet远程服务器的配置、嵌入式中图像文件自动传输与接收设计。并通过实验检验了网络仪器和远程通信的实现方案。结果表明,在Linux嵌入式网络仪器中采用远程拨号方式可以实现图像的因特网通信。     

面向嵌入式系统XML-RPC的C实现设计

随着嵌入式系统和网络技术的迅猛发展,将Webservice延伸到嵌入式系统中,解决松散网络中跨平台嵌入式系统程序调用已成为热点。就嵌入式系统远程服务中的问题提出了基于C语言开发的XML-RPC远程调用应用实现框架。     

基于ARM平台和GPRS的远程监控系统

主要介绍一种基于嵌入式处理器ARM平台以及GPRS网络通信技术实现远程数据传输的系统,从而实现远程数据和图像实时监控功能。核心部分主要包括利用嵌入式处理器ARM实现以太网协议到GPRS协议之间的转换、数字图像的处理;利用当前比较成熟的GPRS技术实现远程无线通信等。由于GPRS网络具有永远在线、快速登录、按量收费和自由切换等优点,从而保证了系统的实用性、稳定性,并且大大减少了系统的建设投资和运营费用。     

高速旋转机械嵌入式状态监测与故障诊断系统研究

采用嵌入式以太网技术，将信息融入企业信息网；采用B/S结构，构建风机等高速旋转机械的在线监测与远程故障诊断系统. 系统采用先进嵌入式以太网技术、动态网页技术、基于Agent的CORBA技术、COM/DCOM组件技术等开展网络远程智能维护研究，真正实现维修制度从事故维修、定期维修向视情维修的转变．     

基于StrongARM的远程网络监控系统设计

介绍一个基于IP网络的数字远程实时监控系统，其前端视频数据采集设备中使用Intel的StrongARM嵌入式微处理器，并采用Motion JPEG压缩，分组传输的方式，实现了视频信号的实时采集与远程处理，文中首先简单介绍整个系统的构成，然后详细介绍视频采集设备的结构以及视频服务器网络通信，多路显示等功能模块的软件实现。     

电梯嵌入式监控终端的设计与实现

介绍了一种网络化电梯远程监测系统，重点讨论了其中嵌入式监控终端硬件和软件的设计与实现。该嵌入式监控终端基于32位高性能嵌入式微处理器和嵌入式实时操作系统，可通过以太网口或嵌入式Modem基于TCP／IP协议进行网络通信，具有高可靠性、高实时性和运行费用低的特点。目前该系统已投入实际使用。     

基于嵌入式Web Server 的远程数据采集系统的网络实现

立足于实践工作经验,从体积、系统造价、嵌入式系统操作等三个方面,对嵌入式Web Server 系统应用优势进行简要分析。并且,从Web Server 构架、嵌入式Web Server 选择、CGI 工作原理分析,探究嵌入式Web Server 系统的主要配置。最后,基于LINUX 平台对Web Server 远程数据采集系统的开发及网络实现情况进行分析,指出远程数据采集系统的实现过程,进一步总结设计经验。     

Generation of root functionals of a system of polynomials

A root functional is a functional that is defined over a polynomial ring and annihilates the ideal of polynomials. The concept of a root functional is a generalization of the concept of a root to the case of multiple roots. This article considers a bilinear operation of generation of root functionals for a system of polynomials in variables, which allows one to construct a root functional from two root functionals. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 22–46, January–February 2008.     

The computation of zones of influence of linear geological structures

The concept of a zone of influence of a linear geological structure provides a method of quantifying the effect of the structure on the properties of its neighborhood. For example, a fault may exert some influence on the local roof conditions in a mine opening, or on the location of mineral deposits, where the influence at any given distance (up to the specified half-width of the zone of influence) from the fault is estimated by some postulated influence function. Any area of interest may be partitioned into a large number of cells, and the sum of the influences due to the nearby faults calculated for the midpoint of each cell. The program groups the cells, by midpoints, into sets comprising those cells affected by precisely 0,1,2,... faults, calculates the proportion each set constitutes of the area of interest, and the total of the midpoint sums of the cells in each set. Although the program was developed for a specific problem in a New South Wales colliery, the method is not specific to this problem and has application to many situations in rock mechanics, metallogenesis, seismicity, and in other fields in which the concept of a zone of influence may be relevant.     

Evaluation of a set of graphic symbols

To evaluate the efficiency of a coherent set of graphic symbols for public information in railway stations, a matching procedure was used, in which a referent was specified to respondents, and they were asked to select the appropriate symbol from the complete set of symbols shown to them. Data were collected in such a way that the effects of age and travel experience could be evaluated separately. A total of 29 symbols was evaluated using 11 600 railway passengers as respondents. The results show that only half the number of symbols meet a criterion of 67% correct responses. Both increasing age and a low level of travel experience have a deteriorating effect on the understanding of the symbols. In addition to the percentage correct responses, analysis of the confusions between referents and symbols allows a more detailed assessment of the causes of a low efficiency of a symbol or a group of symbols. It is demonstrated that, based mainly on the measured confusions between symbols, proposals for the redesign of symbols can be formulated.     

Unification of Four Versions of Program Semantics

Computing Science is a new subject, and we have not yet achieved the unification of theories that should support a proper understanding of its structure. CAR Hoare and He Jifeng, 1998. In this paper we use Priestley duality and Jónsson/Tarski duality to translate between four versions of program semantics: the relational model, predicate transformer semantics, information systems, and powerdomains. Our point of entry is the relational model, a kind of Kripke semantics, in which programs are thought of as input-output relations over a structured state space. Specifically, we present the state space as a certain kind of Priestley space, and programs as certain structure-preserving relations over such a space. We then derive, in circular fashion, a predicate transformer semantics from the relational model, an information system from the predicate transformer semantics, a powerdomain from the information system, and the original relational model back again from the powerdomain. The information system is also shown to be related to Hoare logic. To clarify the intuition behind this approach we present a case study, which is a ‘Priestley version’ of the so-called universal domain due to Plotkin, and we explicate various ideas about properties of programs and predicates in terms of this case study. Received April 1997 / Accepted in revised form February 1998     

Certification of Numerical Computation of the Sign of the Determinant of a Matrix

Certified computation of the sign of the determinant of a matrix is a central problem in computational geometry. Certification by known methods is practically difficult because the magnitude of the determinant of an integer input matrix A may vary dramatically, from 1 to || A || ⁿ , and the round-off error bound of the determinant computation varies proportionally. Because of such a variation, high precision computation of \det A is required to ensure that the error bound is smaller than the magnitude of the determinant. We observe, however, that our certification task of determining only a single bit of \det A , that is, the bit carrying the sign, does not require us to estimate the latter round-off error. Instead, we solve a much simpler task of computing numerically the factorization of a matrix by Gaussian elimination with pivoting (which is a subroutine of LAPACK and LINPACK) and of estimating the minimum distance 1/||A ^-1 || from A to a singular matrix. Such an estimate gives us a desired range for the round-off error of the factorization such that the invariance of the sign of det A is ensured as long as the error varies in this range. Based on these simple but novel observations, we devise new effective arithmetic filters for the certification of the sign, compare them with the known filters, and confirm the efficiency of our techniques by some numerical tests. Received March 29, 1998; revised December 14, 1998.     

Estimation of probabilities of label imperfections and correction of mislabels

Schemes that use both the imperfectly labeled and unlabeled pattern sets for the estimation of probabilities of label imperfections and correction of mislabels are presented in this paper. Using relationships between the class conditional densities, and a priori probabilities with and without imperfections in the labels, the problem of estimating probabilities of label imperfections is formulated as that of minimizing the Bayes probability of error. Experimental results are presented from the processing of remotely sensed multi-spectral scanner imagery data. A thresholding scheme is proposed for the correction of pattern mislabels. For a symmetric mislabeling case, a relationship is developed between the probability that such a scheme gives a bad label to a pattern and the probability that the scheme accepts the original label of the pattern. This relationship could be used for computing the threshold from unlabeled samples for a specified probability of bad labeling. An example is presented to illustrate the behavior of the scheme. Furthermore, bounds are presented between the Bayes errors with and without imperfections in the labels and are shown to become equalities when the imperfections in the labels become symmetric.     

容错控制系统部件重要度计算的CAD算法

部件(如传感器或执行器)的失效将导致系统性能的下降甚至完全失效。因此,在设计容错控制系统时确定部件重要度是非常重要的。本文提出了部件静态和动态重要度,它们分别表示了部件失效对系统静态和动态性能的影响程度。借助仿真和矩阵转换的运算,本文提出了能同时计算m个部件静态和动态重要度的CAD算法,例子验证了该法的有效性。     

DNS工作原理解析

DNS(Domain Name System域名解析系统)是因特网的一项核心服务,它作为可以将域名和IP地址相互映射的一个分布式数据库,能够使人更方便的访问互联网,而不用去记住能够被机器直接读取的IP数串,本文将结合Sniffer工具对DNS的工作原理给予详尽的解析。     

Reformulation of the theory of conceptual spaces

This paper presents a conceptual system based on two independently developed extensions of Gardenförs’ formulation of conceptual spaces. The new approach continues to emphasize the role of properties and their associations in conceptual representation, and to recognize the importance of similarity judgments in reasoning tasks. In the new theory, domains are sets equipped with a measure, and a property is a measurable membership function on a domain. Concepts are sets of properties and their binary associations. A new notion of the degree of ambiguity of properties for a given reasoning task is used to focus attention upon properties having the greatest discrimination power. The theory is demonstrated on a maritime application involving the categorization of vessel routes.     

最少钱币数量的计算与钱币面额的确定

钱币种类的发行和确定在相对长的一段时间内会保持一定程度的稳定性，钱币的总量和面额是一个国家在中长期通过规划和预算来进行确定的。那么怎么来确定钱币的面额，使得尽可能方便人们使用，不但便于计算，也要尽可能降低使用频率，这是一个比较实际和实用的问题。对于给定范围、给定钱币面额，借助埃拉托色尼筛法、迪杰斯特拉算法、图的广度优先遍历算法思想，设计了一个快速计算每个数值的最小钱币数量方法，即最少钱币数量筛法来计算平均纸张数量；对于给定范围、给定数量的钱币种类如何确定最优钱币组合问题，给出了3种钱币最优组合的寻找过程，即通过分析最优组合中每一个钱币的数值特征，找出其中的规律，并通过最小二乘法原理拟合出最优组合中每个钱币面额的拟合曲线，通过拟合曲线的限制，大大减少寻找最优钱币组合的遍历次数。