By Topic

Applied Computing, 1991., [Proceedings of the 1991] Symposium on

Date 3-5 April 1991

Filter Results

Displaying Results 1 - 25 of 71
  • 1991 Symposium on Applied Computing (Cat. No.91TH0355-8)

    Publication Year: 1991
    Request permission for commercial reuse | PDF file iconPDF (30 KB)
    Freely Available from IEEE
  • Estimating marginal costs for increased capacity in a local area network

    Publication Year: 1991, Page(s):53 - 58
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (428 KB)

    Presents a methodology for calculating the marginal cost of adding additional workstations to a local area network (LAN). A base LAN is presented, and the four areas of hardware, software, training, and support, where additional capacity is often added, are considered. Each of these areas has different technical concerns and within an area, the marginal cost depends on the available capacity of it... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A linear algebraic approach to queueing theory

    Publication Year: 1991, Page(s):200 - 202
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (988 KB)

    A survey of the basic formulas of queueing theory is presented, indicating their limitations in dealing with non-exponential service time distributions and non-steady-state behavior. The authors then describe a linear algebraic formulation which is a complete procedure for dealing with non-exponential servers. The formulation is invariant to a class of similarity transformations and thus does not ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integration of database systems and Smalltalk

    Publication Year: 1991, Page(s):393 - 402
    Cited by:  Papers (2)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    The authors present an object-oriented data model, that allows uniform specification of database requests and application programs. The user interface is based on Smalltalk, and the object-oriented data model is represented in terms of classes and messages. Techniques are discussed for implementing such a model on top of an underlying relational database system. Those parts of application programs... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A public-key based dynamic password scheme

    Publication Year: 1991, Page(s):430 - 435
    Cited by:  Papers (5)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB)

    A dynamic password authentication scheme based on public-key concept is proposed. The login password is changed dynamically and users can use this scheme within a remote login environment. Since we employ the public-key concept to bind each user's password to that user's identification, we eliminate the necessity for the system to store the encrypted password file. This approach has greatly reduce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data compression and database performance

    Publication Year: 1991, Page(s):22 - 27
    Cited by:  Papers (28)  |  Patents (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (452 KB)

    Data compression is widely used in data management to save storage space and network bandwidth. The authors outline the performance improvements that can be achieved by exploiting data compression in query processing. The novel idea is to leave data in compressed state as long as possible, and to only uncompress data when absolutely necessary. They show that many query processing algorithms can ma... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Centralized multi-point routing in wide area networks

    Publication Year: 1991, Page(s):46 - 52
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    Proposed novel applications, such as pay TV on demand, require point to multi-point routing for efficient bandwidth utilization. Finding the optimal point to multi-point route in a network is equivalent to finding the minimum cost spanning tree that spans a subset of the network nodes. This is the well known Steiner tree problem, which is NP complete. Efficient heuristics are, however, available t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • k-way merging and k-ary sorts

    Publication Year: 1991
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (80 KB)

    A divide-and-conquer algorithm is given for merging k sorted lists, namely, recursively merge the first [k/2] lists, do likewise for the last [k/2] lists, then merge the two results. The author gets a tight bound for the expense of the worst case behavior of this merge. He shows the algorithm is cheapest among all similar divide-and-conquer approaches to k-way merging. He computes the expense of t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Object-oriented design for automatic data acquisition

    Publication Year: 1991, Page(s):389 - 392
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB)

    The authors discuss software development for automatic data acquisition in a resistivity measurement system, and use it as an example to examine the object-oriented design principle for scientific computation. The literature in software methodology for scientific computing is relatively scanty so far, this paper serves as a contribution to the exploration of this area View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A branch oriented key management solution to dynamic access control in a hierarchy

    Publication Year: 1991, Page(s):422 - 429
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB)

    A branch oriented key management scheme whose security is based on solving discrete logarithms is proposed. The key management problems which exist in the multilevel security environment can be overcome. The authors scheme is elegant, simple, general and suitable for the dynamic access control in a hierarchy View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel processing laboratory for optimal clustering methods

    Publication Year: 1991
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (72 KB)

    Many clustering problems are highly dependent on optimization techniques and the use of Monte Carlo methods. A discussion is provided for providing a transputer based laboratory and how such a laboratory can be used to investigate optimal clustering methods View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Equidepth partitioning of a data set based on finding its medians

    Publication Year: 1991, Page(s):92 - 101
    Cited by:  Papers (1)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    One of the techniques to estimate selectivities of query predicates is by generating equidepth partitions for a relation and maintaining equidepth histograms. The paper presents a new technique to generate equidepth partitions for a secondary memory resident relation using a linear median find algorithm. A variation of this technique, which involves sorting of the individual blocks, is also propos... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and implementation of an ER query and update interface

    Publication Year: 1991, Page(s):325 - 334
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB)

    The author discusses a method for implementing an entity-relationship (ER) query and update interface called ERQUI. The approach is based on using a relational database management system as a major component of the ERQUI system architecture. During the process of manipulation of ER diagrams the information needed to generate an equivalent SQL query or update is accumulated in a specially designed ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Processor scheduling and concurrency control in real-time main memory databases

    Publication Year: 1991, Page(s):12 - 21
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    Databases are increasingly being used in real-time applications where timeliness of a result is part of the correctness criterion. Time constrained resource scheduling is one of the critical issues for real-time systems. The paper proposes new CPU scheduling and locking-based concurrency control algorithms for RTDBSs. Furthermore, a real-time timestamp-based concurrency is also presented, to compa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient simulated annealing algorithm for graph bisectioning

    Publication Year: 1991, Page(s):65 - 68
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB)

    A new simulated annealing algorithm for solving the graph bisectioning problem is proposed. The authors run their simulated annealing algorithm, the Kernighan-Lin algorithm, and the Saab-Rao algorithms on the same set of random graphs with 50 to 500 nodes and compare their performances. Experiments show that their simulated annealing algorithm provides lower bisection cost than the Kernighan-Lin a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Heuristic routing algorithms for the switch box routing problems

    Publication Year: 1991, Page(s):37 - 45
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    Switch box routing problems, for PC boards and VLSI, can be considered as generalized planning problems. A subgoal is to find a connection for each net. The search and backtrack techniques must be used to solve the problem. One difficulty of this particular routing problem is the interdependency among the connections. To cope with this problem, the graceful retreat and least impact policies are us... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On flow control mechanisms and their impacts upon statistical databases

    Publication Year: 1991, Page(s):150 - 155
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (420 KB)

    The effect of mixing two or more independently designed data security policies has not been well analyzed. There has been concern that it may create unexpected violations. The authors show that the widely used *-property flow control policy in multi-level data security systems can contribute to the compromise of statistical databases. They further conclude that additions of unclassified data into ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using handheld computers to improve efficiency in oil industry field operations

    Publication Year: 1991
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (76 KB)

    Handheld computers are being used to improve efficiency in oil industry field operations. Field data is recorded electronically with the handheld unit rather than being written on a paper report. After the data is collected, it is uploaded into a PC database in the field office where timely reports and data analysis are produced that support the decision-making process in the field. Handheld compu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the 2×2 matrix multiplication

    Publication Year: 1991, Page(s):458 - 464
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB)

    In SIAM J. Comput., vol.5, p.187-203 (1976), R.L. Probert proved that 15 additive operations are necessary and sufficient to multiply two 2×2 matrices over the binary field by a bilinear algorithm using seven non-scalar multiplications. The author proves this result for arbitrary field. The algorithm of Winograd is used to classify all such algorithms (S. Winograd, 1971) View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Creating user interfaces with Agentsheets

    Publication Year: 1991, Page(s):190 - 196
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (532 KB)

    Building user interfaces with tool boxes has limitations. Most of them allow users to build basic interfaces efficiently on a high level of abstraction. However, when users have needs for new building blocks, which cannot be composed of existing ones, users have to fall back on the low level of abstraction provided by conventional programming languages. Agentsheets address this problem by introduc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Inheritance and subtyping [object-oriented databases]

    Publication Year: 1991, Page(s):382 - 388
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB)

    A method for implementing subtyping and inheritance, as independent features of object-oriented languages, is presented. There are at least two reasons for decoupling subtyping from inheritance: the negative influence on encapsulation and the different perspective of specification inheritance (subtyping) and implementation inheritance (code sharing). Subtyping and inheritance are defined in two in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Migration to a distributed architecture for the Space Shuttle flight planning system

    Publication Year: 1991, Page(s):226 - 235
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (880 KB)

    A system modeling approach was applied to the migration of Space Shuttle flight planning applications from a centralized computer to a distributed architecture. Four steps were performed in this approach: characterization of the current flight planning systems workloads, data and components: modeling of workload and usage on the current system; selection of a distributed architecture as candidate ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relating hierarchy design back to their predecessors

    Publication Year: 1991, Page(s):412 - 421
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (740 KB)

    In the development of medium to large software projects the design of the system experiences several revisions. This paper presents a method to relate a design back to an earlier version by mapping the various components of the design. Each component of a hierarchy design presents a different type and amount of information that can be used in the mappings. The `effectiveness' of a component's info... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recovery of shape and motion parameters for polyhedron-like objects

    Publication Year: 1991, Page(s):448 - 456
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    A discussion is given on the problem of determining the shape of an object and the parameters that describe a rigid motion of the object, from an analysis of two noisy, and perhaps incomplete, perspective images of the object. One image is taken before and the other is taken after the rigid motion. The authors present a practical approach that applies to polyhedron-like objects. They compare the r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A project engineering tool to assist in the development and maintenance of project life cycles

    Publication Year: 1991, Page(s):119 - 122
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB)

    The paper discusses the existing problems in developing and maintaining project life cycles and proposes a tool as a possible solution. This tool is part of an integrated tool set, called Project Engineer, which has been designed to support the maintenance of software projects from a project management perspective. A PC platform is chosen and the user interface is based on Microsoft Windows 3.0. O... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.