ppxscal/embedding_network huggingface dataset:
Solving convex programs by random walks
Authors: Dimitris Bertsimas, Santosh Vempala
Venue: Journal of the ACM (JACM) (2004)

Minimizing a convex function over a convex set in n-dimensional space is a basic, general problem with many interesting special cases. Here, we present a simple new algorithm for convex optimization based on sampling by a random walk. It extends naturally to minimizing quasi-convex functions and to other generalizations.
Towards G^2 Curve Design with Timmer Parametric Cubic
Authors: R. Gobithasan, Jamaludin Md. Ali
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualization (2004)

There has been vast research in the area of computer aided geometric design in order to identify algorithms to design objects. Timmer Parametric Cubic or Timmer PC was introduced by Harry Timmer as a follow up to the legendary Bezier curves. However it was then not utilized as it does not satisfy convex hull property, CHP. Since then, there lack studies to explore the possible usages and discover the uniqueness of Timmer PC. This paper discusses comprehensively the steps involved to generate a piecewise Timmer curve with G^1 and G^2 continuity. In the last section, a wine glass is rendered via surface of revolution as an example of implication to designing environment using the Timmer curve.
Experimental and theoretical study of wave propagation phenomena in drop-on-demand ink jet devices
Authors: D. B. Bogy, F. E. Talke
Venue: IBM Journal of Research and Development (1984)

This paper presents experimental observations and a theoretical analysis of the operation of drop-on-demand piezoelectric ink jet devices. By studying experimentally the dependence of several operating characteristics on the length of the cavity in the nozzle of an ink jet device, we have gained insight into the physical phenomena underlying the operation of such a device. It is concluded that drop-on-demand ink jet phenomena are related to the propagation and reflection of acoustic waves within the ink jet cavity. A simple analysis is carried out on the basis of linear acoustics which is in good agreement with the experimental observations.
Interaction design concepts for a mobile personal assistant
Authors: Stacey F. Nagata, Herre van Oostendorp, Mark A. Neerincx
Venue: Proceedings of the conference on Dutch directions in HCI (2004)

The Personal Assistant for onLine Services (PALS) project aims to develop an intelligent interface that facilitates efficient user interaction through personalization and context awareness with commerce web sites on a handheld device. The types of assistance services and interaction support represented by a mobile personal assistant have been investigated in the PALS project. Scenario Based Design was used to develop the PALS framework for the personal assistance services, generic scenarios and a usage model. The service concepts (e.g. direct, solicited, non-solicited, independent) characterize interaction between the user and virtual assistant during mobile web tasks. The generic scenarios and usage model aid to develop design and interaction of the PALS interface. A theme of "personal customer support" through an attentive interactive display can aid user acceptance of mobile web task assistance.
Stabilizability of Stochastic Linear Systems with Finite Feedback Data Rates
Authors: Girish N. Nair, Robin J. Evans
Venue: SIAM Journal on Control and Optimization (2004)

Feedback control with limited data rates is an emerging area which incorporates ideas from both control and information theory. A fundamental question it poses is how low the closed-loop data rate can be made before a given dynamical system is impossible to stabilize by any coding and control law. Analogously to source coding, this defines the smallest error-free data rate sufficient to achieve "reliable" control, and explicit expressions for it have been derived for linear time-invariant systems without disturbances. In this paper, the more general case of finite-dimensional linear systems with process and observation noise is considered, the object being mean square state stability. By inductive arguments employing the entropy power inequality of information theory, and a new quantizer error bound, an explicit expression for the infimum stabilizing data rate is derived, under very mild conditions on the initial state and noise probability distributions.
Implementation of the CIM Policy Model Using PONDER
Venue: Proceedings of the Fifth IEEE International Workshop on Policies for Distributed Systems and Networks (2004)

New work on the Distributed Management TaskForce's CIM Policy Model emphasizes the definition ofgeneral event-condition-action semantics. Thesesemantics are conveyed in an abstracted fashion,independent of any policy language or implementation.This approach allows vendor flexibility in designingpolicy writing tools and in choosing policy languagesand implementations. Also, it allows products tocommunicate their policy rules in an interoperable andsemantically rich manner. This short paper overviewsthe CIM Policy Model's approach and how it maps, viaan example, onto the PONDER policy language,developed at Imperial College, London.
On performance bounds for the integration of elastic and adaptive streaming flows
Authors: Thomas Bonald, Alexandre Proutière
Venue: Proceedings of the joint international conference on Measurement and modeling of computer systems (2004)

