JAVA语言的多态性及其应用研究

多态性增强了程序设计语言的表达能力.本文就JAVA语言支持的多态性作了全面的阐述和讨论,还重点分析了抽象类和接口的区别;在此基础上,结合例子说明了多态性在程序设计中的应用.     

JAVA语言的动态多态性其应用研究

多态性是面向对象的重要特性之一,Java中的多态体现在类的继承和实现接口等方面.本文就JAVA语言支持的多态性作了深入全面的探讨,在此基础上,结合例子说明了多态性在程序设计中的应用.     

C++面向对象程序设计中的多态性研究

多态性增强了程序设计语言的表达能力。文章分析了C++多态性的形式和特征,结合例子说明了多态性在程序设计中的应用。     

基于JAVA语言的多态性探讨

多态性是面向对象的重要特性之一。本文就JAVA语言支持的多态性作了深入全面的探讨,还特别提出了抽象类和接口的本质区别;在此基础上,结合例子说明了多态性在程序设计中的应用。     

C#语言中的抽象类与接口的研究及应用

抽象类和接口是C#语言中两个重要的对象引用类型,是C#程序设计使用多态性的基础.本文对两者进行比较,并通过例子说明了抽象类和接口的区别和使用场合.     

面向对象程序设计语言C++中的多态性

面向对象程序设计语言Ｃ＋＋中多态性的形式、特征及其在程序设计中的应用。     

面向对象程序设计中的多态性研究

本文分析了多态性的分类和特征,结合Ｃ＋＋语言对多态性的实现方式与高级技术作了较详细的阐述。最后,给出了多态性在程序设计中的应用。     

完备地实现C＋＋多态性

多态性是C＋＋的一个重要特性。程序员可以通过使用C＋＋的多态性来编写灵活多样的程序,但是由于多态性比较复杂,程序中可能会隐藏一些漏洞。为了避免产生这些漏洞,MISRAC＋＋推荐了一些编程规则。     

C++语言的多态性应用研究

动态多态性提高了代码的可重用性和程序执行时的灵活性.本文详细讨了C＋＋语言对动态多态的支持机制,并结合例子说明了动态多态在程序设计中的应用.     

JAVA语言的动态多态性其应用研究

多态性是面向对象的重要特性之一,Java中的多态体现在类的继承和实现接口等方面。本文就JAVA语言支持的多态性作了深入全面的探讨,在此基础上,结合例子说明了多态性在程序设计中的应用。     

Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem

This paper answers two fundamental questions concerning the usage of the shifting bottleneck (SB) procedure to optimize the criterion total weighted tardiness for the classical job shop scheduling problem. The first question is how to configure the SB procedure, as it is a divide-and-conquer method and consists of diverse subsolutions for each procedure phase. The second question is what the advantages of the SB procedure are, in comparison with other state-of-the-art approaches. To answer the first question, we evaluate the performance (i.e. the scheduling quality) and the efficiency (i.e. the computational time) of various SB variants using computational experiments and present guidelines for configuring the SB procedure. To respond to the second question, extensive computational experiments were conducted on various benchmark instances (up to 100 jobs \(\times \) 20 machines). Results show the superior performance/efficiency trade-off of the SB variants with certain configuration to local search methods. This excellent trade-off between performance and efficiency makes the SB procedure particularly promising for solving practical production scheduling problems.     

Using Resolution for Testing Modal Satisfiability and Building Models

This paper presents a translation-based resolution decision procedure for the multimodal logic K _(m)(,,) defined over families of relations closed under intersection, union, and converse. The relations may satisfy certain additional frame properties. Different from previous resolution decision procedures that are based on ordering refinements, our procedure is based on a selection refinement, the derivations of which correspond to derivations of tableaux or sequent proof systems. This procedure has the advantage that it can be used both as a satisfiability checker and as a model builder. We show that tableaux and sequent-style proof systems can be polynomially simulated with our procedure. Furthermore, the finite model property follows for a number of extended modal logics.     

Determination of the growth strain of LPCVD polysilicon

This work presents a semi-empirical procedure for determining the through-the-thickness variation of the eigenstrain (eigenstrain is a generic term for any inelastic strain, including plastic strain, free thermal expansion, phase transformation, etc.) that develops during the growth of thin polysilicon films formed using low-pressure chemical vapor deposition (LPCVD). This variation is assumed to depend on the polysilicon microstructure and deposition conditions, but not on the characteristics of the (single crystal silicon) substrate. The procedure involves the use of an elastic laminated plate model to determine the eigenstrain distribution that predicts the experimentally measured substrate curvatures. In comparison to the "shaving method" presented by A.Ni et al., which relies on incremental etching of a single specimen, an alternative experimental procedure is followed to measure the substrate curvatures of a series of different thickness films. While being significantly more time-consuming, the alternative procedure was expected to lead to improved predictions of the eigenstrain distribution, as it avoids the nonuniform film thicknesses produced by the etching procedure. However, a comparison of the curvature histories measured using the two approaches demonstrates that, as long as sufficiently small increments are used in the shaving method, then the improvement is insignificant. This suggests that the plasma etching does not alter the polysilicon's intrinsic growth strain, and that the etch rate nonuniformities across the substrate are small. The eigenstrain distributions could be used, in conjunction with structural mechanics models, to design multilayered polysilicon devices with prescribed curvatures.     

