ppxscal/embedding_network huggingface dataset:
Multicoloring of Grid-Structured PDE Solvers on Shared-Memory Multiprocessors
Authors: Hwang-Cheng Wang, Kai Hwang
Venue: IEEE Transactions on Parallel and Distributed Systems (1995)

In order to execute a parallel PDE (partial differential equation) solver on a shared-memory multiprocessor, we have to avoid memory conflicts in accessing multidimensional data grids. A new multicoloring technique is proposed for speeding sparse matrix operations. The new technique enables parallel access of grid-structured data elements in the shared memory without causing conflicts. The coloring scheme is formulated as an algebraic mapping which can be easily implemented with low overhead on commercial multiprocessors. The proposed multicoloring scheme has been tested on an Alliant FX/80 multiprocessor for solving 2D and 3D problems using the CGNR method. Compared to the results reported by Saad (1989) on an identical Alliant system, our results show a factor of 30 times higher performance in Mflops. Multicoloring transforms sparse matrices into ones with a diagonal diagonal block (DDB) structure, enabling parallel LU decomposition in solving PDE problems. The multicoloring technique can also be extended to solve other scientific problems characterized by sparse matrices.
Internet Streaming SIMD Extensions
Authors: Shreekant (Ticky) Thakkar, Tom Huff
Venue: Computer (1999)

Because floating-point computation is the heart of 3D geometry, speeding up floating-point computation is vital to overall 3D performance. To produce a visually perceptible difference in graphics applications, Intel's 32-bit processors--based on the IA-32 architecture--required an increase of 1.5 to 2 times the native floating-point performance. One path to better performance involves studying how the system uses data. Today's 3D applications can execute a lot faster by differentiating between data used repeatedly and streaming data--data used only once and discarded. Pentium III's new floating- point extension lets programmers designate data as streaming and provides instructions that handle this data efficiently. The authors designed the Internet Streaming SIMD Extensions to enable a new level of visual computing on the volume PC platform. They discuss their results in terms of boosting the performance of 3D and video applications.
Job Scheduling in a Partitionable Mesh Using a Two-Dimensional Buddy System Partitioning Scheme
Authors: K. Li, K. H. Cheng
Venue: IEEE Transactions on Parallel and Distributed Systems (1991)

The job scheduling problem in a partitionable mesh-connected system in which jobs require square meshes and the system is a square mesh whose size is a power of two is discussed. A heuristic algorithm of time complexity O(n(log n+log p)), in which n is the number of jobs to be scheduled and p is the size of the system is presented. The algorithm adopts the largest-job-first scheduling policy and uses a two-dimensional buddy system as the system partitioning scheme. It is shown that, in the worst case, the algorithm produces a schedule four times longer than an optimal schedule, and, on the average, schedules generated by the algorithm are twice as long as optimal schedules.
Prospects for an Engineering Discipline of Software
Authors: Mary Shaw
Venue: IEEE Software (1990)

Although software engineering is not yet a true engineering discipline, it has the potential to become one. Older engineering fields are examined to ascertain the character that software engineering might have. The current state of software technology is discussed, covering information processing as an economic force, the growing role of software in critical applications, the maturity of development techniques, and the scientific basis for software engineering practice. Five basic steps that the software engineering profession must take to become a true engineering discipline are described. They are: understanding the nature of expertise, recognizing different ways to get information, encouraging routine practice, expecting professional specializations, and improving the coupling between science and commercial practice.
Intelligent Access to Digital Video: Informedia Project
Authors: Howard D. Wactlar, Takeo Kanade, Michael A. Smith, Scott M. Stevens
Venue: Computer (1996)

Carnegie Mellon's Informedia Digital Video Library project will establish a large, on-line digital video library featuring full-content and knowledge-based search and retrieval. Intelligent, automatic mechanisms will be developed to populate the library. Search and retrieval from digital video, audio, and text libraries will take place via desktop computer over local-, metropolitan-, and wide-area networks. The project's approach applies several techniques for content-based searching and video-sequence retrieval. Content is conveyed in both the narrative (speech and language) and the image. Only by the collaborative interaction of image, speech, and natural-language understanding technology is it possible to successfully populate, segment, index, and search diverse video collections with satisfactory recall and precision. This collaborative interaction approach uniquely compensates for problems of interpretation and search in error-ridden and ambiguous data sets. The authors have focused the work on two corpuses. One is science documentaries and lectures, the other is broadcast news content with partial closed-captions. Further work will continue to improve the accuracy and performance of the underlying processing as well as explore performance issues related to Web-based access and interoperability with other digital video resources.
On an Asymptotically Optimal Adaptive Classifier Design Criterion
Authors: W. T. Lee, M. F. Tenorio
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

