ppxscal/embedding_network huggingface dataset:
Interactive distance education for engineering outreach
Authors: K. Zunkel
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

Presents the experiences of using the Iowa Communications Network (ICN) as a method of teaching engineering extension workshops. Relevant research in education, distance education and adult education served as a basis for developing the content, structure and presentation styles for these workshops. Techniques used to create an interactive experience for participants at remote locations are presented. Discussion focuses on the experiences and success of using the ICN for short workshops and a brief comparison of the advantages offered by multi-week courses. Participants rated the use of the ICN for extension purposes as a 3.0 on a 0-4 scale.
The effects of interaction technique on coordination in tabletop groupware
Authors: Miguel A. Nacenta, David Pinelle, Dane Stuckel, Carl Gutwin
Venue: Proceedings of Graphics Interface 2007 (2007)

The interaction techniques that are used in tabletop groupware systems (such as pick-and-drop or pantograph) can affect the way that people collaborate. However, little is known about these effects, making it difficult for designers to choose appropriate techniques when building tabletop groupware. We carried out an exploratory study to determine how several different types of interaction techniques (pantograph, telepointers, radar views, drag-and-drop, and laser beam) affected coordination and awareness in two tabletop tasks (a game and a storyboarding activity). We found that the choice of interaction technique significantly affected coordination measures, performance measures, and preference - but that the effects were different for the two different tasks. Our study shows that the choice of tabletop interaction technique does indeed matter, and provides insight into how tabletop systems can better support group work.
Physical modeling of drums by transfer function methods
Authors: L. Trautmann
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

Multidimensional (MD) physical systems are usually given in terms of partial differential equations (PDEs). Similar to one-dimensional systems, they can also be described by transfer function models (TFMs). In addition to including initial and boundary conditions as well as excitation functions exactly, the TFM can also be discretized in a simple way. This leads to suitable implementations for digital signal processors. Therefore it is possible to implement physics based digital sound synthesis algorithms derived from TFMs in real-time. This paper extends the previously presented solution for vibrating strings with one spatial dimension to two-dimensional drum models.
Novel architectures for P2P applications: The continuous-discrete approach
Authors: Moni Naor, Udi Wieder
Venue: ACM Transactions on Algorithms (TALG) (2007)

We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of this approach by suggesting two new P2P architectures and various algorithms for them. The first serves as a DHT (distributed hash table) and the other is a dynamic expander network. The DHT network, which we call Distance Halving, allows logarithmic routing and load while preserving constant degrees. It offers an optimal tradeoff between degree and path length in the sense that degree d guarantees a path length of O(logd n). Another advantage over previous constructions is its relative simplicity. A major new contribution of this construction is a dynamic caching technique that maintains low load and storage, even under the occurrence of hot spots. Our second construction builds a network that is guaranteed to be an expander. The resulting topologies are simple to maintain and implement. Their simplicity makes it easy to modify and add protocols. A small variation yields a DHT which is robust against random Byzantine faults. Finally we show that, using our approach, it is possible to construct any family of constant degree graphs in a dynamic environment, though with worse parameters. Therefore, we expect that more distributed data structures could be designed and implemented in a dynamic environment.
CORDIC realization of the transversal adaptive filter using a trigonometric LMS algorithm
Authors: M. Chakraborty
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

This paper presents a class of pipelined CORDIC architectures for the LMS-based transversal adaptive filter. For this, an alternate formulation of the LMS algorithm is considered, obtained by expressing the mean square error as a convex function of a set of angle variables that are monotonically related to the filter tap weights. The proposed architectures employ microlevel pipelining and are adjustable to strike tradeoffs between throughput efficiency vis-a-vis hardware complexity.
Parser adaptation via Householder transform
Authors: Xiaoqiang Luo
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

We propose a method of adapting a statistical parser using a special orthogonal transform, the Householder transform. Probability mass functions (pmf) in the parser are first mapped to unit sphere, then the Householder transform is applied, which maps a point in unit sphere to another point in unit sphere. The final model is obtained by mapping the transformed point in unit sphere back to simplex through a square map. The proposed method is tested on a semantic parser, and over 20% relative reduction of parse errors can be achieved.
Audio-visual technologies for lecture and meeting analysis inside smart rooms
Authors: Gerasimos Potamianos
Venue: Proceedings of the HCSNet workshop on Use of vision in human-computer interaction - Volume 56 (2006)

