ppxscal/embedding_network huggingface dataset:
When to use splay trees
Authors: Eric K. Lee, Charles U. Martel
Venue: Software&mdash;Practice Experience (2007)

In this paper we present new empirical results for splay trees. These results provide a better understanding of how cache performance affects query execution time. Our results show that splay trees can have faster lookup times compared with randomly built binary search trees (BST) under certain settings. In contrast, previous experiments have shown that because of the instruction overhead involved in splaying, splay trees are less efficient in answering queries than randomly built BSTs&mdash;even when the data sets are heavily skewed (a favorable setting for splay trees). We show that at large tree sizes the difference in cache performance between the two types of trees is significant. This difference means that splay trees are faster than BSTs for this setting&mdash;despite still having a higher instruction count. Based on these results we offer guidelines in terms of tree size, access pattern, and cache size as to when splay trees will likely be more efficient. We also present a new splaying heuristic aimed at reducing instruction count and show that it can improve on standard splaying by 10&ndash;27&percnt;. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Ten steps applied to development and evaluation of process-based biogeochemical models of estuaries
Authors: Barbara J. Robson, David P. Hamilton, Ian T. Webster, Terence Chan
Venue: Environmental Modelling Software (2008)

The procedures involved in model development may be set out as a ten step process, beginning with defining the purpose of the model and ending with evaluation of the appropriateness and utility of the completed model. This process, recently outlined by Jakeman et al. [Jakeman, A.J., Letcher, R.A., Norton, J.P., 2006. Ten iterative steps in development and evaluation of environmental models. Environmental Modelling and Software 21, 602-614], is often iterative as model development is a continuous process that refines and improves the intended capacity of the model. Here, the ten steps of model development are critiqued and applied using a process-based biogeochemical model of aquatic systems, with examples from two case studies: a model of phytoplankton succession and nutrient concentrations in the Swan-Canning Estuary (Western Australia) and a model of sediment and nutrient transport and transformation in the Fitzroy Estuary and Keppel Bay (Queensland).
Optimal positions of twists in global on-chip differential interconnects
Authors: Eisse Mensink, Daniël Schinkel, Eric A. M. Klumperink, Ed van Tuijl, Bram Nauta
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

Crosstalk limits the achievable data rate of global on-chip interconnects on large CMOS ICs. This is especially the case, if low-swing signaling is used to reduce power consumption. Differential interconnects provide a solution for most crosstalk and noise sources, but not for neighbor-to-neighbor crosstalk in a data bus. This neighbor-to-neighbor crosstalk can be reduced with twists in the differential interconnect pairs. To reduce via resistance and metal layer use, we use as few twists as possible by placing only one twist in every even interconnect pair and only two twists in every odd interconnect pair. Analysis shows that there are optimal positions for the twists, which depend on the termination impedances of the interconnects. Theory and measurements on a 10-mm-long bus in 0.13-µm CMOS show that only one twist at 50% of the even interconnect pairs, two twists at 30% and 70% of the odd interconnect pairs, and both a low-ohmic source and a low-ohmic load impedance are very effective in mitigating the crosstalk.
ReSHAPE: A Framework for Dynamic Resizing and Scheduling of Homogeneous Applications in a Parallel Environment
Authors: Rajesh Sudarsan, Calvin J. Ribbens
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

A traditional application scheduler running on a parallel cluster only supports static scheduling where the number of processors allocated to an application remains fixed throughout the lifetime of the job. Due to unpredictability in job arrival times and varying resource requirements, static scheduling can result in idle system resources thereby decreasing the overall system throughput. In this paper we present a prototype framework called ReSHAPE, which supports dynamic resizing of parallel MPI applications executed on distributed memory platforms. The framework includes a scheduler that supports resizing of applications, an API to enable applications to interact with the scheduler, and a library that makes resizing viable. Applications executed using the ReSHAPE scheduler framework can expand to take advantage of additional free processors or can shrink to accommodate a high priority application, without getting suspended. Experimental results show that the Re- SHAPE framework can improve individual job turn-around time and overall system throughput.
A Fast FPGA-Based 2-Opt Solver for Small-Scale Euclidean Traveling Salesman Problem
Authors: Ioannis Mavroidis, Ioannis Papaefstathiou, Dionisios Pnevmatikatos
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

