ACM-SE 33Pub Date : 1995-03-17DOI: 10.1145/1122018.1122075
E. Stiller, G. Riccardi
{"title":"A heuristic approach to RNA secondary structure prediction","authors":"E. Stiller, G. Riccardi","doi":"10.1145/1122018.1122075","DOIUrl":"https://doi.org/10.1145/1122018.1122075","url":null,"abstract":"The overall research context for this endeavor is the creation of an object-oriented representation scheme to facilitate phylogenetic analysis. As an initial and nontrivial subtask of this undertaking, we recognize the need to accomplish sequence alignment preceded by secondary structure prediction due to the length of the RNA strands with which we are working, namely 18S ribosomal RNA (rRNA). Secondary structure prediction is the focus of this paper. Though this topic has been addressed for the past two decades, our efforts concentrate on the introduction of heuristic techniques to make tractable an otherwise intractable problem. We introduce an object-oriented representation scheme to facilitate the utilization of biologist expertise and phylogenetic context into the arrival of secondary structures.","PeriodicalId":349974,"journal":{"name":"ACM-SE 33","volume":"134 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":"116039631","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}
ACM-SE 33Pub Date : 1995-03-17DOI: 10.1145/1122018.1122082
P. McQuaid
{"title":"Profiling software complexity","authors":"P. McQuaid","doi":"10.1145/1122018.1122082","DOIUrl":"https://doi.org/10.1145/1122018.1122082","url":null,"abstract":"This paper deals with a new perspective on complexity metrics and their uses during the testing phase of software development. In keeping with traditional viewpoints, the complexity of a code fragment is assumed to be correlated with its error-proneness or its maintenance difficulty, so that the higher the complexity, the more likely the existence of errors. While the theories advocated here are applicable to any procedural language, the prototype version currently under development is based on Ada.","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":"132060872","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}
ACM-SE 33Pub Date : 1995-03-17DOI: 10.1145/1122018.1122059
N. Guerroudji
{"title":"Logical model for administration policy specification","authors":"N. Guerroudji","doi":"10.1145/1122018.1122059","DOIUrl":"https://doi.org/10.1145/1122018.1122059","url":null,"abstract":"The administration system has as its mission the management and the control of distributed systems to which it is associated. Administration policies are very important to study so that managers can specify and represent complex systems in order to automate systems administration. In general, administration policies within large distributed systems are very complex, since technical and social models and policies vary considerably from one management model to another.Indeed, often every organisation has its own administration policies regarding to its objectives. Furthermore, the focal point for standardisation and research on management of networks and distributed system, is the modelling and the management of communication resources while the definition and the specification of administration policies is too often partially or full ignored. In this paper, the main objective is the design of a logical model for specification of administration policies using defeasible deontic logic.","PeriodicalId":349974,"journal":{"name":"ACM-SE 33","volume":"49 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":"133204554","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}
ACM-SE 33Pub Date : 1995-03-17DOI: 10.1145/1122018.1122034
Edward T. Hammerand, Gidget R. Smith
{"title":"Analysis of primary extent algorithms for ray tracing","authors":"Edward T. Hammerand, Gidget R. Smith","doi":"10.1145/1122018.1122034","DOIUrl":"https://doi.org/10.1145/1122018.1122034","url":null,"abstract":"Ray tracing renders realistic images of scenes but requires a relatively large amount of time. Ray tracing is so named because it traces backward along the rays of light reaching an observer's eye, through each pixel of the computer screen, to determine which object in a scene is the source of the light for that ray. To do this, a minimum intersection time, if any, for the ray and each object in the scene is found to determine which object is intersected first. To reduce the calculation time, extents are formed around the objects in the scene; these are bounding rectangles determined in screen coordinates. A ray-extent intersection calculation is fast when compared with that of a ray and a more complex object, such as a sphere, cylinder, cone, or torus. An analysis suggested by earlier work in hidden-surface elimination is carried out here with respect to extent algorithms. The intent is to methodically characterize different methods and orderings in which extents can be used and determine which, if any, performs well consistently. One of the algorithms arrived at will be shown to be particularly effective.","PeriodicalId":349974,"journal":{"name":"ACM-SE 33","volume":"1 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":"129067703","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}
ACM-SE 33Pub Date : 1995-03-17DOI: 10.1145/1122018.1122042
Yun Wang
{"title":"Facets: a new algorithm for extracting 3-D surface from volume data","authors":"Yun Wang","doi":"10.1145/1122018.1122042","DOIUrl":"https://doi.org/10.1145/1122018.1122042","url":null,"abstract":"Three dimensional surface reconstruction from volume data is very useful in medical imaging, scientific visualization and geometric modeling. Given a set of uniform sampled 3-D volume data, the problem of surface construction is to interpolate or approximate the three dimensional surface from it. A simple and efficient method, Facets, is proposed to extract the accurate and continuous surface with consistent topology.","PeriodicalId":349974,"journal":{"name":"ACM-SE 33","volume":"143 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":"131463917","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}
ACM-SE 33Pub Date : 1995-03-17DOI: 10.1145/1122018.1122071
W. Li
{"title":"Building efficient incremental LL parser by augmenting LL table and threading parse tree","authors":"W. Li","doi":"10.1145/1122018.1122071","DOIUrl":"https://doi.org/10.1145/1122018.1122071","url":null,"abstract":"Incremental parsing is widely used in syntax-directed editors and incremental compilation and interpretive environments. Reparsing of modified input strings is the most frequently performed operation in these environments and its efficiency can greatly affect the success of such environments. Incremental parsers attempt to minimize the reparsing process when a change from an input string xyz to xy'z is made. A number of algorithms have been proposed for LR incremental parsers, but few have been proposed for LL incremental parsers [1, 2]. Both of the LL-based algorithms in these papers attempt to minimize the reparsing on the original parse tree and the parse table. From this point of view, both algorithms have a limit on their maximum attempt. On the contrary to their approaches, we introduce a threaded link in the parse tree (termed threaded parse tree) and an additional entry, distance, in the LL parse table (termed augmented LL parse table). A more efficient LL parser based on the threaded parse tree and augmented LL table has then been developed. This parser benefits greatly from its maximal reuse of its previously established parse tree and its earliest possible detection of unnecessary reparsing. The algorithm presented works optimally over block and right-recursive list structured languages as these are its unit of consideration for the reuse.","PeriodicalId":349974,"journal":{"name":"ACM-SE 33","volume":"18 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":"122587381","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}
ACM-SE 33Pub Date : 1995-03-17DOI: 10.1145/1122018.1122056
F. Lee, Richard Jou
{"title":"Efficient parallel geometric algorithms on a mesh of trees","authors":"F. Lee, Richard Jou","doi":"10.1145/1122018.1122056","DOIUrl":"https://doi.org/10.1145/1122018.1122056","url":null,"abstract":"In this paper, we present some efficient parallel geometric algorithms for computing the All Nearest Neighbors, Delaunay Triangulation, Convex Hull, and Voronoi Diagram of a point set S with N points in the plane. The algorithm of All Nearest Neighbors is to find the nearest-neighbor point for each point in S. It can be applied to cluster analysis, classification theory and computational geometry. A Delaunay Triangulation of S is an triangulation in which the circumcircle of each triangle contains no any other point of S. Delaunay Triangulation has practical applications on finite-element method, computational fluid dynamics, geometric modeling, visualization, numerical analysis, and computational geometry. The Convex Hull of S is the smallest convex polygon that includes all the points of S. Convex hull has many applications in pattern recognition, image processing, stock cutting and allocation, and computational geometry. The straight-line dual of a Voronoi Diagram is a Delaunay Triangulation. Voronoi Diagram is a very useful data structure for robotics, image processing, graph theory, computational fluid dynamics, and computational geometry. We use a mesh of trees with N × N processors as the computation model. All of these parallel algorithms have the same good time complexity O (log N) [1][9].","PeriodicalId":349974,"journal":{"name":"ACM-SE 33","volume":"83 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":"116840365","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}
ACM-SE 33Pub Date : 1995-03-17DOI: 10.1145/1122018.1122040
D. Gotterbarn, Robert Riser, Suzanne Smith
{"title":"The inverted functional matrix: a new approach to project intensive software engineering courses","authors":"D. Gotterbarn, Robert Riser, Suzanne Smith","doi":"10.1145/1122018.1122040","DOIUrl":"https://doi.org/10.1145/1122018.1122040","url":null,"abstract":"The inverted functional matrix provides a new approach to organizing and managing projects in software engineering courses. The model simulates real-world software development and provides meaningful and varied experiences for students. Individual teams are functional units, responsible for different life cycle phases. The Inverted Functional Matrix is so named because the students are distributed to successive functional teams of a single project rather than, as in a traditional functional matrix, working on a single functional team which is then distributed across multiple projects. The entire class is organized to work on a single project, and all students serve on either multiple teams, in multiple life cycle phases, or on an entire life cycle support team. Details of the project organization, team structure, management and assessment issues, and benefits of this approach are discussed.","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":"129316533","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}
ACM-SE 33Pub Date : 1995-03-17DOI: 10.1145/1122018.1122046
Vidyadhar Phalke
{"title":"A time invariant working set model for independent reference","authors":"Vidyadhar Phalke","doi":"10.1145/1122018.1122046","DOIUrl":"https://doi.org/10.1145/1122018.1122046","url":null,"abstract":"Under the Independent Reference Model (IRM) of program behavior, we study properties of the C space-time products as defined by Prieve and Fabry [21] for variable memory management algorithms. In particular, we look at the behavior of Denning's Working Set [11] and VMIN [21] algorithms. From the observed properties of these algorithms, we derive an algorithm which either keeps a page always in memory, or does not keep it at all. We show the online optimality of this algorithm under the assumption that the access probabilities are known a priori. Further, we propose a practical version of this algorithm for database and disk buffer management. By using our algorithm, we obtained space-time product improvements up to 41% over the Working Set algorithm.","PeriodicalId":349974,"journal":{"name":"ACM-SE 33","volume":"27 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":"126125995","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}
ACM-SE 33Pub Date : 1995-03-17DOI: 10.1145/1122018.1122054
John D. McCalpin, M. Smotherman
{"title":"Automatic benchmark generation for cache optimization of matrix operations","authors":"John D. McCalpin, M. Smotherman","doi":"10.1145/1122018.1122054","DOIUrl":"https://doi.org/10.1145/1122018.1122054","url":null,"abstract":"Computationally intensive algorithms must usually be restructured to make the best use of cache memory in current high-performance, hierarchical memory computers. Unfortunately, cache conscious algorithms are sensitive to object sizes and addresses as well as the details of the cache and translation lookaside buffer geometries, and this sensitivity makes both automatic restructuring and hand-turning difficult tasks. An optimization approach is presented in this paper that automatically generates and executes a benchmark program from a concise specification of the algorithm's structure. This technique provides the performance data needed for verification of code generation heuristics or search among the various restructuring options. Matrix transpose and matrix multiplication are examined using this approach for several workstations with restructuring options of loop order, tiling (blocking), and unrolling.","PeriodicalId":349974,"journal":{"name":"ACM-SE 33","volume":"1 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":"131237079","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}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