A new approach for estimating classification errors is presented. In the model, there are two types of classification error: empirical and generalization error. The first is the error observed over the training samples, and the second is the discrepancy between the error probability and empirical error. In this research, the Vapnik and Chervonenkis dimension (VCdim) is used as a measure for classifier complexity. Based on this complexity measure, an estimate for generalization error is developed. An optimal classifier design criterion (the generalized minimum empirical error criterion (GMEE)) is used. The GMEE criterion consists of two terms: the empirical and the estimate of generalization error. As an application, the criterion is used to design the optimal neural network classifier. A corollary to the Gamma optimality of neural-network-based classifiers is proven. Thus, the approach provides a theoretic foundation for the connectionist approach to optimal classifier design. Experimental results to validate this approach.
Fast Anti-Random (FAR) Test Generation to Improve the Quality of Behavioral Model Verification
Authors: Tom Chen, Andre Bai, Amjad Hajjar, Anneliese K. Amschler Andrews, C. Anderson
Venue: Journal of Electronic Testing: Theory and Applications (2002)

Anti-random testing has proved useful in a series of empirical evaluations. The basic premise of anti-random testing is to chose new test vectors that are as far away from existing test inputs as possible. The distance measure is either Hamming distance or Cartesian distance. Unfortunately, this method essentially requires enumeration of the input space and computation of each input vector when used on an arbitrary set of existing test data. This prevents scale-up to large test sets and/or long input vectors.We present and empirically evaluate a technique to generate anti-random vectors that is computationally feasible for large input vectors and long sequences of tests. We also show how this fast anti-random test generation (FAR) can consider retained state (i.e. effects of subsequent inputs on each other). We evaluate effectiveness of applying anti-random vectors for behavioral model verification using branch coverage as the testing criterion.
The Current State of CBSE
Authors: Alan W. Brown, Kurt C. Wallnau
Venue: IEEE Software (1998)

A component-based software engineering workshop at the 20th International Conference on Software Engineering discussed the current state of components. The authors synthesize these perspectives and ideas into a coherent discussion of how components are reshaping SE practices. A component-based system requires an infrastructure for communication and collaboration. Roger Sessions' sidebar on component middleware examines the Microsoft MTS and OMG Corba infrastructure technologies. David Chappell addresses the fundamental architectural issue of transactions in his sidebar, comparing how Microsoft's MTS and Sun's Enterprise JavaBeans handle transactions and component state.
Expert System Development: A Retrospective View of Five Systems
Authors: Adam Irgon, Jean Zolnowski, Karen J. Murray, Marvin Gersho
Venue: IEEE Expert: Intelligent Systems and Their Applications (1990)

The development of five expert systems of varying complexity is described. The five expert systems are: FAST, a system for the performance tuning of a large software system; Maven, a system for assigning Bellcore's Common Language equipment codes; GADS, a diagnostic shell for constructing hot-line support applications; Bellcore's OS-Assist system, a support tool for managers in directory-assistance offices; and Planner, a planning tool for determining calls setup signaling. The systems are briefly characterized and the lessons learned during development are summarized.
Realistic autonomous fish for virtual reality
Authors: Adele Lobb, Shaun Bangay
Venue: Proceedings of the 2nd international conference on Computer graphics, virtual Reality, visualisation and interaction in Africa (2003)

We create realistic autonomous fish for Virtual Reality systems. The fish are realistic in appearance, movement and behaviour: the swimming behaviour being non-scripted, within real time rendering.The form of the fish is procedurally created. The size and shape of the form are controlled by a number of variables which are stored in a simple ASCII file. This allows efficient creation of different fish at run time.The behaviour is obtained by implementing a flocking algorithm.
An OO Project Management Strategy
Authors: Babak Sadr, Patricia J. Dousette
Venue: Computer (1996)

Large OO projects pose coordination, logistical, and communication problems for managers. We have developed a strategy designed to help solve these problems. Our strategy calls for an iterative development process. In addition, we call for specialized work teams and the division of projects into strategic and tactical areas. Strategic processes address issues that have systemwide ramifications, such as system architecture. The strategic work is divided into setup, architecture definition, and development phases. Tactical processes address day-to-day activities, such as software design and testing. Dividing a project this way for organization and management purposes allows strategic and tactical issues to be addressed in a more focused and effective manner. Companies can determine how they will conduct tactical planning according to the basic principles of our management strategy and their standard operating procedures. Project staff is divided into systems engineering, architecture, development, environment/support, and software process teams. The use of specialized, cohesive teams, each working on its own set of strategic and tactical activities, divides and thereby reduces problems caused by project complexity. This also creates teams that are self-sufficient and that can work in parallel.
Innovative Built-In Self-Test Schemes for On-Chip Diagnosis, Compliant with the IEEE 1149.4 Mixed-Signal Test Bus Standard
Authors: Gladys Omayra Ducoudray-Acevedo, Jaime Ramírez-Angulo
Venue: Journal of Electronic Testing: Theory and Applications (2003)

