ppxscal/embedding_network huggingface dataset:
A Perspective on Computational Structures Technology
Authors: Ahmed K. Noor, Samuel L. Venneri
Venue: Computer (1993)

Computational structures technology (CST), which blends structural modeling with computational methods and is an outgrowth of matrix methods used to analyze the dynamic and static responses of structures, is reviewed. The authors summarize CST's history and status, emphasizing software development, goals, and promising research areas. Example applications of CST from the aerospace field are presented.
Visually Controlled Graphics
Authors: A. Azarbayejani, T. Starner, B. Horowitz, A. Pentland
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

Interactive graphics systems that are driven by visual input are discussed. The underlying computer vision techniques and a theoretical formulation that addresses issues of accuracy, computational efficiency, and compensation for display latency are presented. Experimental results quantitatively compare the accuracy of the visual technique with traditional sensing. An extension to the basic technique to include structure recovery is discussed.
Negoplan: An Expert System Shell for Negotiation Support
Authors: Stan Matwin, Stan Szpakowicz, Zbig Koperczak, Gregory E. Kersten, Wojtek Michalowski
Venue: IEEE Expert: Intelligent Systems and Their Applications (1989)

The authors address a complex, two-party negotiation problem containing the following elements: (1) many negotiation issues that are elements of a negotiating party's position; (2) negotiation goals that can be reduced to unequivocal statements about the problem domain and that represent negotiation issues; (3) a fluid negotiating environment characterized by changing issues and relations between them; and (4) parties negotiating to achieve goals that may change. They describe in some detail the way they logically specify different aspects of negotiation. An application of Negoplan to a labor contract negotiation between the Canadian Paperworkers Union and CIP, Ltd. of Montreal is described.
Improving memory energy using access pattern classification
Authors: Mahmut Kandemir, Ugur Sezer, Victor Delaluz
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

In this paper, we propose a data-driven strategy to optimize the memory energy consumption in a banked memory system. Our compiler-based strategy modifies the original execution order of loop iterations in array-dominated applications to increase the length of the time period(s) in which memory banks are idle (i.e., not accessed by any loop iteration). To achieve this, it first classifies loop iterations according to their bank access patterns and then, with the help of a polyhedral tool, tries to bring the iterations with similar bank access patterns close together. Increasing the idle periods of memory banks brings two major benefits; first, it allows us to place more memory banks into low-power operating modes, and second, it enables us to use a more aggressive (i.e., more energy saving) operating mode for a given bank. Our strategy has been evaluated using seven array-dominated applications on both a cacheless system and a system with cache memory. Our results indicate that the strategy is very successful in reducing the memory system energy, and improves the memory energy by as much as 34% on the average.
Systems Engineering of Computer-Based Systems
Venue: Computer (1993)

This report from the State of Practice Working Group of the IEEE Computer Society Task Force on Engineering of Computer-Based Systems (ECBS) advocates a new discipline at the systems engineering level. The report addresses the need for an ECBS discipline, identifies current practice and needed research, and suggests improvements that are achievable today. It addresses problem areas: the ECBS process itself, requirements definition, design, interfaces, management, process automation, and documentation. The report concludes that an improved ECBS discipline is necessary for improving processes and for fostering research and training.
A Note on Orthogonal Graphs
Authors: S. V. R. Madabhushi, S. Lakshmivarahan, S. K. Dhall
Venue: IEEE Transactions on Computers (1993)

Orthogonal graphs are natural extensions of the classical binary and b-ary hypercubes b=2/sup l/ and are abstractions of interconnection schemes used for conflict-free orthogonal memory access in multiprocessor design. Based on the type of connection mode, these graphs are classified into two categories: those with disjoint and those with nondisjoint sets of modes. The former class coincides with the class of b-ary b=2/sup l/ hypercubes, and the latter denotes a new class of interconnection. It is shown that orthogonal graphs are Cayley graphs, a certain subgroup of the symmetric (permutation) group. Consequently these graphs are vertex symmetric, but it turns out that they are not edge symmetric. For an interesting subclass of orthogonal graphs with minimally nondisjoint set of modes, the shortest path routing algorithm and an enumeration of node disjoint (parallel) paths are provided. It is shown that while the number of node disjoint paths is equal to the degree, the distribution is not uniform with respect to Hamming distance as in the binary hypercube.
Measuring the Effects of Data Distribution Models on Performance Evaluation of Distributed Database Systems
Authors: R. Mukkamala
Venue: IEEE Transactions on Knowledge and Data Engineering (1989)

