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

Modeling Erlang's Ideal Grading with Multirate BPP Traffic

MATHEMATICAL PROBLEMS IN ENGINEERING 2012年第1期2012卷 1-35页

作者： Glabowski, Mariusz Hanczewski, Slawomir Stasiak, Maciej Weissenberg, Joanna Poznan Univ Tech Chair Commun & Comp Networks PL-60965 Poznan Poland

This paper presents a complete methodology for modeling gradings (also called non-full-availability groups) servicing single-service and multi-service traffic streams. The methodology worked out by the authors makes it possible to determine traffic characteristics of various types of gradings with state-dependent call arrival processes, including a new proposed structure of the Erlang's Ideal Grading with the multirate links. The elaborated models of the gradings can be used for modeling different systems of modern networks, for example, the radio interfaces of the UMTS system, switching networks carrying a mixture of different multirate traffic streams, and video-on-demand systems. The results of the analytical calculations are compared with the results of the simulation data for selected gradings, which confirm high accuracy of the proposed methodology.

关键词： ERLANG (Computer program language) declarative programming languages programming languages (Electronic computers) VIDEO on demand MOBILE communication systems

来源：评论

学校读者我要写书评

暂无评论

declarative Networking

引用

COMMUNICATIONS OF THE ACM 2009年第11期52卷 87-95页

作者： Loo, Boon Thau Condie, Tyson Garofalakis, Minos Gay, David E. Hellerstein, Joseph M. Maniatis, Petros Ramakrishnan, Raghu Roscoe, Timothy Stoica, Ion Univ Penn Philadelphia PA 19104 USA Univ Calif Berkeley Berkeley CA 94720 USA Tech Univ Crete Khania Greece Intel Res Berkeley CA USA Yahoo Res Silicon Valley CA USA Swiss Fed Inst Technol Zurich Switzerland

declarative Networking is a programming methodology that enables developers to concisely specify network protocols and services, which are directly compiled to a dataflow framework that executes the specifications. This paper provides an introduction to basic issues in declarative networking, including language design, optimization, and dataflow execution. We present the intuition behind declarative programming of networks, including roots in Datalog, extensions for networked environments, and the semantics of long-running queries over network state. We focus on a sublanguage we call Network Datalog (NDlog), including execution strategies that provide crisp eventual consistency semantics with significant flexibility in execution. We also describe a more general language called Overlog, which makes some compromises between expressive richness and semantic guarantees. We provide an overview of declarative network protocols, with a focus on routing protocols and overlay networks. Finally, we highlight related work in declarative networking, and new declarative approaches to related problems.

关键词： declarative programming languages declarative programming COMPUTER programming COMPUTER network protocols COMPUTER networks SEMANTICS -- Network analysis

来源：评论

学校读者我要写书评

暂无评论

Incremental awareness and compositionality: A design philosophy for context-aware pervasive systems

引用

PERVASIVE AND MOBILE COMPUTING 2010年第2期6卷 239-253页

作者： Loke, Seng W. La Trobe Univ Dept Comp Sci & Comp Engn Bundoora Vic 3086 Australia

Context-aware pervasive systems are an important emerging category of software, increasingly pervading into daily life, play and work. These systems are characterized by capabilities for sensing the physical world and taking action, autonomously or in cooperation with users. This paper proposes an incremental approach to building context-aware pervasive systems, with a particular emphasis on systematically extending over time the contexts and situations a system can be aware of, and creating a formalism in which these systems can be composed. We present a formalism of operators for building context-aware pervasive systems incrementally and in a compositional manner (by combining multiple systems and subsystems), facilitating reuse in a formal way. The formalism can serve as: (i) a basis for a scripting language for programming composite systems, and (ii) a language for specifying these systems (whether existing or to be built) and then reasoning with specifications of these systems. (C) 2009 Elsevier B.V. All rights reserved.

关键词： Context-aware computing Incremental awareness Composition Software engineering declarative programming languages

来源：评论

学校读者我要写书评

暂无评论