We consider a network model where bandwidth is fairly shared by a dynamic number of elastic and adaptive streaming flows. Elastic flows correspond to data transfers while adaptive streaming flows correspond to audio/video applications with variable rate codecs. In particular, the former are characterized by a fixed size (in bits) while the latter are characterized by a fixed duration. This flow-level model turns out to be intractable in general. In this paper, we give performance bounds for both elastic and streaming traffic by means of sample-path arguments. These bounds present the practical interest of being insensitive to traffic characteristics like the distributions of elastic flow size and streaming flow duration.
Safety Optimization: A Combination of Fault Tree Analysis and Optimization Techniques
Authors: Frank Ortmeier, Wolfgang Reif
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

We present a new form of quantitative safety analysis - safety optimization.This method is a combination of faulttree analysis (FTA) and mathematical optimization techniques. With the use of the results of FTA, statistics, and a quantification of the costs of hazards, it allows to find theoptimal configuration of a given system with respect to opposed safety requirements. Furthermore, the system maynot only be examined for safety, but usability as well.We illustrate this method on a real-world case study: theheight control system of the Elbtunnel in Hamburg. Safetyoptimization showed some significant problems in trustworthiness of the system,yielded optimal values for configuration of free parameters and showed possible modificationsto improve the system.
Implementing tool support for box structures
Authors: B. S. Tagg
Venue: IBM Systems Journal (1990)

This paper describes a feasibility study to implement partial tool support for the graphical component of the box structure methodology (BSM). By following the defined strategy and process, an existing computer-aided software engineering (CASE) environment has been extended with a customizer to provide support for the box definition graphics (BDG) component of BSM. The critical functions required from a CASE environment are also described to provide the reader with a background for selecting one of the various implementations available today.
Sponsors and Patrons
Venue: Proceedings of the 12th IEEE International Workshop on Program Comprehension (2004)

list-exhib
A novel FPGA local interconnect test scheme and automatic TC derivation/generation
Authors: Xiaoling Sun, K. Ogden, H. Chan, P. Trouborst
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2004)

This paper presents a novel local interconnect testing scheme for field programmable gate arrays (FPGAs). To maximize parallel testing, error-detecting code is used for testing one portion of interconnects and functional test of D latch for another in a test configuration (TC). A polynomial run time algorithm is introduced for deriving a minimal set of TCs. An in-house CAD tool is developed to automate the generation of device configurations from the set of TCs.
Predicting consumer intentions to use on-line shopping: the case for an augmented technology acceptance model
Authors: Leo R. Vijayasarathy
Venue: Information and Management (2004)

Derived from the theory of reasoned action, the technology acceptance model (TAM) focuses on two specific salient beliefs-- ease of use and usefulness. It has been applied in the study of user adoption of different technologies, and has emerged as a reliable and robust model. However, this has not discouraged researchers from incorporating additional constructs to the original model in their quest for increased predictive power. Here, an attempt is made in the context of explaining consumer intention to use on-line shopping. Besides ease of use and usefulness, compatibility, privacy, security, normative beliefs, and self- efficacy are included in an augmented TAM. A test of this model, with data collected from 281 consumers, show support for seven of nine research hypotheses. Specifically, compatibility, usefulness, ease of use, and security were found to be significant predictors of attitude towards on-line shopping, but privacy was not. Further, intention to use on-line shopping was strongly influenced by attitude toward on-line shopping, normative beliefs, and self-efficacy.
Towards Behavioral Synthesis of Asynchronous Circuits - An Implementation Template Targeting Syntax Directed Compilation.
Authors: S. F. Nielsen, J. Sparso, J. Madsen
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

This paper presents a method for behavioral synthesis of asynchronous circuits.Our approach aims at providing a synthesis flow which is very similar to what is found in existing synchronous design tools.We adapt the synchronous behavioral synthesis abstraction into the asynchronous handshake domain by introducing a computation model, which resembles the synchronous datapath and control architecture, but which is completely asynchronous.The datapath and control architecture is then expressed in the Balsa-language, and using syntax directed compilation a corresponding handshake circuit implementation is produced.The paper also reports area, speed and power figures for a couple of benchmark circuits, which have been synthesized to layout.
Hidden Credentials
Authors: Jason E. Holt, Robert W. Bradshaw, Kent E. Seamons, Hilarie Orman
Venue: Proceedings of the 2003 ACM workshop on Privacy in the electronic society (2003)

Hidden Credentials are useful in situations where requests for service, credentials, access policies and resources are extremely sensitive. We show how transactions which depend on fulfillment of policies described by monotonic boolean formulae can take place in a single round of messages. We further show how credentials that are never revealed can be used to retrieve sensitive resources.
Information-theoretic tools for mining database structure from large data sets
Authors: Periklis Andritsos, Renée J. Miller, Panayiotis Tsaparas
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