The effect of simplistic assumptions about the data distribution and replication in a system on performance measures and the computational complexity and accuracy of evaluations of performance measures is investigated. The size of the participating node set of a transaction is chosen as the desired performance measure. A data distribution and replication model is represented by four key parameters. Probabilistic analysis is used to evaluate six of these models. It is concluded that even though some of the data distribution and replication models appear to be simplistic, the results obtained from them are very close to those from complex models. In addition, the gains due to drastically reduced execution times strongly suggest the use of simple models (at least) in the early stages of the design process.
What I Did Last Summer: A Software Development Benchmarking Case Study
Authors: James T. Heires
Venue: IEEE Software (2001)

This article describes a vendor-supported benchmarking study of an applications development (IT) department. The study established a quantitative performance baseline of the organization and compared it to industry trends.
Rosetta: Semantic Support for Model-Centered Systems-Level Design
Authors: Perry Alexander, Cindy Kong
Venue: Computer (2001)

With the advent of system-on-chip (SoC) technology, the design of small electrical systems has become a systems engineering task. Such tasks require working at high levels of abstraction to build systems by either integrating information from various design domains or modeling different aspects of the same component. Designers of traditional computer-based systems usually rely on component- based techniques that parallel the physical architecture. The model-based approach encompasses the component-- centered approach, treating structural decomposition as a single model in the overall hierarchy. Model-centered semantics and languages let designers concentrate on the data, computation, or communication models that describe complex computer-based SoC requirements. Appropriate design semantics specify each system aspect, and the designer assembles those aspects into models to define complete systems and components. The developers of Rosetta, a heterogeneous systems-level modeling language that supports predictive design analysis, have identified mechanisms for defining and composing models that specify multiple domains of interest from many perspectives. Rosetta requirements and domains define test cases and generate abstract vectors for each test scenario. Several analysis tools are under development for transforming Rosetta into existing analysis environments, and the authors are also developing native analysis tools for symbolic verification and simulation environments. The authors use Rosetta to provide computation models for customized digital and mixed-signal system-specification environments. Other domains to support optical and microelectrical mechanical systems specifications are under consideration.
Identification of lithofacies using Kohonen self-organizing maps
Authors: Hsien-Cheng Chang, David C. Kopaska-Merkel, Hui-Chuan Chen
Venue: Computers Geosciences (2002)

Lithofacies identification is a primary task in reservoir characterization. Traditional techniques of lithofacies identification from core data are costly, and it is difficult to extrapolate to non-cored wells. We present a low-cost automated technique using Kohonen self-organizing maps (SOMs) to identify systematically and objectively lithofacies from well log data. SOMs are unsupervised artificial neural networks that map the input space into clusters in a topological form whose organization is related to trends in the input data. A case study used five wells located in Appleton Field, Escambia County, Alabama (Smackover Formation, limestone and dolomite, Oxfordian, Jurassic). A five-input, one-dimensional output approach is employed, assuming the lithofacies are in ascending/descending order with respect to paleoenvironmental energy levels. To consider the possible appearance of new logfacies not seen in training mode, which may potentially appear in test wells, the maximum number of outputs is set to 20 instead of four, the designated number of lithofacies in the study area.This study found eleven major clusters. The clusters were compared to depositional lithofacies identified by manual core examination. The clusters were ordered by the SOM in a pattern consistent with environmental gradients inferred from core examination: bind/boundstone, grainstone, packstone, and wackestone. This new approach predicted lithofacies identity from well log data with 78.8% accuracy which is more accurate than using a backpropagation neural network (57.3%). The clusters produced by the SOM are ordered with respect to paleoenvironmental energy levels. This energy-related clustering provides geologists and petroleum engineers with valuable geologic information about the logfacies and their interrelationships. This advantage is not obtained in backpropagation neural networks and adaptive resonance theory neural networks.
Where Is Software Headed? A Virtual Roundtable
Authors: Dave Power, Bertrand Meyer, Jack Grimes, Mike Potel, Ron Vetter, Phil Laplante, Wolfgang Pree, Gustav Pomberger, Mark D. Hill, James R. Larus, David A. Wood, Hersham El-Rewini, Bruce W. Weide
Venue: Computer (1995)

To find out where software is headed, we took to the Internet, asking experts in academia and industry to share their vision as to the future of software. For this "virtual" roundtable, we've assembled a selection of responses, on topics ranging from object technology, networked computing, software engineering, parallel computing, and software design in the undergraduate curriculum. If the topics are varied, these experts' views on the future of software are not. We were struck by the polarization within the software community as a whole. Software is in the midst of a revolution or a crisis; software professionals seem wildly optimistic or extremely pessimistic. To people in industry, software is racing toward a bright future made possible by object-oriented technology and client-server computing. To academics, things are moving too slowly and in the wrong direction--incremental changes are being made to an installed base that is itself inherently flawed. Whether you're in academia or industry, you'll find these brief descriptions interesting and thought provoking.
Insensitivity in processor-sharing networks
Authors: T. Bonald, A. Proutière
Venue: Performance Evaluation (2002)

