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

Annual Hawaii International Conference on System sciences (HICSS)

作者： S.M. Kaplan G. Fitzpatrick T. Mansfield W.J. Tolone Department of Computer Science University of Illinois Urbana-Champaign USA CRC for Distributed Systems Technology University of Queensland Australia Australia

The wOrlds project is concerned with developing next generation collaboration frameworks. We strongly believe that real progress in enhancing the usability of collaborative systems hinges on improving our understanding of work, and applying the resulting insights to development of collaborative work support frameworks. We are investigating the thesis that appropriate bases for such an approach can be drawn from existing results in sociology, specifically the work of sociologist Anselm Strauss, and his notion of social worlds (A. Strauss, 1993). We motivate and overview wOrlds, the collaborative environment we have built in order to explore our ideas and insights. We then critique wOrlds (and by implication, the class of systems known as MUDs of which it is a member), and point to future directions for investigation.

关键词： Collaborative work Multiuser detection computer science Space technology Usability Fasteners Sociology Collaborative tools Cultural differences computer graphics

来源：评论

学校读者我要写书评

暂无评论

Describing open distributed systems: a foundation

Describing open distributed systems: a foundation

引用

Annual Hawaii International Conference on System sciences (HICSS)

作者： A. Rakotonirainy A. Berry S. Crawley Z. Milosesevic CRC for Distributed Systems Technology University of Queensland QLD Australia Department of Computer Science University of Queensland QLD Australia Defence Science and Technology Organisation Salisbury SA Australia