Analysis of lecture meetings recorded inside smart rooms has recently attracted much interest, being the focus of international projects and technology evaluations. In this keynote, we briefly overview one such project, "Computers in the Human Interaction Loop" (CHIL), with emphasis on the perceptual technology components developed. In particular, we focus on person tracking and speech processing technologies, and present the developed IBM systems.
Which collaboration patterns are most challenging: A global survey of facilitators
Authors: Marielle den Hengst, Mark Adkins
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Facilitation is a key success factor for effective Group Support Systems (GSS) applications. The development of effective support for facilitation becomes more critical than ever as decision making groups are larger and globally distributed. Developing support for a facilitator is a promising avenue for creating successful distributed GSS. This paper presents the results of a questionnaire to attain valid information for determining which facilitation functions practicing facilitators find most and least challenging. This guides the development of support for facilitators. First, literature on facilitation functions and collaboration patterns is reviewed. Then a questionnaire is designed to collect data from over 171 facilitators around the globe. This questionnaire collects information on the collaboration patterns that are perceived most demanding for certain facilitation functions from a facilitators' perspective. Finally the data is analyzed and presented for discussion.
Analyzing intrusions using operating system level information flow
Authors: Peter M. Chen
Venue:  (2006)

Computers continue to get broken into, so intrusion analysis is a part of most system administrators' job description. System administrators must answer two main questions when analyzing intrusions: "how did the attacker gain access to my system?", and "what did the attacker do after they broke in?". Current tools for analyzing intrusions fall short because they have insufficient information to fully track the intrusion and because they cannot separate the actions of attackers from the actions of legitimate users.We designed and implemented a system for analyzing intrusions by using OS-level information flow to highlight the activities of an attacker. OS-level information flow is a collection of causal events which connect operating system objects. These causal events can be linked to form an information-flow graph which highlights the events and objects that are part of an attack. Information flow graphs can be used to help system administrators determine how an intruder broke into a system and what they did after the compromise. We developed BackTracker to determine how an intruder broke into a system. BackTracker starts with a suspicious object (e.g., malicious process, trojaned executable file) and follows the attack back in time, using causal events, to highlight the sequence of events and objects that lead to the suspicious state. Showing a graph of these causally-connected events and objects provides a system-wide view of the attack and significantly reduces the amount of data an administrator must examine in order to determine which application was originally exploited. We also developed ForwardTracker to determine the attacker's actions after the compromise. ForwardTracker starts from the application which was exploited and tracks causal events forward in time to display the information flow graph of events and objects that result from the intrusion. Furthermore, we designed and implemented Bi-directional Distributed BackTracker (BDB) which continues the backward and forward information flow graphs across the network to highlight the set of computers on a local network which are likely to have been compromised by the attacker.
Robust methods of updating model and a priori threshold in speaker verification
Authors: T. Matsui
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

We describe a method of updating a hidden Markov model (HMM) for speaker verification using a small amount of new data for each speaker. The HMM is updated by adapting the model parameters to the new data by maximum a posteriori (MAP) estimation. The initial values of the a priori parameters in MAP estimation are set using training speech used for first creating a speaker HMM. We also present a method of resetting the a priori threshold as the updating of the model proceeds. Evaluation of the performance of the two methods using 10 male speakers showed that the verification error rate was about 42% of that without updating.
Software license management with smart cards
Authors: Tuomas Aura, Dieter Gollmann
Venue: Proceedings of the USENIX Workshop on Smartcard Technology on USENIX Workshop on Smartcard Technology (1999)

This paper describes public-key protocols for binding software licenses to tamper-resistant smart cards, for transferring licenses between cards, and for purchasing them on-line. The protocols support software distribution both through retail stores and over the Internet. The user can transfer licenses from several cards onto a single card to avoid juggling between several cards in the reader. The protocols are based on signed delegation certificates that are mostly stored outside the smart card. A smart card reader and cards capable of public-key signatures are the only new hardware needed. The protocols are easy for the user and simple to implement and analyze. We prove the security of the transfer protocol.
Freshman year learning communities in a computer engineering program
Authors: D. Jacobson
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

