ppxscal/embedding_network huggingface dataset:
A parametric error analysis of Goldschmidt's division algorithm
Authors: Guy Even, Peter-M. Seidel, Warren E. Ferguson
Venue: Journal of Computer and System Sciences (2005)

Back in the 1960s Goldschmidt presented a variation of Newton-Raphson iterations for division that is well suited for pipelining. The problem in using Goldschmidt's division algorithm is to present an error analysis that enables one to save hardware by using just the right amount of precision for intermediate calculations while still providing correct rounding. Previous implementations relied on combining formal proof methods (that span thousands of lines) with millions of test vectors. These techniques yield correct designs but the analysis is hard to follow and is not quite tight.We present a simple parametric error analysis of Goldschmidt's division algorithm. This analysis sheds more light on the effect of the different parameters on the error. In addition, we derive closed error formulae that allow to determine optimal parameter choices in four practical settings.We apply our analysis to show that a few bits of precision can be saved in the floating-point division (FP-DIV) micro-architecture of the AMD-K7TM microprocessor. These reductions in precision apply to the initial approximation and to the lengths of the multiplicands in the multiplier. When translated to cost, the reductions reflect a savings of 10.6% in the overall cost of the FP-DIV micro-architecture.
Channel-dependent load balancing in wireless packet networks: Research Articles
Authors: Giuseppe Bianchi, Ilenia Tinnirello
Venue: Wireless Communications Mobile Computing (2004)

This paper refers to a wireless cellular packet network scenario where fast retransmission of corrupted packets is used to improve the packet error ratio. Since the &lsquo;gross&rsquo; packet transmission rate (including retransmission) depends on the channel quality perceived, admitted calls weight unevenly in terms of effective resource consumption. In this paper, we suggest using channel quality information to drive load balancing mechanisms. We propose two novel metrics to determine the best cell to attach to, during handover or new call origination. Extensive simulation results prove the superiority of our proposed schemes with respect to traditional load balancing, which base their operation on the number of admitted calls per cell. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Alternative Digit Sets for Nonadjacent Representations
Authors: James A. Muir, Douglas R. Stinson
Venue: SIAM Journal on Discrete Mathematics (2005)

It is known that every positive integer n can be represented as a finite sum of the form $n={\textstyle\sum} a_i 2^{i}$, where $a_i\in \{0,1,-1\}$ for all i, and no two consecutive ai's are nonzero. Such sums are called nonadjacent representations. Nonadjacent representations are useful in efficiently implementing elliptic curve arithmetic for cryptographic applications.In this paper, we investigate if other digit sets of the form {0,1,x}, where x is an integer, provide each positive integer with a nonadjacent representation. If a digit set has this property, we call it a nonadjacent digit set (NADS). We present an algorithm to determine if {0,1,x} is an NADS and, if it is, we present an algorithm to efficiently determine the nonadjacent representation of any positive integer. We also present some necessary and sufficient conditions for {0,1,x} to be an NADS. These conditions are used to exhibit infinite families of integers x such that {0,1,x} is an NADS, as well as infinite families of x such that {0,1,x} is not an NADS.
Analyzing web page headings considering various presentation
Authors: Yushin Tatsumi, Toshiyuki Asahi
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Exploiting document structure can solve the usability problem when browsing web pages designed for PCs with non-PC terminals. For example, by exploiting headings among document structure and showing them selectively within a display, users can easily grasp a page's overview. In this paper, as a basic part of document structure analysis, we propose a heading analysis method for web pages considering various presentation. Results of evaluation experiments confirmed that our proposed method could extract many headings that could not be extracted by using HTML element names.
TruRank: taking PageRank to the limit
Authors: Sebastiano Vigna
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

PageRank is defined as the stationary state of a Markov chain depending on a damping factor α that spreads uniformly part of the rank. The choice of α is eminently empirical, and in most cases the original suggestion α=0.85 by Brin and Page is still used. It is common belief that values of α closer to 1 give a "truer to the web" PageRank, but a small α accelerates convergence. Recently, however, it has been shown that when α=1 all pages in the core component are very likely to have rank 0 [1]. This behaviour makes it difficult to understand PageRank when α≈1, as it converges to a meaningless value for most pages. We propose a simple and natural modification to the standard preprocessing performed on the adjacency matrix of the graph, resulting in a ranking scheme we call TruRank. TruRank ranks the web with principles almost identical to PageRank, but it gives meaningful values also when α☰ 1.
A time-predictable execution mode for superscalar pipelines with instruction prescheduling
Authors: Christine Rochange, Pascal Sainrat
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