In this paper we discuss and analyze the FPGA-based implementation of an algorithm for the Traveling Salesman Problem (TSP), and in particular of 2-Opt, one of the most famous local optimization algorithms, for Euclidean TSP instances up to a few hundred cities. We introduce the notion of "symmetrical 2-Opt moves" which allows us to uncover fine-grain parallelism when executing the specified algorithm. We propose a novel architecture that exploits this parallelism, and demonstrate its implementation in reconfigurable hardware. We evaluate our proposed architecture and its implementation on a state-of-the-art FPGA using a subset of the TSPLIB benchmark, and find that our approach exhibits better quality of final results and an average speedup of 600% when compared with the state-of-the-art software implementation. Our approach produces, to the best of our knowledge, the fastest to date TSP 2-Opt solver for small-scale Euclidean TSP instances.
An O(nlogn) algorithm for the all-farthest-segments problem for a planar set of points
Authors: R. L. Scot Drysdale, Asish Mukhopadhyay
Venue: Information Processing Letters (2008)

In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(nlogn) algorithm for the following proximity problem: Given a set P of n (>2) points in the plane, we have O(n^2) implicitly defined segments on pairs of points. For each point p@?P, find a segment from this set of implicitly defined segments that is farthest from p. We improve the previously known time bound of O(nh+nlogn) for this problem, where h is the number of vertices on the convex hull of P.
Hardware-Assisted Point-Based Volume Rendering of Tetrahedral Meshes
Authors: Erik W. Anderson, Steven P. Callahan, Carlos E. Scheidegger, John M. Schreiner, Claudio T. Silva
Venue: Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing (2007)

Unstructured volume grids are ubiquitous in scientific computing, and have received substantial interest from the scientific visualization community. In this paper, we take a point-based approach to rendering unstructured grids. In particular, we present a novel method of approximating these irregular elements with point-based primitives amenable to existing hardware acceleration techniques. To improve interactivity to large datasets, we have adapted a level-of-detail strategy. We use a well-known quantitative metric to analyze the image quality achieved by the final rendering.
Technology and Digital Art: 3D scan-based animation techniques for Chinese opera facial expression documentation
Authors: Hao Zhou, S. P. Mudur
Venue: Computers and Graphics (2007)

In the second half of the 20th century, Chinese opera, one of the oldest dramatic art forms with many different styles, underwent a serious decline. As several of these styles are on the verge of extinction, traditional methods to document Chinese opera are in progress-collecting and cross-referencing scripts, pictures, audios and videos. What appeal most in Chinese opera are the exaggerated painted facial make-up and expressions. Clearly, 3D facial animation technology is well suited for documenting this ancient dramatic art form. In this paper, we describe an experimental 3D graphics system for documenting Chinese opera facial make-up and expressions, which we have been developing over the last 3 years. Since realism is of utmost importance, we have architected our approach on the use of 3D scanners for capturing performers' facial poses. Direct morphing of these 3D scanned facial poses can provide us animated facial expressions, but requires a number of significant technical issues to be resolved. The rest of this paper describes this system and the major issues that are addressed along with some experimental results.
XPS analysis with an ultra clean vacuum substrate carrier for oxidation and airborne molecular contamination prevention
Authors: B. Pelissier, H. Kambara, E. Godot, E. Veran, V. Loup, O. Joubert
Venue: Microelectronic Engineering (2008)

Germanium wafer oxidation has been studied by angle resolved X-ray photoelectron spectroscopy (ARXPS). These analyses have been used for testing a new concept for substrate contamination prevention methods using an ultra clean vacuum substrate carrier for semiconductor manufacturing environments. Satisfying the International Technology Roadmap for Semiconductors (ITRS) under 65nm nodes has introduced many assignments to future semiconductor manufacture such as haze problems in lithography masks, wafer oxidation growth in queue time, or contact with airborne molecular contaminations (AMC). From our experience, silicon and germanium wafers, after HF passivation and cleaning, were transported to XPS in order to measure various aspects of the oxidation progress; one case with normal ambient air exposure and another with vacuum carrier storage without ambient exposure. The results give information on the Ge oxidation kinetic, in term of speed and bounding environment. Moreover, the tests performed using the vacuum carrier are significant proof of the efficiency of germanium oxidation prevention. The methods have a large potential for solving critical problems and decontamination methods in the short term IT road map.
A 2.8-V Multibit Complex Bandpass ΔΣAD Modulator in 0.18µm CMOS
Authors: H. San, Y. Jingu, H. Wada, H. Hagiwara, A. Hayakawa, H. Kobayashi
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

A second-order multibit switched-capacitor (SC) complex bandpass DeltaSigma AD modulator has been designed, fabricated and tested for application to low-IF receivers in wireless communication systems. We have employed two new algorithms there to improve the signal-to-noise-and-distortion (SNDR) of the modulator, (i) A complex bandpass filter with I, Q dynamic matching to reduce the mismatch influence between I, Q paths. As its by-product, the complex modulator can be divided into two separate parts without signal line crossing between the upper and lower paths. Therefore, the layout design of the modulator can be greatly simplified; (ii) A new complex bandpass data-weighted averaging (DWA) algorithm is implemented to suppress nonlinearity effects of multibit DACs in complex form to achieve high accuracy. Implemented in a 0.18-mum CMOS process and at 2.8V supply, the modulator achieves a measured peak SNDR of 64.5dB at 20MS/s with a signal bandwidth of 78kHz while dissipating 28.4mW and occupying an area of 1.82mm2.
Online Diagnosis and Recovery: On the Choice and Impact of Tuning Parameters
Authors: Marco Serafini, Andrea Bondavalli, Neeraj Suri
Venue: IEEE Transactions on Dependable and Secure Computing (2007)

