ppxscal/embedding_network huggingface dataset:
The DJammer: "air-scratching" and freeing the DJ to join the party
Authors: April Slayden, Mirjana Spasojevic, Mat Hans, Mark Smith
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Traditional Disc Jockeys use vinyl records and turntables to manipulate music in real time. We describe the development of the DJammer, a new device that enables its users to manipulate digital music using a portable handheld sensor. In addition to the standard actions offered by most portable digital music players, the DJammer provides its users with control capabilities previously offered only through the use of turntables. Using the DJammer, DJs can "air-scratch" digital music via simple hand motions similar to those used when scratching vinyl records, fade the music, and jump to a predefined position within the song using a wireless sensor designed to fit in the DJ's hand. The preliminary study of the device by experienced DJs suggests that it can play a role as an accessory to their professional equipment, freeing them to step away from their consoles during the performance and uncovering opportunities for creativity and personalization.
Optimizing 10-Gigabit Ethernet for Networks of Workstations, Clusters, and Grids: A Case Study
Authors: Wu-chun Feng, Justin (Gus) Hurwitz, Harvey Newman, Sylvain Ravot, R. Les Cottrell, Olivier Martin, Fabrizio Coccetti, Cheng Jin, Xiaoliang (David) Wei, Steven Low
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

This paper presents a case study of the 10-Gigabit Ethernet (10GbE) adapter from Intel R . Specifically, with appropriate optimizations to the configurations of the 10GbE adapter and TCP, we demonstrate that the 10GbE adapter can perform well in local-area, storage-area, system-area, and wide-area networks. For local-area, storage-area, and system-area networks in support of networks of workstations, network-attached storage, and clusters, respectively, we can achieve over 7-Gb/s end-to-end throughput and 12-µs end-to-end latency between applications running on Linux-based PCs. For the wide-area network in support of grids, we broke the recently-set Internet2 Land Speed Record by 2.5 times by sustaining an end-to-end TCP/IP throughput of 2.38 Gb/s between Sunnyvale, California and Geneva, Switzerland (i.e., 10,037 kilometers) to move over a terabyte of data in less than an hour. Thus, the above results indicate that 10GbE may be a cost-effective solution across a multitude of computing environments.
An Outer Approximation Method for the Variational Inequality Problem
Authors: R. S. Burachik, J. O. Lopes, B. F. Svaiter
Venue: SIAM Journal on Control and Optimization (2005)

We study two outer approximation schemes, applied to the variational inequality problem in reflexive Banach spaces. First we propose a generic outer approximation scheme, and its convergence analysis unifies a wide class of outer approximation methods applied to the constrained optimization problem. As is standard in this setting, boundedness and optimality of weak limit points are proved to hold under two alternative conditions: (i) boundedness of the feasible set, or (ii) coerciveness of the operator. To develop a convergence analysis where (i) and (ii) do not hold, we consider a second scheme in which the approximated subproblems use a coercive approximation of the original operator. Under conditions alternative to both (i) and (ii), we obtain standard convergence results. Furthermore, when the space is uniformly convex, we establish full strong convergence of the second scheme to a solution.
Parallel **-Matrix Arithmetics on Shared Memory Systems
Authors: R. Kriemann
Venue: Computing (2005)

**-matrices, as they were introduced in previous papers, allow the usage of the common matrix arithmetic in an efficient, almost optimal way. This article is concerned with the parallelisation of this arithmetics, in particular matrix building, matrix-vector multiplication, matrix multiplication and matrix inversion.Of special interest is the design of algorithms, which reuse as much as possible of the corresponding sequential methods, thereby keeping the effort to update an existing implementation at a minimum. This could be achieved by making use of the properties of shared memory systems as they are widely available in the form of workstations or compute servers. These systems provide a simple and commonly supported programming interface in the form of POSIX-threads.The theoretical results for the parallel algorithms are confirmed with numerical examples from BEM and FEM applications.
Coordinated Media Streaming and Transcoding in Peer-to-Peer Systems
Authors: Fang Chen, Thomas Repantis, Vana Kalogeraki
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

