ppxscal/embedding_network huggingface dataset:
A small feature suppression/unsuppression system for preparing B-rep models for analysis
Authors: K. Y. Lee, C. G. Armstrong, M. A. Price, J. H. Lamont
Venue: Proceedings of the 2005 ACM symposium on Solid and physical modeling (2005)

CAD technology plays an ever more central role in today's multidisciplinary simulation environments. While this has enabled highly complex and detailed models to be used earlier in the design process it has brought with it difficulties for simulation specialists. Most notably CAD models now contain many details which are irrelevant to simulation disciplines. CAD systems have feature trees which record feature creation but unfortunately this does not capture which features are relevant to which analysis discipline. Many features of little significance to an analysis only emerge during the construction of the model. The ability to selectively suppress and reinstate features while maintaining an audit trail of changes is required to facilitate the control of the idealisation process. Features suppressed for one analysis can be retrieved for use in another.This work uses combinatorial topology concepts to outline the necessary conditions so that CAD model simplification operations can be designed as continuous transformations. Irrelevant features can then be suppressed and subsequently reinstated, within defined limitations, independently from the order in which they were suppressed. The implementation of these concepts provides analysts with a mechanism for generating analysis models with different levels of detail, without having to repeat the simplification process from the original CAD geometry. Most importantly, the information recorded during the suppress operations forms an essential audit trail of the idealisation process and can be presented in a feature-tree like structure allowing analysts to review their modelling decisions retrospectively. The approach also facilitates the generation of local, detailed models encapsulating a feature of interest. The proposed system follows a Find and Fix paradigm; where different algorithms for feature finding and fixing can be utilised in a common cellular modelling framework.
Mapping algorithm for large-scale field programmable analog array
Authors: Faik Baskaya, Sasank Reddy, Sung Kyu Lim, Tyson Hall, David V. Anderson
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

Modern advances in reconfigurable analog technologies are allowing field-programmable analog arrays (FPAAs) to dramatically grow in size, flexibility, and usefulness. With these advances, analog circuits and systems can be programmable, reconfigurable, adaptive, implemented on standard CMOS to take advantage of scaled CMOS technology, and at a density comparable to digital memories. Our goal in this paper is to develop the first physical design automation toolset for floating-gate based FPAA with focus on minimization of parasitic effects on FPAA interconnect. We provide graph-based analog circuit and FPAA device modeling suitable for efficient mapping. Our FPAA clustering algorithm constructs Computational Analog Blocks (CAB) from analog circuit elements while improving the utilization of the device and reducing its impact on the total number of routing switches used. Experimental results demonstrate the effectiveness of our approach.
HDGSOM: A Modified Growing Self-Organizing Map for High Dimensional Data Clustering
Authors: Rasika Amarasiri, Damminda Alahakoon, Kate A. Smith
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

The Growing Self Organizing Map (GSOM) algorithm is a variant of the Self Organizing Map (SOM). It has a dynamically growing structure that adapts to the natural structure of the data.It has been identified that the growing of the GSOM can get negatively affected when used with very large dimensional data such as those in text and DNA data sets. This paper addresses these issues and presents a modified version of the GSOM called the High Dimensional GSOM (HDGSOM). The algorithm and experimental results showing the improved performance of the HDGSOM are also presented.
Numerical methods for nonlinear stress wave propagation (abstract)
Authors: Larry D. Bertholf
Venue: ACM SIGNUM Newsletter (1975)

The partial differential equations characterizing stress wave propagation problems include conservation of volume, mass, momentum, and energy plus the constitutive relations for the materials involved. Generally these constitutive relations are nonlinear and numerical methods are required for solutions in various coordinate systems and spatial dimensions. The philosophy of stress wave propagation code development and application at Sandia Laboratories is given in this paper. The way different methods are developed, utilized, and tested is illustrated by many examples in which code solutions are compared to analytic solutions, experiments, and solutions from other codes.
A Rate Control Algorithm for Wireless Video Transmission Using Perceptual Tuning
Authors: Yu Sun, Dongdong Li, Ishfaq Ahmad, Jiancong Luo
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

In video transmission over two-way wireless channel, Automatic Repeat reQuest (ARQ) retransmission has been used to protect packets from losing, which also causes the channel throughput varying and brings more challenges to rate control of the video compression. This paper proposes a new rate control algorithm based on Regions of Interest (ROI), PID buffer controlling and perceptual tuning techniques, etc. It intelligently allocates bit budget among different regions and adapts to time-varying wireless channel so as to achieve better perceptual quality in ROI and depress the frame skipping. Simulation results illustrate that our algorithm effectively enhances the perceptual quality for ROI, significantly reduces the number of frame skipping, and thereby improves the smoothness of the video.
Computing the euler--poincaré characteristics of sign conditions
Authors: Saugata Basu, Richard Pollack, Marie-Francçoise Roy
Venue: Computational Complexity (2005)

