用Oracle91AS及相关产品构建企业过程控制HMI

本文主要介绍了如何用Oracle9iAS、Forms和Oracle为唐钢1700mm热轧薄板过程控制系统构建Web开发环境,具体包括Oracle10g、Oracle91AS、Forms的安装、配置以及Forms应用程序在Web上的部署与发布,并比较完整地给出了开发企业过程控制人机交换界面(human machie interface)的方案。     

Oracle Forms在1580mm热轧生产线上的应用

本文主要介绍了如何用Oracle Forms和Oracle 10g为唐山不锈钢有限责任公司1580mm热轧薄板生产线开发过程控制系统人机接口—HMI（Human Machine Interface）,包括Oracle 1Og、Oracle Application Server、Oracle Forms的介绍、安装和配置,以及Forms开发实例和PL/SQL在Forms中的应用。     

Oracle Forms在冷轧二级HMI系统中的应用分析

Oracle Forms是Oracle Developer Suit(Oracle开发者套件)的一款开发软件,主要用于开发数据表单。本文概括介绍了Oracle Forms软件,对软件的使用要点进行了研究分析和归纳总结,介绍了冷轧二级HMI系统的组成与功能,并对Oracle Forms在冷轧二级HMI系统中的应用进行了深入剖析。     

Oracle Forms中的VBX控件技术

本文首先概述了VBX控件的概念及其在Oracle Forms中的表现方式,接着介绍了在 Oracle Forms Designer中设计产生VBX控件的过程和方法,最后详细阐述了Oracle Forms Runtime中使用VBX控件的技术。     

一套可行的Oracle Forms-ASP.NET迁移方案

许多老旧的Oracle Forms程序都面临着更新换代的压力。然而更大的压力来自于Oracle Forms,这一曾经辉煌的快速开发平台已完全过时这一事实。本文通过分析Oracle Forms和ASP.NET的部分功能,提出了一套由旧的Oracle Forms系统渐近地、逐步地迁移向使用最新技术的基于ASP.NET的应用程序的技术方案。该方案可以分期地实施,并在实施过程中最大化地降低用户的不便性。本文旨在通过该方案为那些受困于老旧的Oracle Forms程序的维护人员指出一条跳出围城的路子。     

Oracle＊Forms与Oracle＊Graphics的集成技术

本文将研究Oracle*Forms与Oracle*Graphics集成的作用和机制,并结合典型实例着重介绍使用OG．PLL集成Oracle*Forms与Oracle*Graphics的方法和步骤。     

基于Oracle*Forms的遥感解译知识库查询系统的实现

本文以一个卫星应用系统图像处理子系统的开发为例阐述了如何利用Oracle*Forms4.5做为客户端开发工具,对建议在大型关系数据库Oracle基础上的解译知识库查询系统进行的界面与功能开发及系统开发的有关关键技术。     

关系数据库ORACLE应用技巧

随着关系数据库Oracle在我国的逐渐普及，越来越多的应用系统用Orade进行开发，但因Oracle资料相对较少，在具体应用中常常会遇到许多书本上查找不到的问题，一些问题看似简单，正确理解、准确应用，常常要化费不少时间。本人在开发Oracle数据库应用程序时，总结出一些SQL*Forms应用技巧，观介绍给大家，希望有所帮助。1．INP文件的利用建立SPL+Forms格式时，会生成．FRM和．WP两个文件，但我们往往忽略了其中的文本文件．INp，殊不知它对一些特殊的用途却很有帮助。譬如：我们要对格式中每个字段建立中文帮助信息。当然可以在定义…     

Oracle Developer／2000的多媒体开发