Data design has been characterized as a process of arriving at a design that maximizes the information content of each piece of data (or equivalently, one that minimizes redundancy). Information content (or redundancy) is measured with respect to a prescribed model for the data, a model that is often expressed as a set of constraints. In this work, we consider the problem of doing data redesign in an environment where the prescribed model is unknown or incomplete. Specifically, we consider the problem of finding structural clues in an instance of data, an instance which may contain errors, missing values, and duplicate records. We propose a set of information-theoretic tools for finding structural summaries that are useful in characterizing the information content of the data, and ultimately useful in data design. We provide algorithms for creating these summaries over large, categorical data sets. We study the use of these summaries in one specific physical design task, that of ranking functional dependencies based on their data redundancy. We show how our ranking can be used by a physical data-design tool to find good vertical decompositions of a relation (decompositions that improve the information content of the design). We present an evaluation of the approach on real data sets.
A vision-based system for automatic growing ring detection and measurement
Authors: C. Vaz, P. Carvalho, F. Duarte, A. Dourado
Venue: Computers and Industrial Engineering (2004)

An automatic visual inspection system for wood growing ring identification and measurement is described. Given the irregular contrast distributions in wood samples, the identification of these elements is not straightforward. Furthermore, it is observed that many rings exhibit very narrow widths. To overcome these problems, several new methods are introduced, namely at the local image scale definition and at the image segmentation levels. First, local scales are automatically computed and applied for ring center identification. This information is then used to reconstruct the noisy image signal, which is segmented using a local minimum distance-minimum cross-entropy principle. The system uses a reduced and intuitive set of user defined parameters; for this reason, it is easy to tune.
Adaptive java optimisation using instance-based learning
Authors: Shun Long, Michael O'Boyle
Venue: Proceedings of the 18th annual international conference on Supercomputing (2004)

This paper describes a portable,machine learning-based approach to Java optimisation. This approach uses an instance-based learning scheme to select good transformations drawn from Pugh 's Unified Transformation Framework [11]. This approach was implemented and applied to a number of numerical Java benchmarks on two platforms. Using this scheme, we are able to gain over 70% of the performance improvement found when using an exhaustive iterative search of the best compiler optimisations. Thus we have a scheme that gives a high level of portable performance without any excessive compilations.
On the Interaction Between Power-Aware FPGA CAD Algorithms
Authors: Julien Lamoureux, Steven J. E. Wilton
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

As Field-Programmable Gate Array (FPGA) power consumptioncontinues to increase, lower power FPGA circuitry, architectures,and Computer-Aided Design (CAD) tools need to be developed.Before designing low-power FPGA circuitry, architectures, orCAD tools, we must first determine where the biggest savings (interms of energy dissipation) are to be made and whether thesesavings are cumulative. In this paper, we focus on FPGA CADtools. Specifically, we describe a new power-aware CAD flow forFPGAs that was developed to answer the above questions.Estimating energy using very detailed post-route power and delaymodels, we determine the energy savings obtained by our power-awaretechnology mapping, clustering, placement, and routingalgorithms and investigate how the savings behave when thealgorithms are applied concurrently. The individual savings of thepower-aware technology-mapping, clustering, placement, androuting algorithms were 7.6%, 12.6%, 3.0%, and 2.6%respectively. The majority of the overall savings were achievedduring the technology mapping and clustering stages of the power-awareFPGA CAD flow. In addition, the savings were mostlycumulative when the individual power-aware CAD algorithmswere applied concurrently with an overall energy reduction of 22.6%.
Comparison of delivery architectures for immersive audio in crowded networked games
Authors: Paul Boustead, Farzad Safaei
Venue: Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video (2004)

This paper examines appropriate network and server infrastructures for the provision of a realistic audio scene from the perspective of avatars in large-scale virtual environments. The audio scene of each avatar combines the voices and other sources of sound in the vicinity of the avatar, spatially placed, attenuated according to distance from the listener, and addition of sound effects to reflect the acoustic characteristics of the environment. We examine a range of delivery options including central-server, peer-to-peer with and without multicast, distributed proxies, distributed locale servers, and a hybrid model. We provide numerical results on the effect of different virtual world characteristics such as avatar density, hearing range, and correlation between the positions in the virtual and physical worlds. We compare delivery architectures based on a set of delay metrics aimed at measuring the interactive delay between avatars as well as accuracy of the scene. We make several recommendations on scalable implementation of such applications.
Working in Pairs as a Means for Design Knowledge Building: An Empirical Study
Venue: Proceedings of the 12th IEEE International Workshop on Program Comprehension (2004)

