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

On the social organisation of organisations

Computer Supported Cooperative Work 1992年第1-2期1卷 95-118页

作者： Jirotka, Marina Gilbert, Nigel Luff, Paul Centre for Requirements and Foundations Programming Research Group University of Oxford Computing Laboratory Oxford OX1 3QD United Kingdom Social and Computer Sciences Research Group Department of Sociology University of Survey Guildford GU2 5XH United Kingdom Department of Sociology University of Surrey Guildford GU2 5XH United Kingdom Rank Xerox Cambridge EuroPARC Cambridge CB2 1AB 61 Regent Street United Kingdom

This paper considers a range of theoretical approaches to the understanding of organisations and the implications these views have for the design of computer supported cooperative work systems. Organisations have often been seen as structures which can be divided into hierarchically ordered parts or as networks of informal relations. Organisational theorists have also considered organisations to resemble organisms with needs for survival in potentially hostile environments or as information processors, with decision-making as their most important characteristic. More recently, developments in the social sciences have suggested that radical reconceptualisations are necessary for the study of work settings. Consequently, these developments have attracted attention due to their potential to inform system design. This paper reviews some of these efforts and comments on some of the outstanding problems that have to be overcome if studies of everyday work settings are to inform the design of systems to support collaborative work. © 1992 Kluwer Academic Publishers.

关键词： CSCW Ethnography Ethnomethodology Organisations Social Science

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Weakest specifunctions for BSP

引用

Parallel Processing Letters 2001年第4期11卷 439-454页

作者： Chen, Yifeng Sanders, J.W. Department of Maths and Computer Science University of Leicester University Road Leicester LE1 7RH United Kingdom Programming Research Group Oxford University Computing Laboratory Parks Road Oxford OX1 3QD United Kingdom

This paper introduces a calculus of weakest specification for supporting reuse of established components in deriving a design (in the sense of formal methods). The weakest specifunction generalizes the notions of weakest pre-specification and weakest parallel environment;but instead of calculating the weakest required component of a target specification, it calculates the weakest specification function whose value refines the target when applied to an established component. In particular it overcomes the restriction of those other calculi to taking merely one required component at a time. The theory of specifunctions is applied to a new weakest-design calculus in the context of BSP. The calculus is based on the par-seq specifunction which involves two required components: it places one established component in parallel with one required component and the result in sequence with another required component to meet a given specification. A calculus is provided for the par-seq specifunction and it is applied to the derivation of a distributed BSP algorithm for greatest common divisor.

关键词： Parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Machine intelligibility and the duality principle

British Telecom technology journal

引用

British Telecom technology journal 1996年第4期14卷 15-23页

作者： Muggleton, S. Michie, D. Wolfson College Oxford United Kingdom University of Tokyo Turing Institute Glasgow United Kingdom Intelligent Systems Research Group BT Laboratories Inductive Logic Programming Oxford University Press Logic Programming ILP Oxford Univ. Computing Laboratory University of Edinburgh Royal Society of Edinburgh British Computer Society

Lack of machine intelligibility in human/computer interactions can be traced to present approaches in software design. From the duality principle, software involved in human/computer software interaction contains two distinct layers, a declarative knowledge-level layer and a lower-level functional or procedural-knowledge layer. The former supports simple deductive and inductive inferences and can be used to facilitate human-comprehensible communication between programs, while the latter is composed of normal procedurally encoded computer programs. The duality principle in software design is necessary in dealing with the demands of wide-scale computer usage in the information age and an urgent goal for computer science research.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Implementation lessons of performance prediction tool for parallel conservative simulation 6

引用

6th International European Conference on Parallel computing, Euro-Par 2000

作者： Lim, Chu-Cheow Low, Yoke-Hean Gan, Boon-Ping Cai, Wentong Intel Corporation SC12-305 2000 Mission College Blvd Santa ClaraCA95052-8119 United States Programming Research Group Oxford University Computing Laboratory University of Oxford OxfordOX1 3QD United Kingdom Gintic Institute of Manufacturing Technology 71 Nanyang Drive Singapore638075 Singapore Center for Advanced Information Systems School of Applied Science Nanyang Technological University Singapore639798 Singapore

ISBN: (纸本)9783540679561

Performance prediction is useful in helping parallel programmers answer questions such as speedup scalability. Performance prediction for parallel simulation requires first working out the performance analyzer algorithms for specific simulation protocols. In order for the prediction results to be close to the results from actual parallel executions, there are further considerations when implementing the analyzer. These include (a) equivalence of code between the sequential program and parallel program, and (b) system effects (e.g. cache miss rates and synchronization overheads in an actual parallel execution). This paper describes our investigations into these issues on a performance analyzer for a conservative, "super-step" (synchronous) simulation protocol. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Formal Methods and Software Safety

引用

IFAC Proceedings Volumes 1992年第30期25卷 93-98页