Learning Communities, a growing initiative at Iowa State University, aid freshmen in the transition to college life as students live in the same residence hall and attend a common block of classes. By combining learning communities with the concept of student-centered active learning, students will gain control of and adjust more quickly to their new environment, experience increased achievement, and persist in the program. First year computer engineering students involved in the learning community participated in two new courses during the 1999/2000 academic year. The new courses were framed within the context of active learning to better prepare students for continuation in computer engineering by increasing their skills in group work and providing essential life-long learning skills. Students completed their freshman year with a greater awareness of complete, engineering, knowledge and skills for successful teamwork, and experience a quicker and more satisfying acclimation to the university and college life. The goal of project SUCCESS is 'to provide every student interested in Computer Engineering an opportunity, to succeed Iowa State University and to prepare him or her for their future careers." Engineering students take an academically challenging program of study beginning with rigorous courses in calculus, chemistry, and physics during their freshman year. While these courses are essential for providing a foundation upon which all engineering programs are based, many students find the courses difficult and elect not to continue their study of engineering. Project SUCCESS is an effort to help students survive the demands placed upon them as freshmen by providing a collaborative environment in which they will learn to seek assistance from and provide support to peers.
A bioinformatics track with outreach components
Authors: Mingrui Zhang, Chi-Cheng Lin, Gayle Olsen, Barbara Beck
Venue: Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education (2007)

Bioinformatics is a discipline that uses computational tools and computer technologies to model, analyze, present, and visualize biological data. In this paper, we discuss the design of a bioinformatics track within the computer science curriculum at Winona State University's Rochester campus. We also developed a bioinformatics course and used it as a mechanism for computer science outreach. Our outreach program is designed to target 6th to 12th grade science teachers and help them develop K-12 science projects with bioinformatics components.
Enhancing the hardware design experience for computer engineers
Authors: P. M. Maurer
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

People become engineers because they love to build things. With the recent progress in design automation tools, it is now possible to revise the core computer engineering curriculum to include realistic design experiences in virtually all courses, even those that are not usually thought of as being laboratory courses. The use of design automation makes it possible to assign a large number of simple design exercises in low-level courses, and a few more complex projects in more advanced courses. This paper describes enhancements to three core courses: logic design; computer architecture; and digital system design. These changes are based on a common set of tools that are used throughout the curriculum. Several design exercises are described, along with a suggested sequence for the various exercises. Several laboratory manuals have been developed for use with standard textbooks. The references provide pointers to web sites where the laboratory manuals and tools can be downloaded. Suggestions for textbooks for each course are provided, although the laboratory materials should be useful with a wide variety of texts. Classroom experience and student reactions are also reported.
Multiple phase detection and parameter estimation for processing seismic array data
Authors: Pei-Jung Chung
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

A broad-band maximum likelihood method is presented for detection of and parameter extraction from seismic events using wideband data recorded by an array of seismic stations. The statistical characteristics of finite Fourier transformed data motivate the use of approximate maximum likelihood (ML) methods which allow simultaneous detection and wave parameter estimation. The detection strategy based on the likelihood ratio can not only indicate the presence of a seismic event but can also detect different phases of seismic events arriving within a time interval of interest. The corresponding azimuths and apparent velocities of the phases are simultaneously estimated by optimization of the likelihood function over parameters of interest. The potential of the wideband ML method is demonstrated on GERESS data and compared to conventional f-k analysis showing advantages of the former in detection and resolution.
Frequency-domain adaptive filtering revisited, generalization to the multi-channel case, and application to acoustic echo cancellation
Authors: J. Benesty
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

We derive a new frequency-domain adaptive algorithm by using a frequency-domain recursive least squares criterion, minimizing an error signal in the frequency-domain. We then derive an exact adaptive algorithm from the so-called normal equation. It is shown that the obtained algorithm is complex to implement, and to reduce the complexity we need to remove a constraint resulting in the unconstrained frequency-domain LMS (UFLMS) algorithm. Most importantly, we generalize all this to the multi-channel case, thereby exploiting the cross-power spectra among all the channels which is very important (for a fast convergence rate) in multichannel acoustic echo cancellation (AEC), where the input signals are highly correlated.
A Modified Framework of a Clustering Algorithm for Image Processing Applications
Authors: Satish Kumar Singh, Shishir Kumar, G. S. Tomar, Ravi Kumar, G. K. Santhalia
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

