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

作者： Mostinckx, Stijn Dedecker, Jessie Boix, Elisa Gonzalez Van Cutsem, Tom De Meuter, Wolfgang Programming Technology Laboratory Vrije Universiteit Brussel Belgium Fund for Scientific Research Flanders Belgium

ISBN: (纸本)3540374434

Writing ambient-oriented software for mobile devices connected through wireless network connections provides new challenges in the field of exception handling. It involves dealing with issues such as asynchronous communication, moving hardware and software, only to name a few. Building on an analysis of the fundamental differences between mobile networks and their stationary counterparts, this paper establishes a set of criteria for an ambient-oriented exception handling mechanism. We subsequently present ambient conversations, a novel distributed exception handling mechanism that adheres to the prescribed criteria, and describe its realisation in the experimental ambient-oriented programming language AmbientTalk. © 2006 Springer-Verlag Berlin/Heidelberg.

关键词： Wireless networks

来源：评论

学校读者我要写书评

暂无评论

AmbientTalk: Language support for mobile computing

AmbientTalk: Language support for mobile computing

引用

International Workshop on System Support for Future Mobile Computing Applications, FUMCA 2006

作者： Dedecker, Jessie Van Cutsem, Tom Mostinckx, Stijn De Meuter, Wolfgang D'Hondt, Theo Fund for Scientific Research Flanders Belgium Belgium Programming Technology Laboratory Department of Computer Science Vrije Universiteit Brussel Belgium

ISBN: (纸本)0769527299

An important aspect of system support for mobile computing involves alleviating the issues related to programming the underlying distributed system. Our approach to dealing with these issues is by means of programming language support. To this end, we have designed a high-level, distributed object-oriented programming language - called Ambient Talk - which has been designed specifically for mobile networks. We motivate the need for such dedicated language support based on the fundamental characteristics of mobile distributed systems. Subsequently, we describe the salient features of Ambient Talk with respect to distributed programming by means of an exemplar mobile computing application. © 2006 IEEE.

关键词： Ubiquitous computing

来源：评论

学校读者我要写书评

暂无评论

Computations and relational bundles

引用

9th International Conference on Relational Methods in Computer Science and 4th International Workshop on Applications of Kleene Algebra, RelMiCS/AKA 2006

作者： Sanders, J.W. Computing Laboratory Programming Research Group Oxford University Parks Road Oxford OX1 3QD United Kingdom

ISBN: (纸本)3540378731

We explore the view of a computation as a relational section of a (trivial) fibre bundle: initial states lie in the base of the bundle and final states lie in the fibres located at their initial states. This leads us to represent a computation in 'fibre-form' as the angelic choice of its behaviours from each initial state. That view is shown to have the advantage also of permitting final states to be of different types, as might be used for example in a semantics of probabilistic computations, and of providing a natural setting for refinement of computations. However we apply that view in a different direction. On computations more general than code the two standard models, the relational and the predicate-transformer models, obey different laws. One way to understand that difference is to study the laws of more refined models, like the semantics of probabilistic computations. Another is to characterise each model by its laws. In spite of their differences, the relational model is embedded in the transformer model by a Galois connection which can be used to transfer much of the structure on transformers to the relational model. We investigate the extent to which the conjugate on predicate transformers translates to relations and use the result to motivate a characterisation of relational computations, achieved by using fibre-forms. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Computation theory

来源：评论

学校读者我要写书评

暂无评论

Characterization and analysis of HMMER and SVM-RFE parallel bioinformatics applications

Characterization and analysis of HMMER and SVM-RFE parallel ...

引用

IEEE International Workshop/Symposium on Workload Characterization

作者： U. Srinivasan Peng-Sheng Chen Qian Diao Chu-Cheow Lim E. Li Yongjian Chen R. Ju Yimin Zhang Programming Systems Laboratoryoratory Microprocessor Technology Laboratory Intel Corporation Santa Clara CA USA Architecture Research Laboratoryoratory Microprocessor Technology Laboratory Intel Corporation Santa Clara CA USA

Bioinformatics applications constitute an emerging data-intensive, high-performance computing (HPC) domain. While there is much research on algorithmic improvements, (2004), the actual performance of an application also depends on how well the program maps to the target hardware. This paper presents a performance study of two parallel bioinformatics applications HMMER (sequence alignment) and SVM-RFE (gene expression analysis), on Intel x86 based hyperthread-capable (2002) shared-memory multiprocessor systems. The performance characteristics varied according to the application and target hardware characteristics. For instance, HMMER is compute intensive and showed better scalability on a 3.0 GHz system versus a 2.2 GHz system. However, SVM-RFE is memory intensive and showed better absolute performance on the 2.2 GHz machine which has better memory bandwidth. The performance is also impacted by processor features, e.g. hyperthreading (HT) (2002) and prefetching. With HMMER we could obtain -75% of the performance with HT enabled with respect to doubling the number of CPUs. While load balancing optimizations can provide speedup of -30% for HMMER on a hyperthreading-enabled system, the load balancing has to adapt to the target number of processors and threads. SVM-RFE benefits differently from the same load-balancing and thread scheduling tuning. We conclude that compiler and runtime optimizations play an important role to achieve the best performance for a given bioinformatics algorithm.

关键词： Hidden Markov models Bioinformatics Hardware Load management Yarn Gene expression Performance analysis Multiprocessing systems Scalability Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Exploiting semantic clustering in the eDonkey P2P network

Exploiting semantic clustering in the eDonkey P2P network

引用

11th Workshop on ACM SIGOPS European Workshop, EW 11

