ppxscal/embedding_network huggingface dataset:
Innovation of decision support system-matplan based on structure matrix supported by APL
Authors: T. Toyama, M. Yauda
Venue: ACM SIGAPL APL Quote Quad (1987)

There exist two areas in Decision Support System. The one is the business area where the application logics are common property of the organization and should not be hold by a special person as black-box. e.g. Profit Planning. Cost Accounting. Production Planning etc. The another area would be afforded to be kept closed as black box. Responding &ldquo;What-if&rdquo; needs in the former area, current approaches which, in conclusion, require end-users utilizing of computer language, however efficiently it works, had difficulties. Thinking the computer jobs performed by individuals, the consolidating of them become more serious. A breaking-through was required to diminish the semantic gap between end-users and their computer processes. Also maintenance of application system brought by &ldquo;What-if&rdquo; is a big problem in DSS. A breaking-through was done by MATPLAN based on the new technology: STRUCTURED MATRIX&mdash;hierarchical table including datas and their processing logics, with the expression of mutual relations. You will find various suggestions for new system approach towards the 21 century in this paper.
Ambler: An Autonomous Rover for Planetary Exploration
Authors: J. Bares, M. Hebert, T. Kanade, E. Krotkov, T. Mitchell, R. Simmons, W. Whittaker
Venue: Computer (1989)

The authors are building a prototype legged rover, called the Ambler (loosely an acronym for autonomous mobile exploration robot) and testing it on full-scale, rugged terrain of the sort that might be encountered on the Martian surface. They present an overview of their research program, focusing on locomotion, perception, planning, and control. They summarize some of the most important goals and requirements of a rover design and describe how locomotion, perception, and planning systems can satisfy these requirements. Since the program is relatively young (one year old at the time of writing) they identify issues and approaches and describe work in progress rather than report results. It is expected that many of the technologies developed will be applicable to other planetary bodies and to terrestrial concerns such as hazardous waste assessment and remediation, ocean floor exploration, and mining.
Retrieving documents by plausible inference: a priliminary study
Authors: W. B. Croft, T. J. Lucia, P. R. Cohen
Venue: Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval (1988)

Choosing an appropriate document representation and search strategy for document retrieval has been largely guided by achieving good average performance instead of optimizing the results for each individual query. A model of retrieval based on plausible inference gives us a different perspective and suggests that techniques should be found for combining multiple sources of evidence (or search strategies) into an overall assessment of a document's relevance, rather than attempting to pick a single strategy. In this paper, we explain our approach to plausible inference for retrieval and describe some preliminary experiments designed to test this approach. The experiments use a spreading activation search to implement the plausible inference process. The results show that significant effectiveness improvements are possible using this approach.
A natural language front-end for knowledge acquisition
Authors: B. Arinze
Venue: Issue 108 (April 1989) (1989)

Knowledge Acquisition has historically been a bottleneck in the development of knowledge based systems. While efficient and powerful techniques have been developed for knowledge representation and processing, transferring knowledge from the problem domain into the knowledge base is characterized by the inordinate effort required by knowledge engineers; a lack of any substantial automation of the knowledge acquisition process; and in particular, the difficulty and undue complexity of the knowledge acquisition interfaces for many knowledge based systems. This paper proposes a Natural Language Interface or Front-End as a means of effective knowledge acquisition for knowledge based systems. This would have the advantage of transferring the burden of knowledge acquisition from the user to the system, while providing ease of natural language interaction to the user. By constraining such a front-end to use within limited problem domains, many of the difficulties associated with natural language processing may be avoided, while reaping the benefits of more effective knowledge acquisition. It is also recognized that the knowledge acquisition activity is one that possesses expertise of itself, and using a knowledge acquisition expert system in parallel to this front-end will likely offer further advantages in the development of part or wholly-automated knowledge acquisition.
Modeling of data-processing software for generating and reusing their programs
Authors: N. Mano
Venue: Proceedings of the 10th international conference on Software engineering (1988)

We propose a new modeling scheme named S-model (which is the abbreviation of &ldquo;Semantic model&rdquo;) based on a uniform object-relationship formalism. S-model is the mixture of notations in logic, set theory, and abstract syntax and covers wide range of information of file-processing and data-structure manipulating software. By procedural algorithms and problem-solving capability of S-model system, we can generate and reuse programs in various fields.
Parallel Sieve algorithms on a hypercube multiprocessor
Authors: R. L. Wainwright
Venue: Proceedings of the 17th conference on ACM Annual Computer Science Conference (1989)

