ppxscal/embedding_network huggingface dataset:
Enabling Real-Time Querying of Live and Historical Stream Data
Authors: Frederick Reiss, Kurt Stockinger, Kesheng Wu, Arie Shoshani, Joseph M. Hellerstein
Venue: Proceedings of the 19th International Conference on Scientific and Statistical Database Management (2007)

Applications that query data streams in order to identify trends, patterns, or anomalies can often benefit from comparing the live stream data with archived historical stream data. However, searching this historical data in real time has been considered so far to be prohibitively expensive. One of the main bottlenecks is the update costs of the indices over the archived data. In this paper, we address this problem by using our highly-efficient bitmap indexing technology (called FastBit) and demonstrate that the index update operations are sufficiently efficient for this bottleneck to be removed. We describe our prototype system based on the TelegraphCQ streaming query processor and the FastBit bitmap index. We present a detailed performance evaluation of our system using a complex query workload for analyzing real network traffic data. The combined system uses TelegraphCQ to analyze streams of traffic information and FastBit to correlate current behaviors with historical trends. We demonstrate that our system can simultaneously analyze (1) live streams with high data rates and (2) a large repository of historical stream data.
A multistage search of algebraic CELP codebooks
Authors: M. A. Ramirez
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

A joint amplitude and position search procedure is proposed for searching algebraic multipulse codebooks. It is implemented within the reference G.723.1 codec as an example. This joint search method is shown to reduce down to one third the number of comparisons per subframe relative to the focused search over an extensive speech database. An efficient implementation of the joint search is derived which incorporates backward filtering of the residual target vector and precomputation of autocorrelation elements, bringing about a reduction in complexity of one-third in comparison to the focused search. The joint search performs about one thirtieth as many comparisons as the full position search.
Design tradeoffs in CMOS FIR filters
Authors: C. Nagendra, M. J. Irwin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

FIR filtering is one of the basic operations in digital signal processing. To cope with the increasing demands on the speed of DSP processors for real-time and mobile applications, it is important to identify design techniques which help us build very high speed, low power filters. In this paper, we first investigate the effects of multiplier recoding which is a popular technique to increase the speed of multipliers. Next, we propose a method for reducing the activity factor, and hence the power consumption, of multipliers by using gated clocks. Lastly, we look at pipelining issues in multi-hundred MHz filters. In pipelined systems a large fraction of the total power is consumed by the clock circuitry. We compare the power and speed of bit, half-bit and gate level pipelining techniques in multipliers.
ReLAx: implementing KALA over the reflex AOP kernel
Authors: Johan Fabry, Éric Tanter, Theo D'Hondt
Venue: Proceedings of the 2nd workshop on Domain specific aspect languages (2007)

Domain-specific aspect languages (DSALs) bring the well-known advantages of domain specificity to the level of aspect code. However, DSALs incur the significant cost of implementing or extending a language processor or weaver. This raises the necessity of an appropriate infrastructure for DSALs. This paper illustrates how the Reflex kernel for multi-language AOP allows for the definition of DSALs, by considering the implementation of a DSAL for advanced transaction management, KALA. We detail the implementation of KALA in Reflex, illustrating the ease of implementation of runtime semantics, syntax, and language translation.
Developing drivers and extensions for XFree86-4.x
Authors: Dirk Hohndel, Robin Cutshaw
Venue: Proceedings of the 4th annual Linux Showcase & Conference - Volume 4 (2000)

This paper gives an introduction to driver development for XFree86-4.x. After a quick analysis of the existing problems in the previous XFree86 design, it describes the module loading architecture and the key interfaces that a graphics hardware driver for XFree86 must support.
A uniform transform domain video codec based on dual tree complex wavelet transform
Authors: K. Sivaramakrishnan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

