ppxscal/embedding_network huggingface dataset:
Incorporating Uncertainty Metrics into a General-Purpose Data Integration System
Authors: Brenton Louie, Landon Detwiler, Nilesh Dalvi, Ron Shaker, Peter Tarczy-Hornoch, Dan Suciu
Venue: Proceedings of the 19th International Conference on Scientific and Statistical Database Management (2007)

There is a significant need for data integration capabilities in the scientific domain, which has manifested itself as products in the commercial world as well as academia. However, in our experiences in dealing with biological data it has become apparent to us that existing data integration products do not handle uncertainties in the data very well. This leads to systems that often produce an explosion of less relevant answers which subsequently leads to a loss of more relevant answers by overloading the user. How to incorporate functionality into data integration systems to properly handle uncertainties and make results more useful has become an important research question. In this paper we describe an enhanced general-purpose data integration system which incorporates uncertainty metrics within a formal probabilistic framework. Additionally, for evaluation purposes, we have implemented a use case scenario which utilizes biological data sources and performed a study which provides validation of system query results.
Single-tree method for grammar-directed search
Authors: L. Nguyen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

We present a very fast and accurate fast-match algorithm which, when followed by a regular beam search restricted within only the subset of words selected by the fast-match, can speed up the recognition process by at least two orders of magnitude in comparison to a typical single-pass speech recognizer utilizing the Viterbi (or beam) search algorithm. In this search strategy, the recognition vocabulary is structured as a single phonetic tree in the fast-match pass. The search on this phonetic tree is a variation of the Viterbi algorithm. Especially, we are able to use a word bigram language model without making copies of the tree during the search. This is a novel fast-match algorithm that has two important properties: high-accuracy recognition and run-time proportional to only the cube root of the vocabulary size.
Offering Mobile Security as a Service
Authors: Aki Lassila
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The objective of this paper is to study how a software product company can expand its productbased business with the Software as a Service (SaaS) model into the mobile setting. We focus on a mobile security as a service offering and examine how the SaaS model can be implemented by a software company with existing PC-based software business. The differences between the product and service business are considerable and the change of focus from one to the other is not easily done. In order to create successful and sustainable business, the SaaS model tries to bridge the gap between the software product and service business. Our findings include that by successfully solving the challenges associated with the SaaS model and by taking advantage of the benefits, the case company FSecure, which operates in the virus and intrusion prevention field, managed to leverage its domain area expertise with its SaaS offering. The case company expanded its PC-based antivirus and security application business to cover also mobile devices with the help of its partners, the mobile operators and the handset manufacturers.
Eigenvalue patterned condition numbers: Toeplitz and Hankel cases
Authors: S. Noschese, L. Pasquini
Venue: Journal of Computational and Applied Mathematics (2007)

We continue the study started in [Noschese and Pasquini, Eigenvalue condition numbers: zero-structured versus traditional. J. Comput. Appl. Math. 185 (2006) 174-189] concerning the sensitivity of simple eigenvalues of a matrix A to perturbations in A that belong to a chosen subspace of matrices. In [Noschese and Pasquini, Eigenvalue condition numbers: zero-structured versus traditional. J. Comput. Appl. Math. 185 (2006) 174-189] the zero-structured perturbations have been considered. Here we focus on patterned perturbations, and the cases of the Toeplitz and of the Hankel matrices are investigated in detail. Useful expressions of the absolute patterned condition number of the eigenvalue @l and of the analogue of the matrix yx^H, which leads to the traditional condition number of @l, are given. MATLAB codes are defined to compare traditional, zero-structured and patterned condition numbers. A report on significant numerical tests is included.
Fast Frequent Free Tree Mining in Graph Databases
Authors: Peixiang Zhao, Jeffrey Xu Yu
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML databases, etc. In this paper, we present a computationally efficient algorithm F3TM (Fast Frequent Free Tree Mining) to discover all frequent free trees in a graph database. We focus ourselves on how to reduce the cost of candidate generation and minimize the number of candidates being generated. We prove a theorem that the completeness of frequent free trees can be guaranteed by growing vertices from a limited range of vertices in a free tree. Two pruning techniques, automorphism-based pruning and pruning based on canonical mapping are proposed which significantly reduce the cost of candidate generation. We conducted experimental studies on a real application dataset and we show that our F3TM outperforms the upto- date algorithms by an order of magnitude.
Creating Meaningful Assessments for Professional Development Education in Software Architecture
Authors: Elspeth Golden, Len Bass
Venue: Proceedings of the 20th Conference on Software Engineering Education & Training (2007)

