Proceedings., Fourteenth Annual International Computer Software and Applications Conference最新文献_第3页

On transforming Petri net model to Moore machine Petri网模型向摩尔机的转换

Proceedings., Fourteenth Annual International Computer Software and Applications Conference Pub Date : 1990-10-31 DOI: 10.1109/CMPSAC.1990.139365

Carl K. Chang, Hsuanwei Huang

引用次数: 4

Neural network application to container number recognition 神经网络在箱号识别中的应用

Proceedings., Fourteenth Annual International Computer Software and Applications Conference Pub Date : 1990-10-31 DOI: 10.1109/CMPSAC.1990.139350

H. Lui, Chung-Mong Lee, Fang Gao

引用次数: 7

Performance of multiversion concurrency control algorithms in maintaining temporal consistency 多版本并发控制算法在保持时间一致性方面的性能

Proceedings., Fourteenth Annual International Computer Software and Applications Conference Pub Date : 1990-10-31 DOI: 10.1109/CMPSAC.1990.139341

Xiaohui Song, J. Liu

{"title":"Performance of multiversion concurrency control algorithms in maintaining temporal consistency","authors":"Xiaohui Song, J. Liu","doi":"10.1109/CMPSAC.1990.139341","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139341","url":null,"abstract":"The authors present a model of typical hard real-time applications and the concepts of age and dispersion of data accessed by the real-time transactions. These are used to evaluate the performance of a class of multiversion lock-based concurrency control algorithms in maintaining temporal consistency of data in a real-time shared-data environment. It is shown that it is easier for such a concurrency control algorithm to maintain temporal consistency of shared data when the conflicting transactions are close in the lengths of their periods. The conflict pattern of the transactions has a more significant effect on the temporal inconsistency of data than the load level of the system. It is also desirable to have the transactions' periods within a small range. The best case was obtained when the faster transactions have higher utilizations. It was also shown that the use of the priority inheritance principle with the lock-based concurrency control algorithms can reduce transactions' blocking times and the number of transactions that access temporally inconsistent data as well as the worst-case age and dispersion of data.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"57 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134555464","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}

引用次数: 77

An object oriented approach to automating patient medical records 一种用于自动化患者医疗记录的面向对象方法

Proceedings., Fourteenth Annual International Computer Software and Applications Conference Pub Date : 1990-10-31 DOI: 10.1109/CMPSAC.1990.139330

D. Dimitroff, I. F. Chang

引用次数: 5

A tool specification language for software maintenance 一种用于软件维护的工具规范语言

Proceedings., Fourteenth Annual International Computer Software and Applications Conference Pub Date : 1990-10-31 DOI: 10.1109/CMPSAC.1990.139412

Sying-Syang Liu, Kurt R. Johmann

引用次数: 3

EASE: an embedded algebraic specification environment 一个嵌入式代数规范环境

Proceedings., Fourteenth Annual International Computer Software and Applications Conference Pub Date : 1990-10-31 DOI: 10.1109/CMPSAC.1990.139466

Jiahua Qian, Yong Zheng, Liqun Jin, Jinhua Zhang

引用次数: 1

Mathematical transformation of Petri-nets for development of parallel/distributed programs 并行/分布式程序开发中petri网的数学转换

Proceedings., Fourteenth Annual International Computer Software and Applications Conference Pub Date : 1990-10-31 DOI: 10.1109/CMPSAC.1990.139334

Y. Papelis, T. Casavant

引用次数: 0

MCFS: a multiple criteria reasoning fuzzy expert systems building tool 多准则推理模糊专家系统构建工具

Proceedings., Fourteenth Annual International Computer Software and Applications Conference Pub Date : 1990-10-31 DOI: 10.1109/CMPSAC.1990.139438

A. Kamel, A. Nazif, O. El-Dessouki, N. Kamel

引用次数: 2

Panel: transferring object-oriented technology into a corporation 小组:将面向对象的技术转移到公司

Proceedings., Fourteenth Annual International Computer Software and Applications Conference Pub Date : 1990-10-31 DOI: 10.1109/CMPSAC.1990.139450

S. Hutz, R. Joos, J. Rogers, K. B. Yakemovic

引用次数: 0

Nonlinear versus linear recursion: a perspective from computing transitive closures of a binary relation by the join domain nested loops approach 非线性与线性递归:通过连接域嵌套循环方法计算二元关系的传递闭包的视角

Proceedings., Fourteenth Annual International Computer Software and Applications Conference Pub Date : 1990-10-31 DOI: 10.1109/CMPSAC.1990.139388

P. Chang

{"title":"Nonlinear versus linear recursion: a perspective from computing transitive closures of a binary relation by the join domain nested loops approach","authors":"P. Chang","doi":"10.1109/CMPSAC.1990.139388","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139388","url":null,"abstract":"The author considers a more general class of transitive closure of a binary relation by relaxing the linear variable binding of the original transitive closure. A syntactical (i.e. grammatical) approach is used to analyze the properties of this class of recursive rules. The existing directed algorithms for computing the (standard) transitive closure of a binary relation actually compute a nonlinear recursion. In recursive query processing, linear recursion was 'preferred to' nonlinear recursion probably because of the lack of efficient algorithms for computing nonlinear recursion rather than because linear recursion is more likely to occur than nonlinear recursion. A linear transitive closure is semantically subsumed by its corresponding nonlinear transitive closure. The author provides counter-evidence through the worst case analysis of computing nonstandard transitive closures to show that computing nonlinear recursive rules is simpler than computing linear ones by using the join domain nested loops approach, even though linear recursive transitive closure is semantically subsumed by its corresponding nonlinear recursive transitive closure.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130478049","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