This paper describes a uniform transform domain video codec where the motion estimation/compensation (ME) is performed in the transform domain. The estimation technique discussed here is a subpixel transform domain ME based on the dual tree complex wavelet transform (DT CWT) and a maximum phase correlation technique. The DT CWT is a multiresolution fine-to-coarse bandpass filtered decomposition of each still frame and has desirable properties of shiftability, directional selectivity and perfect reconstruction (PR). Estimation is first performed at the finest resolution and successively proceeds to the coarse resolutions using a fine-to-coarse strategy. This gives multiresolution motion estimates enabling estimation of current frame transform coefficients from the corresponding ones in the previous frame. The key difference of this approach is the transform domain error frames-a uniform transform domain video codec. This further simplifies the encoder and decoder resulting in computational savings with comparable performance to the standards.
The Social Efficiency of Fairness: An Innovation Economics Approach to Innovation
Authors: Gavin Clarkson, Marshall Van Alstyne
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Certain default rules for adjudicating property rights disputes retard innovation by discouraging information sharing. Reasons, identified as far back as Arrow 1962, include inspecting the value of information and uncertainty over future contingent claims. In response, we propose a solution based on a simple definition of "fairness." This unblocks innovation by increasing willingness to share private information.
A Real-Time Virtual Environment Rendering System
Authors: Hongbin Deng, Yihua Xu, Li Wang
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

In this paper, we describe a rendering system that is capable of capturing and rendering dynamic environments at about 20 fps using a commercially available PC (1.8 GHz single processor) and IEEE 1394 cameras (each with resolution of 320×240). It does not rely on any additional custom hardware. Such a system permits streaming applications that involve real-time view synthesis from multiple cameras, such as 3-D teleconferencing or chatting. View synthesis is performed using the closest two cameras, and relies on plane sweeping to produce a photoconsistent virtual image. In addition, an alpha matte is estimated at the virtual view in order to improve the rendering quality at the foreground/background boundaries. We illustrate the performance of our system on several dynamic environment examples.
Sensor network security: more interesting than you think
Authors: Madhukar Anand, Eric Cronin, Micah Sherr, Matt Blaze, Zachary Ives, Insup Lee
Venue: Proceedings of the 1st USENIX Workshop on Hot Topics in Security (2006)

With the advent of low-power wireless sensor networks, a wealth of new applications at the interface of the real and digital worlds is emerging. A distributed computing platform that can measure properties of the real world, formulate intelligent inferences, and instrument responses, requires strong foundations in distributed computing, artificial intelligence, databases, control theory, and security. Before these intelligent systems can be deployed in critical infrastructures such as emergency rooms and powerplants, the security properties of sensors must be fully understood. Existing wisdom has been to apply the traditional security models and techniques to sensor networks. However, sensor networks are not traditional computing devices, and as a result, existing security models and methods are ill suited. In this position paper, we take the first steps towards producing a comprehensive security model that is tailored for sensor networks. Incorporating work from Internet security, ubiquitous computing, and distributed systems, we outline security properties that must be considered when designing a secure sensor network. We propose challenges for sensor networks-security obstacles that, when overcome, will move us closer to decreasing the divide between computers and the physical world.
Convergence analysis of an oversampled subband adaptive filtering structure using global error
Authors: R. G. Alves
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

Subband adaptive filtering has been studied by a large number of researchers. The main alternatives are structures with critical sampling and noncritical sampling, that use local errors or global error in the adaptation algorithm. In this paper a theoretical convergence analysis of an oversampled subband adaptive filtering structure with global error is presented. The convergence rate of the adaptation algorithm can be estimated from the results of this analysis. Computer simulations are presented to illustrate the convergence behavior of the subband adaptive algorithm and to verify the theoretical results.
Python Unleashed on Systems Biology
Authors: Christopher R. Myers, Ryan N. Gutenkunst, James P. Sethna
Venue: Computing in Science and Engineering (2007)

Researchers at Cornell University have built an open source software system to model biomolecular reaction networks. SloppyCell is written in Python and uses third-party libraries extensively, but it also does some fun things with on-the-fly code generation and parallel programming.
Random-Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation
Authors: Francois Fouss Alain Pirotte, Jean-Michel Renders Marco Saerens
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted and undirected graph. It is based on a Markov-chain model of random walk through the database. More precisely, we compute quantities (the average commute time, the pseudoinverse of the Laplacian matrix of the graph, etc.) that provide similarities between any pair of nodes, having the nice property of increasing when the number of paths connecting those elements increases and when the "length” of paths decreases. It turns out that the square root of the average commute time is a Euclidean distance and that the pseudoinverse of the Laplacian matrix is a kernel matrix (its elements are inner products closely related to commute times). A principal component analysis (PCA) of the graph is introduced for computing the subspace projection of the node vectors in a manner that preserves as much variance as possible in terms of the Euclidean commute-time distance. This graph PCA provides a nice interpretation to the "Fiedler vector,” widely used for graph partitioning. The model is evaluated on a collaborative-recommendation task where suggestions are made about which movies people should watch based upon what they watched in the past. Experimental results on the MovieLens database show that the Laplacian-based similarities perform well in comparison with other methods. The model, which nicely fits into the so-called "statistical relational learning” framework, could also be used to compute document or word similarities, and, more generally, it could be applied to machine-learning and pattern-recognition tasks involving a relational database.
Class-based identification of underwater targets using hidden Markov models
Authors: N. Dasgupta
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

