小型计算机系统的应用软件设计

本文通过JS-10A计算机在手套机群控和JS-10 B机在喷气织机数据处理系统中的应用,介绍了编制应用软件时常用的方法和技术。这些方法在具体应用中证明是可行的,并取得了预期的效果。     

JS—110小型工业控制机

上海调节器厂设计并制造的JS-110小型计算机主要用于工业控制,兼顾一般科学计算。工程设计和数据处理。该机克服了JS-10A机的缺点(JS-10A机是我国工业控制应用较广的一个机种,现已出售了三百五十余台),结构简单,性能良好,稳定可靠,尤其在价格性能比方面较为理想。经鉴定达到设计要求,将在一九八○年投入批量生产。估价为6万元左右/台。 JS-110机字长为16位,内存容量为8K字,可扩至60K。具有自动向量中断系统。配备基本汇编语言。采用失电现场进栈保护,上电自动出栈启动的失电保护方法。该机并配磁带外存。工作方式采用异步问答式。     

JS-10A小型工业电子计算机应用实例

JS-10A 小型工业电子计算机已有儿十个单位用于生产,大致应用范围有数据处理、生产过程控制、机床群控以及其它方面。在数据处理方面,上海第五钢铁厂使用 JS-10A机分析钢锭含量,一年多来,工人师傅反映说:“使用计算机解放劳动力,体现多快好省。”又如上海量具刃具厂使用 JS-10A 机计算齿轮误差,取得可喜成果;在生产过程控     

JS—188STD总线工业控制机系统

一、概述 JS-188是一种现场级的控制器,基本配置和技术规格为: 模拟量输入(AI):64点模拟量输出(AO):12～16点开关量输入(DI):32～64点开关量输出(DO):16～64点 CPU:8088,NEC V20,80C286,80386SX,68030 主频:5～25MHz 内存:256KB～8MB 半导体盘:512KB～16MB MTBF:17000h 以开关量为主的批量控制时,DIO可扩展至500点左右,在DO的端子板上带有中间继电器,有直流和交流两类,电压最高为220V.AC,触点容量最高达3A,软件实际可支持1000个DIO点。 JS-188共有一个系列、7个型号。其中,JS-188_s、JS-188_a采用的模板全部国产化,可用于一般要求的控制;JS-188_b采用6块美国P-L     

使用JS-10A电子计算机实现搪瓷喷花群控

一 概述 JS-10A电子计算机是上海调节器厂生产的小型工业控制机。它的运算速度为3万次/秒;字长为16位;内存容量为4K。 七九年三月我们成功地实现了使用JS-10A电子计算机对二条搪瓷面盆喷花生产自动线的群控;二条生产线共十六个工位,三十二     

JS—110双机工作系统

本文着重介绍为提高系统可靠性而设计的JS-110双机系统工作原理。     

基于DSP的网络传输设计与实现

介绍了TMS320C6416芯片与LAN91C111网卡芯片的硬件接口电路的设计，并将TCP／IP协议嵌入到TMS320C6416芯片中；根据应用的需要对DSP中实现的TCP／IP协议进行了必要的简化，实现了DSP的上网功能。     

读者服务部产品供应信息

7”日立液晶屏组件，多功能数码相片播放机，P111G可编程控制器系列，12V／220V转换器     

DA-681：基于x86架构机架安装嵌入式计算机

推出时间：2009—03 Moxa发布一款基于x86架构的嵌入式计算机DA-681，面向电力自动化市场，专为配电站应用而设计。DA-681支持VGA、6个以太网口、4个光隔RS-232串口、8个光隔RS-485串口、CF卡和USB。Moxa独家专利的散热设计“L—type”机构提供了更好的热效率。加上19英寸、1u的标准外形和导轨安装设计，使得DA-681成为工业应用的理想平台.     

驯服Gmail的五种武器

如果你问你的朋友“最近Internct上最火的是什么”?他一定会告诉你是Gmail(httP：／／www，g111ajl．com)，这个最大容量达1000MB的Web邮箱，虽然还没有正式推出，但已经谋杀了绝大多数Web邮件使用者的眼球。不少用过Gmail的用户都认为它并不是单纯的容量上的增加，功能细节上的细化才是它对     

应用JSFL实现Flash作品自动评价的探索与实践