Outlines a semantic model for open distributed systems which provides a foundation for a corresponding architecture description language. This semantic model is based on architecture models reported by Berry et al. (1995) and in ISO/IEC 10746 (ODP), with a number of refinements to support abstraction and composition. The model is specifically designed to describe open distributed systems independent of implementation details such as communication protocols and middleware systems. The modelling concepts in the semantic model are: object (a model of an entity), event (a unit of interaction between an object and its environment), event relationship (a specification of behaviour defining the relationships amongst a set of events), interface (an abstraction of an object's interaction with its environment) and binding (a context for interaction between objects). The binding concept is particularly important because it can describe any kind of interaction in an open distributed system, ranging from remote procedure calls and multicasting to more complex, enterprise interactions. Special attention is given to the problem of composition and abstraction of events and behaviour in the model. This is needed to reflect the reuse, evolution and interworking requirements of open distributed systems. Our approach allows for the effective modelling of asynchrony, concurrency and complex flows of information in open distributed systems.

关键词： Power system modeling Middleware Architecture description languages Protocols Context modeling computer science Concurrent computing Multimedia systems World Wide Web Java

来源：评论

学校读者我要写书评

暂无评论

Banyan: a language for scalable parallel programming on loosely coupled distributed systems

Banyan: a language for scalable parallel programming on loos...

引用

International Conference on High Performance Computing in the Asia-Pacific Region

作者： D. Janaki Ram M.V. Sudhakiran T.N. Srikanta Distributed and Object Systems Group Department of Computer Science and Engineering Indian Institute of Technology Chennai India

Parallel programming on loosely coupled distributed systems is becoming a viable approach with the rapid increase in network speeds and availability of large amounts of unused CPU capacity on individual workstations. Parallel programs are often written for a specific configuration of the distributed system such as the number of nodes, their relative speeds and their network connections. These programs perform poorly when there is a change in the configuration or when they are taken to a system other than what they are intended for. We propose a new paradigm which can express the scale of a program as a part of the program itself. The scale of the program is specified in an abstract manner for an arbitrary number of nodes, their relative speeds and their network connections. The runtime system uses this information to decide the actual scale of program on a given distributed system.

关键词： Parallel programming Workstations Writing Runtime Concurrent computing computer science Availability computer networks Communication networks computer architecture

来源：评论

学校读者我要写书评

暂无评论

PolyConstraints: a design pattern for flexible collaboration in heterogeneous mobile environments

PolyConstraints: a design pattern for flexible collaboration...

引用

technology of Object-Oriented Languages and systems (TOOLS)

作者： A. Pasala D.J. Ram Distributed & Object Systems Group Department of Computer Science and Engineering Indian Institute of Technology Chennai India

In mobile collaborative applications, collaborating agents can move across heterogeneous networks. The collaborating agents also keep changing their roles depending on the work to be performed at that time. In such situations, a simple and flexible handling of the transition between heterogeneous environments and roles is required. This paper proposes PolyConstraints, a design pattern to handle the generic problem of transitions across multiple network environments and roles.

关键词： Collaboration Object oriented modeling Wireless LAN Mobile computing Collaborative work Vehicles Context modeling Local area networks Error analysis Wide area networks

来源：评论

学校读者我要写书评

暂无评论

An extended transaction to maintain consistency and recovery in multidatabase systems

引用

INFORMATION scienceS 1996年第1-4期90卷 19-38页

作者： Rajapakse, J Orlowska, ME Distributed Systems Technology Centre Department of Computer Science The University of Queensland Qld 4072 Australia

A complete practical solution to transaction management preserving multidatabase consistency in the presence of multidatabase updates and failures is presented. The approach developed does not require support for the two-phase commit (2PC) protocol in the participating local database management systems (LDBMSs). Furthermore, it does not violate local autonomy;the source code of the LDBMSs is not modified in any way and the multidatabase system (MDBS) does not access or modify any control information of the LDBMS. The principles of the 2PC protocol in the process of global transaction commitment are adopted. The presented method does not rely on any specific concurrency control mechanism for LDBMSs. Consideration is given to global transaction failures due to subtransaction aborts by the LDBMSs and local site crashes. The recovery process is based on undo operations. While a global transaction is in progress, the tables accessed by subtransactions of this transaction at each local site are locked using specially initiated table locks. These locks are stored and maintained in the local database itself as control tables. The approach taken is easy to implement, and its limitations are discussed.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Genetic algorithms in constrained optimization

引用

MATHEMATICAL AND computer MODELLING 1996年第5期23卷 87-111页

作者： Reid, DJ Distributed Systems Technology Centre Department of Computer Science The University of Queensland St. Lucia Queensland 4072 Australia

The behavior of the two-point crossover operator, on candidate solutions to an optimization problem that is restricted to integer values and by some set of constraints, is investigated theoretically. This leads to the development of new genetic operators for the case in which the constraint system is linear. The computational difficulty asserted by many optimization problems has lead to exploration of a class of randomized algorithms based on biological adaption. The considerable interest that surrounds these evolutionary algorithms is largely centered on problems that have defied satisfactory illation by traditional means because of badly behaved or noisy objective functions, high dimensionality, or intractable algorithmic complexity. Under such conditions, these alternative methods have often proved invaluable. Despite their attraction, the applicability of evolutionary algorithms has been limited by a deficiency of general techniques to manage constraints, and the difficulty is compounded when the decision variables are discrete. Several new genetic operators are presented here that are guaranteed to preserve the feasibility of discrete aspirant solutions with respect to a system of linear constraints. To avoid performance degradation as the probability of finding a feasible and meaningful information exchange between two candidate solutions decreases, relaxations of the modified genetic crossover operator are also proposed. The effective utilization of these also suggests a manipulation of the genetic algorithm itself, in which the population is evanescently permitted to grow beyond its normal size.

关键词： discrete optimization genetic algorithm linear constraints

来源：评论

学校读者我要写书评

暂无评论

Fault-tolerant logarithmic mutual exclusion with lazy update propagation

引用

INFORMATION scienceS 1996年第3-4期91卷 193-210页

作者： Truffet, D Orlowska, ME Distributed Systems Technology Centre Department of Computer Science The University of Queensland St. Lucia Queensland 4072 Australia

The problem of managing replicated copies of data in a distributed system has received a lot of attention. Both token-passing and quorum consensus methods for managing replicated data have their drawbacks. Token-based solutions, although being able to manage the concurrence with very low overheads, suffer in both reliability and concurrence due to the fact that there only exists a single token. However, although quorum-based protocols can provide higher levels of reliability by committing updates to a set of nodes, as well as being able to provide for concurrence in the form of reads, they do this at costs at orders of magnitude greater than that of token-passing algorithms. In this paper, we present a protocol that can be seen as ''multitoken'' or ''dynamic quorum,'' which uses aspects of both token-passing and quorum-based protocols to provide not only the reliability and concurrence provided by quorum-based protocols, but at the cost of a token-based protocol.

关键词： Network protocols

来源：评论

学校读者我要写书评

暂无评论

Behaviour sharing in adaptable user interfaces 6

Behaviour sharing in adaptable user interfaces

引用

6th Australian Conference on computer-Human Interaction, OzCHI 1996

作者： Wing, Hung Colomb, R.M. Deartment of Computer Science Queensland University CRC for Distributed Systems Technology BrisbaneQLD4072 Australia

ISBN: (纸本)081867525X

The practical contribution of this research is to remove the UI behavioural conflicts existing in a compound software environment. From the user point of view, editing text in a spreadsheet cell should not be any different from editing text in a text editor or any other integrated software package. However this is not always the case since different UI applications may inherit different UI techniques and behaviours. In this paper, an extended object-oriented model and Documentary Petri Net (DPN) are used to model an 'adaptable user interface' system. In doing so, rule-bases can be added to the DPN model allowing automatic reasoning about the user interface behaviours. Furthermore, formal properties of UI behaviours such as 'liveness' and 'boundedness' can be analyzed by using algorithms based on the formal properties of Petri Nets. © 1996 IEEE.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

Behaviour sharing in adaptable user interfaces

Behaviour sharing in adaptable user interfaces

引用

Australasian Conference on computer Human Interaction

作者： Hung Wing R.M. Colomb CRC for Distributed Systems Technology Department of Computer Science University of Queensland Brisbane QLD Australia

关键词： User interfaces Object oriented modeling Collaboration Cyclic redundancy check computer science Algorithm design and analysis Petri nets Lattices Garnets Electronic commerce

来源：评论

学校读者我要写书评

暂无评论

A CASE for electronic documentary dossier

A CASE for electronic documentary dossier

引用

Australasian Conference on computer Human Interaction

作者： Hung Wing R.M. Colomb CRC for Distributed Systems Technology Department of Computer Science University of Queensland Brisbane QLD Australia

This paper proposes a graphical UI, a CASE tool, for the purpose of specifying and representing trade information, common in electronic commerce. The semantic and structural information associated with trade instances can be extremely complex. Far example, the formal property of Petri nets can be used to represent the different traders' roles or to identify the various trade procedures that will lead to deadlock situations. A simple and intuitive graphical user interface that can represent and characterize the organization of the trade documents is therefore considered useful in facilitating electronic commerce.

关键词： computer aided software engineering Electronic commerce Object oriented modeling Cyclic redundancy check computer science Petri nets System recovery Visualization Collaboration Government

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：