Extensive instructional materials have been developed and used for courses in specific software architecture topics offered at the Software Engineering Institute (SEI) at Carnegie Mellon University, to support the instructional goals laid out by the creators of the SEI's professional education program and the designers of the individual courses. However, to date, these courses have lacked any assessment component, certification for the course being granted solely on attendance. For an assessment component to be meaningful, it must derive from and support these instructional goals, determine which goals must be assessed and how to assess them, and determine how best to assess whether those goals have been achieved through application of the instructional materials, lectures, and activities which are included in each two-day course. In order to ensure that the course assessments target the intended learning goals, we developed content for low-stakes assessment components grounded in education theory, combining current knowledge of educational psychology and the software engineering domain to create evaluations that will effectively determine whether participants in this course have learned what the curriculum developers and the instructors intend them to learn.
RAS by the Yard
Authors: Alan Wood, Swami Nathan
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

Different applications require different levels of fault tolerance. Therefore, it is important to create a flexible architecture that allows a customer to choose the appropriate amount of fault tolerance, a concept we call "RAS by the yard." In this paper we describe a next generation supercomputer and the design flexibility that allows us to offer a range of alternatives for RAS (reliability, availability, serviceability). In particular we explain how checkpointing can provide an availability continuum. Design alternatives that improve RAS may be expensive, so it is important to do cost/benefit studies of the alternatives. For a fixed budget and specified system balance ratios, such as Bytes/FLOPS, we analyze the system performance impact of alternative RAS strategies. We show how to optimize the amount of RAS purchased by using a performability measure.
High quality embedded wideband speech coding using an inherently layered coding paradigm
Authors: S. A. Ramprashad
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

Presented is an embedded coding strategy for wideband signals using the multimode transform predictive coding (MTPC) framework. The design uses many of the inherently layered features of the original non-embedded MTPC including iterative bit assignments and frequency domain coding. The design also uses the mode decision of the MTPC to adapt the layering strategy to the type input signal. The result is a high quality embedded wideband coder with multiple enhancement layers and little compromise in performance when compared to non-embedded MTPC designs.
Subspace recombination of multiple partially adaptive beamformer outputs
Authors: E. J. Baranoski
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

In many adaptive radar applications the steering vector may not be known exactly, but may be assumed to fall within a subspace. A common theme in adaptive beamformers is to project the data into a lower dimensional space which contains the interference to be nulled, as well as the target of interest. In several applications which we describe in detail (target acceleration, sector surveillance, multipath, and wideband processing) the target of interest lies in a target subspace which spans a collection of such interference subspaces. This paper presents a general technique of recombining the outputs of several interference subspace adaptive nulling beamformers, each which contain a "piece" of the desired target. The technique is shown to be simultaneously a maximizer of the SINR across the subspaces, as well as a maximum likelihood estimator (for the cases of both known and unknown interference covariance matrices) of the target waveform, and a GLRT detector when suitably normalized. We describe the structure of the estimator for the four cases discussed above, and describe a simplified version which obviates the need to estimate the noise coherence in the span of the adaptive beamformer outputs.
Capturing and Replaying Architectural Knowledge through Derivational Analogy
Authors: Ibrahim Habli, Tim Kelly
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

The architecture definition activity of complex systems is intellectually intensive - consuming much of the design time and budget. Rather than being regarded merely as a collection of views, software architecture can also be regarded as a collection of design decisions, such as tactics and design patterns, which are embodied in the architectural process. Therefore, the reuse of the architecture would be naïve if only carried out based on the architectural views, i.e. without regard to the design reasoning behind the architectural process. In this paper we review an approach to defining new software architectures through the use of derivational analogy, i.e. by replaying the process, sequence of decisions, behind the definition of a previously defined architecture. We conclude that, without the design reasoning, the reuse of the architecture would be a risky process, which can violate original design assumptions and dependencies.
Induced tagging: promoting resource discovery and recommendation in digital libraries
Authors: J. Alfredo Sánchez, Adriana Arzamendi-Pétriz, Omar Valdiviezo
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