This paper presents a testing scheme for analog and mixed-signal circuitry compatible with the IEEE 1149.4 mixed-signal test bus standard. A high-speed dynamic current sensor is described, as well as an innovative self-diagnostic method called VDDQ. The former is used to measure signature supply currents and to compare them with the footprint of a defect-free circuit. The latter senses the quiescent nodal voltages on several nodes of the circuit under test and compares them to their nominal values. A flag is raised if significant deviations are found. Simulation results are provided for the high-speed dynamic current sensor. Through simulations the VDDQ method has performed at one node test every half millisecond and has potential for much higher speed. It is faster than currently used methods in industry, which average to 5000 nodes per minute. This will potentially allow a defect-free IC to enter the market in significantly less time than with conventional testing methods.
Spatial Reasoning for the Automatic Recognition of Machinable Features in Solid Models
Authors: J. H. Vandenbrande, A. A. G. Requicha
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

Discusses an automatic feature recognizer that decomposes the total volume to be machined into volumetric features that satisfy stringent conditions for manufacturability, and correspond to operations typically performed in 3-axis machining centers. Unlike most of the previous research, the approach is based on general techniques for dealing with features with intersecting volumes. Feature interactions are represented explicitly in the recognizer's output, to facilitate spatial reasoning in subsequent planning stages. A generate-and-test strategy is used. OPS-5 production rules generate hints or clues for the existence of features, and post them on a blackboard. The clues are assessed, and those judged promising are processed to ensure that they correspond to actual features, and to gather information for process planning. Computational geometry techniques are used to produce the largest volumetric feature compatible with the available data. The feature's accessibility, and its interactions with others are analyzed. The validity tests ensure that the proposed features are accessible, do not intrude into the desired part, and satisfy other machinability conditions. The process continues until it produces a complete decomposition of the volume to be machined into fully-specified features.
Detecting differences in temporal distribution of small earthquakes before and after large events
Authors: T. Matcharashvili, T. Chelidze, Z. Javakhishvili, E. Ghlonti
Venue: Computers Geosciences (2002)

We have evaluated the dynamical properties of the temporal distribution of the small earthquakes. Two main goals of the investigation were: (a) a qualitative evaluation of the nonlinear structure of the time distribution of earthquakes, taking place before and after the strongest Caucasian events; (b) a quantitative discrimination of the dynamics (of time distribution of earthquakes) preceding and following the largest regional earthquakes.The dynamical characteristics of seismicity before and after four recent large earthquakes in the Caucasian region have been investigated. Nonlinear time-series analysis techniques, such as calculation of the correlation dimension for sliding windows and surrogate data analysis tests have been used; inter-event time-interval sequences have been considered as a time series.It was determined that the dynamics of lithospheric processes, generating the temporal distributions of earthquakes, do not change qualitatively before and after the largest Caucasian earthquakes. Inter-event time-interval sequences reveal low-dimensional nonlinear structure in both situations.On the other hand, quantitative analysis shows that the low-dimensional nonlinear structure of the temporal distributions of earthquakes after the largest events is significantly different than those before the largest events.
Optimal Routing Algorithm and the Diameter of the Cube-Connected Cycles
Authors: D. S. Meliksetian, C. Y. R. Chen
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

Communication between processors is one of the most important issues in parallel anddistributed systems. The authors study the communication aspects of a well knownmultiprocessor structure, the cube-connected cycles (CCC). Only nonoptimal routingalgorithms and bounds on the diameter of restricted subclasses of the CCC have beenpresented in earlier work. The authors present an optimal routing algorithm for the general CCC, with a formal proof of its optimality. Based on this routing algorithm, they derive the exact network diameter for the general CCC.
Nondeterministic, Nonmonotonic Logic Databases
Authors: Fosca Giannotti, Giuseppe Manco, Mirco Nanni, Dino Pedreschi
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

We consider in this paper an extension of Datalog with mechanisms for temporal, nonmonotonic, and nondeterministic reasoning, which we refer to as Datalog++. We show, by means of examples, its flexibility in expressing queries concerning aggregates and data cube. Also, we show how iterated fixpoint and stable model semantics can be combined to the purpose of clarifying the semantics of Datalog++ programs and supporting their efficient execution. Finally, we provide a more concrete implementation strategy on which basis the design of optimization techniques tailored for Datalog++ is addressed.
AMR vs High Order Schemes
Authors: Leland Jameson
Venue: Journal of Scientific Computing (2003)

