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

37th Annual International conference of the IEEE-Engineering-in-Medicine-and-Biology-Society (EMBC)

作者： Sawlekar, Rucha Montefusco, Francesco Kulkarni, Vishwesh Bates, Declan G. Univ Warwick Ctr Integrat Synthet Biol Coventry CV4 7AL W Midlands England Univ Padua Dept Informat Engn I-35131 Padua Italy

ISBN: (纸本)9781424492701

A fundamental aim of synthetic biology is to achieve the capability to design and implement robust embedded biomolecular feedback control circuits. An approach to realize this objective is to use abstract chemical reaction networks (CRNs) as a programming language for the design of complex circuits and networks. Here, we employ this approach to facilitate the implementation of a class of nonlinear feedback controllers based on sliding mode control theory. We show how a set of two-step irreversible reactions with ultrasensitive response dynamics can provide a biomolecular implementation of a nonlinear quasi sliding mode (QSM) controller. We implement our controller in closed-loop with a prototype of a biological pathway and demonstrate that the nonlinear QSM controller outperforms a traditional linear controller by facilitating faster tracking response dynamics without introducing overshoots in the transient response.

关键词： CRNs Biomolecular implementation Quasi Sliding Mode Feedback Controller based

来源：评论

学校读者我要写书评

暂无评论

HACCLE: Metaprogramming for Secure Multi-Party Computation 2021

HACCLE: Metaprogramming for Secure Multi-Party Computation

引用

20th acm sigplan International conference on Generative programming: Concepts and Experiences (GPCE)

作者： Bao, Yuyan Sundararajah, Kirshanthan Malik, Raghav Ye, Qianchuan Wagner, Christopher Jaber, Nouraldin Wang, Fei Ameri, Mohammad Hassan Lu, Donghang Seto, Alexander Delaware, Benjamin Samanta, Roopsha Kate, Aniket Garman, Christina Blocki, Jeremiah Letourneau, Pierre-David Meister, Benoit Springer, Jonathan Rompf, Tiark Kulkarni, Milind Univ Waterloo Waterloo ON Canada Purdue Univ W Lafayette IN 47907 USA Reservoir Labs New York NY USA

ISBN: (纸本)9781450391122

Cryptographic techniques have the potential to enable distrusting parties to collaborate in fundamentally new ways, but their practical implementation poses numerous challenges. An important class of such cryptographic techniques is known as Secure Multi-Party Computation (MPC). Developing Secure MPC applications in realistic scenarios requires extensive knowledge spanning multiple areas of cryptography and systems. And while the steps to arrive at a solution for a particular application are often straightforward, it remains difficult to make the implementation efficient, and tedious to apply those same steps to a slightly different application from scratch. Hence, it is an important problem to design platforms for implementing Secure MPC applications with minimum effort and using techniques accessible to non-experts in cryptography. In this paper, we present the HACCLE (High Assurance Compositional Cryptography: languages and Environments) toolchain, specifically targeted to MPC applications. HACCLE contains an embedded domain-specific language Harpoon, for software developers without cryptographic expertise to write MPC-based programs, and uses Lightweight Modular Staging (LMS) for code generation. Harpoon programs are compiled into acyclic circuits represented in HACCLE's Intermediate Representation (HIR) that serves as an abstraction over different cryptographic protocols such as secret sharing, homomorphic encryption, or garbled circuits. implementations of different cryptographic protocols serve as different backends of our toolchain. the extensible design of HIR allows cryptographic experts to plug in new primitives and protocols to realize computation. And the use of standard metaprogramming techniques lowers the development effort significantly. We have implemented Harpoon and HACCLE, and used them to program interesting applications (e.g., secure auction) and key computation components of Secure MPC applications (e.g., matrix-vector multiplication and merg

关键词： metaprogramming domain-specific language secure multi-party computation

来源：评论

学校读者我要写书评

暂无评论

Secure Distributed programming with Value-Dependent Types 11

Secure Distributed Programming with Value-Dependent Types

引用

16th acm sigplan International conference on Functional programming (ICFP 11)

作者： Swamy, Nikhil Chen, Juan Fournet, Cedric Strub, Pierre-Yves Bhargavan, Karthikeyan Yang, Jean Microsoft Res Redmond WA 98052 USA

ISBN: (纸本)9781450308656

