ppxscal/embedding_network huggingface dataset:
General-Purpose Systolic Arrays
Authors: Kurtis T. Johnson, A. R. Hurson, Behrooz Shirazi
Venue: Computer (1993)

The extension of systolic array architecture from fixed- or special-purpose architectures to general-purpose, SIMD (single-instruction stream, multiple-data stream), MIMD (multiple-instruction stream, multiple-data stream) architectures, and hybrid architectures that combine both commercial and FPGA (field-programmable gate array) technologies is chronicled. The authors present a taxonomy for systolic organizations, discuss each architecture's methods of exploiting concurrencies, and compare performance attributes of each. The authors also describe a number of implementation issues that determine a systolic array's performance efficiency, such as algorithms and mapping, system integration through memory subsystems, cell granularity, and extensibility to a wide variety of topologies.
Scenarios in System Development: Current Practice
Authors: Klaus Weidenhaupt, Klaus Pohl, Matthias Jarke, Peter Haumer
Venue: IEEE Software (1998)

The authors report on a survey of scenario-based requirements engineering practices at 15 different projects in four European countries. They conducted on-site interviews of project teams and examined documents produced and the environments and tools used. The Crews team noted that scenario purposes and uses varied more widely than expected, which suggests the need for better management and tool support to develop and maintain scenarios as artifacts in their own right.
The Real Creators of Cobol
Authors: Jean E. Sammet
Venue: IEEE Software (2000)

Contrary to persistent myths, a committee initially created Cobol in 1959, not one person. This article outlines the creation and mission of the committee that developed the language and a few of the major inputs and influences on Cobol's initial development, including the people actually involved. This material is based on documents from the 1959 committee work which in the possession of the author.
Dragon2000: standard-cell placement tool for large industry circuits
Authors: Maogang Wang, Xiaojian Yang, Majid Sarrafzadeh
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

In this paper, we develop a new standard cell placement tool, Dragon2000, to solve large scale placement problem effectively. A top-down hierarchical approach is used in Dragon2000. State-of-the-art partitioning tools are tightly integrated with wirelength minimization techniques to achieve superior performance. We argue that net-cut minimization is a good and important shortcut to solve the large scale placement problem. Experimental results show that minimizing net-cut is more important than greedily obtain a wirelength optimal placement at intermediate hierarchical levels. We run Dragon2000 on recently released large benchmark suite ISPD98 as well as MCNC circuits. For circuits which have more than 100k cells, comparing to iTools1.4.0, Dragon2000 can produce slightly better placement results (1.4%) while spending much less amount of time (2&times; speedup). This is also the first published placement result on the publicly available large industrial circuits.
Out-of-control structures
Authors: Jim Lucas
Venue: ACM SIGAPL APL Quote Quad (2002)

The proponents of Control Structures1 claimed that adding them to APL2 would improve both the organizational structure and the readability of APL code, but in my experience this has not occurred. Instead, I find previous obstacles to readability have often simply been supplanted by different obstacles and prior forms of structural awkwardness by new architectural excesses.It appears to me that some of these changes3 represent a loss of "APL-ness" in coding style, specifically those characteristics of conciseness, modularity, and linearity.This paper discusses specific changes in style and the difficulties I feel they create, and then presents various proposals for improving the situation. The ideas presented are illustrated with examples taken from actual code written by professional APL programmers.4
Power exploration for embedded VLIW architectures
Authors: Mariagiovanna Sami, Donatella Sciuto, Cristina Silvano, Vittorio Zaccaria
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

