首页 > 最新文献

Proceedings., Fourteenth Annual International Computer Software and Applications Conference最新文献

英文 中文
On transforming Petri net model to Moore machine Petri网模型向摩尔机的转换
Carl K. Chang, Hsuanwei Huang
The absence of satisfactory methods for verifying the liveness and fairness properties limits the analysis power of Petri net theories. An approach is introduced to connect the Petri net model with the Model Checker. A translator is used to transform the reachability graph of the Petri net to the Moore machine. The Moore machine and the behaviors specified by temporal logic are the inputs of the Model Checker, which is able to verify the properties of liveness and fairness. During the transformation, local and global behaviors of the Petri net model are separated, which means that a certain modularity can be achieved. An optimization technique is presented to trim the unnecessary local information from the local reachability graphs. The space complexity of manipulating the global reachability graph, which is generated by combing the trimmed local reachability graph, can be reduced. Moreover, a new approach is proposed to verify the concurrency behavior by using the Model Checker.<>
由于缺乏令人满意的方法来验证Petri网的活动性和公平性,限制了Petri网理论的分析能力。介绍了一种将Petri网模型与模型检查器连接起来的方法。利用翻译器将Petri网的可达性图转换为摩尔机。摩尔机和时间逻辑指定的行为是模型检查器的输入,模型检查器能够验证活动性和公平性。在转换过程中,将Petri网模型的局部行为与全局行为分离,实现了一定的模块化。提出了一种从局部可达图中剔除不必要的局部信息的优化技术。通过对裁剪后的局部可达图进行梳理生成全局可达图,可以降低操作全局可达图的空间复杂度。此外,提出了一种利用模型检查器验证并发行为的新方法。
{"title":"On transforming Petri net model to Moore machine","authors":"Carl K. Chang, Hsuanwei Huang","doi":"10.1109/CMPSAC.1990.139365","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139365","url":null,"abstract":"The absence of satisfactory methods for verifying the liveness and fairness properties limits the analysis power of Petri net theories. An approach is introduced to connect the Petri net model with the Model Checker. A translator is used to transform the reachability graph of the Petri net to the Moore machine. The Moore machine and the behaviors specified by temporal logic are the inputs of the Model Checker, which is able to verify the properties of liveness and fairness. During the transformation, local and global behaviors of the Petri net model are separated, which means that a certain modularity can be achieved. An optimization technique is presented to trim the unnecessary local information from the local reachability graphs. The space complexity of manipulating the global reachability graph, which is generated by combing the trimmed local reachability graph, can be reduced. Moreover, a new approach is proposed to verify the concurrency behavior by using the Model Checker.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"36 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":"131136996","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}
引用次数: 4
Neural network application to container number recognition 神经网络在箱号识别中的应用
H. Lui, Chung-Mong Lee, Fang Gao
The authors describe an application of neural network technology to a practical problem: the recognition of container identification numbers. The general problem is described and technical difficulties are highlighted. A solution is proposed and a set of algorithms is implemented. Emphasis is placed here on the development of the character recognition algorithm, which uses a neural network model known as the neocognitron. The general recognition methodology is discussed and the experimental results are reported. It is observed that this neural network model can attain a high level of accuracy even though the input patterns are highly distorted.<>
本文描述了神经网络技术在集装箱识别码识别这一实际问题中的应用。描述了一般问题,并强调了技术难点。提出了一种解决方案,并实现了一套算法。重点放在字符识别算法的开发上,该算法使用一种称为neocognitron的神经网络模型。讨论了一般的识别方法,并报道了实验结果。观察到,即使输入模式高度扭曲,该神经网络模型也能达到较高的精度。
{"title":"Neural network application to container number recognition","authors":"H. Lui, Chung-Mong Lee, Fang Gao","doi":"10.1109/CMPSAC.1990.139350","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139350","url":null,"abstract":"The authors describe an application of neural network technology to a practical problem: the recognition of container identification numbers. The general problem is described and technical difficulties are highlighted. A solution is proposed and a set of algorithms is implemented. Emphasis is placed here on the development of the character recognition algorithm, which uses a neural network model known as the neocognitron. The general recognition methodology is discussed and the experimental results are reported. It is observed that this neural network model can attain a high level of accuracy even though the input patterns are highly distorted.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"45 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":"134387491","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}
引用次数: 7
Performance of multiversion concurrency control algorithms in maintaining temporal consistency 多版本并发控制算法在保持时间一致性方面的性能
Xiaohui Song, J. Liu
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.<>
作者提出了一个典型的硬实时应用模型,以及实时事务访问的数据的年龄和分散的概念。它们用于评估一类基于锁的多版本并发控制算法在维护实时共享数据环境中数据的时间一致性方面的性能。结果表明,当冲突的事务在其周期长度上接近时,这种并发控制算法更容易保持共享数据的时间一致性。事务的冲突模式对数据的临时不一致性的影响比系统的负载级别更大。将交易周期控制在一个较小的范围内也是可取的。当更快的事务具有更高的利用率时,可以获得最佳情况。研究还表明,将优先级继承原则与基于锁的并发控制算法相结合,可以减少事务阻塞次数和访问暂时不一致数据的事务数量,以及数据的最坏情况年龄和分散性
{"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 一种用于自动化患者医疗记录的面向对象方法
D. Dimitroff, I. F. Chang
It is pointed out that, in automating patient records, one must consider the conversion of existing paper records, the records generated by various heterogeneous departmental medical information systems, and the different media (graphics, image, and voice) output created by some modern automated medical instrumentations. In an attempt to solve this complex problem, an object-oriented medical record model is adopted. A catalyst solution called the personal medical disk is proposed which allows and induces medical institutions to develop an all-digital medical record system at their own pace. A conceptual model has been implemented on an intelligent workstation as a stand-alone system. It is believed that using an object-oriented approach will allow rapid development, easier modification, and simpler maintenance of software to be achieved.<>
指出,在实现病历自动化时,必须考虑现有纸质病历的转换、各种异构部门医疗信息系统产生的病历以及一些现代自动化医疗仪器产生的不同媒体(图形、图像和语音)输出。为了解决这一复杂问题,采用了面向对象的病案模型。提出了一种名为个人医疗磁盘的催化剂解决方案,它允许并引导医疗机构按照自己的节奏开发全数字医疗记录系统。一个概念模型作为一个独立的系统在智能工作站上实现。人们相信,使用面向对象的方法可以实现快速开发、更容易修改和更简单的软件维护。
{"title":"An object oriented approach to automating patient medical records","authors":"D. Dimitroff, I. F. Chang","doi":"10.1109/CMPSAC.1990.139330","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139330","url":null,"abstract":"It is pointed out that, in automating patient records, one must consider the conversion of existing paper records, the records generated by various heterogeneous departmental medical information systems, and the different media (graphics, image, and voice) output created by some modern automated medical instrumentations. In an attempt to solve this complex problem, an object-oriented medical record model is adopted. A catalyst solution called the personal medical disk is proposed which allows and induces medical institutions to develop an all-digital medical record system at their own pace. A conceptual model has been implemented on an intelligent workstation as a stand-alone system. It is believed that using an object-oriented approach will allow rapid development, easier modification, and simpler maintenance of software to be achieved.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"10 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":"117059000","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
A tool specification language for software maintenance 一种用于软件维护的工具规范语言
Sying-Syang Liu, Kurt R. Johmann
A modified attribute-grammar language, to be used for specifying tools in a software maintenance environment, is proposed. This language is called Tool Specification Language (TSL). TSL allows an orderly sharing of specifications between different tools. It also allows the sharing of computed attribute values between different tools. For a suite of related tools that would support the maintenance programmer, using TSL as the specification language would result in a concise, shared specification. There would also be the benefit of less memory space and faster tool execution when computed attribute values are shared.<>
提出了一种改进的属性语法语言,用于在软件维护环境中指定工具。这种语言称为工具规范语言(TSL)。TSL允许在不同的工具之间有序地共享规范。它还允许在不同的工具之间共享计算的属性值。对于一套支持维护程序员的相关工具,使用TSL作为规范语言将产生一个简洁的、共享的规范。当计算的属性值被共享时,还会有更少的内存空间和更快的工具执行的好处。
{"title":"A tool specification language for software maintenance","authors":"Sying-Syang Liu, Kurt R. Johmann","doi":"10.1109/CMPSAC.1990.139412","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139412","url":null,"abstract":"A modified attribute-grammar language, to be used for specifying tools in a software maintenance environment, is proposed. This language is called Tool Specification Language (TSL). TSL allows an orderly sharing of specifications between different tools. It also allows the sharing of computed attribute values between different tools. For a suite of related tools that would support the maintenance programmer, using TSL as the specification language would result in a concise, shared specification. There would also be the benefit of less memory space and faster tool execution when computed attribute values are shared.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"80 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":"115419556","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}
引用次数: 3
EASE: an embedded algebraic specification environment 一个嵌入式代数规范环境
Jiahua Qian, Yong Zheng, Liqun Jin, Jinhua Zhang
An attempt is made to apply ideas about algebraic specification in the context of a programming language, EASE, an embedded algebraic specification environment, is developed based on a Pascal-oriented iterative programming environment FPE by allowing embedded algebraic specification (EAS) in the place of Pascal code. It provides a framework for the formal development of a program from a specification. The authors discuss the design of EAS and the use of EASE as a term rewriting system. In general, EASE can automatically generate code for any formally specified object by term rewriting, and can immediately execute and test this object. Therefore, it can be used as a tool for support program development, program prototyping, and specification reuse.<>
本文尝试将代数规范的思想应用到编程语言的环境中,基于面向Pascal的迭代编程环境FPE,通过允许在Pascal代码中使用嵌入式代数规范(EAS),开发了嵌入式代数规范环境EASE。它为从规范中正式开发程序提供了一个框架。作者讨论了EAS的设计和使用EAS作为术语重写系统。一般来说,EASE可以通过术语重写为任何正式指定的对象自动生成代码,并可以立即执行和测试该对象。因此,它可以用作支持程序开发、程序原型和规范重用的工具
{"title":"EASE: an embedded algebraic specification environment","authors":"Jiahua Qian, Yong Zheng, Liqun Jin, Jinhua Zhang","doi":"10.1109/CMPSAC.1990.139466","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139466","url":null,"abstract":"An attempt is made to apply ideas about algebraic specification in the context of a programming language, EASE, an embedded algebraic specification environment, is developed based on a Pascal-oriented iterative programming environment FPE by allowing embedded algebraic specification (EAS) in the place of Pascal code. It provides a framework for the formal development of a program from a specification. The authors discuss the design of EAS and the use of EASE as a term rewriting system. In general, EASE can automatically generate code for any formally specified object by term rewriting, and can immediately execute and test this object. Therefore, it can be used as a tool for support program development, program prototyping, and specification reuse.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"148 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":"123437588","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
Mathematical transformation of Petri-nets for development of parallel/distributed programs 并行/分布式程序开发中petri网的数学转换
Y. Papelis, T. Casavant
A novel approach for visually specifying parallel/distributed software using extended Petri-nets (PNS) is investigated. The approach is demonstrated to be useful in the specification of decision-making activities that control distributed computing systems. PNs are employed because of their highly visual nature that can give insight into the nature of the controller of such a system and because of their well-known analytical properties. In order to increase the expressive power of PNs, the extension of transition enabling functions is used. The main focus is a set of automatic transformations derived to transform such an extended net into a basic PN. Then, well-known analytical methods can be used to investigate characteristic properties of the system and validate correct operation. A graphical programming tool (XPAT) has been built to automate the visual programming process as well as the transformations.<>
研究了一种利用扩展petri网(PNS)可视化地描述并行/分布式软件的新方法。该方法在规范控制分布式计算系统的决策活动方面被证明是有用的。采用PNs是因为它们高度可视化的性质,可以深入了解这种系统的控制器的性质,也因为它们众所周知的分析性质。为了提高PNs的表达能力,采用了转换使能函数的扩展。主要的焦点是一组自动转换,以将这种扩展的网络转换为基本的PN。然后,可以使用众所周知的分析方法来研究系统的特性并验证正确的操作。已经构建了一个图形化编程工具(XPAT)来自动化可视化编程过程以及转换。
{"title":"Mathematical transformation of Petri-nets for development of parallel/distributed programs","authors":"Y. Papelis, T. Casavant","doi":"10.1109/CMPSAC.1990.139334","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139334","url":null,"abstract":"A novel approach for visually specifying parallel/distributed software using extended Petri-nets (PNS) is investigated. The approach is demonstrated to be useful in the specification of decision-making activities that control distributed computing systems. PNs are employed because of their highly visual nature that can give insight into the nature of the controller of such a system and because of their well-known analytical properties. In order to increase the expressive power of PNs, the extension of transition enabling functions is used. The main focus is a set of automatic transformations derived to transform such an extended net into a basic PN. Then, well-known analytical methods can be used to investigate characteristic properties of the system and validate correct operation. A graphical programming tool (XPAT) has been built to automate the visual programming process as well as the transformations.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"218 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":"126018665","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
MCFS: a multiple criteria reasoning fuzzy expert systems building tool 多准则推理模糊专家系统构建工具
A. Kamel, A. Nazif, O. El-Dessouki, N. Kamel
The authors present the design principles of MCFS, an expert system building tool based on the idea of combining multiple criteria reasoning with the concepts of fuzzy logic. An important feature of MCFS is its ability to handle multiple criteria reasoning by structuring the deduction process into a hierarchy of logical levels. Within each level, the rules are organized into sets of rules and rule set groups. The concepts of fuzzy logic are introduced by allowing uncertainty within each rule, each set of rules, and each rule set group. MCFS has been fully implemented and applied to several domains of knowledge such as computer system selection and procurement, solution of nonlinear simultaneous equations, neck-tie selection, and longevity estimation. Experiments with these applications indicate that, compared to standard expert system tools, MCFS produces expert systems which are easier to build and better match the human expert.<>
本文介绍了基于多准则推理与模糊逻辑概念相结合的专家系统构建工具MCFS的设计原理。MCFS的一个重要特征是它能够通过将演绎过程构建成逻辑层次结构来处理多标准推理。在每个级别中,规则被组织成规则集和规则集组。模糊逻辑的概念是通过允许每个规则、每个规则集和每个规则集组中的不确定性来引入的。MCFS已经完全实现并应用于几个知识领域,如计算机系统选择和采购,非线性联立方程的求解,领带选择和寿命估计。这些应用程序的实验表明,与标准专家系统工具相比,MCFS产生的专家系统更容易构建,并且与人类专家更匹配。
{"title":"MCFS: a multiple criteria reasoning fuzzy expert systems building tool","authors":"A. Kamel, A. Nazif, O. El-Dessouki, N. Kamel","doi":"10.1109/CMPSAC.1990.139438","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139438","url":null,"abstract":"The authors present the design principles of MCFS, an expert system building tool based on the idea of combining multiple criteria reasoning with the concepts of fuzzy logic. An important feature of MCFS is its ability to handle multiple criteria reasoning by structuring the deduction process into a hierarchy of logical levels. Within each level, the rules are organized into sets of rules and rule set groups. The concepts of fuzzy logic are introduced by allowing uncertainty within each rule, each set of rules, and each rule set group. MCFS has been fully implemented and applied to several domains of knowledge such as computer system selection and procurement, solution of nonlinear simultaneous equations, neck-tie selection, and longevity estimation. Experiments with these applications indicate that, compared to standard expert system tools, MCFS produces expert systems which are easier to build and better match the human expert.<<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":"127459507","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
Panel: transferring object-oriented technology into a corporation 小组:将面向对象的技术转移到公司
S. Hutz, R. Joos, J. Rogers, K. B. Yakemovic
A panel session is reported in which issues related to organizing and accelerating the transfer of object-oriented technology into the development organizations of large corporations are addressed. Particular attention is given to an N-party interaction model for technology transfer from a research consortium to industry and to object-oriented curriculum development at Hewlett-Packard.<>
报告了一次小组会议,讨论了有关组织和加速将面向对象技术转让给大公司的开发组织的问题。特别关注的是一个n方互动模型,用于从研究联盟向工业和面向对象的课程开发的技术转移。
{"title":"Panel: transferring object-oriented technology into a corporation","authors":"S. Hutz, R. Joos, J. Rogers, K. B. Yakemovic","doi":"10.1109/CMPSAC.1990.139450","DOIUrl":"https://doi.org/10.1109/CMPSAC.1990.139450","url":null,"abstract":"A panel session is reported in which issues related to organizing and accelerating the transfer of object-oriented technology into the development organizations of large corporations are addressed. Particular attention is given to an N-party interaction model for technology transfer from a research consortium to industry and to object-oriented curriculum development at Hewlett-Packard.<<ETX>>","PeriodicalId":127509,"journal":{"name":"Proceedings., Fourteenth Annual International Computer Software and Applications Conference","volume":"195 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":"114910035","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
Nonlinear versus linear recursion: a perspective from computing transitive closures of a binary relation by the join domain nested loops approach 非线性与线性递归:通过连接域嵌套循环方法计算二元关系的传递闭包的视角
P. Chang
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.<>
通过放宽原始传递闭包的线性变量绑定,考虑了二元关系的传递闭包的更一般的一类。使用句法(即语法)方法来分析这类递归规则的属性。现有的用于计算二元关系的(标准)传递闭包的有向算法实际上计算的是非线性递归。在递归查询处理中,线性递归比非线性递归更受青睐,可能是因为缺乏计算非线性递归的有效算法,而不是因为线性递归比非线性递归更容易发生。线性传递闭包在语义上被其对应的非线性传递闭包所包含。作者通过计算非标准递归闭包的最坏情况分析提供了反证据,表明使用连接域嵌套循环方法计算非线性递归规则比计算线性递归规则更简单,即使线性递归传递闭包在语义上被其相应的非线性递归传递闭包所包含。
{"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
期刊
Proceedings., Fourteenth Annual International Computer Software and Applications Conference
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1