ppxscal/embedding_network huggingface dataset:
Discourse with disposable computers: how and why you will talk to your tomatoes
Authors: David Arnold, Bill Segall, Julian Boot, Andy Bond, Melfyn Lloyd, Simon Kaplan
Venue: Proceedings of the Workshop on Embedded Systems on Workshop on Embedded Systems (1999)

Beyond ubiquitous computing, is the advent of disposable computing, occurring when the price of an embedded computer becomes insignificant compared to the cost of goods. Current software and network architectures and their associated programming paradigms will not scale to this new world. The necessity of catering for the constant change in number and type of devices of interest to a user, as well as their sheer quantity, dictates new approaches to construction of software systems based on more flexible models. We propose that distributed event notification forms a fundamental requirement for systems of this scale, and discuss the advantages of undirected communication over current interaction models. Our experience with Elvin, a prototype notification system motivates the discussion and serves as illustration of its possibilities.
Interactive learning with a digital library in computer science
Authors: E. A. Fox
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

We have developed tools, expanded our digital library systems and content, and built almost 5000 "pages" of WWW-accessible courseware, increasing the interactivity and quality of learning about computer science. Evaluation has shown that learning practices have changed, most students are happy with the emerging infrastructure and pedagogy, and there is growth in both local and remote access to our http://ei.cs.vt.edu server.
Beyond Boundary Objects: Collaborative Reuse in Aircraft Technical Support
Authors: Wayne G. Lutters, Mark S. Ackerman
Venue: Computer Supported Cooperative Work (2007)

Boundary objects are a critical, but understudied, theoretical construct in CSCW. Through a field study of aircraft technical support, we examined the role of boundary objects in the practical achievement of safety by service engineers. Their resolution of repair requests was preserved in the organization's memory via three compound boundary objects. These crystallizations did not manifest a static interpretation, but instead were continually reinterpreted in light of meta-negotiations. This suggests design implications for organizational memory systems which can more fluidly represent the meta-negotiations surrounding boundary objects.
Influence function analysis applied to partial least squares
Authors: Kjell Johnson, William Rayens
Venue: Computational Statistics (2007)

In this work we present the empirical influence functions for the covariances (eigenvalues) and directions (eigenvectors) of partial least squares under the constraint of uncorrelated components. We apply the results to several data sets and provide advice for using these tools in practice.
Program Comprehension through Software Habitability
Authors: Richard Wettel, Michele Lanza
Venue: Proceedings of the 15th IEEE International Conference on Program Comprehension (2007)

The comprehensive understanding of a large software system is a daunting task because of the sheer size and complexity that such systems exhibit. In this context software visualization is a widely used approach, since well-conceived visual representations allow one to spot patterns. The large majority of visualizations use 2D representations, because they are easier to construct, navigate, and interact with. 3D representations usually exploit the 3rd dimension as an additional means to encode quantitative values, which is dismissed by many as a too small benefit in the light of the added complexity in terms of navigation and interaction. We argue that a well-constructed, interactive, and easily navigable 3D visualization can greatly help in program comprehension tasks by supporting habitability. Habitability transmits to a developer the notion that a software system is a physical space with strong orientation points. This can give developers the feeling of being "at home" in a system. We propose a 3D visualization of software systems hinging on the city metaphor. It is useful for program comprehension because it leads to clarity about the overall structure of a system. We apply our visualization technique on two large systems and discuss its benefits and drawbacks.
A Pyramidal Approach to Content-Based Image Retrieval
Authors: Ze-Nian Li
Venue: Proceedings of the Geometric Modelling and Imaging (2007)

Search based on image contents is an important issue in large image and video databases. In this paper, two methods for a better content-based image retrieval (CBIR) are presented, namely, the use of recognition kernel and locales. Features of model objects are extracted at levels that are most appropriate to yield only the necessary yet sufficient details, together they form the kernel. Instead of relying on image segmentation, a method of feature localization based on locales is developed. It is shown that the deployment of the recognition kernel and locales in a pyramidal (multiresolution) framework delivers good retrieval results.
Preemption Threshold Scheduling: Stack Optimality, Enhancements and Analysis
Authors: Rony Ghattas, Alexander G. Dean
Venue: Proceedings of the 13th IEEE Real Time and Embedded Technology and Applications Symposium (2007)

