检索结果-内蒙古大学图书馆

EMERALD - A GENERAL-PURPOSE PROGRAMMING LANGUAGE

SOFTWARE-PRACTICE & EXPERIENCE 1991年第1期21卷 91-118页

作者： RAJ, RK TEMPERO, E LEVY, HM BLACK, AP HUTCHINSON, NC JUL, E DIGITAL EQUIPMENT CORP CAMBRIDGE RES LABCAMBRIDGEMA 02139 UNIV ARIZONA DEPT COMP SCITUCSONAZ 85721 UNIV COPENHAGEN DIKUDK-2100 COPENHAGENDENMARK

Emerald is a general-purpose language with aspects of traditional object-oriented languages, such as Smalltalk, and abstract data type languages, such as Modula-2 and Ada. It is strongly typed with a nontraditional object model and type system that emphasize abstract types, allow separation of typing and implementation, and provide the flexibility of polymorphism and subtyping with compile-time checking. This paper describes the Emerald language and its programming methodology. We give examples that demonstrate Emerald's features, and compare and contrast the Emerald approach to programming with the approaches used in other similar languages.

关键词： PROGRAMMING LANGUAGES PROGRAMMING METHODOLOGY OBJECT-ORIENTED PROGRAMMING abstract data types INHERITANCE OBJECT-BASED CONCURRENCY

来源：评论

学校读者我要写书评

暂无评论

ALGORITHM-ORIENTED GENERIC LIBRARIES

引用

SOFTWARE-PRACTICE & EXPERIENCE 1994年第7期24卷 623-642页

作者： MUSSER, DR STEPANOV, AA HEWLETT PACKARD CORP SOFTWARE TECHNOL LABPALO ALTOCA 94303

We outline an approach to construction of software libraries in which generic algorithms (algorithmic abstractions) play a more central role than in conventional software library technology or in the object-oriented programming paradigm. Our approach is to consider algorithms first, decide what types and access operations they need for efficient execution, and regard the types and operations as formal parameters that can be instantiated in many different ways, as long as the actual parameters satisfy the assumptions on which the correctness and efficiency of the algorithms are based. The means by which instantiation is carried out is language dependent;in the C++ examples in this paper, we instantiate generic algorithms by constructing classes that define the needed types and access operations. By use of such compile-time techniques and careful attention to algorithmic issues, it is possible to construct software components of broad utility with no sacrifice of efficiency.

关键词： GENERIC ALGORITHMS ALGORITHMIC abstractIONS SOFTWARE LIBRARIES abstract data types C++ TEMPLATES

来源：评论

学校读者我要写书评

暂无评论

PSA Response to Neoadjuvant Androgen Deprivation Therapy Is a Strong Independent Predictor of Survival in High-Risk Prostate Cancer in the Dose-Escalated Radiation Therapy Era

引用

INTERNATIONAL JOURNAL OF RADIATION ONCOLOGY BIOLOGY PHYSICS 2013年第1期85卷 E39-E46页

作者： McGuire, Sean E. Lee, Andrew K. Cerne, Jasmina Z. Munsell, Mark F. Levy, Lawrence B. Kudchadker, Rajat J. Choi, Seungtaek L. Nguyen, Quynh N. Hoffman, Karen E. Pugh, Thomas J. Frank, Steven J. Corn, Paul G. Logothetis, Christopher J. Kuban, Deborah A. Univ Texas MD Anderson Canc Ctr Dept Radiat Oncol Houston TX 77030 USA Baylor Coll Med Dept Mol & Cellular Biol Houston TX 77030 USA Univ Texas MD Anderson Canc Ctr Dept Biostat Houston TX 77030 USA Univ Texas MD Anderson Canc Ctr Dept Radiat Phys Houston TX 77030 USA Univ Texas MD Anderson Canc Ctr Dept Genitourinary Med Oncol Houston TX 77030 USA