Afault-tolerant system is designed to provide sustained delivery of services despite encountered perturbations. The ability to accurately detect, diagnose and recover from faults in an on-line manner (i.e., during system operation) constitutes an important aspect of fault-tolerance. This FDIR process has two primary objectives: to consistently identify a faulty node so as to restrictits effect on system operations, and to support the process of system recovery via isolation and reconfiguration of the system resources to sustain ongoing system operations. If FDIR isperformed as an on-line procedure this provides an effective capability of resource management, responding promptly to the appearance and disappearance of faults with a small duration of system susceptibility to subsequent fault accumulation.
LATEX The existence of positive solutions for multi-point BVPs with dependence on the first order derivative
Authors: Weihua Jiang, Bin Wang, Xiumin Li
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

In this paper, we study the second-order m-point boundary value problem with dependence on the first order derivative x"(t) + f(t,x(t),x'(t)) = 0, 0 \leqslant t \leqslant 1, x(0) = 0, x(1)-\sum\limits_{i = 1}^{m - 2} {k_i x\left( {\xi _i } \right)}= 0, where k_i \ge 0, i = 1,2,...,m-2,0 \le \xi_1 \le \xi_2 \le \cdot \cdot \cdot \le \xi_{m-2} \le 1. We impose growth conditions on f which yield the existence of at least one positive solution by using a new fixed point theorem.
Two Reconstruction Methods for Microwave Imaging of Buried Dielectric Anomalies
Authors: On-Ching Yue
Venue: IEEE Transactions on Computers (1975)

Microwave imaging of anomalies, such as voids or discontinuities, in optically opaque regions is described. Images were reconstructed with two techniques. The experimental technique utilized laser light for reconstructions from detour phase holograms that encoded data measured in the region of Fresnel diffraction. Examples of images are presented for smooth and rough interfaces. The numerical reconstruction technique was based on the angular spectrum technique, and an approximate propagator was derived to describe propagation through two, homogeneous dielectric layers to one anomaly. Image quality was acceptable for either reconstruction method, but the optically reconstructed images are rather small because scale reduction is limited in practice.
Stochastic Error-Correcting Syntax Analysis for Recognition of Noisy Patterns
Authors: Shin-Yee Lu
Venue: IEEE Transactions on Computers (1977)

In this paper, a probabilistic model for error-correcting parsing with substitution, insertion, and deletion errors is introduced. The formulation of maximum-likelihood error-correcting parser (MLECP) by incorporating the noise model into stochastic grammars is also presented. The use of stochastic error-correcting parsers for recognition of noisy and/or distorted patterns results in a process of high accuracy, but with low efficiency. In order to make the syntax analysis more practically feasible, it is proposed to use a sequential classification method for noisy strings processing. Computation results based on the classification experiments of noisy patterns for both nonsequential and sequential error-correcting parsers are presented.
Seamless traceability without compromise
Authors: Paul Mason, Anuttara Tianvorakoon
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

Traceability is the term used for mechanisms to record and subsequently navigate - ideally in a seamless fashion - relationships between any artifacts produced by systems development processes. Simple in theory! However, in practice the range of disjoint CASE tools engineers use to express and store these artifacts - and the lack of interoperability between them - mean seamless traceability is literally something of an ideal, tempered by numerous compromises. This paper presents a framework known as MAST (Meta-modelling Approach to System Traceability) that provides a possible solution to this problem. Building on and updating theoretical work previously proposed by this author [1], we demonstrate practical realisation of the framework.
A note on partition sum polynomials
Authors: Seong-Hun Paeng, Hee Je Cho
Venue: European Journal of Combinatorics (2008)

We show how to partition the set {k!p"0!p"1!...p"l!|p"i>=0,p"0+...+p"l=k} such that differences between sums of partitions are at most 1. From this, we obtain some equalities.
An ontology-based framework for author-learning content interaction
Authors: Saša Nešić, Dragan Gašević, Mehdi Jazayeri
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

