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

Quantum programming languages: A tentative study

Science in China(Series F) 2008年第6期51卷 623-637页

作者： XU JiaFu SONG FangMin State Key Laboratory for Novel Software Technology Department of Computer Science and TechnologyNanjing University Nanjing 210093 China

Starting with some simple representative quantum programming languages, this paper lays stress on quantum computation, language paradigm, program structure, input/output, exception facility, and especially the recent results of the quantum computation group at Nanjing University, namely the functional quantum programming language NDQFP. All primitive functions and combining forms in NDQFP are given in the appendix.

关键词： quantum programming languages language paradigm imperative programming language declarative programming language lexical analyzer syntactic analyzer assembler interpreter

来源：评论

学校读者我要写书评

暂无评论

Towards declarative programming for Mobile Crowdsourcing: P2P Aspects 15

Towards Declarative Programming for Mobile Crowdsourcing: P2...

引用

15th IEEE International Conference on Mobile Data Management (IEEE MDM)

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

ISBN: (纸本)9781479957057

Peer-to-Peer technologies have been widely used in networks which manage vast amount of data daily. The proliferation of mobile devices strongly motivates mobile peer-to-peer network (M-P2P) applications, with benefits from network effects. We argue that logic programming for crowdsourcing can be useful in peer-to-peer computing for querying and multicasting tasks shared over peer networks. We introduce a declarative crowdsourcing platform for mobile applications, which combines conventional machine computation and the power of the crowd in social networking, particularly in M-P2P networks. This paper discusses a simple extension of Prolog, which we call LogicCrowd, focusing on enabling goal evaluation over peers in mobile peer networks. Additionally, we demonstrate that logic programming for crowdsourcing can be useful in peer-to-peer computing for querying and P2P style of task sharing over short-range networks. In this paper, we illustrate the potential of our approach via programming idioms, a prototype implementation and scenarios.

关键词： declarative programming language mobile application mobile crowdsourcing peer-to-peer network

来源：评论

学校读者我要写书评

暂无评论

declarative programming for Mobile Crowdsourcing: Energy Considerations and Applications 10

Declarative Programming for Mobile Crowdsourcing: Energy Con...

引用

10th International Conference on Mobile and Ubiquitous Systems - Computing, Networking, and Services (MOBIQUITOUS)

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

ISBN: (纸本)9783319115689

This paper introduces LogicCrowd, a declarative programming platform for mobile crowdsourcing applications (using social media networks and peer-to-peer networks), developed as an extension of Prolog. We present a study of energy consumption characteristics for our LogicCrowd prototype. Based on the measurements, we develop an energy-crowdsourcing consumption model for LogicCrowd on the Android platform and also extend the LogicCrowd meta-interpreter for computing with an energy budget corresponding to a certain battery lifetime.

关键词： declarative programming language Mobile application Mobile crowdsourcing Peer-to-peer Mobile energy consumption model

来源：评论

学校读者我要写书评

暂无评论

LogicCrowd: a declarative programming Platform for Mobile Crowdsourcing

<i>LogicCrowd</i>: a Declarative Programming Platform for Mo...

引用

12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

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

ISBN: (纸本)9780769550220

We present an attempt to engage social media networks, bringing the crowdsourcing model into mobile environments. We introduce Logic Crowd, a declarative programming paradigm for mobile crowdsourcing applications, developed as an extension of Prolog. Logic Crowd aims at filling the gap between traditional machine computation, which operates upon its database, and social media, which is capable of interacting with real people. In this paper, we illustrate the potential of our approach via programming idioms, a prototype implementation and scenarios.

关键词： declarative programming language mobile application mobile crowdsourcing social media network

来源：评论

学校读者我要写书评

暂无评论

Tea: A High-level language and Runtime System for Automating Statistical Analysis 19

Tea: A High-level Language and Runtime System for Automating...

引用

32nd Annual ACM Symposium on User Interface Software and Technology (UIST)

作者： Jun, Eunice Daum, Maureen Roesch, Jared Chasins, Sarah E. Berger, Emery D. Just, Rene Reinecke, Katharina Univ Washington Seattle WA 98195 USA Univ Calif Berkeley Berkeley CA 94720 USA Univ Massachusetts Amherst MA 01003 USA Microsoft Res Redmond WA USA

ISBN: (纸本)9781450368162

Though statistical analyses are centered on research questions and hypotheses, current statistical analysis tools are not. Users must first translate their hypotheses into specific statistical tests and then perform API calls with functions and parameters. To do so accurately requires that users have statistical expertise. To lower this barrier to valid, replicable statistical analysis, we introduce Tea, a high-level declarative language and runtime system. In Tea, users express their study design, any parametric assumptions, and their hypotheses. Tea compiles these high-level specifications into a constraint satisfaction problem that determines the set of valid statistical tests and then executes them to test the hypothesis. We evaluate Tea using a suite of statistical analyses drawn from popular tutorials. We show that Tea generally matches the choices of experts while automatically switching to non-parametric tests when parametric assumptions are not met. We simulate the effect of mistakes made by non-expert users and show that Tea automatically avoids both false negatives and false positives that could be produced by the application of incorrect statistical tests.

关键词： statistical analysis automated statistical analysis declarative programming language constraint-based system data science reproducibility pre-registration

来源：评论

学校读者我要写书评

暂无评论

The topological structures of membrane computing

引用

FUNDAMENTA INFORMATICAE 2002年第1-3期49卷 123-145页

作者： Giavitto, JL Michel, O Univ Evry LaMI UMR 8042 CNRS F-91000 Evry France

In its initial presentation, the P system formalism describes the topology of the membranes as a set of nested regions. In this paper, we present an algebraic structure developped in combinatorial topology that can be used to describe finer adjacency relationships between membranes. Using an appropriate abstract setting, this technical device enables us to reformulate also the computation within a membrane and proposes a unified view on several computational mechanisms initially inspired by biological processes. These theoretical tools are instantiated in MGS, an experimental programming language handling various types of membrane structures in a homogeneous and uniform syntax.

关键词： membrane computing Gamma CHAM P system L system cellular automata group based fields rewriting topological collection declarative programming language

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：