A Type-Safe Embedding of XDuce into ML

We consider the problem of integrating XDuce into ML. This is difficult because of incompatible type and value representations. Our solution is a type-driven translation scheme from XDuce to ML based on a structured representation of XDuce values. XDuce type inference guides the insertion of appropriate coercion functions to translate regular expression pattern matching and uses of semantic subtyping. We can extend our translation scheme to include ML function calls and patterns into XDuce. Thus, we can embed XDuce into ML. Our results allow to enrich the ML language with support for dealing with semi-structured data.     

IBM—PC系列机中的定时功能

本文介绍 IBM-PC 系列机中的定时信息。进而介绍利用这些信息实现各类长、短定时间隔的编程技巧,并以实例说明之。     

Selectors Make Set-Based Analysis Too Hard

A set-based program analysis establishes constraints between sets of abstract values for all expressions in a program. Solving the system of constraints produces a conservative approximation to the program's runtime flow of values. Some practical set-based analyses use explicit selectors to extract the relevant values from an approximation set. For example, if the analysis needs to determine the possible return values of a procedure, it uses the appropriate selector to extract the relevant component from the abstract representation of the procedure. In this paper, we show that this selector-based approach complicates the constraint solving phase of the analysis too much and thus fails to scale up to realistic programming languages. We demonstrate this claim with a full-fledged value flow analysis for case-lambda, a multi-branched version of lambda. We show how both the theoretical underpinnings and the practical implementation become too complex. In response, we present a variant of set-based closure analysis that computes equivalent results in a much more efficient manner.     

利用测量头测量圆孔中心操作的简化

利用机床提供的顾客软体 (变量 ) ,通过三点确定一个圆心的公理 ,精确测定圆心位置座标     

Petri网模型代码映射研究

为了简化仿真系统的实现过程,分析总结了Petri网到程序代码的映射准则,从Petri网的基本元素和关系入手,根据逻辑关系建立映射的三类原子语句,并通过两种合成方式形成分子语句。以原型Petri网为例,遍历可达标识图的各种分支路径,提出循环路径到循环结构语句的代码映射方法。最后给出了带抑制弧的扩展Petri网和受控Petri网的代码映射方案,为Petri网向程序代码的转换提供了理论依据。     

转炉煤气回收和放散自动控制系统改进

针对在煤气回收和放散调试过程中发现的问题,通过改进转炉煤气回收和放散控制系统,增加气动三通阀控制联锁信号,保证放散的高度可靠性和煤气自动回收的高度安全性。     

A novel logic-based automatic approach to constructing compliant security policies

It is significant to automatically detect and resolve the incompliance in security policy.Most existing works in this field focus on compliance verification,and few of them provide approaches to automatically correct the incompliant security policies.This paper proposes a novel approach to automatically transform a given security policy into a compliant one.Given security policy Π and delegation policy M declared by logic programs,the approach automatically rewrites Π into a new one ΠM which is compliant with M and is readable by the humans.We prove that the algorithm is sound and complete under noninterference assumption.Formally,we show that the security policy query evaluation algorithm with conflict and unsettlement resolution still works very well on ΠM.The approach is automatic,so it doesn’t require a administrator with excess abilities.In this sense,our proposal can help us to save much manpower resource in security management and improves the security assurance abilities.     

COMPILE-TIME ANALYSIS AND OPTIMIZATION OF EXPLICITLY PARALLEL PROGRAMS*

Data flow analysis has been used by compilers in diverse contexts, from optimization to register allocation. Traditional analysis of sequential programs has centered on scalar variables. More recently, several researchers have investigated analysis of array sections for optimizations on modern architectures. This information has been used to distribute data, optimize data movement and vectorize or parallelize programs. As multiprocessors become more common-place. we believe there will be considerable interest in explicitly parallel programming languages. In this paper, we extend traditional analysis to array section analysis for parallel languages which include additional control and synchronization structures.

We show how to compute array section data flow information, i.e., Communication Sets, for a class of parallel programs. To illustrate its use, we show how this information can be applied in compile-time program partitioning. Information about array accesses can also be used to improve estimates of program execution time used to direct runtime thread scheduling.     

主机数据流量检测的实现

分布式网络环境中主机数据流量的异常通常反映出主机是否遭受病毒、木马等恶意程序的入侵而成为网络攻击中的傀儡机,因此,对主机数据流量进行监测可以尽早发现潜在的危险。研究了基于Cisco路由器的主机数据流量检测的基本方法,并给出了具体的程序实现方法和网络硬件环境配置方法。     

一些特殊方程的计算机程序解法

在人们生产、生活、以及科学研究中,常常会出现一些不容易求解的非线性方程或非线性方程组等特殊方程。文章运用数学知识和计算机MATLAB语言,介绍了这些方程的求解,从而快速得到这些方程的解。