Distributed applications are difficult to program reliably and securely. Dependently typed functional languages promise to prevent broad classes of errors and vulnerabilities, and to enable program verification to proceed side-by-side with development. However, as recursion, effects, and rich libraries are added, using types to reason about programs, specifications, and proofs becomes challenging. We present F-star, a full-fledged design and implementation of a new dependently typed language for secure distributed programming. Unlike prior languages, F-star provides arbitrary recursion while maintaining a logically consistent core;it enables modular reasoning about state and other effects using affine types;and it supports proofs of refinement properties using a mixture of cryptographic evidence and logical proof terms. the key mechanism is a new kind system that tracks several sub-languages within F-star and controls their interaction. F-star subsumes two previous languages, F7 and Fine. We prove type soundness (with proofs mechanized in Coq) and logical consistency for F-star. We have implemented a compiler that translates F-star to NET bytecode, based on a prototype for Fine. F-star provides access to libraries for concurrency, networking, cryptography, and interoperability with C#, F#, and the other .NET languages. the compiler produces verifiable binaries with 60% code size overhead for proofs and types, as much as a 45x improvement over the Fine compiler, while still enabling efficient bytecode verification. To date, we have programmed and verified more than 20,000 lines of F-star including (1) new schemes for multi-party sessions;(2) a zero-knowledge privacy-preserving payment protocol;(3) a provenance-aware curated database;(4) a suite of 17 web-browser extensions verified for authorization properties;and (5) a cloud-hosted multi-tier web application with a verified reference monitor.

关键词： Security type systems refinement types

来源：评论

学校读者我要写书评

暂无评论

ContextErlang: Introducing context-oriented programming in the actor model 12

ContextErlang: Introducing context-oriented programming in t...

引用

11th Annual International conference on Aspect Oriented Software Development, AOSD'12

作者： Salvaneschi, Guido Ghezzi, Carlo Pradella, Matteo DEEPSE Group DEI Politecnico di Milano Piazza L. Da Vinci 32 Milano Italy

ISBN: (纸本)9781450310925

Self-adapting systems are becoming widespread in emerging fields such as autonomic, mobile and ubiquitous computing. Context-oriented programming (COP) is a promising language-level solution for the implementation of context-aware, self-adaptive software. However, current COP approaches struggle to effectively manage the asynchronous nature of context provisioning. We argue that, to solve these issues, COP features should be designed to fit nicely in the concurrency model supported by the language. this work presents the design rationale of CONTEXTERLANG, which introduces COP in the Actor Model. We provide evidence that CONTEXTERLANG constitutes a viable solution to implement context-aware software in a highly concurrent and distributed setting. We discuss a case study and an evaluation of run-time performance. © 2012 acm.

关键词： Ubiquitous computing

来源：评论

学校读者我要写书评

暂无评论

Extensible Polyglot programming Support in Existing Component Frameworks

Extensible Polyglot Programming Support in Existing Componen...

引用

Joint conference of 14th EUROMICRO Digital Systems design conference (DSD) / 37th EUROMICRO conference on Software Engineering and Advanced Applications (SEAA)

作者： Keznikl, Jaroslav Malohlava, Michal Bures, Tomas Hnetynka, Petr Charles Univ Prague Fac Math & Phys Malostranske Namesti 25 CR-11800 Prague 1 Czech Republic Acad Sci Czech Republ Inst Comp Sci Prague 18207 Czech Republic

ISBN: (纸本)9780769544885

Utilization of various agile development practices brings demand of short development cycle with stress on early deployment and rapid delivery. Such practices require techniques permitting rapid prototyping of systems, corresponding tests and simulations. One of the well-adopted rapid prototyping techniques is polyglot programming combining multiple, mainly scripting, languages during development of systems. this permits the use of a specialized language for dedicated system concerns and also allows for a continuous change and re-deployment of implementation. Despite the advantages, rapid prototyping with help of polyglot programming is still not well supported in the domain of component-based systems, which makes it difficult to quickly prototype and test these systems. To address the obstacle, the paper describes a general technique for transparent and extensible combining of multiple languages for purpose of rapid prototyping during development of component-based systems with help of advanced component frameworks.

关键词： components rapid prototyping polyglot programming scripting languages controllers interface interceptors

来源：评论

学校读者我要写书评

暂无评论

Program Synthesis from Polymorphic Refinement Types

引用

acm sigplan NOTICES 2016年第6期51卷 522-538页

作者： Polikarpova, Nadia Kuraj, Ivan Solar-Lezama, Armando MIT CSAIL Cambridge MA USA

We present a method for synthesizing recursive functions that provably satisfy a given specification in the form of a polymorphic refinement type. We observe that such specifications are particularly suitable for program synthesis for two reasons. First, they offer a unique combination of expressive power and decidability, which enables automatic verification-and hence synthesis-of nontrivial programs. Second, a type-based specification for a program can often be effectively decomposed into independent specifications for its components, causing the synthesizer to consider fewer component combinations and leading to a combinatorial reduction in the size of the search space. At the core of our synthesis procedure is a newalgorithm for refinement type checking, which supports specification decomposition. We have evaluated our prototype implementation on a large set of synthesis problems and found that it exceeds the state of the art in terms of both scalability and usability. the tool was able to synthesize more complex programs than those reported in prior work (several sorting algorithms and operations on balanced search trees), as well as most of the benchmarks tackled by existing synthesizers, often starting from a more concise and intuitive user input.

关键词： languages Verification Program Synthesis Functional programming Refinement Types Predicate Abstraction

来源：评论

学校读者我要写书评

暂无评论

ProSE: the Architecture and design of a Protein Discovery Engine 27