Oracle推出的新版本Oracle Developer/2000大力提倡Client/Sever工作方式。它主要包括3个集成化应用开发工具:Forms(数据表格生成工具)、Reports(数据统计及报表生成工具)、(Graphics(数据图形生成工具)。本文以Forms为例介绍如何进行多媒体设计。     

Oracle Web应用服务器及开发技术的研究

介绍了Oracle Web Application Server3.0的体系结构和特点,具体 说明了如何实现与Oracle数据库服务器连接。在研究其各种Web Request Broker部件的基础上,给出了基于Web的交互式应用程序开发的技术方案和应用实例。对于开发基于Internet/Intranet的Oracle应用程序有一定的借鉴作用。     

Structural properties of oracle classes

Denote by the class of oracles relative to which (collapsing oracles), and by the class of oracles relative to which (separating oracles). We present structural results on and . Using a diagonalization argument, we show that neither nor is closed under disjoint union, also known as join. We show that this implies that neither nor is closed under union, intersection, or symmetric difference. Consequently , the first level of the extended low hierarchy, is not closed under join.     

Log space machines with multiple oracle tapes

As an alternative to previously studied models for space-bounded relative computation, an oracle Turing machine with a space bound on its worktape and an arbitrary number of oracle tapes is considered. Basic properties of the resulting reducibilities are examined.     

On the oracle complexity of factoring integers

The problem of factoring integers in polynomial time with the help of an infinitely powerful oracle who answers arbitrary questions with yes or no is considered. The goal is to minimize the number of oracle questions. LetN be a given compositen-bit integer to be factored, wheren = log₂ N. The trivial method of asking for the bits of the smallest prime factor ofN requiresn/2 questions in the worst case. A non-trivial algorithm of Rivest and Shamir requires onlyn/3 questions for the special case whereN is the product of twon/2-bit primes. In this paper, a polynomial-time oracle factoring algorithm for general integers is presented which, for any >0, asks at most n oracle questions for sufficiently largeN, thus solving an open problem posed by Rivest and Shamir. Based on a plausible conjecture related to Lenstra's conjecture on the running time of the elliptic curve factoring algorithm, it is shown that the algorithm fails with probability at mostN ^–/2 for all sufficiently largeN.     

Lattice-based group signature scheme without random oracle

ABSTRACT

Group signature is a cryptographic primitive where any member can anonymously sign a message on behalf of the population they belong to. Several group signatures were proposed based on number-theoretic assumptions. All these schemes are insecure in the presence of quantum computers. Group signatures based on lattice assumptions are believed to be quantum-resistant. In the past few years, group signatures based on lattice assumptions have been proposed and most of them are proved to be secure in random-oracle model. This paper presents a lattice-based group signature scheme without using random-oracle. Our scheme is based on correlation-intractable function ensembles for all evasive relations which are constructed recently based on well-defined assumptions. Security of our scheme is proved based on correlation-intractable function ensembles and hardness of Short Integer Solution and Learning With Errors problem.     

On one application of computations with oracle

Let P(d) be a program implementing a partial recursive function φ. Let $ \mathcal{O} $ \mathcal{O} _P denote a function defined on the domain of function φ that maps an input data d ₀ onto the path of computation of P on the input d ₀. Let Q(p, d) be a program returning a value if and only if p = $ \mathcal{O} $ \mathcal{O} _P (d), and let the value of the program be Q($ \mathcal{O} $ \mathcal{O} _P (d), d) = P(d). Program Q(p, d), which is totally absurd from the point of view of its practical computation on concrete input data, may be practically useful when it is analyzed by a metaprogram. It is shown in the paper how program Q(p, d) can be used for verification of a postcondition imposed on program P(d). The proposed method was tested on verification tasks for cache coherence protocols and other distributed computing systems.     

An oracle builder’s toolkit

We show how to use various notions of genericity as tools in oracle creation. In particular,

1. we give an abstract definition of genericity that encompasses a large collection of different generic notions;

2. we consider a new complexity class AWPP, which contains BQP (quantum polynomial time), and infer several strong collapses relative to -generics;

3. we show that under additional assumptions these collapses also occur relative to Cohen generics;

4. we show that relative to -generics, ULIN∩co-ULINDTIME(n^k) for any k, where ULIN is unambiguous linear time, despite the fact that UP(NP∩co-NP)P relative to these generics;

5. we show that there is an oracle relative to which NP/1∩co-NP/1(NP∩co-NP)/poly; and

6. we use a specialized notion of genericity to create an oracle relative to which

NP^BPPMA.

Characterizations of reduction classes modulo oracle conditions

It is known that nondeterministic polynomial time truth-table reducibility is exactly the same as nondeterministic polynomial time Turing reducibility. Here we study the standard nondeterministic reducibilities (conjunctive, bounded truth-table, bounded positive truth-table, and many-one) and show that each is a restriction of nondeterministic polynomial time Turing reducibility corresponding to acceptance modulo a set of oracle conditions. Then we show that the reduction classes of these reducibilities are classes of formal languages and as such have language theoretic characterization theorems. The same program is carried out for polynomial space.This research was supported in part by the National Science Foundation under Grants MCS77-23493, MSC80-11979, MCS81-20263, and MCS83-12472. The work of the second author was also supported by the United States-Israel Educational Foundation (Fulbright Award).     

On languages accepted by space-bounded oracle machines

Characterizations of classes of languages accepted by space-bounded oracle machines are developed. These characterizations are given in terms of the regular sets, certain information about the oracle set, and certain algebraic closure operations.This research was supported in part by the National Science Foundation under Grant MCS77-11360     

An automated framework for software test oracle

Context

One of the important issues of software testing is to provide an automated test oracle. Test oracles are reliable sources of how the software under test must operate. In particular, they are used to evaluate the actual results that produced by the software. However, in order to generate an automated test oracle, oracle challenges need to be addressed. These challenges are output-domain generation, input domain to output domain mapping, and a comparator to decide on the accuracy of the actual outputs.

Objective

This paper proposes an automated test oracle framework to address all of these challenges.

Method

I/O Relationship Analysis is used to generate the output domain automatically and Multi-Networks Oracles based on artificial neural networks are introduced to handle the second challenge. The last challenge is addressed using an automated comparator that adjusts the oracle precision by defining the comparison tolerance. The proposed approach was evaluated using an industry strength case study, which was injected with some faults. The quality of the proposed oracle was measured by assessing its accuracy, precision, misclassification error and practicality. Mutation testing was considered to provide the evaluation framework by implementing two different versions of the case study: a Golden Version and a Mutated Version. Furthermore, a comparative study between the existing automated oracles and the proposed one is provided based on which challenges they can automate.

Results

Results indicate that the proposed approach automated the oracle generation process 97% in this experiment. Accuracy of the proposed oracle was up to 98.26%, and the oracle detected up to 97.7% of the injected faults.

Conclusion

Consequently, the results of the study highlight the practicality of the proposed oracle in addition to the automation it offers.