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

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2018年第11期E101D卷 2710-2719页

作者： Mohammadpur, Davud Mahjur, Ali Malek Ashtar Univ Technol Dept Informat & Commun Technol ICT Tehran Iran

Efficiency and flexibility of collections have a significant impact on the overall performance of applications. The current approaches to implement collections have two main drawbacks: (i) they limit the efficiency of collections and (ii) they have not adequate support for collection composition. So, when the efficiency and flexibility of collections is important, the programmer needs to implement them himself, which leads to the loss of reusability. This article presents neoCollection, a novel approach to encapsulate collections. neoCollection has several distinguishing features: (i) it can be applied on data elements efficiently and flexibly (ii) composition of collections can be made efficiently and flexibly, a feature that does not exist in the current approaches. In order to demonstrate its effectiveness, neoCollection is implemented as an extension to Java and C++.

关键词： programming language high-level abstraction collections efficiency collections composition collections reusability

来源：评论

学校读者我要写书评

暂无评论

THE FORMAL DEFINITION OF A REAL-TIME language

引用

ACTA INFORMATICA 1981年第3期16卷 309-345页

作者： HENNESSY, JL KIEBURTZ, RB STANFORD UNIV COMP SYST LABSTANFORDCA 94305 SUNY STONY BROOK STONY BROOKNY 11746

This paper presents the formal definition of TOMAL (Task-Oriented Microprocessor Applications language), a programming language intended for real-time systems running on small processors. The formal definition addresses all aspects of the language. Because some modes of semantic definition seem particularly well-suited to certain aspects of a language, and not as suitable for others, the formal definition employs several complementary modes of *** primary definition is axiomatic and is employed to define most statements of the language. Simple, denotational (but not lattice-theoretic) semantics complement the axiomatic semantics to define type-related features, such as binding of names to types, data type coercions, and evaluation of expressions. Together, the axiomatic and denotational semantics define all features of the sequential language. An operational definition is used to define real-time execution, and to extend the axiomatic definition to account for all aspects of concurrent execution. Semantic constraints, sufficient to guarantee conformity of a program with the axiomatic definition, can be checked by analysis of a TOMAL program at compilation.

关键词： programming language Data Type Formal Definition Operational Definition Denotational Semantic

来源：评论

学校读者我要写书评

暂无评论

FUNCTION ITERATION LOGICS AND FLOWCHART SCHEMATA

引用

COMPUTING 1975年第3期14卷 285-312页

作者： CHERNIAVSKY, J SUNY DEPT COMP SCI STONY BROOK NY 11790 USA

An interpreted two-sorted logic is defined to allow the representation of a subclass of flowchart schemata. A decision procedure for the equivalence of simple representing formulae within the logic is developed and as a consequence a decision procedure for flowchart schemata within the subclass is demonstrated. Applications of the techniques developed within the paper result in further decision procedures for the equivalence of flowchart schemata in other subclasses. In addition, a decision procedure for the equivalence of programs in a simple programming language is given.

关键词： Computational Mathematic programming language Decision Procedure Function Iteration Simple programming

来源：评论

学校读者我要写书评

暂无评论

A strand graph semantics for DNA-based computation

引用

THEORETICAL COMPUTER SCIENCE 2016年 632卷 43-73页

作者： Petersen, Rasmus L. Lakin, Matthew R. Phillips, Andrew Microsoft Res Cambridge England Univ New Mexico Dept Comp Sci Albuquerque NM 87131 USA

DNA nanotechnology is a promising approach for engineering computation at the nanoscale, with potential applications in biofabrication and intelligent nanomedicine. DNA strand displacement is a general strategy for implementing a broad range of nanoscale computations, including any computation that can be expressed as a chemical reaction network. Modelling and analysis of DNA strand displacement systems is an important part of the design process, prior to experimental realisation. As experimental techniques improve, it is important for modelling languages to keep pace with the complexity of structures that can be realised experimentally. In this paper we present a process calculus for modelling DNA strand displacement computations involving rich secondary structures, including DNA branches and loops. We prove that our calculus is also sufficiently expressive to model previous work on non-branching structures, and propose a mapping from our calculus to a canonical strand graph representation, in which vertices represent DNA strands, ordered sites represent domains, and edges between sites represent bonds between domains. We define interactions between strands by means of strand graph rewriting, and prove the correspondence between the process calculus and strand graph behaviours. Finally, we propose a mapping from strand graphs to an efficient implementation, which we use to perform modelling and simulation of DNA strand displacement systems with rich secondary structure. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Strand graph Site graph Process calculus programming language DNA computing Molecular programming Biological computation

来源：评论

学校读者我要写书评

