ppxscal/embedding_network huggingface dataset:
On Helicopters and Submarines
Authors: Marshall T. Rose
Venue: Queue (2003)

Bernoulli vs. Archimedes—Whenever you see a movie that’s got a vehicle that’s part helicopter and part submarine, you know you’re in for a real treat. What could be cooler? One second, the hero’s being pursued by some fighter jets piloted by some nasty dudes with bad haircuts, dodging air-to-air missiles and exchanging witty repartee over the radio with a megalomaniac bent on world domination; and then, just as the hero is unable to evade the very last missile, he pushes a button, the craft dives into the ocean, and is surrounded by an oasis of peaceful blue.
An Exploration of Impact of Cognitive Elaboration on Learning in ISD Projects
Authors: Jiangfan Jenny Zhong, Ann Majchrzak
Venue: Information Technology and Management (2004)

Stakeholder learning has been considered crucial for effective participation and the success of information system development (ISD). However, little guidance has been offered as an operational method to facilitate learning in ISD settings. We argue that &ldquo;cognitive elaboration&rdquo; (CE) is a helpful strategy for developing effective learning in client&ndash;developer interactions in ISD efforts. Two types of learning are investigated: model-building (MB) and model-maintenance (MM). The current study investigated whether CE performed by stakeholders themselves in client&ndash;developer interaction led to their MB rather than MM learning. In addition, an alternative hypothesis has been explored: whether mere communication activities may induce learning. Fifty individuals in seven ongoing software development projects in four organizations were examined. For each project, two meetings in which clients and developers participated were observed. The empirical results demonstrated that stakeholders in an ISD process who have engaged in CE themselves are more likely to experience MB learning; and that mere communication does not account for MB learning. An insignificant link between CE and MM learning was found. This study deepens our understanding about IS&ndash;user interactions. Limitations of the current research and implications for future research are discussed.
Efficient Bit Allocation for Dependent Video Coding
Authors: Yegnaswamy Sermadevi, Sheila S. Hemami
Venue: Proceedings of the Conference on Data Compression (2004)

A steepest descent based bit allocation method with polynomial iteration complexityfor minimizing the sum of frame distortions under a total bit rate constraintis presented for a predictive video coder. Previous algorithms that solve this problemhave been based on Lagrangian Relaxation followed by unconstrained optimization.Some of these methods have complexity exponential in the prediction depth in theworst case. Moreover, the convergence properties of the faster methods are difficult toanalyze. A steepest descent method is utilized here for its comparatively low computationalcomplexity, excellent performance and ease of analysis. Sufficient conditionsfor global optimality are presented without assuming independent encoding of frames.Results for dependent bit allocation through the assignment of quantizer step-sizes toframes in MPEG-2 encoded sequences suggest that these optimality conditions are toa large extent satisfied in practice. A PSNR improvement of up to 1.5 dB is obtainedover the standard TM5 rate control algorithm for MPEG-2.
A scalable key-management scheme with minimizing key storage for secure group communications
Authors: Yuh-Min Tseng
Venue: International Journal of Network Management (2003)

Recently, many group communication services have become the focus for future developments in the Internet and wireless network applications, such as video-conferencing, collaborative work, networking games or online videos. In particular, these applications require data delivery from one sender to a large number of authorized receivers. Therefore, secure multicast communication will become an important networking issue in the future. Using a common encryption key only known by authorized members to encrypt transmitted data is a practical approach. But, whenever a group member joins or leaves the group, the common encryption key must be updated to ensure both past and future secrecy. As a result, minimizing key update communication cost and the key storage requirement of a group controller is a critical issue in a scalable and dynamically changing large group. A new key-management scheme is proposed to reduce the key storage requirement of a group controller to a constant size, which is far better than that of the previously proposed schemes, while retaining the same key update communication cost. In addition, the correlation between the key storage requirement of each group member and key update communication cost are also presented.
An evaluation of reconstruction filters for volume rendering
Authors: Stephen R. Marschner, Richard J. Lobb
Venue: Proceedings of the conference on Visualization '94 (1994)

To render images from a three-dimensional array of sample values, it is necessary to interpolate between the samples. This paper is concerned with interpolation methods that are equivalent to convolving the samples with a reconstruction filter; this covers all commonly used schemes, including trilinear and cubic interpolation.We first outline the formal basis of interpolation in three-dimensional signal processing theory. We then propose numerical metrics that can be used to measure filter characteristics that are relevant to the appearance of images generated using that filter. We apply those metrics to several previously used filters and relate the results to isosurface images of the intrpolations. We show that the choice of interpolation scheme can have a dramatic effect on image quality, and we discuss the cost/benefit tradeoff inherent in choosing a filter.
A Probabilistic Criterion to Detect Rigid Point Matches Between Two Images and Estimate the Fundamental Matrix
Authors: Lionel Moisan, Bérenger Stival
Venue: International Journal of Computer Vision (2004)

