ppxscal/embedding_network huggingface dataset:
Supporting information awareness using animated widgets
Authors: D. Scott McCrickard, Q. Alex Zhao
Venue: Proceedings of the 7th conference on USENIX Tcl/Tk - Volume 7 (2000)

This paper describes a Tcl/Tk widget set extension that supports three animated behaviors: fading, tickering, and rolling. This extension is targeted for use in information awareness applications that monitor and communicate constantly changing information. Described is the programming interface for the widgets as well as the design decisions made in creating them and programs that use them. Introduced in the description are two new techniques called automatic markups and history-based shadowing, highlighting techniques used to identify and communicate the nature of the changes.
Self-organization in large-scale wireless networks
Authors: James Kurose, Donald Towsley
Venue:  (2006)

Large-scale wireless networks such as ad-hoc networks and sensor networks have attracted considerable attention in the last few years, both in academia and industry. One of the main reasons for their popularity can be attributed to the various applications that they make possible. Habitat monitoring, environmental observation and forecasting, organ and health monitoring and target tracking are just a few examples of the many applications of such wireless networks. A characteristic requirement of these wireless networks is that they be "self-organizing" i.e., the wireless nodes organize themselves in order to efficiently perform the tasks required by the application. Self-organizing networks are attractive since they do not require human intervention and thereby reduce the cost of installation. In this thesis, we consider several tasks that arise commonly in the process of self-organization of a wireless ad hoc network, viz. topology formation, power control and leader election. We first consider the problem of neighbor discovery in wireless networks, the first step in bootstrapping a wireless network. We propose probabilistic algorithms that allow nodes to rapidly discover their neighbors, thereby expending less energy during neighbor discovery. In the second part of our thesis, we focus our attention on techniques to reduce the energy consumption of a wireless network. In particular, we consider the problem of optimal power assignment in wireless networks with transmitter-receiver tradeoffs. In these networks, the transmitter power can be increased to reduce the receiver power and consequently, the overall power consumption. We propose algorithms to assign power to nodes so that the lifetime of the network is maximized. Another aspect of self-configuration that arises frequently in wireless networks is the problem of leader election amongst a set of nodes. Arbitrary topological changes caused by node movement makes this problem significantly challenging. In the final part of this thesis, we propose a provably correct and highly efficient leader election algorithm that can tolerate arbitrary topological changes caused due to node movement.
Model selection: a bootstrap approach
Authors: A. M. Zoubir
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

The problem of model selection is addressed (in a signal processing framework). Bootstrap methods based on residuals are used to select the best model according to a prediction criterion. Both the linear and the nonlinear models are treated. It is shown that bootstrap methods are consistent and in simulations that in most cases they outperform classical techniques such as Akaike's (1974) information criterion and Rissanen's (1983) minimum description length. We also show how the methods apply to dependent data models such as autoregressive models.
Semantic Web 2.0
Authors: Mark Greaves
Venue: IEEE Intelligent Systems (2007)

The Web 2.0 phenomena is poised to set the creative tone for software developers for years. It could even become a technology wave--one that the Semantic Web would do well to catch.
Requirements for coordinated multiple view visualization systems for industrial applications
Authors: Anton Heijs
Venue: Proceedings of the Fifth International Conference on Coordinated and Multiple Views in Exploratory Visualization (2007)

In this paper we discuss the importance of commercial visualization application development on the progress of research on coordinated multiple view visualization techniques. There is a need for scalable infovis visualization solutions which is in fact the need to control the growing complexity in business data sets. The CMV visualization systems users need solutions which bring insight the complexity of their data. The progress in CMV visualization will be determined by the effort companies put in these problems to help clients with business data in combination with their collaboration with the CMV researchers at the universities.
Genetic algorithm approach to nonlinear blind source separation
Authors: F. Rojas, C. G. Puntonet, I. Rojas, J. Ortega, A. Prieto
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper proposes the fusion of two important paradigms, Genetic Algorithms and the Blind Separation of Sources in Nonlinear Mixtures (GABSS). Although the topic of BSS, by means of various techniques, including ICA, PCA, and neural networks, has been amply discussed in the literature, the possibility of using genetic algorithms has not been explored thus far. However, in Nonlinear Mixtures, optimization of the system parameters and, especially, the search for invertible functions is very difficult due to the existence of many local minima. From experimental results, this paper demonstrates the possible benefits offered by GAs in combination with BSS, such as robustness against local minima, the parallel search for various solutions, and a high degree of flexibility in the evaluation function.
Gerald Jay Sussman: Designing for Applications Unanticipated by the Designer
Authors: Gerald Jay Sussma
Venue: Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems (2007)