Java中构建插件兼容对象

本文通过实例介绍Java中构建插件兼容对象的方法,提出将"黑盒"操作与面向对象的多态性结合起来有助于分析、计划和编写程序代码。     

Inferring specifications to detect errors in code

A new technique is presented to statically check a given procedure against a user-provided property. The method requires no annotations; it automatically infers a context-dependent specification for each procedure call, so that only as much information about a procedure is used as is needed to analyze its caller. Specifications are inferred iteratively. Empty specifications are initially used to over-approximate the effects of all procedure calls; these are later refined in response to spurious counterexamples. When the analysis terminates, any remaining counterexample is guaranteed to be valid. However, since the heap is finitized, the absence of a counterexample does not guarantee the validity of the given property in general.

Interactive Design Using the Example of a Complex Medical Application

Applications in the field of capital goods make specific requirements in terms of efficiency, fault tolerance, and verifiability-and therefore of the overall quality of use. Visual design-regarded as something derived logically from the functional stipulations and not just as an accessory to be applied later-contributes to this.

The link between functional requirement and formal design will be illustrated by using Syngo, which is a software platform for controlling the image-transmitting procedure in radiology.

In the context of the annual competition "Industrieforum Design Hannover" (Industrial Design Forum Hanover), Syngo was awarded the special "Best of Category" prize at the "Interaction Design Award 2000" (see Color Plate 11, Figures 1 and 2).     

Data-driven neighborhood selection of a Gaussian field

The nonparametric covariance estimation of a stationary Gaussian field X observed on a lattice is investigated. To tackle this issue, a neighborhood selection procedure has been recently introduced. This procedure amounts to selecting a neighborhood by a penalization method and estimating the covariance of X in the space of Gaussian Markov random fields (GMRFs) with neighborhood . Such a strategy is shown to satisfy oracle inequalities as well as minimax adaptive properties. However, it suffers several drawbacks which make the method difficult to apply in practice: the penalty depends on some unknown quantities and the procedure is only defined for toroidal lattices. The contribution is threefold. Firstly, a data-driven algorithm is proposed for tuning the penalty function. Secondly, the procedure is extended to non-toroidal lattices. Thirdly, numerical study illustrates the performances of the method on simulated examples. These simulations suggest that Gaussian Markov random field selection is often a good alternative to variogram estimation.     

Interactions Between PVS and Maple in Symbolic Analysis of Control Systems

This paper presents a decision procedure for problems relating polynomial and transcendental functions. The procedure applies to functions that are continuously differentiable with a finite number of points of inflection in a closed convex set. It decides questions of the form ‘is f0?’, where {=,>,<}. An implementation of the procedure in Maple and PVS exploits the existing Maple, PVS and QEPCAD connections. It is at present limited to those twice differentiable functions whose derivatives are rational functions (rationally differentiable). This procedure is particularly applicable to the analysis of control systems in determining important properties such as stability.     

Improving type error messages for generic Java

Since version 1.5, generics (parametric polymorphism) are part of the Java language. However, the combination of parametric polymorphism and inclusion polymorphism is complicated, particularly so for Generic Java. Indeed, the main Java compilers, Eclipse??s ejc and Sun??s javac, do not even accept the same set of programs. Moreover, experience with these compilers shows that the error messages provided by them leave more than a little to be desired. To alleviate the latter problem, we describe how to adapt the type inference process of Java to obtain better error diagnostics for generic method invocations. Although the extension by itself already helps to improve type error messages to some extent, another major advantage of the new type inference process is that it also paves the way for further heuristics can provide additional diagnostic information. The extension has been implemented into the JastAdd Extensible Java Compiler.     

A proof procedure for the logic of hereditary Harrop formulas

A proof procedure is presented for a class of formulas in intuitionistic logic. These formulas are the so-calledgoal formulas in the theory of hereditary Harrop formulas. Proof search in intuitionistic logic is complicated by the nonexistence of a Herbrand-like theorem for this logic: formulas cannot in general be preprocessed into a form such as the clausal form, and the construction of a proof is often sensitive to the order in which the connectives and quantifiers are analyzed. An interesting aspect of the formulas we consider here is that this analysis can be carried out in a relatively controlled manner in their context. In particular, the task of finding a proof can be reduced to one of demonstrating that a formula follows from a set of assumptions, with the next step in this process being determined by the structure of the conclusion formula. An acceptable implementation of this observation must utilize unification. However, since our formulas may contain universal and existential quantifiers in mixed order, care must be exercised to ensure the correctness of unification. One way of realizing this requirement involves labelling constants and variables and then using these labels to constrain unification. This form of unification is presented and used in a proof procedure for goal formulas in a first-order version of hereditary Harrop formulas. Modifications to this procedure for the relevant formulas in a higher-order logic are also described. The proof procedure that we present has a practical value in that it provides the basis for an implementation of the logic programming language Prolog.