ppxscal/embedding_network huggingface dataset:
A Constructive Approach to Calculating Lower Entropy Bounds
Authors: Valeriu Beiu, Sorin Draghici, Thiery De Pauw
Venue: Neural Processing Letters (1999)

This paper presents a constructive approach to estimating the size of a neural network necessary to solve a given classification problem. The results are derived using an information entropy approach in the context of limited precision integer weights. Such weights are particularly suited for hardware implementations since the area they occupy is limited, and the computations performed with them can be efficiently implemented in hardware. The considerations presented use an information entropy perspective and calculate lower bounds on the number of bits needed in order to solve a given classification problem. These bounds are obtained by approximating the classification hypervolumes with the volumes of several regular (i.e., highly symmetric) n-dimensional bodies. The bounds given here allow the user to choose the appropriate size of a neural network such that: (i) the given classification problem can be solved, and (ii) the network architecture is not oversized. All considerations presented take into account the restrictive case of limited precision integer weights, and therefore can be directly applied when designing VLSI implementations of neural networks.
Simulation-Based Optimization with Stochastic Approximation Using Common Random Numbers
Authors: Nathan L. Kleinman, James C. Spall, Daniel Q. Naiman
Venue: Management Science (1999)

The method of Common Random Numbers is a technique used to reduce the variance of difference estimates in simulation optimization problems. These differences are commonly used to estimate gradients of objective functions as part of the process of determining optimal values for parameters of a simulated system. Asymptotic results exist which show that using the Common Random Numbers method in the iterative Finite Difference Stochastic Approximation optimization algorithm (FDSA) can increase the optimal rate of convergence of the algorithm from the typical rate of k-1/3 to the faster k-1/2, where k is the algorithm's iteration number. Simultaneous Perturbation Stochastic Approximation (SPSA) is a newer and often much more efficient optimization algorithm, and we will show that this algorithm, too, converges faster when the Common Random Numbers method is used. We will also provide multivariate asymptotic covariance matrices for both the SPSA and FDSA errors.
On the Optimality of the Discrete Karhunen--Loève Expansion
Authors: Arne Dür
Venue: SIAM Journal on Control and Optimization (1998)

A short proof of the optimality of the discrete Karhunen--Loève expansion as the best linear approximation in the quadratic mean is presented.
A note on the complexity of propositional Hoare logic
Authors: Ernie Cohen, Dexter Kozen
Venue: ACM Transactions on Computational Logic (TOCL) (2000)

We provide a simpler alternative proof of the PSPACE-hardness of propositional Hoare logic (PHL).
Multigrid Solution of an Elliptic Boundary-Value Problem with Integral Constraints
Authors: Achi Brandt, Moshe Israeli, Irad Yavneh, Andrew Siegel
Venue: SIAM Journal on Scientific Computing (1999)

An efficient multigrid approach for solving a discretized elliptic equation whose boundary values are determined in part by integral relations is developed, analyzed, and tested. The algorithm is motivated by a problem that is solved during integration of the 3D quasigeostrophic (QG) equations, which model large-scale rotating stratified flows, where the integral constraints represent mass conservation.
A hardware mechanism for dynamic extraction and relayout of program hot spots
Authors: Matthew C. Merten, Andrew R. Trick, Erik M. Nystrom, Ronald D. Barnes, Wen-mei W. Hmu
Venue: ACM SIGARCH Computer Architecture News (2000)

This paper presents a new mechanism for collecting and deploying runtime optimized code. The code-collecting component resides in the instruction retirement stage and lays out hot execution paths to improve instruction fetch rate as well as enable further code optimization. The code deployment component uses an extension to the Branch Target Buffer to migrate execution into the new code without modifying the original code. No significant delay is added to the total execution of the program due to these components. The code collection scheme enables safe runtime optimization along paths that span function boundaries. This technique provides a better platform for runtime optimization than trace caches, because the traces are longer and persist in main memory across context switches. Additionally, these traces are not as susceptible to transient behavior because they are restricted to frequently executed code. Empirical results show that on average this mechanism can achieve better instruction fetch rates using only 12KB of hardware than a trace cache requiring 15KB of hardware, while producing long, persistent traces more suited to optimization.
Body-voltage estimation in digital PD-SOI circuits and its application to static timing analysis
Authors: Kenneth L. Shepard, Dae-Jin Kim
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

We describe a technique for estimating the floating body potentials of partially-depleted silicon-on-insulator (PD-SOI) circuits under steady switching activity and under initial activity after a long period of quiescence. The approach is based on a unique state diagram abstraction of the PD-SOI FET that captures all of the essential device physics. This picture yields a simple analytic model of the body voltage which is used within the context of a prototype transistor-level static timing analysis engine. Results are presented that demonstrate the accuracy of the analytic body-voltage model and the reduction in delay uncertainty possible with this technique.
Memory architecture for efficient utilization of SDRAM: a case study of the computation/memory access trade-off
Authors: Thomas Gleerup, Hans Holten-Lund, Jan Madsen, Steen Pedersen
Venue: Proceedings of the eighth international workshop on Hardware/software codesign (2000)

