ACM-SE 33最新文献

筛选
英文 中文
A test suite for exposing design and implementation details in petri net simulators 一个测试套件,用于暴露petri网模拟器中的设计和实现细节
ACM-SE 33 Pub Date : 1995-03-17 DOI: 10.1145/1122018.1122022
Sunil Hingorani, Oliver Heim
{"title":"A test suite for exposing design and implementation details in petri net simulators","authors":"Sunil Hingorani, Oliver Heim","doi":"10.1145/1122018.1122022","DOIUrl":"https://doi.org/10.1145/1122018.1122022","url":null,"abstract":"In this paper we deal with issues concerning design and implementation constraints of petri net simulators. We have discovered several interesting anomalies of specific simulators and the general inability of public domain petri net simulators to accommodate anything but the most simplistic models. Also, there are numerous design issues which have been addressed differently in different Petri Net Simulators. Hence, a user may expect behavior completely different from the one exhibited by the Simulator. In this paper, we try to address the above mentioned problem by presenting a test suite intended to evaluate the behavior of a petri net simulator. It is specifically designed to expose not only differences in the manner in which the design issues are addressed, but also limitations due to the implementation. We also present specific cases where this test suite has helped in pointing out the shortcomings of specific simulators. A logical conclusion to our work would be to bring about some level of standardization in the implementation of petri net simulators.","PeriodicalId":349974,"journal":{"name":"ACM-SE 33","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131327250","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
Network Glenda software design 网络格伦达软件设计
ACM-SE 33 Pub Date : 1995-03-17 DOI: 10.1145/1122018.1122028
Denzil Lobo
{"title":"Network Glenda software design","authors":"Denzil Lobo","doi":"10.1145/1122018.1122028","DOIUrl":"https://doi.org/10.1145/1122018.1122028","url":null,"abstract":"This paper outlines the functions and data structures needed for the functioning of the Glenda software on a Network. The Network Glenda model follows the iPSC-860 Glenda software design. The paper describes the setup, working, and usage of Glenda software on a network. Message passing is handled using TCP/IP in the Network Glenda Model. The paper describes how the use of signal-handlers and rendezvous nodes make communication in the Network Glenda model a quick yet simple task. The primary Glenda functions and data types have been defined. Additionally, network messages and network data structures have been described.","PeriodicalId":349974,"journal":{"name":"ACM-SE 33","volume":"155 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116531912","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 prototype and algorithms for tree ring area measurement 树木年轮面积测量的原型与算法
ACM-SE 33 Pub Date : 1995-03-17 DOI: 10.1145/1122018.1122065
W. Smith
{"title":"A prototype and algorithms for tree ring area measurement","authors":"W. Smith","doi":"10.1145/1122018.1122065","DOIUrl":"https://doi.org/10.1145/1122018.1122065","url":null,"abstract":"The analysis of tree cross-sections (discs) by measuring the rings (annuli) of a disc to determine a tree's growth history is conducted frequently by foresters, botanists and ecologists. The purpose of this paper is to discuss algorithms and approaches that were used to develop a prototype for a system to automate the measurement of tree rings through image analysis. A system was developed to define the area of annuli of a disc with clearly defined boundaries and no perturbations. The area of the entire region enclosed by a ring is determined by defining a ring's perimeter using a conventional radially-sweeping contour-tracing algorithm. The area of an annuli is calculated by subtraction of the area enclosed by the adjoining inner rings. This portion of the system is O((r+1)n) for the measurement of a disc, where n=(Ymax-Ymin+1) and r = the number of rings in the disc. A flood (polygon) fill algorithm must be used to verify the center of the disc was found. Thus, the efficiency of the entire system is O(n2). The area that must be visited by the flood fill algorithm is small thus the approach is efficient. Its utility for tree ring analysis is limited due to tree discs often having indistinct boundaries and flaws. Research is being conducted on image capture, edge detection and contour tracing methods to further develop the prototype. These capabilities must be incorporated to make this system a useful tool for analyzing a normal imperfect disc.","PeriodicalId":349974,"journal":{"name":"ACM-SE 33","volume":"305 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122727478","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 temporal paraconsistent relational algebra for incomplete and inconsistent information 一种用于不完整和不一致信息的时间准一致关系代数
ACM-SE 33 Pub Date : 1995-03-17 DOI: 10.1145/1122018.1122062
R. Bagai, M. Orgun
{"title":"A temporal paraconsistent relational algebra for incomplete and inconsistent information","authors":"R. Bagai, M. Orgun","doi":"10.1145/1122018.1122062","DOIUrl":"https://doi.org/10.1145/1122018.1122062","url":null,"abstract":"We construct a framework for natural handling of incomplete and inconsistent information in temporal databases. Central to this framework are structures that we call time-varying paraconsistent relations, which are essentially 4-valued relations that vary over time. For such structures, we present an algebra based on temporal semantics in which there is no explicit manipulation of time indices, yet it is rich enough to express recursive equations as queries. The algebra is a consistent extension of the relational algebra; it supports basic algebraic equivalences, and has a well-defined formal semantics. We also provide many examples of queries expressed in this algebra. To our knowledge, our framework is the first treatment of inconsistent information in the context of temporal databases.","PeriodicalId":349974,"journal":{"name":"ACM-SE 33","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122026489","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
A new bound for space bounded server algorithms 空间有界服务器算法的新边界
ACM-SE 33 Pub Date : 1995-03-17 DOI: 10.1145/1122018.1122047
Stephen Hughes
{"title":"A new bound for space bounded server algorithms","authors":"Stephen Hughes","doi":"10.1145/1122018.1122047","DOIUrl":"https://doi.org/10.1145/1122018.1122047","url":null,"abstract":"This paper studies the competitive factor of space bounded algorithms for the k-server problem operating in finite metric spaces. Specifically, two methods are developed for obtaining an upper bound on competitive factors of arbitrary space bounded algorithms. One of these methods is then used to show that an LRU-like algorithm is linearly-competitive on a uniform metric space.","PeriodicalId":349974,"journal":{"name":"ACM-SE 33","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129160285","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
Using virtual reality for the simulation of infrared environments for human training 利用虚拟现实技术对红外环境进行模拟,进行人体训练
ACM-SE 33 Pub Date : 1995-03-17 DOI: 10.1145/1122018.1122036
A. Smith
{"title":"Using virtual reality for the simulation of infrared environments for human training","authors":"A. Smith","doi":"10.1145/1122018.1122036","DOIUrl":"https://doi.org/10.1145/1122018.1122036","url":null,"abstract":"The paper describes a method to dynamically simulate heat transfer and the generation of infrared images, all in real time. Although there do exist models that produce infrared images of environments these models are generally static and only show one view at one moment in time, usually the time at temperature equilibrium. The model presented moment in time. Instead, a user is emersed within a virtual environment, through the use of a head mounted display, and is presented with a dynamically changing scene that reflects the changing temperatures of the objects as they seek equilibrium within their environment. The view point is also dynamic allowing the user to move around the scene, and to interact and change certain elements. In this way the user is free to turn on or off lights, motors, and other heat sources and observe the effects that this will have on the other objects in the environment, all of this in real time.","PeriodicalId":349974,"journal":{"name":"ACM-SE 33","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131185922","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
Using genetic algorithms to improve interpretation of satellite data 利用遗传算法改进卫星数据的解释
ACM-SE 33 Pub Date : 1995-03-17 DOI: 10.1145/1122018.1122043
Ryan G. Benton
{"title":"Using genetic algorithms to improve interpretation of satellite data","authors":"Ryan G. Benton","doi":"10.1145/1122018.1122043","DOIUrl":"https://doi.org/10.1145/1122018.1122043","url":null,"abstract":"We investigated a problem involving the automatic classification of satellite pixels. Each image is a 512 by 512 matrix of pixels, each of which consists of 4 channel values. The classification of these pixels into one of five classes is ordinarily an arduous process. A variety of search algorithms have been created to solve optimization problems. One of these search algorithms, genetic algorithms, has been developed from the concepts of Darwinian evolution and natural selection. They have several advantages over other search methodologies which are of use to this problem. They do not need expert knowledge, they evaluate a large number of potential solutions quickly and nearly simultaneously, and they are able to identify near optimal solutions while searching for better answers. The method employed uses genetic algorithms to identify a good representative are chosen, classification category. Once the representatives are chosen, classification of pixels in similar images is easily automated. The results indicate that genetic algorithms can be used to classify pixels from satellite images quickly and with a good degree of reliability.","PeriodicalId":349974,"journal":{"name":"ACM-SE 33","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127751294","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
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学术文献互助群
群 号:604180095
Book学术官方微信