Two sieve algorithms, a pipeline and a parallel version are presented for a distributed-memory multiprocessor. Traditionally, the sieve algorithm is solved using a pipeline approach. This algorithm has a high communication to computation ratio and as a result performs poorly. The parallel algorithm is a substantial improvement over the traditional pipeline algorithm. It has a low communication to computation ratio. The speedup for this algorithm is nearly linear. Further, unlike the pipeline algorithm, the parallel algorithm performs just as well or even better on a shared memory multiprocessor system.
Solution of a hydrodynamic lubrication problem with Maple
Authors: R. M. Corless, D. J. Jeffrey
Venue: Journal of Symbolic Computation (1990)

A set of partial differential equations, arising in a calculation of hydrodynamic lubricationeffects, was solved using a perturbation technique. All of the algebraic manipulations required to find the solution were performed using Maple. The main challenge was the efficient handling and simplification of very long expression, which was met by the power of Maple's built-in procedures and by algebraic transformations suggested by the solution to the lowest-order approximation. As a result, the solution was obtained to a higher order, with greater reliability, than would otherwise have been possible.
A Fast Parallel Algorithm for Blind Estimation of Noise Variance
Authors: P. Meer, J.-M. Jolion, A. Rosenfeld
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

A blind noise variance algorithm that recovers the variance of noise in two steps is proposed. The sample variances are computed for square cells tessellating the noise image. Several tessellations are applied with the size of the cells increasing fourfold for consecutive tessellations. The four smallest sample variance values are retained for each tessellation and combined through an outlier analysis into one estimate. The different tessellations thus yield a variance estimate sequence. The value of the noise variance is determined from this variance estimate sequence. The blind noise variance algorithm is applied to 500 noisy 256*256 images. In 98% of the cases, the relative estimation error was less than 0.2 with an average error of 0.06. Application of the algorithm to differently sized images is also discussed.
Safety verification in Murphy using fault tree analysis
Authors: S. S. Cha, N. G. Leveson, T. J. Shimeall
Venue: Proceedings of the 10th international conference on Software engineering (1988)

MURPHY is a language-independent, experimental methodology for building safety-critical, real time software, which will include an integrated tool set. Using Ada as an example, this paper presents a technique for verifying the safety of complex, real-time software using Software Fault Tree Analysis. The templates for Ada are presented along with an example of applying the technique to an Ada program. The tools in the MURPHY tool set to aid in this type of analysis are described.
An interpreter for large knowledge bases
Authors: M. Nussbaum
Venue: Proceedings of the 17th conference on ACM Annual Computer Science Conference (1989)

Achieving performance when both implicit and explicit information is present is an important issue in knowledge processing. As there has not yet been an adequate solution for the problem of large knowledge bases, most known solved problems deal with a limited amount of data. The alternative presented in this paper has proven effective in increasing the speed of knowledge processing for problems that manipulate large sets of facts and rules by orders of magnitude over conventional techniques. Most solutions have been focused on processing low granularity, i.e. one tuple at a time. Within the logic programming framework, an inference engine is proposed suited for large problems. It works with a high degree of granularity, i.e. a relation that permits a combination of a top-down and bottom-up evaluation strategy. It is top down in the way the Intentional Database (rules) is searched and bottom up in the sense the Extensional Database (facts) is processed. This technique, based on a reduction strategy, looks for a non-terminal node only on demand and saves partial results for future needs. The computational model was implemented. Benchmarks comparing the proposed interpretation scheme with other Prolog systems are presented and show a strong improvement in the performance.
SIMPLE_1: the language modeling environment
Authors: P. Cobbin
Venue: Proceedings of the 21st conference on Winter simulation (1989)

SIMPLE_1: (SIMulation Program for Logistics Engineering) is a simulation language and integrated environment for IBM PC and compatible computers which blends visual and interactive modeling features with C, Pascal, and object oriented programming concepts. SIMPLE_1 is a discrete and a continuous simulation language implemented as a modeling environment with integrated editor, documentation, diagnostics, and tutorials. The language has undergone continued refinement from introduction in 1985 and features user defined variables, procedures, and an object oriented procedure concept called a process. A key element in the language is a rule based construct called a CONDITIONS block which defines rules for releasing entities from queues.
Caching and other disk access avoidance techniques on personal computers
Authors: P. J. Jalics, D. R. McIntyre
Venue: Communications of the ACM (1989)

CPU processing speed is rapidly increasing on PCs, resulting in a widening gap between disk access and CPU speed. The performance of three common disk caching systems are examined in an effort to determine a technique for reducing the gap.
Joyce: an object-oriented decision tree builder
Authors: B. Marcus
Venue: ACM SIGPLAN Notices (1989)

