ppxscal/embedding_network huggingface dataset:
A new generation of textual corpora: mining corpora from very large collections
Authors: Gordon Stewart, Gregory Crane, Alison Babeu
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

While digital libraries based on page images and automatically generated text have made possible massive projects such as the Million Book Library, Open Content Alliance, Google, and others, humanists still depend upon textual corpora expensively produced with labor-intensive methods such as double-keyboarding and manual correction. This paper reports the results from an analysis of OCR-generated text for classical Greek source texts. Classicists have depended upon specialized manual keyboarding that costs two or more times as much as keyboarding of English both for accuracy and because classical Greek OCR produced no usable results. We found that we could produce texts by OCR that, in some cases, approached the 99.95% professional data entry accuracy rate. In most cases, OCR-generated text yielded results that, by including the variant readings that digital corpora traditionally have left out, provide better recall and, we argue, can better serve many scholarly needs than the expensive corpora upon which classicists have relied for a generation. As digital collections expand, we will be able to collate multiple editions against each other, identify quotations of primary sources, and provide a new generation of services.
The transition from single-platform to multi-platform software development
Authors: Juris Reinfelds
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1998)

In this paper we will observe that there were sound reasons why multiplatform software development was once regarded as impossible. When the reasons disappeared, the belief of impossibility remained. The first ports of UNIX helped to destroy that belief, opening a floodgate to subsequent UNIX ports and multi-platform software developments.
Broadband DOA estimation using frequency-invariant beam-space processing
Authors: D. B. Ward
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

This paper presents a new method of beam-space direction of arrival (DOA) estimation for multiple far-field broadband signals. A novel multi-rate beamforming structure having a frequency invariant property is applied to the array outputs. Using this multi-rate structure, only a single vector of parameters is required to implement a desired frequency invariant beam pattern regardless of the bandwidth or number of sensors in the array. This frequency-invariant beamformer performs focusing over a very wide bandwidth without resorting to the frequency bin design approach of other methods in which the solution of a multiparameter optimisation problem is required to design the beam-space focusing matrices.
Nifty reflections
Authors: Nick Parlante
Venue: ACM SIGCSE Bulletin (2007)

Nifty Assignments are nice and everything, but it's natural to wonder: Where are Nifty Assignments weakest?
A Two Phase Approach to Design Pattern Recovery
Authors: Andrea De Lucia, Vincenzo Deufemia, Carmine Gravino, Michele Risi
Venue: Proceedings of the 11th European Conference on Software Maintenance and Reengineering (2007)

In this paper we present a two phase approach to the recovery of structural design pattern. In the first phase, the design pattern instances are identified at a course-grained level by considering the design structure only and using a visual language parsing technique. Then, the identified candidate patterns are validated by a fine-grained source code analysis phase. The latter phase is an enhancement of a previous approach developed by the authors aiming at improving the results of precision and time performances. The retrieval effectiveness of the approach is assessed by applying the recovery technique on four software systems.
Measurements, analysis, and modeling of BitTorrent-like systems
Authors: Lei Guo, Songqing Chen, Zhen Xiao, Enhua Tan, Xiaoning Ding, Xiaodong Zhang
Venue: Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement (2005)

Existing studies on BitTorrent systems are single-torrent based, while more than 85% of all peers participate in multiple torrents according to our trace analysis. In addition, these studies are not sufficiently insightful and accurate even for single-torrent models, due to some unrealistic assumptions. Our analysis of representative Bit-Torrent traffic provides several new findings regarding the limitations of BitTorrent systems: (1) Due to the exponentially decreasing peer arrival rate in reality, service availability in such systems becomes poor quickly, after which it is difficult for the file to be located and downloaded. (2) Client performance in the BitTorrent-like systems is unstable, and fluctuates widely with the peer population. (3) Existing systems could provide unfair services to peers, where peers with high downloading speed tend to download more and upload less. In this paper, we study these limitations on torrent evolution in realistic environments. Motivated by the analysis and modeling results, we further build a graph based multi-torrent model to study inter-torrent collaboration. Our model quantitatively provides strong motivation for inter-torrent collaboration instead of directly stimulating seeds to stay longer. We also discuss a system design to show the feasibility of multi-torrent collaboration.
A stochastic flow for feature extraction
Authors: G. B. Unal
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

