ADA中间语言DIANA界面上的二个工具

1.DIANA的外部表示文法(1)〈DIANA程序〉::=〈使用结点〉〈结点序列〉(2)〈使用结点〉::=名字〈属性标号地址〉|整数〈标号地址〉(3)〈属性标号地址〉::=〈属性部分〉|:〈结点〉|^(4)〈标号地址〉::=:〈结点〉|^(5)〈属性部分〉::=[〈属性〉〈属性序列〉]|空     

串行通讯软模块在UNIX系统和WIN32系统间的移植探索

串行通讯在工业控制领域有着极为广泛的应用，这类软件模决常见的支撑系统有WIN32系统^2和一系列类UNIX系统^3。本文对这两大类系统下的串行通讯进行了比较并为串行通讯软模块在两种系统平台之间的移植提供一个技术参考。     

最大流有效算法的实用化设计与动态实现

对一个O（｜V｜^3）的最大流有效组合算法进行了研究，提出了用广度优先搜索的方法实现该算法的实用化设计方法。给出了该实用化方法具有的性质，利用该性质，采取正逆双向广度优先搜索的方式，按路径长度递增的次序依次形成各辅助网L，从而计算各辅助网L的最大流，最终组合成最大流。设计了十字双向链表存储结构，该结构采用了独特的动态双向邻接表存储辅助网L，这样即保留有用信息并删除无用信息，又保证最大流有效算法的时间复杂虚仍为O（｜P｜^3）从而实现了动态存储。     

不饱和烃的QSPR研究

计算了不饱和烃(烯烃、炔烃、烷基苯)的J指数，并结合最大距离度Sj^max研究了J指数分别与不饱和烃的△Hf(g)^0、△S(g)^0、△Gf(g)^0、ω、tb等一系列分子理化性质之间的相关性和选择性，用计算机回归方法构建了计算不饱和烃的不同理化性质的最优经验公式，结果显示，其相关性和选择性均优于文献。     

基于Nation／双层L-半胱氨酸-纳米金固定辣根过氧化氢酶的生物传感器

利用滴涂于金盘电极表面的Nation膜中负电性的磺酸基与L-半胱氨酸阳离子之间的静电作用实现L-半胱氨酸的固定化，然后利用L-半胱氨酸表面的巯基吸附纳米金，荷负电的纳米金再结合L-半胱氨酸阳离子后再吸附纳米金以制备基于多层分子自组装的辣根过氧化氢生物传感器。采用循环伏安法考察了传感器的电化学特性，用Co（bpy）3^3^＋作为电子媒介体，峰电流值与H2O2浓度在2．5×10^-5～5．0×10^-3mol／L成线性关系，检测下限为1.0×10^-5mol／L（S／N=3）。该传感器具有响应快、灵敏度高、稳定性好的性能，且具有良好的选择性，能有效排除抗坏血酸、抗尿酸等常见干扰物质对测定的影响。     

浅谈CPU缓存的分级

现代的桌面级CPU都有内置的高速缓冲存储器(Cache)，简称CPU缓存，它在CPU与内存之间提供了临时的、高速的数据存储空间，大大减轻了内存对CPU性能的制约。典型的CPU缓存结构是由一级缓存(L1 Cache)和二级缓存(L2Cache)组成，部分高端CPU还具有三级缓存(L3Cache)。     

用于系统辨识的伪随机信号生成程序

本文介绍了用微机产生伪随机信号M序列、L序列的基本原理,并给出一个能产生不同长度M序列、L序列的实用Z80汇编程序。图3     

多环芳烃(PAHs)对虹鳟(Oncorhynchus mykiss)鱼腮细胞系细胞毒性的Fisher判别分析

采用量子化学PM3算法计算得到的多环芳烃(PAHs)的量子化学参数，应用逐步判别分析法分析PAHs的细胞毒性，建立了能成功预测PAHs细胞毒性的Fisher线性判别函数，函数预测结果的正确识别率达到100％。研究认为影响PAHs细胞毒性的主要因素是PAHs的分子量(Mw)、偶极矩(μ)、分子最高占据轨道能(EHDMO)、分子最低未占据轨道能(ELUMO)和(ELUMO-EHOMO)^2。     