The perspective projections of n physical points on two views (stereovision) are constrained as soon as n &ge; 8. However, to prove in practice the existence of a rigid motion between two images, more than 8 point matches are desirable in order to compensate for the limited accuracy of the matches. In this paper, we propose a computational definition of rigidity and a probabilistic criterion to rate the meaningfulness of a rigid set as a function of both the number of pairs of points (n) and the accuracy of the matches. This criterion yields an objective way to compare, say, precise matches of a few points and approximate matches of a lot of points. It gives a yes/no answer to the question: &ldquo;could this rigid points correspondence have occurred by chance?&rdquo;, since it guarantees that the expected number of meaningful rigid sets found by chance in a random distribution of points is as small as desired. It also yields absolute accuracy requirements for rigidity detection in the case of non-matched points, and optimal values of n, depending on the expected accuracy of the matches and on the proportion of outliers. We use it to build an optimized random sampling algorithm that is able to detect a rigid motion and estimate the fundamental matrix when the set of point matches contains up to 90% of outliers, which outperforms the best currently known methods like M-estimators, LMedS, classical RANSAC and Tensor Voting.
Synchronous gestures for multiple persons and computers
Authors: Ken Hinckley
Venue: Proceedings of the 16th annual ACM symposium on User interface software and technology (2003)

This research explores distributed sensing techniques for mobile devices using synchronous gestures. These are patterns of activity, contributed by multiple users (or one user with multiple devices), which take on a new meaning when they occur together in time, or in a specific sequence in time. To explore this new area of inquiry, this work uses tablet computers augmented with touch sensors and two-axis linear accelerometers (tilt sensors). The devices are connected via an 802.11 wireless network and synchronize their time-stamped sensor data. This paper describes a few practical examples of interaction techniques using synchronous gestures such as dynamically tiling together displays by physically bumping them together, discusses implementation issues, and speculates on further possibilities for synchronous gestures.
Searches on a Binary Tree with Random Edge-Weights
Authors: Alan Stacey
Venue: Combinatorics, Probability and Computing (1999)

Each edge of the standard rooted binary tree is equipped with a random weight; weights are independent and identically distibuted. The value of a vertex is the sum of the weights on the path from the root to the vertex. We wish to search the tree to find a vertex of large weight. A very natural conjecture of Aldous states that, in the sense of stochastic domination, an obvious greedy algorithm is best possible. We show that this conjecture is false. We prove, however, that in a weaker sense there is no significantly better algorithm.
Sequential Universal Lossless Techniques for Compression of Patterns and Their Description Length
Authors: Gil I. Shamir
Venue: Proceedings of the Conference on Data Compression (2004)

A pattern is a sequence of indices that contains all consecutive integer indices up to some integer k in increasing order of first occurrence. If the alphabetof a source that generated a sequence is unknown, the inevitable cost of codingthe unknown alphabet symbols can be exploited to create the pattern of thesequence, which, in turn, can be compressed by itself. In this paper, two low-complexity sequential schemes are proposed for universally compressing patterns that are obtained from sequences generated by independently identicallydistributed (i.i.d.) sources with unknown (possibly large) alphabets of unknownsize. The description lengths both schemes assign to a pattern are investigatedand bounded by rigorous closed form expressions in terms of the maximum likelihood (ML) probability of the underlying i.i.d. sequence. In particular, eachdistinct index in the pattern is shown to cost 0.5 log(n/k3)+1:59 log e bits abovethe i.i.d. ML cost. This results in description length for unknown parametersthat is shorter than the minimum code length of an i.i.d. sequence if there aremore than e19/18·n 1=3 indices in the pattern. The sequential performance resultsare then used to establish a connection between the pattern entropy and theunderlying i.i.d. entropy. This final result points out that for large alphabets(including those larger than n), recently derived universal coding redundancybounds for coding patterns are negligible compared to the reduction in entropyfrom the underlying i.i.d. one.
Analyzing information technology investments in state government
Authors: William C. Rivenbark, Kevin M. FitzGerald, Shannon H. Schelin
Venue: Social Science Computer Review (2003)

State agencies often find themselves caught between the need for technological innovation and the reality of large-scale technology failures, increasing the importance of supporting an information technology (IT) investment with a systematic and repeatable approach of analysis. This research explores the application of business metrics in state government for selecting and evaluating IT initiatives. The purpose is to identify benchmark states for their creation and implementation of specific metrics to enhance the decision-making processes found within the core phases of business case analysis, expanding the research of Fletcher on strategic planning. The states of Arizona, Oregon, Tennessee, and Iowa were identified as benchmark states based on the criteria of quantitative measurement, guidelines for calculation, and developed for utility. The authors conclude that business metrics derived from economic returns are only one component in managing an IT portfolio given the specific differences between public and private organizations.
Frequency rolling: a cooperative frequency hopping for mutually interfering wpans
Authors: Petar Popovski, Hiroyuki Yomo, Sebastien Aprili
Venue: Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing (2004)

