Testing simple polygons - Arkin,Esther M.; Belleville,Patrice; Mitchell,Joseph S.B.; Mount, Dave; Romanik,Kathleen; Salzberg,Steven; Souvaine,Diane (Computational Geometry, 1997)
We consider the problem of verifying a simple polygon in the plane using “test points”. A test point is a geometric probe that takes as input a point in Euclidean space, and returns “+” if the point is inside the object being probed or “−” if it is outside. A verification procedure takes as input a description of a target object, including its location and orientation, and it produces a set of test points that are used to verify whether a test object matches the description. We give a procedure for verifying an n-sided, non-degenerate, simple target polygon using 5n test points. This testing strategy works even if the test polygon has n + 1 vertices, and we show a lower bound of 3n + 1 test points for this case. We also give algorithms using O(n) test points for simple polygons that may be degenerate and for test polygons that may have up to n + 2 vertices. All of these algorithms work for polygons with holes. We also discuss extensions of our results to higher dimensions.
Keywords: probing; Testing; Verifying

Titan: a High-Performance Remote-sensing Database - Bongki,C. C; Chang,C.; Moon,B.; Acharya, A.; Shock,C.; Sussman, Alan; Saltz, J. (In Proceedings of the 1997 International Conference on Data Engineering, 1997)

Toward motion picture grammars - Bolle,Ruud; Aloimonos, J.; Fermüller, Cornelia (Computer Vision — ACCV'98Computer Vision — ACCV'98, 1997)
We are interested in processing video data for the purpose of solving a variety of problems in video search, analysis, indexing, browsing and compression. Instead of concentrating on a particular problem, in this paper we present a framework for developing video applications. Our basic thesis is that video data can be represented at a higher level of abstraction as a string generated by a grammar, termed motion picture grammar. The rules of that grammar relate different spatiotemporal representations of the video content and, in particular, representations of action.

The vegetation canopy lidar mission - Dubayah, R.; Blair,J. B.; Bufton,J. L.; Clark,D. B.; JaJa, Joseph F.; Knox,R.; Luthcke,S. B.; Prince,S.; Weishampel,J. (Proceedings of Land Satellite Information in the Next Decade, II: Sources and Applications. Bethesda (MD): American Society of Photogrammetry and Remote Sensing, 1997)
The Vegetation Canopy Lidar (VCL) is the first selected mission of NASA’s new EarthSystem Science Pathfinder program. The principal goal of VCL is the characterization of the three-dimensional structure of the earth; in particular, canopy vertical and horizontal structure and land surface topography. Its primary science objectives are: landcover characterization for terrestrial ecosystem modeling, monitoring and prediction; landcover characterization for climate modeling and prediction; and, production of a global reference data set of topographic spot heights and transects. VCL will provide unique data sets for understanding important environ- mental issues including climatic change and variability, biotic erosion and sustainable landuse, and will dramatically improve our estimation of global biomass and carbon stocks, fractional forest cover, forest extent and condition. It will also provide canopy data critical for biodiversity, natural hazard, and climate studies. Scheduled for launch in early 2000, VCL is an active lidar remote sensing system consisting of a five-beam instrument with 25 m contiguous along track resolution. The five beams are in a circular configuration 8 km across and each beam traces a separate ground track spaced 2 km apart, eventually producing 2 km coverage between 65° N and S. VCL’s core measurement objectives are: (1) canopy top heights; (2) vertical distribution of intercepted surfaces (e.g. leaves and branches); and, (3) ground surface topographic elevations. These measurements are used to derive a variety of science data products including canopy heights, canopy vertical distribution, and ground elevations gridded monthly at 1° resolution and every 6 months at 2 km resolution, as well as a 2 km fractional forest cover product.