Over the years the evolution of level sets of two-dimensional functions or images in time through a partial differential equation has emerged as an important tool in image processing. Curve evolution, which may be viewed as an evolution of a single level curve, has been applied to a wide variety of problems such as smoothing of shapes, shape analysis and shape recovery. We give a stochastic interpretation of the basic curve smoothing equation, the so called geometric heat equation, and show that this evolution amounts to a rotational diffusion movement of the particles along the contour. Moreover, assuming that a priori information about the orientation of objects to be preserved is known, we present new flows which amount to weighting the geometric heat equation nonlinearly as a function of the angle of the normal to the curve at each point.
Hybrid coding of mixed signals for digital covert audio surveillance
Authors: M. Mason
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

An overview of the requirements of digital covert audio acquisition (DCAA) is provided and a scalable hybrid coder tuned for the coding of intelligible speech in a covert environment is proposed. The codec incorporates linear predictive coding (LPC) and an M-band discrete wavelet transform (DWT) to offer effective intelligible speech coding in the presence of multiple signal sources at bit rates between 8 kbps and 32 kbps. The results of informal intelligibility testing and an analysis of the algorithm's complexity are presented to demonstrate the performance of the proposed coder.
C++ design and implementation challenges in technology computer aided design frameworks
Authors: Goodwin R. Chin, Dharini Sitaraman, Chung Yang, Martin D. Giles
Venue: Proceedings of the 6th conference on USENIX Sixth C++ Technical Conference - Volume 6 (1994)

Interoperability of physical simulation tools is often cumbersome due to differences in domain representation. The Technology Computer Aided Design (TCAD) community (1) has realized this problem and is working on providing an object-oriented interface for representing and manipulating the state of a semiconductor wafer during process and device simulation, the Semiconductor Wafer Representation (SWR) [1, 2, 3]. We describe an implementation of components of a 3D SWR designed to support the needs of many TCAD simulators. A set of classes provide support for solid modeling operations, mesh refinement operations, and data interchange. A layered memory subsystem allows either uniprocess or client/server operation. Run-time type identification provides dynamic extensibility of data types.
A virtual machine for sensor networks
Authors: René Müller, Gustavo Alonso, Donald Kossmann
Venue: ACM SIGOPS Operating Systems Review (2007)

Sensor networks are increasingly being deployed for a wide variety of tasks. Today, in these networks, the development, deployment, and maintenance of applications are performed largely ad-hoc. Existing platforms help somewhat but also introduce implicit trade-offs. In one extreme, low-level programming platforms and languages make programming cumbersome and error-prone. In the other extreme, declarative approaches greatly facilitate programming but restrict what can be done. In both cases, additional limitations include lack of support for concurrency, difficulties in changing applications, and insufficient abstractions from low-level details. This paper presents SwissQM, a virtual machine designed to address all these limitations. SwissQM offers a platform-independent programming abstraction that is geared towards data acquisition and in-network data processing.
Coding of multi-view images for immersive viewing
Authors: Xin Tong
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

A light field is a collection of multi-view images which represent a 3-D scene. Rendering from a light field provides a simple and efficient way to generate arbitrary new views of the scene as the viewing position and angle change, thus offering the experience of immersive viewing. The enormous amount of data required in a light field (typically on the order of tens or hundreds of megabytes and in some cases even gigabytes) poses a key challenge in rendering. Tree-structured vector quantization (TSVQ) provides moderate compression ratio, which alleviates but does not solve the problem. Compression schemes based on video coding techniques exploit the data redundancy very effectively but do not provide adequate random access for rendering. This paper describes a hierarchical compression scheme based on disparity compensated prediction, which provides a high compression ratio while offering fast random access. More information is available at http://www-ise.stanford.edu//spl sim/xin/lf.
Visualization Criticism - The Missing Link Between Information Visualization and Art
Authors: Robert Kosara
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

Classifications of visualization are often based on technical criteria, and leave out artistic ways of visualizing information. Understanding the differences between information visualization and other forms of visual communication provides important insights into the way the field works, though, and also shows the path to new approaches. We propose a classification of several types of information visualization based on aesthetic criteria. The notions of artistic and pragmatic visualization are introduced, and their properties discussed. Finally, the idea of visualization criticism is proposed, and its rules are laid out. Visualization criticism bridges the gap between design, art, and technical/pragmatic information visualization. It guides the view away from implementation details and single mouse clicks to the meaning of a visualization.
On the cardinalities of interval-valued fuzzy sets
Authors: Glad Deschrijver, Pavol Král'
Venue: Fuzzy Sets and Systems (2007)