Computing various topological invariants of semi-algebraic sets in single exponential time is an active area of research. Several algorithms are known for deciding emptiness, computing the number of connected components of semi-algebraic sets in single exponential time etc. However, an algorithm for computing all the Betti numbers of a given semi-algebraic set in single exponential time is still lacking. In this paper we describe a new, improved algorithm for computing the Euler--Poincaré characteristic (which is the alternating sum of the Betti numbers) of the realization of each realizable sign condition of a family of polynomials restricted to a real variety. The complexity of the algorithm is $$s^{k'+1}O(d)^{k} + s^{k'}((k' log_{2}(s) + k log_{2}(d))d)^{O(k)},$$ where s is the number of polynomials, k the number of variables, d a bound on the degrees, and k0 the real dimension of the variety. A consequence of our result is that the Euler--Poincaré characteristic of any locally closed semi-algebraic set can be computed with the same complexity. The best previously known single exponential time algorithm for computing the Euler--Poincaré characteristic of semi-algebraic sets worked only for a more restricted class of closed semi-algebraic sets and had a complexity of (ksd)O(k).
Future and emerging technologies: a vision for tomorrow of EU IST research
Authors: Fabrizio Sestini, Thierry Van der Pyl
Venue: ACM SIGCOMM Computer Communication Review (2005)

FET (Future and Emerging Technologies) is a part of the EU-funded research activities which addresses emerging ICT-related research domains, explores options in ICT technology roadmaps where road blocks are anticipated but where "no known solutions" are available and evaluates these options. FET activities have proved very efficient in feeding the core of the IST programme with emerging concepts or radically new technological paradigms, often arising at the crossroads of existing disciplines. In the coming years these activities, which are expected to be complemented by an envisaged European Research Council, will continue nurturing and stimulating creativity and excellence in ICTs research also in combination with other relevant S&T fields.
WCAG formalization with W3C standards
Authors: Vicente Luque Centeno, Carlos Delgado Kloos, Martin Gaedke, Martin Nussbaumer
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Web accessibility consists on a set of checkpoints which are rather expensive to evaluate or to spot. However, using W3C technologies, this cost can be clearly minimized. This article presents a W3C formalized rule-set version for automatable checkpoints from WCAG 1.0.
Ivy: a read/write peer-to-peer file system
Authors: Athicha Muthitacharoen, Robert Morris, Thomer M. Gil, Benjie Chen
Venue: Proceedings of the 5th symposium on Operating systems design and implementationDue to copyright restrictions we are not able to make the PDFs for this conference available for downloading (2002)

Ivy is a multi-user read/write peer-to-peer file system. Ivy has no centralized or dedicated components, and it provides useful integrity properties without requiring users to fully trust either the underlying peer-to-peer-storage system or the other users of the file system.An Ivy file system consists solely of a set of logs, one log per participant. Ivy stores its logs in the DHash distributed hash table. Each participant finds data by consulting all logs, but performs modifications by appending only to its own log. This arrangement allows Ivy to maintain meta-data consistency without locking. Ivy users can choose which other logs to trust, an appropriate arrangement in a semi-open peer-to-peer system.Ivy presents applications with a conventional file system interface. When the underlying network is fully connected, Ivy provides NFS-like semantics, such as close-to-open consistency. Ivy detects conflicting modifications made during a partition, and provides relevant version information to application-specific conflict resolvers. Performance measurements on a wide-area network show that Ivy is two to three times slower than NFS.
ReDAL: Request Distribution for the Application Layer
Authors: Debra VanderMeer, Helen Thomas, Kaushik Dutta, Anindya Datta, Krithi Ramamritham
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

Modern application infrastructures are based on clustered, multi-tiered architectures, where request distribution occurs in two sequential stages: over a cluster of web servers, and over a cluster of application servers. Much work has focused on strategies for distributing requests across a web server cluster in order to improve overall throughput across the cluster. The strategies applied at the application layer are the same as those at the web server layer, because it is assumed that they transfer directly. In this paper, we argue that the problem of distributing requests across an application server cluster is fundamentally different from the web server request distribution problem, due to core differences in request processing in web and application servers. We devise an approach for distributing requests across a cluster of application servers such that overall system throughput is enhanced, and load across the application servers is balanced. We compare the performance of our approach ¿ with widely used industrial and recently proposed techniques from the literature¿ experimentally in terms of throughput and response time performance, as well as resource utilization. Our experimental results show a significant improvement of up to nearly 80% in both throughput and response time, with a very low additional cost in terms of CPU overheads, 0.7% to 1.5%, on the web server, and virtually no impact on CPU overheads on the application server.
The discourse of data: exploring data-related vocabularies in geographic information systems description
Authors: Fletcher Cole
Venue: Journal of Information Science (2005)

Various ideas of data have emerged, expressed in practice through distinct vocabularies of data-related terms. This article develops a six-category taxonomy of these vocabularies, and illustrates how their terms are utilized in texts which relate to geographic information systems (GIS) in general, and to the HYDRA5 water catchment modeling system developed for the Sydney Water Corporation in particular. Revealed is complex cross-referencing between inter-related vocabularies. Terms from different vocabularies are juxtaposed in such a way as to produce a cascade of meaningful reference which invites the reader to accept the transitions from understanding 'data' in one way to understanding it in another. Several implications are drawn out briefly: problems with viewing data as 'object'; the need to explore further how the complexity of data is negotiated in practice; and the defining role that ideas of data have in relation to communities of practice, professional education and technical training.
TRMeister: A DBMS with High-Performance Full-Text Search Functions
Authors: Tetsuya Ikeda, Hiroko Mano, Hideo Itoh, Hiroshi Takegawa, Takuya Hiraoka, Shiroh Horibe, Yasushi Ogawa
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

TRMeister is a DBMS with high-performance full-text search functions. With TRMeister, high-speed full-text search, including high-precision ranking search in addition to Boolean search, is possible. Further, in addition to search, high-speed insert and delete are possible, allowing full-text search to be used in the same way as other types of database search in which data can be searched right after data is inserted. This makes it easy to combine normal attribute search with full-text search and thus easily create text search applications.
Hybrid CIP/M&M for Micro-Mobility Management under the Multilayer Wireless Network
Authors: Ying-Hong Wang, Hui-Min Huang, Huang-Yi Li
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

We reference the EVOLUTE [1] (Information Society Technologies, IST project) that mingles Session Initiation Protocol (SIP) with Mobile IP (MIP) to support macro-mobility management and provide seamless multimedia services for roaming users. In the part of micro-mobility, we utilize Multicast-based mobility (M&M) to assist with Cellular IP (CIP) infrastructure. They cooperate not only provide fast handoff and deal with various kinds of handoff, but also suit the macro-mobility management (proposed by Evolutes) to support real time and non-real time data flows.
An active step toward a web content accessible society
Authors: Joonho Hyun, Doojin Choi, Sukil Kim
Venue: Proceedings of the 2005 International Cross-Disciplinary Workshop on Web Accessibility (W4A) (2005)

In this paper, we discuss Korean Web Content Accessibility Guideline 1.0 (KWCAG 1.0) enacted in late 2004. KWCAG 1.0 consists of 14 checkpoints that are categorized into 4 principles, similar to WCAG2.0 working draft as of June 2003. Several Priority 1 checkpoints of W3C WCAG 1.0 and guidelines of Section 508 were not included in KWCAG 1.0, as they were not applicable to Korean circumstances, wherein fancy images and fantastic animation elements are widely used to design web pages.
I saw this and thought of you: some social uses of camera phones
Authors: Tim Kindberg, Mirjana Spasojevic, Rowanne Fleck, Abigail Sellen
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

This paper presents aspects of a study into how and why people use camera phones. The study examined people's intentions at the time of image capture and subsequent patterns of use. Motivated by current interest in "picture messaging", we focus on images taken to communicate with absent people and look at how they were actually used. We consider the timeliness of communication and the role of common ground to derive implications for design.
Abstract Combinatorial Programs and Efficient Property Testers
Authors: Artur Czumaj, Christian Sohler
Venue: SIAM Journal on Computing (2005)

Property testing is a relaxation of classical decision problems which aims at distinguishing between functions having a predetermined property and functions being far from any function having the property. In this paper we present a novel framework for analyzing property testing algorithms. Our framework is based on a connection of property testing and a new class of problems which we call abstract combinatorial programs. We show that if the problem of testing a property can be reduced to an abstract combinatorial program of small dimension, then the property has an efficient tester.We apply our framework to a variety of problems. We present efficient property testing algorithms for geometric clustering problems, for the reversal distance problem, and for graph and hypergraph coloring problems. We also prove that, informally, any hereditary graph property can be efficiently tested if and only if it can be reduced to an abstract combinatorial program of small size.Our framework allows us to analyze all our testers in a unified way, and the obtained complexity bounds either match or improve the previously known bounds. Furthermore, even if the asymptotic complexity of the testers is not improved, the obtained proofs are significantly simpler than the previous ones. We believe that our framework will help to understand the structure of efficiently testable properties.
A Services Oriented Framework for Next Generation Data Analysis Centers
Authors: H. Wang, A. Ghoting, G. Buehrer, S. Tatikonda, S. Parthasarathy, T. Kurc, J. Saltz
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 10 - Volume 11 (2005)

Over the past decade, advances in computational and sensor technology have enabled us to dynamically collect vast amounts of data from observations, health screening tests, simulations, and experiments at an ever-increasing pace. Knowledge discovery and data mining is an iterative process concerned with deriving interesting, non-obvious, and useful patterns and models from such large volumes of data. Although inexpensive storage is conducive to maintaining said data, accessing and managing it for knowledge discovery and data mining becomes a performance issue when datasets are large, dynamic, and distributed. In this work, we present our vision of a software framework consisting of middleware services to support interactive data mining over dynamic data at data analysis centers built on top of heterogeneous clusters. The design of a sampling service for dynamic data, together with initial performance results, are also presented.
Similarity-based surface modelling using geodesic fans
Authors: Steve Zelinka, Michael Garland
Venue: Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing (2004)

We present several powerful new techniques for similarity-based modelling of surfaces using geodesic fans, a new framework for local surface comparison. Similarity-based surface modelling provides intelligent surface manipulation by simultaneously applying a modification to all similar areas of the surface. We demonstrate similarity-based painting, deformation, and filtering of surfaces, and show how to vary our similarity measure to encompass geometry, textures, or other arbitrary signals. Geodesic fans are neighbourhoods uniformly sampled in the geodesic polar coordinates of a point on a surface. We show how geodesic fans offer fast approximate alignment and comparison of surface neighbourhoods using simple spoke reordering. As geodesic fans offer a a structurally equivalent definition of neighbourhoods everywhere on a surface, they are amenable to standard acceleration techniques and are well-suited to extending image domain methods for modelling by example to surfaces.
Structural Flexibility: A New Perspective on the Design of Manufacturing and Service Operations
Authors: Seyed M. Iravani, Mark P. Van Oyen, Katharine T. Sims
Venue: Management Science (2005)

In this paper, we present a new perspective on flexibility in manufacturing and service operations by exploring a type of operational flexibility that we term "structural flexibility (SF)." We focus on strategic-level issues of how flexibility can be created by using multipurpose resources such as cross-trained labor, flexible machines, or flexible factories. The proposed structural flexibility method uses the structure of the capability pattern to generate indices that quantify the ability of a system to respond to variability in its environment. Simulations of serial and parallel queueing networks provide evidence that this index is useful in predicting the performance rank of alternative designs for implementing multifunctionality in the face of variability. The proposed methodology supports managerial insight into structural design of manufacturing and service systems at the strategic level.
A fast, energy-efficient z-comparator
Authors: Justin Hensley, Montek Singh, Anselmo Lastra
Venue: Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware (2005)

We present a fast and energy-efficient z-comparator that takes advantage of the fact that the result of most depth comparisons can be determined by examining just a few bits. This feature is made possible by the use of asynchronous logic, which enables the comparator to rapidly compare bits until the result is clear and then stop. Using depth data from well-known computer games, SPICE simulations indicate that our comparator consumes only 25% of the energy and operates 1.67 times faster, on average, compared to an equivalent synchronous design. The comparator design is used to illustrate a more general design principle, "compute on demand," which can potentially enable graphics hardware to be faster and more energy-efficient.
Sign on the dotted line
Authors: Esther Schindler
Venue: netWorker (2005)

After renting houses for 25 years, I've just bought my first home. As part of the typical house-closing process, I spent a solid 45 minutes signing my name, over and over. After a while, the pages began to blur, my desire to understand the documents faded, and writer's cramp set in.
Introduction
Authors: Robert F. Rosin
Venue: History of programming languages---II (1996)

During its deliberations, the HOPL-II Program Committee concluded that, although the work of many computer scientists becomes part of the history of computing, very few computer scientists understand the history of computing or are involved in crafting that history. Assuming that a significant number of skilled computer scientists would attend HOPL-II, the Committee decided to take advantage of this opportunity to sensitize a portion of that community to issues in the history of computing and to entice some of them to become involved.