Image and video (multimedia) databases are very large in size. It becomes very difficult to search the images from these databases by the application of conventional exhaustive searching because it will require unreasonable amount of time. For this purpose an automatic graph based clustering algorithm is developed and proposed through this paper. It reduces the searching time for the images from large databases. The proposed algorithm works on the concept of minimum spanning tree, which removes the inconsistent edges from tree, based on the dynamic threshold provided to the algorithm. The proposed algorithm reduces the search time for the retrieval with an acceptable loss in the accuracy.
Jargons for domain engineering
Authors: Lloyd H. Nakatani, Mark A. Ardis, Robert G. Olsen, Paul M. Pontrelli
Venue: Proceedings of the 2nd conference on Conference on Domain-Specific Languages - Volume 2 (1999)

In the Family-oriented Abstraction, Specification and Translation (FAST) domain engineering process for software production, a member of a software product family is automatically generated from a model expressed in a DSL. In practice, the time and skill needed to make the DSLs proved to be bottlenecks. FAST now relies on jargons, a kind of easy-to-make DSL that domain engineers who are not language experts can quickly make themselves. We report our experiences with jargons in the FAST process, and describe the benefits they provide above and beyond conventional DSLs for software production and other purposes.
Value-Cell Bar Charts for Visualizing Large Transaction Data Sets
Authors: Daniel A. Keim, Ming C. Hao, Umeshwar Dayal
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

One of the common problems businesses need to solve is how to use large volumes of sales histories, Web transactions, and other data to understand the behavior of their customers and increase their revenues. Bar charts are widely used for daily analysis, but only show highly aggregated data. Users often need to visualize detailed multidimensional information reflecting the health of their businesses. In this paper, we propose an innovative visualization solution based on the use of value cells within bar charts to represent business metrics. The value of a transaction can be discretized into one or multiple cells: high-value transactions are mapped to multiple value cells, whereas many small-value transactions are combined into one cell. With value-cell bar charts, users can 1) visualize transaction value distributions and correlations, 2) identify high-value transactions and outliers at a glance, and 3) instantly display values at the transaction record level. Value-Cell Bar Charts have been applied with success to different sales and IT service usage applications, demonstrating the benefits of the technique over traditional charting techniques. A comparison with two variants of the well-known Treemap technique and our earlier work on Pixel Bar Charts is also included.
Test Data Compression by Spilt-VIHC (SVIHC)
Authors: Chandan Giri, B. Mallikarjuna Rao, Santanu Chattopadhyay
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

This paper suggests a new test data compression scheme that performs Huffman coding on different sections of test data file separately. It improves upon the single Huffman tree based approach by upto 6% in compression ratio, 29% in test application time, sacrificing only 6.1%in the decoder area. The scheme compares favourably with other works reported in the literature. While for most of the cases, it produces better compression ratios, the area requirements are much lesser than other contemporary works.
XFI: software guards for system address spaces
Authors: Úlfar Erlingsson, Silicon Valley, Martín Abadi, Michael Vrable, Mihai Budiu, George C. Necula
Venue: Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7 (2006)

XFI is a comprehensive protection system that offers both flexible access control and fundamental integrity guarantees, at any privilege level and even for legacy code in commodity systems. For this purpose, XFI combines static analysis with inline software guards and a two-stack execution model. We have implemented XFI for Windows on the x86 architecture using binary rewriting and a simple, stand-alone verifier; the implementation's correctness depends on the verifier, but not on the rewriter. We have applied XFI to software such as device drivers and multimedia codecs. The resulting modules function safely within both kernel and user-mode address spaces, with only modest enforcement overheads.
A filter design technique for steerable pyramid image transforms
Authors: A. Karasaridis
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

We describe a novel recursive filter design technique for multi-scale "pyramid" transforms. The recursion in the design technique follows that of the pyramid construction, and allows us to solve a reduced design problem at each step. We demonstrate the use of this technique by designing filters of various orientation bandwidths for use in a "steerable pyramid" image transform.