Joyce is an object-oriented visual programming environment for nonprogrammers. It permits an application developer to assemble a program by graphically choosing methods from a large library and linking them together using predefined control structures. Joyce also provides the developer with the ability to define data structures, interactive forms, and documentation without programming.
Syntactic Pattern Recognition of the ECG
Authors: P. Trahanias, E. Skordalakis
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

An application of the syntactic method to electrocardiogram (ECG) pattern recognition and parameter measurement is presented. Solutions to the related problems of primitive pattern selection, primitive pattern extraction, linguistic representation, and pattern grammar formulation are given. Attribute grammars are used as the model for the pattern grammar because of their descriptive power, founded upon their ability to handle syntactic as well as semantic information. This approach has been implemented and the performance of the resultant system has been evaluated using an annotated standard ECG library.
Parallel compilation of Ada units
Authors: B. Cockerham
Venue: Proceedings of the conference on TRI-Ada '88 (1989)

Parallel compilation&mdash;compiling independent Ada units or files in parallel&mdash;offers a potentially enormous savings in the total compilation time of a program or library. The speedup realized depends primarily on the inter-unit dependency structure and the number of processors available. We have developed a tool, AdaExpress&trade;, which exploits the opportunities for parallelizing compilations that are inherent in Ada libraries. AdaExpress is currently targeted to a Sequent Symmetry&trade; multiprocessor environment. The compilation engine is a Sequent Ada compiler, a Software Leverage product that is derived from the Verdix Ada Development System (VADS&reg;). AdaExpress automatically determines Ada dependencies from sources. It then applies scheduling heuristics to the dependency structure to obtain a schedule with good, though suboptimal, overall compilation time. AdaExpress implements this schedule as streams of parallel compilation processes. We present the details of AdaExpress's graph-based scheduling algorithm. We also give an example using AdaExpress on an actual program library, and we show the speedup achieved with four processors.
Functional decomposition ofpolynomials: the tame case
Authors: Joachim von zur Gathen
Venue: Journal of Symbolic Computation (1990)

If g and h are polynomials of degrees r and s over a field, their functional composition f=g(h) has degree n=rs. The functional decomposition problem is: given f of degree n=rs, determine whether such g and h exist, and, in the affirmative case, compute them. We first deal with univariate polynomials, and present sequential algorithms that use O(n log^2n log log n) arithmetic operations, and a parallel algorithm with optimal depth O(log n). Then we consider the case where f and h are multivariate, and g is univariate. All algorithms work only in the ''tame'' case, where the characteristic of the field does not divide r.
DeBuMA: description, building and management of applications
Authors: C. Frydman, N. Giambiasi, M. Gatumel, P. Bayle
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

the object of the system presented in this article is to allow experienced designers to describe their knowledge in the way to chain a group of CAD software to resolve a given problem and this, in the form of production rules. This system establish a clear separation between the competencies of the computer scientist, the experienced designer and the final user. It permits the procedure bank of be CAD system to the considered as a group of basic elements from which chaining scenario adapted to the different design problems can be described so as to guide the final user.
Built-In Testing of Integrated Circuit Wafers
Authors: Sampath Rangarajan, Donald Fussell, Miroslaw Malek
Venue: IEEE Transactions on Computers (1990)

Production testing of a digital circuit requires the generation of a sequence of tests and their application to the circuit being tested. Currently, in test application, the output of the circuit under test is compared to a known correct output for each test. The method has some drawbacks likely to become more critical in the near future. In homogeneous systems of identical integrated circuits of silicon wafers, testing can be done in another way, i.e. by applying a common test to several processing elements at once and comparing the results produced by them. The authors analyze such schemes and show that they are inherently as accurate as current methods that use assumed correct results for production testing. Since this approach could allow wafers to be tested for production faults significantly more quickly than by using a probe tester, the results indicate that it can provide an attractive alternative to current methods for production testing of silicon wafers.
A case for packet switching in high-performance wide-area networks
Authors: Z. Haas, D. R. Cheriton
Venue: Proceedings of the ACM workshop on Frontiers in computer communications technology (1987)

The large capacity of optical fibers suggests that circuit-switching may become a more attractive switching method in future communication networks. We show, however, that under some reasonable assumptions the delays associated with circuit-switching make the technique inferior to packet-switching in a high-performance, distributed environment. A network design that demonstrates the feasibility of packet-switching in high-performance environment is also presented. This work was sponsored in part by the Defense Advanced Research Projects Agency under contract N00039-86-K-0431, by the Digital Equipment Corporation, by ATT Information Systems and by Bell Northern Research.
Deadlock detection is really cheap
Authors: Bin Jiang
Venue: ACM SIGMOD Record (1988)