We introduce the notion of "induced tagging" in the context of learning communities that are supported by digital libraries. We also describe an environment aimed to foster discovery and recommendation of digital library resources based on induced tagging.
Architecture independent short vector FFTs
Authors: F. Franchetti
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

This paper introduces an SIMD vectorization for FFTW-the "fastest Fourier transform in the west" proposed by Frigo and Johnson (see Proceedings of the ACM SIGPLAN '99 , p.169-180, 1999). The new method leads to an architecture independent short vector SIMD FFT vectorization that utilizes the architecture adaptivity of FFTW. It is based on special FFT kernels (up to size 64 and more) that are utilized by FFTW to compute the whole transform. This vectorization supports all features of complex transforms in FFTW (arbitrary size, dimension and stride of the data vector; in-place and out-of-place transforms) and is fully transparent to the user. It is suitable for arbitrary vector sizes of the underlying hardware.
Dynamic distance-based mobility management for PCS networks: a profile-based approach
Authors: G. Gupta, R. Garg
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

The location management scheme currently employed in personal communication networks is static. Dynamic schemes have been proposed in which the update and paging parameters are per-user based. We extend one of the most efficient dynamic schemes, the per-user distance-based scheme, so that the per-user parameters also change with time during the day depending on his observed records. We develop the mathematical formulation of the total radio-link cost and propose an algorithm to calculate the optimum parameters which minimize it for a given record. Further, we compare the proposed scheme with the distance based scheme through simulation. Results are provided to demonstrate the cost effectiveness of the proposed scheme under various parameters.
A Grid Infrastructure for Utility Computing
Authors: Ignacio M. Llorente, Ruben S. Montero, Eduardo Huedo, Katia Leal
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

Utility computing is a service provisioning model, which will provide adaptive, flexible and simple access to computing resources, enabling a pay-per-use model for computing similar to traditional utilities such as water or electricity. The deployment of a utility com- puting solution involves a full separation between the provider and the consumer. The consumer requires a uniform, secure and reliable functionality to access the utility computing service and the provider requires a scalable, flexible and adaptive infrastructure to provide the service. The solution should be based on standards and allow a gradual deployment in order to obtain a favourable response from the application developers and the information technology staff. Grid technology over- comes such challenges by means of its standard func- tionality for flexible integration of diverse distributed resources. This position paper proposes an innovative solution for utility computing which can be deployed on a Grid infrastructure based on Globus toolkit and Grid- Way components
Including engineering students
Authors: M. R. Anderson-Rowland
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

The recruitment and retention of engineering students is a challenging process. Few students are choosing engineering as a major upon entry to college and over half of those who begin engineering do not graduate with an engineering degree. Research has shown that the sense of belonging or being "included" is a major factor in the retention of engineering students. Among the factors of a student who is at risk of dropping out are low income, minority, first-generation college, commuter, campus social isolation, and poor social adjustment. Recognizing the need for students to be included, the College of Engineering and Applied Sciences at Arizona State University has taken several steps to break down the walls of non-inclusiveness. A strong infrastructure for student support is contained in the Office of Student Affairs and Special Programs. Within this structure are special programs for recruiting and retaining female, ethnic minority and freshmen students. These programs and their impact on retention are discussed, with special attention paid to commuter students. An evaluation of the "inclusive" programs and plans for future endeavors are given.
Falling off the cliff: when systems go nonlinear
Authors: Yvonne Coady, Russ Cox, John DeTreville, Peter Druschel, Joseph Hellerstein, Andrew Hume, Kimberly Keeton, Thu Nguyen, Christopher Small, Lex Stein, Andrew Warfield
Venue: Proceedings of the 10th conference on Hot Topics in Operating Systems - Volume 10 (2005)

As the systems we build become more complex, understanding and managing their behavior becomes more challenging. If the system's inputs are within an acceptable range, it will behave predictably. However, the system may "fall off the cliff" if input values are outside this range. This nonlinear behavior is undesirable, because the system no longer behaves predictably: it may not be possible to use, control or even recover the system. In this paper, we describe what it means for a system to fall off the cliff. We outline methods for detecting and predicting these modes of nonlinear behavior, and propose several approaches for designing systems to cope with these instabilities, or to avoid them altogether. We conclude by outlining open research questions for investigation by the systems community.
A Beacon Selection Algorithm for Bounded Error Location Estimation in Ad Hoc Networks
Authors: Koushik Sinha, Atish Datta Chowdhury
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

We consider the class of ad hoc networks, where a small percentage of the nodes are assumed to know their locations a priori and are denoted as reference nodes. Starting from the reference nodes, location information of other nodes are estimated in a hop by hop fashion. Beacon nodes are defined to be nodes that already have a location information (including the reference nodes). Using a two-dimensional cartesian coordinate system, we show that given a maximum of \pm \in error in the location of each of the beacon nodes and a maximum error of \pm \delta in each of the measured ranges along either axes, the location of a node can be computed within an error bound of \pm [3\in(1+\sqrt 2) + 2\delta] to \pm(3\in + 2\delta) along one axis and within \pm[2\delta(1+\sqrt 2) + 3\in] to \pm(3\in + 2\delta) along its orthogonal axis, by using the beacon selection algorithm proposed in this paper.
Point-based modeling, animation, and simulation system for computer graphics
Authors: Hong Qin
Venue:  (2006)

As 3D digital photographic and scanning devices produce higher resolution images, acquired geometric data sets grow more complex in terms of the modeled objects' size, geometry, and topology. As a consequence, point-sampled geometry is becoming ubiquitous in graphics and geometric information processing, and poses new challenges which have not been fully resolved by the state-of-art graphical techniques. In this dissertation, we address the challenges by proposing a novel framework for dynamic shape modeling, physical animation, and scientific simulation of point-sampled geometry. We developed the Point-based Modeling, Animation, and Simulation System, or P-MASS, for any scanned point geometry, without the need of converting them to polygonal meshes or higher order spline representations. This dissertation follows our development of the P-MASS framework. First, we propose to combine point-based geometry with implicit surface representation and integrate the mass-spring-based dynamic implicit volumetric model with the point-based geometry, in order to introduce physics-based modeling and haptics interface to the sculpting and deformation of point set surfaces. We further incorporate scalar-field guided free-form deformation (FFD) into our surface deformation system to further expand local and global surface editing functionality. In addition to the implicit surface approach, we systematically develop a global conformal parameterization method for point-sampled surfaces, which can serve as a foundation for many other graphics applications, such as physical simulation, shape registration, morphing, attribute transfer, and spline surface fitting of point set surfaces, etc. Finally, we develop a meshless computational framework to simulate the elastic deformation and crack propagation of the underlying point-based surface and volumetric physical model. Our P-MASS framework aims to bridge the gap between the point-sampled geometry with, physics-based modeling governed by partial differential equations. We have employed our methodologies in a wide variety of applications, including surface editing, reverse engineering and model restoration, solid modeling and simulation, attribute transfer and morphing, thin-shell elastic and fracture simulation, haptic rendering, etc. We describe these applications in detail and outline implementation issues pertaining to our framework.
Localization for Intermittently Connected Ad Hoc Networks
Authors: Wing Ho Yuen, Henning Schulzrinne
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

We consider localization for intermittently connected networks. Traditional localization approaches rely on network infrastructure such as access points (AP) as reference nodes or anchors, and do not work well when infrastructure is sparse. We propose a new class of localization scheme, where mobile nodes act as anchors for each other. Each node maintains an anchor table, storing its encounter history with APs and mobile nodes. When two nodes meet, they share their encounter history with each other, and jointly estimate the current location to form a new anchor. This dramatically increases the number of anchors for a mobile node, and reduces the localization error when position estimation is triggered by a user application. Both anchor formation and position estimation are formulated as a maximum likelihood (ML) estimation problem, by exploiting constraints of node location based on encounter history and mobility profile of nodes. Numerical examples are provided to illustrate properties of the ML estimator. We performed simulations and showed that localization error is independent of the anchor table size under a random walk mobility model. Thus, it suffices to store the most recent anchor, which simplifies implementation and is conducive to privacy. More importantly, localization error decreases as node density increases, and approaches the transmission range of mobile nodes when node density is sufficiently high.