L2-P5三靶点绕障拱型水平井钻井技术

介绍了胜利油田L2—P5三靶点绕障拱型水平井的设计和施工情况，重点分析了该井直井段和水平段井眼轨迹控制技术，对施工中出现的问题进行了分析并给出了相应的对策，为该区类似井钻井提供了有益的借鉴。     

加强安全质量标准化建设建立安全生产的长效机制

通过持续不断的开展安全质量标准化建设,规范危险化学品的安全管理,建立以事故预防与风险控制管理为核心的安全质量标准化管理模式,建立安全生产的长效机制。     

A Standard Model-Theoretic Approach to Operational Semantics of Recursive Programs

In this paper we try to introduce a new approach to operational semantics of recursive programsby using ideas in the“priority method”which is a fundamental tool in Recursion Theory.In lieu ofmodelling partial functions by introducing undefined values in a traditional approach,we shall define apriority derivation tree for every term,and by respecting the rule“attacking the subterm of thehighest priority first”we define transition relations,computation sequences etc.directly based on astandard interpretation which includes no undefined value in its domain.Finally,we prove that ournew approach generates the same operational semantics as the traditional one.It is also pointed outthat we can use our strategy to refute a claim of Loeckx and Sieber that the opperational semanticsof recursive programs cannot be built based on predicate logic.     

FoxBASE与高级语言接口程序的设计

在计算机的应用编程中，经常会遇到在ＦｏｘＢＡＳＥ环境下使用高级语言的问题。本文通过实例及对数据库结构的分析，介绍了ＦｏｘＢＡＳＥ与高级语言接口程序的功能、原理及简单的设计方法。     

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 系列机中的定时信息。进而介绍利用这些信息实现各类长、短定时间隔的编程技巧,并以实例说明之。     

Local and global deadlock-detection in component-based systems are NP-hard

Interaction systems are a formal model for component-based systems. Combining components via connectors to form more complex systems may give rise to deadlock situations. We present here a polynomial time reduction from 3-SAT to the question whether an interaction system contains deadlocks.     

Geotechnical study for optimizing the slope design of a deep open-pit mine,India

The study was undertaken to determine the optimal overall slope angle of a lead–zinc mine, which could extend down to a depth of 170 m. Detailed geotechnical investigations were conducted, including geotechnical mapping of existing benches to establish the geometrical and mechanical properties of the discontinuities, the drilling of eight boreholes and the establishment of the physico-mechanical properties of the intact rock. Based on these data, limit equilibrium and numerical simulation techniques were applied to assess the stability of the slopes and determine an optimal slope angle. It was concluded that the overall foot-wall and hanging-wall slopes should be 42 and 48° respectively.      

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.