It has been demonstrated that hidden Markov models (HMM) provide an effective architecture for classification of distinct targets from multiple target-sensor orientations. We present a methodology for designing class-based HMM that are well suited to the identification of targets with common physical attributes. This approach provides a means to form associations between existing target classes and data from targets never observed in training. After performing a wavefront-resonance matching-pursuits feature extraction, we present an information theoretic tree-based state-parsing algorithm to define the HMM state structure for each target class. In training, class association is determined by minimizing the statistical divergence between the target under consideration and each existing class, with a new class defined when the target is poorly matched to each existing class The class-based HMM are trained with data from the members of its corresponding class, and tested on previously unobserved data. Results are presented for simulated acoustic scattering data.
Design of Financial CDO Squared Transactions Using Constraint Programming
Authors: Pierre Flener, Justin Pearson, Luis G. Reyna, Olof Sivertsson
Venue: Constraints (2007)

We give an approximate and often extremely fast method of building a particular kind of portfolio in finance, here called a portfolio design (PD), with applications in the credit derivatives market, for example when designing collateralised debt obligations squared (CDO2) transactions. A PD generalises a balanced incomplete block design (BIBD) and is usually harder to build. Worse, typical financial PDs are an order of magnitude larger than the largest BIBDs built so far by constraint programs, and in practice an optimisation version of the problem of building PDs has to be solved. Our method is based on embedding small designs, whose determination is itself a constraint satisfaction problem, into the original large design. Together with the detection of when a PD might be a BIBD, symmetry breaking, extended reuse of previously built PDs, and admissibility checking during search, the performance of the method becomes good enough for designing (near-)optimal CDO2 transactions, with sizes common in the credit derivatives market, within minutes. For example, we optimally build a typical financial PD, which has over 10746 symmetries, in just a few minutes. The high quality of our approximate designs can be assessed by comparison with a lower bound on the optimum. Our designs sufficiently improve the currently best ones so as often to make the difference between having and not having a feasible CDO2 transaction due to investor and rating-agency constraints.
Learning onomatopoeic expressions by animation
Authors: Miki Namatame, Fusako Kusunoki
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

This paper focuses on a design solution to Japanese onomatopoeic accessibility problems for the hard-of-hearing. Our research suggests that the onomatopoeic expressions accompanied by animation would be able to transmit emotional images of words. The animations were more effective than text or video clips. We believe that an animation dictionary would be an effective educational material that is understandable by hard-of-hearing students.
Nested Difference Tests for Examining Effects of Dependability on Enterprise Applications Success in E-Business
Authors: Jung-Yu Lai, Chun-Chieh Yang
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Electronic business (e-business) plays a major role in the modern economic network due to shorter cycle time and faster information transactions. Building enterprise applications that can coordinate activities, decisions, and knowledge cross many functions is a good solution for e-business. Hence, how to implement enterprise applications successfully has become an increasingly important management issue. Although information systems (IS) success has received fairly extensive attention from prior research, issues regarding whether service delivered by systems can be justifiably relied by users are seriously ignored, especially for complex systems like enterprise applications. Thus, this paper attempts to extend this kind of concept, perceived dependability, into the DeLone & McLean's IS success model for exploring how it influences enterprise applications success. Results from a survey of 170 respondents taken from six international e-businesses in Taiwan strongly support that dependability is indeed an important factor for enterprise applications success. Additionally, over and beyond the effects of dependability on enterprise applications success, it can help practitioners and managers get deep insights about how to implement e-business successfully.
An Annotation-Based Framework for Parallel Computing
Authors: C. A. Cunha, J. L. Sobral
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