Adaptive Mesh Refinement (AMR) schemes are generally considered promising because of the ability of the scheme to place grid points or computational degrees of freedom at the location in the flow where truncation errors are unacceptably large. For a given order, AMR schemes can reduce work. However, for the computation of turbulent or non-turbulent mixing when compared to high order non-adaptive methods, traditional 2nd order AMR schemes are computationally more expensive. We give precise estimates of work and restrictions on the size of the small scale grid and show that the requirements on the AMR scheme to be cheaper than a high order scheme are unrealistic for most computational scenarios.
Introduction to 3d MicroStation 95, 1st edition
Authors: A. Yarwood
Venue:  (1997)

:MicroStation 95 is an update of MicroStation Version 5, a first-class CAD (computer-aided design) software package in world-wide use. The software contains tools for the construction of three-dimensional (3D) solid model drawings and MicroStation Modeler, an add-on software package, can be used to provide further 3D tools and functionality. An Introduction to 3D MicroStation 95 has been written primarily for engineering students and those beginning to use the software for the construction and rendering of 3D models. Written in the author's well-known user-friendly and approachable style, the book covers all the basic features of the package. Assuming no previous knowledge of 3D construction, it familiarizes the reader with the software's capabilities through a course of work in three-dimensional drawing. The large number of exercises and questions then allow the reader to practise the techniques presented. The text is well illustrated throughout with screen dumps and example drawings, together with a set of colour plates which demonstrate clearly the use and full capabilities of the package. This essential book provides unrivalled coverage of 3D modelling techniques within MicroStation 95 and is suitable for students undertaking all courses where the software is used. Those in industry who wish to learn how to produce 3D drawings using the software will welcome the friendly text and excellent use of diagrams. 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
LAN and I/O Convergence: A Survey of the Issues
Authors: Martin W. Sachs, Avraham Leff, Denise Sevigny
Venue: Computer (1994)

Local area networks and computer I/O are both interconnects that move information from one location to another. Despite this shared purpose, LANs have traditionally connected independent and widely separated computers. In contrast, computer I/O has traditionally connected a host to peripheral devices such as terminals, disks, and tape drives. Because these connection tasks were different, the architectures developed for one task were not suitable for the other. Consequently, the technologies used to implement one architecture could not address the issues faced by the other, and the technologies were seen as fundamentally different. However, an examination of the architectural requirements of modern I/O and LANs shows that the differences between the two technologies are now disappearing. We believe that LAN and I/O architectures are in fact converging, and that this convergence reflects significant changes in how and where computing resources are used. To illustrate this convergence and its implications, this article examines several modern LANs and channels.
A New Uncertainty Measure for Belief Networks with Applications to Optimal Evidential Inferencing
Authors: Jiming Liu, David A. Maluf, Michel C. Desmarais
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

This paper is concerned with the problem of measuring the uncertainty in a broad class of belief networks, as encountered in evidential reasoning applications. In our discussion, we give an explicit account of the networks concerned, and coin them the Dempster-Shafer (D-S) belief networks. We examine the essence and the requirement of such an uncertainty measure based on well-defined discrete event dynamical systems concepts. Furthermore, we extend the notion of entropy for the D-S belief networks in order to obtain an improved optimal dynamical observer. The significance and generality of the proposed dynamical observer of measuring uncertainty for the D-S belief networks lie in that it can serve as a performance estimator as well as a feedback for improving both the efficiency and the quality of the D-S belief network-based evidential inferencing. We demonstrate, with Monte Carlo simulation, the implementation and the effectiveness of the proposed dynamical observer in solving the problem of evidential inferencing with optimal evidence node selection.
New results on the computability and complexity of points--to analysis
Authors: Venkatesan T. Chakaravarthy
Venue: Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2003)

Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a crucial role in compiler optimization. The problem is known to be undecidable when dynamic memory is allowed. But the result is known only when variables are allowed to be structures. We extend the result to show that, the problem remains undecidable, even when only scalar variables are allowed. Our second result deals with a version of points-to analysis called flow-insensitive analysis, where one ignores the control flow of the program and assumes that the statements can be executed in any order. The problem is known to be NP-Hard, even when dynamic memory is not allowed and variables are scalar. We show that when the variables are further restricted to have well-defined data types, the problem is in P. The corresponding flow-sensitive version, even with further restrictions, is known to be PSPACE-Complete. Thus, our result gives some theoretical evidence that flow-insensitive analysis is easier than flow-sensitive analysis. Moreover, while most variations of the points-to analysis are known to be computationally hard, our result gives a rare instance of a non-trivial points-to problem solvable in polynomial time.