Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences最新文献_第10页

Hypermedia EIS and the World Wide Web 超媒体EIS和万维网

Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences Pub Date : 1995-01-04 DOI: 10.1109/HICSS.1995.375566

G. Masaki, J. Walls, J. Stockman

引用次数: 1

Beyond convexity: scanning 'non-convex polyhedra' 超越凸性:扫描“非凸多面体”

Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences Pub Date : 1995-01-04 DOI: 10.1109/HICSS.1995.375475

Z. Chamski

引用次数: 1

Automatic data and computation decomposition for distributed memory machines 分布式存储机器的自动数据和计算分解

Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences Pub Date : 1995-01-04 DOI: 10.1109/HICSS.1995.375472

Q. Ning, G. Gao

{"title":"Automatic data and computation decomposition for distributed memory machines","authors":"Q. Ning, G. Gao","doi":"10.1109/HICSS.1995.375472","DOIUrl":"https://doi.org/10.1109/HICSS.1995.375472","url":null,"abstract":"We have developed an automatic compile-time computation and data decomposition technique for distributed memory machines. Our method can handle complex programs containing perfect and nonperfect loop nests with or without loop-carried dependences. Applying our decomposition algorithms, a program is divided into collections (called clusters) of loop nests, such that data redistributions are allowed only between the clusters. Within each cluster of loop nests, decomposition and data locality constraints are formulated as a system of homogeneous linear equations which is solved by polynomial time algorithms. Our algorithm can selectively relax data locality constraints within a cluster to achieve a balance between parallelism and data locality. Such relaxations are guided by exploiting the hierarchical program nesting structures from outer to inner nesting levels to keep the communications at an outer-most level possible. This work is central to the on-going compiler development effort under the EPPP (Environment for Portable Parallel Programming) project. A brief discussion of the current implementation is included.<<ETX>>","PeriodicalId":433759,"journal":{"name":"Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124786879","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}

引用次数: 24

Business experience with computer integrated manufacturing. A survey of current strategy and practice 有计算机集成制造业务经验。对当前战略和实践的调查

Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences Pub Date : 1995-01-04 DOI: 10.1109/HICSS.1995.375650

John Johansen, U. Karmarkar, Dhananjay Nanda, Abraham Seidmann

{"title":"Business experience with computer integrated manufacturing. A survey of current strategy and practice","authors":"John Johansen, U. Karmarkar, Dhananjay Nanda, Abraham Seidmann","doi":"10.1109/HICSS.1995.375650","DOIUrl":"https://doi.org/10.1109/HICSS.1995.375650","url":null,"abstract":"The paper describes the results of a recent field study of CIM adoption strategies in US manufacturing firms. The purpose of the study was to identify the extent to which CIM technologies are in use in US firms, the impact of a facility's process characteristics on the CIM development process, and the adoption policy being followed implicitly or explicitly. The survey focused on the following aspects:(a) manufacturing process characteristics, (b) the CIM development process, (c) the CIM architecture, and (d) perceived value and benefits. Our results indicate that CIM implementations follow a definite temporal pattern with respect to the adoption of certain information technologies. In addition, the initiative for CIM programs is usually generated from the bottom-up. This gradual bottom-up approach appears to restrain, rather than enable, plant-wide integration for critical business processes such as order fulfilment or product development. While most CIM users find that their CIM projects successfully meet their initial operational goals, the technology seems to be poorly integrated still. More crucially, it appears that CIM is not being adopted as a strategic information system for competitive missions.<<ETX>>","PeriodicalId":433759,"journal":{"name":"Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131313290","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}

引用次数: 42

Improving continuous improvement with CATeam: lessons from a longitudinal case study 与catteam一起改进持续改进:来自纵向案例研究的经验教训

Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences Pub Date : 1995-01-04 DOI: 10.1109/HICSS.1995.375729

Volker Barent, H. Krcmar, H. Lewe, G. Schwabe

引用次数: 12

Quickest paths: parallelization and dynamization 最快的路径:并行化和动态化

Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences Pub Date : 1995-01-04 DOI: 10.1109/HICSS.1995.375479

D. Kagaris, S. Tragoudas, G. Pantziou, Christos D. Zaroliagis

{"title":"Quickest paths: parallelization and dynamization","authors":"D. Kagaris, S. Tragoudas, G. Pantziou, Christos D. Zaroliagis","doi":"10.1109/HICSS.1995.375479","DOIUrl":"https://doi.org/10.1109/HICSS.1995.375479","url":null,"abstract":"Let N=(V,E,c,l) be a network, where G=(V,E) is a directed graph (|V|=n and |E|=m), c(e)>0 is the capacity and l(e)/spl ges/0 is the lead time for each edge e/spl isin/E. The transmission time to send /spl sigma/ units of data from a given source s to a destination t using path p is T(/spl sigma/,p) = l(p) + /spl sigma//c(p), where l(p) is the sum of the lead times of the edges in p, and c(p) is the minimum capacity of the edges in p. The quickest path problem is to find a path of minimum transmission time to transmit the /spl sigma/ units of data from s to t. The problem has applications to fast data transmissions in communication networks. We present parallel algorithms for solving the quickest path problem in the case where the network is sparse [i.e. m=O(n)]. We also give algorithms for solving the dynamic quickest path problem. In this problem, the network, the lead times and the capacities on its edges, as well as the amount of data to be transmitted, change over time. The goal is to build a data structure so that one can very quickly compute the quickest path to transmit a given amount of data from any node s to any node t and also, after a dynamic change (edge lead time or edge capacity modification, or edge deletion) on the input network, to be able to update the data structure in an appropriately short time. Furthermore, we improve upon the best sequential result for the single pair quickest path problem which needs O(rm+rn log n) time, where r is the number of distinct edge capacities.<<ETX>>","PeriodicalId":433759,"journal":{"name":"Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125263085","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

Innovation in business processes-a discussion of research methods to study the process of innovation 业务流程中的创新——创新过程研究方法探讨

Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences Pub Date : 1995-01-04 DOI: 10.1109/HICSS.1995.375691

Arne Henne, Eva M. Møller

引用次数: 2

TriGS/sub flow/: Active object-oriented workflow management TriGS/ subflow /:活动的面向对象工作流管理

Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences Pub Date : 1995-01-04 DOI: 10.1109/HICSS.1995.375484

G. Kappel, B. Pröll, S. Rausch-Schott, W. Retschitzegger

引用次数: 12

Social loafing in electronic brainstorming: invoking social comparison through technology and facilitation techniques to improve group productivity 电子头脑风暴中的社会闲散:通过技术和促进技术调用社会比较来提高群体生产力

Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences Pub Date : 1995-01-04 DOI: 10.1109/HICSS.1995.375697

Morgen M. Sherpherd, R. Briggs, B. Reinig, Jerome Yen

引用次数: 23

Intervals and the deduction of drug binding site models 时间间隔和药物结合位点模型的推导

Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences Pub Date : 1995-01-04 DOI: 10.1109/HICSS.1995.375332

G. Crippen

引用次数: 8