ppxscal/embedding_network huggingface dataset:
A low-power adder operating on effective dynamic data ranges
Authors: Oscal T.-C. Chen, Robin Ruey-Bin Sheen, Sandy Wang
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2002)

To design a power-efficient digital signal processor, this study develops a fundamental arithmetic unit of a low-power adder that operates on effective dynamic data ranges. Before performing an addition operation, the effective dynamic ranges of two input data are determined. Based on a larger effective dynamic range, only selected functional blocks of the adder are activated to generate the desired result while the input bits of the unused functional blocks remain in their previous states. The added result is then recovered to match the required word length. Using this approach to reduce switching operations of noneffective bits allows input data in 2's complement and sign magnitude representations to have similar switching activities. This investigation thus proposes a 2's complement adder with two master-stage and slave-stage flip-flops, a dynamic-range determination unit and a sign-extension unit, owing to the easy implementation of addition and subtraction in such a system. Furthermore, this adder has a minimum number of transistors addressed by carry-in bits and thus is designed to reduce the power consumption of its unused functional blocks. The dynamic range and sign-extension units are explored in detail to minimize their circuit area and power consumption. Experimental results demonstrate that the proposed 32-bit adder can reduce power dissipation of conventional low-power adders for practical multimedia applications. Besides the ripple adder, the proposed approach can be utilized in other adder cells, such as carry lookahead and carry-select adders, to compromise complexity, speed and power consumption for application-specific integrated circuits and digital signal processors.
Framework for evaluating application adaptivity
Authors: Marika Tähti
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

In the future, ubiquitous applications, services and environments will need adaptivity and context awareness in order to adapt to their users' requirements and needs. Before these kinds of applications can be developed, we need to know when adaptivity is at an adequate level. This article introduces a framework (dimensions and degrees) for evaluating application adaptivity, showing how it can be used when evaluating commercial applications.
Integrating ethical issues into the undergraduate computer science curriculum
Authors: Ahmad Ghafarian
Venue: Journal of Computing Sciences in Colleges (2002)

The ACM Curricula 2001 has listed "computer science ethics" as one of the bodies of knowledge in the undergraduate degree in computer science education. However, it is up to the individual institutions on how to implement it. Traditionally, many schools including my school offer one or two courses in computer ethics in their curriculum. Very little has been reported on the outcome of this approach. Other schools incorporate ethical issues in undergraduate computer science education by adding ethical elements to each course. Yet another approach is to have a combination of both, to integrate ethics into one or two lower level courses and to have a capstone course in ethics. We present a fourth approach to integrate ethical issues into computer science education. This approach is derived from a workshop at Purdue University in October 2001 and is based on case-based instruction in which the instructor either creates case studies that involve ethics or uses existing case studies in appropriate courses. Students are asked to read the case studies and answer the questions that have been prepared by the author of the case study. We believe using this approach will make students more involved in ethical issues. A summary of the workshop objectives related to this paper is also presented.
Fuzzy temporal rules: a rule-based approach for fuzzy temporal knowledge representation and reasoning
Authors: Purificación Cariñena, Alberto Bugarín, Manuel Mucientes, Félix Díaz-Hermida, Senén Barro
Venue: Technologies for constructing intelligent systems: tools (2002)

In this paper a model for the representation and execution of a type of fuzzy control rules that explicitly handle time variable (Fuzzy Temporal Rules) is presented. The model here described permits using temporal references for the occurrence of events. These references are allowed to be described either in an absolute manner or related to occurrence of other events. A complete grammar that formally describes the representation language of the model is presented, together with its semantic counterpart. This knowledge and reasoning representation model is illustrated by means of a number of examples that show the substantial increase in the expresiveness that FTRs exhibit when compared to usual fuzzy control rules.
Resynthesis of multi-level circuits under tight constraints using symbolic optimization
Authors: Victor N. Kravets, Karem A. Sakallah
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

We apply recently introduced constructive multi-level synthesis in the resynthesis loop targeting convergence of industrial designs. The incremental ability of the resynthesis approach allows more predictable circuit implementations while allowing their aggressive optimization. The approach is based on a very general symbolic decomposition template for logic synthesis that uses information-theoretical properties of a function to infer its decomposition patterns (rather than more conventional measures such as literal counts). Using this template the decomposition is done in a Boolean domain unrestricted by the representation of a function, enabling superior implementation choices driven by additional technological constraints. The symbolic optimization is applied in resynthesis of industrial circuits which have tight timing constraints yielding their much improved timing properties.
Campus tour scheduler
Authors: Sarah Davis
Venue: Journal of Computing Sciences in Colleges (2003)