It is hard to build robust systems: systems that have acceptable behavior over a larger class of situations than was anticipated by their designers. The most robust systems are evolvable: they can be easily adapted to new situations with only minor modification. How can we design systems that are flexible in this way?
Out-of-head sound localization using adaptive inverse filter
Authors: T. Horiuchi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

It is well known that the transfer functions for out-of-head sound localization differ with the listener. Our goal is to find a method that easily realizes excellent sound localization without measuring the individual transfer functions. This paper proposes an out-of-head sound localization system that uses adaptive inverse filtering without any measuring preprocesses. This system estimates the inverse ear canal transfer function (ECTF), and can adaptively obtain the transfer function to fit the listener in real-time. This paper also proposes an adaptive inverse filtering method for out-of-head sound localization that differs from the filtered-x method. In addition, the relationship between convergence time and initial value is assessed. It is clarified that the proposed method is more effective, in terms of convergence, if the initial value is the average of many listeners' impulse responses.
Aesthetic Primitives of Images for Visualization
Authors: Gabriele Peters
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

Images play an important role in visualization. As users are more willing to adopt a product if it evokes pleasurable feelings the aesthetic appeal of interfaces becomes more important. Thus, there is a growing need to generate also images which appear aesthetically to the user. Starting with the modularities of the human visual system, we derive six dimensions of visual aesthetics. For each dimension we explore, inspired by principles of the visual arts and insights of cognitive neuroscience, which pecularities of the dimensions are particularly adequate for an aesthetic impression. Accompanied by a fair number of image examples, these considerations result in an easy to understand guideline for computer scientists and interface designers how to deal with images in terms of aesthetics.
Experiments in Planar Haptic Contour Exploration
Authors: Kee-Yip Chan, Kelly Kitagawa, Roberto Manduchi
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

We present some experimental results concerning exploration of planar contours (more specifically, polygons) using a 2-D haptic device, the Logitech Wingman mouse. With respect to previous work, our project focused on improving the contour tracing experience using the effects provided by the Immersion TouchSense API.
An Algorithm for Inversion in GF(2^m) Suitable for Implementation Using a Polynomial Multiply Instruction on GF(2)
Authors: Katsuki Kobayashi, Naofumi Takagi, Kazuyoshi Takagi
Venue: Proceedings of the 18th IEEE Symposium on Computer Arithmetic (2007)

An algorithm for inversion in GF(2m) suitable for implementation using a polynomial multiply instruction on GF(2) is proposed. It is based on the extended Euclid's algorithm. In the algorithm, operations corresponding to several contiguous iterations of the VLSI algorithm proposed by Brunner et al. is represented as a matrix. They are calculated at once through the matrix efficiently by means of a polynomial multiply instruction on GF(2). For example, in the case where the word size of a processor and m are 32 and 571, respectively, the algorithm calculates inversion with about the half number of instructions of the conventional algorithm on the average.
Organizational Assimilation of Vertical Standards: An Integrative Model
Authors: Ruben A. Mendoza, T. Ravichandran
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Vertical standards are complex networked technologies whose assimilation is subject to extensive interorganizational dependence and network effects. Classical theories of diffusion of technological innovation cannot sufficiently explain their assimilation without taking community-level effects into account. This paper introduces a two-level model of organizational assimilation of vertical standards which extends diffusion of innovations theory by including network effects. It combines the most consistently significant firm-level variables from diffusion of innovations with community-level variables subject to network effects. Results of a large-scale empirical test of the model in the insurance, reinsurance, and related financial services industries are presented. The test is the first of its kind in the growing vertical standards literature. The model is strongly supported and confirms the value of integrative approaches employing variables at both the firm and community levels.
Cyberinfrastructure for the humanities and social sciences: advancing the humanities research agenda
Authors: Joyce Ray, Clifford Lynch, Brett Bobley, Gregory Crane, Steven Wheatley
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