The time predictability of the components of a real-time system is required whenever it must be guaranteed that deadlines will be met. Research on techniques to evaluate the Worst-Case Execution Time (WCET) of programs has received much attention these last years but current high-performance processors prove to be hard to model both safely and tightly. We acknowledge the difficulty of taking into account more and more dynamic mechanisms within static analysis and this motivates our approach that consists in making the processor fit WCET estimation techniques. We focus on out-of-order superscalar pipelines and we propose to regulate the instruction flow so that subsequent basic blocks execute independently one of each other. This would allow any WCET estimation tool to limit the measurement to individual basic blocks.
Background of users of scientific computing
Authors: Charles B. Dunham
Venue: ACM SIGNUM Newsletter (1976)

In writing and documenting mathematical software, it is essential to have an idea what the average user, consultant, or program librarian knows. The author, therefore, did a survey, based mainly on his own university, of what background these people had. The results suggest that no knowledge of scientific computing, apart from a language, can be assumed.
Web-assisted annotation, semantic indexing and search of television and radio news
Authors: Mike Dowman, Valentin Tablan, Hamish Cunningham, Borislav Popov
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

The Rich News system, that can automatically annotate radio and television news with the aid of resources retrieved from the World Wide Web, is described. Automatic speech recognition gives a temporally precise but conceptually inaccurate annotation model. Information extraction from related web news sites gives the opposite: conceptual accuracy but no temporal data. Our approach combines the two for temporally accurate conceptual semantic annotation of broadcast news. First low quality transcripts of the broadcasts are produced using speech recognition, and these are then automatically divided into sections corresponding to individual news stories. A key phrases extraction component finds key phrases for each story and uses these to search for web pages reporting the same event. The text and meta-data of the web pages is then used to create index documents for the stories in the original broadcasts, which are semantically annotated using the KIM knowledge management platform. A web interface then allows conceptual search and browsing of news stories, and playing of the parts of the media files corresponding to each news story. The use of material from the World Wide Web allows much higher quality textual descriptions and semantic annotations to be produced than would have been possible using the ASR transcript directly. The semantic annotations can form a part of the Semantic Web, and an evaluation shows that the system operates with high precision, and with a moderate level of recall.
Effects of task properties, partner actions, and message content on eye gaze patterns in a collaborative task
Authors: Jiazhi Ou, Lui Min Oh, Jie Yang, Susan R. Fussell
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

Helpers providing guidance for collaborative physical tasks shift their gaze between the workspace, supply area, and instructions. Understanding when and why helpers gaze at each area is important both for a theoretical understanding of collaboration on physical tasks and for the design of automated video systems for remote collaboration. In a laboratory experiment using a collaborative puzzle task, we recorded helpers' gaze while manipulating task complexity and piece differentiability. Helpers gazed toward the pieces bay more frequently when pieces were difficult to differentiate and less frequently over repeated trials. Preliminary analyses of message content show that helpers tend to look at the pieces bay when describing the next piece and at the workspace when describing where it goes. The results are consistent with a grounding model of communication, in which helpers seek visual evidence of understanding unless they are confident that they have been understood. The results also suggest the feasibility of building automated video systems based on remote helpers' shifting visual requirements.
Generating derangements by interchanging at most four elements
Authors: Kenji Mikawa, Ichiro Semba
Venue: Systems and Computers in Japan (2004)

For the set S = &lcub;1,2,&hellip;,n&rcub;, a permutation &pi;:S &rarr; S such that &pi;(i)&ne;i is called a complete permutation, and the string &pi;(1)&pi;(2)&hellip;&pi;(n) is called a derangement. In this paper, the authors consider the generation of a list that contains one instance of every derangement. Sequential generation, which sequentially generates a string by interchanging characters in the string, can generate the list more efficiently when fewer characters are interchanged. If &Pscr;(S) denotes the list of derangements and deg(&Pscr;(S)) denotes the maximum value of the numbers of characters that are interchanged, no list of derangements such that deg(&Pscr;(S)) = O(1) is known as of today. In this paper, the authors notice that a derangement can be decomposed into mutually disjoint cycles to show that there exists no list of derangements such that deg(&Pscr;(S)) = 2. Also, in the second half of this paper, they consider an algorithm for generating a list for which deg(&Pscr;(S)) = 4 for |S|&ge;4. According to this algorithm, the average number of characters that are interchanged is roughly 2.980. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(12): 25&ndash;31, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10531
Optimal threshold for hepatic blood vessels based on structural analysis and cancer detection
Authors: Takeshi Saitoh, Masatoshi Ikeda, Kimiya Aoki, Toyohisa Kaneko, Ryuzo Sekiguchi
Venue: Systems and Computers in Japan (2005)