The Campus Tour Scheduler is an application developed for use by the Admissions Office of Millsaps College. It was designed to assist in the tedious process of scheduling campus tour guides with visiting prospective students. The application not only schedules but also matches tour guides and visitors based on a variety of characteristics such as hometown, intended major, activities and high school.
A technology-independent CAD tool for ESD protection device extraction: ESDExtractor
Authors: R. Y. Zhan, H. G. Feng, Q. Wu, G. Chen, X. K. Guan, Albert. Z. Wang
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

The challenges for developing an ESD (Electro-static Discharge) layout extractor originate from unconventional layout patterns of ESD protection devices, parasitic ESD device extraction and device count reduction. This paper reports a new technology-independent layout extractor, ESDExtractor, which is capable of extracting all types of ESD devices and answers the demands for ESD design verification. General methodology to extract both intentional and parasitic ESD devices, specific algorithms and implementation methods for efficiencyenhancement are presented, followed by a design example.
Too Much of a Good Thing?
Authors: Dana R. Clyman, Michael R. Walls, James S. Dyer
Venue: Operations Research (1999)

This paper explores a seemingly paradoxical phenomenon associated with the use of expected-utility theory in capital-budgeting and risk-sharing decisions under uncertainity. As an investment prospect becomes better and better, decision makers using classic decision-analysis techniques may, in fact, prefer less and less of it. We explore this phenomenon in the very real context of petroleum company drilling-investment decisions and demonstrate that the phenomenon is pervasive. When we examined the prospect inventory of a major oil company, we found that an increase in the upside payoff would lead to a lower optimal working interest for the grand majority of its prospects. We also explore the underlying factors leading to this phenomenon to develop both intuition and understanding. These factors have to do with degree of risk aversion (the more risk averse you are, the less likely you are to increase your holdings of an improving prospect) and managerial perspectives on risk. Once understood, the results no longer seem surprising.
Efficient Portfolios, Sparse Matrices, and Entities: A Retrospective
Authors: Harry M. Markowitz
Venue: Operations Research (2002)

In 1989 I was pleased and honored to be awarded the ORSA/TIMS (now INFORMS) John von Neumann Theory Prize for my work in portfolio theory, sparse matrices, and SIMSCRIPT. The following is a retrospective on my work in these fields.
An existence and uniqueness result for periodic solution of 2n-order differential equations
Authors: Xiaojing Yang
Venue: Applied Mathematics and Computation (2003)

In this paper, we are concerned with the existence and uniqueness of solution to the 2n-order differential equation (-1)n-1x(2n) + f(t,x,x'', .... x2(n-1)) = 0 with periodic boundary condition x(i)(0) = x(i)(2π), i = 0, 1,...,2n - 1. By using the initial value problem method, we transform the periodic boundary value problem into a problem of finding fixed point of continuous mapping.
Is the information systems profession gendered?: characterization of IS professionals and IS careers
Authors: Kshiti "K.D" Joshi, Nancy L. Schmidt, Kristine M. Kuhn
Venue: Proceedings of the 2003 SIGMIS conference on Computer personnel research: Freedom in Philadelphia--leveraging differences and diversity in the IT workforce (2003)

In spite of a more "feminine" nature of the IS disciplinedue to its greater perceived social component, stereotypes and educational prejudices that are prevalent in the computerscience discipline are assumed to exist in the information systems field. The objective of this study was to test the validity of this assumption by uncovering the perceptions of potential IS professionals, i.e., college students, toward IS professionals and the IS profession. Our study reveals that stereotypes found to be associated with computer science also seem to permeate the IS field. These stereotypic images do not fade away even after the students are more informed about IS careers. However, it does not fully support the assumption that women believe the field of information systems is identical to computer science. When describing an IS professional and the IS profession, women were cognizant about the unique nature of the IS field, i.e., the IS profession is a blend of technical, systems, social, and managerial components.
An Orthogonal Transformation Algorithm for GPS Positioning
Authors: Xiao-Wen Chang, Christopher C. Paige
Venue: SIAM Journal on Scientific Computing (2002)

The Global Positioning System (GPS) is a satellite based navigation system. GPS satellites transmit signals that allow one to determine the location of GPS receivers. In GPS, a typical technique for kinematic position estimation is differential positioning where two receivers are used: one receiver is stationary and its exact position is known, and the other is roving and its position is to be estimated. We describe the physical situation and derive the mathematical model based on the difference of the so-called carrier phase measurements at the stationary and roving receivers. We then present a recursive least squares approach for position estimation. We take full account of the structure of the problem to make our algorithm efficient, and use orthogonal transformations to ensure numerical reliability of the algorithm. Simulation results are presented to demonstrate the performance of the algorithm. A comparison with the van Graas and Lee positioning algorithm [Navigation, Journal of the Institute of Navigation, 42 (1995), pp. 605--618] is given. Our algorithm is seen to be both efficient and accurate, but an additional contribution of this approach is that some of the drawbacks of double differencing are avoided, and yet the vector of double differenced integer ambiguities is still available and can be used to fix the integer ambiguities and handle satellite rising and setting.
14.9 TFLOPS three-dimensional fluid simulation for fusion science with HPF on the Earth Simulator
Authors: Hitoshi Sakagami, Hitoshi Murai, Yoshiki Seo, Mitsuo Yokokawa
Venue: Proceedings of the 2002 ACM/IEEE conference on Supercomputing (2002)

