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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

164 篇 期刊文献
105 篇 会议
5 篇 学位论文
1 册 图书

馆藏范围

275 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

255 篇 工学
- 188 篇 计算机科学与技术...
- 114 篇 软件工程
- 86 篇 电气工程
- 17 篇 信息与通信工程
- 13 篇 控制科学与工程
- 6 篇 机械工程
- 3 篇 材料科学与工程（可...
- 3 篇 电子科学与技术（可...
- 2 篇 仪器科学与技术
- 2 篇 石油与天然气工程
- 2 篇 核科学与技术
- 1 篇 冶金工程
- 1 篇 土木工程
- 1 篇 测绘科学与技术
- 1 篇 航空宇航科学与技...
- 1 篇 环境科学与工程（可...
- 1 篇 生物医学工程（可授...
- 1 篇 城乡规划学
- 1 篇 网络空间安全
24 篇 理学
- 13 篇 数学
- 6 篇 物理学
- 3 篇 化学
- 3 篇 生物学
- 2 篇 天文学
- 1 篇 地理学
- 1 篇 系统科学
16 篇 管理学
- 15 篇 管理科学与工程(可...
- 2 篇 图书情报与档案管...
7 篇 教育学
- 7 篇 教育学
1 篇 文学
1 篇 医学
- 1 篇 基础医学(可授医学...

主题

275 篇 distributed prog...
21 篇 parallel program...
19 篇 distributed syst...
16 篇 concurrent progr...
13 篇 concurrency
10 篇 programming lang...
9 篇 java
9 篇 distributed appl...
9 篇 computer science...
8 篇 synchronization
7 篇 mapreduce
7 篇 marshalling
7 篇 scala
7 篇 cloud computing
7 篇 scientific compu...
6 篇 modules
6 篇 actor model
6 篇 erlang
6 篇 serialisation
5 篇 parallel process...

机构

4 篇 ecole polytech f...
4 篇 imperial coll lo...
3 篇 gran sasso sci i...
3 篇 univ ciencias & ...
3 篇 kth royal inst t...
3 篇 univ calif davis...
2 篇 sharda univ dept...
2 篇 technion israel ...
2 篇 tech univ darmst...
2 篇 ibm corp thomas ...
2 篇 typesafe inc ca ...
2 篇 indiana univ per...
2 篇 tech univ darmst...
2 篇 univ pisa comp s...
2 篇 univ cambridge c...
2 篇 univ kentucky de...
2 篇 imt inst adv stu...
2 篇 vrije univ bruss...
2 篇 univ maryland co...
2 篇 lulea univ techn...

作者

8 篇 haller philipp
5 篇 yoshida nobuko
5 篇 salvaneschi guid...
4 篇 weisenburger pas...
4 篇 miller heather
3 篇 duong tan
3 篇 broll brian
3 篇 lee huamani enri...
3 篇 song kunfang
3 篇 de meuter wolfga...
3 篇 tonci nicolo
3 篇 odersky martin
3 篇 maroti miklos
3 篇 roman-gonzalez a...
3 篇 neykova rumyana
3 篇 andrews gr
3 篇 de bosschere k
3 篇 ciancarini p
3 篇 cook rp
3 篇 ledeczi akos

语言

256 篇 英文
18 篇 其他
1 篇 中文

检索条件"主题词=distributed programming"

共 275 条记录，以下是211-220 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

SPOTWorld and the Sun SPOT

SPOTWorld and the Sun SPOT

引用

6th International Symposium on Information Processing Sensor Networks

作者： Smith, Randall B. Sun Microsyst Lab Menlo Pk CA 94025 USA

ISBN: (纸本)9781595936387

We describe the Sun(1) Small Programmable Object Technology, or Sun SPOT. The Sun SPOT is a small wireless computing platform that runs Java(1) directly, with no operating system. The system comes with an on-board set of sensors, and I/O pins for easy connection to external devices. We also describe SPOTWorld, an integrated management and code deployment tool for working with Sun SPOTs.

关键词： sensors sensor networks distributed programming mesh networks network management Java

来源：评论

学校读者我要写书评

暂无评论

distributed Lazy Evaluation: A Big-Step Mechanised Semantics

Distributed Lazy Evaluation: A Big-Step Mechanised Semantics

引用

22nd Euromicro International Conference on Parallel, distributed, and Network-Based Processing (PDP)

作者： Haeri, Seyed H. (Hossein) Schupp, Sibylle Hamburg Univ Technol Inst Software Syst Hamburg Germany

ISBN: (纸本)9781479927289

This paper presents a big-step operational semantics for distributed lazy evaluation. Our semantics is an extension to the famous heap-based semantics of Launchbury for lazy evaluation. The high level of abstraction in our semantics helps us to easily prove different properties that are of interest to task distribution. Most importantly, we give criteria which establish a notion of bisimilarity between heaps. We also prove the validity of an induction principle that is used for proving observational equivalence between programs written in our system. Additionally, we briefly report the mechanisation of our semantics.

关键词： Big-Step Operational Semantics distributed programming Lazy Evaluation Language Mechanisation

来源：评论

学校读者我要写书评

暂无评论

Object Based distributed Data Sharing In Multi-Agent Environment 5

Object Based Distributed Data Sharing In Multi-Agent Environ...

引用

5th IEEE International Conference on Software Engineering and Service Science (ICSESS)

作者： Pataci, Metehan Erdogan, Nadia Istanbul Tech Univ Fac Comp & Informat TR-80626 Istanbul Turkey

ISBN: (纸本)9781479932795

This paper describes a framework which enables distributed object sharing in a multi agent environment. Shared objects are replicated across nodes in the distributed environment so that agents access a local copy rather than a remote one, thus minimizing network traffic. The framework solves issues related to replica coherence, consistency and management. Shared objects are serializable Java objects supported with the multiple reader single writer (MRSW) access model. The framework includes components that act local servers for dynamic object ownership and a system coordinator for managing and monitoring the system, taking solution oriented responsibilities for unwanted/unexpected situations. An interface is provided to enable users to use simple object access methods in a completely transparent manner. Object access requests can be monitored through predefined graphical user interfaces. The system assigns unique identifiers for each access request, thus access calls can be carried out in parallel.

关键词： distributed programming distributed objects object sharing multi-agent systems

来源：评论

学校读者我要写书评

暂无评论

Grid-Oriented Scatter Search Algorithm

引用

9th International Conference on Adaptive and Natural Computing Algorithms (ICANNGA)

作者： Gomez-Iglesias, Antonio Vega-Rodriguez, Miguel A. Cardenas-Montes, Miguel Morales-Ramos, Enrique Castejon-Magana, Francisco CIEMAT Natl Fus Lab E-28040 Madrid Spain Univ Extremadura Dept Technol Comp & Commun E-06071 Badajoz Spain CIEMAT Dept Basic Sci Madrid Spain Univ Extremadura ARCO Res Grp E-06071 Badajoz Spain

ISBN: (纸本)9783642049200

Scatter search (SS) is an evolutionary algorithm (EA) becoming more important in current researches as the increasing number of publications shows. It is a very promising method for solving combinatorial and nonlinear optimisation problems. This algorithm is being widely implemented for solving problems not taking long, but in case of processes requiring of high execution times likely to be executed using grid computing there is not an implementation for it. Some problems arise when we try to execute this algorithm using the grid, but once they are solved, the obtained results are really promising for many complex and scientific applications like, for example, applications for optimising nuclear fusion devices. Using concurrent programming and distributed techniques associated to the grid, the algorithm works as it could do it in a single computer.

关键词： Scatter Search distributed programming Concurrent programming Grid Computing

来源：评论

学校读者我要写书评

暂无评论

Instant Pickles: Generating Object-Oriented Pickler Combinators for Fast and Extensible Serialization 13

Instant Pickles: Generating Object-Oriented Pickler Combinat...

引用

2013 ACM SIGPLAN International Conference on Object Oriented programming Systems Languages

作者： Miller, Heather Haller, Philipp Burmako, Eugene Odersky, Martin Ecole Polytech Fed Lausanne Lausanne Switzerland Typesafe Inc San Francisco CA USA

ISBN: (纸本)9781450323741

As more applications migrate to the cloud, and as "big data" edges into even more production environments, the performance and simplicity of exchanging data between compute nodes/devices is increasing in importance. An issue central to distributed programming, yet often under-considered, is serialization or pickling, i.e., persisting runtime objects by converting them into a binary or text representation. Pickler combinators are a popular approach from functional programming;their composability alleviates some of the tedium of writing pickling code by hand, but they don't translate well to object-oriented programming due to qualities like open class hierarchies and subtyping polymorphism. Furthermore, both functional pickler combinators and popular, Java-based serialization frameworks tend to be tied to a specific pickle format, leaving programmers with no choice of how their data is persisted. In this paper, we present object-oriented pickler combinators and a framework for generating them at compile-time, called scala/pickling, designed to be the default serialization mechanism of the Scala programming language. The static generation of OO picklers enables significant performance improvements, outperforming Java and Kryo in most of our benchmarks. In addition to high performance and the need for little to no boilerplate, our framework is extensible: using the type class pattern, users can provide both (1) custom, easily interchangeable pickle formats and (2) custom picklers, to override the default behavior of the pickling framework. In benchmarks, we compare scala/pickling with other popular industrial frameworks, and present results on time, memory usage, and size when pickling/unpickling a number of data types used in real-world, large-scale distributed applications and frameworks.

关键词： Serialization pickling meta-programming distributed programming Scala

来源：评论

学校读者我要写书评

暂无评论

PushPin: Towards Production-Quality Peer-to-Peer Collaboration 7

PushPin: Towards Production-Quality Peer-to-Peer Collaborati...

引用

7th Workshop on Principles and Practice of Consistency for distributed Data (PaPoC)

作者： van Hardenberg, Peter Kleppmann, Martin Ink & Switch LLC San Francisco CA 94110 USA Univ Cambridge Cambridge England

ISBN: (纸本)9781450375245

Fully peer-to-peer application software promises many benefits over cloud software, in particular, being able to function indefinitely without requiring servers. Research on distributed consistency mechanisms such as CRDTs has laid the foundation for P2P data synchronisation and collaboration. In this paper we report on our experience in taking these technologies beyond research prototypes, and working towards commercial-grade P2P collaboration software. We identify approaches that work well in our experience, such as the functional reactive programming paradigm, and highlight areas in need of further research, such as the reliability of NAT traversal and usability challenges.

关键词： real-time collaboration CRDTs peer-to-peer protocols distributed programming usability

来源：评论

学校读者我要写书评

暂无评论

A Subtyping Scheme for Nominal and Structural Types Based on Class Graph Equivalence 4

A Subtyping Scheme for Nominal and Structural Types Based on...

引用

4th International Conference on Blockchain Technology and Applications (ICBTA)

作者： Ke, Wei Chan, Ka-Hou Macao Polytech Inst Sch Appl Sci Macau Peoples R China

ISBN: (纸本)9781450387460

Subtyping and multiple inheritance are the essential features of oo and component-based programming languages, in particular with the presence of interfaces and contracts. More general, the composability of these constructs admitting the subtype relation powers the reusability, modular, flexibility and reliability of oo-based systems. While nominal classes allow annotation of user intention to the types, operations on interfaces and contracts naturally result structural constructs. Structural types are also necessary if we need the types to have value-semantics, so that they can be transferred around in distributed systems. Building a type system that allows the coexistence of nominal and structural classes, while maintaining the usual subtype relation is critical and challenging. We present a subtyping scheme that encodes a class to a directed and edge-labeled graph, which has the convenience to handle recursive types. The names of a class and its superclasses are encoded as tags to label the edges of the graph, turning the nominal construct into a structural one. This encoding allows us to unify the handling of class relations into graph relations. We define the class representation, canonical form, value-identity and subtype relation in the notion of graphs, and justify our subtyping scheme in the cases of multiple inheritance, class intersection and union. Our scheme is general, easy to implement and compatible with most of the existing oo type systems, providing a solid base for further oo language and tool development.

关键词： subtyping nominal subtyping structural subtyping multiple inheritance intersection type union type class graph recursive type type equivalence object-oriented language distributed programming

来源：评论

学校读者我要写书评

暂无评论

Global abstraction-safe marshalling with hash types 03

Global abstraction-safe marshalling with hash types

引用

8th International Conference on Functional programming (ICFP 03)

作者： Leifer, JJ Peskine, G Sewell, P Wansbrough, K INRIA Rocquencourt Rocquencourt France

ISBN: (纸本)9781581137569

Type abstraction is a key feature of ML-like languages for writing large programs. Marshalling is necessary for writing distributed programs, exchanging values via network byte-streams or persistent stores. In this paper we combine the two, developing compile-time and run-time semantics for marshalling, that guarantee abstraction-safety between separately-built programs. We obtain a namespace for abstract types that is global, i.e. meaningful between programs, by hashing module declarations. We examine the scenarios in which values of abstract types are communicated from one program to another, and ensure, by constructing hashes appropriately, that the dynamic and static notions of type equality mirror each other. We use singleton kinds to express abstraction in the static semantics;abstraction is tracked in the dynamic semantics by coloured brackets. These allow us to prove preservation, erasure, and coincidence results. We argue that our proposal is a good basis for extensions to existing ML-like languages, pragmatically straightforward for language users and for implementors.

关键词： programming languages ML type theory abstract types marshalling serialisation modules singleton kinds hashing distributed programming lambda calculus

来源：评论

学校读者我要写书评

暂无评论

Realizing Persistent Signals in JavaScript 10

Realizing Persistent Signals in JavaScript

引用

10th ACM SIGPLAN International Workshop on Reactive and Event-Based Languages and Systems (REBLS)

作者： Hidaka, Daichi Kamina, Tetsuo Oita Univ Oita Japan

ISBN: (纸本)9798400704000

Reactive programming enables declarative descriptions of dependencies between and computations throughout signals, an abstraction of time-varying values. Signals have been extended to persistent signals (an abstraction of time-varying values with their execution histories) to enable them to go back in time with any given time. Currently, this feature is only supported by SignalJ, an extension to Java with signals. This limits the use of persistent signals only within the Java-based applications. This is an undesirable restriction, because mechanisms used in realizing persistent signals are actually language-independent. To tackle this problem, we propose an implementation of persistent signals in JavaScript, which makes application areas of persistent signals broader, including Web-frontend. To realize persistent signals in JavaScript, seamless connections between JavaScript programs that run on restricted environments such as browsers and time-series databases that serve histories of persistent signals are required. It is also desirable to reuse existing JavaScript ecosystem. To address these problems, we design a relay-server-based architecture and realize persistent signals in JavaScript as a DSL library.

关键词： distributed programming Relay-server-based architecture DSL library

来源：评论

学校读者我要写书评

暂无评论

A FAST PARALLEL MATCHING ALGORITHM FOR CONTINUOUS INTEREST MANAGEMENT

A FAST PARALLEL MATCHING ALGORITHM FOR CONTINUOUS INTEREST M...

引用

2010 Winter Simulation Conference

作者： Liu, Elvis S. Theodoropoulos, Georgios K. Univ Birmingham Sch Comp Sci Birmingham B15 2TG W Midlands England

ISBN: (纸本)9781424498642

In recent years, the scale of distributed virtual environments (DVEs) has grown rapidly in terms of number of participants and virtual entities. Many DVEs employ interest management schemes to reduce bandwidth consumption and thus enhance the scalability of the system. Most of the existing interest management approaches, however, have a fundamental disadvantage - they perform interest matching at discrete time intervals. As a result, they would fail to report events between consecutive time-steps of simulation which leads to incorrect simulations. In this paper, we present a new algorithm for interest matching which aims to capture missing events between discrete time-steps. This algorithm facilitates parallelism by distributing the workload of matching process across multiple processors. Since it is increasingly common to deploy commercial DVE applications on shared-memory multiprocessor machines, using the parallel algorithm for these applications would be more suitable than the existing serial algorithms.

关键词： DVE bandwidth consumption continuous interest management discrete time steps distributed programming distributed virtual environments incorrect simulations multiple processors multiprocessing systems parallel algorithms parallel matching algorithm shared

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共28页 << < 18 19 20 21 22 23 24 25 26 27 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：