This paper presents an ontology-based framework for capturing information about interaction between authors and learning contents. The approach is primarily focused on keeping track of changes made to a learning content as well as information about authors and tools, which take part in the interaction. We introduce the Author-Learning Content Interaction (ALCI) ontology, which gives a formal representation of changes and describes possible aspects of the interaction. Moreover, we discuss how information collected with the framework can assist authors during the authoring process and how it can support evolution and versioning of a learning content.
Network-Supported Layered Multicast Transport Control for Streaming Media
Authors: Zaichen Zhang, Victor Li
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

Multicast is very efficient in distributing large volume of data to multiple receivers over the Internet. Layered multicast helps solve the heterogeneity problem in multicast delivery. Extensive work has been done in the area of layered multicast, for both congestion control and error control. In this paper, we focus on network-supported protocols for streaming media. Most of the existing work solves the congestion control and error control problems separately, and do not give an integrated, efficient solution. In this paper, after reviewing related work, we introduce our proposed protocols, RALM and RALF. The former is a congestion control protocol and the latter is an error control protocol. They work under the same framework and provide an integrated solution. We also extend RALM to RALM-II, which is compatible with TCP traffic. We analyze the complexity of the proposed protocols in the network and investigated their performance through simulations. We show that our solution achieves significant performance gains with reasonable additional complexity.
On the Design of a Microcode Compiler for a Machine-Independent High-Level Language
Authors: P. -Y. R. Ma
Venue: IEEE Transactions on Software Engineering (1981)

A translator system employing a partial compiler, intermediate language, and three-pass code generator is described that produces compact microcode for a class of horizontal microinstruction machines.
Lisp implementations
Authors: Walter van Roggen
Venue: ACM SIGPLAN Lisp Pointers (1987)

There's a lot more to describing Lisp implementations than providing a list of features. One such aspect I'd like to gather information on is performance. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A-ary Tree-based Minimum Exact Cover of Leaf Set for Secure Group Communication in Grids
Authors: Shouzhi XU, Tingyao Jiang, Alin Zhong, Wangmin Yang, Lili Zhang, Qiaoli Liu
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Secure multicast is an effective group communication technology for information sharing and message exchange in emerging grids. As the group scale in grids may be very large and group members can be very unstable (a member can join or quit the group dynamically), it is hard for conventional group key management schemes to satisfy the efficiency of group key distribution very well because of the complexity of O(c.logn)( n is the group size, and c is the total additions/evictions). This paper gives a minimum exact cover problem of leaf set and discusses its solution based on an a-ary tree model. The correctness of the solution is proven theoretically. Furthermore, the implementation and application of it is illustrated. Both complexity analysis and simulation demonstrate the efficiency and effectiveness of the achievement of group key distribution based on minimum exact cover.
An Extendable Approach to Computer-Aided Software Requirements Engineering
Authors: T. E. Bell
Venue: IEEE Transactions on Software Engineering (1977)

The development of system requirements has been recognized as one of the major problems in the process of developing data processing system software. We have developed a computer-aided system for maintaining and analyzing such requirements. This system includes the Requirements Statement Language (RSL), a flow-oriented language for the expression of software requirements, and the Requirements Engineering and Validation System (REVS), a software package which includes a translator for RSL, a data base for maintaining the description of system requirements, and a collection of tools to analyze the information in the data base. The system emphasizes a balance between the use of the creativity of human thought processes and the rigor and thoroughness of computer analysis. To maintain this balance, two key design principles-extensibility and disciplined thinking-were foliowed throughout the system. Both the language and the software are easily user-extended, but adequate locks are placed on extensions, and limitations are imposed on use, so that discipline is augmented rather than decreased.
A Different Quantity of Partition-Based Efficient Algorithm for Reduction of Attribute in Information Systems
Authors: Jin-hai Li, Yue-jin Lv, Nan-xing Liu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

Reduction of attribute is one of the key problems in rough set theory. In this paper, first, the notion of different quantity of partition is defined in information systems; from the viewpoint of which two new and rela- tively reasonable formulas measuring attribute signific- ance are designed for reducing searching space. Then the two formulas are used as heuristic information to develop an efficient attribute reduction algorithm, which can avoid repeatedly calculating important value of unimportant attributes; the theoretical analysis shows that this algorithm is much less time complexity than those existed algorithms. Finally, an example and experimental results demonstrate its feasibility and effectiveness, respectively.
Set-theoretic solutions of the Yang-Baxter equation, graphs and computations
Authors: Tatiana Gateva-Ivanova, Shahn Majid
Venue: Journal of Symbolic Computation (2007)

We extend our recent work on set-theoretic solutions of the Yang-Baxter or braid relations with new results about their automorphism groups, strong twisted unions of solutions and multipermutation solutions. We introduce and study graphs of solutions and use our graphical methods for the computation of solutions of finite order and their automorphisms. Results include a detailed study of solutions of multipermutation level 2.