In this paper we study the problem of multimedia streaming and transcoding in P2P systems. We propose a multimedia streaming architecture in which transcoding services coordinate to transform the streaming data into different formats and adapt to both the QoS requirements of the applications and to the availability of the system resources. Our techniques are entirely distributed, use only local knowledge and scale well with the size of the system. Extensive simulation results validate the performance of our approach.
The Radial Trifocal Tensor: A Tool for Calibrating the Radial Distortion of Wide-Angle Cameras
Authors: SriRam Thirthala, Marc Pollefeys
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We present a technique to linearly estimate the radial distortion of a wide-angle lens given three views of a real-world plane. The approach can also be used with pure rotation as in this case all points appear as lying on a plane. The three views can even be recorded using three different cameras as long as the deviation from the pin-hole model for each camera is distortion along radial lines. We introduce the 1D radial camera which projects scene points onto radial lines and the radial trifocal tensor which encodes the multi-view relations between radial lines. Given at least seven triplets of corresponding points the radial tri-focal tensor can be computed linearly. This allows recovery of the radial cameras and the projective reconstruction of the plane up to a two-fold ambiguity. This 2D reconstruction is unaffected by radial distortion and can be used in different ways to compute the radial distortion parameters. We propose to use the division model as in this case we obtain a linear algorithm that computes the radial distortion coefficients and the 3 remaining degrees of freedom of the homography relating the reconstructed 2D plane to the undistorted image. Each feature point that has at least one corresponding point yields one linear constraint on those unknowns. Our method is validated on real-world images. We successfully calibrate several wide-angle cameras.
Modeling continuous changes of the user's dynamic behavior in the WWW
Authors: Raúl Peña-Ortiz, Julio Sahuquillo, Ana Pont, José A. Gil
Venue: Proceedings of the 5th international workshop on Software and performance (2005)

Understanding the characteristics of the users' workload is an important aspect when designing and providing web services. The majority of current workload characterization techniques introduce some limitations when representing the dynamism of the client behavior and the continuous changes in its role. This fact implies that the majority of the existing workload generators model these characteristics in a simple an improperly way. This paper focuses on the dynamism of WWW in general, and the new techniques to characterize the user behavior. Our work is addressed to develop a dynamic workload generator that considers the new behavior of the web clients, and the continuous changes in their role.
Development of a Universal Virtual Computer (UVC) for long-term preservation of digital objects
Authors: J. R. Van Der Hoeven, R. J. Van Diessen, K. Van Der Meer
Venue: Journal of Information Science (2005)

Emulation has been proposed as a preservation strategy for longevity of digital objects. An advantage of emulation is the relative platform independency. Emulation with a high degree of platform independency requires a Universal Virtual Computer (UVC), as described by Lorie. This paper describes the realization of the enhanced UVC developed for the National Library of the Netherlands. The preservation method of the UVC at preservation time and at retrieval time (in the future) is concisely described, the conceptual model of the UVC is given, and the object design and the logical data viewer of the UVC are presented. The UVC has been realized and proven to work for image types using the JPEG and GIF87a formats, although performance of the present UVC can still can be improved. The UVC demonstration tool is freely available at the Alphaworks web site to let the general public experience this approach on long-term access.
Message Scheduling for All-to-All Personalized Communication on Ethernet Switched Clusters
Authors: Ahmad Faraj, Xin Yuan
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

We develop a message scheduling scheme that can theoretically achieve the maximum throughput for all-to-all personalized communication (AAPC) on any given Ethernet switched cluster. Based on the scheduling scheme, we implement an automatic routine generator that takes the topology information as input and produces a customized MPI Alltoall routine, a routine in the Message Passing Interface (MPI) standard that realizes AAPC. Experimental results show that the automatically generated routine consistently out-performs other MPI Alltoall algorithms, including those in LAM/MPI and MPICH, on Ethernet switched clusters with different network topologies when the message size is sufficiently large. Thisdemonstrates the superiority of the proposed AAPC algorithm in exploiting network bandwidths.
Book review: THE T PROGRAMMING LANGUAGE A Dialect of LISP by Stephen Slade
Venue: Issue 103 (Jan., 1988) (1988)

The T language is a derivative of SCHEME LISP, intended to be used for teaching T to individuals who have some programming background in languages other than LISP. T was developed at the Yale University Computer Science Department and Artificial intelligence Project. The author cites several serious applications which have been written at Yale using T, including "text editors, circuit design tools, graphics editors, compilers, and numerous artificial intelligence programs." [Slade, p. 2] The author does not explain the reason for yet another dialect of LISP, except to extoll T's extensions of that language. As well as praise T, Slade offers code to enable users of Common LISP and SCHEME to create an imitation of T. Several avenues are outlined for obtaining T on a number of popular computers, also, including ARPANET addresses. 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
Research at Stanford University
Authors: S. Jerrold Kaplan
Venue: Issue 79 (January 1982) (1982)