Using preemption threshold scheduling (PTS) in a multi-threaded real-time embedded system reduces system preemptions and hence reduces run-time overhead while still ensuring real-time constraints are met. However, PTS offers other valuable benefits. In this paper we investigate the use of PTS for hard real-time system with limited RAM. Our primary contribution is to prove the optimality of PTS among all preemption-limiting methods for minimizing a system's total stack memory requirements. We then discuss characteristics of PTS and show how to reduce average worst-case response times. We also introduce a unified framework for using PTS with existing fixed-priority (e.g. rateor deadline-monotonic), or dynamic-priority scheduling algorithms (e.g. earliest-deadline first). We evaluate the performance of PTS and our improvements using synthetic workloads and a real-time workload. We show PTS is extremely effective at reducing stack memory requirements. Our enhancements to PTS improve worst-case response-times as well.
Proceedings of the 16th international symposium on High performance distributed computing
Venue: High Performance Distributed Computing (2007)

Welcome to the High Performance Distributed Computing 2007. Once again, this years HPDC features an exciting, high-quality single track program with topics across the spectrum of areas of interest to the high-performance distributed computing community. The quality of the program reflects the tireless efforts of the program co-chairs Dr. Jack Dongarra from the University of Tennessee and Dr. David Walker from Cardiff University. Each paper received a careful and thorough review by members of the program committee and I wish to thank them for the effort and thought that they put into the reviewing process. I would also like to thank Dr. Ian Foster and the University of Chicago for hosting the program committee meeting. Over the years, the workshop program has become an important part of HPDC and this year is no exception. The workshops this year were organized by Dr. Ann Chervenak. The excellent range of workshops that we have is due in no small part to her efforts. I would also like to thank all of the workshop chairs the time and effort they have put into organizing their respective workshop programs and proceedings. I would also like to thank Kelly Sutton at the University of Arizona for her efforts in coordinating conference arrangements including the hotel and publications. This year marks the sixteenth year that HPDC has been held. Both the conference and HPDC as a field have come along way from the first meeting held in Syracuse, New York. We are now at a point where there are production high performance computing infrastructures operating at global level and HPDC is playing a critical role in solving some of the most challenging and important problems facing us today. I believe that the knowledge exchanged and the community built by HPDC over the past sixteen years has played a significant role in these advances. On a personal note, the past year saw the passing of two prominent members of the HPDC community. Both Ken and Jim had made significant contributions to the high performance distributed computing and they will be missed.
Mining, indexing and similarity search in large graph data sets
Authors: Jiawei Han
Venue:  (2006)

Scalable analytical algorithms and tools for large graph data sets are in great demand across domains from software engineering to computational biology as it is very difficult, if not impossible, for human beings to manually analyze any reasonably large collection of graphs due to their high complexity. In this dissertation, we investigate two long standing fundamental problems: Given a graph data set, what are the hidden structural patterns and how can we find them? and how can we index graphs and perform similarity search in large graph data sets? Graph pattern mining is an expensive computational problem since subgraph isomorphism is NP-complete. Previous solutions generate inevitable overheads since they rely on joining two graphs to form larger candidates. We develop a graph canonical labeling system, gSpan, showing both theoretically and empirically that this kind of join operation is unnecessary. Graph indexing, the second problem addressed in this dissertation, may incur an exponential number of index entries if all of the substructures in a graph database are used for indexing. The solution, gIndex, proposes a novel, frequent and discriminative graph mining approach that leads to the development of a compact but effective graph index structure that is orders of magnitude smaller in size but an order of magnitude faster in performance than traditional approaches.Besides graph mining and search, this dissertation provides thorough investigation of pattern summarization, pattern-based classification, constraint pattern mining, and graph similarity searching, which could leverage the usage of graph patterns. It also explores several critical applications in bioinformatics, computer systems and software engineering, including gene relevance network analysis for functional annotation, and program flow analysis for automated software bug isolation.The developed concepts, theories, and systems may significantly deepen the understanding of data mining principles in structural pattern discovery, interpretation and search. The formulation of a general graph information system through this study could provide fundamental supports to graph-intensive applications in multiple domains.
Window-Oblivious Join: A Data-Driven Memory Management Scheme for Stream Join
Authors: Ji Wu, Kian-Lee Tan, Yongluan Zhou
Venue: Proceedings of the 19th International Conference on Scientific and Statistical Database Management (2007)