We consider an open network of processor-sharing nodes with state-dependent service capacities, i.e., the speed of each node may depend on the number of customers at any node. We demonstrate that the stationary distribution of the network state is insensitive to the distribution of service times if and only if the service capacities are balanced, i.e., the considered network is a Whittle network. The stationary distribution then has a closed-form expression and the expected sojourn time of a customer at any node is proportional to its required quantity of service. These results are extended to the cases of closed networks and state-dependent arrival rates and routing. Two simple examples illustrate the practical interest of these results in the context of communication networks.
4-connected maximal planar graphs are 4-ordered
Authors: Wayne Goddard
Venue: Discrete Mathematics (2002)

It is shown that in a 4-connected maximal planar graph there is for any four vertices a, b, c and d, a cycle in the graph that contains the four vertices and visits them in the order a, b, c and d.
On Learning to Recognize 3-D Objects from Examples
Authors: S. Edelman
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

Previous results on nonlearnability of visual concepts relied on the assumption that such concepts are represented as sets of pixels. The author uses an approach developed by Haussler (1989) to show that under an alternative, feature-based representation, recognition is probably approximately correct (PAC) learnable from a feasible number of examples in a distribution-free manner.
Phase control of an exciton-polariton in a quantum well waveguide and its application to optical devices
Authors: T. Katsuyama, K. Hosomi
Venue: Microelectronic Engineering (2002)

Electric-field-induced phase change of an exciton-polariton transmitted along the GaAs quantum well waveguide was measured as a function of temperature. Large phase changes up to 120 K were obtained. These phase changes explain the highly-efficient operation of Mach-Zehnder-type modulators and directional-coupler-type switches up to 77 K. These results are not explainable simply in terms of polariton stability, which indicates that the temperature-dependent phase change under the electric field is affected by more complex factors related to the polariton effect.
Application of Elliptic Fourier Descriptors to Symmetry Detection Under Parallel Projection
Authors: R. K. K. Yip, P. K. S. Tam, D. N. K. Leung
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

In this paper, the method of elliptic Fourier descriptors using arc length parameterization is applied to tackle the problem of detection and recovery of symmetry under parallel projection. A simple and fast iteration algorithm together with the invariants of symmetry provides sufficient information for the detection and recovery of symmetry under parallel projection. The proposed method has been extensively tested using symmetric figures under different parallel projections. Simulation results of the algorithm are presented. The extension of this method for planar object recognition under parallel projection is also addressed.
Design of Asynchronous Circuits Using Synchronous CAD Tools
Authors: Alex Kondratyev, Kelvin Lwin
Venue: IEEE Design Test (2002)

Poor CAD support hinders wide acceptance of asynchronous methodologies, and asynchronousdesign tools are far behind synchronous commercial tools. A new design flow, NCL_X, based entirely on commercial CAD tools, targets a subclass of asynchronous circuits called null convention logic. NCL_X shows significant area improvement over other flows for this subclass.EDA FLOWS are industry driven and thus use synchronous methodologies as de facto standards. However implementation problems arise from imposing a synchronous model of operation on deep-submicron circuits. This problem motivates the investigation of other asynchronous modes of operation. Acceptance of new design methodologies including asynchronous ones engineering and industrial communities depends on three major issues:added value of the methodology in terms ofareapowerspeedelectromagnetic interference (EMI) noise immunityand so on; tradeoffs whichdesignparametersoften worsen to achieve added valuessuch as speed versus power and area versusEMI; and the cost of switching to the new methodology including training time development of new libraries and time spent dealing with CAD tool immaturity.
Performance of Multiuser Detection in Multirate CDMA Systems
Authors: Markku J. Juntti
Venue: Wireless Personal Communications: An International Journal (1999)

Multiuser detectors for asynchronous multirate code-division multiple-access (CDMA) systems are considered. A multirate CDMA system model able to fit several system concepts in the same framework is presented. The performance of the multi-code (MC) system with one processing gain and the multiple processing gain (MPG) system is compared. Upper bounds for the expected value of the asymptotic multiuser efficiency of the decorrelating detector for a synchronous multirate CDMA system with three effective users are derived for a system with one and two processing gains. The numerical results show that the performance of the decorrelating detector for MC and MPG systems do not differ significantly. The bit error rates (BER) of the decorrelating, parallel interference canceler (PIC) and groupwise serial interference canceler (GSIC) with either PIC or decorrelator within the group are compared. The results show that the decorrelating and the GSIC detectors yield the best performance. For all interference cancellation schemes the BER saturates at high SNRs due to decision errors degrading the multiple-access interference (MAI) estimates.
Improving Memory Utilization in Cache Coherence Directories
Authors: D. J. Lilja, P. C. Yew
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