Recently, high-resolution multislice CT images have been used in the diagnosis of hepatic cancer. In the conventional method of detecting hepatic cancer on the basis of three-dimensional images, it is difficult to detect cancers with a three-dimensional structure. This paper proposes a method of detection of liver cancer on the basis of three-dimensional hepatic blood vessel regions which are extracted by threshold processing. First, the liver entrance is located by tracing the blood vessels from the abdominal aorta. In order to detect the cancer, the hepatic vessel region must be extracted accurately. For this purpose, a method is proposed in which a temporary threshold is determined near the liver entrance, and the structure of the blood vessel is analyzed by adjusting the threshold from the temporary value in order to determine the optimal threshold. In the structural analysis, thinning is applied to the blood vessel and a directed graph is constructed. When the threshold is too low, a loop is produced due to overextraction of the blood vessel region. The optimal threshold is determined on the basis of this property. The cancer detection procedure is composed of two stages. Primary detection finds cancers contained in the extracted blood vessel region, and secondary detection finds cancers from the region that is not extracted. In experiments on seven cases, ten cancers were detected with three false positives. &copy; 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(7): 1&ndash;12, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20329
Book review: Introduction to Common Lisp by Taiichi Yuasa and Masami Hagiya (Academic Press, 1987) and Common Lisp Drill by Taiichi Yuasa (Academic Press, 1988); Both texts translated into English by Richard Weyhrauch and Yasuko Kitajima
Venue: ACM SIGART Bulletin (1991)

"Introduction to Common Lisp (sic)" is a textbook that professes to teach the basics of Common LISP using Kyoto Common LISP as the dialect of choice. In his preface, Author Taiichi Yuasa states that his book is "... designed to explain Common Lisp in a way that can be understood by beginners." He further states that "The knowledge you will acquire from this book will be enough for you to write reasonable Lisp programs." The jacket blurb additionally states that the book "... can be used as a beginning text for undergraduate and graduate students in computer science ..." The companion volume to "Introduction to Common Lisp", "Common Lisp Drill", is a workbook-like collection of exercises keyed to the text of "Introduction to Common Lisp". It is, according to its back-cover blurb, "... perfectly suited as an independent tutorial for learning Common Lisp." This review will examine these claims, along with some other issues.
Design and Performance of a High Fidelity, Low Mass, Linear Haptic Display
Authors: David W. Weir, Michael A. Peshkin, J. Edward Colgate, Pietro Buttolo
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

We built a high fidelity, low mass, linear haptic display, with a peak force output of 8.5 Newtons, continuous force output of 1.3 Newtons, range of motion of approximately 15 millimeters, sensing resolution of 0.5 microns, and a -3dB bandwidth of approximately 550 Hz. By having low apparent mass of approximately 5 grams, we can realistically render linear switches, which themselves have a moving mass of only a few grams. This device utilizes a low inertia rotary motor, but over only a limited range of motion, allowing it to be driven without commutation. We constructed a linear, current controlled amplifier to drive the system. Additionally, the motor windings allow us to use electrical damping to add physical damping to the system to improve its performance.
Nearly insensitive bounds on SMART scheduling
Authors: Adam Wierman, Mor Harchol-Balter, Takayuki Osogami
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the motivation of minimizing mean response time and/or mean slowdown. Examples of SMART policies include PSJF, SRPT, and hybrid policies such as RS (which biases according to the product of the remaining size and the original size of a job).For many policies in the SMART class, the mean response time and mean slowdown are not known or have complex representations involving multiple nested integrals, making evaluation difficult. In this work, we prove three main results. First, for all policies in the SMART class, we prove simple upper and lower bounds on mean response time. Second, we show that all policies in the SMART class, surprisingly, have very similar mean response times. Third, we show that the response times of SMART policies are largely insensitive to the variability of the job size distribution. In particular, we focus on the SRPT and PSJF policies and prove insensitive bounds in these cases.
Branch decompositions and minor containment
Authors: Albert Mercade
Venue: Networks (2004)

Given a simple graph G, a simple connected graph H, and a branch decomposition of G of width k, we present a practical algorithm to test if H is a minor of G. The notion of branch decompositions and its related connectivity invariant for graphs, branchwidth, were introduced by Robertson and Seymour. The algorithm that we present follows the general framework for such an algorithm sketched by Robertson and Seymour with the addition of pruning techniques for runtime speedup. &copy; 2003 Wiley Periodicals, Inc.
Displacement structures and fast inversion formulas for q-adic Vandermonde-like matrices
Authors: ZhengHong Yang, YongJian Hu
Venue: Journal of Computational and Applied Mathematics (2005)