In this paper, we propose a system-level power exploration methodology for embedded VLIW architectures based on an instruction-level analysis. The instruction-level energy model targets a general pipeline scalar processor; several architectural parameters such as number and type of pipeline stages as well as average stall/latency cycles per instruction and inter-instruction effects are taken into account. The application of the proposed model to VLIW processors results intractable from the point of view of both spatial and temporal complexity (which grow exponentially w.r.t. the number of possible operations in the ISA). To reduce this complexity, the basic model has been extended by assuming that the energy associated with a long instruction is given by the sum of the energy associated with the single operations of the long instruction and the single pipeline stages. The instruction-level energy model has been applied to a simplified VLIW architecture to demonstrate the validity of the proposed approach.1
Explaining Control Strategies in Problem Solving
Authors: B. Chandrasekaran, Michael C. Tanner, John R. Josephson
Venue: IEEE Expert: Intelligent Systems and Their Applications (1989)

Explaining how knowledge-based systems reason involves presentation user modeling, dialogue structure, and the way systems understand their own problem-solving knowledge and strategies. The authors concentrate on the last of these, noting that such understanding provides any explanations's content. The authors also note that most current approaches to knowledge-based system construction require expressing knowledge and control at such low levels that it's hard to give high-level explanations. Providing an explanation example from a prototypical system (MYCIN) built using generic-task methods, they propose generic-task methodology as one way to build knowledge-based systems that contain basic explanation constructs at appropriate abstraction levels. The central concept of generic tasks is what input-output behavior (i.e. that task function), knowledge needed to perform the task, and inferences appropriate for the task are all specified together.
Constant Time Sorting on Reconfigurable Meshes
Authors: C. -C. Chen, W. -T. Chen
Venue: IEEE Transactions on Computers (1994)

We present a constant time sorting algorithm by adopting a 3D reconfigurable mesh with only O(n/sup 3/2/) processors. Our algorithm is developed on an n/sup 1/2//spl times/n/sup 1/2//spl times/n/sup 1/2/ 3-D reconfigurable mesh. Moreover, we further extend the result to k-dimensional reconfigurable meshes for k/spl ges/3. Consequently, an O(4/sup k+1/) time sorting algorithm is obtained by adopting an n/sup 1/(k-1)//spl times/n/sup 1/(k-1)//spl times/.../spl times/n/sup 1/(k-1)/k-D reconfigurable mesh of size O(n/sup 1+1/(k-1)/). Hence, constant time sorting using O(n/sup 1+/spl epsiv//) processors, where O>/spl epsiv//spl Lt/1, can be realized by adopting reconfigurable meshes of high dimensions.
Foundations of Secure Deductive Databases
Authors: Piero A. Bonatti, Sarit Kraus, V. s. Subrahmanian
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

In this paper, we develop a formal logical foundation for secure deductive databases. This logical foundation is based on an extended logic involving several modal operators. We develop two models of interaction between the user and the database called ¿yes-no¿ dialogs, and ¿yes-no-don¿t know¿ dialogs. Both dialog frameworks allow the database to lie to the user. We develop an algorithm for answering queries using yes-no dialogs and prove that secure query processing using yes-no dialogs is NP-complete. Consequently, the degree of computational intractability of query processing with yes-no dialogs is no worse than for ordinary databases. Furthermore, the algorithm is maximally cooperative to user in the sense that lying is resorted to only when absolutely necessary. For Horn databases, we show that secure query processing can be achieved in linear time - hence, this is no more intractable than the situation in ordinary databases. Finally, we identify necessary and sufficient conditions for the database to be able to preserve security. Similar results are also obtained for yes-no-don¿t know dialogs.
Dynamic Statistical Control of Manufacturing Test
Authors: Sakti P. Ghosh, Edward G. Grochowski
Venue: IEEE Design Test (1990)

A method for controlling manufacturing tests in real time by statistically predicting test behavior is described. This statistical prediction is used to eliminate certain tests in sequential testing. Analytic methods for clustering tests for more efficient execution and an algorithm for predictive testing are presented. A relational database using structured-query-language system, called SQL/DB2 is proposed; its structure allows efficient retrieval of the information needed for test prediction, test clustering, and predictive testing. A test-system architecture based on personal computers is presented.
Using Structured Benchmarking to Fast-Track CMM Process Improvement
Authors: Gareth C. Thomas, Howard R. Smith
Venue: IEEE Software (2001)

