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

4th acm International conference on Systems for Energy-Efficient Built Environments, BuildSys 2017

作者： Quintana, Matias Lange, Henning Bergés, Mario Carnegie Mellon University PittsburghPA United States

ISBN: (纸本)9781450354769

This paper introduces a low-cost AC meter designed to continuously measure voltage and current waveforms at up to 14 kHz. The AC power meter, provided as open hardware, is designed using the same micro controller as the Arduino UNO1 with an In-system programming (ISP) interface, thus allowing the user to change the firmware to match their particular use case using Arduino libraries or standard C language. The suggested design is compatible with the Raspberry Pi 32, making it a suitable real-time measurement accessory for the single board computer. The platform features an 8 channel simultaneous sampling Analog-to-Digital Converter (ADC) which allows a high fidelity sampling without time offsets. Depending on how the user decides to combine current transformers (CTs) and AC-AC voltage adapters for the input channels, circuit breakers or appliances can be measured in either one phase or three phases. © 2017 Copyright held by the owner/author(s).

关键词： Firmware

来源：评论

学校读者我要写书评

暂无评论

Thread-modular shape analysis

引用

acm sigplan NOTICES 2007年第6期42卷 266-277页

作者： Gotsman, Alexey Berdine, Josh Cook, Byron Sagiv, Mooly Univ Cambridge Cambridge CB2 1TN England Microsoft Corp Redmond WA 98052 USA

We present the first shape analysis for multithreaded programs that avoids the explicit enumeration of execution-interleavings. Our approach is to automatically infer a resource invariant associated with each lock that describes the part of the heap protected by the lock. This allows us to use a sequential shape analysis on each thread. We show that resource invariants of a certain class can be characterized as least fixed points and computed via repeated applications of shape analysis only on each individual thread. Based on this approach, we have implemented a thread-modular shape analysis tool and applied it to concurrent heap-manipulating code from Windows device drivers.

关键词： abstract interpretation concurrent programming shape analysis static analysis

来源：评论

学校读者我要写书评

暂无评论

InPUT: The Intelligent Parameter Utilization Tool 12

InPUT: The Intelligent Parameter Utilization Tool

引用

14th International conference on Genetic and Evolutionary Computation conference (GECCO)

作者： Dobslaw, Felix Mid Sweden Univ Dept Informat Technol & Media Ostersund Sweden

ISBN: (纸本)9781450311786

Computer experiments are part of the daily business for many researchers within the area of computational intelligence. However, there is no standard for either human or computer readable documentation of computer experiments. Such a standard could considerably improve the collaboration between experimental researchers, given it is intuitive to use. In response to this deficiency the Intelligent Param eter Utilization Tool (InPUT ) is introduced. InPUT offers a general and programming language independent format for the definition of parameters and their ranges. It provides services to simplify the implementation of algorithms and can be used as a substitute for input mechanisms of existing frameworks. InPUT reduces code-complexity and increases the reusability of algorithm designs as well as the reproducibility of experiments. InPUT is available as open-source for Java and this will soon also be extended to C++, two of the predominant languages of choice for the development of evolutionary algorithms.

关键词： Intelligent Parameter Utilization Tool INPUT InFUT4j Computer Experiments Automated Algorithm design

来源：评论

学校读者我要写书评

暂无评论

DAOP-ADL: An architecture description language for dynamic component and aspect-based development

引用

2nd International conference on Generative programming and Component Engineering, GPCE 2003

作者： Pinto, MÓnica Fuentes, Lidia Troya, Jose MarÍa Dpto. de Lenguajes y Ciencias de la Computación University of Málaga Málaga Spain

ISBN: (纸本)3540201025

Architecture description languages deal with the description, analysis and reuse of software architectures. This paper describes DAOP-ADL, a component- and aspect-based language to specify the architecture of an application in terms of components, aspects and a set of plug-compatibility rules between them. With the aim of connecting the specification of the application architecture to the implementation, we describe our language using XML and XML Schemas. The DAOP-ADL language was designed to be interpreted by DAOP, our own dynamic component- and aspect-oriented platform. DAOP provides a composition mechanism that plugs aspects into components dynamically at runtime. The software architect will use the DAOP-ADL language at design time to describe the architecture of the application. Later this architectural information is loaded into the DAOP platform, which needs it to establish the dynamic connections between autonomous components and aspects. Therefore, the use of DAOP-ADL closes the gap between design and implementation of component- and aspect-based applications. © Springer-Verlag Berlin Heidelberg 2003.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

A declarative approach for designing and developing adaptive components 15

A declarative approach for designing and developing adaptive...

引用

15th IEEE International conference on Automated Software Engineering (ASE 2000)

作者： Boinot, P Marlet, R Noyé, J Muller, G Consel, C Univ Rennes 1 INRIA IRISA Compose Grp F-35042 Rennes France

ISBN: (纸本)0769507107

An adaptive component is a component that is able to adapt its behavior to different execution contexts. Building an adaptive application is difficult because of component dependencies and the lack of language support. As a result, code that implements adaptation is often tangled, hindering maintenance and evolution. To overcome this problem, we propose a declarative approach to program adaptation. This approach makes the specific issues of adaptation explicit. The programmer can focus on the basic features of the application, and separately provide clear and concise adaptation information. Concretely we propose adaptation classes, which enrich Java classes with adaptive behaviors. A dedicated compiler automatically generates Java code that implements the adaptive features. Moreover these adaptation declarations can be checked for consistency to provide additional safety guarantees. As a working example throughout this paper we use an adaptive sound encoder in an audio-conferencing application. We show the problems associated with a traditional implementation using design patterns, and how these problems are elegantly solved using adaptation classes.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