济钢中厚板L3物流跟踪系统

建立了覆盖全厂物流跟踪系统(L3)，将总公司宏观管理的各项指标同厚板厂个区域的自动化操作系统(L2)联系起来，将分厂的生产情况透明化。详细介绍了L3系统总体技术方案及针对现场的实际情况的采取的技术措施。     

一种高速可编程模糊控制器

本文以MOS－DYL工艺构成的可实现电流型、电压型电路互相兼容的通用模糊逻辑集成电路作为基础，提出了一种高速可编码模糊逻辑控制器的硬件实现方案。研究结果表明，其速度可达4×10^7FIPS（每秒模糊推理次数）。     

一种新的灰度图像Legendre矩的快速算法

Legendre正交矩在模式识别和图像分析等领域有着广泛的应用，但由于计算的复杂性，相关的快速算法尚未得到很好的解决，已有方法均局限于二值图像．文章提出了一种灰度图像的Legendre正交矩的快速算法，借助于Legendre多项式的递推公式推导出计算一维Legendre矩的递归公式．利用该关系式，一维Legendre矩Lp可以用一系列初始值L1(a)，a＜p，Lo(a)，a＜p-1来得到．而二维Legendre矩pq可以利用一维算法进行计算,为了降低算法复杂度，文中采用基于Systolic阵列的快速算法进行计算L1(a)，Lo(a),与直接方法相比，快速算法可以大幅度减少乘法的次数，从而达到了降低算法复杂度的目的。     

Global mapping of greenhouse gases retrieved from GOSAT Level 2 products by using a kriging method

Because a synoptic overview facilitates understanding of the temporal and spatial changes in the global distribution of greenhouse gases, we developed a statistical spatial estimation method using kriging. Level 3 (L3) data products for the Greenhouse Gases Observing Satellite (GOSAT) Thermal And Near infrared Sensor for Carbon Observation (TANSO) Fourier Transform Spectrometer (FTS) Short Wave Infrared (SWIR) were generated from column-averaged, dry-air mole fractions of carbon dioxide (XCO₂) and methane (XCH₄) TANSO-FTS SWIR Level 2 (L2) products using this method. Although there have been some reports on the use of kriging for analysing GOSAT products, the kriging method used in this research was specifically adapted to the statistical characteristics of GOSAT L2 products. In the context of using data for atmospheric research, spatially interpolated data (GOSAT L3 products) cannot be more accurate than model-simulated global distributions of gas concentrations (GOSAT Level 4B (L4B) products), which are generated using an atmospheric tracer transport model. However, the L3 product takes much less time to generate than the L4B. It would take about a year to produce the L4B after generation of an L2 product. The great advantage of the L3 product is that it gives a comprehensive and reasonable monthly global distribution of gas concentrations with little delay. The L3 product using the kriging method can be generated on a monthly basis by estimating global semi-variogram curves from the L2 products for each month and interpolating spatially within a region with a radius of 1000 km from existing L2 data locations. The main purpose of this paper is to describe the methodology and characteristics of kriging used to generate the GOSAT L3 product, not for strictly scientific use of the estimated values, but for a reasonable global map of gas concentrations derived statistically from the sparsely observed L2 products within a short time frame. The characteristics of this method are compared to XCO₂ products simulated with an atmospheric tracer transport model. The results show that the method proposed in this study is of practical use for generating L3 products from L2 products.     

铜掺杂聚L-天冬氨酸修饰电极同时测定多巴胺和尿酸