In 2006 the American Council of Learned Societies (ACLS) released Our Cultural Commonwealth, the final report of the Commission on Cyberinfrastructure for the Humanities and Social Sciences. The report, based on a study funded by the Mellon Foundation, explored how research environments might be created for the humanities and social sciences to complement those being developed to support scientific research. The report includes key recommendations addressed to universities, funding agencies, scholarly societies, academic libraries, publishers, Congress, state legislatures, and others. Implementation of the recommendations could potentially transform scholarship and exponentially increase access to resources and new scholarship in the humanities and social sciences. But the report has not been universally embraced. How will humanities scholarship be advanced by new technologies and research practices, and how will the academic community recognize new forms of scholarship? How will funding agencies respond to the challenges and issues raised? What does cyberinfrastructure mean for different domains within the humanities? These questions will be addressed by panelists and discussed by participants.
Speech recognition using temporally connected kernels in mixture density hidden Markov models
Authors: P. Somervuo
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

A method is presented for speeding up the performance of the HMM based speech recognition system where the states are modeled by a large number of Gaussian kernels. The emission probabilities of the states are usually dominated by the nearest Gaussians to the input vector. The speedup is gained without deteriorating the recognition accuracy by concentrating on these kernels in the reduced K-best-kernel search. In this work, the time information of the input is encoded to the connections of the kernels. The search for the dominating kernels is then performed along the kernel connections which model the trajectories of the speech in the feature space. In the experiments, speaker-dependent speech recognizers were trained for ten speakers. The number of distance computations between feature vectors and kernel mean vectors was reduced 75% without increasing the average phoneme recognition error, which was 5.7% for the baseline system.
Affine precoders for reliable communications
Authors: J. H. Manton
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

It is known that precoding a signal prior to its transmission through an unknown finite impulse response channel facilitates the equalisation of the channel. Moreover, since linear precoders spread the spectrum, the equalisation process mitigates the effects of channel spectral nulls caused by frequency selective fading. This paper argues that certain affine precoders are more efficient than linear precoders. Here, the efficiency of a precoder is a measure of its ability to enable the receiver to recover the source signal relative to the amount of redundancy introduced by the precoder. An efficient affine precoder is heuristically derived and simulations used to demonstrate that it is superior to both the traditional training sequence method and the filter bank precoding scheme. This precoding and equalisation scheme naturally extends to time varying channels.
Design and Evaluation of a Multiprocessor Architecture with Decentralized Control
Authors: Hsiao-chen Chung, Chuan-lin Wu, James Rakes, Peter J. Zievers, Yin-Kuan Lin
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

This paper presents design and evaluation of a decentralized control mechanism of a variable-topology (phase-reconfigurable) multiprocessor architecture. We design and implement an active crossbar communication processor(XCP) which encodes a set of communication instructions. The new interconnection network approach provides an apt phase-reconfiguration method. The new method is distributed in nature and does not require a global control bus that is a time consuming feature as verified in many existing systems. A conjugate-gradient algorithm for solving a linear system equations is used to perform evaluation and comparison.
Adaptive realization of a maximum likelihood time delay estimator
Authors: P. J. Hahn
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

This paper presents an adaptive maximum likelihood method for estimating the time difference of arrival of a source signal at two spatially separate sensors. It is well-known that the maximum likelihood technique achieves the Cramer-Rao lower bound for time delay estimation error for certain signal conditions. The /spl alpha/-/spl beta/ tracker is a heuristic mechanism that is heavily used in target tracking applications. In this work, we combine an adaptive realization of the maximum likelihood time delay estimator with the /spl alpha/-/spl beta/ tracker to obtain significant improvement in the performance of the tracker, Experimental results showing 2 to 8 dB improvement in the mean-square estimation error over the conventional /spl alpha/-/spl beta/ tracker for various signal-to-noise ratios are also included in the paper.
Lessons learned on using adaptive devices for the disabled to teach design
Authors: R. Culver, D. Scudder
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