A new class of so-called q-adic Vandermonde-like matrices over an arbitrary nonalgebraically closed field is introduced. This class generalizes the ordinary Vandermonde-like matrices over the complex field. Three kinds of displacement structures and fast inversion formulas for this class of matrices are presented by using displacement structure theory method, which generalize some of the well-known results for confluent Vandermonde-like matrices in the closed field case.
News and Trends
Authors: Greg Goth
Venue: IEEE Internet Computing (2003)

The latest Web acceleration technologies have been likened to alchemy, turning the leadenspeeds of dial-up access into the access rate "gold" called "broadband lite." Within a few months of these productsý debut, large ISPs, wholesale resellers of network access, and smaller providers worldwide have adopted them.
Proceedings of the 2005 workshop on End-to-end, sense-and-respond systems, applications and services
Venue: International Conference On Mobile Systems, Applications And Services (2005)

It has been long realized that the development and exploitation of intelligent sensors and actuators and their networks (S&As and SANETs, respectively) will enable existing operations and processes to become more efficient, nimble, and capable to react to new situations dynamically, and, at the same time, spearhead a new generation of applications and services not previously imagined. So it comes as no surprise that a large and diverse set of organizations from retail store heavyweights to governmental (at the local and national level) agencies, from emergency responders to utility operators, agriculturalists, habitat scientists, and so on, are all looking into ways of incorporating SANETs in their processes to improve their operations, reduce cost, provide higher customer service, and increase yield.
Two-state, reversible, universal cellular automata in three dimensions
Authors: Daniel B. Miller, Edward Fredkin
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

A novel two-state, Reversible Cellular Automata (RCA) is described. This three-dimensional RCA is shown to be capable of universal computation. Additionally, evidence is offered that this RCA is capable of universal construction.
From Requirements to Specifications
Authors: Cory Plock, Benjamin Goldberg, Lenore Zuck
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

Live Sequence Charts (LSC) provide a formal visual framework for creating scenario-based requirements for reactive systems. An LSC imposes a partial order over a set of events, such as the sending or receiving of messages. Each event is associated with a liveness property, indicating whether it can or must occur. Time extensions can further specify when these events should occur An individual LSC tells a story about particular fragment of system behavior, whereas LCS specifications ¿ afinite set of LSC ¿ collectively define the total behavior. An LSC specification may require that more than one distinct scenario, or multiple instances of the same scenario, execute concurrently. It is natural to ask whether LSC specifications be synthesized into formal languages. Previous work offers translations from untimes LSCs to finite state machines, and from single (non-concurrent) LSCs to timed automata. Here, we show that LSC specifications with concurrency can also be expressed as a timed automata
Algorithms first
Authors: Larry J. Morell
Venue: Journal of Computing Sciences in Colleges (2005)

An approach to teaching introductory programming is discussed in which substantial time is devoted to the discussion of algorithms before introducing the programming language. The approach, called "algorithms first", was tried in an introductory course of programming in C. Algorithms were written by students during the first seven weeks of the course in an executable algorithm language called Genesis. During the last seven weeks students translated algorithms into C. The overall results seem to favor the approach. Strengths and weaknesses of the approach are discussed along with suggestions for adapting this technique to a variety of course structures.
Connecting Components with Soft System Buses: A New Methodology for Design, Development, and Maintenance of Reconfigurable, Ubiquitous, and Persistent Reactive Systems
Authors: Jingde Cheng
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

From the viewpoints of ubiquitous computing and component-based software engineering, this paper proposes a new methodologyfor design, development, and maintenance of reconfigurable, ubiquitous, and persistent reactive systems: using soft system buses to connect all components of a reactive system such that no direct interaction is allowed between any two components. Following this methodology, system designers and developers can build persistently reactive systems such that they can be easily maintained, upgraded, and reconfigurated during continuous running by replacing an old or problematic component with a newer or sounder one, removing some useless components, and adding some new components for satisfying new requirements.
Virtual Traditional Japanese Crafting System Using JGNII in Collaborative Work Environment
Authors: Tomoyuki Ishida, Akihiro Miyakawa, Yoshitaka Shibata
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

Virtual Reality technology performs very important role to design and construct desired buildings and houses. In this paper, we introduce an extended virtual Japanese traditional crafting system to collaborate by many users such as end consumers, craftsmen, coordinator and salesperson each other. Multiple CAVE systems in different locations are interconnected to organize a collaborative virtual reality environment over Japan Gigabit Network (JGN II) which is a testbed network in Japan with several ten Gigabit/sec. A larger number of traditional Japanese fittings in several local cities are redesigned into CAD data and stored in 3D database systems over JGN II. Users can share the virtual space interactively collaborate, retrieve from the distributed MDBs to realize the desired interior space in the house for consumers. We implemented a 3D presentation system by CavernSoft In addition to OpenGL and IRIS Performer in CAVE environment on JGN II and built a prototype system.