A Wireless Personal Area Network (WPAN) provides wireless links among proximate devices,usually carried by an individual.As WPAN gains momentum in ubiquitous usage, the interference that collocated WPANs cause to each other, termed self-interference, becomes one of the major sources that degrade the communication performance of WPAN. This paper in roduces the Frequency Rolling (FR), a particular instance of frequency hopping (FH) that enables he collocated WPANs to cooperate and avoid the self-interference. The FR uses as input solely the observed packet error rate (PER) and it does not require any exchange of information among he collocated WPANs. The effect of the FR over a longer time in erval is hat the WPANs use he complete set of disposable channels in an implicit time-division and cooperative manner. The parameters of he FR are chosen such that a WPAN which uses FR never occupies the channels in the unlicensed spectrum more than what is permitted by the current regulation. We compare the goodput offered by FR to the goodput of the collocated piconets when conventional pseudorandom FH is used. Our simulation results show that FR has superior goodput performance. In addition, he design of FR is made robust owards the errors due to the channel noise. Some guidance for practical fault-toleran design and future extensions of FR are given. All hese features promote the great potential of FR as a coexistence mechanism for unlicensed operation.
Robust parameterized component analysis: theory and applications to 2D facial appearance models
Authors: Fernando De la Torre, Michael J. Black
Venue: Computer Vision and Image Understanding (2003)

Principal component analysis (PCA) has been successfully applied to construct linear models of shape, graylevel, and motion in images. In particular, PCA has been widely used to model the variation in the appearance of people's faces. We extend previous work on facial modeling for tracking faces in video sequences as they undergo significant changes due to facial expressions. Here we consider person-specific facial appearance models (PSFAM), which use modular PCA to model complex intra-person appearance changes. Such models require aligned visual training data; in previous work, this has involved a time consuming and error-prone hand alignment and cropping process. Instead, the main contribution of this paper is to introduce parameterized component analysis to learn a subspace that is invariant to affine (or higher order) geometric transformations. The automatic learning of a PSFAM given a training image sequence is posed as a continuous optimization problem and is solved with a mixture of stochastic and deterministic techniques achieving sub-pixel accuracy. We illustrate the use of the 2D PSFAM model with preliminary experiments relevant to applications including video-conferencing and avatar animation.
Heuristics for Optimizing Multi-Clip Queries in Video Databases
Authors: Harald Kosch, Ahmed Mostefaoui, László Böszörményi, Lionel Brunie
Venue: Multimedia Tools and Applications (2004)

In this paper we address the multi-clip query optimization problem where a multi-clip query requests multiple video clips. We propose a new heuristics called Restricted Search Interval that maximizes clip sharing between queries and consequently reduces the network bandwidth of a video server for a multicast system. An adaptation of our heuristics for optimizing the response time of the query is also presented. The experimental results show that the suggested heuristics reduces the server workload by about 28% on the average in comparison to a classical heuristic approach.
Embryonic object versus mature object: object-oriented style and pedagogical theme
Authors: Richard Rasala
Venue: Proceedings of the 8th annual conference on Innovation and technology in computer science education (2003)

Traditional approaches to object-oriented style emphasize classes with a basic set of constructors and a minimal set of methods that when combined permit the full potential of the instance objects to be realized. This object-oriented style is probably modeled on the style used in mathematics and logic to develop a system based on a minimal set of axioms and operations. The consequences of this style both in practice and in pedagogy are that objects enter into existence in an embryonic state and must be nurtured to maturity by a sequence of method calls that tweak behavior and/or add data. Although this minimalist approach is useful in the first stages of teaching objects and in exploratory design, we suggest that most designs should evolve towards building classes with a rich set of constructors and methods so that the instance objects may be born mature, that is, ready to use in the program without further tweaking. In particular, we believe that if students are taught to design in this manner, then they will be more effective both as students and as computing professionals.The ideas in this article have developed from our experience in designing the Java Power Tools (JPT) and in applying these tools to build many labs and demo programs. We found that using the traditional minimalist design approach hindered our ability to rapidly develop interesting applications. Gradually, we evolved both the tools and the examples to be far richer and have found that our development time has been dramatically reduced. We believe that those who teach objects may be interested in these principles even if they choose to work with entirely different tools and examples.
The universal compiling system
Authors: H. C. Gyllstrom, R. C. Knippel, L. C. Ragland, K. E. Spackman
Venue: ACM SIGPLAN Notices (1979)