针对SWF文件难以反编译的特点,提出在Flash编辑环境下,利用JSFL脚本对FLA文件进行计算机自动评价的新思路。实践证明,此类技术方法的使用,不仅简化了Flash作品自动评价的实现过程,还提高了作品评价的准确性,具有一定的实际应用价值。     

Robustness analysis via the running time of the interior point methods

Let Σ be the set of stable linear time-invariant autonomous systems, equipped with a stability robustness measure ρ. Let be the measure of the computational efficiency of the algorithm that verifies the stability of the elements of Σ. We demonstrate the existence of a robustness measure ρ, algorithm , and a monotonically increasing function h, such that for all stable ,implications of this relationship are then discussed.     

Edge coloring of bipartite graphs with constraints

A classical result from graph theory states that the edges of an l-regular bipartite graph can be colored using exactly l colors so that edges that share an endpoint are assigned different colors. In this paper, we study two constrained versions of the bipartite edge coloring problem.

Full-size image

Robust control of continuous-time Markov jump linear systems

This paper is concerned with the problem of designing robust H₂ state-feedback controllers for continuous-time Markov jump linear systems subject to polytopic-type parameter uncertainty. Based on the parameter-dependent Lyapunov function approach, a new method for designing robust H₂ controllers is presented in terms of solutions to a set of linear matrix inequalities. A numerical example is given to illustrate the effectiveness of the proposed design method.     

Triple positive solutions for some second-order boundary value problem on a measure chain

In this paper, we study the existence of three positive solutions for the second-order two-point boundary value problem on a measure chain,

where f:[t₁,σ(t₂)]×[0,∞)×R→[0,∞) is continuous and p:[t₁,σ(t₂)]→[0,∞) a nonnegative function that is allowed to vanish on some subintervals of [t₁,σ(t₂)] of the measure chain. The method involves applications of a new fixed-point theorem due to Bai and Ge [Z.B. Bai, W.G. Ge, Existence of three positive solutions for some second order boundary-value problems, Comput. Math. Appl. 48 (2004) 699–707]. The emphasis is put on the nonlinear term f involved with the first order delta derivative x^Δ(t).     

Web accessibility in the Mid-Atlantic United States: a study of 50 homepages

This paper reports on a study of 50 homepages in the Mid-Atlantic United States to determine what accessibility problems exist. The 50 homepages were evaluated using both the U.S. governments Section 508 guidelines as well as the Web Accessibility Initiatives (WAI) Priority Level 1 of the Web Content Accessibility Guidelines (WCAG). According to both sets of guidelines, 49 out of 50 sites were found to have accessibility problems, although some of the accessibility problems were minor and easy to fix. There are two troubling findings from this study. The Web sites that had the most accessibility problems were organizations in the Web development and information technology field, which ideally should be the leaders in making the Web more accessible. The Web accessibility software testing tools, which are available to assist people in making their Web sites more accessible, are flawed and inconsistent and require large numbers of manual checks, which many developers may not be able to do. More people need to become aware of the topic of Web accessibility, and the testing tools need to be improved so that once people are aware, it is easier for them to move their sites toward full accessibility.     

Hamiltonian-connected graphs

For a simple graph G, let . In this paper, we prove that if NCD(G)≥|V(G)|, then either G is Hamiltonian-connected, or G belongs to a well-characterized class of graphs. The former results by Dirac, Ore and Faudree et al. are extended.     

Oscillation criteria for second-order quasi-linear neutral difference equations

In this paper, we obtain some oscillation criteria for the second-order quasi-linear neutral delay difference equation

Full-size image

, where > 0, τ ≥ 0, and σ ≥ 0 are constants, {a_n}, {p_n}, {q_n} are nonnegative sequences and f ε C(R,R).     

High quantile estimation for heavy-tailed distributions

Different estimators of high quantiles, such as proposed in [N.M. Markovitch, U.R. Krieger, The estimation of heavy-tailed probability density functions, their mixtures and quantiles. Computer Networks 40 (3) (2002) 459–474], Weissman’s estimator and the POT-method are considered. Regarding the estimators and the asymptotic normality of the logarithms of ratios of these estimators to the true value of the quantile is proved. These estimators are applied to real data of Web sessions and pages. Furthermore, bootstrap confidence intervals of and are constructed for modelled data of different heavy-tailed distributions as well as for Web-traffic data.