Support and Personnel: Research in Computational Linguistics at Stanford is being carried out in the context of the Knowledge Base Management Systems (KBMS) project (Defense Advanced Research Projects Agency contracts MDA903-77-C-0322 and N000-39-80G-0132 Gio Wiederhold, Principal Investigator). The KBMS project is concerned with the application of Artificial Intelligence techniques to the design, performance, and use of database systems. Additional funding is provided by NSF Grant ISTRO-23889. Primary contributors are Jerry Kaplan (Research Associate), and students Jim Davidson, Francisco Corella, and Lena Yesil. Participants on a sub-contract to SRI International are Barbara Grosz, Norman Haas, and Daniel Sagalowicz.
Clustering via matrix powering
Authors: Hanson Zhou, David Woodruff
Venue: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2004)

Given a set of n points with a matrix of pairwise similarity measures, one would like to partition the points into clusters so that similar points are together and different ones apart. We present an algorithm requiring only matrix powering that performs well in practice and bears an elegant interpretation in terms of random walks on a graph. Under a certain mixture model involving planting a partition via randomized rounding of tailored matrix entries, the algorithm can be proven effective for only a single squaring. It is shown that the clustering performance of the algorithm degrades with larger values of the exponent, thus revealing that a single squaring is optimal.
A B.S. degree in informatics: contextualizing software engineering education
Authors: André van der Hoek, David Kay, Debra J. Richardson
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Software engineering (SE) is very different in focus from traditional computer science: it is not just about computers and software, but as much about the context in which they are used. This means we must teach about software and information, development and design, technical and social issues, while creating solutions as well as understanding and analyzing them. In effect, we must teach a discipline broader than SE or CS alone for SE education to be effective. At UC Irvine, we designed and now offer a program doing just this -- a four-year B.S. degree in Informatics. The major brings topics in SE together with human-computer interaction, computer-supported collaborative work, social analysis, and management, along with other application disciplines. Here, we discuss the philosophy behind the major, its structure, and the questions concerning SE education that the new major raises.
Designing and evaluating an active grid architecture
Authors: F. Bouhafs, J. P. Gelas, L. Lefèvre, M. Maimour, C. Pham, P. Vicat-Blanc Primet, B. Tourancheau
Venue: Future Generation Computer Systems (2005)

Today's computational grids are using the standard IP routing functionality, that has basically remained unchanged for 2 decades, considering the network as a pure communication infrastructure. With the grid's distributed system point of view, one might consider to extend the commodity Internet's basic functionalities. Higher value functionalities can thus be offered to computational grids. In this paper, we report on our early experiences in building application-aware components and in defining an active grid architecture that would bring the usage of computational grid to a higher level than it is now (mainly batch submission of jobs). To illustrate the potential of this approach, we first present how such application-aware components could be built and then some experiments on deploying enhanced communication services for the grid. We will show how reliable multicast and QoS mechanisms could deploy specific services based on the grid application needs.
Cache-Conscious Automata for XML Filtering
Authors: Bingsheng He, Qiong Luo, Byron Choi
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Hardware cache behavior is an important factor in the performance of memory-resident, data-intensive systems such as XML filtering engines. A key data structure in several recent XML filters is the automaton, which is used to represent the long-running XML queries in the main memory. In this paper, we study the cache performance of automaton-based XML filtering through analytical modeling and system measurement. Furthermore, we propose a cache-conscious automaton organization technique, called the hot buffer, to improve the locality of automaton state transitions. Our results show that (1) our cache performance model for XML filtering automata is highly accurate and (2) the hot buffer improves the cache performance as well as the overall performance of automaton-based XML filtering.
Improving User Comfort in Haptic Virtual Environments through Gravity Compensation
Authors: Renaud Ott, Mario Gutierrez, Daniel Thalmann, Frederic Vexo
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

Our experience with a Haptic Workstation¿ has shown that this device is uncomfortable to use during long sessions. The main reason is the uncomfortable posture of the arms, which must be kept outstretched horizontally while supporting the weight of an exoskeleton. We describeZero-G, a real-time weight compensation system aimed at improving user comfort by compensating for the weight of both the exoskeleton and arms (zero gravity illusion). We present experimental results complemented with electro myography measures (EMG) as an indicator of muscularactivity/fatigue. Our tests show how Zero-G exerts a positiveinfluence on the reduction of muscular fatigue when using a Haptic Workstation¿.
A Numerical Evaluation of Several Stochastic Algorithms on Selected Continuous Global Optimization Test Problems
Authors: M. Montaz Ali, Charoenchai Khompatraporn, Zelda B. Zabinsky
Venue: Journal of Global Optimization (2005)