This paper discusses the trade-off between calculations and memory accesses in a 3D graphics tile renderer for visualization of data from medical scanners. The performance requirement of this application is a frame rate of 25 frames per second when rendering 3D models with 2 million triangles, i.e. 50 million triangles per second, sustained (not peak). At present, a software implementation is capable of 3-4 frames per second for a 1 million triangle model.By using direct evaluation of certain interpolation parameters instead of forward differencing, writing back parameters to SDRAM is avoided. In software, forward differencing is usually better, but in this hardware implementation, the trade-off has made it possible to develop a very regular memory architecture with a buffering system, which can reach 95% bandwidth utilization using off-the-shelf SDRAM. This is achieved by changing the algorithm to use a memory access strategy with write-only and read-only phases, and a buffering system, which uses round-robin bank write-access combined with burst read-access.
Enticing online consumers: a technology acceptance perspective research-in-progress
Authors: Lei-da Chen
Venue: Proceedings of the 2000 ACM SIGCPR conference on Computer personnel research (2000)

Business-to-consumer aspect of electronic commerce (EC) is the most visible business use of the World Wide Web (WWW). A virtual store, simply stated, is &ldquo;a storefront in cyberspace, a place where customers can shop from their home computers and where merchants can offer merchandise and services for a fraction of the overhead required in a physical storefront&rdquo; [33]. It allows companies to offer direct sales to their customers through an electronic channel [17]. The fundamental problem motivating this research study is that in order for a virtual store to compete effectively with both physical stores and other online retailers, there is an urgent need to understand the factors that entice consumers to use a virtual store. This research aims to provide both theoretical and empirical analysis to explain consumers' use of a virtual store and its antecedents. By applying the Theory of Reasoned Action (TRA) and Technology Acceptance Model (TAM), this research takes a technology acceptance perspective to examine consumer behavior in virtual store context. The data from a survey of online consumers are used to empirically test the proposed research model. Confirmatory factor analysis (CFA) is performed to examine the reliability and validity of the measurement model, and structure equation modeling (SEM) technique is used to evaluate the causal model. The implication of the research model to both researchers and practitioners is also discussed.
General and Efficient Multisplitting of Numerical Attributes
Authors: Tapio Elomaa, Juho Rousu
Venue: Machine Learning (1999)

Often in supervised learning numerical attributes require special treatment and do not fit the learning scheme as well as one could hope. Nevertheless, they are common in practical tasks and, therefore, need to be taken into account. We characterize the well-behavedness of an evaluation function, a property that guarantees the optimal multi-partition of an arbitrary numerical domain to be defined on boundary points. Well-behavedness reduces the number of candidate cut points that need to be examined in multisplitting numerical attributes. Many commonly used attribute evaluation functions possess this property&semi; we demonstrate that the cumulative functions Information Gain and Training Set Error as well as the non-cumulative functions Gain Ratio and Normalized Distance Measure are all well-behaved. We also devise a method of finding optimal multisplits efficiently by examining the minimum number of boundary point combinations that is required to produce partitions which are optimal with respect to a cumulative and well-behaved evaluation function. Our empirical experiments validate the utility of optimal multisplitting: it produces constantly better partitions than alternative approaches do and it only requires comparable time. In top-down induction of decision trees the choice of evaluation function has a more decisive effect on the result than the choice of partitioning strategy&semi; optimizing the value of most common attribute evaluation functions does not raise the accuracy of the produced decision trees. In our tests the construction time using optimal multisplitting was, on the average, twice that required by greedy multisplitting, which in its part required on the average twice the time of binary splitting.
Producing more reliable software: mature software engineering process vs. state-of-the-art technology?
Authors: James C. Widmaier
Venue: Proceedings of the 22nd international conference on Software engineering (2000)

A customer of high assurance software recently sponsored a software engineering experiment in which a real-time software system was developed concurrently by two popular software development methodologies. One company specialized in the state-of-the-practice waterfall method rated at a Capability Maturity Model Level 4. A second developer employed his mathematically based formal method with automatic code generation. As specified in separate contracts, C++ code plus development documentation and process and product metrics (errors) were to be delivered. Both companies were given identical functional specs and agreed to a generous and equal cost, schedule, and explicit functional reliability objectives. At conclusion of the experiment an independent third party determined through extensive statistical testing that neither methodology was able to meet the user's reliability objectives within cost and schedule constraints. The metrics collected revealed the strengths and weaknesses of each methodology and why they were not able to reach customer reliability objectives. This paper will explore the specification for the system under development, the two competing development processes, the products and metrics captured during development, the analysis tools and testing techniques by the third party, and the results of a reliability and process analysis.
Graphic Java 1.2 (3rd ed.)
Authors: David M. Geary
Venue:  (1998)