Memory management is a critical issue in stream processing involving stateful operators such as join. Traditionally, the memory requirement for a stream join is query-driven: a query has to explicitly define a window for each (potentially unbounded) input. The window essentially bounds the size of the buffer allocated for that stream. However, outputs produced by such approach may not be desirable (if the window size is not part of the intended query semantic) due to the volatile input characteristics. We discover that when streams are ordered or partially ordered, it is possible to use a data-driven memory management scheme for improved performance. In this work, we present a novel data-driven memory management scheme, called Window-Oblivious Join (WO-Join), which adaptively adjusts the state buffer size according to the input characteristics. Our performance study shows that, compared to traditional Window-Join (W-Join), WO-Join is more robust with respect to the dynamic inputs and therefore produces higher quality results with lower memory costs.
Application of dimensionality reduction techniques to HRTFS for interactive virtual environments
Authors: Bill Kapralos, Nathan Mekuz
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

Fundamental to the generation of 3D audio is the HRTF processing of acoustical signals. Unfortunately, given the high dimensionality of HRTFs, incorporating them into dynamic/interactive virtual environment and gaming applications is computationally very demanding. This greatly limits the performance of such applications that incorporate real-time 3D audio. This paper examines the application of data reduction models to HRTFs. In particular, the locally linear Isomap, Locally Linear Embedding (LLE), and the globally linear Principal Components Analysis (PCA) dimensionality reduction tools are applied to the MIT HRTF dataset. Our motivation is to project the inherently high-dimensional space inherent in HRTF measurements onto a lower dimensionality such that they can be incorporated into interactive virtual environments and gaming applications.
A Web-based computer architecture course database
Authors: E. F. Gehringer
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

A Web-based database of course materials in computer architecture is being developed. Its goal is to allow instructors at different institutions to share independently developed materials and to develop new materials jointly. This database comprises problems and lectures downloaded (with permission) from the Websites of courses in computer architecture at universities around the world. The site is searchable by classification or fulltext string for problems on particular topics. Instructors can obtain accounts that will allow them to browse the database content and loan their questions directly. A Java application is being developed to further automate the process. This project has been developed in conjunction with the WebAssign project for on-line homework submission and grading. Where the format permits, homework and test problems can be automatically graded. Although this prototype is specific to the field of computer architecture, the software for building the database is usable for constructing databases in almost any academic field.
Processing arbitrary-length signals with MDFT filter banks
Authors: T. Karp
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

In this paper, methods for processing arbitrary-length input signals with MDFT filter banks are presented. The MDFT filter bank can be regarded as the most general type of a special class of filter banks. These filter banks have linear phase analysis filters, but different centers of symmetry due to subsampling with and without a phase shift. Already known extension methods cannot be applied to these filter banks in their original form. We first discuss the symmetric extension for two special input signal lengths. These cases are then incorporated in the general solution for arbitrary-length input signals.
Performance of Optical Burst Switched Networks for Grid Applications
Authors: Nuno M. Garcia, Manuela Pereira, Mario M. Freire, Paulo P. Monteiro, Przemyslaw Lenkiewicz
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

This paper presents a performance assessment of optical burst switching (OBS) networks for grid applications, focusing on effective usable bandwidth and mean burst end-to-end delay for several burst loss ratios scenarios and network topologies. We show that for burst loss ratio scenarios that are not too punitive, OBS can still deliver fast and fair transmission of data between any two nodes. For irregular topologies, we also show the occluded node effect using a new set of OBS network evaluation statistics and assess the usable bandwidth for three studied topologies as a ratio of the overall network bandwidth and the effectively used resources.
Improving student learning with group assignments
Authors: D. McDonald
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

Group assignments in a cooperative learning environment can improve student learning. The paper discusses the use of cooperative learning in a junior level electronics course where the students work in groups on both complex classroom problems and laboratory projects. The discussion outlines the types of assignments and presents an evaluation of the use of the cooperative learning method in this course. Although the paper focuses on the application of cooperative learning in an electronics course, the method and the types of assignments are appropriate for any problem solving course. 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
Efficient Microprocessor Verification using Antecedent Conditioned Slicing
Authors: Shobha Vasudevan, Vinod Viswanath, Jacob A. Abraham
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