Visual surveillance of human activity - Davis, Larry S.; Fejes,S.; Harwood,D.; Yacoob,Yaser; Hariatoglu,I.; Black,M. (Computer Vision—ACCV'98, 1997)

A zooming web browser - Bederson, Benjamin B.; Hollan,J.D.; Stewart,J.; Rogers,D.; Druin, Allison; Vick,D.; Ring,L.; Grose,E.; Forsythe,C. (Human Factors in Web Development, 1997)

Directions of motion fields are hardly ever ambiguous - Brodsky, Tomas; Fermüller, Cornelia; Aloimonos, J. (Computer Vision — ECCV '96Computer Vision — ECCV '96, 1996)
Recent literature [7, 10, 11, 9, 13, 17] provides a number of results regarding uniqueness aspects of motion fields and exact image displacements due to 3-D rigid motion. Here instead of the full motion field we consider only the direction of the motion field due to a rigid motion and ask what can we say about the three-dimensional motion information contained in it. This paper provides a geometric analysis of this question based solely on the fact that the depth of the surfaces in view is positive (i.e. that the surface in view is in front of the camera). With this analysis we thus offer a theoretical foundation for image constraints employing only the sign of flow in various directions and provide a solid basis for their utilization in addressing 3D dynamic vision problems.

Efficient local model-checking for fragments of the modal $μ$-calculus - Bhat,G.; Cleaveland, Rance (Tools and Algorithms for the Construction and Analysis of Systems, 1996)

Efficient model checking via the equational μ-calculus - Bhat,G.; Cleaveland, Rance (, Eleventh Annual IEEE Symposium on Logic in Computer Science, 1996. LICS '96. Proceedings, 1996)
This paper studies the use of an equational variant of the modal μ-calculus as a unified framework for efficient temporal logic model checking. In particular we show how an expressive temporal logic, CTL*, may be efficiently translated into the μ-calculus. Using this translation, one may then employ μ-calculus model-checking techniques, including on-the-fly procedures, BDD-based algorithms and compositional model-checking approaches, to determine if systems satisfy formulas in CTL*
Keywords: Automata; BDD-based algorithms; Boolean functions; Calculus; compositional model-checking approaches; computational complexity; Computer science; CTL*; Data structures; Encoding; equational variant; equational μ-calculus; Equations; expressive temporal logic; Logic; Maintenance; modal μ-calculus; Model checking; on-the-fly procedures; Surges; temporal logic; temporal logic model checking; unified framework

The empirical investigation of Perspective-Based Reading - Basili, Victor R.; Green,Scott; Laitenberger,Oliver; Lanubile,Filippo; Shull, Forrest; Sørumgård,Sivert; Zelkowitz, Marvin V (Empirical Software Engineering, 1996)
We consider reading techniques a fundamental means of achieving high quality software. Due to the lack of research in this area, we are experimenting with the application and comparison of various reading techniques. This paper deals with our experiences with a family of reading techniques known as Perspective-Based Reading (PBR), and its application to requirements documents. The goal of PBR is to provide operational scenarios where members of a review team read a document from a particular perspective, e.g., tester, developer, user. Our assumption is that the combination of different perspectives provides better coverage of the document, i.e., uncovers a wider range of defects, than the same number of readers using their usual technique.
Keywords: Computer; Science

Evolutionary biology of parasitic platyhelminths: The role of molecular phylogenetics - Blair,D; Campos,A.; Cummings, Michael P.; Laclette,J. P (Parasitol Today, 1996)
As our appreciation of the diversity within the flatworms has grown, so too has our curiosity about the ways in which these varied creatures are related to one another. In particular, the parasitic groups (trematodes, cestodes and monogeneans have been the focus of enquiry. Until recently, morphology, anatomy and life histories have provided the raw data for building hypotheses on relationships. Now, ultrastructural evidence, and most recently, molecular data from nucleic acid sequences, have been brought to bear on the topic. Here, David Blair, Andrés Campos, Michael Cummings and Juan Pedro Laclette discuss the ways in which molecular data, in particular, are helping us recognize the various lineages of flatworms.

A fast parallel algorithm for finding the convex hull of a sorted point set - Berkman,O.; Schieber,B.; Vishkin, Uzi (International Journal of Computational Geometry and Applications, 1996)

Fast sorting by reversal - Berman,Piotr; Hannenhalli, Sridhar (Combinatorial Pattern MatchingCombinatorial Pattern Matching, 1996)
Analysis of genomes evolving by inversions leads to a combinatorial problem of sorting by reversals studied in detail recently. Following a series of work recently, Hannenhalli and Pevzner developed the first polynomial algorithm for the problem of sorting signed permutations by reversals and proposed an O(n 4 ) implementation of the algorithm. In this paper we exploit a few combinatorial properties of the cycle graph of a permutation and propose an O(n 2 (n)) implementation of the algorithm where is the inverse Ackerman function. Besides making this algorithm practical, our technique improves implementations of the other rearrangement distance problems.

Feature discovery and classification of Doppler umbilical artery blood flow velocity waveforms - Baykal,Nazife; Reogia,James A.; Yalabik,Nese; Erkmen,Aydan; Beksac,M.Sinan (Computers in Biology and Medicine, 1996)
Doppler umbilical artery blood flow velocity waveform measurements are used in perinatal surveillance for the evaluation of fetal condition. There is an ongoing debate on the predictive value of Doppler measurements concerning the critical effect of the selection of parameters for the interpretation of Doppler waveforms. In this paper, we describe how neural network methods can be used both to discover relevant classification features and subsequently to classify Doppler umbilical artery blood flow velocity waveforms. Results obtained from 199 normal and high risk patients' umbilical artery waveforms highlighted a classification concordance varying from 90 to 98% accuracy.
Keywords: Doppler umbilical artery blood flow velocity waveforms; Feature extraction; IMAGE PROCESSING; Pattern classification

Hybrid network management (communication systems) - Baras,J. S; Ball,M.; Karne,R. K; Kelley,S.; Jang,K.D.; Plaisant, Catherine; Roussopoulos, Nick; Stathatos,K.; Vakhutinsky,A.; Valluri,J. (16th AIAA International Communications Satellite Systems Conference, 1996)
We describe our collaborative efforts towards the design and implementation of a next-generation integrated network management system for hybrid networks (INMS/HN). We describe the overall software architecture of the system at its current stage of development. This NMS is specifically designed to address issues relevant to complex heterogeneous networks consisting of seamlessly interoperable terrestrial and satellite networks. NMSs are a key element for interoperability in such networks. We describe the integration of configuration management and performance management. The next step in this integration is fault management. In particular, we describe the object model, issues concerning the graphical user interface, browsing tools, performance data graphical widget displays, and management information database organization issues.

Incremental data structures and algorithms for dynamic query interfaces - Tanin,Egemen; Beigel,Richard; Shneiderman, Ben (ACM SIGMOD Record, 1996)
Dynamic query interfaces (DQIs) form a recently developed method of database access that provides continuous realtime feedback to the user during the query formulation process. Previous work shows that DQIs are elegant and powerful interfaces to small databases. Unfortunately, when applied to large databases, previous DQI algorithms slow to a crawl. We present a new approach to DQI algorithms that works well with large databases.
Keywords: algorithm; data structure; database; direct manipulation; dynamic query; Information Visualization; user interface

Integrated network management of hybrid networks - Baras,John S; Ball,Mike; Karne,Ramesh K; Kelley,Steve; Jang,Kap D; Plaisant, Catherine; Roussopoulos, Nick; Stathatos,Kostas; Vakhutinsky,Andrew; Jaibharat,Valluri; Whitefield,David (AIP Conference Proceedings, 1996)
We describe our collaborative efforts towards the design and implementation of a next generation integrated network management system for hybrid networks (INMS/HN). We describe the overall software architecture of the system at its current stage of development. This network management system is specifically designed to address issues relevant for complex heterogeneous networks consisting of seamlessly interoperable terrestrial and satellite networks. Network management systems are a key element for interoperability in such networks. We describe the integration of configuration management and performance management. The next step in this integration is fault management. In particular we describe the object model, issues of the Graphical User Interface (GUI), browsing tools and performance data graphical widget displays, management information database (MIB) organization issues. Several components of the system are being commercialized by Hughes Network Systems. © 1996 American Institute of Physics.

Learning activation rules for associative networks - Reggia, James A.; Grundstrom,E.; Berndt,R. S (Neural Networks, 1996., IEEE International Conference on, 1996)

Local tools: an alternative to tool palettes - Bederson, Benjamin B.; Hollan,J.D.; Druin, Allison; Stewart,J.; Rogers,D.; Proft,D. (Proceedings of the 9th annual ACM symposium on User interface software and technology, 1996)

Matching convex polygons and polyhedra, allowing for occlusion - Basri,R.; Jacobs, David W. (Applied Computational Geometry Towards Geometric Engineering, 1996)
We review our recent results on visual object recognition and reconstruction allowing for occlusion. Our scheme uses matches between convex parts of objects in the model and image to determine structure and pose, without relying on specific correspondences between local or global geometric features of the objects. We provide results determining the minimal number of regions required to uniquely determine the pose under a variety of situations, and also showing that, depending on the situation, the problem of determining pose may be a convex optimization problem that is efficiently solved, or it may be a non-convex optimization problem which has no known, efficient solution. We also relate the problem of determining pose using region matching to the problem of finding the transformation that places one polygon inside another and the problem of finding a line that intersects each of a set of 3-D volumes.

Parallel algorithms for image enhancement and segmentation by region growing, with an experimental study - Bader, D.A.; JaJa, Joseph F.; Harwood,D.; Davis, Larry S. (The Journal of Supercomputing, 1996)
This paper presents efficient and portable implementations of a powerful image enhancement process, the Symmetric Neighborhood Filter (SNF), and an image segmentation technique that makes use of the SNF and a variant of the conventional connected components algorithm which we call delta-Connected Components. We use efficient techniques for distributing and coalescing data as well as efficient combinations of task and data parallelism. The image segmentation algorithm makes use of an efficient connected components algorithm based on a novel approach for parallel merging. The algorithms have been coded in Split-C and run on a variety of platforms, including the Thinking Machines CM-5, IBM SP-1 and SP-2, Cray Research T3D, Meiko Scientific CS-2, Intel Paragon, and workstation clusters. Our experimental results are consistent with the theoretical analysis (and provide the best known execution times for segmentation, even when compared with machine-specific implementations). Our test data include difficult images from the Landsat Thematic Mapper (TM) satellite data.

Parallel algorithms for personalized communication and sorting with an experimental study (extended abstract) - Helman,David R.; Bader,David A.; JaJa, Joseph F. (Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures, 1996)

Practical parallel algorithms for dynamic data redistribution, median finding, and selection - Bader, D.A.; JaJa, Joseph F. (Parallel Processing Symposium, 1996., Proceedings of IPPS '96, The 10th International, 1996)
A common statistical problem is that of finding the median element in a set of data. This paper presents a fast and portable parallel algorithm for finding the median given a set of elements distributed across a parallel machine. In fact, our algorithm solves the general selection problem that requires the determination of the element of rank i, for an arbitrarily given integer i. Practical algorithms needed by our selection algorithm for the dynamic redistribution of data are also discussed. Our general framework is a distributed memory programming model enhanced by a set of communication primitives. We use efficient techniques for distributing, coalescing, and load balancing data as well as efficient combinations of task and data parallelism. The algorithms have been coded in SPLIT-C and run on a variety of platforms, including the Thinking Machines CM-5, IBM SP-1 and SP-2, Gray Research T3D, Meiko Scientific CS-2, Intel Paragon, and workstation clusters. Our experimental results illustrate the scalability and efficiency of our algorithms across different platforms and improve upon all the related experimental results known to the authors
Keywords: algorithms; performance; algorithms; scalability; statistical; allocation; balancing; clusters; distributed; CM-5; communication; CS-2; SPLIT-C; Thinking; data; data; median; evaluation; resource; finding; parallel; Gray; Machines; memory; model; dynamic; Paragon; Meiko; primitives; distributed; problem; workstation; Programming; redistribution; load; research; scientific; SP-1; Intel; systems; parallel; T3D; IBM

Practical parallel algorithms for personalized communication and integer sorting - Bader,David A.; Helman,David R.; JaJa, Joseph F. (Journal of Experimental Algorithmics (JEA), 1996)
A fundamental challenge for parallel computing is to obtain high-level, architecture independent, algorithms which efficiently execute on general-purpose parallel machines. With the emergence of message passing standards such as MPI, it has become easier to design efficient and portable parallel algorithms by making use of these communication primitives. While existing primitives allow an assortment of collective communication routines, they do not handle an important communication event when most or all processors have non-uniformly sized personalized messages to exchange with each other. We focus in this paper on the h-relation personalized communication whose efficient implementation will allow high performance implementations of a large class of algorithms. While most previous h-relation algorithms use randomization, this paper presents a new deterministic approach for h-relation personalized communication with asymptotically optimal complexity for h>p2. As an application, we present an efficient algorithm for stable integer sorting. The algorithms presented in this paper have been coded in Split-C and run on a variety of platforms, including the Thinking Machines CM-5, IBM SP-1 and SP-2, Cray Research T3D, Meiko Scientific CS-2, and the Intel Paragon. Our experimental results are consistent with the theoretical analysis and illustrate the scalability and efficiency of our algorithms across different platforms. In fact, they seem to outperform all similar algorithms known to the authors on these platforms.

Simplification envelopes - Cohen,Jonathan; Varshney, Amitabh; Manocha,Dinesh; Turk,Greg; Weber,Hans; Agarwal,Pankaj; Brooks,Frederick; Wright,William (Proceedings of the 23rd annual conference on Computer graphics and interactive techniques, 1996)
Keywords: geometric modeling; hierarchical approximation; levels-of-detail generation; model simplification; offsets; shape approximation

Software synthesis from dataflow graphs - Bhattacharyya, Shuvra S.; Murthy,P. K; Lee,E. A (Springer, 1996)

Spatiotemporal representations for visual navigation - LoongFah Cheong; Fermüller, Cornelia; Aloimonos, J. (Computer Vision — ECCV '96Computer Vision — ECCV '96, 1996)
The study of visual navigation problems requires the integration of visual processes with motor control. Most essential in approaching this integration is the study of appropriate spatio-temporal representations which the system computes from the imagery and which serve as interfaces to all motor activities. Since representations resulting from exact quantitative reconstruction have turned out to be very hard to obtain, we argue here for the necessity of representations which can be computed easily, reliably and in real time and which recover only the information about the 3D world which is really needed in order to solve the navigational problems at hand. In this paper we introduce a number of such representations capturing aspects of 3D motion and scene structure which are used for the solution of navigational problems implemented in visual servo systems. In particular, the following three problems are addressed: (a) to change the robot's direction of motion towards a fixed direction, (b) to pursue a moving target while keeping a certain distance from the target, and (c) to follow a wall-like perimeter. The importance of the introduced representations lies in the following: – They can be extracted using minimal visual information, in particular the sign of flow measurements or the the first order spatiotemporal derivatives of the image intensity function. In that sense they are direct representations needing no intermediate level of computation such as correspondence. – They are global in the sense that they represent how three-dimensional information is globally encoded in them. Thus, they are robust representations since local errors do not affect them. – Usually, from sequences of images, three-dimensional quantities such as motion and shape are computed and used as input to control processes. The representations discussed here are given directly as input to the control procedures, thus resulting in a real time solution.

Tuning the performance of I/O-intensive parallel applications - Acharya, A.; Uysal, M.; Bennett, R.; Mendelson, A.; Beynon, M.; Hollingsworth, Jeffrey K; Saltz, J.; Sussman, Alan (Proceedings of the fourth workshop on I/O in parallel and distributed systems: part of the federated computing research conference, 1996)

Verification of an active control system using temporal process algebra - Elseaidy,W. M; Baugh,J. W.; Cleaveland, Rance (Engineering with computers, 1996)

Video representations - Bolle,Ruud; Aloimonos, J.; Fermüller, Cornelia (Recent Developments in Computer Vision, 1996)

Almost fully-parallel parentheses matching - Berkman,O.; Vishkin, Uzi (Discrete applied mathematics, 1995)

Automatic generation of multiresolution for polygonal models - Varshney, Amitabh; Agarwal,P.; Brooks,F.; Wright,W.; Weber,H. (First Workshop on Simulation and Interaction in Virtual Environments, 1995)

cDNA expressed sequence tags of Trypanosoma brucei rhodesiense provide new insights into the biology of the parasite - El‐Sayed, Najib M.; Alarcon,Clara M.; Beck,John C.; Sheffield,Val C.; Donelson,John E. (Molecular and Biochemical Parasitology, 1995)
A total of 518 expressed sequence tags (ESTs) have been generated from clones randomly selected from a cDNA library and a spliced leader sub-library of a Trypanosoma brucei rhodesiense bloodstream clone. 205 (39%) of the clones were identified based on matches to 113 unique genes in the public databases. Of these, 71 cDNAs display significant similarities to genes in unrelated organisms encoding metabolic enzymes, signal transduction proteins, transcription factors, ribosomal proteins, histones, a proliferation-associated protein and thimet oligopeptidase, among others. 313 of the cDNAs are not related to any other sequences in the databases. These cDNA ESTs provide new avenues of research for exploring both the novel trypanosome-specific genes and the genome organization of this parasite, as well as a resource for identifying trypanosome homologs to genes expressed in other organisms.
Keywords: cDNA; Expressed sequence tag; Trypanosoma brucei rhodesiense

Comparing detection methods for software requirements inspections: a replicated experiment - Porter, Adam; Votta,L. G.; Basili, Victor R. (IEEE Transactions on Software Engineering, 1995)
Software requirements specifications (SRS) are often validated manually. One such process is inspection, in which several reviewers independently analyze all or part of the specification and search for faults. These faults are then collected at a meeting of the reviewers and author(s). Usually, reviewers use Ad Hoc or Checklist methods to uncover faults. These methods force all reviewers to rely on nonsystematic techniques to search for a wide variety of faults. We hypothesize that a Scenario-based method, in which each reviewer uses different, systematic techniques to search for different, specific classes of faults, will have a significantly higher success rate. We evaluated this hypothesis using a 3×24 partial factorial, randomized experimental design. Forty eight graduate students in computer science participated in the experiment. They were assembled into sixteen, three-person teams. Each team inspected two SRS using some combination of Ad Hoc, Checklist or Scenario methods. For each inspection we performed four measurements: (1) individual fault detection rate, (2) team fault detection rate, (3) percentage of faults first identified at the collection meeting (meeting gain rate), and (4) percentage of faults first identified by an individual, but never reported at the collection meeting (meeting loss rate). The experimental results are that (1) the Scenario method had a higher fault detection rate than either Ad Hoc or Checklist methods, (2) Scenario reviewers were more effective at detecting the faults their scenarios are designed to uncover, and were no less effective at detecting other faults than both Ad Hoc or Checklist reviewers, (3) Checklist reviewers were no more effective than Ad Hoc reviewers, and (4) Collection meetings produced no net improvement in the fault detection rate-meeting gains were offset by meeting losses
Keywords: Assembly; Computer science; Design for experiments; detection methods; Fault detection; fault detection rate; Fault diagnosis; formal specification; formal verification; Gain measurement; individual fault detection rate; Inspection; Loss measurement; nonsystematic techniques; performance evaluation; Performance gain; replicated experiment; scenario-based method; Software development management; software requirements inspections; software requirements specifications; team fault detection rate

Defining, Computing, and Visualizing Molecular Interfaces - Varshney, Amitabh; Brooks Jr,Frederick P.; Manocha,Dinesh; Wright,William V.; Richardson,David C. (Proceedings of the 6th conference on Visualization '95, 1995)
A parallel, analytic approach for defining and computing the inter- and intra-molecular interfaces in three dimensions is described. The "molecular interface surfaces" are derived from approximations to the power-diagrams over the participating molecular units. For a given molecular interface our approach can generate a family of interface surfaces parametrized by alpha and beta, where alpha is the radius of the solvent molecule (also known as the probe-radius) and beta is the interface radius that defines the size of the molecular interface. Molecular interface surfaces provide biochemists with a powerful tool to study surface complementarity and to efficiently characterize the interactions during a protein-substrate docking. The complexity of our algorithm for molecular environments is O(n k \log^2{k}), where n is the number of atoms in the participating molecular units and k is the average number of neighboring atoms -- a constant, given alpha and beta.
Keywords: Computational Biochemistry Algorithms Molecular Graphics; Connolly Surfaces; Molecular Interfaces; Molecular Surfaces; Protein-Protein Recognition

Efficient on-the-fly model checking for CTL - Bhat,G.; Cleaveland, Rance; Grumberg,O. (, Tenth Annual IEEE Symposium on Logic in Computer Science, 1995. LICS '95. Proceedings, 1995)
This paper gives an on-the-fly algorithm for determining whether a finite-state system satisfies a formula in the temporal logic CTL. The time complexity of our algorithm matches that of the best existing “global algorithm” for model checking in this logic, and it performs as well as the best known global algorithms for the sublogics CTL and LTL. In contrast with these approaches, however, our routine constructs the state space of the system under consideration in a need-driven fashion and will therefore perform better in practice
Keywords: Algorithm design and analysis; Automata; computational complexity; Computer science; CTL; Encoding; finite automata; finite-state system; global algorithm; Logic; LTL; on-the-fly model checking; Performance analysis; Safety; State-space methods; sublogic; temporal logic; time complexity

Generating compact code from dataflow specifications of multirate signal processing algorithms - Bhattacharyya, Shuvra S.; Buck,J. T; Ha,S.; Lee,E. A (Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on, 1995)

Generating levels of detail for large-scale polygonal models - Varshney, Amitabh; Agarwal,P. K; Brooks Jr,F. P; Wright,W. V; Weber,H. (Department of Computer Science, Duke University, North Carolina, 1995)
We present an e cient algorithm for generating various levels-of-detail approximations for agiven polygonal model. Our algorithm guarantees that all points of an approximation are within a user-speci able distance from the original model and all points of the original model are within a distance from the approximation. Each approximation attempts to minimize the total number of polygons required to satisfy the previous constraint. We show how the problem of generating levels- of-detail approximations reduces to the classic set partition problem. The various approximations are guaranteed to be topologically consistent with the input polygonal model. The approximations can be constrained by the user to preserve any desired edges of the input model. We also propose a method to compute an estimate of the quality of the approximation generated by our algorithm with respect to the optimal approximation satisfying the same constraints. We have implemented our algorithm and have obtained experimental results of multiresolution hierarchy generation on over a thousand polygonal objects from a CAD model of a notional submarine.

Image Analysis and Processing: 8th International Conference, Iciap '95, San Remo, Italy, September 13-15, 1995 : Proceedings - Braccini,Carlo; De Floriani, Leila; Vernazza,Gianni (Springer, 1995)
This book presents the proceedings of the 8th International Conference on Image Analysis and Processing, ICIAP '95, held in Sanremo, Italy in September 1995 under the sponsorship of the International Association of Pattern Recognition IAPR.The volume presents 108 papers selected from more than 180 submissions together with six invited contributions. The papers are written by a total of 265 contributing authors and give a comprehensive state-of-the-art report on all current issues of image analysis and processing. Theoretical aspects are addressed as well as systems design and advanced applications, particularly in medical imaging.
Keywords: Artificial intelligence; COMPUTER AIDED DESIGN; Computer Graphics; Computer science; Computer vision; Computers / CAD-CAM; Computers / Computer Graphics; Computers / Computer Science; Computers / Computer Vision & Pattern Recognition; Computers / Image Processing; Computers / Intelligence (AI) & Semantics; Computers / Optical Data Processing; Computers / Software Development & Engineering / General; Electronic books; IMAGE PROCESSING; Image processing/ Congresses; Imaging systems; Optical data processing; Optical pattern recognition; software engineering

The information in the direction of image flow - Brodsky, T.; Fermüller, Cornelia; Aloimonos, J. (, International Symposium on Computer Vision, 1995. Proceedings, 1995)
If instead of the full motion field, we consider only the direction of the motion field due to a rigid motion, what can we say about the information regarding the three-dimensional motion? In this paper it is shown that considering as the imaging surface the whole sphere, independently of the scene in view, two different rigid motions cannot give rise to the same directional motion field. If we restrict the image to half of a sphere (or an infinitely large image plane) two different rigid motions with instantaneous translational and rotational velocities (t1, ω1) and (t2, ω2) cannot give rise to the same directional motion field unless the plane through t1 and t2 is perpendicular to the plane through ω1 and ω2 (i.e., (t1×t2)·(ω1 ×ω2)=0). In addition, in order to give a practical significance to these uniqueness results for the case of a limited field of view we also characterize the locations on the image where the motion vectors due to the different motions must have different directions. If (ω1×ω2)·(t1 ×t2)=0 and certain additional constraints are met, then the two rigid motions could produce motion fields with the same direction. For this to happen the depth of each corresponding surface has to be within a certain range, defined by a second and a third order surface
Keywords: Automation; CAMERAS; Computer vision; Educational institutions; image flow; Image motion analysis; Image sequences; imaging surface; Laboratories; Layout; Motion analysis; Motion estimation; motion field; motion vectors; Optical imaging; rigid motion; rigid motions; three-dimensional motion

A miniaturized space-variant active vision system: Cortex-I - Bederson, Benjamin B.; Wallace,R.S.; Schwartz,E. (Machine Vision and applications, 1995)

Next generation network management technology - Baras,John S; Atallah,George C; Ball,Mike; Goli,Shravan; Karne,Ramesh K; Kelley,Steve; Kumar,Harsha; Plaisant, Catherine; Roussopoulos, Nick; Schneiderman,Ben; Srinivasarao,Mulugu; Stathatos,Kosta; et al. (AIP Conference Proceedings, 1995)
Today’s telecommunications networks are becoming increasingly large, complex, mission critical and heterogeneous in several dimensions. For example, the underlying physical transmission facilities of a given network may be ‘‘mixed media’’ (copper, fiber‐optic, radio, and satellite); the subnetworks may be acquired from different vendors due to economic, performance, or general availability reasons; the information being transmitted over the network may be ‘‘multimedia’’ (video, data, voice, and images) and, finally, varying performance criteria may be imposed e.g., data transfer may require high throughput while the others, whose concern is voice communications, may require low call blocking probability. For these reasons, future telecommunications networks are expected to be highly complex in their services and operations. Due to this growing complexity and the disparity among management systems for individual sub‐networks, efficient network management systems have become critical to the current and future success of telecommunications companies. This paper addresses a research and development effort which focuses on prototyping configuration management, since that is the central process of network management and all other network management functions must be built upon it. Our prototype incorporates ergonomically designed graphical user interfaces tailored to the network configuration management subsystem and to the proposed advanced object‐oriented database structure. The resulting design concept follows open standards such as Open Systems Interconnection (OSI) and incorporates object oriented programming methodology to associate data with functions, permit customization, and provide an open architecture environment. © 1995 American Institute of Physics

Parallel algorithms for image histogramming and connected components with an experimental study (extended abstract) - Bader,David A.; JaJa, Joseph F. (ACM SIGPLAN Notices, 1995)
This paper presents efficient and portable implementations of two useful primitives in image processing algorithms, histogramming and connected components. Our general framework is a single-address space, distributed memory programming model. We use efficient techniques for distributing and coalescing data as well as efficient combinations of task and data parallelism. Our connected components algorithm uses a novel approach for parallel merging which performs drastically limited updating during iterative steps, and concludes with a total consistency update at the final step. The algorithms have been coded in Split-C and run on a variety of platforms. Our experimental results are consistent with the theoretical analysis and provide the best known execution times for these two primitives, even when compared with machine-specific implementations. More efficient implementations of Split-C will likely result in even faster execution times.
Keywords: connected components; histogramming; IMAGE PROCESSING; image understanding; Parallel algorithms; scalable parallel processing

The representation of document structure: A generic object-process approach - Dori,D.; David Doermann; Shin,C.; Haralick,R.; Phillips,I.; Buchman,M.; Ross,D. (University of Maryland, College Park, 1995)

Scalable data parallel algorithms for texture synthesis using Gibbs random fields - Bader, D.A.; JaJa, Joseph F.; Chellapa, Rama (Image Processing, IEEE Transactions on, 1995)
This article introduces scalable data parallel algorithms for image processing. Focusing on Gibbs and Markov random field model representation for textures, we present parallel algorithms for texture synthesis, compression, and maximum likelihood parameter estimation, currently implemented on Thinking Machines CM-2 and CM-5. The use of fine-grained, data parallel processing techniques yields real-time algorithms for texture synthesis and compression that are substantially faster than the previously known sequential implementations. Although current implementations are on Connection Machines, the methodology presented enables machine-independent scalable algorithms for a number of problems in image processing and analysis
Keywords: algorithms; maximum; algorithms; parallel; algorithms; scalable; algorithms; texture; analysis; image; CM-2; Thinking; CM-5; fine-grained; compression; image; compression; texture; Connection; data; estimation; model; estimation; parallel; field; Thinking; fields; Markov; likelihood; machine; Machines; Gibbs; machines; random; Parallel; parameter; processes; processes; data; processing; image; processing; machine-independent; random; representation; real-time; scalable; synthesis; Markov; texture; maximum

SEL's software process improvement program - Basili, Victor R.; Zelkowitz, Marvin V; McGarry,F.; Page,J.; Waligora,S.; Pajerski,R. (Software, IEEE, 1995)
We select candidates for process change on the basis of quantified Software Engineering Laboratory (SEL) experiences and clearly defined goals for the software. After we select the changes, we provide training and formulate experiment plans. We then apply the new process to one or more production projects and take detailed measurements. We assess process success by comparing these measures with the continually evolving baseline. Based upon the results of the analysis, we adopt, discard, or revise the process
Keywords: baseline; detailed; engineering; engineering; evolving; improvement; Laboratory; continually; measurements; experiment; plans; production; process; program; software; projects; training; software; SEL; software

Space-scale diagrams: understanding multiscale interfaces - Furnas,G.W.; Bederson, Benjamin B. (Proceedings of the SIGCHI conference on Human factors in computing systems, 1995)

Tracking and recognizing rigid and non-rigid facial motions using local parametric models of image motion - Black,M. J; Yacoob,Yaser (Computer Vision, 1995. Proceedings., Fifth International Conference on, 1995)

Vision, Graphic Design, and Visual Display - Marcus,A.; Murch,G.M.; Baecker,R.; Small,I.; Mander,R.; Ahlberg,C.; Shneiderman, Ben (Readings in human-computer interaction: toward the year 2000, 1995)

Windows of opportunity in electronic classrooms - Shneiderman, Ben; Alavi,Maryann; Norman,Kent; Borkowski,Ellen Yu (Communications of the ACM, 1995)
Paradigm-shifting landmark buildings are cherished by their occupants and remembered because they reshape our expectations of schools, homes, or offices. Classic examples include Thomas Jefferson's communal design of the “academical village” at the University of Virginia where faculty and students lived close to classrooms, Frank Lloyd Wright's organic harmony with nature in Fallingwater (in western Pennsylvania) where the waterfall sounds and leafy surroundings offered a stress-reducing getaway for an urban executive, or Kevin Roche's open glass-walled Ford Foundation (in New York City) that promoted new team-oriented management strategies.

AAAI 1994 Spring Symposium Series Reports - Woods,William; Uckun,Sendar; Kohane,Isaac; Bates,Joseph; Hulthage,Ingemar; Gasser,Les; Hanks,Steve; Gini,Maria; Ram,Ashwin; desJardins, Marie; Johnson,Peter; Etzioni,Oren; et al. (AI Magazine, 1994)

AVI '94: An International Workshop - Shneiderman, Ben; Badre,AI; Santos,Paulo (ACM SIGCHI Bulletin, 1994)
The fresh Mediterranean breezes of innovation enlivened the workshop conversations at Advanced Visual Interfaces '94 (Bari, Italy June 1--4, 1994). More than 100 participants met on the flower-gardened grounds of the Grande Albergo di Villa Romanazzi Carducci, whose modern hotel plus conference center complemented the beautifully restored old villa and the marble-lined swimming pool. Being together with active professionals from Europe and America for 4 days gave us an in-depth chance to learn about each other's professional and personal outlooks. The ancient Roman architecture and the traditional Italian surroundings reminded us that the impact of our work could also last for two thousand years and shape many people's daily lives.

Calculation of head sensitivity function from 3-D magnetic fields - Burke,E.R.; Gomez,R.D.; Madabhushi,R.; Mayergoyz, Issak D (Magnetics, IEEE Transactions on, 1994)
A head sensitivity function is calculated using 3-D magnetic fields. The 3-D magnetic fields are calculated for recorded tracks with finite widths. The magnetization in the medium is expressed in 2-D Fourier series in the plane of the film and is assumed uniform through the thickness of the film. The reproduce head is idealized. These techniques are applied to data found in the literature for very narrow tracks ( 0.5 mu;m). A surprising amount of the experimental data can be explained by the finite width of the tracks. The fine structure of the measurements can then be isolated and attributed to the particular features of the individual heads
Keywords: 3-D; fields; finite; fields; magnetic; function; magnetization; recorded; head; very; heads; magnetisation; sensitivity; magnetic; narrow; Sensitivity; series; magnetic; tracks; Fourier; tracks; reproduce; widths; head

Computing smooth molecular surfaces - Varshney, Amitabh; Brooks, F.P.,Jr.; Wright,W. V (Computer Graphics and Applications, IEEE, 1994)
We consider how we set out to formulate a parallel analytical molecular surface algorithm that has expected linear complexity with respect to the total number of atoms in a molecule. To achieve this goal, we avoided computing the complete 3D regular triangulation over the entire set of atoms, a process that takes time O(n log n), where n is the number of atoms in the molecule. We aim to compute and display these surfaces at interactive rates, by taking advantage of advances in computational geometry, making further algorithmic improvements and parallelizing the computations.<<ETX>>
Keywords: 3D; algorithm; smooth; algorithms; physics; analytical; atoms; three; complexity; computational; complexity; parallel; computing; computing; surface; dimensional; geometry; interactive; geometry; parallel; improvements; computation; molecular; rates; linear; regular; surface; time; computational; triangulation; algorithmic; triangulation; computational

Design for manufacture in multi-enterprise partnerships: current status and future directions - Nau, Dana S.; Ball,M. O; Gupta,S.K.; Minis,I. E.; Zhang, G. (1994)
To pursue market and technology opportunities effectively, US commercial and defense industries will be relying increasingly on multi-enterprise partnerships. Horizontal partnering combines the strengths of multiple firms in product design, manufacture, after sales support and customer service, in order to launch superior products in the global market. To support effective partnering, new approaches will be needed for integrating the activities of design, planning, and production. It is important to address both the fundamental modeling of design, process planning, and production planning in ways that account for the capabilities of potential manufacturing partners, and the development of optimization procedures to address the underlying decision problems. This paper elaborates on these issues and discusses approaches for addressing them.

Finding level-ancestors in trees - Berkman,O.; Vishkin, Uzi (Journal of Computer and System Sciences, 1994)

Interactive visualization of weighted three-dimensional alpha hulls - Varshney, Amitabh; Brooks,Frederick P.; Wright,William V. (Proceedings of the tenth annual symposium on Computational geometry, 1994)
An interactive visualization of weighted three-dimensional &agr;-hulls is presented for static and dynamic spheres. The &agr;-hull is analytically computed and represented by a triangulated mesh. The entire surface is computed and displayed in real-time at interactive rates. The weighted three-dimensional &agr;-hulls are equivalent to smooth molecular surfaces of biochemistry. Biochemistry applications of interactive computation and display of &agr;-hulls or smooth molecular surfaces are outlined.

Interpretation of Doppler blood flow velocity waveforms using neural networks. - Baykal,N.; Reggia, James A.; Yalabik,N.; Erkmen,A.; Beksac,M. S. (Proceedings of the Annual Symposium on Computer Application in Medical Care, 1994)

Jovian: A framework for optimizing parallel I/O - Bennett, R.; Bryant,K.; Sussman, Alan; Das,R.; Saltz, J. (Scalable Parallel Libraries Conference, 1994., Proceedings of the 1994, 1994)

Looped schedules for dataflow descriptions of multirate signal processing algorithms - Bhattacharyya, Shuvra S.; Lee,E. A (Formal Methods in System Design, 1994)

A miniature pan-tilt actuator: the spherical pointing motor - Bederson, Benjamin B.; Wallace,R.S.; Schwartz,E.L. (IEEE Transactions on Robotics and Automation, 1994)
A pan-tilt mechanism is a computer-controlled actuator designed to point an object such as a camera sensor. For applications in active vision, a pan-tilt mechanism should be accurate, fast, small, inexpensive and have low power requirements. The authors have designed and constructed a new type of actuator meeting these requirements, which incorporates both pan and tilt into a single, two-degree-of-freedom device. The spherical pointing motor (SPM) consists of three orthogonal motor windings in a permanent magnetic field, configured to move a small camera mounted on a gimbal. It is an absolute positioning device and is run open-loop. The SPM is capable of panning and tilting a load of 15 grams, for example a CCD image sensor, at rotational velocities of several hundred degrees per second with a repeatability of .15°. The authors have also built a miniature camera consisting of a single CCD sensor chip and miniature lens assembly that fits on the rotor of this motor. In this paper, the authors discuss the theory of the SPM, which includes its basic electromagnetic principles, and derive the relationship between applied currents and resultant motor position. The authors present an automatic calibration procedure and discuss open- and closed-loop control strategies. Finally, the authors present the physical characteristics and results of their prototype
Keywords: absolute positioning device; active vision; Actuators; Application software; Assembly; automatic calibration; camera sensor; CAMERAS; CCD image sensors; CCD sensor chip; Charge coupled devices; Charge-coupled image sensors; closed-loop control strategies; computerised control; Lenses; Magnetic fields; miniature lens assembly; miniature pan-tilt actuator; open-loop control strategies; orthogonal motor windings; pan-tilt mechanism; Permanent magnet motors; position control; Scanning probe microscopy; spherical pointing motor; two-degree-of-freedom device

Navigating in hyperspace: designing a structure-based toolbox - Rivlin,Ehud; Botafogo,Rodrigo; Shneiderman, Ben (Communications of the ACM, 1994)

Next Generation Network Management Technology - Atallah,George C; Ball,Michael O; Baras,John S; Goli,Shravan K; Karne,Ramesh K; Kelley,Stephen; Kumar,Harsha P.; Plaisant, Catherine; Roussopoulos, Nick; Shneiderman, Ben; Srinivasarao,Mulugu; Stathatos,Kostas; et al. (Institute for Systems Research Technical Reports, 1994)
Today's telecommunications networks are becoming increasingly large, complex, mission critical and heterogeneous in several dimensions. For example, the underlying physical transmission facilities of a given network may be ﲭixed media (copper, fiber- optic, radio, and satellite); the sub networks may be acquired from different vendors due to economic, performance, or general availability reasons; the information being transmitted over the network may be ﲭultimedia (video, data, voice, and images) and, finally, varying performance criteria may be imposed e.g. data transfer may require high throughput while the others, whose concern is voice communications, may require low call blocking probability. For these reasons, future telecommunications networks are expected to be highly complex in their services and operations. Due to this growing complexity and the disparity among management systems for individual sub networks, efficient network management systems have become critical to the current and future success of telecommunications companies. This paper addresses a research and development effort which focuses on prototyping configuration management, since that is the central process of network management and all other network management functions must be built upon it. Our prototype incorporates ergonomically designed graphical user interfaces tailored to the network configuration management subsystem and to the proposed advanced object-oriented database structure. The resulting design concept follows open standards such as Open Systems Interconnection (OSI) and incorporates object oriented programming methodology to associate data with functions, permit customization, and provide an open architecture environment. A revised version of this technical report has been published in The 12th Symposium on Space Nuclear Power and Propulsion/Commercialization, pp. 75-82, Albuquerque, NM, January 8-12, 1995.
Keywords: Constraints for Network Management.; Network Configuration Management; network management; Object Oriented Data Base Model for Network Management; Rules; Systems Integration; Visual Information Management for Network Configuration Management

On a parallel-algorithms method for string matching problems (overview) - Sahinalp,Suleyman; Vishkin, Uzi (Algorithms and ComplexityAlgorithms and Complexity, 1994)
Keywords: Computer; Science

Planning-based integrated decision support systems - Bienkowski,M.A.; desJardins, Marie (Artificial Intelligence Planning Systems: Proceedings of the Second International Conference (AIPS-94), 1994)

A rule-based approach to prepositional phrase attachment disambiguation - Brill,E.; Resnik, Philip (Proceedings of the 15th conference on Computational linguistics-Volume 2, 1994)

A SIMD solution to the sequence comparison problem on the MGAP - Borah,M.; Bajwa,R. S; Hannenhalli, Sridhar; Irwin,M. J (International Conference on Application Specific Array Processors, 1994. Proceedings, 1994)
Molecular biologists frequently compare an unknown biosequence with a set of other known biosequences to find the sequence which is maximally similar, with the hope that what is true of one sequence, either physically or functionally, could be true of its analogue. Even though efficient dynamic programming algorithms exist for the problem, when the size of the database is large, the time required is quite long, even for moderate length sequences. In this paper, we present an efficient pipelined SIMD solution to the sequence alignment problem on the Micro-Grain Array Processor (MGAP), a fine-grained massively parallel array of processors with nearest-neighbor connections. The algorithm compares K sequences of length O(M) with the actual sequence of length N, in O(M+N+K) time with O(MN) processors, which is AT-optimal. The implementation on the MGAP computes at the rate of about 0.1 million comparisons per second for sequences of length 128
Keywords: AT-optimal algorithm; Biological information theory; biology computing; biosequence comparison problem; computational complexity; Computer science; Costs; database size; Databases; DNA computing; dynamic programming; dynamic programming algorithms; fine-grained massively parallel processor array; Genetics; Heuristic algorithms; maximally similar sequence; MGAP parallel computer; Micro-Grain Array Processor; Military computing; molecular biology; molecular biophysics; Nearest neighbor searches; nearest-neighbor connections; Parallel algorithms; pipeline processing; pipelined SIMD solution; sequence alignment problem; sequences

Software Process Improvement in the NASA Software Engineering Laboratory. - McGarry,Frank; Pajerski,Rose; Page,Gerald; Waligora,Sharon; Basili, Victor R. (CARNEGIE-MELLON UNIV PITTSBURGH PA SOFTWARE ENGINEERING INSTITUTE, 1994)
The Software Engineering Laboratory (SEL) was established in 1976 for the purpose of studying and measuring software processes with the intent of identifying improvements that could be applied to the production of ground support software within the Flight Dynamics Division (FDD) at the National Aeronautics and Space Administration (NASA)/Goddard Space Flight Center (GSFC). The SEL has three member organizations: NASA/GSFC, the University of Maryland, and Computer Sciences Corporation (CSC). The concept of process improvement within the SEL focuses on the continual understanding of both process and product as well as goal-driven experimentation and analysis of process change within a production environment.
Keywords: *AWARDS; *SOFTWARE ENGINEERING; *SYSTEMS ANALYSIS; *WORK MEASUREMENT; ADMINISTRATION AND MANAGEMENT; COMPUTER PROGRAMMING AND SOFTWARE; COMPUTER PROGRAMS; COMPUTERS; data acquisition; ENVIRONMENTS; EXPERIMENTAL DATA; GROUND SUPPORT.; measurement; Organizations; PE63756E; Production; SOFTWARE PROCESS IMPROVEMENT; SPI(SOFTWARE PROCESS IMPROVEMENT); SPN-19950120014

Space variant image processing - Wallace,R.S.; Ong,P.W.; Bederson, Benjamin B.; Schwartz,E.L. (International Journal of Computer Vision, 1994)

Top-Bottom Routing around a Rectangle is as Easy as Computing Prefix Minima - Berkman,Omer; JaJa, Joseph F.; Krishnamurthy,Sridhar; Thurimella,Ramakrishna; Vishkin, Uzi (SIAM Journal on Computing, 1994)
A new parallel algorithm for the prefix minima problem is presented for inputs drawn from the range of integers $[1..s]$. For an input of size $n$, it runs in $O(\log \log \log s)$ time and $O(n)$ work (which is optimal). A faster algorithm is presented for the special case $s = n$; it runs in $O(\log ^ * n)$ time with optimal work. Both algorithms are for the Priority concurrent-read concurrent-write parallel random access machine (CROW PRAM). A possibly surprising outcome of this work is that, whenever the range of the input is restricted, the prefix minima problem can be solved significantly faster than the $Ω (\log \log n)$ time lower bound in a decision model of parallel computation, as described by Valiant [SIAM J. Comput., 4 (1975), pp. 348–355].The top-bottom routing problem, which is an important subproblem of routing wires around a rectangle in two layers, is also considered. It is established that, for parallel (and hence for serial) computation, the problem of top-bottom routing is no harder than the prefix minima problem with $s = n$, thus giving an $O(\log ^ * n)$ time optimal parallel algorithm for the top-bottom routing problem. This is one of the first nontrivial problems to be given an optimal parallel algorithm that runs in sublogarithmic time.
Keywords: Parallel algorithms; pram algorithms; prefix minima; VLSI routing

Verifying an intelligent structural control system: a case study - Elseaidy,W. M; Cleaveland, Rance; Baugh,J. W. (Real-Time Systems Symposium, 1994., Proceedings., 1994)
Describes the formal verification of the timing properties of the design of an intelligent structural control system using the Concurrency Workbench, an automatic verification tool for finite-state processes. The high-level design of the system is first given in Modechart, a graphical specification language for real-time systems, and then translated into a temporal process algebra supported by the Workbench. The facilities provided by this tool are then used to analyze the system and ultimately show it to be correct
Keywords: automatic verification tool; case study; Concurrency Workbench; Distributed computing; Distributed control; distributed processing; finite automata; finite-state processes; formal verification; graphical specification language; high-level design; intelligent control; intelligent structural control system verification; Logic; Modechart; Process algebra; Real time systems; real-time systems; Specification languages; structural engineering computing; temporal logic; temporal process algebra; time-varying systems; Timing; timing properties; visual languages

Bounding the number of neighbors in protein molecules - Varshney, Amitabh; Wright,W. V; Brooks Jr,F. P (Department of Computer Science, University of North Carolina at Chapel Hill, 1993)

Control and design of the spherical pointing motor - Bederson, Benjamin B.; Wallace,R.S.; Schwartz,E.L. (, 1993 IEEE International Conference on Robotics and Automation, 1993. Proceedings, 1993)
A miniature pan-tilt actuator, the spherical pointing motor (SPM) has been built. The SPM is an absolute positioning device, designed to orient a small camera sensor in two degrees-of-rotational-freedom. It is 4 cm×5 cm×6 cm and weighs 160 g. The operating principle of the SPM is to orient a permanent magnet to the magnetic field induced by three orthogonal coils by applying the appropriate ratio of currents to the coils. The open-loop control and design of the SPM are described. Physical characteristics and velocity measurements of the prototype are reported. The SPM is modeled with a simple second order system. Without control, it oscillates substantially when a single impulse is applied. By applying a second impulse without feedback, the oscillation can be reduced by as much as a factor of ten
Keywords: absolute positioning device; Actuators; camera sensor; CAMERAS; Coils; electric actuators; electric motors; Magnetic field measurement; Magnetic sensors; Open loop systems; open-loop control; orthogonal coils; pan-tilt actuator; permanent magnet; Permanent magnet motors; Permanent magnets; position control; Scanning probe microscopy; second order system; spherical pointing motor; velocity control; Velocity measurement; velocity measurements

Evaluating three museum installations of a hypertext system - Shneiderman, Ben; Brethauer,D.; Plaisant, Catherine; Potter,R. (Sparks of innovation in human-computer interaction, 1993)

Fast analytical computation of Richards's smooth molecular surface - Varshney, Amitabh; Brooks,Frederick P. (Proceedings of the 4th conference on Visualization '93, 1993)
An algorithm for rapid computation of Richards's smooth molecular surface is described. The entire surface is computed analytically, triangulated, and displayed at interactive rates. The faster speeds for our program have been achieved by algorithmic improvements, parallelizing the computations, and by taking advantage of the special geometrical properties of such surfaces. Our algorithm is easily parallelizable and it has a time complexity of O(k log k) over n processors, where n is the number of atoms of the molecule and k is the average number of neighbors per atom.

A first-pass approach for evaluating machine translation systems - Jordan,P.W.; Dorr, Bonnie J; Benoit,J.W. (Machine Translation, 1993)
This paper describes a short-term survey and evaluation project that covered a large number of machine translation products and research. We discuss our evaluation approach and address certain issues and implications relevant to our findings. We represented a variety of potential users of MT systems and were faced with the task of identifying which systems would best help them solve their translation problems.

MANDATE: managing networks using database technology - Haritsa,J. R; Ball,M. O; Roussopoulos, Nick; Datta,A.; Baras,J. S (IEEE Journal on Selected Areas in Communications, 1993)
There has been a growing demand for the development of tools to manage enterprise communication networks. A management information database is the heart of a network management system-it provides the interface between all functions of the network management system and, therefore, has to provide sophisticated functionality allied with high performance. The authors introduce the design of MANDATE (MAnaging Networks using DAtabase TEchnology), a proposed database system for effectively supporting the management of large enterprise networks. The MANDATE design makes a conscious attempt to take advantage of the special characteristics of network data and transactions, and of advances in database technology, to efficiently derive some of the required management functionality
Keywords: Communication networks; database management systems; enterprise communication networks; Heart; Information management; interface; internetworking; Local area networks; management functionality; management information database; managing networks using database technology; MANDATE; Manufacturing; network operating systems; open systems; Optical fiber cables; Research and development management; Technology management; telecommunication network management; Transaction databases; wide area networks

Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values - Berkman,O.; Schieber,B.; Vishkin, Uzi (Journal of Algorithms, 1993)

On parallel integer merging - Berkman,O.; Vishkin, Uzi (Information and Computation, 1993)

Scheduling home control devices: a case study of the transition from the research project to a product - Plaisant, Catherine; Shneiderman, Ben; Battagtia,J. (Sparks of innovation in human-computer interactionSparks of innovation in human-computer interaction, 1993)

Scheduling synchronous dataflow graphs for efficient looping - Bhattacharyya, Shuvra S.; Lee,E. A (The Journal of VLSI Signal Processing, 1993)

SOCAP: lessons learned in automating military operations planning - Desimone,R.; Wilkins,D. E.; Bienkowski,M.; desJardins, Marie (Proceedings of the 6th international conference on Industrial and engineering applications of artificial intelligence and expert systems, 1993)

Use of lexical conceptual structure for intelligent tutoring - Dorr, Bonnie J; Hendler,J.; Blanksteen,S.; Migdalof,B. (University of Maryland, 1993)
We describe the use of an LCS-based semantics for question-answeringexercises in foreign language training. We start by reviewing the LCS model and show how this representation can be used to support a question answering lesson as well as a limited domain discourse. An authoring tool for entering the relevant semantic knowledge is also described.

Anthropomorphism: from Eliza to Terminator 2 - Don,Abbe; Brennan,Susan; Laurel,Brenda; Shneiderman, Ben (Proceedings of the SIGCHI conference on Human factors in computing systems, 1992)

Constrained Matrix Sylvester Equations - Barlow,Jewel B.; Monahemi,Moghen M.; O'Leary, Dianne P. (SIAM Journal on Matrix Analysis and Applications, 1992)
The problem of finding matrices $L$ and $T$ satisfying $TA - FT = LC$ and $TB = 0$ is considered. Existence conditions for the solution are established and an algorithm for computing the solution is derived. Conditions under which the matrix $[C^T ,T^T ]$ is full rank are also discussed. The problem arises in control theory in the design of reduced-order observers that achieve loop transfer recovery.
Keywords: loop transfer recovery; matrix Liapunov equation; Sylvester operator

The Design of Reduced Order Observers with Precise Loop Transfer Recovery - Monahemi,Moghen M.; Barlow,Jewel B.; O'Leary, Dianne P. (AIAA Journal of Guidance, Control, and Dynamics, 1992)

Efficient minimum cost matching using quadrangle inequality - Aggarwal,A.; Bar-Noy,A.; Khuller, Samir; Kravets,D.; Schieber,B. (Foundations of Computer Science, 1992. Proceedings., 33rd Annual Symposium on, 1992)
The authors present efficient algorithms for finding a minimum cost perfect matching, and for solving the transportation problem in bipartite graphs, G = (Red cup; Blue, Red times; Blue), where |Red| = n, |Blue| = m, n les; m, and the cost function obeys the quadrangle inequality. The first results assume that all the red points and all the blue points lie on a curve that is homeomorphic to either a line or a circle and the cost function is given by the Euclidean distance along the curve. They present a linear time algorithm for the matching problem. They generalize the method to solve the corresponding transportation problem in O((m+n)log(m+n)) time. The next result is an O(n log m) algorithm for minimum cost matching when the cost array is a bitonic Monge array. An example of this is when the red points lie on one straight line and the blue points lie on another straight line (that is not necessarily parallel to the first one). Finally, they provide a weakly polynomial algorithm for the transportation problem in which the associated cost array is a bitonic Monge array
Keywords: algorithm; array; bipartite; bitonic; blue; complexity; computational; cost; distance; Euclidean; function; geometry; graph; graphs; inequality; linear; MATCHING; matching; minimisation; minimum; Monge; perfect; points; polynomial; problem; quadrangle; red; theory; TIME; transportation; transportation; weakly

On the Precise Loop Transfer Recovery and Transmission Zeroes - Monahemi,M.; Barlow,J.; O'Leary, Dianne P. (First IEEE Conference on Control ApplicationsFirst IEEE Conference on Control Applications, 1992)

Randomized range-maxima in nearly-constant parallel time - Berkman,O.; Matias,Y.; Vishkin, Uzi (Computational Complexity, 1992)

Real-time procedural textures - Rhoades,John; Turk,Greg; Bell,Andrew; State,Andrei; Neumann,Ulrich; Varshney, Amitabh (Proceedings of the 1992 symposium on Interactive 3D graphics, 1992)

Six Generations of Building Walkthrough: Final Technical Report to the National Science Foundation - Brooks,Frederick P.; Airey,John; Alspaugh,John; Bell,Andrew; Brown,Randolph; Hill,Curtis; Nimscheck,Uwe; Rheingans,Penny; Rohlf,John; Smith,Dana; Turner,Douglass; Varshney, Amitabh; et al. (University of North Carolina at Chapel Hill, 1992)

Software approaches to segmentation analysis - D'Autrechy,C. L; Reggia, James A.; Berndt,R. S (Computer Science Technical Report Series; Vol. CS-TR-2991, 1992)

Splicing signals in Drosophila: intron size, information content, and consensus sequences - Mount, Stephen M.; Burks,Christian; Herts,Gerald; Stormo,Gary D.; White,Owen; Fields,Chris (Nucleic Acids ResearchNucl. Acids Res., 1992)
A database of 209 Drosophila Introns was extracted from Genbank (release number 64.0) and examined by a number of methods in order to characterize features that might serve as signals for messenger RNA splicing. A tight distribution of sizes was observed: while the smallest introns in the database are 51 nucleotides, more than half are less than 80 nucleotides in length, and most of these have lengths in the range of 59 – 67 nucleotides. Drosophila splice sites found in large and small introns differ in only minor ways from each other and from those found in vertebrate Introns. However, larger introns have greater pyrimidlne-richness in the region between 11 and 21 nucleotides upstream of 3′ splice sites. The Drosophila branchpoint consensus matrix resembles C T A A T (in which branch formation occurs at the underlined A), and differs from the corresponding mammalian signal in the absence of G at the position immediately preceding the branchpoint. The distribution of occurrences of this sequence suggests a minimum distance between 5′ splice shies and branchpoints of about 38 nucleotides, and a minimum distance between 3′ splice sites and branchpoints of 15 nucleotides. The methods we have used detect no information in exon sequences other than in the few nucleotides immediately adjacent to the splice sites. However, Drosophila resembles many other species in that there is a discontinuity in A + T content between exons and introns, which are A + T rich.

Standards-are software engineering process standards really necessary? - Zelkowitz, Marvin V; Buckley,F.J. (Computer, 1992)
The need for software engineering process standards-as opposed to product standards-is discussed from two different viewpoints. M.V. Zelkowitz states that process standards are generally written as policy statements on how to conduct certain processes. As such, they give the framework of the underlying model, but not enough guidance to specify details. They are fuzzy and hard to implement, and they make conformance testing extremely difficult. F.J. Buckley responds to several significant issues raised in Zelkowitz's arguments
Keywords: conformance; engineering; engineering; standards; process; standards; software; statements; product; testing; policy

Structural analysis of hypertexts: identifying hierarchies and useful metrics - Botafogo,Rodrigo A.; Rivlin,Ehud; Shneiderman, Ben (ACM Transactions on Information Systems, 1992)
Hypertext users often suffer from the “lost in hyperspace” problem: disorientation from too many jumps while traversing a complex network. One solution to this problem is improved authoring to create more comprehensible structures. This paper proposes several authoring tools, based on hypertext structure analysis.In many hypertext systems authors are encouraged to create hierarchical structures, but when writing, the hierarchy is lost because of the inclusion of cross-reference links. The first part of this paper looks at ways of recovering lost hierarchies and finding new ones, offering authors different views of the same hypertext. The second part helps authors by identifying properties of the hypertext document. Multiple metrics are developed including compactness and stratum. Compactness indicates the intrinsic connectedness of the hypertext, and stratum reveals to what degree the hypertext is organized so that some nodes must be read before others. Several existing hypertexts are used to illustrate the benefits of each technique. The collection of techniques provides a multifaceted view of the hypertext, which should allow authors to reduce undesired structural complexity and create documents that readers can traverse more easily.
Keywords: graph theory; hierarchies; hypertext; metrics; structural analysis

Two miniature pan-tilt devices - Bederson, Benjamin B.; Wallace,R.S.; Schwartz,E.L. (Robotics and Automation, 1992. Proceedings., 1992 IEEE International Conference on, 1992)

A two-level knowledge representation for machine translation: Lexical semantics and tense/aspect - Dorr, Bonnie J (Lexical Semantics and Knowledge RepresentationLexical Semantics and Knowledge Representation, 1992)
This paper proposes a two-level model that integrates contemporary theories of tense and aspect with lexical semantics. The model is intended to be extensible to realms outside of the temporal domain (e.g., the spatial domain). The integration of tense and aspect with lexical-semantics is especially critical in machine translation because of the lexical selection process during generation: there is often a number of lexical connective and tense/aspect possibilities that may be produced from a lexical semantic representation, which, as defined in the model presented here, is largely underspecified. Temporal/aspectual information from the source-language sentence constrains the choice of target-language terms. In turn, the target-language terms limit the possibilities for generation of tense and aspect. Thus, there is a two-way communication channel between the two processes.

Voice-bandwidth visual communication through logmaps: the Telecortex - Wallace,R.S.; Bederson, Benjamin B.; Schwartz,E.L. (Applications of Computer Vision, Proceedings, 1992., IEEE Workshop on, 1992)

Computer based systems engineering workshop - Lavi,J.; Agrawala, Ashok K.; Buhr,R.; Jackson,K.; Jackson,M.; Lang,B. (Software Engineering Education, 1991)
Modern computer based systems are complex multi-systems consisting of many connected individual subsystems; each one of them is typically also a multicomputer system. The subsystems in a multi-system can be either geographically distributed or locally connected systems. Typical examples of computer based systems are medical systems, process control systems, communications systems, weapon systems and large information systems.The development of these complex systems requires the establishment of a new engineering discipline in its own right, Computer Based Systems Engineering — CBSE. The definition of the discipline, its current and future practice and the ways to establish and promote it were discussed in an international IEEE workshop held in Neve-Ilan, Israel in May 1990. The major conclusion of the workshop was that CBSE should be established as a new field in its own right. To achieve this goal, the workshop participants recommended that the IEEE Computer Society shall set up a task force for the promotion of the field, the establishment of CBSE Institutes and the development of the educational framework of CBSE. The paper describes the major findings of the workshop that led to these conclusions and recommendations.

Considerations on Loop Transfer Recovery for Non-minimum Phase Plants - Monahemi,M.; Barlow,J.; O'Leary, Dianne P. (Proceedings of the AIAA Aircraft Design Systems and Operations MeetingProceedings of the AIAA Aircraft Design Systems and Operations Meeting, 1991)

The Design of Reduced Order Luenberger Observers with Precise LTR - Monahemi,M.; Barlow,J.; O'Leary, Dianne P. (Proceedings of the AIAA Meeting on Guidance, Navigation and ControlProceedings of the AIAA Meeting on Guidance, Navigation and Control, 1991)
This work concerns the design of reduced-order observers for controllable, observable, and regular systems in which the number of measurements is more than the number of controls. It uses eigenstructure assignment whereas other approaches use Kalman filter (LQG/LTR) methods. The advantages of this approach are: (1) precise LTR rather than approximate LTR, (2) no restriction to minimum phase systems, (3) finite observer gain rather than asymptotic observer gain, and (4) simpler and more efficient numerical calculation. Case studies are presented illustrating these features in aircraft control applications.

Editing to structure a reader's experience - Shneiderman, Ben; Kreitzberg,C.; Berk,E. (Hypertext/hypermedia handbookHypertext/hypermedia handbook, 1991)

Identifying aggregates in hypertext structures - Botafogo,Rodrigo A.; Shneiderman, Ben (Proceedings of the third annual ACM conference on Hypertext, 1991)

Metric-driven analysis and feedback systems for enabling empirically guided software development - Selby,R. W; Porter, Adam; Schmidt,D. C; Berney,J. (Proceedings of the 13th international conference on Software engineering, 1991)

Pyramid computation of neighbor distance statistics in dot patterns - Banerjee,Saibal; Mount, Dave; Rosenfeld,Azriel (CVGIP: Graphical Models and Image Processing, 1991)
This paper describes an algorithm for computing statistics of Voronoi neighbor distances in a dot pattern, using a cellular pyramid computer, in a logarithmic number of computational steps. Given a set of dots in a square region of the digital plane, the algorithm determines with high probability the Voronoi neighbors of the dots in the interior of the region and then computes statistics of the neighbor distances. An algorithm of this type may account for the ability of humans to perceive at a glance whether the dots in a pattern are randomly or regularly spaced, i.e., their neighbor distances have high or low variance.

Recent applications of competitive activation mechanisms - Reggia, James A.; Peng,Y.; Bourret,P. (Neural Networks: Advances and Applications, 1991)

Image motion estimation by clustering - Bandopadhay, Amit; Aloimonos, J. (International Journal of Imaging Systems and Technology, 1990)
Image motion is estimated by matching feature “interest” points in different frames of video image sequences. The matching is based on local similarity of the displacement vectors. Clustering in the displacement vector space is used to determine the set of plausible match vectors. Subsequently, a similarity-based algorithm performs the actual matching. The feature points are computed using a multiple-filter image decomposition operator. The algorithm has been tested on synthetic as well as real video images. The novelty of the approach is that it handles multiple motions and performs motion segmentation.

Multiple underlying systems: Translating user requests into programs to produce answers - Bobrow,R.J.; Resnik, Philip; Weischedel,R.M. (Proceedings of the 28th annual meeting on Association for Computational Linguistics, 1990)

An experimental evaluation of three touch screen strategies within a hypertext database - Potter,Richard; Berman,Mitchell; Shneiderman, Ben (International Journal of Human-Computer Interaction, 1989)
High resolution touch screens and novel usage strategies have overcome earlier problems with parallax and inaccurate pointing. A study testing the utility of three touch screen strategies within the Hyperties hypertext environment was performed. This provided a replication and extension of an earlier touch screen strategy comparison that focused on small closely?spaced targets. The experiment compared three touch screen strategies in three experimental tasks that reflect hypertext usage. The results showed that a strategy that only uses the initial impact with the touch screen causes the user to miss the target more than other touch strategies. A statistically significant difference in errors was found. Our results should encourage system implementers and touch screen hardware designers to support ?touch mouse? strategies that enable cursor dragging on the touch screen surface.High resolution touch screens and novel usage strategies have overcome earlier problems with parallax and inaccurate pointing. A study testing the utility of three touch screen strategies within the Hyperties hypertext environment was performed. This provided a replication and extension of an earlier touch screen strategy comparison that focused on small closely?spaced targets. The experiment compared three touch screen strategies in three experimental tasks that reflect hypertext usage. The results showed that a strategy that only uses the initial impact with the touch screen causes the user to miss the target more than other touch strategies. A statistically significant difference in errors was found. Our results should encourage system implementers and touch screen hardware designers to support ?touch mouse? strategies that enable cursor dragging on the touch screen surface.

Gabriel: A design environment for DSP - Lee,E. A; Ho,W. H; Goei,E. E; Bier,J. C; Bhattacharyya, Shuvra S. (Acoustics, Speech and Signal Processing, IEEE Transactions on, 1989)

Hypertext and software engineering - Balzer,R.; Begeman,M.; Garg,P. K.; Schwartz,M.; Shneiderman, Ben (Proceedings of the second annual ACM conference on Hypertext, 1989)
The purpose of this panel is to bring together researchers in software engineering and hypertext and help identify the major issues in the application of hypertext technology and concepts to software engineering and vice versa.

On the kinetic depth effect - Aloimonos, J.; Brown, C. M. (Biological cybernetics, 1989)

A method for interactive satellite failure diagnosis: Towards a connectionist solution - Bourret,P.; Reggia, James A. (NASA. Goddard Space Flight Center, The 1989 Goddard Conference on Space Applications of Artificial Intelligence p 143-152(SEE N 89-26578 20-63), 1989)

Some aspects of parallel implementation of the finite-element method on message passing architectures - Babuska, I.; Elman, Howard (Journal of Computational and Applied Mathematics, 1989)
We discuss some aspects of implementing the finite-element method on parallel computers with local memory and message passing. In particular, we compare the costs of using high-order and low-order elements and of direct and iterative solvers for solving the linear systems that occur. Our model of parallel computation is a two-dimensional grid of processors chosen to be similar in shape to the underlying grid. Our main conclusions are that use of high-order methods is an effective way to achieve high accuracy for some problems, on both serial and parallel computers, and that such methods provide a natural way to achieve efficiency in parallel implementations. In addition, we show that sparse direct solvers generalize naturally to methods based on high-order elements, and that direct solvers are adequate for two-dimensional problems, especially for multiple load vectors.
Keywords: Finite-element methods; hp-version; nested dissection; parallel computations; preconditioned conjugate gradient

Active vision - Aloimonos, J.; Weiss, I.; Bandyopadhyay, A. (International Journal of Computer Vision, 1988)

Competitive dynamics in a dual-route connectionist model of print-to-sound transformation - Reggia, James A.; Marsland,P. M; Berndt,R. S (Complex Systems, 1988)

Program complexity using Hierarchical Abstract Computers - Bail,William G; Zelkowitz, Marvin V (Computer Languages, 1988)
A model of program complexity is introduced which combines structural control flow measures with data flow measures. This complexity measure is based upon the prime program decomposition of a program written for a Hierarchical Abstract Computer. It is shown that this measure is consistent with the ideas of information hiding and data abstraction. Because this measure is sensitive to the linear form of a program, it can be used to measure different concrete representations of the same algorithm, as in a structured and an unstructured version of the same program. Application of the measure as a model of system complexity is given for “upstream” processes (e.g. specification and design phases) where there is no source program to measure by other techniques.
Keywords: CASE tools; complexity; ENVIRONMENTS; measurement; Prime programs

Robust computation of intrinsic images from multiple cues - Aloimonos, J.; Brown, C. M. (Advances in Computer Vision, 1988)

Direct manipulation user interfaces for expert systems - Baroff,J.; Simon,R.; Gilman,F.; Shneiderman, Ben (Expert systems: the user interfaceExpert systems: the user interface, 1987)

A robust algorithm for determining the translation of a rigidly moving surface without correspondence, for robotics applications - Basu, A.; Aloimonos, J. (University of Maryland, 1987)

Determining the Translation of a Rigidly Moving Surface, without Correspondence, - Aloimonos, J.; Basu, Anup (1986)
A method is presented for the recovery of the three-dimensional translation of a rigidly moving textured object from its images. The novelty of the method consists of the fact that four cameras are used in order to avoid the solution of the correspondence problem. The method seems to be immune to small noise percentages and to have good behavior when the noise increases. Keywords: Computer vision.
Keywords: *IMAGE PROCESSING; *OPTICAL DETECTION; *Translation(Image processing); CAMERAS; Computer vision; COMPUTERS; IMMUNITY.; MOTION; MOVING TARGETS; NOISE; OPTICAL DETECTION AND DETECTORS; SURFACES; THREE DIMENSIONAL; VISION

Modelling reading aloud and its relevance to acquired dyslexia - Reggia, James A.; Berndt,R. S (Computer methods and programs in biomedicine, 1986)

Shape and 3-d motion from contour without point to point correspondences: General principles - Aloimonos, J.; Basu, A. (CVPR86, 1986)

Contour, orientation and motion - Aloimonos, J.; Basu, A.; Brown, C. M. (Proceedings: Image Understanding Workshop (Miami Beach, FL, December 9–10, 1985), 1985)

Deterministic parsing: A modern view - Berwick,R.; Weinberg, Amy (1985)

Dynamic access control for relational views. - Roussopoulos, Nick; Bader,C. (INFO. SYST., 1985)

Optimal parallel generation of a computation tree form - Bar-On,I.; Vishkin, Uzi (ACM Transactions on Programming Languages and Systems (TOPLAS), 1985)

The Psychology of Program Documentation - Brooks,R.; Sheppard,S.; Shneiderman, Ben (Conference on Software Maintenance, 1985, Sheraton Inn Washington-Northwest, November 11-13, 1985, 1985)

Research in Programming Languages and Software Engineering. - Gannon,John; Basili, Victor R.; Zelkowitz, Marvin V; Yeh,Raymond (Department of Computer Science, University of Maryland, College Park, 1985)
During the past year three research papers were written and two published conference presentations were given. Titles of the published research articles are: A Stochastic Analysis of a Modified Gain Extended Kalman Filter with Applications to Estimation with Bearings only Measurements; The Modified Gain Extended Kalman Kilter and Parameter Identification in Linear Systems and Maximum Information Guidance for Homing Missiles.
Keywords: *BEARINGS; *COMPUTER PROGRAMS; *ESTIMATES; *GUIDANCE; *KALMAN FILTERING; *LINEAR SYSTEMS; *STOCHASTIC PROCESSES; COMPUTER PROGRAMMING AND SOFTWARE; GAIN; identification; measurement; programming languages; STATISTICS AND PROBABILITY; SYSTEMS ENGINEERING.; TARGET DIRECTION, RANGE AND POSITION FINDING

Computer-aided assessment of transient ischemic attacks. A clinical evaluation. - Reggia, James A.; Tabb,D. R.; Price,T. R.; Banko,M.; Hebel,R. (Archives of neurology, 1984)

Direct processing of curvilinear sensor motion from a sequence of perspective images - Aloimonos, J.; Brown, C. M. (Proc. Workshop on Computer Vision: Representation and Control, 1984)

Monitoring an Ada software development - Basili, Victor R.; Chang,Shih; Gannon,John; Katz,Elizabeth; Panlilio-Yap,N. Monina; Ramsey,Connie Loggia; Zelkowitz, Marvin V; Bailey,John; Kruesi,Elizabeth; Sheppard,Sylvia (ACM SIG Ada Letters, 1984)

The relationship between optical flow and surface orientation - Aloimonos, J.; Brown, C. M. (Proc. of the 7-th ICPR, Montreal-Canada, 1984)

Software Engineering Practices in the US and Japan - Zelkowitz, Marvin V; Yeh,R. T; Hamlet,R.G.; Gannon,J. D; Basili, Victor R. (Computer, 1984)

Human factors of interactive software - Shneiderman, Ben (Enduser Systems and Their Human FactorsEnduser Systems and Their Human Factors, 1983)
There is intense interest about human factors issues in interactive computer systems for life-critical applications, industrial/commercial uses, and personal computing in the office or home. Primary design goals include proper functionality, adequate reliability, suitable cost, and adherence to schedule. Measurable human factors issues include time to learn, speed of performance, rate of errors, subjective satisfaction, and retention over time. Specific human factors acceptance tests are described as a natural complement to hardware and software acceptance tests. Project management ideas, information resources, and potential research directions are presented.

Pseudogenes for human small nuclear RNA U3 appear to arise by integration of self-primed reverse transcripts of the RNA into new chromosomal sites - Bernstein,L B; Mount, Stephen M.; Weiner,A M (CellCell, 1983)
We find that both human and rat U3 snRNA can function as self-priming templates for AMV reverse transcriptase in vitro. The 74 base cDNA is primed by the 3' end of intact U3 snRNA, and spans the characteristically truncated 69 or 70 base U3 sequence found in four different human U3 pseudogenes. The ability of human and rat U3 snRNA to self-prime is consistent with a U3 secondary structure model derived by a comparison between rat U3 snRNA and the homologous D2 snRNA from Dictyostelium discoideum. We propose that U3 pseudogenes are generated in vivo by integration of a self-primed cDNA copy of U3 snRNA at new chromosomal sites. We also consider the possibility that the same cDNA mediates gene conversion at the 5' end of bona fide U3 genes where, over the entire region spanned by the U3 cDNA, the two rat U3 sequence variants U3A and U3B are identical.
Keywords: Animals; Base Sequence; DNA; genes; HUMANS; Nucleic Acid Conformation; Rats; Recombination, Genetic; Repetitive Sequences, Nucleic Acid; RNA; RNA, Small Nuclear; RNA-Directed DNA Polymerase; Templates, Genetic; Transcription, Genetic

The Software Industry: A State of the Art Survey - Zelkowitz, Marvin V; Yeh,R.; Hamlet,R.G.; Gannon,J. D; Basili, Victor R. (Foundations of Empirical Software Engineering: The Legacy of Victor R. Basili, 1983)

Syntactic constraints and efficient parsability - Berwick,Robert C.; Weinberg, Amy (Association for Computational Linguistics, 1983)
A central goal of linguistic theory is to explain why natural languages are the way they are. It has often been supposed that computational considerations ought to play a role in this characterization, but rigorous arguments along these lines have been difficult to come by. In this paper we show how a key "axiom" of certain theories of grammar, Subjacency, can be explained by appealing to general restrictions on on-line parsing plus natural constraints on the rule-writing vocabulary of grammars. The explanation avoids the problems with Marcus' [1980] attempt to account for the same constraint. The argument is robust with respect to machine implementation, and thus avoids the problems that often arise when making detailed claims about parsing efficiency. It has the added virtue of unifying in the functional domain of parsing certain grammatically disparate phenomena, as well as making a strong claim about the way in which the grammar is actually embedded into an on-line sentence processor.

Complexity of finding k-path-free dominating sets in graphs - Bar-Yehuda,R.; Vishkin, Uzi (INFO. PROC. LETT., 1982)

Directions in human/computer interaction. - Badre,A.; Shneiderman, Ben (ABLEX PUBL. CORP., 1982)
This book presents current research in interactive system design and human information processing. The contributions offer a mixture of survey, theory, practical recommendations and experimental results reflecting the diversity of research efforts in human/computer interaction.

Isomorphism of graphs with bounded eigenvalue multiplicity - Babai,László; Grigoryev,D. Yu.; Mount, Dave (Proceedings of the fourteenth annual ACM symposium on Theory of computing, 1982)
We investigate the connection between the spectrum of a graph, i.e. the eigenvalues of the adjacency matrix, and the complexity of testing isomorphism. In particular we describe two polynomial time algorithms which test isomorphism of undirected graphs whose eigenvalues have bounded multiplicity. If X and Y are graphs of eigenvalue multiplicity m, then the isomorphism of X and Y can be tested by an O(n4m+c) deterministic and by an O(n2m+c) Las Vegas algorithm, where n is the number of vertices of X and Y.

Structure and function of small ribonucleoproteins from eukaryotic cells - Steitz,J. A.; Berg,C; Gottlieb,E.; Hardin,J A; Hashimoto,C; Hendrick,J P; Hinterberger,M.; Krikeles,M; Lerner,M R; Mount, Stephen M. (Princess Takamatsu symposiaInt. Symp. Princess Takamatsu Cancer Res. Fund, 1982)
Autoantibodies from patients with systemic lupus erythematosus and other related diseases have been used to identify and study small RNA-protein complexes from mammalian cells. Properties of three previously described and several new classes of small ribonucleoproteins (RNPs) are reviewed. The sequence of Drosophila U1 RNA reveals that the region proposed to pair with 5' splice junctions is conserved, while that proposed to interact with 3' junctions diverges; this forces some revision of the model for U1 small nuclear (sn)RNP participation in hnRNA splicing. Further characterization of the Ro and La small RNPs has shown that the Ro small cytoplasmic (sc)RNPs are a subclass of La RNPs. Both tRNA and 5S rRNA precursors are at least transiently associated with the La protein. This raises the possibility that the La protein may be an RNA polymerase III transcription factor.
Keywords: Antigen-Antibody Complex; Autoantibodies; HUMANS; Lupus Erythematosus, Systemic; Nucleoproteins; Ribonucleoproteins; RNA Polymerase III; Transcription, Genetic

Bayesian classification in medicine: The transferability question - Zagoria,R.; Reggia, James A.; Price,T.; Banko,M. (Proceedings of the Fifth Annual Symposium on Computer Applications in Medical Care, 1981)

Are snRNPs involved in splicing? - Lerner,Michael R.; Boyle,John A.; Mount, Stephen M.; Wolin,Sandra L.; Steitz,Joan A. (Nature, 1980)
Discrete, stable small RNA molecules are found in the nuclei of cells from a wide variety of eukaryotic organisms. Many of these small nuclear RNA (snRNA) species, which range in size from about 90 to 220 nucleotides, have been well-characterised biochemically, and some sequenced. However, their function has remained obscure. The most abundant snRNA species exist as a closely related set of RNA–protein complexes called small nuclear ribonucleoproteins (snRNPs). snRNPs are the antigens recognised by antibodies from some patients with lupus erythematosus (LE), an autoimmune rheumatic disease. Anti-RNP antibodies from lupus sera selectively precipitate snRNP species containing Ula7 and Ulb9 RNAs from mouse Ehrlich ascites cell nuclei, whereas anti-Sm antibodies bind these snRNPs and four others containing U2, U4, US and U6 RNAs. Both antibody systems precipitate the same seven prominent nuclear proteins (molecular weight 12,000–32,000). All molecules of the snRNAs U1, U2, U4, U5 and U6 appear to exist in the form of antigenic snRNPs9. The particles sediment at about 10S and each probably contains a single snRNA molecule. Indirect immunofluorescence studies using anti-RNP and anti-Sm sera confirm the nuclear (but non-nucleolar) location of the antigenic snRNPs. Here we present several lines of evidence that suggest a direct involvement of snRNPs in the splicing of hnRNA. Most intriguing is the observation that the nucleotide sequence at the 5′ end of U1 RNA exhibits extensive complementarity to those across splice junctions in hnRNA molecules.

Measuring software development characteristics in the local environment - Basili, Victor R.; Zelkowitz, Marvin V (Computers & Structures, 1979)
This paper discusses the characterization and analysis facilities being performed by the Software Engineering Laboratory which can be done with minimal effort on many projects. Some examples are given of the kinds of analyses that can be done to aid in managing, understanding and characterizing the development of software in a production environment.

Analyzing medium-scale software development - Basili, Victor R.; Zelkowitz, Marvin V (Proceedings of the 3rd international conference on Software engineering, 1978)
The collection and analysis of data from programming projects is necessary for the appropriate evaluation of software engineering methodologies. Towards this end, the Software Engineering Laboratory was organized between the University of Maryland and NASA Goddard Space Flight Center. This paper describes the structure of the Laboratory and provides some data on project evaluation from some of the early projects that have been monitored. The analysis relates to resource forecasting using a model of the project life cycle based upon the Rayleigh equation and to error rates applying ideas developed by Belady and Lehman.

Operation of the Software Engineering Laboratory - Basili, Victor R.; Zelkowitz, Marvin V (Proceedings of the Second US Army/IEEE Software Life Cycle Management Workshop. New York: Computer Societies Press, 1978)

Two experimental comparisons of relational and hierarchical database models - Brosey,Margaret; Shneiderman, Ben (International Journal of Man-Machine Studies, 1978)
The data model is a central feature which characterizes and distinguishes database management systems. This paper presents two experimental comparative studies of two prominent data models; the relational and hierarchical models. Comprehension, problem solving situation and memorization tasks were performed by undergraduate subjects. Significant effects were found for the data model, presentation order, subject background and tasks.

The software engineering laboratory: Objectives - Basili, Victor R.; Zelkowitz, Marvin V (Proceedings of the fifteenth annual SIGCPR conference, 1977)
A great deal of time and money has been and will continue to be spent in developing software. Much effort has gone into the generation of various software development methodologies that are meant to improve both the process and the product ([MYER, 75], [BAKE, 74], [WOLV, 72]). Unfortunately, it has not always been clear what the underlying principles involved in the software development process are and what effect the methodologies have; it is not always clear what constitutes a better product. Thus progress in finding techniques that produce better, cheaper software depends on developing new deeper understandings of good software and the software development process through studying the underlying principles involved in software and the development process. At the same time we must continue to produce software. A better understanding of the factors that affect the development of software and their interrelationships is required in order to gain better insights into the underlying principles. The Software Engineering Laboratory has been established, in August 1976, at NASA Goddard Space Flight Center in cooperation with the University of Maryland to promote such understanding. The next section gives an overview of the research objectives and experiments being performed at the Laboratory. Section III contains the current list of factors that affect the software development process or product and are to be studied or neutralized. The data collection and data management activities are discussed in Section IV. The last section contains information on the current status and future plans for the Laboratory.

A Generalized Conjugate Gradient Method for the Numerical Solution of Elliptic Partial Differential Equations - Concus,Paul; Golub, Gene H.; O'Leary, Dianne P. (Sparse Matrix ComputationsSparse Matrix Computations, 1976)
We consider a generalized conjugate gradient method for solvingsparse, symmetric, positive-definite systems of linear equations, principally those arising from the discretization of boundary value problems for elliptic partial differential equations. The method is based on splitting off from the original coefficient matrix a symmetric, positive-definiteonethat corresponds to a more easily solvable system of equations, and then accelerating the associated iteration using conjugate gradients. Optimality and convergence properties are presented, and the relation to other methods is discussed. Several splittings for which the method seems particularly effective are also discussed, and for some, numerical examples are given

An internship in information systems: Combining computer science education with realistic problems - Buck,John; Shneiderman, Ben (SIGCSE Bull., 1976)
Computer science graduates who become professional programmers will have a direct and substantial influence on the impact of applications, but little in traditional computer science training curriculum prepares them for this serious responsibility. Recognizing this situation, we designed a two term sequence for advanced undergraduates and masters students which would not only provide them with the required academic knowledge. The educational atmosphere that we tried to create resembles the internship phase followed in teacher training, medical schools, law schools, clinical psychology and other disciplines.

TORUS: A step towards bridging the gap between data bases and the casual user - Mylopoulos,J.; Borgida,A.; Cohen,P.; Roussopoulos, Nick; Tsotsos,J.; Wong,H. (Information Systems, 1976)
This paper describes TORUS, a natural language understanding system that serves as a front end to a data base management system in order to facilitate communication with casual users. The system employs a semantic network to store knowledge about a data base of student files. This knowledge is used to find the meaning of each input statement, to decide what action to take with respect to the data base, and to select information that must be output in response to the input statement. A prototype version of TORUS has been implemented.

TORUS-a natural language understanding system for data management - Mylopoulos,J.; Borgida,A.; Cohen,P.; Roussopoulos, Nick; Tsotsos,J.; Wong,H. (Proceedings of the Fourth International Conference on Artificial Intelligence, 1975)