ppxscal/embedding_network huggingface dataset:
Shadow: Fusing Hypertext with AI
Authors: Patricia Carando
Venue: IEEE Expert: Intelligent Systems and Their Applications (1989)

The author discusses Shadow, an experimental system combining hypertext (H) and artificial intelligence (AI) techniques to support software engineering (SE)-a HAISE system. She focuses on how we use AI for knowledge acquisition and navigation in hypertext databases. She describes the use of hypertext systems to support software engineering and examines how to use AI to assist software development by using hypertext database knowledge. She explores difficulties with this approach, including the problems of search versus browsing, user (dis)orientation, and the additional complexity that complicated tools add to the software development process. In addition to HAISE, the author discusses the Augment, Intermedia, Neptune, and Knoesphere hypermedia systems.
Characterizing the Software Process: A Maturity Framework
Authors: Watts S. Humphrey
Venue: IEEE Software (1988)

A description is given of a software-process maturity framework that has been developed to provide the US Department of Defense with a means to characterize the capabilities of software-development organizations. This software-development process-maturity model reasonably represents the actual ways in which software-development organizations improve. It provides a framework for assessing these organizations and identifying the priority areas for immediate improvement. It also helps identify those places where advanced technology can be most valuable in improving the software-development process. The framework can be used by any software organization to assess its own capabilities and identify the most important areas for improvement.
Theoretical study of statistical fractal model with applications to mineral resource prediction
Authors: Shen Wei, Zhao Pengda
Venue: Computers Geosciences (2002)

The statistical estimation of fractal dimensions is an important topic of investigation. Current solutions emphsize visual straight-line fitting, but nonlinear statistical modeling has the potential of making valuable contributions in this field. In this paper, we present the concepts of generalized fractal models and generalized fractal dimension and conclude that many geological models are special cases of the generalized models. We show that the power-function distribution possesses the fractal property of scaling invariance under upper truncation, which may help in lead statistical fractal modeling. A new method is developed on the basis of nonlinear regression to estimate fractal parameters. This method has advantages with respect to the traditional method based on linear regression for estimating the fractal dimension. Finally, the new method is illustrated by means of application to a real data set.
Implementing Dialogue Independence
Authors: Drasko M. Sotirovski, Philippe B. Kruchten
Venue: IEEE Software (1995)

Dialogue independence -- the decoupling of the Computer-Human Interface from the core application software -- can be achieved simply through an appropriate architectural framework, with no loss of efficiency. We show that the objective of dialogue independence can be decomposed into three separate subgoals that a software architecture must resolve: existence, property, and transition. We identify architectural patterns that satisfy all three subgoals, and give a rough sketch of their design and implementation.We chose an air-traffic-control system to illustrate our proposed decomposition because of our experience with it and because it exposes many of the difficulties inherent in a typical, large CHI software architecture. We use the terminology of object-oriented software architecture, but we propose a decomposition that is independent of the methodology used.
Representation of Models for Expert Problem Solving in Physics
Authors: H. J. Kook, G. S. Novak,  Jr.
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

A computer program, APEX, is proposed to investigate idealized formal models representing physics problems. Two types of models are defined: canonical physical objects and physical models. During problem solving, the problem is represented as a data connection network, which is progressively augmented by these models in the form of additional network elements. APEX employs views as a representational framework for connecting the initially informal objects to the formal models of the domain. The view framework supports multiple representations (e.g., viewing many objects as a single canonical physical object), handling of incompletely specified problems, and invertibility of the views. This computational framework provides a powerful representational mechanism that allows a finite set of physical principles to be applied to a potentially infinite variety of problems. As a knowledge engineering technique, views allow general principles to be applied to a variety of objects whose representations differ.
A tetrahedra-based stream surface algorithm
Authors: Gerik Scheuermann, Tom Bobach, Hans Hagen, Karim Mahrous, Bernd Hamann, Kenneth I. Joy, Wolfgang Kollmann
Venue: Proceedings of the conference on Visualization '01 (2001)

This paper presents a new algorithm for the calculation of stream surfaces for tetrahedral grids. It propagates the surface through the tetrahedra, one at a time, calculating the intersections with the tetrahedral faces. The method allows us to incorporate topological information from the cells, e.g., critical points. The calculations are based on barycentric coordinates, since this simplifies theory and algorithm. The stream surfaces are ruled surfaces inside each cell, and their construction is started with line segments on the faces. Our method supports the analysis of velocity fields resulting from computational fluid dynamics (CFD) simulations.
One Billion Transistors, One Uniprocessor, One Chip
Authors: Yale N. Patt, Sanjay J. Patel, Marius Evers, Daniel H. Friendly, Jared Stark
Venue: Computer (1997)