At FIE94, the authors describe their first efforts at using the design and construction of devices for the disabled as the focal point for a junior-level Mechanical Engineering design course. This program has been expanded to include senior capstone projects and summer support for two undergraduates to work on extended projects. The construction costs of the projects have been funded through an NSF REU grant. In this paper the authors will describe projects which students have undertaken to illustrate the problems and potential of assistive technology as the source of design projects. Sources of information and networking through RESNA, the Center for Assistive Technology, and NSF will be given. There is a great satisfaction in providing a device for someone who cannot find an affordable solution to his/her problem. But these projects are not without their problems. Each project is a lesson for the students, as well as the instructor on effective design and project management. For the instructor the lesson is how to design and manage a course to teach design.
Development of a Conceptual Framework for Managing Identity Fraud
Authors: Rodger Jamieson, Donald Winchester, Stephen Smith
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This paper builds a conceptual identity fraud enterprise management framework. The model is constructed through analysis and synthesis of models from academic literature, reports by industry professionals, and grounded through interviews with Australian-based industry experts. Models identified include, cost of identity fraud, identity and identity fraud risk management, identity fraud profiling, fraud risk management, accounting and auditing, corporate and internal fraud, computing abuse, and e-fraud prevention. The proposed framework's strengths include, robust stages within anticipatory, reactionary and remediation phases, and covers internal and external crimes, including traditional (offline) and electronic (online) crimes. The stages are well defined, comprehensive, encourage teamwork, are scaleable and reflective to permit learning and change to be incorporated to minimize identity fraud and related crimes.
Guest Editors' Introduction: Human-Centered Computing--Toward a Human Revolution
Authors: Alejandro Jaimes, Daniel Gatica-Perez, Nicu Sebe, Thomas S. Huang
Venue: Computer (2007)

Human-centered computing studies the design, development, and deployment of mixed-initiative human-computer systems. HCC is emerging from the convergence of multiple disciplines that are concerned both with understanding human beings and with the design of computational artifacts.
A View-Based Methodology for Collaborative Ontology Engineering: An Approach for Complex Applications (VIMethCOE)
Authors: E. Jimenez-Ruiz, R. Berlanga
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

The development of very large ontologies may involve several domain experts, ontology engineers and final users, all with very different objectives. New scenarios like biomedicine, genomics and biology require methodologies that consider new dimensions in the development process, namely: dynamism, distribution and control. Existing works lack some important aspects with respect to these dimensions. In this paper we propose a view-based methodology for the collaborative, distributed and modular development of large ontologies, which achieves the identified requirements for the proper evolution and use of very large ontologies.
Tiers of webOrigami Programming
Authors: Tetsuo Ida
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

The world wide web is an important knowledge repository for our daily activities, and moreover it is transforming itself to service repository. Many scientists not only publish their results on the web but offer services that accrue from their scientific discoveries and inventions. The webOrigami, under development by SCORE at University of Tsukuba, is one such science service portal that offers services to interested mathematicians and origamists. Its aim is to help them to explore the possibilities of computational origami as well as enjoying the origami art. In this talk I will present the current state of the development of the system, talking about technical problems that we encounters and solutions we came up with.
Predicting Defects and Changes with Import Relations
Authors: Adrian Schroter
Venue: Proceedings of the Fourth International Workshop on Mining Software Repositories (2007)

Lowering the number of defects and estimating the development time of a software project are two important goals of software engineering. To predict the number of defects and changes we train models with import relations. This enables us to decrease the number of defects by more efficient testing and to assess the effort needed in respect to the number of changes.
Sketching unaggregated data streams for subpopulation-size queries
Authors: Edith Cohen, Nick Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
Venue: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2007)

IP packet streams consist of multiple interleaving IP flows. Statistical summaries of these streams, collected for different measurement periods, are used for characterization of traffic, billing, anomaly detection, inferring traffic demands, configuring packet filters and routing protocols, and more. While queries are posed over the set of flows, the summarization algorithmis applied to the stream of packets. Aggregation of traffic into flows before summarization requires storage of per-flow counters, which is often infeasible. Therefore, the summary has to be produced over the unaggregated stream. An important aggregate performed over a summary is to approximate the size of a subpopulation of flows that is specified a posteriori. For example, flows belonging to an application such as Web or DNS or flows that originate from a certain Autonomous System. We design efficient streaming algorithms that summarize unaggregated streams and provide corresponding unbiased estimators for subpopulation sizes. Our summaries outperform, in terms of estimates accuracy, those produced by packet sampling deployed by Cisco's sampled NetFlow, the most widely deployed such system. Performance of our best method, step sample-and-hold is close to that of summaries that can be obtainedfrom pre-aggregated traffic.