Pair programming is increasingly attractingresearchers' and practitionersý attention. One of theclaimed benefits of pair programming consists of easingsocialization among programmers, with the effect oftransferring tacit knowledge. Designing software systemsrequires a strong employment of tacit knowledge, such asindividual experience and skills.In this paper We explore the hypothesis that workingin pairs can speed up and enforce the knowledge buildingprocess among designers. We name "pair designing" theapplication of pair programming concepts to the designstage. An experiment has been performed to test the effectof pair designing on knowledge building. This paperdiscusses preliminary results, which confirm thehypothesis of a positive effect of working in pairs on theprocess of knowledge building.
Incremental and effective data summarization for dynamic hierarchical clustering
Authors: Samer Nassar, Jörg Sander, Corrine Cheng
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

Mining informative patterns from very large, dynamically changing databases poses numerous interesting challenges. Data summarizations (e.g., data bubbles) have been proposed to compress very large static databases into representative points suitable for subsequent effective hierarchical cluster analysis. In many real world applications, however, the databases dynamically change due to frequent insertions and deletions, possibly changing the data distribution and clustering structure over time. Completely reapplying both the data summarization and the clustering algorithm to detect the changes in the clustering structure and update the uncovered data patterns following such deletions and insertions is prohibitively expensive for large fast changing databases. In this paper, we propose a new scheme to maintain data bubbles incrementally. By using incremental data bubbles, a high-quality hierarchical clustering is quickly available at any point in time. In our scheme, a quality measure for incremental data bubbles is used to identify data bubbles that do not compress well their underlying data points after certain insertions and deletions. Only these data bubbles are re-built using efficient split and merge operations. An extensive experimental evaluation shows that the incremental data bubbles provide significantly faster data summarization than completely re-building the data bubbles after a certain number of insertions and deletions, and are effective in preserving (and in some cases even improving) the quality of the data summarization.
Web Searching and Information Retrieval
Authors: Jaroslav Pokorny
Venue: Computing in Science and Engineering (2004)

The first Web information services were based on traditional information retrieval (IR) algorithms and techniques. However, IR algorithms were developed for smaller and more coherent collections than the Web is. Thus Web searching requires new techniques--exploiting linkage among Web pages or extensions of the old ones, for example. This article offers an overview of today's search engine architectures and techniques in the context of IR. The authors introduce three such architectures and describe their basic components. Then they discuss the most important feature of each Web search process: page importance and its use in retrieval. Some issues and challenges in Web search engines also are summarized as well as considerations on the future of Web searching in terms of the so-called Semantic Web.
Croquet: A Menagerie of New User Interfaces
Authors: David A. Smith, Andreas Raab, David P. Reed, Alan Kay
Venue: Proceedings of the Second International Conference on Creating, Connecting and Collaborating through Computing (2004)

A new architecture like Croquet presents numerousopportunities and challenges to create useful interfaces toenable access to the underlying power of the system. Inparticular, our focus on an integrated 2D and 3D systemensures that we have a rich intellectual environment withinwhich to explore. This experience is similar to thedevelopment of the original modern windowing userinterface created by Alan Kay, his team at Xerox Parc, andhis Squeak team[3,4]. Just as those teams did, we also havean infrastructure that is rich enough to allow us to performsome deep exploration into the presentation andmanipulation of rich media expressed in 3D, and in thenegotiations through these rich media worlds.A number of key technologies will be discussed includingdynamic movable portals, floating 3D windows, true 3Dcreation tools, live teleporting snapshots, and completelynew concepts such as 3D portals.
A preliminary experiment in automated software testing
Authors: Jeoff Benson
Venue: ACM SIGSOFT Software Engineering Notes (1981)

If a method were discovered for automatically testing computer programs for errors, software development costs could be substantially reduced. This paper describes an experiment performed as part of an effort to develop such a method.The approach is to insert in the program to be tested a number of "executable assertions," statements about the program that trigger error signals whenever they are evaluated to be false (violated). Test cases are developed by systematically selecting values for the input variables of the program. When the program is run, a plot is generated of the number of assertions violated versus the values of the input variables. The resulting function is termed an "error function" and the range of the function is called the "error space" of the program. Maximum values of the error function correspond to input variables which cause the most errors to occur in the program. The value of the error function indicates whether the program executed successfully without the need of examining the output of the program in detail.In the experiment, a program was tested using this technique. The results showed that the error function did not contain singularities and was well-behaved. The technique also revealed an error in the test program which had not been discovered in previous testing. These results indicate that it may be possible to apply standard techniques for maximizing functions in order to locate the values in a program's input space which cause the most errors to occur. A major unresolved problem however is the development of assertions which accurately describe the desired behavior of the program under test.