We present a technique for automatic verification of pipelined microprocessors using model checking. An- tecedent conditioned slicing is an efficient abstraction tech- nique for hardware designs at the Register Transfer Level (RTL). Antecedent conditioned slicing prunes the verifica- tion state space, using information from the antecedent of a given LTL property. In this work, we model instructions of a pipelined processor as LTL properties, such that the instruc- tion opcode forms the antecedent. We use antecedent condi- tioned slicing to decompose the problem space of pipelined processor verification on an instruction-wise basis. We pass the resulting smaller, tractable problems through a lower level verification engine.We thereby verify that every instruction behaves accord- ing to the specification and ensure that non-target registers are not modified by the instruction. We use the SMV model checker to verify all the instruction classes of a Verilog RTL implementation of the OR1200, an off-the-shelf pipelined processor.
Using optimum transmission range to design energy efficient systems for the neuRFon/spl trade/ Netform
Authors: P. Chen, B. O'Dea, E. Callaway
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

NeuRFon/spl trade/ Netform is a sensor network made up of very low cost, low power, wireless devices (neuRFon/spl trade/ devices) that are relatively static, and are pervasively deployed throughout the environment. In this paper, we are interested in finding the relationship between the optimum one-hop transmission distance and the transceiver device parameters that will minimize the total system energy. Our analysis assumes that the individual neuRFon/spl trade/ devices do not have power control and therefore will transmit at a common range. Our results show that the optimum one-hop transmission distance is independent of the physical network topology, the number of transmission sources, and the total transmission distance. It only depends on the propagation environment and the device parameters. The implications and usefulness of this result on present day transceiver devices are also discussed.
DFT computation using shift and addition operations
Authors: N. Bhatnagar
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

Bhatnagar (see Signal Processing, vol.43, p.93-101, 1995) introduced Ramanujan numbers to implement the discrete fourier transform (DFT) without using any multiplication operation. Ramanujan numbers are related to /spl pi/ and integers which are powers of 2. The computational complexity of the algorithms used, for computing a transform of size N, is O (N/sup 2/) addition and shift operations. In these algorithms, the transform can be computed sequentially with a single adder in O(N/sup 2/) addition times. Parallel implementation of the algorithm can be executed in O(N) addition times, with O(N) number of adders. Use and properties of Ramanujan numbers of order-1 were discussed by Bhatnagar. In this paper, the properties of Ramanujan numbers of order-2, and their application to DFT are discussed. For the same range of values of N, the DFT computation using Ramanujan numbers of order-2 is generally more accurate than using Ramanujan numbers of order-1. Some of these Ramanujan numbers of order-2 are related to the biblical and Babylonian values of /spl pi/. 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
Implementing IPv6 for Windows NT
Authors: Richard P. Draves, Allison Mankin, Brian D. Zill
Venue: Proceedings of the 2nd conference on USENIX Windows NT Symposium - Volume 2 (1998)

We have created a publicly-available implementation of IPv6 for Windows NT. Because we have made our source code available, we hope that our implementation can serve as a base for networking research and supply sample code for other implementations. In this paper we describe our solutions for several problems that any network protocol implementation for Windows NT will encounter. Based on our experience, we also comment on the utility of access to the source code for the Windows NT product.
Generalization of the cyclic convolution system and its applications
Authors: H. Murakami
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

This paper introduces a generalized cyclic convolution which can be implemented via the conventional cyclic convolution system by the discrete Fourier transform (DFT) with pre-multiplication for the input and post-multiplication for the output. The generalized cyclic convolution is applied for computing a negacyclic convolution. Comparison shows that the proposed implementation is more efficient and simpler in structure than other methods. The generalized cyclic convolution is also applied for the linear convolution by the modified Fermat number transform.
A Simple Estimate of the Cost of Software Project Failures and the Breakeven Effectiveness of Project Risk Management
Authors: Stephen P. Masticola
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Based on easily obtained data, a rough (but simple) estimate of the cost to an enterprise of software project failures can be formed. Using similar analysis, it is possible to estimate the effectiveness that a software quality improvement project will need to have upon the project failure rate in order to break even economically. This provides an informal calculation that can be used to cost-justify either a more complete investigation or risk management.