Researchers from the University of Michigan conclude that billion-transistor processors will be much as they are today, but just bigger, faster, and wider (issuing more instructions at once). The authors describe the key problems (instruction supply, data memory supply, and an implementable execution core) that prevent current superscalars from scaling up to the 16- or 32-instructions per issue. They propose using out-of-order fetching, Multi-Hybrid branch predictors, and trace caches to improve the instruction supply. They predict that replicated first-level caches, huge on-chip caches, and data value speculation will enhance the data supply. To provide a high-speed, implementable execution core capable of sustaining the necessary instruction throughput, they advocate a large, out-of-order-issue instruction window (2,000 instructions), clustered (separated) banks of functional units, and hierarchical scheduling of ready instructions. They contend that the current uniprocessor model can provide sufficient performance and use a billion transistors effectively without changing the programming model or discarding software compatibility.
Counting dyadic equipartitions of the unit square
Authors: Jeffery C. Lagarias, Joel H. Spencer, Jade P. Vinson
Venue: Discrete Mathematics (2002)

A dyadic interval is an interval of the form [j/2k, (j + 1)/2k], where j and k are integers, and a dyadic rectangle is a rectangle with sides parallel to the axes whose projections on the axes are dyadic intervals. Let un count the number of ways of partitioning the unit square into 2n dyadic rectangles, each of area 2-n. One has u0 = 1, u1 = 2 and un = 2un-12 - un-24. This paper determines an asymptotic formula for a solution to this nonlinear recurrence for generic real initial conditions. For almost all real initial conditions there are real constants ω and β (depending on u0, U1) with ω > 0 such that for all sufficiently large n one has the exact formula un = ω2n g(βλn), where λ = 2√5 - 4 ≈ 0.472, and g(z) = Σj=0∞ cjzj, in which c0 = (- 1 + √5)/2, c1 = (2 - √5)/2, all coefficients cj lie in the field Q(√5), and the power series converges for |z| < 0.16. These results apply to the initial conditions u0 = 1, u1 = 2 with ω ≈ 1.845 and β ≈ 0.480. The exact formula for un then holds for all n ≥ 2. The proofs are based on an analysis of the holomorphic dynamics of iterating the rational function R(z) = 2 - 1/z2.
A Dynamic Programming Algorithm for Cache Memory Partitioning for Real-Time Systems
Authors: J. E. Sasinowski, J. K. Strosnider
Venue: IEEE Transactions on Computers (1993)

An algorithm for optimally partitioning two-level memory systems for deterministic, real-time performance is presented. The algorithm finds the optimal solution in polynomial time, which supports on-line reconfiguration of memory resources in response to changing requirements.
A Group Membership Algorithm with a Practical Specification
Authors: Massimo Franceschetti, Jehoshua Bruck
Venue: IEEE Transactions on Parallel and Distributed Systems (2001)

This paper presents a solvable specification and gives an algorithm for the Group Membership Problem in asynchronous systems with crash failures. Our specification requires processes to maintain a consistent history in their sequences of views. This allows processes to order failures and recoveries in time and simplifies the programming of high level applications. Previous work has proven that the Group Membership Problem cannot be solved in asynchronous systems with crash failures. We circumvent this impossibility result building a weaker, yet nontrivial specification. We show that our solution is an improvement upon previous attempts to solve this problem using a weaker specification. We also relate our solution to other methods and give a classification of progress properties that can be achieved under different models.
A Cube-Connected Cycles Architecture with High Reliability and Improved Performance
Authors: N. F. Tzeng
Venue: IEEE Transactions on Computers (1993)

The cube-connected cycles (CCC) architecture is an attractive parallel computation network, because it is suitable for VLSI implementation while preserving all the desired features of hypercubes. However, the CCC tends to suffer from considerable performance degradation when a fault arises. In this work, a fault-tolerant CCC which exhibits significantly enhanced reliability is proposed. Reconfiguration in response to an operational fault in this fault-tolerant CCC is simple and can be performed in a distributed manner. When compared with the CCC, the proposed design in the absence of faults gets performance improvement as a result of faster broadcasting and PE-to-PE communication. The layout of this structure is discussed, and its area overhead is found to be moderate if the PE size is much larger than the link/switch size. Therefore, this design approach is particularly useful for situations where the PE is relatively complex.
Introducing the Intel i860 64-Bit Microprocessor
Authors: Les Kohn, Neal Margulis
Venue: IEEE Micro (1989)