The treatment of deadlock has previously been considered as expensive, and implementations of the involved algorithm have appeared rather complex. In this paper a new algorithm for the treatment of deadlock is described. It is not only very efficient (in the worst case O(e) where e is the number of the edges in the &ldquo;wait-for&rdquo; graph) but also fairly simple. With this algorithm one can detect all deadlocks as soon as possible and list all participators in the corresponding cycle of the &ldquo;wait-for&rdquo; graph. The algorithm is described for the use of database transaction management.
Optical Flow with an Intensity-Weighted Smoothing
Authors: J. Aisbett
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

Matching algorithms which use image structure such as edges and junctions cannot perform well on unstructured images. For such images, global gradient-based methods may be more appropriate. Some of the assumptions involved in applying discretized conservation equations such as the optical flow equation are discussed and an intensity-weighted method of estimating dense displacement fields is presented, which attempts to avoid some of the problems of the standard methods. The only derivative required is the intensity gradient, and the method includes procedures for automatic parameter evaluation. The algorithm is expected to perform better than conventional algorithms on images without strong texture, as is demonstrated on the test set of images.
Using video-based observation to shape the design of a new technology
Authors: Deborah Tatar
Venue: ACM SIGCHI Bulletin (1989)

A common problem in the development of software is that the designers either overlook certain aspects of the users' situations or do not have access to them. Not all projects are plagued by this kind of oversight, but it is widespread in the development of single-user systems and is compounded when we turn to systems designed to support collaborative work.
Thick descriptions: a tool for designing ethnographic interactive videodiscs
Authors: R. G. Segall
Venue: ACM SIGCHI Bulletin (1989)

Videodisc technology will have a dramatic effect on the future of ethnographic educational research by giving the users of the videodisc workstation access to the actual 'raw' data and encouraging them to manipulate the material in a variety of ways. Users will have the ability to examine the original documentation, make their own observations, compare their observations with other researchers/users, and compile the 'data' with new levels of interpretation. Unlike more traditional research methodologies, in hypermedia ethnography there is no systematic way for different viewers to reach the same conclusions about the same content. However, building a system where each content grain or unit is a thick enough description of what is being examined could enable the user to come very close to understanding the underlying intention of the action, event or process presented on videodisc.
Annotator: an AI approach to engineering drawing annotation
Authors: Barbara J. Vivier, Melvin K. Simmons, Sharon A. Masline
Venue: Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1988)

Annotator is a prototype to investigate the application of AI techniques to the annotation of engineering drawings. In particular, Annotator addresses drawings of piping systems such as those for chemical plants or waste treatment facilities. The isometric representation of the piping system is selected because it is the most numerous type of drawing in plant design. Knowledge contained in hierarchies represents the CAD model of the piping system, features of the model and features of the drawing. Production rules about relationships among model items and features make annotation decisions, creating instances in a hierarchy of drawing annotations. Issues in geometry such as parallelism and perpendicularity and the translation of the 3-D model world into the 2-D drawing representation are addressed. Algorithms determine geometric intersections; rules specify whether intersections between given object classes are considered acceptable. Although Annotator prototype is separate from the CAD/CAM environment, the Annotator prototype illustrates the potential for fully automating the annotation process through representation of the knowledge about a piping model and its dimensioning requirements within a rule-based, object-oriented hierarchy.
Surface Orientation from a Projected Grid
Authors: N. Shrikhande, G. Stockman
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

Two simple methods are given for obtaining the surface shape using a projected grid. After the camera is calibrated to the 3-D workspace, the only input date needed for the computation of surface normals are grid intersect points in a single 2-D image. The first method performs nonlinear computations based on the distortion of the lengths of the grid edges and does not require a full calibration matrix. The second method requires that a full parallel projection model of the imaging is available, which enables it to compute 3-D normals using simple linear computations. The linear method performed better overall in the experiments, but both methods produced normals within 4-8 degrees of known 3-D directions. These methods appear to be superior to methods based on shape-from-shading because the results are comparable, yet the equipment setup is simpler and the processing is not very sensitive to object reflectance.
Fifth annual UCLA survey of business school computer usage
Authors: Jason L. Frand, Julia A. Britt
Venue: Communications of the ACM (1989)

This year's survey takes a look at where business schools are in terms of computerization, providing useful information for deans and others involved in making computer related allocation decisions and program plans.