Linear, bounded, functional pretty-printing

引用

JOURNAL OF FUNCTIONAL programming 2009年第1期19卷 1-16页

作者： Swierstra, S. Doaitse Chitil, Olaf Univ Utrecht NL-3508 TC Utrecht Netherlands Univ Kent Canterbury CT2 7NZ Kent England

We present two implementations of Oppen's pretty-printing algorithm in Haskell that meet the efficiency of Oppen's imperative Solution but have a simpler and a clear structure. We start with an implementation that uses lazy evaluation to simulate two co-operating processes. Then we present an implementation that uses higher-order functions for delimited continuations to simulate co-routines with explicit scheduling.

关键词： HASKELL (Computer program language) declarative programming languages ALGORITHMS FUNCTIONAL programming languages COMPUTER programming

来源：评论

学校读者我要写书评

暂无评论

Typed quote/antiquote or: Compile-time parsing

引用

JOURNAL OF FUNCTIONAL programming 2011年第3期21卷 219-234页

作者： Hinze, Ralf Univ Oxford Dept Comp Sci Oxford OX1 3QD England

Haskell (Peyton Jones, 2003) is often used as a host language for embedding other languages. Typically, the abstract syntax of the guest language is defined by a collection of datatype declarations; parsers and pretty-printers convert between the concrete syntax and its abstract representation. A quote/antiquote mechanism permits a tighter integration of the guest language into the host language by allowing one to use phrases in the guest language's concrete syntax. [ABSTRACT FROM AUTHOR]

关键词： HASKELL (Computer program language) PARSING (Computer grammar) programming languages (Electronic computers) -- Syntax COMPILERS (Computer programs) declarative programming languages FUNCTIONAL programming languages COMPUTER science

来源：评论

学校读者我要写书评

暂无评论

Erlang for Concurrent programming

引用

COMMUNICATIONS OF THE ACM 2009年第3期52卷 48-56页

作者： Larson, Jim Google Mountain View CA 94043 USA Amazon Com Amazon SimpleDB Web Serv Seattle WA 98144 USA

The article discusses the use of the Erlang computer programming language. Erlang, a general-purpose concurrent programming language and runtime system, can be a valuable tool in solving concurrent problems, the article states. It was developed in the 1980s by the Swedish telecommunications company Ericsson for managing phone switches. Other topics include Erlang's minimal set of concurrency primitives, its natural fit in distributed Internet server applications, and its use in graphical user interfaces and ordinary batch applications.

关键词： ERLANG (Computer program language) USER interfaces (Computer systems) GRAPHICAL user interfaces (Computer systems) COMPUTER science COMPUTER software declarative programming languages

来源：评论

学校读者我要写书评

暂无评论

RELATING THE IMPLEMENTATION TECHNIQUES OF FUNCTIONAL AND FUNCTIONAL LOGIC languages

引用

NEW GENERATION COMPUTING 1993年第2期11卷 179-215页

作者： LOOGEN, R 1. Lehrstuhl für Informatik II RWTH Aachen Ahornstra?e 55 W-5100 Aachen Germany

Functional logic languages are declarative programming languages that integrate the programming paradigms of functional and logic languages within a single framework. They are extensions of functional languages with principles derived from logic programming. Narrowing, the evaluation mechanism of functional logic languages, can be defined as a generalization of reduction, the evaluation mechanism of purely functional languages. The unidirectional pattern matching, which is used for parameter passing in functional languages, is simply replaced by the bidirectional unification known from logic programming languages. We show in this paper, how to extend a reduction machine, that has been designed for the evaluation of purely functional programs to a machine that performs narrowing. The necessary extensions concern the realization of unification and backtracking, for which we fall back upon the methods of Warren's Prolog engine.21) The narrowing machine embodies an optimized treatment of deterministic computations. A complete specification of the reduction and the narrowing machine and of the translation of a sample language into abstract machine code is given. Comparative results of a C-implementation of the reduction and the narrowing machine show that the time overhead of the more complex narrowing evaluation is, in general, less than 10% of the reduction evaluation.