Graphic Java 2 is the most comprehensive guide to the Java Foundation Classes (JFC) available. Three volumes cover all aspects of the JFC providing java developers with the skills needed to build professional, cross platform applications that take full advantage of the Java Foundation Classes.The AWT is the cornerstone of the Java Foundation Classes. Volume 1 provides detailed descriptions of every aspect of the AWT, including: Event Handling Layout Managers Graphics, Colors & Fonts Image Manipulation Lightweight Components Data Transfer & Drag and Drop Double Buffering Sprite AnimationJava expert David Geary provides clear and in-depth explanations of both fundamental and advanced AWT concepts. The layout manager chapter, for example, is over 100 pages long and includes what readers have called the best explanation of GridBagLayout on the planet. A GridBagLab application on the CD lets you explore GridBagLayout on your own.The accompanying CD-ROM includes all of the example code from the book, ready to run on Solaris(tm), Windows 95, Windows NT, and Macintosh along with the JDK(tm) for those platforms.
On Quadratic Differential Forms
Authors: J. C. Willems, H. L. Trentelman
Venue: SIAM Journal on Control and Optimization (1998)

This paper develops a theory around the notion of quadratic differential forms in the context of linear differential systems. In many applications, we need to not only understand the behavior of the system variables but also the behavior of certain functionals of these variables. The obvious cases where such functionals are important are in Lyapunov theory and in LQ and $H_{\infty}$ optimal control. With some exceptions, these theories have almost invariably concentrated on first order models and state representations. In this paper, we develop a theory for linear time-invariant differential systems and quadratic functionals. We argue that in the context of systems described by one-variable polynomial matrices, the appropriate tool to express quadratic functionals of the system variables are two-variable polynomial matrices. The main achievement of this paper is a description of the interaction of one- and two-variable polynomial matrices for the analysis of functionals and for the application of higher order Lyapunov functionals.
SCR algorithm: saving/restoring states of file systems
Authors: Wei Xiao-Hui, Ju Jiu-Bin
Venue: ACM SIGOPS Operating Systems Review (1999)

Fault-tolerance is very important in cluster computing. Many famous cluster-computing systems have implemented fault-tolerance by using checkpoint/restart mechanism. But existent checkpointing algorithms can not restore the states of a file system when roll-backing the running of a program, so there are many restrictions on file accesses in existent fault-tolerance systems. SCR algorithm, an algorithm based on atomic operation and consistent schedule, which can restore the states of file systems, is present in this paper. In SCR algorithm, system calls on file sytems are classified into idempotent operations and non-idempotent operations. A non-idempotent operation modifies a file system's states, and an idempotent operation does not. SCR algorithm dynamically follows the tracks of a program's running, logs each non-idempotent operation used by the program and the information that can restore the operation in disks. When checkpointing roll-backing the program, SCR algorithm will revert the file system states to the last checkpoint time. By using SCR algorithm, users are allowed to use any file operation in their programs.
An efficient method for hot-spot identification in ULSI circuits
Authors: Yi-Kan Cheng, Sung-Mo Kang
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

In this paper, we present a method to efficiently identify the onchip hot spots in ULSI circuits. A set of mathematical formulae were derived in analytical forms so that local temperature information can be fetched quickly. These formulae were based on the Green's function and error function approximation, and the resulting equations were further simplified to a tractable level by asserting different constraints. Experimental result shows that this method is able to accurately locate the hot spots with little time complexity. It is particularly useful for temperature-driven circuit macro placement in early chip design phase, for which a large number of design iterations is needed and simulation efficiency is much required.
Tangible interaction + graphical interpretation: a new approach to 3D modeling
Authors: David Anderson, James L. Frankel, Joe Marks, Aseem Agarwala, Paul Beardsley, Jessica Hodgins, Darren Leigh, Kathy Ryall, Eddie Sullivan, Jonathan S. Yedidia
Venue: Proceedings of the 27th annual conference on Computer graphics and interactive techniques (2000)

Construction toys are a superb medium for geometric models. We argue that such toys, suitably instrumented or sensed, could be the inspiration for a new generation of easy-to-use, tangible modeling systems&mdash;especially if the tangible modeling is combined with graphical-interpretation techniques for enhancing nascent models automatically. The three key technologies needed to realize this idea are embedded computation, vision-based acquisition, and graphical interpretation. We sample these technologies in the context of two novel modeling systems: physical building blocks that self-describe, interpret, and decorate the structures into which they are assembled; and a system for scanning, interpreting, and animating clay figures.
Low-power sensing and digitization of cardiac signals based on sigma-delta conversion (poster session)
Authors: Andrea Gerosa, Arianna Novo, Andrea Neviani
Venue: Proceedings of the 2000 international symposium on Low power electronics and design (2000)