There is a need for a methodology to fairly compare and present evaluation study results of stochastic global optimization algorithms. This need raises two important questions of (i) an appropriate set of benchmark test problems that the algorithms may be tested upon and (ii) a methodology to compactly and completely present the results. To address the first question, we compiled a collection of test problems, some are better known than others. Although the compilation is not exhaustive, it provides an easily accessible collection of standard test problems for continuous global optimization. Five different stochastic global optimization algorithms have been tested on these problems and a performance profile plot based on the improvement of objective function values is constructed to investigate the macroscopic behavior of the algorithms. The paper also investigates the microscopic behavior of the algorithms through quartile sequential plots, and contrasts the information gained from these two kinds of plots. The effect of the length of run is explored by using three maximum numbers of function evaluations and it is shown to significantly impact the behavior of the algorithms.
Virtual Classroom for Interactive Synchronous Education
Authors: Sen Cakir, Havva H. Basak
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

The World Wide Web provides new opportunities for distance education over the Internet. The Web, when combined with other network tools can be used to create a virtual classroom to bring together a community of learners for interactive education. In the paper we purpose the moving some of educational instructions of the Institute of Science Dokuz Eylül University at the WWW. This objective is achieved by investigating the use of emerging network technologies for training full time Students and part time students. This research will use the electronic educational materials already available on the Web; and it will evaluate the effectiveness of various collaborative tools.
Hyperreal waves on transfinite, terminated, distortionless and lossless, transmission lines: Research Articles
Authors: A. H. Zemanian
Venue: International Journal of Circuit Theory and Applications (2005)

A prior work (Graphs and Networks: Transfinite and Nonstandard, Chapter 8. Birkhauser: Boston, Cambridge, MA, 2004) examined the propagation of an electromagnetic wave on a transfinite transmission line&mdash;transfinite in the sense that infinitely many one-way infinite transmission lines are connected in cascade. That there are infinitely many such one-way infinite lines results in the wave propagating without ever reflecting at some discontinuity. The present work examines the case where the cascade terminates after only finitely many one-way infinite transmission lines, with the result that reflected waves are now produced at both the far end as well as at the initial end of the transfinite transmission line. The questions whether the reflected waves are infinitesimal or appreciable and whether they sum to an infinitesimal or appreciable amount are resolved for both distortionless and lossless lines. Finally, the generalization to higher ranks of transfiniteness is briefly summarized. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Probabilistic Resource State Estimation in Networked Environments: The Case of Computational Grids
Authors: Youcef M. Derbal
Venue: Proceedings of the 3rd Annual Communication Networks and Services Research Conference (2005)

Computational Grids (CGs) are large scale, geographically distributed networks of computing resources spanning distinct management domains. The dynamic state of these resources is only observable with an uncertainty induced by various grid environmental factors. In order to address this uncertainty we explore the use of Markov chains to model the grid resource state dynamics. The simulation results show that the model provide a resource state prediction within a small margin of error.
On the memory requirements of XPath evaluation over XML streams
Authors: Ziv Bar-Yossef, Marcus Fontoura, Vanja Josifovski
Venue: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2004)

The important challenge of evaluating XPath queries over XML streams has sparked much interest in the past two years, A number of algorithms have been proposed, supporting wider fragments of the query language, and exhibiting better performance and memory utilization. Nevertheless, all the algorithms known to date use a prohibitively large amount of memory for certain types of queries. A natural question then is whether this memory bottleneck is inherent or just an artifact of the proposed algorithms.In this paper we initiate the first systematic and theoretical study of lower bounds on the amount of memory required to evaluate XPath queries over XML streams. We present a general lower bound technique, which given a query, specifies the minimum amount of memory that any algorithm evaluating the query on a stream would need to incur. The lower bounds are stated in terms of new graph-theoretic properties of queries. The proof is based on tools from communication complexity.We then exploit insights learned from the lower bounds to obtain a new algorithm for XPath evaluation on streams. The algorithm uses space close to the optimum. Our algorithm deviates from the standard paradigm of using automata or transducers, thereby avoiding the need to store large transition tables.
Mining p53 Binding Sites Using Profile Hidden Markov Model
Authors: Jeffrey Huang, Shijun Li
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Hidden Markov Model has been successfully applied to bacterial gene finders and mRNA splicing modeling. Using a set of observing DNA sequences, HMM is derived for homologous search. In this paper we develop profile HMM in detecting p53, a tumor suppressor, binding sites along genes. Without assuming the constant number of nucleotides in p53 binding site, profile HMM and viterbi algorithms are designed to detect the embedded p53 binding sites from the promoter genes chosen from GenBank. The p53 regulated genes containing either single or multiple p53 binding sites distributed as clusters can be identified and classified into 7 functional groups including cell cycle regulation, DNA damage repair, signaling transduction, transcriptional factor, stress response, tumor suppressor, and oncogen.