A 64-bit Stream Processor Architecture for Scientific Applications 07

A 64-bit Stream Processor Architecture for Scientific Applic...

引用

34th Annual International Symposium on Computer Architecture

作者： Yang, Xuejun Yan, Xiaobo Xing, Zuocheng Deng, Yu Jiang, Jiang Zhang, Ying Natl Univ Def Technol Natl Lab Paralleling & Distributed Proc Sch Comp Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9781595937063

Stream architecture is a novel microprocessor architecture with wide application potential. But as for whether it can be used efficiently in scientific computing, many issues await further study. This paper first gives the design and implementation of a 64-bit stream processor, FT64 (Fei Teng 64), for scientific computing. The carrying out of 64-bit extension design and scientific computing oriented optimization are described in such aspects as instruction set architecture, stream controller, micro controller, ALU cluster, memory hierarchy and interconnection interface here. Second, two kinds of communications as message passing and stream communications are put forward. An interconnection based on the communications is designed for FT64-based high performance computers. Third, a novel stream programming language, SF95 (Stream FORTRAN95), and its compiler, SF95Compiler (Stream FORTRAN95 Compiler), are developed to facilitate the development of scientific applications. Finally, nine typical scientific application kernels are tested and the results show the efficiency of stream architecture for scientific computing.

关键词： stream processor architecture program language compiler scientific application high performance computing

来源：评论

学校读者我要写书评

暂无评论

Sketching concurrent data structures

引用

acm sigplan NOTICES 2008年第6期43卷 136-148页

作者： Solar-Lezama, Armando Jones, Christopher Grant Bodik, Rastislav Univ Calif Berkeley Berkeley CA 94720 USA

We describe PSKETCH, a program synthesizer that helps programmers implement concurrent data structures. The system is based on the concept of sketching, a form of synthesis that allows programmers to express their insight about an implementation as a partial program: a sketch. The synthesizer automatically completes the sketch to produce an implementation that matches a given correctness criteria. PSKETCH is based on a new counterexample-guided inductive synthesis algorithm (CEGIS) that generalizes the original sketch synthesis algorithm from [ 20] to cope efficiently with concurrent programs. The new algorithm produces a correct implementation by iteratively generating candidate implementations, running them through a verifier, and if they fail, learning from the counterexample traces to produce a better candidate;converging to a solution in a handful of iterations. PSKETCH also extends SKETCH with higher-level sketching constructs that allow the programmer to express her insight as a "soup" of ingredients from which complicated code fragments must be assembled. Such sketches can be viewed as syntactic descriptions of huge spaces of candidate programs ( over 1 0 8 candidates for some sketches we resolved). We have used the PSKETCH system to implement several classes of concurrent data structures, including lock-free queues and concurrent sets with fine-grained locking. We have also sketched some other concurrent objects including a sense-reversing barrier and a protocol for the dining philosophers problem;all these sketches resolved in under an hour.

关键词： languages design sketching synthesis concurrency SAT SPIN

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

The implementation of an integrated concurrency control and recovery scheme 82

The implementation of an integrated concurrency control and ...

引用

1982 acm SIGMOD International conference on Management of Data, SIGMOD 1982

作者： Chan, Arvola Fox, Stephen Lin, Wen-Te K. Nori, Anil Ries, Daniel R. Computer Corporation of America 575 Technology Square CambridgeMA02139 United States

ISBN: (纸本)0897910737

This paper describes the implementation level design of an integrated concurrency control and recovery scheme based on the maintenance of multiple versions of data objects in a database. The concurrency control mechanism enhances parallelism by eliminating interference between retrieval and update transactions. The recovery mechanism permits efficient transaction and system recovery by keeping before-images of data objects at the page (block) level. This paper addresses the key technical problems in the implementation of such an integrated scheme. We present an efficient garbage collection algorithm for reclaiming storage space used by old versions of data objects that will no longer be accessed. We also propose an on-line backup algorithm that will permit the backup procedure to run in parallel with regular transactions. This integrated concurrency control and recovery scheme is being implemented in the LDM: the local database manager component of a distributed database management system, now being developed by Computer Corporation of America, that will support the ADAPLEX database application programming language [Chan81a, Smith81]. © 1982 acm.

关键词： Concurrency control

来源：评论

学校读者我要写书评

暂无评论

JunGL: A scripting language for refactoring

JunGL: A scripting language for refactoring

引用

28th International conference on Software Engineering 2006, ICSE '06

作者： Verbaere, Mathieu Ettinger, Ran De Moor, Oege Programming Tools Group University of Oxford United Kingdom

ISBN: (纸本)1595933751

Refactorings are behaviour-preserving program transformations, typically for improving the structure of existing code. A few of these transformations have been mechanised in interactive development environments. Many more refactorings have been proposed, and it would be desirable for programmers to script their own refactorings. Implementing such source-to-source transformations, however, is quite complex: even the most sophisticated development environments contain significant bugs in their refactoring tools. We present a domain-specific language for refactoring, named JunGL. It manipulates a graph representation of the program: all information about the program, including ASTs for its compilation units, variable binding, control flow and so on is represented in a uniform graph format. The language is a hybrid of a functional language (in the style of ML) and a logic query language (akin to Datalog). JunGL furthermore has a notion of demand-driven evaluation for constructing computed information in the graph, such as control flow edges. Borrowing from earlier work on the specification of compiler optimisations, JunGL uses socalled 'path queries' to express dataflow properties. We motivate the design of JunGL via a number of nontrivial refactorings, and describe its implementation on the .NET platform. Copyright 2006 acm.

关键词： Formal languages

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：