用循环伏安法制备了铜掺杂聚L-天冬氨酸修饰玻碳电极,研究了多巴胺（DA）和尿酸（UA）在该修饰电极上的电化学行为,建立了同时测定DA和UA的新方法。在pH3．5的磷酸盐缓冲溶液中,扫描速率为120mV]s时,DA和UA在该电极上产生氧化还原峰,峰电位分别为Eps=0．429V、Epc=0．336V（DA）和Eps=0．617V（UA）,DA和UA的氧化峰分开达0．188V。采用循环伏安法（CV法）和示差脉冲伏安法（DPVs法）同时测定DA和UA的线性范围分别为：DA：3．00×10^-6-4．00×100mol／L、4．00×10^-5～1．00×10^-4mlo/L（CV）、3．00×10^-7～3．00×10^-6mol／L、3．00×10^-6—1．00×10^-5mol／L（DPVs）,UA：8．00×10^-6～5．00×10^-5mol／L、5．00×10^-5-2．00×10^-4mol／L（CV）、3．00×10^-7～5．00×10^-5mol／L、5．00×10^-5．2．00×10^-4mol／L（DPVs）;检出限分另U为8．0×10^-7mol／L、1．0×10^-6mol／L（CV）和3．0×10^-7mol/L、3．0×10^-7mol／L（DPVs）。用于人体尿液中DA和UA的同时测定,结果满意。     

The latest in VPNs: part II

We describe the lastest in VPN. Virtual private networks (VPNs) can be configured and operated across a network provider's shared network infrastructure. The layer-2 VPN (L2VPN) is generating much interest and activity in the industry; it's defined as a VPN that transports native L2 frames across a shared IP network. Network providers will be able to reduce infrastructure and operation costs by taking traffic from L2-specific networks and running it over L2VPNs. An L2VPN transports native L2 frames across a shared IP or multiprotocol label-switching (MPLS) packet-switch network (PSN). The L2 frames can be frame-relay (FR) protocol data units, ATM cells, or even Ethernet frames; they're carried across the PSN using one of several different tunnel-encapsulation schemes. An L2VPN essentially provides the same set of services that native L2 LAN and WAN infrastructures support. We also discuss L2VPNs architecture and components.     

SeaWiFS data interpretation in a coastal area in the Bay of Biscay

The Sea-viewing Wide Field-of-view Sensor (SeaWiFS) instrument, launched onboard the Orbimage 2 satellite, is composed of an optical scanner with eight channels that are used to interpret the ocean colour, and has been operational since September 1997. SeaWiFS data were received by the Dundee Satellite Receiving Station and processed by the Plymouth Marine Laboratory with a slight time-lag. In situ measurements of reflectance, salinity, seston and chlorophyll a were analysed during the Biomet surveys to gain a better knowledge of the dynamics of the Gironde turbid plume during this period. The results showed logarithmic relationships between the SeaWiFS normalized water-leaving radiances (n L w ) at 490 and 555 nm (n L w (490) and n L w (555)), and the suspended particle matter concentrations. The relationship between the n L w (555) radiances and these concentrations is used to map the coastal terrigenous turbidities. But the chlorophyll a concentrations calculated from SeaWiFS are overestimated in the turbid waters. The n L w (490)/n L w (555) ratio decreases with increasing turbidity and with increasing chlorophyll a concentration. To distinguish the chlorophyll a in turbid waters, the n L w (490) radiances are calculated from n L w (555) considering only the effect of terrigenous turbidity. Then, the n L w (490) SeaWiFS image is compared to the calculated n L w (490), to reveal the 'negative' areas caused by the chlorophyll a and yellow substance absorption.     

The essential ability of sparse reconstruction of different compressive sensing strategies

We show the essential ability of sparse signal reconstruction of different compressive sensing strategies,which include the L1 regularization,the L0 regularization(thresholding iteration algorithm and OMP algorithm),the Lq(0 < q ≤ 1) regularizations,the Log regularization and the SCAD regularization.Taking phase diagram as the basic tool for analysis,we find that(i) the solutions of the L0 regularization using hard thresholding algorithm and OMP algorithm are similar to those of the L1 regularization;(ii) the Lq regularization with the decreasing value of q,the Log regularization and the SCAD regularization can attain sparser solutions than the L1 regularization;(iii) the L1/2 regularization can be taken as a representative of the Lq(0 < q < 1) regularizations.When 1/2 < q < 1,the L1/2 regularization always yields the sparsest solutions and when 0 < q < 1/2 the performance of the regularizations takes no significant difference.The results of this paper provide experimental evidence for our previous work.     