作者： J.P. Bowen V. Stavridou Oxford University Computing Laboratory Programming Research Group 11 Keble Road Oxford OX1 3QD UK Department of Computer Science Royal Holloway and Bedford New College University of London Egham Hill Egham Surrey TW20 0EX UK

The safety of software is becoming increasingly important as computers pervade control systems on which human life depends. Whilst hardware has become significantly more reliable over the years, the same cannot be said of software. This has become more complex and methods to ensure its correctness have been slow in development. One approach is to mathematically verify software in such systems. This paper investigates the industrial use of these techniques, their advantages and disadvantages, and the introduction of standards and their recommendations concerning formal methods in this area. The cost of safety is also considered.

关键词： Safety reliability system integrity standards education digital systems computer software formal languages industrial control software engineering

来源：评论

学校读者我要写书评

暂无评论

Scientific Data Lake for High Luminosity LHC project and other data-intensive particle and astro-particle physics experiments 5

Scientific Data Lake for High Luminosity LHC project and oth...

引用

5th International Conference on Particle Physics and Astrophysics, ICPPA 2020

作者： Alekseev, A. Kiryanov, A. Klimentov, A. Korchuganova, T. Mitsyn, V. Oleynik, D. Smirnov, A. Smirnov, S. Zarochentsev, A. Compiler Technology Department Ivannikov Institute for System Programming of the Ras Moscow109004 Russia Cloud Technologies and Big Data Analytics Laboratory Plekhanov Russian University of Economics Moscow117997 Russia Atlas Group Universidad Andres Bello Santiago7550196 Chile Department of Computing Resources and Technologies Nrc "kurchatov Institute"-PNPI Gatchina188300 Russia Physics Department Brookhaven National Laboratory UptonNY11973 United States Laboratory of Information Technologies Joint Institute for Nuclear Research Dubna141980 Russia Institute of Nuclear Physics and Engineering National Research Nuclear University MEPhI Moscow115409 Russia Laboratory of Ultra-High Energy Physics Saint Petersburg State University Saint Petersburg198504 Russia

The next phase of LHC Operations-High Luminosity LHC (HL-LHC), which is aimed at ten-fold increase in the luminosity of proton-proton collisions at the energy of 14 TeV, is expected to start operation in 2027-2028 and will deliver an unprecedented scientific data volume of multi-exabyte scale. This amount of data has to be stored and the corresponding storage system should ensure fast and reliable data delivery for processing by scientific groups distributed all over the world. The present LHC computing and data processing model will not be able to provide the required infrastructure growth even taking into account the expected hardware technology evolution. To address this challenge the new state-of-The-Art computing infrastructure technologies are now being developed and are presented here. The possibilities of application of the HL-LHC distributed data handling technique for other particle and astro-particle physics experiments dealing with large-scale data volumes like DUNE, LSST, Belle-II, JUNO, SKAO etc. are also discussed. © Published under licence by IOP Publishing Ltd.

关键词： Luminance

来源：评论

学校读者我要写书评

暂无评论

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:

关键词：

来源：评论

学校读者我要写书评

暂无评论

PRAM programming: in theory and in practice

引用

Concurrency and Computation: Practice and Experience 2000年第4期12卷

作者： D. S. Lecomber C. J. Siniolakis K. R. Sujithan Programming Research Group Oxford University Computing Laboratory Oxford OX1 3QD U.K.

That the influence of the PRAM model is ubiquitous in parallel algorithm design is as clear as the fact that it is technologically infeasible for the forseeable future. The current generation of parallel hardware prominently features distributed memory and high-performance interconnection networks—very much the antithesis of the shared memory required for the PRAM model. It has been shown that, in spite of communication costs, for some problems very fast parallel algorithms are available for distributed-memory machines—from embarassingly parallel problems to sorting and numerical analysis. In contrast it is known that for other classes of problem PRAM-style shared-memory simulation on a distributed-memory machine can, in theory, produce solutions of comparable performance to the best possible for such architectures. The Bulk Synchronous Parallel (BSP) model accurately represents most parallel machines—theoretical and actual—in an execution and cost model. We introduce a scalable portable PRAM realization appropriate for BSP computers and a methodology for usage. Our system is fast and built upon the familiar sequential C++ coupled with the new standard BSP library of parallel computation and communication primitives. It is portable to and predictable on a vast number of parallel computers including workstation clusters, a 256-processor Cray T3D, an 8-node IBM SP/2 and a 4-node shared-memory SGI Power Challenge machine. Our approach achieves simplicity of programming over direct-mode BSP programming for reasonable overhead cost. We objectively compare optimized BSP and PRAM algorithms implemented with our C++ PRAM library and provide encouraging experimental results for our new style of programming. Copyright © 2000 John Wiley & Sons, Ltd.

关键词： PRAM latency hiding BSP distributed memory simulation parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Preface

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 1993年 670 LNCS卷

作者： Woodcock, James C. P. Oxford University Computing Laboratory Programming Research Group 11 Keble Road OxfordOX1 3QD United Kingdom

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：