This paper presents a programming language for parallel computing based on code annotations. It has similar goals and philosophy as OpenMP but it is more tightly coupled to the object oriented paradigm. We include annotations for most common concurrency patterns and mechanisms, namely, one-way, futures, barriers, reads/writers and thread-local. Our current prototype is implemented using Java 5 annotations and AspectJ and provides a feasible and efficient alternative to the Java thread model.
A Multi-view Toolkit to Assist Software Integration and Evolution
Authors: Kamran Sartipi
Venue: Proceedings of the 11th European Conference on Software Maintenance and Reengineering (2007)

Software product line engineering aims at producing functionally similar software systems as a family of products. In this process, the development life cycle has been shifted from traditional activities into reusecentric and customizable component approaches. In software product line engineering from existing systems many technical, organizational, and user-adoption problems need to be dealt with by the means of proper tool support. In this context, we provide a supporting toolkit that blends the behavior and structure recovery techniques in order to localize the major components of the existing systems as candidates for generic or reusable components. An integration of the reusable and new components will form a domain reference architecture, whose instantiation will produce the products. For each new product the scattering of the added features in the structure of the original components will be determined by the means of two metrics to assess the functional cohesion and feature functional scattering. This allows us to control the structural evolution of the product line engineering process.
"Elegant" problem solving model for effective learning and applications
Authors: H. Khan
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

The objective of this paper is the development of a concept of problem solving in industrial technology majors from theory to practice. In studying industrial technology subjects, where the rigor is not on mathematics or deep concepts, but problem solution, students are exposed to some classical techniques of industrial engineering, production and operations research, and engineering economics problems. Although some good students "all too often "pick up" problem solving skills through experience or as a bye product of doing exercises". It has been invariably, seen that they never learn the problem solving strategies for efficient and elegant solutions. 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
Teacher responses to student gender differences
Authors: M. M. Voyles, S. M. Haller, T. V. Fossum
Venue: ACM SIGCSE Bulletin (2007)

The recent uncertainties in computer science (CS) enrollments have prompted computer science educators to seek ways to increase interest in CS, especially among women. Several current approaches to increasing gender balance in CS have been based on pre-college intervention, recruitment, and curriculum change. Less attention has been paid to the ways in which instructors respond differently - even unconsciously - to females and males in computer science learning environments, and whether these differences can affect achievement or interest in CS. Our study looks at early learners (fourth through sixth graders, where gender differences seem first to become more prominent) and their teachersin a summer enrichment program using robotics. We examine the ways teachers interact with groups of girls and of boys and the changes in attitude and achievement shown by the girls and boys during the summer programs. These observations help us understand the extent to which teachers can affect student interest in computing and can prepare us better to address the ways in which we can achieve CS gender balance.
Open Source Software Adoption in ASEAN Member Countries
Authors: Joshua L. Mindel, Lik Mui, Sameer Verma
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This paper investigates the extent to which Open Source software is being adopted for web hosts within member countries of the Association of South East Asian Nations (ASEAN), and provides a partial explanation. We explain how Open Source software adoption decisions are influenced by macro-level or environmental influences (e.g. government policy, Open Source community). We use proxies based on empirical data collection to provide insight into the degree of Open Source software adoption which has already occurred. Software tools were developed to analyze web host software on the public Internet within each ASEAN country's country-level domain. Other empirical indicators include Linux User Group (LUG) existence and activity. The study found that government Open Source policies do not appear to be a consistent factor among those ASEAN countries with the highest degree of Open Source software adoption. Other environmental factors appear to be more influential at this point in time.
Probabilistic-topological calibration of widely distributed camera networks
Authors: Norimichi Ukita
Venue: Machine Vision and Applications (2007)

We propose a method for estimating the topology of distributed cameras, which can provide useful information for multi-target tracking in a wide area, without object identification among the fields of view (FOVs) of the cameras. In our method, each camera first detects objects in its observed images independently in order to obtain the positions/times where/when the objects enter/exit its FOV. Each obtained data is tentatively paired with all other data detected before the data is observed. A transit time between each paired data and their x&#x2013;y coordinates are then computed. Based on classifying the distribution of the transit times and the x&#x2013;y coordinates, object routes between FOVs can be detected. The classification is achieved by simple and robust vector quantization. The detected routes are then categorized to acquire the probabilistic-topological information of distributed cameras. In addition, offline tracking of observed objects can be realized by means of the calibration process. Experiments demonstrated that our method could automatically estimate the topological relationships of the distributed cameras and the object transits among them.