The Universal Compiling System (UCS) is a unified compiling system for a set of languages and architectures. The integrated implementation discipline of UCS results in reduced development and maintenance costs and increased reliability and efficiency. The key to the UCS design is the strict separation of the source language dependent processes from the architecture dependent processes. This is made possible through the use of an intermediate text and dictionary (symbol table) which is both language independent and architecture independent.
Comparing Top k Lists
Authors: Ronald Fagin, Ravi Kumar, D. Sivakumar
Venue: SIAM Journal on Discrete Mathematics (2004)

Motivated by several applications, we introduce various distance measures between "top k lists." Some of these distance measures are metrics, while others are not. For each of these latter distance measures, we show that they are "almost" a metric in the following two seemingly unrelated aspects:(i) they satisfy a relaxed version of the polygonal (hence, triangle) inequality, and(ii) there is a metric with positive constant multiples that bound our measure above and below.This is not a coincidence---we show that these two notions of almost being a metric are the same. Based on the second notion, we define two distance measures to be equivalent if they are bounded above and below by constant multiples of each other. We thereby identify a large and robust equivalence class of distance measures.Besides the applications to the task of identifying good notions of (dis)similarity between two top k lists, our results imply polynomial-time constant-factor approximation algorithms for the rank aggregation problem with respect to a large class of distance measures.
Simulations of diffusion barrier deposition on porous low-k films
Authors: Z. S. Yanovitskaya, A. V. Zverev, D. Shamiryan, K. Maex
Venue: Microelectronic Engineering (2003)

Implementation of Cu/low-k in advanced interconnections requires a diffusion barrier to prevent copper penetration in low-k dielectrics. The barrier should be continuous to prevent copper diffusion and thin enough to keep interconnection line resistance low. Deposition of a diffusion barrier becomes an issue when porous low-k dielectrics are used. We developed a Monte Carlo simulation model to describe deposition of a diffusion barrier on a porous low-k film. The model provided explanation for the seating behavior of different porous film by TaN diffusion barrier. Previously we have shown that TaN barrier integrity depends on chemical nature of the substrate rather than on porous structure: the same barrier can be continuous on oxycarbide (SiOCH) but non-continuous on HSQ (hydrogen silsesquioxane) although porous structures of the two films are similar. Using the model, we show that surface diffusion of TaN during deposition plays a key role in continuous barrier formation. Presence of carbon suppresses TaN diffusion (probably by TaC formation) and the barrier does not penetrate deep into the film forming a continuous layer on the top surface. The model is also able to predict sealing behavior for different porous low-k films with different porosity/pore sizes.
Partitioning a network into n pieces with a time-efficient net cost function
Authors: Paul Stravers
Venue: Proceedings of the conference on European design automation (1991)

This paper discusses the generalization of the Fiduccia-Mattheyses linear time bi-partitioning algorithm to a linear time n-partitioning algorithm. It uses a new heuristic cost function to evaluate the cost of arbitrarily large spanning trees in O(log n) time. Practical experiments show good results.
On Maximum Rate Control of Weighted Fair Scheduling for Transactional Systems
Authors: Jeng Farn Lee, Yeali Sun, Meng Chang Chen
Venue: Proceedings of the 24th IEEE International Real-Time Systems Symposium (2003)

While exisiting weighted fair scheduling schemes guaranteeminimum service rates of a shared server (such as a computeror a communication channel), maximum rate control wasgenerally enforced by employing policing mechanisms. Theprevious approaches use either a concatenation of ratecontroller and scheduler, or a policer in front of scheduler.The concatenation method uses two sets of queues andmanagement aparartus, and thus incurs overhead. The othermethod allows bursty job requests that may violatemaximum rate constraint. In this paper, we present a newweighted fair scheduling scheme, WF2Q-M, to simultaneouslysupport maximum rate control and minimum service rateguarantee. WF2Q-M proposes the virtual clock adjustmentmethod to enforce maximum rate control by distributing theexcess bandwidths of maximum rate constrained sessions toother sessions without recalculating the virtual starting andfinishing times of regular sessions. In terms of performancemetrics, we prove that WF2Q-M is theoretically bounded bya fluid reference model. A procedural schedulingimplementation of WF2Q-M is proposed and proof ofcorrectness is given. Finally, we conduct extensiveexperiments to show the performance of WF2Q-M is just as weclaim.
One method for design of narrowband lowpass filters
Authors: Gordana Jovanovic-Dolecek, Javier Diaz-Carmona
Venue: Practicing software engineering in the 21st century (2003)

This chapter describes a design of a narrowband lowpass finite impulse response (FIR) filter using a small number of multipliers per output sample (MPS). The method is based on the use of a frequency-improved recursive running sum (RRS), called the sharpening RRS filter, and the interpolated finite impulse response (IFIR) structure. The filter sharpening technique uses multiple copies of the same filter according to an amplitude change function (ACF), which maps a transfer function before sharpening to a desired form after sharpening. Three ACFs are used in the design, as illustrated in the accompanying examples.