Sikorsky Aircraft, in pursuit of a formal rating based on the Capability Maturity Model from the Software Engineering Institute, determined that software benchmarking would help plan the process improvement and assessment effort. With the assistance of a benchmarking expert, Sikorsky developed a benchmarking questionnaire, which it used at five selected companies. The results then successfully guided its process improvement project. This article describes the activities in preparing for the benchmarking trips, structuring the questionnaire, aggregating the results, and evaluating the lessons learned.
PX-NOM: an interactive spreadsheet program for the computation of pyroxene analyses derived from the electron microprobe
Authors: R. Sturm
Venue: Computers Geosciences (2002)

PX-NOM is a Microsoft ExcelTM spreadsheet program that enables the user to calculate structural formulae of pyroxene analyses obtained from the electron microprobe and to determine respective pyroxene names according to the classification scheme of the International Mineralogical Association. The nomenclature used in the program contains only mineral names and adjectival modifiers accepted by the Subcommission on Pyroxenes. Additionally, PX-NOM permits the use of the jadeite+quartz geobarometer for clinopyroxenes containing jadeite as well as various garnet-clinopyroxene Fe-Mg exchange thermometers. The barometer calculates a minimum pressure, if only secondary plagioclase is available in the mineral assemblage and therefore XAbPl has to be set to 1. The exchange thermometers show best results in LT-MT eclogites which bear only low contents of high-Si phases (quartz, feldspar). Pyroxene analyses belonging to the Ca-Fe-Mg, Ca-Na or Na group can be plotted in the Wo-Fs-En triangle or the Quad-Ae-Jd diagram, respectively. The diagrams are presented on separate sheets and can be manipulated and printed optionally.
Cache Invalidation and Replacement Strategies for Location-Dependent Data in Mobile Environments
Authors: Baihua Zheng, Jianliang Xu, Dik L. Lee
Venue: IEEE Transactions on Computers (2002)

Mobile location-dependent information services (LDISs) have become increasingly popular in recent years. However, data caching strategies for LDISs have thus far received little attention. In this paper, we study the issues of cache invalidation and cache replacement for location-dependent data under a geometric location model. We introduce a new performance criterion, called caching efficiency, and propose a generic method for location-dependent cache invalidation strategies. In addition, two cache replacement policies, PA and PAID, are proposed. Unlike the conventional replacement policies, PA and PAID take into consideration the valid scope area of a data value. We conduct a series of simulation experiments to study the performance of the proposed caching schemes. The experimental results show that the proposed location-dependent invalidation scheme is very effective and the PA and PAID policies significantly outperform the conventional replacement policies.
Algres: An Advanced Database System for Complex Applications
Authors: Stefano Ceri, Stefano Crespi-Reghizzi, Roberto Zicari, Gianfranco Lamperti, Luigi A. Lavazza
Venue: IEEE Software (1990)

A description is given of Algres, a programming environment that extends the relational model to handle complex objects and operations and integrates the logic programming paradigm. Algres is designed to be used to develop knowledge bases, software-engineering systems, office-automation systems, and computer-aided design and manufacturing databases. The discussion covers the Algres components, its data model, the RA abstract machine, and user languages. The system is written entirely in C.
On the choice of the number of blocks with the incremental EM algorithm for the fitting of normal mixtures
Authors: S. K. Ng, G. J. McLachlan
Venue: Statistics and Computing (2003)