Purpose: The aim of the study was to evaluate the prognostic value of prostate-specific antigen (PSA) response to neoadjuvant androgen deprivation therapy (ADT) prior to dose-escalated radiation therapy (RT) and long-term ADT in high-risk prostate cancer. Methods and Materials: We reviewed the charts of all patients diagnosed with high-risk prostate cancer and treated with a combination of long-term ADT (median, 24 months) and dose-escalated (median, 75.6 Gy) RT between 1990 and 2007. The associations among patient, tumor, and treatment characteristics with biochemical response to neoadjuvant ADT and their effects on failure-free survival (FFS), time to distant metastasis (TDM), prostate cancer-specific mortality (PCSM) and overall survival (OS) were examined. Results: A total of 196 patients met criteria for inclusion. Median follow-up time for patients alive at last contact was 7.0 years (range, 0.5-18.1 years). Multivariate analysis identified the pre-RT PSA concentration (<0.5 vs >= 0.5 ng/mL) as a significant independent predictor of FFS (P=.021), TDM (P=.009), PCSM (P=.039), and OS (P=.037). On multivariate analysis, pretreatment PSA (iPSA) and African-American race were significantly associated with failure to achieve a pre-RT PSA of <0.5 ng/mL. Conclusions: For high-risk prostate cancer patients treated with long-term ADT and dose-escalated RT, a pre-RT PSA level >= 0.5 ng/mL after neoadjuvant ADT predicts for worse survival measures. Both elevated iPSA and African-American race are associated with increased risk of having a pre-RT PSA level >= 0.5 ng/mL. These patients should be considered for clinical trials that test newer, more potent androgen-depleting therapies such as abiraterone and MDV3100 in combination with radiation. (C) 2013 Elsevier Inc.

关键词： abstract data types Prostate Cancer Radiotherapy Survival androgen deprivation therapy Neoadjuvant Therapy

来源：评论

学校读者我要写书评

暂无评论

CPS-translation as adjoint

引用

THEORETICAL COMPUTER SCIENCE 2010年第2期411卷 324-340页

作者： Fujita, Ken-etsu Gunma Univ Dept Comp Sci Kiryu Gunma 376 Japan

We show that there exist translations between polymorphic lambda-calculus and a subsystem of minimal logic with existential types, which form a Galois insertion (embedding). The translation from polymorphic lambda-calculus into the existential type system is the so-called call-by-name CPS-translation that can be expounded as an adjoint from the neat connection. The construction of an inverse translation is investigated from it viewpoint of residuated mappings. The duality appears not only in the reduction relations but also in the proof structures, such as paths between the source and the target calculi. From a programming point of view, this result means that abstract data types can interpret polymorphic functions under the CPS-translation. We may regard abstract data types as a dual notion of polymorphic functions. (C) 2009 Elsevier B.V. All rights reserved.

关键词： Galois connection CPS-translation Polymorphic functions abstract data types Proof duality

来源：评论

学校读者我要写书评

暂无评论

A PREDICATIVE BASIS FOR STRUCTURED ANALYSIS SPECIFICATION TOOLS

引用

INFORMATION AND SOFTWARE TECHNOLOGY 1993年第2期35卷 67-77页

作者： FRANCE, RB Florida Atlantic Univ Boca Raton United States

A specification framework for supplementing Structured Analysis (SA) process and data specification tools with predicative specifications is described. The framework includes composition operators, which a specifier can use to build specifications of large structures from specifications of their substructures, and is supported by consistency notions which support internal consistency checks and semantic decomposition of process models.

关键词： abstract data types data FLOW DIAGRAMS FORMAL SPECIFICATIONS RIGOROUS CONSISTENCY VERIFICATION SEMANTIC DECOMPOSITION STRUCTURED ANALYSIS

来源：评论

学校读者我要写书评

暂无评论

ANALYSIS AND REPRESENTATION OF TEST CASES GENERATED FROM LOTOS

引用

COMPUTER COMMUNICATIONS 1995年第7期18卷 493-506页

作者： TRIPATHY, P SARIKAYA, B BELL NO RES LTD OTTAWAON K1Y 4H7CANADA BILKENT UNIV DEPT COMP & INFORMAT SCIANKARA 06533TURKEY

This paper presents a method to generate, analyse and represent test cases from protocol specification. The language of temporal ordering specification (LOTOS) is mapped into an extended finite state machine (EFSM). Test cases are generated from EFSM. The generated test cases are modelled as a dependence graph. Predicate slices are used to identify infeasible test cases that must be eliminated. Redundant assignments and predicates in all the feasible test cases are removed by reducing the test case dependence graph. The reduced test case dependence graph is adapted for a local single-layer (LS) architecture. The reduced test cases for the LS architecture are enhanced to represent the tester's behaviour. The dynamic behaviour of the test cases is represented in the form of control graphs by inverting the events, assigning verdicts to the events in the enhanced dependence graph.

关键词： abstract data types CONFORMANCE TESTING DEPENDENCE GRAPH LOTOS PROGRAM SLICE

来源：评论

学校读者我要写书评

暂无评论

A relational realizability model for higher-order stateful ADTs

引用

JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING 2012年第4期81卷 491-521页

作者： Birkedal, Lars Stovring, Kristian Thamsborg, Jacob IT Univ Copenhagen DK-2300 Copenhagen S Denmark

We present a realizability model for reasoning about contextual equivalence of higher-order programs with impredicative polymorphism, recursive types, and higher-order mutable state. The model combines the virtues of two recent earlier models: (1) Ahmed. Dreyer, and Rossberg's step-indexed logical relations model, which was designed to facilitate proofs of representation independence for "state-dependent" ADTs and (2) Birkedal, Stovring, and Thamsborg's realizability logical relations model, which was designed to facilitate abstract proofs without tedious step-index arithmetic. The resulting model can be used to give abstract proofs of representation independence for "state-dependent" ADTs. (C) 2012 Elsevier Inc. All rights reserved.

关键词： abstract data types Logical relations Local state Parametricity

来源：评论

学校读者我要写书评

暂无评论

Behavioral equivalence in the polymorphic pi-calculus

引用

JOURNAL OF THE ACM 2000年第3期47卷 531-584页

作者： Pierce, BC Sangiorgi, D Univ Penn Dept Comp & Informat Sci Philadelphia PA 19104 USA INRIA Sophia Antipolis F-06902 Sophia Antipolis France

We investigate parametric polymorphism in message-based concurrent programming, focusing on behavioral equivalences in a typed process calculus analogous to the polymorphic lambda-calculus of Girard and Reynolds. Polymorphism constrains the power of observers by preventing them from directly manipulating data values whose types are abstract, leading to notions of equivalence much coarser than the standard untyped ones. We study the nature of these constraints through simple examples of concurrent abstract data types and develop basic theoretical machinery for establishing bisimilarity of polymorphic processes. We also observe some surprising interactions between polymorphism and aliasing, drawing examples from both the polymorphic pi-calculus and ML.

关键词： abstract data types pi-calculus

来源：评论

学校读者我要写书评

暂无评论

APPLICATION INTEGRATION - CONSTRUCTING COMPOSITE APPLICATIONS FROM INTERACTIVE COMPONENTS

引用

SOFTWARE-PRACTICE & EXPERIENCE 1993年第3期23卷 255-275页

作者： COWAN, DD STEPIEN, TM IERUSALIMSCHY, R LUCENA, CJP UNIV WATERLOO COMP SYST GRPWATERLOO N2L 3G1ONTARIOCANADA PONTIFICIA UNIV CATOLICA DEPT INFORMATBR-22453 RIO JANEIROBRAZIL

Creating new applications by integrating user interface and application components is a relatively new idea which is currently of wide interest. A significant part of this problem is dearly defining the separation between user interface and application components. This paper proposes a new design methodology based on the concept of an abstract data view (ADV), a structuring method which cleanly defines this separation. A number of examples of composite interactive documents, ones which could contain several different user interfaces with entities such as text, calculations, drawings and possibly even multi-media presentations, illustrate the ADV concept. These examples lead naturally to the introduction of the concept of hole, a user interface area in a composite interactive document which is managed by an external program, and uses ADVs. Prototypes of a number of systems supporting ADVs and holes are currently running in our laboratory.

关键词： abstract data types INTERACTIVE APPLICATIONS PROGRAMMING USER INTERFACES END-USER PROGRAMMING SCRIPT LANGUAGES

来源：评论

学校读者我要写书评

暂无评论

OBJECTS AND ACTIONS IN RELIABLE DISTRIBUTED SYSTEMS

引用

SOFTWARE ENGINEERING JOURNAL 1987年第5期2卷 160-168页

作者： SHRIVASTAVA, SK DIXON, GN PARRINGTON, GD UNIV NEWCASTLE UPON TYNE COMP LABNEWCASTLE TYNE NE1 7RUTYNE & WEARENGLAND

This paper describes a method for constructing robust distributed programs. The method is based upon the provision of atomic actions that operate uponobjects(instances of abstract data types). The paper begins by constructing robustnon-distributed programs using the atomicaction mechanism and then proceeds to showhow robust distributed programs can be constructed in a similar fashion. Finally, the paper briefly examines other prototy pedistributed systems and examines their approachto the reliability problem.

关键词： object based systems recovery block multiprocessing programs atomic action mechanism multivariable control systems Multivariable control systems robust distributed programs failure atomicity node crashes transmission failures objects nondistributed programs reliability problem software reliability data structures abstract data types communication system distributed systems File organisation Operating systems prototype distributed systems atomic actions

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：