Teaching Turkish-Dutch kindergartners Dutch vocabulary with a social robot: Does the robot's use of Turkish translations benefit children's Dutch vocabulary learning?

Providing first language (L1) translations in L2 vocabulary interventions may be beneficial for L2 vocabulary learning. However, in linguistically diverse L2 classrooms, teachers cannot provide L1 translations to all children. Social robots do offer such opportunities, as they can be programmed to speak any combination of languages. This study investigates whether providing L1 translations in a robot-assisted L2 vocabulary training facilitates children's learning. Participants were Turkish-Dutch kindergartners (n = 67) who were taught six Dutch (L2) words for which they knew the L1 (Turkish), but not the L2 Dutch form. Half of these words were taught by a Turkish-Dutch bilingual robot, alongside their Turkish translations; the other half by a monolingual Dutch robot. Children also completed Dutch and Turkish receptive vocabulary tests. Results of generalized linear regression models indicated better performance in the Dutch-only condition than in the Turkish-Dutch condition. Children with well-developed Turkish and Dutch vocabulary knowledge outperformed children with less well-developed vocabulary knowledge. The majority of children preferred working with the bilingual robot, but children's preference did not affect word learning. Thus, contrary to our prediction, we found no evidence for a facilitating effect of providing L1 translations through a robot on bilingual children's L2 word learning.     

A cooperative recurrent neural network for solving L(1) estimation problems with general linear constraints

The constrained L(1) estimation is an attractive alternative to both the unconstrained L(1) estimation and the least square estimation. In this letter, we propose a cooperative recurrent neural network (CRNN) for solving L(1) estimation problems with general linear constraints. The proposed CRNN model combines four individual neural network models automatically and is suitable for parallel implementation. As a special case, the proposed CRNN includes two existing neural networks for solving unconstrained and constrained L(1) estimation problems, respectively. Unlike existing neural networks, with penalty parameters, for solving the constrained L(1) estimation problem, the proposed CRNN is guaranteed to converge globally to the exact optimal solution without any additional condition. Compared with conventional numerical algorithms, the proposed CRNN has a low computational complexity and can deal with the L(1) estimation problem with degeneracy. Several applied examples show that the proposed CRNN can obtain more accurate estimates than several existing algorithms.     

The evolution of load/unload technology

 Load/unload (L/UL) has recently replaced contact start-stop (CSS) technology in major segments of the hard disk-drive (HDD) industry. Although L/UL has existed since the earliest HDDs, recent implementations use fixed ramp L/UL systems, which are considerably simpler than earlier versions. L/UL offers multiple advantages over CSS, including practically unlimited start-stop cycles and improved shock robustness. However, disk damage can occur in L/UL drives due to head-disk contacts, and a variety of parameters including vertical L/UL speed and slider corner radius should be optimized to minimize damage. Tight control of key tolerances is essential to maximize available disk real estate and minimize the required disk spacing to accommodate L/UL. Power-off retract systems for L/UL must produce higher retract torque than those for CSS designs, leading to new retract circuit designs. Received: 6 July 2001/Accepted: 21 September 2001     

An Algorithm for Minimal Insertion in a Type Lattice

The problem of inserting a new element x into a lattice of types L is addressed in the paper. As the poset L + x obtained by the direct insertion of x in L is not necessarily a lattice, some set of auxiliary elements should be added to restore the lattice properties. An approach toward the lattice insertion is presented which allows the set of auxiliary elements to be kept minimal. The key idea is to build the final lattice L ⁺ as isomorphic to the Dedekind–McNeille completion of the order L + x . Our strategy is based on a global definition of the set of auxiliary elements and their locations in L ⁺. Each auxiliary is related to a specific element of L , an odd , which represents GLB (LUB) of some elements in L superior (inferior) to x . An appropriate computation scheme for the auxiliary types is given preserving the subtyping in the lattice L ⁺. The insertion strategy presented is more general than the existing ones, since it deals with general kinds of lattices and makes no hypothesis on the location of x in L . An algorithm computing L ⁺ from L and x of time complexity O (| L || J ( L )| ω ^3( L )) is provided.