The EM algorithm is a popular method for parameter estimation in situations where the data can be viewed as being incomplete. As each E-step visits each data point on a given iteration, the EM algorithm requires considerable computation time in its application to large data sets. Two versions, the incremental EM (IEM) algorithm and a sparse version of the EM algorithm, were proposed recently by Neal R.M. and Hinton G.E. in Jordan M.I. (Ed.), Learning in Graphical Models, Kluwer, Dordrecht, 1998, pp. 355&ndash;368 to reduce the computational cost of applying the EM algorithm. With the IEM algorithm, the available n observations are divided into B (B &le; n) blocks and the E-step is implemented for only a block of observations at a time before the next M-step is performed. With the sparse version of the EM algorithm for the fitting of mixture models, only those posterior probabilities of component membership of the mixture that are above a specified threshold are updated&semi; the remaining component-posterior probabilities are held fixed. In this paper, simulations are performed to assess the relative performances of the IEM algorithm with various number of blocks and the standard EM algorithm. In particular, we propose a simple rule for choosing the number of blocks with the IEM algorithm. For the IEM algorithm in the extreme case of one observation per block, we provide efficient updating formulas, which avoid the direct calculation of the inverses and determinants of the component-covariance matrices. Moreover, a sparse version of the IEM algorithm (SPIEM) is formulated by combining the sparse E-step of the EM algorithm and the partial E-step of the IEM algorithm. This SPIEM algorithm can further reduce the computation time of the IEM algorithm.
Software: The Good, the Bad, and the Real
Authors: Steve Andriole
Venue: IEEE Software (1998)

I found Ed Yourdon's essay fascinating in both form and content. The content agrees with something I have known for several years now: that the best of times would eventually trigger the worst of times. But the form is even more engaging because of Ed's underlying premise: that overall our technology is far from invincible and might ultimately undermine our efforts to produce that which best serves our users. That we would even consider this possible amazes me. The use of software to solve problems has been evolutionary and was, initially, almost completely driven by technology. At first, we were limited to what could be done with the early architectures, so we defined and redefined problems around those constraints. As the technology matured, the range of problems to which it could be applied grew. The technology is still evolving-at an incredible pace-and still doing so in a disconnected way. Chip, database, and communications technologies, for example, are evolving as mutually reinforcing knowledge masses in search of business problems to solve. This isn't all bad. Engines for change are ubiquitous and not always connected to the problems they will eventually tackle, but history does suggest that our early expectations about the problem-solving potential of unbridled technology should be relatively low.
The Interior-Point Method for Linear Programming
Authors: Greg Astfalk, Irvin Lustig, Roy Marsten, David Shanno
Venue: IEEE Software (1992)

A robust, reliable, and efficient implementation of the primal-dual interior-point method for linear programs, which is based on three well-established optimization algorithms, is presented. The authors discuss the theoretical foundation for interior-point methods which consists of three crucial building blocks: Newton's method for solving nonlinear equations, Joseph Lagrange's methods for optimization with equality constraints, and Fiacco and McCormick's barrier method for optimization with inequality constraints. The construction of the primal-dual interior-point method using these methods is described. An implementation of the primal-dual interior-point method, its performance, and a comparison to other interior-point methods are also presented.
Cluster Analysis of the Realizations of Autoregression Time Series
Authors: E. E. Zhuk
Venue: Automation and Remote Control (2003)

Consideration was given to the problem of cluster analysis of observations which are realizations of the autoregression time series that are classified according to the unknown values of the autoregression parameters (coefficients). To solve the problem of classification, constructed were a procedure of cluster analysis in the space of realizations and a cluster procedure in the space of maximum likelihood estimates of the autoregression parameters. Efficiency of the proposed cluster procedures was studied both analytically and experimentally.
The Performance of Protocols Based on Locks with Ordered Sharing
Authors: D. Agrawal, A. El Abbadi, A. E. Lang
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

There is growing evidence that for a wide variety of database workloads and system configurations, locking-based concurrency control outperforms other types of concurrency control strategies. However, in the presence of increased data contention, locking protocols such as two-phase locking perform poorly. In this paper, we analyze a family of locking-based protocols that employ a new relationship between locks called ordered sharing. Using a centralized database simulation model, we demonstrate that these protocols exhibit comparable performance to that of traditional locking-based protocols when data contention is low, and they exhibit superior performance when data contention is high. Furthermore, we show that the performance of these protocols improves as resources become more plentiful. This is particularly significant because the performance of two-phase locking degrades as a result of data contention, not resource contention. Thus, introducing additional resources improves the performance of the proposed protocols, though it does not benefit two-phase locking significantly.
Improvement on Higher-Order Neural Networks for Invariant Object Recognition
Authors: Zhengquan He, M. Y. Siyal
Venue: Neural Processing Letters (1999)