The authors describe the single-chip i860 CPU, a 64-bit, RISC (reduced-instruction-set-computer)-based microprocessor that executes parallel instructions using mainframe and supercomputer architectural concepts. They designed the 1,000,000-transistor, 10-mm*15-mm processor for balanced integer, floating-point, and graphics performance. They discuss the RISC core, memory management, floating-point unit, graphics, bus interface, software support, and interfacing to a DRAM system
Improving readability of contextualized text explanations
Authors: Wallace Chigona, Thomas Strothotte
Venue: Proceedings of the 2nd international conference on Computer graphics, virtual Reality, visualisation and interaction in Africa (2003)

Dual-Use of Image Space (duis) is an interactive technique for presenting text corresponding to images within the image space. From a technical point of view, the pixels in the image space are used both as text which can be read as well as for shading. This approach raises a number of interesting new readability problems: First, in order to simulate shading, the weight and the width of the character glyphs are manipulated. We have noted that readers find reading text with weight and width variations not only difficult but also irritating. Second, the shape of the silhouettes of the objects, by their irregular nature, are not ideal for text layout.In this paper we present techniques for addressing the duis readability problems. The techniques are divided into three categories as follows: First, shading and reading functionalities have been separated by creating two text presentation modes, shading mode and reading mode. In reading mode, it is no longer necessary to vary the weight and width of the character glyphs. Second, we have introduced the concept of multiple column presentation to address the problems of interruptions in reading. Finally, distortions of the objects are also used to improve readability.
Physical planning with retiming
Authors: Jason Cong, Sung Kyu Lim
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

In this paper, we propose a unified approach to partitioning, floorplanning, and retiming for effective and efficient performance optimization. The integration enables the partitioner to exploit more realistic geometric delay model provided by the underlying floorplan. Simultaneous consideration of partitioning and retiming under the geometric delay model enables us to hide global interconnect latency effectively by repositioning FF along long wires. Under the proposed geometric embedding based performance driven partitioning problem, our GEO algorithm performs multi-level top-down partitioning while determining the location of the partitions. We adopt the concept of sequential arrival time [14] and develop sequential required time in our retiming based timing analysis engine. GEO performs cluster-move based iterative improvement on top of multi-level cluster hierarchy [4], where the gain function obtained from the timing analysis is based on the minimization of cutsize, wirelength, and sequential slack. In our comparison to (i) state-of-the-art partitioner hMetis [9] followed by retiming [11] and simulated annealing based slicing floorplanning [15], and (ii) state-of-the-art simultaneous partitioning with retiming HPM [7] followed by floorplanning [15], GEO obtains 35% and 23% better delay results while maintaining comparable cutsize, wirelength, and runtime results.
Adding Temporal Reasoning to Expert-System-Building Environments
Authors: Walton A. Perkins, Avis Austin
Venue: IEEE Expert: Intelligent Systems and Their Applications (1990)

The authors discuss the incorporation of temporal-reasoning capability in an expert-system-shell environment, and the implication of this approach by storing attribute values with time tags. In essence, this adds an extra dimension (time) to the frame database but, due to the implementation method chosen, the storage space increase tends to be small. A time-tag capability for point times and intervals was implemented to make temporal reasoning as general as possible. Since values are often stored at point times or unconnected intervals, the meaning of the values at nonspecified times must be covered. Four different methods to cover those times were implemented, and knowledge engineers can select the one appropriate for each attribute. To focus the research, the authors applied temporal reasoning to a monitoring-and-diagnosis application in which time-dependent data had been difficult to handle. They developed Wheels, an expert system that diagnoses problems with the Hubble space telescope's reaction wheels.
Interactive Mathematics on the Macintosh
Venue: IEEE Software (1990)

No abstract available The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Extending the object model to provide explicit support for crosscutting concerns
Authors: Constantinos A. Constantinides, Tzilla Elrad, Mohamed E. Fayad
Venue: Software&mdash;Practice Experience (2002)

Concurrent systems tend to have certain properties that are not localized in single modular units, but their implementations cut across functional components, increasing coupling and making modular units difficult to reuse and adapt. Example properties include concurrency, synchronization, and authentication. This problem is particularly apparent in systems with evolving requirements, as adapting code that is not localized in single modular units proves to be a tedious process. In this paper we discuss issues related to requirements of concurrent software systems to provide explicit support for these cross-cutting concerns, and we present the Aspect Moderator, a framework extension to the object model that can ease the development of concurrent object-oriented systems.
The Challenges of Mobile Computing
Authors: George H. Forman, John Zahorjan
Venue: Computer (1994)