暂无评论

Program entanglement, feature interaction and the feature language extensions

引用

COMPUTER NETWORKS 2007年第2期51卷 480-495页

作者： Leung, Wu-Hon F. IIT Dept Comp Sci Chicago IL 60616 USA

One of the most difficult tasks in software development is that the programmer must implement a feature going through a laborious and error prone process of modifying the programs of other features. The programs of the different features entangle in the same reusable program units of the prograrnming language, making them also difficult to be verified, maintained and reused. We show that if (C1) the features interact, (C2) they are executed by the same process and (C3) they are implemented in a programming language that requires the programmer to specify execution flows, program entanglement is inevitable and the problem cannot be solved by software design alone. Applications with interacting features are common including those that require exception handling. The feature language extensions (FLX) is a set of programming language constructs designed to enable the programmer to develop interacting features as separate and reusable program modules even though the features interact. The programmer uses FLX to specify non-procedural program units, organize the program units into reusable features and integrate features into executable feature packages. He develops a feature based on a model instead of the code of other features. FLX supports an automatic procedure to detect the interaction condition among features;the programmer then resolve the interaction in a feature package without changing feature code. FLX features and feature packages are reusable;the programmer may package different combinations of them and resolve their interactions differently to meet different user needs. An FLX to Java compiler has been implemented;our experience of using it has been very positive. (c) 2006 Elsevier B.V. All rights reserved.

关键词： feature interaction program entanglement programming language feature interaction resolution reusable programs exception handling inheritance

来源：评论

学校读者我要写书评

暂无评论

THE PEGASUS HETEROGENEOUS MULTIDATABASE SYSTEM

引用

COMPUTER 1991年第12期24卷 19-27页

作者： AHMED, R DESMEDT, P DU, WM KENT, W KETABCHI, MA LITWIN, WA RAFII, A SHAN, MC HEWLETT PACKARD CO PEGASUS PROJECTPALO ALTOCA UNIV PARIS 09 F-75016 PARISFRANCE HEWLETT PACKARD CO PERSEUS PROJECTPALO ALTOCA UNIV SANTA CLARA SCH ENGNSANTA CLARACA 95053

Pegasus, a heterogeneous multidatabase management system that responds to the need for effective access and management of shared data across in a wide range of applications, is described. Pegasus provides facilities for multidatabase applications to access and manipulate multipole autonomous heterogeneous distributed object-oriented relational, and other information systems through a uniform interface. It is a complete data management system that integrates various native and local databases. Pegasus takes advantage of object-oriented data modeling and programming capabilities. It uses both type and function abstractions to deal with mapping and integration problems. Function implementation can be defined in an underlying database language or a programming language. Data abstraction and encapsulation facilities in the Pegasus object model provide an extensible framework for dealing with various kinds of heterogeneities in the traditional database systems and nontraditional data sources

关键词： Pegasus heterogeneous multidatabase system database language distributed databases function abstractions management of shared data object-oriented data modeling object-oriented databases programming language

来源：评论

学校读者我要写书评

暂无评论

Programmers do not favor lambda expressions for concurrent object-oriented code

引用

EMPIRICAL SOFTWARE ENGINEERING 2019年第1期24卷 103-138页

作者： Nielebock, Sebastian Heumueller, Robert Ortmeier, Frank Otto von Guericke Univ Chair Software Engn Fac Comp Sci Magdeburg Germany

Lambda expressions have long been state-of-the-art in the functional programming paradigm. Especially with regard to the use of higher-order functions, they provide developers with a means of defining predicate or projection functions locally, which greatly increases the comprehensibility of the resulting source code. This benefit has motivated language designers to also incorporate lambda expressions into object-oriented (OO) programming languages. In particular, they are claimed to facilitate concurrent programming. One likely reason for this assumption is their purity: pure lambda expressions are free of side effects, and therefore cannot cause, e.g., race conditions. In this paper, we present the first empirical analysis of whether or not this claim is true for OO projects. For this purpose, we investigated the application of lambda expressions in 2923 open-source projects, implemented in one of the most common OO programming languages: C#, C++, and Java. We present three major findings. First, the majority of lambda expressions are not applied in concurrent code and most concurrent code does not make use of lambda expressions. Second, for all three of the languages, we observed that developers compromise their code by applying a significantly higher number of impure, capturing lambda expressions, which are capable of causing race conditions. Finally, we explored further use cases of lambda expressions and found out that testing, algorithmic implementation, and UI are far more common use-cases for the application of lambda expressions. Our results encourage to investigate in more detail the reasons that hinder programmers to apply lambda expressions in concurrent programming and to support developers, e.g., by providing automatic refactorings.