作者： Handurukande, S.B. Kermarrec, A.-M. Fessant, F. Le Massoulié, L. Distributed Programming Laboratory EPFL Switzerland INRIA Rennes France INRIA-Futurs and Lix Palaiseau France Microsoft Research Cambridge United Kingdom

Peer-to-peer file sharing now represents a significant portion of the Internet traffic and has generated a lot of interest from the research community. Some recent measurements studies of peer-to-peer workloads have demonstrated the presence of semantic proximity between peers. One way to improve performance of peer-to-peer file sharing systems is to exploit this locality of interest in order to connect semantically related peers so as to improve the search both in flooding- and server-based systems. Creating these additional connections raises interesting challenges and in particular (i) how to capture the semantic relationship between peers (ii) how to exploit these relationships and (iii) how to evaluate these improvements. In this paper, we evaluate several strategies to exploit the semantic proximity between peers against a real trace collected in November 2003 in the eDonkey 2000 peer-to-peer network. We present the results of this evaluation which confirm the presence of clustering in such networks and the interest to exploit it.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

EkSarva: an intelligent collaboration framework

EkSarva: an intelligent collaboration framework

引用

International IEEE Conference on Intelligent Systems, IS

作者： R. Reddy S. Selliah V. Bharadwaj Jinqiao Yu S. Kankanahalli S. Reddy Smart Internet Programming Laboratory Concurrent Engineering Research Center Lane Department of Computer Science and Electrical Engineering West Virginia University Morgantown WV USA

Ubiquitous computing and universal network connectivity have given rise to expectations of building a Digital Society, where many aspects of business and social activities may be accomplished by remote participants. Intelligent, context-aware, and workflow-centric collaboration is an essential prerequisite to fulfill that expectation. EkSarva is a framework, which enables realization of such collaborations in diverse domains. This is accomplished by identifying the key concepts and their inter-relationships (dubbed the PPP/SST paradigm), which form the foundation of this framework. The key concepts include: (a) Project, (b) Person, (c) Place, (d) Signal, (e) Situation, and (f) Transcript. This paper describes how these concepts collectively can give rise to an intelligent collaboration environment.

关键词： Collaboration Collaborative work Internet Java Computer networks Intelligent networks Signal processing Intelligent structures Intelligent agent Laboratories

来源：评论

学校读者我要写书评

暂无评论

Performance potentials of compiler-directed data speculation

Performance potentials of compiler-directed data speculation

引用

IEEE International Symposium on Performance Analysis of Systems and Software

作者： Youfeng Wu Li-Ling Chen R. Ju J. Fang Programming Systems Research Laboratory INTEL Research Laboratory Santa Clara CA USA

Compiler-directed data speculation has been implemented on Itanium systems to allow for a compiler to move a load across a store even when the two operations are potentially aliased This not only breaks data dependency to reduce critical path length, but also allows a load to be scheduled far apart from its uses to hide cache miss latencies. However, the effectiveness of data speculation is affected by the sophistication of alias analysis technique as well as the aggressiveness of the instruction scheduler. In general, the more sophisticated is the alias analysis technique, the less performance gain is from data speculation, and the more aggressive is the instruction scheduler, the more opportunity is for data speculation. In this paper we evaluate in various scenarios the performance potentials of data speculation for SPEC2000C benchmarks. For each scenario, we determine the performance contributions of data speculation due to both critical path reduction and cache miss latency reduction. We also show interesting statistics about the effects of scheduling constraints, the percentage of critical dependencies, the impacts of cache miss latencies, and the distances between the load locations before and after data speculation.

关键词： Delay Processor scheduling Performance analysis Educational institutions Performance gain Performance evaluation Statistics Runtime

来源：评论

学校读者我要写书评

暂无评论

How to prevent type flaw attacks on security protocols

How to prevent type flaw attacks on security protocols

引用

作者： Heather, James Lowe, Gavin Schneider, Steve Department of Computing Sch. of Electron. Comp./Mathematics University of Surrey Guildford Surrey GU2 7XH United Kingdom Programming Research Group Computing Laboratory Oxford University Parks Road Oxford OX1 3QD United Kingdom Royal Holloway University of London Egham Hill Egham Surrey TW20 0EX United Kingdom

A type flaw attack on a security protocol is an attack where a field that was originally intended to have one type is subsequently interpreted as having another type. A number of type flaw attacks have appeared in the academic literature. In this paper we prove that type flaw attacks can be prevented using a simple technique of tagging each field with some information indicating its intended type.

关键词： Network protocols

来源：评论

学校读者我要写书评

暂无评论

From fault tolerance to security and back

引用

IEEE Distributed Systems Online 2003年第9期4卷

作者： Gartner, Felix C. Buttyan, Levente Kursawe, Klaus Swiss Fed. Institute of Technology Switzerland Budapest Univ. of Technol./Economics Hungary IBM Research Distributed Programming Laboratory Swiss Fed. Institute of Technology Lausanne Switzerland Lab. of Cryptography/System Security Budapest Univ. of Technol./Economics Hungary Department of Computer Switzerland

No abstract available

关键词：

来源：评论

学校读者我要写书评

暂无评论

How to prevent type flaw attacks on security protocols

引用

Journal of Computer Security 2003年第2期11卷 217-244页

作者： Heather, James Lowe, Gavin Schneider, Steve Department of Computing School of Electronics Computing and Mathematics University of Surrey Guildford Surrey GU2 7XH UK. E-mail: Programming Research Group Oxford University Computing Laboratory Wolfson Building Parks Road Oxford OX1 3QD UK. E-mail: Royal Holloway University of London Egham Hill Egham Surrey TW20 0EX UK. E-mail:

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：