We succeeded in getting 14.9 TFLOPS performance when running a plasma simulation code IMPACT-3D parallelized with High Performance Fortran on 512 nodes of the Earth Simulator. The theoretical peak performance of the 512 nodes is 32 TFLOPS, which means 45% of the peak performance was obtained with HPF. IMPACT-3D is an implosion analysis code using TVD scheme, which performs three-dimensional compressible and inviscid Eulerian fluid computation with the explicit 5-point stencil scheme for spatial differentiation and the fractional time step for time integration. The mesh size is 2048x2048x4096, and the third dimension was distributed for the parallelization. The HPF system used in the evaluation is HPF/ES, developed for the Earth Simulator by enhancing NEC HPF/SX V2 mainly in communication scalability. Shift communications were manually tuned to get best performance by using HPF/JA extensions, which was designed to give the users more control over sophisticated parallelization and communication optimizations.
Analyzing software science data with partial repeatability
Authors: Kai-Yuan Cai, Lei Chen
Venue: Journal of Systems and Software (2002)

Halstead's software science postulates that there exist physics-like laws that obey each piece of software. In this paper we reexamine this postulate by using two datasets collected from real programs, and argue that software science data are featured with partial repeatability. Conventional sciences embody the nature of full repeatability in the sense that they can either be proved repeatably in mathematics or be validated to a high accuracy repeatably in physics (experimentally). By partial repeatability we mean that complex phenomena may demonstrate an invariant property that neither can be proved in mathematics nor validated to a high accuracy in physics, but still (partially) governs the behavior of the phenomena. We propose a new kind of mathematical model, namely, parepeatic model, to characterize partial repeatability quantitatively. A parepeatic model defines the relationship between a central function and a fluctuation zone and identifies the degree of correctness of the relationship without making any statistical assumption. We develop parepeatic models for the relationships among several program complexity measures including the number of distinct operators, the number of distinct operands and the program length, among others, and present some new findings about the relationships. Illustrative case study shows that the developed parepeatic models can really help software engineering practice.
Assessing a Firm's Web Presence: A Heuristic Evaluation Procedure for the Measurement of Usability
Authors: Ritu Agarwal, Viswanath Venkatesh
Venue: Information Systems Research (2002)

Web site usability is a critical metric for assessing the quality of a firm's Web presence. A measure of usability must not only provide a global rating for a specific Web site, ideally it should also illuminate specific strengths and weaknesses associated with site design. In this paper, we describe a heuristic evaluation procedure for examining the usability of Web sites. The procedure utilizes a comprehensive set of usability guidelines developed by Microsoft.We present the categories and subcategories comprising these guidelines, and discuss the development of an instrument that operationalizes the measurement of usability. The proposed instrument was tested in a heuristic evaluation study where 1,475 users rated multiple Web sites from four different industry sectors: airlines, online bookstores, automobile manufacturers, and car rental agencies. To enhance the external validity of the study, users were asked to assume the role of a consumer or an investor when assessing usability. Empirical results suggest that the evaluation procedure, the instrument, as well as the usability metric exhibit good properties. Implications of the findings for researchers, for Web site designers, and for heuristic evaluation methods in usability testing are offered.
Efficient user interest estimation in fisheye views
Authors: Jeffrey Heer, Stuart K. Card
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

We present a new technique for efficiently computing Degree-of-Interest distributions to inform the visualization of graph-structured data. The technique is independent of the interest distribution used and enables fluid interaction with very large data sets (over 100,000 nodes).
Speeding up construction of PMR quadtree-based spatial indexes
Authors: Gisli R. Hjaltason, Hanan Samet
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2002)