The technical challenges that mobile computing must surmount to achieve its potential are hardly trivial. Some of the challenges in designing software for mobile computing systems are quite different from those involved in the design of software for today's stationary networked systems. The authors focus on the issues pertinent to software designers without delving into the lower level details of the hardware realization of mobile computers. They look at some promising approaches under investigation and also consider their limitations. The many issues to be dealt with stem from three essential properties of mobile computing: communication, mobility, and portability. Of course, special-purpose systems may avoid some design pressures by doing without certain desirable properties. For instance portability would be less of a concern for mobile computers installed in the dashboards of cars than with hand-held mobile computers. However, the authors concentrate on the goal of large-scale, hand-held mobile computing as a way to reveal a wide assortment of issues.
Conformal Transformation of Kernel Functions: A Data-Dependent Way to Improve Support Vector Machine Classifiers
Authors: Si Wu, Shun-Ichi Amari
Venue: Neural Processing Letters (2002)

In this paper we extend the conformal method of modifying a kernel function to improve the performance of Support Vector Machine classifiers &lsqb;14, 15&rsqb;. The kernel function is conformally transformed in a data-dependent way by using the information of Support Vectors obtained in primary training. We further investigate the performances of modified Gaussian Radial Basis Function and Polynomial kernels. Simulation results for two artificial data sets show that the method is very effective, especially for correcting bad kernels.
An Adaptive Fault-Tolerant Routing Algorithm for Hypercube Multicomputers
Authors: Youran Lan
Venue: IEEE Transactions on Parallel and Distributed Systems (1995)

This paper presents a partially adaptive fault-tolerant routing algorithm for hypercube multicomputers. The algorithm is tolerant to n¿ 1 link and/or node faults for an n-cube. It makes routing decisions adaptively based on local failure information only. It is simple to implement and needs a very small message overhead. A comparison between the algorithm and a popular previous work is given.
Realization of Gmicro/200
Authors: Hideo Inayoshi, Ikuya Kawasaki, Tadahiko Nishimukai, Ken Sakamura
Venue: IEEE Micro (1988)

The Gmicro/200, a microprocessor that has been developed as part of Japan's TRON (The Real-Time Operating Nucleus) project, is described. This microprogram-based processor with six-state pipeline, 730000 transistors and on-chip caches will serve in an engineering workstation or a high-speed graphics accelerator system. The authors discuss features of the instruction set; memory management; handling of exceptions, interrupts and traps; and the implementation of the Gmicro/200.
Data parallel language and compiler support for data intensive applications
Authors: Renato Ferreira, Gagan Agrawal, Joel Saltz
Venue: Parallel Computing (2002)

Processing and analyzing large volumes of data plays an increasingly important role in many domains of scientific research. High-level language and compiler support for developing applications that analyze and process such datasets has, however, been lacking so far.In this paper, we present a set of language extensions and a prototype compiler for supporting high-level object-oriented programming of data intensive reduction operations over multidimensional data. We have chosen a dialect of Java with data-parallel extensions for specifying a collection of objects, a parallel for loop, and reduction variables as our source high-level language. Our compiler analyzes parallel loops and optimizes the processing of datasets through the use of an existing run-time system, called active data repository (ADR). We show how loop fission followed by interprocedural static program slicing can be used by the compiler to extract required information for the run-time system. We present the design of a compiler/run-time interface which allows the compiler to effectively utilize the existing run-time system.A prototype compiler incorporating these techniques has been developed using the Titanium front-end from Berkeley. We have evaluated this compiler by comparing the performance of compiler generated code with hand customized ADR code for three templates, from the areas of digital microscopy and scientific simulations. Our experimental results show that the performance of compiler generated versions is, on the average 21% lower, and in all cases within a factor of two, of the performance of hand coded versions.
SH-5: The 64-Bit SuperH Architecture
Authors: Prasenjit Biswas, Atsushi Hasegawa, Srinivas Mandaville, Mark Debbage, Andy Sturges, Fumio Arakawa, Yasuhiko Saito, Kunio Uchiyama
Venue: IEEE Micro (2000)

Embodying an emerging philosophy of embedded-core design, the latest SuperH microprocessor provides a platform for a wide range of multimedia applications. Its SIMD extensions provide the parallelism required for efficient execution of these applications.
A Multiple-Baseline Stereo
Authors: M. Okutomi, T. Kanade
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

A stereo matching method that uses multiple stereo pairs with various baselines generated by a lateral displacement of a camera to obtain precise distance estimates without suffering from ambiguity is presented. Matching is performed simply by computing the sum of squared-difference (SSD) values. The SSD functions for individual stereo pairs are represented with respect to the inverse distance and are then added to produce the sum of SSDs. This resulting function is called the SSSD-in-inverse-distance. It is shown that the SSSD-in-inverse-distance function exhibits a unique and clear minimum at the correct matching position, even when the underlying intensity patterns of the scene include ambiguities or repetitive patterns. The authors first define a stereo algorithm based on the SSSD-in-inverse-distance and present a mathematical analysis to show how the algorithm can remove ambiguity and increase precision. Experimental results with real stereo images are presented to demonstrate the effectiveness of the algorithm.