Wygralak has developed an axiomatic theory of scalar cardinalities of fuzzy sets with finite support which covers as particular cases all standard (historical) concepts of the scalar cardinality. In this paper we present a possible extension of this theory to interval-valued fuzzy set theory. We introduce the cardinality of interval-valued fuzzy sets as a mapping from the set of interval-valued fuzzy sets with finite support to the set of closed subintervals of [0,+~[. We study some properties of these cardinalities using t-norms, t-conorms and negations on the lattice L^I (the underlying lattice of interval-valued fuzzy set theory). In particular, the valuation property, the subadditivity property, the complementarity rule and the cartesian product rule will be discussed.
Accurate and scalable reliability analysis of logic circuits
Authors: Mihir R. Choudhury, Kartik Mohanram
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Reliability of logic circuits is emerging as an important concern that may limit the benefits of continued scaling of process technology and the emergence of future technology alternatives. Reliability analysis of logic circuits is NP-hard because of the exponential number of inputs, combinations and correlations in gate failures, and their propagation and interaction at multiple primary outputs. By coupling probability theory with concepts from testing and logic synthesis, this paper presents accurate and scalable algorithms for reliability analysis of logic circuits. Simulation results for several benchmark circuits demonstrate the accuracy, performance, and potential applications of the proposed analysis technique.
A Lightweight Framework for Runtime Reconfigurable System Prototyping
Authors: Roman Koch, Thilo Pionteck, Carsten Albrecht, Erik Maehle
Venue: Proceedings of the 18th IEEE/IFIP International Workshop on Rapid System Prototyping (2007)

This paper describes a lightweight framework for prototyping runtime reconfigurable systems in a Xilinx Virtex-II Pro FPGA. The framework provides a reconfiguration and control infrastructure that allows components of the prototype system to be modified or exchanged at runtime by means of partial reconfiguration of the FPGA. The system state may be monitored and influenced by a programmable controller which is part of the framework. The area overhead of the framework is kept low by efficiently utilising the two hard-wired PowerPC processor cores inside the FPGA while avoiding the use of resource-intense bus structures. Specific lean input/output modules are used with the one processor core while the other implements a Xilinx UltraController-II based design.
Towards a Methodology for Service Construction
Authors: Joachim Schelp, Robert Winter
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

All large vendors of standard business software have announced to move to service oriented architecture. They claim benefits for their customers with regard to agility and openness. In contrast to the design of software services which has been a focus of research in the computer science community in recent years, the design of enterprise services has not been addressed as much by the information systems research community. This paper outlines a research program on the design of enterprise services. The necessity of different service understandings on different layers of enterprise architecture is shown, conceptual foundations for the design of enterprise services are presented, and first results of developing a method for enterprise service design are proposed.
Parallelizable eigenvalue decomposition techniques via the matrix sector function
Authors: M. A. Hasan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

Many modern high-resolution spectral estimators in signal processing and control make use of the subspace information afforded by the singular value decomposition of the data matrix, or the eigenvalue decomposition of the covariance matrix. The derivation of these estimators involves some form of matrix decomposition. In this paper, new computational techniques for obtaining eigenvalues and eigenvectors of a square matrix are presented. These techniques are based on the matrix sector function which can be applied to break down a given matrix into matrices of smaller dimensions and consequently this approach is suitable for parallel implementation. Finally, an example which illustrates the proposed method is provided.
Result merging methods in distributed information retrieval with overlapping databases
Authors: Shengli Wu, Sally McClean
Venue: Information Retrieval (2007)

In distributed information retrieval systems, document overlaps occur frequently among different component databases. This paper presents an experimental investigation and evaluation of a group of result merging methods including the shadow document method and the multi-evidence method in the environment of overlapping databases. We assume, with the exception of resultant document lists (either with rankings or scores), no extra information about retrieval servers and text databases is available, which is the usual case for many applications on the Internet and the Web.The experimental results show that the shadow document method and the multi-evidence method are the two best methods when overlap is high, while Round-robin is the best for low overlap. The experiments also show that [0,1] linear normalization is a better option than linear regression normalization for result merging in a heterogeneous environment.
Cramer-Rao lower bounds for atomic decomposition
Authors: J. C. O'Neill
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

In a previous paper we presented a method for atomic decomposition with chirped, Gabor functions based on maximum likelihood estimation. In this paper we present the Cramer-Rao lower bounds for estimating the seven chirp parameters, and the results of a simulation showing that our sub-optimal, but computationally tractable, estimators perform well in comparison to the bound at low signal-to-noise ratios. We also show that methods based on signal dictionaries will require much higher computations to perform well in low signal-to-noise ratios.
Sharp Threshold for Hamiltonicity of Random Geometric Graphs
Authors: Josep Di´az, Dieter Mitsche, Xavier Pe´rez
Venue: SIAM Journal on Discrete Mathematics (2007)

We show for an arbitrary $\ell_p$ norm that the property that a random geometric graph $\mathcal G(n,r)$ contains a Hamiltonian cycle exhibits a sharp threshold at $r=r(n)=\sqrt{\frac{\log n}{\alpha_p n}}$, where $\alpha_p$ is the area of the unit disk in the $\ell_p$ norm. The proof is constructive and yields a linear time algorithm for finding a Hamiltonian cycle of $\mathcal{G}(n,r)$ asymptotically almost surely, provided $r=r(n)\ge\sqrt{\frac{\log n}{(\alpha_p -\epsilon)n}}$ for some fixed $\epsilon>0$.
An application-centered course on data-driven web sites
Authors: D. R. Jacobs
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

In this paper, we describe our experience with an application-centered approach in teaching a course on web technology. The purpose of the course was to teach the principles of data-base driven web sites, their design and the integration of the underlying components. The class was partitioned into small teams, where each team had their own dedicated server. Each team was responsible for achieving certain milestones that culminated in the implementation of a data-base driven web site. Lectures and demonstrations were used to provide information on a need-to-know basis. Our experience was highly positive. Synergy and student motivation grew as the course progressed. By the end of the semester teams had developed near-professional quality web sites. We describe course details including syllabus, lecture topics, and milestone objectives.
Addressing Context Awareness Techniques in Body Sensor Networks
Authors: Barbara T. Korel, Simon G. M. Koo
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Context awareness in Body Sensor Networks (BSNs) has the significance of associating physiological user activity and environment to the sensed signals of the user. The context information derived in a BSN can be used in pervasive healthcare monitoring for relating importance to events and specifically for accurate episode detection. In this paper, we address the issues of context-aware sensing in BSNs, along with a comparison of different techniques for deducing context awareness, namely, Artificial Neural Networks, Bayesian Networks, and Hidden Markov Models.
Life or death at block-level
Authors: Muthian Sivathanu, Lakshmi N. Bairavasundaram, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau
Venue: Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6 (2004)

A fundamental piece of information required in intelligent storage systems is the liveness of data. We formalize the notion of liveness within storage, and present two classes of techniques for making storage systems liveness-aware. In the explicit notification approach, we present robust techniques by which a file system can impart liveness information to storage through a "free block" command. In the implicit detection approach, we show that such information can be inferred by the storage system efficiently underneath a range of file systems, without changes to the storage interface. We demonstrate our techniques through a prototype implementation of a secure deleting disk. We find that while the explicit interface approach is desirable due to its simplicity, the implicit approach is easy to deploy and enables quick demonstration of new functionality, thus facilitating rapid migration to an explicit interface.
Panel Description, Fie '98 Computing As A Profession: A Unifying Framework
Authors: N. Coulter
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

The purpose of this paper is to outline some of the issues, challenges and questions facing universities and colleges as they consider the use of technology in the support of teaching and learning. The issues are difficult in that they require balanced consideration of questions such as: (i) what types of technologies improve learning?; (ii) which faculty members will adopt and experiment with technologies and how will this impact the reward system?; and (iii) which technologies can we afford and what are the hidden costs? Most of these questions remain unanswered. The authors begin by giving examples of the types of learning technologies that universities are exploring and adopting. They proceed to enumerate some of the reasons for this adoption, and then discuss the various groups who should be asking probing questions about the effectiveness of these technologies. Some of the characteristics of an evaluation plan that would address these various questions are then proposed. They conclude with several emerging models for such an evaluation plan.
Time domain recursive deconvolution in sound reproduction
Authors: A. Gonzalez
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

A time domain recursive algorithm for multichannel inverse filter design in sound reproduction systems is presented. The method exploits the non-symmetric Toeplitz-block structure of the actual multichannel system matrix that is used to specify the electroacoustic transmission paths. The result is a matrix of causal finite impulse response filters which best approximate a given time domain response in the least squares sense. The method presents low memory and computational requirements and its time updating properties make it suitable for real time applications in non-stationary environments. A cross talk cancellation experiment is presented which illustrates the properties of the algorithm.