E1AR0002@SMUVM1.BITNET (03/06/86)
requests for copies should be addressed to cindy hathaway, technical reports secretary, computer science department, louisiana state university, baton rouge, louisiana 70803, or cindy@lsu on csnet %H PA %A I. F. Akyildiz %A A. Bluemle %A T. Ruf %T Hybrid Simulation eines Multiprozessorsystems mit Prozesssynchronisation %J International ASIM Conference for Simulation Technique %C Vienna %D 1984 %H PA %A I. F. Akyildiz %A G. R. Bolch %T Analytical Methods for Computer Systems Performance Modelling %J Proceedings of the International AMSE Conference on Modelling and Simulation %V 1.4 %P 61-73 %C Athens %D 1984 %H PA %A I. F. Akyildiz %A G. R. Bolch %T A Storage and Run-Time Reducing Method for Queueing Network Models of Computer Systems %J Proceedings of the International AMSE Conference on Modelling and Simulation %V 1.4 %C Athens %P 75-85 %D 1984 %H PA %A I. F. Akyildiz %A G. R. Bolch %A M. Pateork %T Erweiterte Parametrische Analyse--eine flexible Methode zur Analyse von Warteschlangenmodellen %J Workshop on the Performance Evaluation of Computer Systems and Communication Networks %C Stuttgart %D 1984 %H PA %A Duncan A. Buell %T On a Problem Involving Partitions %J Congressus Numerantium %V 43 %D 1984 %P 191-200 %H PA %A Duncan A. Buell %T A Retrieval System for Well Information Data %J Computers and Geosciences %V 10 %D 1984 %H PA %A Duncan A. Buell %T The Expectation of Success Using a Monte Carlo Factoring Method--Some Statistics on Quadratic Class Numbers %J Mathematics of Computation %V 43 %D 1984 %P 313-327 %H PA %A Duncan A. Buell %A Richard H. Hudson %T Solutions of Certain Quaternary Quadratic Forms %J Pacific Journal of Mathematics %V 114 %D 1984 %P 23-45 %H PA %A Duncan A. Buell %A Richard H. Hudson %T On Runs of Consecutive Quadratic Residues and Quadratic Nonresidues %J BIT %V 24 %D 1984 %P 243-247 %H PA %A Duncan A. Buell %A Richard H. Hudson %A Kenneth S. Williams %T Extension of a Theorem of Cauchy and Jacobi %J Journal of Number Theory %V 19 %D 1984 %P 309-340 %H PA %A Steve Cater %A S. Iyengar %A John Fuller %T Computation of Logical Effort in High Level Languages %J Journal of Computer Languages %V 9 %D 1984 %H PA %A Hsi Chang %A S. Iyengar %T Efficient Algorithms to Globally Balance a Binary Tree %J Communications of the ACM %D 1984 %V 27 %P 695-702 %H PA %A P. P. Chen %T ER--A User View of the Database Problem %J IEEE Computer %V 17 %D 1984 %H PA %A P. P. Chen %T An Algebra for a Binary Directional Entity-Relationship Model %J Proceedings of the IEEE First International Conference on Data Engineering %C Los Angeles %D 1984 %H PA %A P. P. Chen %T Database Design Using Entities and Relationships %J Data Base Design %C Englewood Cliffs, New Jersey %E S. B. Yao %I Prentice-Hall %D 1984 %H PA %A Donald M. Chiarulli %A W. G. Rudd %A Duncan A. Buell %T DRAFT: A Dynamically Reconfigurable Processor for Integer Arithmetic %J Proceedings of the 7th IEEE Symposium on Computer Arithmetic %P 309-317 %D June 1985 %H PA %A N. K. Gautier %A S. S. Iyengar %T Space and time efficiency of the of forest of quadtrees representation %J Journal of Image and Vision Computing %V 3 %D 1985 %P 63-70 %H PA %A N. Gautier %A S. S. Iyengar %T Performance analysis of TID data structure %J Proceedings of Computer Vision and Pattern Recognition %P 416-419 %D 1985 %H PA %A S. Iyengar %A B. Bastani %T An Experimental Study of the Logical Complexity of Data Structures in Programs %J Proceedings of the Second International Conference on Empirical Foundations and Software Sciences %D 1984 %H PA %A S. Iyengar %A Hsi Chang %T Efficient Algorithms to Create and Maintain Balanced and Threaded Binary Trees %J Software Practice and Experience %D 1984 %H PA %A S. Iyengar %A V. Raman %T Properties of the Hybrid Quadtree %J Proceedings of the 7th International Conference on Pattern Recognition %D 1984 %P 292-294 %H PA %A Bush Jones %T Determination of Unbiased Reconstructions %J International Journal of General Systems %V 10 %D 1984 %H PA %A Bush Jones %T Recent Algorithms of Reconstructability Analysis %J Proceedings of the International Conference on General Systems %C New York %D 1984 %H PA %A Bush Jones %A Leslie P. Jones %A M. Banerjee %T Root Isolation for Transcendental Equations %J The Computer Journal %V 27 %D 1984 %H PA %A Leslie P. Jones %A Jonathan Goldstine %T Unions of Certain Bounded Deterministic Languages %J International Journal of Computer Mathematics %V 16 %P 99-113 %D 1984 %H PA %A Leslie P. Jones %A S. Iyengar %T Space and Time Efficient Virtual Quadtrees %J IEEE-PAMI %V 6 %P 244-247 %D 1984 %H PA %A Donald H. Kraft %A Duncan A. Buell %T Advances in a Bayesian Decision Model of User Stopping Behavior for Scanning the Output of an Information Retrieval System %J Proceedings of the Third BCS/ACM Symposium on Research and Development in Information Retrieval %P 421-433 %D 1984 %H PA %A Abha Moitra %A S. S. Iyengar %T A maximally parallel balancing algorithm for obtaining complete balanced binary trees, %J IEEE Transactions on Computers %V C-34 %D 1985 %H PA %A K. Rao %A S. Iyengar %T A General Measure for Program Complexity %J Proceedings of the Workshop on Software Engineering %P 25-35 %D 1984 %H PA %A W. G. Rudd %A Duncan A. Buell %A Donald M. Chiarulli %T A High Performance Factoring Machine %J Proceedings of the 11th Annual International Symposium on Computer Architecture %D 1984 %P 297-300 %H PA %A David Scott %A S. S. Iyengar %T A new data structure for efficient storing of images %J Pattern Recognition Letters %V 3 %D 1985 %P 211-214 %H TR84-018 %A Krzysztof J. Kochut %T UW LISP Manual %J LSU Computer Science Technical Report 84-018 %H TR84-019 %A Tadeusz Radecki %T Foundations of Fuzzy Information Retrieval %J LSU Computer Science Technical Report 84-019 %H TR84-020 %A Tadeusz Radecki %T A Theoretical Framework for Defining Similarity Measures for Boolean Search Request Formulations, Including Some Experimental Results %J LSU Computer Science Technical Report 84-020 %H TR84-021 %A Tadeusz Radecki %T Probabilistic Methods for Ranking Search Output in Boolean Retrieval Systems %J LSU Computer Science Technical Report 84-021 %H TR84-022 %A Tadeusz Radecki %T Document Ranking Methodology for Conventional Boolean Retrieval Systems %J LSU Computer Science Technical Report 84-022 %H TR84-023 %A Duncan A. Buell %T On Determining the Rank of Certain Elliptic Curves %J LSU Computer Science Technical Report TR84-023 %H TR84-024 %A E. T. Lee %T Similarity Retrieval for Pictorial Databases %J LSU Computer Science Technical Report TR84-024 %H TR84-025 %A E. T. Lee %T Application of Fuzzy Languages to Medical Pattern Recognition %J LSU Computer Science Technical Report TR84-025 %H TR84-026 %A E. T. Lee %T Similarity Directed Chromosome Image Processing %J LSU Computer Science Technical Report TR84-026 %H TR84-028 %A S. Kundu %T An Inproved Algorithm for Finding a Key of a Relation %J LSU Computer Science Technical Report TR84-028 %H TR84-029 %A S. S. Iyengar %A T. Sadler %A S. Kundu %T A Technique for Representing a Tree Structure with Predicates by a Forest Data Structure %J LSU Computer Science Technical Report TR84-029 %H TR84-030 %A Rajendra T. Dodhiawala %A George R. Cross %T A Distributed Problem-Solving Approach to Point Pattern Matching %J LSU Computer Science Technical Report TR84-030 %H TR84-031 %A J. W. Lewis %A S. S. Iyengar %T Translation Properties and the Space Efficiency of Modified Quadtree Data Structures %J LSU Computer Science Technical Report TR84-031 %H TR84-032 %A Sukhamay Kundu %T An Entity-Relationship Like Data Model Without the Relationships %J LSU Computer Science Technical Report TR84-032 %H TR84-033 %A Weishing Chen %A S. Sitharama Iyengar %T Design and Implementation of a Complete Binary Tree Systems for the Activation of Concurrent Processes %J LSU Computer Science Technical Report TR84-033 %H TR84-034 %A W. G. Rudd %A George R. Cross %T Design of an Expert System for Insect Pest Management %J LSU Computer Science Technical Report TR84-034 %H TR85-001 %A George R. Cross %A Ellen R. Foxman %A Daniel L. Sherrell %T Using an Expert System to Teach Marketing Strategy %J LSU Computer Science Technical Report TR85-001 %H TR85-002 %A F. B. Bastani %A S. S. Iyengar %A I. L. Yen %T Concurrent Maintenance of Multilevel Data Structures %J LSU Computer Science Technical Report TR85-002 %H TR85-003 %A Cary G. deBessonet %A George R. Cross %T An Artificial Intelligence Application in the Law: CCLIPS, A Computer Program that Processes Legal Information %J LSU Computer Science Technical Report TR85-003 %H TR85-004 %A David M. Lee %T Questions, Tables and the Relational Model for Databases %J LSU Computer Science Technical Report TR85-004 %H TR85-005 %A I. F. Akyildiz %T Exact Analysis of Closed Tandem Queueing Networks with Blocking %J LSU Computer Science Technical Report TR85-005 %H TR85-006 %A I. F. Akyildiz %T Exact Analysis of Multiple Server Queueing Networks with Finite Station Capacities %J LSU Computer Science Technical Report TR85-006 %H TR85-007 %A I. F. Akyildiz %T Approximative Produktformloesungen fuer Geschlossene Warteschlangennetze mit Blockierung %J LSU Computer Science Technical Report TR85-007 %H TR85-008 %A S. V. Nageswara Rao %A S. S. Iyengar %T A Comparative Study of Multiple Attribute Tree and Inverted Files for Large Bibliographic Files %J LSU Computer Science Technical Report TR85-008 %H TR85-009 %A S. V. Nageswara Rao %A S. S. Iyengar %T Attribute Ranking Problem in MAT Data Structure %J LSU Computer Science Technical Report TR85-009 %H TR85-010 %A Sukhamay Kundu %T An Optimal O(n log n) Algorithm for Determining the Redundant Inequalities in Defining a 2-Dimensional Polygon %J LSU Computer Science Technical Report TR85-010 %H TR85-011 %A G. Barbara Demo %A Sukhamay Kundu %T Analysis of the Context Dependency of Codasyl Find-Statements with Application to Database Program Conversion %J LSU Computer Science Technical Report TR85-011 %H TR85-012 %A Arie Zvieli %A Peter P. Chen %T Entity-Relationship Modeling of Fuzzy Data %J LSU Computer Science Technical Report TR85-012 %H TR85-013 %A Bush Jones %T A Greedy Algorithm for a Generalization of the Reconstruction Problem %J LSU Computer Science Technical Report TR85-013 %H TR85-014 %A Bush Jones %T The Cognitive Content of System Substates %J LSU Computer Science Technical Report TR85-014 %H TR85-015 %A Bush Jones %T Reconstructability Analysis of General Functions %J LSU Computer Science Technical Report TR85-015 %H TR85-016 %A Bush Jones %T Reconstructability Considerations with Arbitrary Data %J LSU Computer Science Technical Report TR85-016 %H TR85-017 %A Bush Jones %T K-Systems Analysis versus Classical Multivariate Analysis %J LSU Computer Science Technical Report TR85-017 %H TR85-018 %A N. Chandrasekaran %A V. S. Lakshaman %A S. S. Iyengar %A C. E. Venimadhavan %A P. S. Chen %T A Denotational Semantics for the Generalized Entity Relationship Model and a Simpler Algebra %J LSU Computer Science Technical Report TR85-018 %H TR85-019 %A I. F. Akyildiz %T Iterative Numerical Analysis for State Reduced Blocking Systems (INABSY) %J LSU Computer Science Technical Report TR85-019 %H TR85-020 %A I. F. Akyildiz %A G. R. Bolch %A M. Paterok %T Die Erweiterte Parametrische Analyse fuer geschlossene Warteschlangennetze %J LSU Computer Science Technical Report TR85-020 %H TR85-021 %A I. F. Akyildiz %A G. R. Bolch %T Mean Value Analysis Approximation for Multiple Server Networks %J LSU Computer Science Technical Report TR85-021 %H TR85-022 %A I. F. Akyildiz %T Approximate Product Form Solutions for Queueing Networks with Blocking %J LSU Computer Science Technical Report TR85-022 %H TR85-023 %A I. F. Akyildiz %A A. Bluemle %A T. Ruf %T Simulation von Multiprozessorsystemen mit und ohne Prozessblockierung %J LSU Computer Science Technical Report TR85-023 %H TR85-024 %A I. F. Akyildiz %A G. R. Bolch %A M. Paterok %T Reduction Method for Computer Systems Performance %J LSU Computer Science Technical Report TR85-024 %H TR85-025 %A I. F. Akyildiz %A A. Bluemle %A T. Ruf %T On the Simulation of a Multiprocessorsystem with Synchronisation based upon Producer/Consumer Relationship %J LSU Computer Science Technical Report TR85-025 %H TR85-026 %A I. F. Akyildiz %T Exact Product Form Solutions for Queueing Networks with Blocking %J LSU Computer Science Technical Report TR85-026 %H TR85-027 %A Duncan A. Buell %T A Note on Cunningham Chains %J LSU Computer Science Technical Report TR85-027 %H TR85-028 %A Sukhamay Kundu %T A Theory of Multi-Relations for Uncertain Facts %J LSU Computer Science Technical Report TR85-028 %H TR85-029 %A S. V. Nageswara Rao %A S. S. Iyengar %T Range Search and Dynamization Algorithms in Multiple Attribute Tree %J LSU Computer Science Technical Report TR85-029 %H TR85-030 %A S. V. Nageswara Rao %A S. S. Iyengar %T Multiple Attribute Tree Structure %H TR85-031 %A S. V. Nageswara Rao %A S. S. Iyengar %T Recursive Rebuilding Technique for Dynamizing Data Structures %J LSU Computer Science Technical Report TR85-031 %H TR85-032 %A Rajendra T. Dodhiawala %A George R. Cross %T Analysis of Cosmic Ray Tracks Using Distributed Problem-Solving %J LSU Computer Science Technical Report TR85-032 %H TR85-033 %A George R. Cross %A Cary G. deBessonet %A Teri Broemmelsiek %A Glynn Durham %A Rittick Gupta %A Mohd Nasiruddin %T The Implementation of CCLIPS %J LSU Computer Science Technical Report TR85-034 %H TR85-034 %A Mohd. Nasiruddin %A M. Srikanth %A George R. Cross %T A Confidence Factor Extension to the YAPS Expert System Development Tool %J LSU Computer Science Technical Report TR85-034 %H TR85-035 %A Cary G. deBessonet %A George R. Cross %T Some AI Techniques Used for Decision Making in Conceptual Retrieval %J LSU Computer Science Technical Report TR85-035 %H TR85-036 %A S. V. Nageswara Rao %A S. Sitharama Iyengar %T Dynamization of Heap Balanced Binary Tree, and Multiple Attribute Tree %J LSU Computer Science Technical Report TR85-036 %H TR85-037 %A Cary G. deBessonet %A George R. Cross %T Distinguishing Legal Language-Types for Conceptual Retrieval %J LSU Computer Science Technical Report TR85-037 %H TR85-038 %A Zvieli Arie %T A Fuzzy Relational Calculus %J LSU Computer Science Technical Report TR85-038