关键词： declarative programming languages NARROWING AND REDUCTION IMPLEMENTATION TECHNIQUES ABSTRACT MACHINES FORMAL SPECIFICATION

来源：评论

学校读者我要写书评

暂无评论

declarative simulation of dynamicals systems: the 8 1/2 programming language and its application to the simulation of genetic networks

引用

BIOSYSTEMS 2003年第2-3期68卷 155-170页

作者： Giavitto, JL Michel, O Delaplace, F Univ Evry Val dEssone CNRS LaMI UMR 8042 F-91025 Evry France

A major part of biological processes can be modeled as dynamical systems (DS), that is, as a time-varying state. In this article, we advocate a declarative approach for prototyping the simulation of DS. We introduce the concepts of collection, stream and fabric. A fabric is a multi-dimensional object that represents the successive values of a structured set of variables. A declarative programming language, called 8(1)/(2) has been developed to support the concept of fabrics. Several examples of working 8(1)/(2) programs are given to illustrate the relevance of the fabric data structure for simulation applications and to show how recursive fabric definitions can be easily used to model various biological phenomena in a natural way (a resolution of PDE, a simulation in artificial life, the Turing diffusion-reaction process and various examples of genetic networks). In the conclusion, we recapitulate several lessons we have learned from the 8(1)/(2) project. (C) 2002 Elsevier Science Ireland Ltd. All rights reserved.

关键词： declarative programming languages simulation of dynamical systems biological processes stream collection

来源：评论

学校读者我要写书评

暂无评论

AN ARCHITECTURE TO ASSIST MULTIMEDIA APPLICATION AUTHORS AND PRESENTATION ENGINE DEVELOPERS

AN ARCHITECTURE TO ASSIST MULTIMEDIA APPLICATION AUTHORS AND...

引用

IEEE International Conference on Multimedia & Expo (ICME)

作者： Santos, Rodrigo C. M. Moreno, Marcio F. Soares, Luiz Fernando G. Pontifical Catholic Univ Rio de Janeiro PUC Rio Rua Marques Sao Vicente 225 BR-22453900 Rio De Janeiro RJ Brazil

ISBN: (纸本)9781479970827

This paper presents an architecture for monitoring the presentation of multimedia declarative applications, providing feedback about variables states, object properties, media presentation times, among others. Monitoring tools that follow the proposed architecture are able to detect if visual problems are being caused by programming errors or by player malfunctioning. The architecture presents a communication protocol designed to be independent of the declarative language used in the development of multimedia applications. The main goal is to provide an open and generic architecture that can assist multimedia application authors and presentation engine developers. As an example of the architecture use, the paper also presents a monitoring tool integrated into a graphical user interface developed for the ITU-T reference implementation of the Ginga-NCL middleware.

关键词： Multimedia authoring debugging tools declarative programming languages presentation engines Ginga-NCL

来源：评论

学校读者我要写书评

暂无评论

FreeCHR: An Algebraic Framework for CHR-Embeddings 7th

FreeCHR: An Algebraic Framework for CHR-Embeddings

引用

7th International Joint Conference on Rules and Reasoning (RuleML+RR)

作者： Rechenberger, Sascha Fruehwirth, Thom Ulm Univ Inst Software Engn & Programming Languages Albert Einstein Allee 11 D-89069 Ulm Germany

ISBN: (纸本)9783031450716;9783031450723

We introduce the framework FreeCHR which formalizes the embedding of Constraint Handling Rules (CHR) into a host language, using the concept of initial algebra semantics from category theory, to establish a high-level implementation scheme for CHR as well as a common formalization for both theory and practice. We propose a lifting of the syntax of CHR via an endofunctor in the category Set and a lifting of the very abstract operational semantics of CHR into FreeCHR, using the free algebra, generated by the endofunctor and give proofs for soundness and completeness w.r.t. their original definition.

关键词： embedded domain-specific languages declarative programming languages constraint handling rules operational semantics category theory initial algebra semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：