Efficiently maintaining cache coherence is a major problem in large-scale shared memorymultiprocessors. Hardware directory coherence schemes have very high memoryrequirements, while software-directed schemes must rely on imprecise compile-timememory disambiguation. Recently proposed dynamically tagged directory schemes allocate pointers to blocks only as they are referenced, which significantly reduces their memory requirements, but they still allocate pointers to blocks that do not need them. Theauthors present two compiler optimizations that exploit the high-level sharing information available to the compiler to further reduce the size of a tagged directory by allocating pointers only when necessary. Trace-driven simulations are used to show that the performance of this combined hardware-software approach is comparable to othercoherence schemes, but with significantly lower memory requirements. In addition, thesesimulations suggest that this approach is less sensitive to the quality of the memorydisambiguation and interprocedural analysis performed by the compiler than software-only coherence schemes.
N-Version Design Versus One Good Version
Authors: Les Hatton
Venue: IEEE Software (1997)

Evidence indicates that n-version development techniques are more reliable than producing one "good" version-and cost effective in the long run. The author concludes that diverse, independent channels used in parallel are significantly superior to even the current state of the art, especially in situations where cost of failure is high.
Routing Table Compaction in Ternary CAM
Authors: Huan Liu
Venue: IEEE Micro (2002)

A network platform called the field-programmable port extender (FPX) streamlines and simplifies network transmission processing directly in hardware.
Using Neural Networks in Reliability Prediction
Authors: Nachimuthu Karunanithi, Darrell Whitley, Yashwant K. Malaiya
Venue: IEEE Software (1992)

It is shown that neural network reliability growth models have a significant advantage over analytic models in that they require only failure history as input and not assumptions about either the development environment or external parameters. Using the failure history, the neural-network model automatically develops its own internal model of the failure process and predicts future failures. Because it adjusts model complexity to match the complexity of the failure history, it can be more accurate than some commonly used analytic models. Results with actual testing and debugging data which suggest that neural-network models are better at endpoint predictions than analytic models are presented.
Towards a Realization of a Wavelet Galerkin Method on Non-Trivial Domains
Authors: Stefano Berrone, Laurent Emmel
Venue: Journal of Scientific Computing (2002)

In this paper we describe a realization of a Wavelet&ndash;Galerkin method for numerically solving second order elliptic PDEs on general domains using the Wavelet Element Method (WEM) &lsqb;4, 5&rsqb;. Suitable {\sf C}++ data structures allowing an efficient implementation of this method are described and numerical results also indicating the flexibility of our realization are presented.
Concurrent Algorithms for Real-Time Memory Management
Authors: Ray Ford
Venue: IEEE Software (1988)

The conflict between the performance demands of real-time systems and the shared-resource needs of high-level languages (Ada in particular) is examined. Shared memory requires carefully designed concurrency control, but the traditional approach, which is to embed the entire allocate-release implementation code in critical sections, is unsuitable for real-time applications because it results in excessively high response time. The design and performance of three memory-management systems for real-time applications are evaluated, and it is shown that one system, an optimized optimistic version, does deliver performance that is acceptable for real-time applications.
An Improved Algorithm for Implication Testing Involving Arithmetic Inequalities
Authors: W. Sun, M. A. Weiss
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

Implication testing of arithmetic inequalities has been widely used in different areas in database systems and has received extensive research as well. Klug and Ullman (A. Klug, 1988; and J.D. Ullman, 1989) proposed an algorithm that determines whether S implies T, where T and S consist of inequalities of form (X op Y), X and Y are two variables, and op¿{=, , ¿}. The complexity of the algorithm is O(n³), where n is the number of inequalities in S. We reduce the problem to matrix multiplication, thus improving the time bound to O(n^2.376). We also demonstrate an O(n²) algorithm if the number of inequalities in T is bounded by O(n). Since matrix multiplication has been well studied, our reduction allows the possibility of directly adopting many practical results for managing matrices and their operations, such as parallel computation and efficient representation of sparse matrices.
Chip-Package Codesign for High-Frequency Circuits and Systems
Authors: Jenshan Lin
Venue: IEEE Micro (1998)

The demand of processing and transmitting fast-expanding information in the shortest time frame is driving the electronic components in computer and communication systems into "High Frequency" realm. In the meantime, the demand of light-weight, compact, and low-cost consumer electronics is driving the integrated circuits and systems to be smaller and cheaper. When these two trends merge together, the designers are facing a challenge: How to ensure the electronic components are functioning correctly in a smaller-than-ever environment with all the possible high-frequency parasitic effect? Chip-package co-design therefore becomes a focus in the hope of solving this issue.