发布求助
文献互助 智能选刊 最新文献

Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences最新文献

筛选
英文 中文
Object-oriented design of an expandable hardware description language analyzer for a high-level synthesis system 面向对象的高级综合系统可扩展硬件描述语言分析器设计
Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences Pub Date : 1992-01-07 DOI: 10.1109/HICSS.1992.183267
L. B. Yang, M. Perkowski, D. Smith
{"title":"Object-oriented design of an expandable hardware description language analyzer for a high-level synthesis system","authors":"L. B. Yang, M. Perkowski, D. Smith","doi":"10.1109/HICSS.1992.183267","DOIUrl":"https://doi.org/10.1109/HICSS.1992.183267","url":null,"abstract":"The paper presents a new approach to high-level synthesis system design in which object-oriented programming techniques are used to construct an expansible hardware description language (HDL) analyzer. There are several major advantages of this new methodology over the traditional top-down approaches. The object-oriented data model for high-level synthesis systems is shown to be a better way to model the high-level synthesis design entities. A formal object oriented programming(OOP) model of high-level synthesis and systematic ways of expanding the system are also described. This design style influences the construction of the entire high-level synthesis system. The system has been successfully implemented in C++ and has proven to be reliable, expansible, and sufficiently fast.<<ETX>>","PeriodicalId":103288,"journal":{"name":"Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131874876","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Integration strategies in Pegasus object oriented multidatabase system Pegasus面向对象多数据库系统的集成策略
Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences Pub Date : 1992-01-07 DOI: 10.1109/HICSS.1992.183245
A. Rafii, R. Ahmed, M. Ketabchi, P. Desmedt, W. Du
{"title":"Integration strategies in Pegasus object oriented multidatabase system","authors":"A. Rafii, R. Ahmed, M. Ketabchi, P. Desmedt, W. Du","doi":"10.1109/HICSS.1992.183245","DOIUrl":"https://doi.org/10.1109/HICSS.1992.183245","url":null,"abstract":"The paper identifies various problems in integrating schema, data and methods in heterogeneous systems and describes the strategies used in Pegasus to deal with them. Pegasus is an object-oriented multidatabase system that is being developed at Hewlett-Packard Laboratories. The goal of the first running prototype is to provide facilities for multidatabase applications to access and manipulate multiple autonomous heterogeneous object-oriented and relational databases. Pegasus provides both type and procedural abstractions to support integration. Type abstraction is used to organize objects from multiple databases in categories that are related by having some common properties. The common properties of objects in different databases may be in incompatible forms or in inconsistent states. The system provides procedural abstraction that enables the schema integrator to develop arbitrary mappings between data from different sources and to write necessary transformations to convert object properties to a common form. Because of the importance of existing relational databases, some important integration techniques are demonstrated through the object-oriented views over SQL databases.<<ETX>>","PeriodicalId":103288,"journal":{"name":"Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115542589","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Using BVL correlation to validate the effectiveness of an interorganizational system: analysis and statistical modeling 利用BVL相关性来验证组织间系统的有效性:分析和统计建模
Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences Pub Date : 1992-01-07 DOI: 10.1109/HICSS.1992.183368
J. Bouška, S. Guthrie, K. Valiquette, N. Oak, W. Wehrs
{"title":"Using BVL correlation to validate the effectiveness of an interorganizational system: analysis and statistical modeling","authors":"J. Bouška, S. Guthrie, K. Valiquette, N. Oak, W. Wehrs","doi":"10.1109/HICSS.1992.183368","DOIUrl":"https://doi.org/10.1109/HICSS.1992.183368","url":null,"abstract":"The paper presents the initial stages in an empirical study assessing the effectiveness of an interorganizational information system. The evaluation problem is to validate value benefits to the investing organization that are recaptured from primary effects on customers. Business Value Linkage (BVL) correlation, a statistical evaluation methodology, is employed. Since the data set includes unique information on customer use of the system, the statistical model is specified to examine the effects of variation in IT input measurement on the estimation results. The value linkage to be analyzed promises to allow for both stages of the BVL methodology. If the first stage in the linkage is validated, a parallel study may be employed to determine revenue effects.<<ETX>>","PeriodicalId":103288,"journal":{"name":"Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114159888","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Better group decisions: using knowledge acquisition techniques to build richer decision models 更好的群体决策:使用知识获取技术构建更丰富的决策模型
Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences Pub Date : 1992-01-07 DOI: 10.1109/HICSS.1992.183406
J. Boose, J. Bradshaw, J. Koszarek, D. B. Shema
{"title":"Better group decisions: using knowledge acquisition techniques to build richer decision models","authors":"J. Boose, J. Bradshaw, J. Koszarek, D. B. Shema","doi":"10.1109/HICSS.1992.183406","DOIUrl":"https://doi.org/10.1109/HICSS.1992.183406","url":null,"abstract":"Existing group decision support systems used in meeting rooms can help teams reach decisions quickly and efficiently. However, the decision models used by these systems are inadequate for many types of problems. The authors describe their laboratory's experience with knowledge acquisition systems and decision support tools. Their studies led them to develop a comprehensive decision model for group decision support systems. This model combines current brainstorming-oriented methods, structured text argumentation (using the gIBIS model), repertory grids, possibility tables (morphological charts), and influence diagrams from decision analysis. Each component addresses weaknesses in current group decision support systems. The authors are assembling these components together into a group decision support workbench.<<ETX>>","PeriodicalId":103288,"journal":{"name":"Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114767098","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 14
Minimum message length encoding, evolutionary trees and multiple-alignment 最小消息长度编码，进化树和多重对齐
Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences Pub Date : 1992-01-07 DOI: 10.1109/HICSS.1992.183219
L. Allison, C. S. Wallace, C. N. Yee
{"title":"Minimum message length encoding, evolutionary trees and multiple-alignment","authors":"L. Allison, C. S. Wallace, C. N. Yee","doi":"10.1109/HICSS.1992.183219","DOIUrl":"https://doi.org/10.1109/HICSS.1992.183219","url":null,"abstract":"A method of Bayesian inference known as minimum message length encoding is applied to the inference of an evolutionary-tree and to multiple-alignment for k>or=2 strings. It allows the posterior odds-ratio of two competing hypotheses, for example two trees, to be calculated. A tree that is a good hypothesis forms the basis of a short message describing the strings. The mutation process is modelled by a finite-state machine. It is seen that tree inference and multiple-alignment are intimately connected.<<ETX>>","PeriodicalId":103288,"journal":{"name":"Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117264793","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 23
Using influence diagrams for representing organizational and political factors in information system design 利用影响图表示信息系统设计中的组织和政治因素
Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences Pub Date : 1992-01-07 DOI: 10.1109/HICSS.1992.183512
M. Serva, J. Cooprider, R. Lee
{"title":"Using influence diagrams for representing organizational and political factors in information system design","authors":"M. Serva, J. Cooprider, R. Lee","doi":"10.1109/HICSS.1992.183512","DOIUrl":"https://doi.org/10.1109/HICSS.1992.183512","url":null,"abstract":"Many of the problems in systems development have been caused by the lack of consideration for organizational and political factors. This paper proposes the use of a three-level methodology for representing organizational and political factors in information systems design through the use of influence diagrams. The methodology breaks down the representation into the three levels: communication, probability, and computation. A prototype system was developed to facilitate influence diagram calculations. The proposed framework should facilitate communication between designers and domain experts, identify factors that hinder successful system implementation, and provide a measure for system success.<<ETX>>","PeriodicalId":103288,"journal":{"name":"Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences","volume":"258 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123075950","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Persistence+undoability=transactions 持久性+ undoability =交易
Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences Pub Date : 1992-01-07 DOI: 10.1109/HICSS.1992.183335
S. Nettles, Jeannette M. Wing
{"title":"Persistence+undoability=transactions","authors":"S. Nettles, Jeannette M. Wing","doi":"10.1109/HICSS.1992.183335","DOIUrl":"https://doi.org/10.1109/HICSS.1992.183335","url":null,"abstract":"Persistence means objects live potentially forever. Undoability means that any change to a program's store can potentially be undone. In their design and implementation of support for single-threaded nested transactions in Standard ML of New Jersey (SML/NJ), the authors provide persistence and undoability as orthogonal features and combine them in a simple and elegant manner. They provide support for persistence through an SML interface that lets users manipulate a set of persistent roots and provides a save function that causes all data reachable from the persistent roots to be moved into the persistent heap. They provide support for undoability through an SML interface that exports two functions: checkpoint, which checkpoints the current store, and restore, which undoes all changes made to the previously checkpointed store. Finally, they succinctly define a higher-order function transact completely in terms of the interfaces for persistence and undoability.<<ETX>>","PeriodicalId":103288,"journal":{"name":"Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122551686","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 30
Traffic patterns in a scalable multiprocessor through transputer emulation 可扩展多处理器中通过转发器仿真的流量模式
Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences Pub Date : 1992-01-07 DOI: 10.1109/HICSS.1992.183173
S. Raina, Dhd Warren
{"title":"Traffic patterns in a scalable multiprocessor through transputer emulation","authors":"S. Raina, Dhd Warren","doi":"10.1109/HICSS.1992.183173","DOIUrl":"https://doi.org/10.1109/HICSS.1992.183173","url":null,"abstract":"The authors present a multiprocessor emulator designed to evaluate a scalable shared virtual memory architecture called the Data Diffusion Machine (DDM). The DDM is characterised by the lack of any fixed home location for data, with the virtual address being completely decoupled from the physical location of a datum. The authors describe the design of the emulator for the DDM and its transputer-based implementation. The emulator provides a flexible platform for evaluating the architecture and enables one to study the overall behaviour of the machine while running real, lace shared-memory applications. They present a profile of traffic observed at the controllers in the DDM hierarchy while running a variety of real shared-memory applications.<<ETX>>","PeriodicalId":103288,"journal":{"name":"Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123920896","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
An approach to dynamic software cache consistency maintenance based on conditional invalidation 一种基于条件失效的动态软件缓存一致性维护方法
Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences Pub Date : 1992-01-07 DOI: 10.1109/HICSS.1992.183195
I. Tartalja, V. Milutinovic
{"title":"An approach to dynamic software cache consistency maintenance based on conditional invalidation","authors":"I. Tartalja, V. Milutinovic","doi":"10.1109/HICSS.1992.183195","DOIUrl":"https://doi.org/10.1109/HICSS.1992.183195","url":null,"abstract":"Introduces a class of software protocols for the maintenance of cache consistency in multiprocessors with shared main memory and private caches. These protocols are designed to be built into the operating system primitives for mutual exclusion. The approach is based on a dynamic decision about invalidation of the shared segment copy residing in the private cache, at the moment of entering into the appropriate critical region. The authors gradually introduce three consistency schemes.<<ETX>>","PeriodicalId":103288,"journal":{"name":"Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126295497","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Constraint checking for circular restriction site mapping (DNA) 环状限制性内切位点映射(DNA)的约束检查
Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences Pub Date : 1992-01-07 DOI: 10.1109/HICSS.1992.183216
T. Dix, C. Ho-Stuart
{"title":"Constraint checking for circular restriction site mapping (DNA)","authors":"T. Dix, C. Ho-Stuart","doi":"10.1109/HICSS.1992.183216","DOIUrl":"https://doi.org/10.1109/HICSS.1992.183216","url":null,"abstract":"Computationally, constraint checking for circular restriction site maps is considerably more difficult than for linear maps. The authors consider complete single and double digestions of plasmids, circular DNA molecules. To allow for experimental error in fragment measurements, a range is specified for each fragment length. The authors find exactly those solutions that satisfy the discrete constraints of the date. For sites s/sub i/ and s/sub j/ they consider linear inequalities in either of the forms L/sub ij/<or=s/sub j/-s/sub i/<or=H/sub ij/ or L/sub ij/<or=c-(s/sub j/-s/sub i/)<or=H/sub ij/ where s/sub i/<s/sub j/, the measured fragment is in the range (L/sub ij/,H/sub ij/) and c is the length of the map. For consistent inequalities, minimum ranges for fragments are found. Otherwise inconsistent inequalities are detected.<<ETX>>","PeriodicalId":103288,"journal":{"name":"Proceedings of the Twenty-Fifth Hawaii International Conference on System Sciences","volume":"i 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129672808","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信