In this work we propose an architecture for the acquisition and digitization of cardiac signals in a pace-maker, based on &Sgr;&Dgr; modulation. Due to the characteristics of such an application, the proposed system presents the typical design challenges of low-voltage, low-power circuits. The work demonstrates that, thanks to the narrow bandwidth typical of biological signals (50-150 Hz), oversampling conversion techniques can be advantageous in terms of power dissipation at a given dynamic range. The converter is designed in a 0.8 &mgr;m CMOS technology using the switched Op-Amp technique. The &Sgr;&Dgr; converter is a third order modulator with an oversampled frequency of about 8KHz and the circuitcan operate at a minimum supply voltage of 2 V, while dissipating 2 &mgr;W at most. According to simulation results the dynamic range is larger than 50 dB.
The Two-Point Correlation Function: A Measure of Interclass Separability
Authors: N. Fatemi-Ghomi, P. L. Palmer, M. Petrou
Venue: Journal of Mathematical Imaging and Vision (1999)

In this paper we introduce the two-point correlation function as a measure of interclass separability. We present a theoretical study of this statistic in a general M-dimensional feature space and propose a fast algorithm for the efficient computation of it. We test the algorithm and illustrate the properties of the statistic using test data in 1D and 2D feature spaces and discuss the boundary effects of the feature space. We also present a discussion of the limitations of the proposed statistic and apply it to the assessment of inter-class separability in a texture segmentation context.
An Iterative Scheme for Dense, Complex-Symmetric, Linear Systems in Acoustics Boundary-Element Computations
Authors: Ramesh Natarajan
Venue: SIAM Journal on Scientific Computing (1998)

We consider the indirect, variational, boundary-integral formulation for the Helmholtz equation in acoustics applications. This formulation leads after discretization to a dense, complex-symmetric system of linear equations, which are typically solved by direct elimination methods (using the Bunch--Kaufman pivoting strategy for matrices in the symmetric packed-storage format, as implemented in the LAPACK library [Anderson et al., LAPACK Users' Guide, SIAM, Philadelphia, 1995]). In this paper, we describe an iterative solution procedure, which uses an adaptation of the orthogonal factorization method (Gill and Murray [in Numerical Methods for Constrained Optimization, Academic Press, New York, 1974, pp. 29--65]) in conjunction with the QMR iteration (Freund [SIAM J. Sci. Statist. Comput., 13 (1992), pp. 425--448]). This iterative procedure, which achieves rapid convergence by exploiting the structure of the matrix generated by the discretization, is competitive with the LAPACK direct elimination approach for small but difficult industrial applications on which it has been tested so far, and for larger problems the iterative procedure is expected to provide significant advantages in terms of robustness, computational cost, and parallelizability.
Enter the usability engineer: integrating HCI and software engineering
Authors: Xristine Faulkner, Fintan Culwin
Venue: Proceedings of the 5th annual SIGCSE/SIGCUE ITiCSEconference on Innovation and technology in computer science education (2000)

This paper examines the role of Human Computer Interaction in the context of the Computer Science and Software Engineering curricula. We suggest there needs to be much more integration between Computer Science and HCI. We believe this can be brought about by adopting HCI as the underlying principle to the development of systems. Usability engineering would provide the necessary framework for the development of usable systems.
Network time slot allocation in an intelligent network
Authors: Anna Hać
Venue: International Journal of Network Management (1998)

The research area of telecommunications networks and services is rapidly growing, as new technologies emerge. This article proposes a design for a Time Multiplexed Switch that allocates network time slots in a telecommunications architecture. &copy; 1998 John Wiley & Sons, Ltd.
Implementing national educational technology standards for student in the United States
Authors: Harriet G. Taylor
Venue: Proceedings of the 4th annual SIGCSE/SIGCUE ITiCSE conference on Innovation and technology in computer science education (1999)

A consortium of leading educational professional organizations in the United States, led by the International Society for Technology in Education has developed a set of National Educational Technology Standards (NETS) for students. The NETS standards describe what all students should know about and be able to do with technology. They are divided into six categories [1]: Basic operations and concepts; Social, ethical, and human issues; Technology productivity tools; Technology communication tools; Technology research tools; and Technology problem-solving and decision-making tools.The NETS standards also include performance indicators at each of four major target grade ranges, PK-2, 3-5, 6-8, 9-12. NETS standards describe fundamental technology competencies to be developed through meaningful learning experiences integrated throughout the PreK-12 curriculum. They provide realistic benchmarks for achievement. They also provide a continuum of technology skills that can be achieved through a curriculum that reinforces high level learning and problem solving strategies in which technology tools play a major role.