ProSE: The Architecture and Design of a Protein Discovery En...

引用

27th acm International conference on Architectural Support for programming languages and Operating Systems (ASPLOS)

作者： Robson, Eyes Xu, Ceyu Wills, Lisa Wu Univ Calif Berkeley Berkeley CA 94720 USA Duke Univ Durham NC USA

ISBN: (纸本)9781450392051

Protein language models have enabled breakthrough approaches to protein structure prediction, function annotation, and drug discovery. A primary limitation to the widespread adoption of these powerful models is the high computational cost associated with the training and inference of these models, especially at longer sequence lengths. We present the architecture, microarchitecture, and hardware implementation of a protein design and discovery accelerator, ProSE (Protein Systolic Engine). ProSE has a collection of custom heterogeneous systolic arrays and special functions that process transfer learning model inferences efficiently. the architecture marries SIMD-style computations with systolic array architectures, optimizing coarse-grained operation sequences across model layers to achieve efficiency without sacrificing generality. ProSE performs Protein BERT inference at up to 6.9x speedup and 48x power efficiency (performance/Watt) compared to one NVIDIA A100 GPU. ProSE achieves up to 5.5 x (12.7x) speedup and 173x (249x) power efficiency compared to TPUv3 (TPUv2).

关键词： Accelerators Neural Networks Transformers Domain-Specific Architecture NLP Protein design

来源：评论

学校读者我要写书评

暂无评论

From massively monster machines to microchips: Forces affecting lisp language design for five decades

From massively monster machines to microchips: Forces affect...

引用

Celebrating the 50th Anniversary of Lisp, Lisp50@OOPSLA'08

作者： White, Jonl Bourbaki, Nickieben Ginger IceCream Factory of Palo Alto United States Morrison Tombstone Designs United States

ISBN: (纸本)9781605583839

I worked on Lisp design and implementation from the late 1960s almost until I retired about 5 years ago - and since then I've remained in the community by helping organize Lisp conferences. this means I've been in the thick of Lisp for most of its lifetime. In my talk there were a couple of points I wanted to make. First, computer hardware over the years has imposed constraints on the design of Lisp, ranging from gigantic machines in the early days - gigantic in size but miniscule in computing power - to tiny ones today (whose computing power was once considered "super".) Second, it was certain mindsets of the people involved in the design and implementation of Lisp that most strongly influenced its design - in particular, it was their educational background, driven by interests and talents, that had a great impact on the language. Copyright © 2008 acm.

关键词： Computing power

来源：评论

学校读者我要写书评

暂无评论

Towards a formal semantics for a structurally dynamic noncausal modelling language

Towards a formal semantics for a structurally dynamic noncau...

引用

8th acm sigplan Workshop on Types in language design and implementation, TLDI'12, Co-located with POPL 2012

作者： Capper, John Nilsson, Henrik University of Nottingham Nottingham United Kingdom

ISBN: (纸本)9781450311205

Modelling and simulation languages are evolving rapidly to support modelling of systems of ever increasing size and complexity. A relatively recent development in the area of physical modelling is the noncausal modelling languages. they support a declarative, highly modular modelling approach, promoting the reuse of components. Modelica is a prime example of this class of languages. However, the mainstream representatives of this class of languages provide limited support for higher-order modelling and structurally dynamic systems. Moreover, the semantics of this class of languages remains a relatively unexplored area. Functional Hybrid Modelling (FHM) is a novel approach to noncausal, hybrid modelling that aims to address these concerns. In this paper, we give a semantics to the discrete part of a simple FHM language expressed in dependent type theory. We use Normalisation by Evaluation to produce a type-preserving and terminating normalisation procedure, the latter property being particularly important for FHM as highly structurally dynamic systems are supported by computing new system configurations during simulation. Furthermore, our implementation has been carefully structured to allow continuous aspects of the semantics to be described separately, in whatever way is deemed appropriate, while retaining the ability to describe precisely how a system evolves in response to discrete events. Copyright © 2012 acm.

关键词： Formal verification

来源：评论

学校读者我要写书评

暂无评论

programming aspects of VLSI 82

Programming aspects of VLSI

引用

9th acm sigplan-SIGACT Symposium on Principles of programming languages, POPL 1982

作者： Lipton, Richard J. Sedgewick, Robert Valdes, Jacobo Department of Electrical Engineering and Computer Science Princeton University PrincetonNJ United States Computer Science Department Brown University ProvidenceRI United States

ISBN: (纸本)0897910656

Two components of a VLSI design environment being built at Princeton are described. the general theme of this effort is to make the design of VLSI circuits as similar to programming as possible. A conscious attempt is being made to apply experience in the design of large software systems to the creation of an appropriate environment for VLSI circuits. the two components described are a procedural language to specify circuit layouts and a switch-level circuit simulator for layout produced with this language. they have been chosen for presentation because many issues in their design are very similar to the issues that arise in the design of programming languages and software environments. © 1982 acm.

关键词： VLSI circuits

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：