The higher order neural network(HONN) was proved to be able to realize invariant object recognition. By taking the relationship between input units into account, HONN&lsquo;s are superior to other neural models in invariant pattern recognition. However, there are two main problems preventing HONN&lsquo;s from practical applications. One is the combinatorial increase of weight number, that is, as input size increases, the number of weights in a HONN increases exponentially. The other problem is sensitivity to distortion and noise. In this paper, we described a method, in which by modifying the constraints imposed on the weights in HONN&lsquo;s, the performance of a HONN with respect to distortion can be improved considerably.
Net Scheduling in High-Level Synthesis
Authors: Anatoly Prihozhy
Venue: IEEE Design Test (1996)

A schedule for a sequential finite-state machine defines a distribution of statements on control steps taking into account constraints on time and resources. A net schedule defines both a partial precedence and concurrent execution of the statements under the same constraints. The author introduces a new net scheduling and allocation model, method, and techniques that permit generation of net schedules minimizing either the execution time or resources. The net schedule is a source to synthesize a sequential schedule with chaining, multicycling, and pipelining, or to structure synthesis directly. Experimental results show the net schedule execution time to be more than 20% less than the sequential schedule execution time in the case of variable execution time of statements. The theoretical results are used in VHDL-based high-level synthesis AHILES system.
A VHDL Fault Diagnosis Tool Using Functional Fault Models
Authors: Vijay Pitchumani, Pankaj Mayor, Nimish Radia
Venue: IEEE Design Test (1992)

The development and implementation of an algorithm that forms the basis of a very-high-speed integrated circuit hardware description language (VHDL) fault diagnosis tool (VFDT) are discussed. Given a VHDL description, a compiler creates an internal representation suitable for simulation and fault diagnosis. VFDT diagnoses faults in this representation hierarchically using the stuck-at fault model at the first level and the arbitrary-failure model at the second level. It reasons from first principles by means of constraint suspension. Examples of fault diagnosis using the VFDT are described.
High-Speed Microprogrammable Asynchronous Controller Modules
Authors: R. F. Tinder, R. I. Klaus, J. A. Snodderley
Venue: IEEE Transactions on Computers (1994)

A unique family of high-speed, microprogrammable asynchronous controller (MAC) modules is described in this correspondence. Each MAC module consists of two fundamental mode machines that communicate by means of a handshake interface that permits it to be driven by any programmable logic device including ROM's. Any state machine controller designed with a MAC module will operate free of critical races, essential hazards and output race glitches, and will have static hazard-free state variables. A multiplicity of programmable logic devices can be used to drive one or more MAC modules to achieve complex, but reliable, asynchronous, time-shared and/or parallel processing of data. Individual MAC modules having state variables numbering l,m,n,...can be cascaded to produce an available system state capacity of 2/sup lspl times/2/sup mspl times/2/sup nspl times/...states with up to (l+m+n+...)-way transition capability, all without compromising speed or reliability.
Image Compression by Layered Quantum Neural Networks
Authors: Noriaki Kouda, Nobuyuki Matsui, Haruhiko Nishimura
Venue: Neural Processing Letters (2002)

We have proposed the qubit neuron model as a new scheme in non-standard computing. Identification problems have been investigated on neural networks constructed by this qubit neuron model, and we have found high processing abilities of them. In this paper, we evaluate the performance of the quantum neural network of large size in image compression problems to estimate the utility for the practical applications comparing with the conventional network consists of formal neuron model.
Variability
Authors: Andrew B. Kahng
Venue: IEEE Design Test (2002)

IC manufacturing variability is critical to the design-manufacturing interface, which,along with productivity, power, interference, and error tolerance,ranks as a key cross-cutting challenge in the design technology roadmap.