发布求助
文献互助 智能选刊 最新文献

Symposium on Small Systems最新文献

筛选
英文 中文
Dynamic data as deterrent to the tracker 动态数据作为对跟踪器的威慑
Symposium on Small Systems Pub Date : 1990-02-01 DOI: 10.1145/99412.99423
Miguel Cabrera, E. A. Unger
{"title":"Dynamic data as deterrent to the tracker","authors":"Miguel Cabrera, E. A. Unger","doi":"10.1145/99412.99423","DOIUrl":"https://doi.org/10.1145/99412.99423","url":null,"abstract":"Security measures in small and personal computer systems are exacerbated by the limited resources available. Inference of information from databases on any system is one security concern which involves breaches by authorized users of the system. One class of intrusion tools known as trackers has been extensively studied and several deterrent methods created. Most such deterrents, however, are not feasible solutions to the inference breach on small or personal computer systems because of the large amount of resource required to implement them. Natural or artificial dynamism of the contents of the database does provide a deterrent to trackers. This paper reports a study on the quantification of the deterrent value of making changes to records in a database against compromise with the general tracker. Information on the deterrent value of increasing the frequency of change, the number of attributes in the records, and the number of records in the database can provide a useful management tool to managers of small computers and networked PCs.","PeriodicalId":147067,"journal":{"name":"Symposium on Small Systems","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127929644","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
Using a competitive learning neural network to evaluate software complexity 使用竞争性学习神经网络评估软件复杂性
Symposium on Small Systems Pub Date : 1990-02-01 DOI: 10.1145/99412.99487
J. Sheppard, W. Simpson
{"title":"Using a competitive learning neural network to evaluate software complexity","authors":"J. Sheppard, W. Simpson","doi":"10.1145/99412.99487","DOIUrl":"https://doi.org/10.1145/99412.99487","url":null,"abstract":"With recent advances in neural networks, an increasing number of application areas are being explored for this technology. Also, as software takes a more prominent role in systems engineering, ensuring the quality of software is becoming a critical issue. This paper explores the application of one neural network paradigm—the competitive learning network—to the problem of evaluating software complexity. The network was developed by ARINC Research Corporation for its SofTest software analysis system, developed on a Sun workstation. In this paper, we discuss the network used in SofTest and the approach taken to train the network. We conclude with a discussion of the implications of the approach and areas for further research.","PeriodicalId":147067,"journal":{"name":"Symposium on Small Systems","volume":"424 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133176082","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
Performance based multiple server support for distributed real time applications 基于性能的多服务器支持分布式实时应用程序
Symposium on Small Systems Pub Date : 1990-02-01 DOI: 10.1145/99412.99469
T. Fergany, H. Sholl
{"title":"Performance based multiple server support for distributed real time applications","authors":"T. Fergany, H. Sholl","doi":"10.1145/99412.99469","DOIUrl":"https://doi.org/10.1145/99412.99469","url":null,"abstract":"In real time systems, tasks must be performed correctly within time constraints. The system throughput is also a key performance measure. One of the difficulties, which the system designer faces, is to control these performance factors. A heavily requested computation, or a subtask that requires long service time, may reduce the system performance. This paper presents two different solutions for the above problem using multiple servers to support the execution of such a subtask. The first approach uses a pipeline subtask decomposition while the second approach uses a set of parallel servers. A queuing model, that takes into consideration the communication delay, is used for the analysis. In addition, the proposed approaches consider the operating environment, both system and user constraints, and the required resource cost.","PeriodicalId":147067,"journal":{"name":"Symposium on Small Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121750865","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
Dynamically displaying a Pascal program in color 动态显示一个Pascal程序的颜色
Symposium on Small Systems Pub Date : 1990-02-01 DOI: 10.1145/99412.99432
J. Cigas
{"title":"Dynamically displaying a Pascal program in color","authors":"J. Cigas","doi":"10.1145/99412.99432","DOIUrl":"https://doi.org/10.1145/99412.99432","url":null,"abstract":"This paper describes a method of using color to display the actual structure of a Pascal program on a color monitor. This enhancement not only increases a programmer's understanding of the code, but also aids in detecting common structural errors. The paper identifies several structures deserving of color and the properties that must be adhered to when assigning colors to these structures. A simple coloring scheme illustrates this discussion. The last section describes enhancements and directions for future research.","PeriodicalId":147067,"journal":{"name":"Symposium on Small Systems","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123311930","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
Evaluation of queuing system parameters using linear algebraic queuing theory—an implementation 用线性代数排队论求排队系统参数的实现
Symposium on Small Systems Pub Date : 1990-02-01 DOI: 10.1145/99412.99467
L. Lipsky, D. Tagare, Edward Bigos
{"title":"Evaluation of queuing system parameters using linear algebraic queuing theory—an implementation","authors":"L. Lipsky, D. Tagare, Edward Bigos","doi":"10.1145/99412.99467","DOIUrl":"https://doi.org/10.1145/99412.99467","url":null,"abstract":"It is important to study the varied characteristics of queueing networks, in a self-consistent manner and interactive environment. We report here the development of an efficient and practical software package (QST) for the analysis of a particular class of queueing systems, (those described by two subsystems which interact only through the exchange of customers) which can run on an IBM PS/2 Model 70 or equivalent, or with some restrictions, on 80286-based PC's. The package produces data (or graphs) of various performance (including residual behavior) characteristics for these generalized queueing loops. It also generates such transient properties as “Busy Period”, “Rush Hour”, and “Mean Time to Failure”. The equations, which are transparent to the user, come from the “Linear Algebraic Approach to Queueing Theory”. For now, the package has been developed within the MATLAB environment. We provide some examples of input and output.","PeriodicalId":147067,"journal":{"name":"Symposium on Small Systems","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134166471","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
Efficient generation of lexically proper palindromes 有效地生成词法正确的回文
Symposium on Small Systems Pub Date : 1990-02-01 DOI: 10.1145/99412.99451
R. Rankin, H. Berghel, Tong Xu
{"title":"Efficient generation of lexically proper palindromes","authors":"R. Rankin, H. Berghel, Tong Xu","doi":"10.1145/99412.99451","DOIUrl":"https://doi.org/10.1145/99412.99451","url":null,"abstract":"Palindromes are strings of symbols which are symmetrical about the center. This paper outlines a method for generating certain types of palindromes, called lexical palindromes, which consist of legitimate English words. The method reported provides substantial pruning of a Prolog search tree by calculating the number of success nodes along certain search paths instead of visiting them, indexing words to improve database performance, and continuous analysis of current states to eliminate non-productive search paths. These efficiency measures allow lexical palindromes to be generated using a microcomputer.\u0000Our ultimate objective is to be able to estimate the ratio of sentential palindromes for any given length to the set of syntactically well-formed English sentences of that length with respect to a given lexicon and grammatical model. We shall take up the problem of determining the ratio of sentential palindromes to well-formed sentences in a sequel to this paper.","PeriodicalId":147067,"journal":{"name":"Symposium on Small Systems","volume":"53 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120911771","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
ASK: a kernel for programming actor systems ASK:用于编程参与者系统的内核
Symposium on Small Systems Pub Date : 1990-02-01 DOI: 10.1145/99412.99426
M. D. Santo, G. Iannello
{"title":"ASK: a kernel for programming actor systems","authors":"M. D. Santo, G. Iannello","doi":"10.1145/99412.99426","DOIUrl":"https://doi.org/10.1145/99412.99426","url":null,"abstract":"In this paper, ASK, a kernel for programming actor systems under MS-DOS operating system, is presented. The kernel was designed to define and test a set of primitives based on the actor programming model and suitable to be implemented on parallel systems with physically distributed memory. ASK makes it possible to develop and test highly concurrent programs and to analyze their run-time behavior.","PeriodicalId":147067,"journal":{"name":"Symposium on Small Systems","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117046621","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
An evaluation of type-10 homograph discrimination at the semi-colon level in Roget's International Thesaurus 在Roget的国际同义词典分号水平的10型同形词歧视的评价
Symposium on Small Systems Pub Date : 1990-02-01 DOI: 10.1145/99412.99453
J. Talburt, D. Mooney
{"title":"An evaluation of type-10 homograph discrimination at the semi-colon level in Roget's International Thesaurus","authors":"J. Talburt, D. Mooney","doi":"10.1145/99412.99453","DOIUrl":"https://doi.org/10.1145/99412.99453","url":null,"abstract":"This paper reports the results of evaluating a large sample of the 23,858 type-10 homographs found in Roget's International Thesaurus (3rd Ed.) as defined by the Bryan Model of abstract thesauri, of which Roget's is an instantiation. According to the Bryan model, two different entries in a thesaurus that have the same spelling are homographs (semantically unrelated) if and only if they cannot be the endpoints of a sequence of entries called a type-10 chain. The Bryan definition of a type-10 homograph has not been tested thoroughly until recently because of the combinatorial complexity associated with a direct application of the definition to a large instantiation such as Roget's. However, in 1989, the authors were able to decompose Roget's in into its type-10 components, and as a result, generate all 23,858 type-10 homographs at the semi-colon category level.\u0000The principal result is that Bryan's definition of homographs by type-10 semantic disjunction does not appear to work uniformly over a broad range of entries in Roget's when the selected semantic category is the semi-colon group. Although there are many cases where type-10 homographs agree with conventional classifications, in general type-10 discrimination at the semi-colon level “over discriminates” in that it generates many more homographs than are found in standard English language dictionaries.","PeriodicalId":147067,"journal":{"name":"Symposium on Small Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117206722","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
Teaching digital logic design using a tape recorder simulator 利用录音机模拟器进行数字逻辑设计教学
Symposium on Small Systems Pub Date : 1990-02-01 DOI: 10.1145/99412.99446
R. P. Srivastava
{"title":"Teaching digital logic design using a tape recorder simulator","authors":"R. P. Srivastava","doi":"10.1145/99412.99446","DOIUrl":"https://doi.org/10.1145/99412.99446","url":null,"abstract":"This paper describes two implementations of a tape recorder simulator. One is based on hard-wired logic and the other on microcomputer programmed logic approach. Both implementations are compared and evaluated for such points as flexibility, speed, power and space requirements, and cost. The purpose of this paper is to introduce students of digital logic design to the problems of selecting a suitable implementation based on software and hardware requirements, and system constraints. This is to teach students how to recognize which problem should be implemented in hardware and which problem should be implemented in software, or when and how to split between hardware and software. By implementing both methods themselves, students get a hands-on experience in several hardware design techniques such as asynchronous state machine (ASM), EPROM programming, address decoding, and input/output port interfacing.","PeriodicalId":147067,"journal":{"name":"Symposium on Small Systems","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128894079","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
Using an artificial neural system to determine the knowledge based of an expert system 利用人工神经系统来确定基于专家系统的知识
Symposium on Small Systems Pub Date : 1990-02-01 DOI: 10.1145/99412.99490
G. Whitson, Cathy H. Wu, P. Taylor
{"title":"Using an artificial neural system to determine the knowledge based of an expert system","authors":"G. Whitson, Cathy H. Wu, P. Taylor","doi":"10.1145/99412.99490","DOIUrl":"https://doi.org/10.1145/99412.99490","url":null,"abstract":"This paper gives a mapping of rule based expert systems into artificial neural expert systems. While the mapping is not one-to-one, it does show that the two systems are essentially equivalent. There are, of course, many examples of artificial neural systems that are not expert systems. We can use the reverse mapping of an artificial neural expert system to a rule based expert system to determine the knowledge base of the rule based expert system, i.e., to determine the exact nature of the rules. This yields an automated procedure for determining the knowledge base of an expert system that shows much promise. We have implemented this expert system tool on several larger microcomputers, including an Intel Sugarcube. The Sugarcube implementation is a very natural one.","PeriodicalId":147067,"journal":{"name":"Symposium on Small Systems","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122028323","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}
引用次数: 6
首页 上一页 下一页 尾页
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学术官方微信