Information Sciences - Applications最新文献_第3页

A visual debugger for pure Prolog 一个纯Prolog的可视化调试器

Information Sciences - Applications Pub Date : 1995-03-01 DOI: 10.1016/1069-0115(94)00048-7

Dan E. Tamir, Ravi Ananthakrishnan, Abraham Kandel

{"title":"A visual debugger for pure Prolog","authors":"Dan E. Tamir, Ravi Ananthakrishnan, Abraham Kandel","doi":"10.1016/1069-0115(94)00048-7","DOIUrl":"10.1016/1069-0115(94)00048-7","url":null,"abstract":"<div><p>This work involves the design and coding of an interpreter for pure Prolog and building a visual debugger for it. Most of the available Prolog interpreters contain some tracing facilities. They do not incorporate, however, a comprehensive visual debugger. The interpreter performs the operations of parsing, unification, resolution, and search in a state-space representation of the Prolog program. The visual debugger incorporates the graphical visualization and the manipulation of the SLD resolution tree. The user visualizes the execution of a pure Prolog program and interacts with the program inside a windowing environment. The program execution may be viewed without interruption or the execution can be stopped at any moment in time. At this point the “snapshot” can be scrutinized with the help of break-points and data displays. This software aims itself to those who wish to observe the actual process of predicate unification, substitution, resolution and goal matching in a Prolog program and to visually interact with the interpreter using a highly friendly and pleasing user interface. An advanced feature, referred to as debugging on the tree, provides the user with the ability to insert break-points directly on the SLD tree, to choose the path of execution, and change the search mode. The resultant search algorithm can be a mixture of depth-first and breadth-first search, avoiding infinite search paths.</p></div>","PeriodicalId":100668,"journal":{"name":"Information Sciences - Applications","volume":"3 2","pages":"Pages 127-147"},"PeriodicalIF":0.0,"publicationDate":"1995-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/1069-0115(94)00048-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86630752","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

Highly available and reliable communication protocols for heterogeneous systems 用于异构系统的高可用和可靠的通信协议

Information Sciences - Applications Pub Date : 1995-01-01 DOI: 10.1016/1069-0115(95)82002-7

Omran Bukhres, Eva Kühn

{"title":"Highly available and reliable communication protocols for heterogeneous systems","authors":"Omran Bukhres, Eva Kühn","doi":"10.1016/1069-0115(95)82002-7","DOIUrl":"https://doi.org/10.1016/1069-0115(95)82002-7","url":null,"abstract":"<div><p>Existing and legacy software systems are the product of lengthy and individual development histories. Interoperability among such systems offers the support of global applications on these systems. However, interoperability among these heterogeneous systems is hampered by the absence of a reliable communication environment that supports the development of global applications.</p><p>In this paper, we show how a generic communication framework can serve as a testbed for the specification, verification, and execution of distributed communication protocols. The development of distributed, global concurrency protocols is much simpler than using traditional tools, like RPC (remote procedure call), because our framework provides a high-level communication mechanism that frees the protocol designer from thinking in a message-based style. We present several protocols that are consistent with realistic assumptions about local database systems, and proofs of their correctness and consistency preservation. We also show that the execution of these protocols is fault-tolerant. The distribution of systems can be chosen according to application requirements, without adaptation of protocols. Fault tolerance can be fine-tuned within the framework itself, so that verified protocols do not need modifications in this case either.</p><p>Besides protocols for traditional transaction processing, we present communication protocols for advanced transaction models that relax one or more of the ACID properties of transactions. These advanced transaction models enable local autonomy and thus are much better suited for heterogeneous environments.</p></div>","PeriodicalId":100668,"journal":{"name":"Information Sciences - Applications","volume":"3 1","pages":"Pages 1-40"},"PeriodicalIF":0.0,"publicationDate":"1995-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/1069-0115(95)82002-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"92062959","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

A fuzzy expert system approach for real-time monitoring of endemic diseases 地方病实时监测的模糊专家系统方法

Information Sciences - Applications Pub Date : 1995-01-01 DOI: 10.1016/0020-0255(94)00009-Z

Apurba Banerjee, A. Majumder, A. Basu

引用次数: 4

A fuzzy expert system approach for real-time monitoring of endemic diseases 地方病实时监测的模糊专家系统方法

Information Sciences - Applications Pub Date : 1995-01-01 DOI: 10.1016/1069-0115(95)82003-5

Apurba Banerjee, Arun Kumar Majumder, Anupam Basu

引用次数: 0

Rate distortion theory and the volatility of asset prices 利率扭曲理论与资产价格波动

Information Sciences - Applications Pub Date : 1995-01-01 DOI: 10.1016/0020-0255(94)00040-I

W. D. O'Neill

引用次数: 3

Highly available and reliable communication protocols for heterogeneous systems 用于异构系统的高可用和可靠的通信协议

Information Sciences - Applications Pub Date : 1995-01-01 DOI: 10.1016/0020-0255(94)00005-V

O. Bukhres, E. Kühn

引用次数: 6

Rate distortion theory and the volatility of asset prices 利率扭曲理论与资产价格波动

Information Sciences - Applications Pub Date : 1995-01-01 DOI: 10.1016/1069-0115(95)82004-3

William D. O'Neill

引用次数: 0

A fuzzy model for unsupervised character classification 一种用于无监督字符分类的模糊模型

Information Sciences - Applications Pub Date : 1994-11-01 DOI: 10.1016/1069-0115(94)90034-5

Shy-Shyan Chen, Frank Y. Shih, Peter A. Ng

引用次数: 5

An extended fuzzy linguistic approach to generalize boolean information retrieval 一种扩展模糊语言方法推广布尔信息检索

Information Sciences - Applications Pub Date : 1994-11-01 DOI: 10.1016/1069-0115(94)90032-9

Donald H. Kraft, Gloria Bordogna, Gabriella Pasi

{"title":"An extended fuzzy linguistic approach to generalize boolean information retrieval","authors":"Donald H. Kraft, Gloria Bordogna, Gabriella Pasi","doi":"10.1016/1069-0115(94)90032-9","DOIUrl":"10.1016/1069-0115(94)90032-9","url":null,"abstract":"<div><p>The generalization of Boolean information retrieval systems is still of interest to scholars. In spite of the fact that commercial systems use Boolean retrieval mechanisms, such systems still have some limitations. One of the main problems is that such systems lack the ability to deal well with imprecision and subjectivity. Previous efforts have led to the introduction of numeric weights to improve both document representations (term weights) and query languages (query weights). However, the use of weights requires a clear knowledge of the semantics of the query in order to translate a fuzzy concept into a precise numeric value. Moreover, it is difficult to model the matching of queries to documents in a way that will preserve the semantics of user queries.</p><p>A linguistic extension has been generated, starting from an existing Boolean weighted retrieval model and formalized within fuzzy set theory, in which numeric query weights are replaced by linguistic descriptors that specify the degree of importance of the terms.</p><p>In the past, query weights were seen as measures of the importance of a specific term in representing the query or as a threshold to aid in matching a specific document to the query. The linguistic extension was originally modeled to view the query weights as a description of the ideal document, so that deviations would be rejected whether a given document had term weights that were too high or too low. This paper looks at an extension to the linguistic model that is not symmetric in that documents with a term weight below the query weight are treated differently than documents with a term weight above the query weight.</p></div>","PeriodicalId":100668,"journal":{"name":"Information Sciences - Applications","volume":"2 3","pages":"Pages 119-134"},"PeriodicalIF":0.0,"publicationDate":"1994-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/1069-0115(94)90032-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89449595","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}

引用次数: 97

An optimization of the fuzzy control algorithm 一种优化的模糊控制算法

Information Sciences - Applications Pub Date : 1994-11-01 DOI: 10.1016/1069-0115(94)90033-7

Eric Bolinger

引用次数: 2