关键词： Lambda expression Concurrency Object-orientation programming language

来源：评论

学校读者我要写书评

暂无评论

Enhancing team collaboration through integrating social interactions in a Web-based development environment

引用

COMPUTER APPLICATIONS IN ENGINEERING EDUCATION 2016年第4期24卷 529-545页

作者： Vu Nguyen Hai Hoang Dang Nguyen-Kha Do Dan-Thu Tran VNU HCMC Univ Sci Ho Chi Minh Vietnam VNU HCMC Univ Sci Fac Informat Technol Ho Chi Minh Vietnam

This paper presents the design and evaluation of a Web-based collaborative learning environment called EduCo for learning and practicing team-based exercises in computer science and software engineering courses. EduCo's defining characteristic is integrating a number of services for software development activities, for example, project management, requirements engineering, design, and programming into integrated shared workspaces with social-networking facilities to enhance collaboration among students and instructors. We conducted a controlled experiment to evaluate the effectiveness of the system in doing a three-iteration programming project. A total of 126 second-year students who attended an object-oriented programming course participated in the experiment. The results show that while the system was not found to affect student programming performance, it improved student engagement and satisfaction when working in teams. These results imply that the system's shared workspaces and social-networking services have the potential to enhance learning outcomes of students working in teams when these features are integrated into collaborative learning environments. (c) 2016 Wiley Periodicals, Inc. Comput Appl Eng Educ 24:529-545, 2016;View this article online at;DOI

关键词： social network collaborative environment social environment programming language

来源：评论

学校读者我要写书评

暂无评论

OBJECT COMMAND-language - A FORMALISM TO BUILD MOLECULAR-MODELS AND TO ANALYZE STRUCTURAL PARAMETERS IN MACROMOLECULES, WITH APPLICATIONS TO NUCLEIC-ACIDS

引用

JOURNAL OF MOLECULAR GRAPHICS 1992年第3期10卷 166-&页

作者： GABARROARPA, J COGNET, JAH LEBRET, M Unité de Biochimie-Enzymologie Institut Gustave-Roussy (U140 INSERM URA147 CNRS) France.

We have written a programming language OCL (Object Command language) to solve, in a general way, two recurring problems that arise during the construction of molecular models and during the geometrical characterization of macromolecules: how to move precisely and reproducibly any part of a molecular model in any user-defined local reference axes;and how to calculate standard or user-defined structural parameters that characterize the complex geometries of any macromolecule. OCL endows the user with three main capabilities: the definition of subsets of the macromolecule, called objects in OCL, with a formalism from elementary set theory or lexical analysis;the definition of sequences of elementary geometrical operations, called procedures in OCL, enabling one to build arbitrary three-dimensional (3D) orthonormal reference frames, to be associated with previously defined objects;and the transmission of these definitions to programs that allow one to display, to modify and to analyze interactively the molecular structure, or to programs that perform energy minimizations or molecular dynamics. Several applications to nucleic acids are resented.

关键词： MOLECULAR MODEL BUILDING MACROMOLECULAR STRUCTURE PARAMETERS MOLECULAR GRAPHICS MOLECULAR MECHANICS programming language

来源：评论

学校读者我要写书评

暂无评论

L0 - A TRULY CONCURRENT EXECUTABLE TEMPORAL LOGIC language FOR PROTOCOLS

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1993年第4期19卷 410-423页

作者： NESS, L Bellcore Morristown NJ

L.0 is a programming language designed for the specification and simulation of protocols. The model of concurrency assumed in L.0 is a true concurrency model, rather than an interleaving semantics model. Thus, simultaneous occurrence of events may be easily specified in L.0. This paper gives the semantics of L.0 in terms of predicate linear temporal logic and defines the restricted universe of models assumed in L.0 programs. The execution algorithm for L.0 constructs a model in this universe. The restricted subset of temporal logic exploited permits a nonbacktracking execution algorithm. Fundamental to the semantics of L.0 is a frame assumption, which generalizes the frame assumption of standard imperative programming, and which eases specification of protocols. The data domain assumed in L.0 programs is sets of trees with labeled edges, and the state predicates permitted include existence and nonexistence predicates, as well as the more traditional assignment and equality predicates. These choices for data domain and predicates permit convenient specification of the hierarchical message structure often assumed in telecommunications protocols. For in such message structures, the existence or nonexistence of parts of the message hierarchy is determined by logical properties of the rest of the message hierarchy. The subject of the main example in the paper is a small portion of the Logical Layer Specification of Futurebus+.

关键词： CONCURRENCY FORMAL METHODS programming language PROTOCOLS SIMULATION SPECIFICATION TEMPORAL LOGIC

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：