Spatial indexes, such as those based on the quadtree, are important in spatial databases for efficient execution of queries involving spatial constraints, especially when the queries involve spatial joins. In this paper we present a number of techniques for speeding up the construction of quadtree-based spatial indexes, specifically the PMR quadtree, which can index arbitrary spatial data. We assume a quadtree implementation using the &ldquo;linear quadtree&rdquo;, a disk-resident representation that stores objects contained in the leaf nodes of the quadtree in a linear index (e.g., a B-tree) ordered based on a space-filling curve. We present two complementary techniques: an improved insertion algorithm and a bulk-loading method. The bulk-loading method can be extended to handle bulk-insertions into an existing PMR quadtree. We make some analytical observations about the I/O cost and CPU cost of our PMR quadtree bulk-loading algorithm, and conduct an extensive empirical study of the techniques presented in the paper. Our techniques are found to yield significant speedup compared to traditional quadtree building methods, even when the size of a main memory buffer is very small compared to the size of the resulting quadtrees.
Computational aspects of maximum likelihood estimation of autoregressive fractionally integrated moving average models
Authors: Jurgen A. Doornik, Marius Ooms
Venue: Computational Statistics Data Analysis (2003)

Computational aspects of likelihood-based estimation of univariate ARFIMA(p,d,q) models are addressed. Particular issues are the numerically stable evaluation of the autocovariances and efficient handling of the variance matrix which has dimension equal to the sample size. It is shown how efficient computation and simulation are feasible, even for large samples. Implementation of analytical bias corrections in ARFIMA regression models is also discussed.
Semi-order fuzzy supermartingales and submartingales with continuous time
Authors: Yuhu Feng, Xinglong Zhu
Venue: Fuzzy Sets and Systems (2002)

A new suitable semi-order in the fuzzy number space (En, D), the semi-order fuzzy supermartingales and submartingales with continuous time and their characteristics are introduced. The famous Riesz decomposition and Doob-Meyer decomposition theorems in standard martingale theory are generalized to semi-order fuzzy supermartingales. The proof of Doob-Meyer decomposition is rather technical and so the theory of fuzzy-valued measures generated by increasing fuzzy processes is developed.
A note on block-transitive point-imprimitive designs
Authors: Ngo Dac Tuan
Venue: European Journal of Combinatorics (2003)

We study block-transitive point-imprimitive designs. Cameron and Praeger showed that in such designs t = 2 or 3. In 2000, Mann and Tuan showed that if t = 3 then v ≤ (??) + 1. In this paper, we show a finiteness theorem for block-transitive point-imprimitive 3-designs for which this bound is met. We prove that for a given natural number n, there are only finitely many numbers k of the form np α - 1, where p is a prime number, such that there exists a block-transitive point-imprimitive 3 - ((??) + 1, k, λ) design.
Global and uniform convergence of subspace correction methods for some convex optimization problems
Authors: Xue-Cheng Tai, Jinchao Xu
Venue: Mathematics of Computation (2002)

This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained convex optimization problems. Some multigrid and domain decomposition methods are also discussed as special examples for solving some nonlinear elliptic boundary value problems.
Efficient crosstalk noise modeling using aggressor and tree reductions
Authors: Li Ding, David Blaauw, Pinaki Mazumder
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

This paper describes a fast method to estimate crosstalk noise in the presence of multiple aggressor nets for use in physical design automation tools. Since noise estimation is often part of the innerloop of optimization algorithms, very efficient closed-form solutions are needed. Previous approaches have typically used simple lumped 3--4 node circuit templates. One aggressor net is modeled at a time assuming that the coupling capacitances to all quiet aggressor nets are grounded. They also model the load from interconnect branches as a lumped capacitor and use a dominant pole approximation to solve the template circuit. While these approximations allow for very fast analysis, they result in significant underestimation of the noise. In this paper, we propose a new and more comprehensive fast noise estimation model. We use a 6 node template circuit and propose a novel reduction technique for modeling quiet aggressor nets based on the concept of coupling point admittance. We also propose a reduction method to replace tree branches with effective capacitors which models the effect of resistive shielding. Finally, we propose a new double pole approach to solve the template circuit. We tested the proposed method on noiseprone interconnects from an industrial high performance processor. Our results show a worst-case error of 7.8% and an average error of 2.7%, while allowing for very fast analysis.
Using Product Profiling to Illustrate Manufacturing-Marketing Misalignment
Authors: Terry J. Hill, Rafael Menda, David M. Dilts
Venue: Interfaces (1998)

As companies choose among process alternatives, they need a clear understanding of the changing alignment between manufacturing and the needs of their markets. Assessing how well existing processes fit these market requirements and making choices to meet future needs are critical strategic responsibilities for manufacturing. Product profiling can be used to examine the degree of alignment between the needs of a company's markets and the characteristics of its existing manufacturing process and infrastructure investments. We compare product profiling with another tool, the product-process matrix, and examine the applicability of both in a typical mismatch situation. In-depth analysis in one firm indicates that product profiling is a valuable tool to uncover the origins of misalignments that occur over time and to illustrate the phenomenon to executives.