ppxscal/embedding_network huggingface dataset:
Navani: Navigating Large-Scale Visualisations with Animated Transitions
Authors: Kevin Pulo
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

When visualising datasets that are too large to be displayed in their entirity, interactive navigation is a common solution. However, instantaneous updates of the visualisation when navigating can result in disruption to the user's mental map. Animated transitions are one way of addressing this problem. This paper presents the Data-Model-View-Controller (DMVC) architecture for navigation-based interactive systems. Navani, a software framework based on DMVC for supporting animated transitions during navigation, is presented, along with a sample application of it to hierarchical data.
A Longitudinal Study of Game Perceptions from the Perspective of Yin-Yang Theory
Authors: Eui Jun Jeong, Dan J. Kim
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

With the advent of ubiquitous and convergence era, games have revolutionized with the trend of network and diversification. Game users, additionally, have generalized without limitation of sex, age, and social status. Based on the Yin-Yang theory, this study investigates the change of users' perceptions both negative and positive sides on games with the recent trends of game industry: generalization, diversification, and networking. Longitudinal data that are collected by nationwide interviews in Korea from 2002 to 2005 have been analyzed. The results show that positive perceptions have increased whereas negative perceptions have not changed significantly during the time. Especially males, the 20s, and middle class group show substantive changes in positive perceptions. This result implies that as the game industry develops with the recent trends game perceptions move positively among the game users, and explains that such changes are led by young and RPG/RTS users. Since the Korean game market is in its mature stage with the change of diversification and networking, the results of this study will contribute to make predictions on future phenomena in other developing countries.
Necessary conditions on the lifting scheme for existence of wavelets in L/sub 2/(R)
Authors: G. McDarby
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

Over the years many different libraries of biorthogonal wavelets have been designed. In addition, the lifting scheme has been developed which unifies the design of biorthogonal wavelets using a simple approach. The lifting scheme allows the custom design of wavelets while maintaining the biorthogonal constraint on the filter bank. A drawback of the lifting scheme is that it does not guarantee that the wavelet associated with the iterated filter bank exists in L/sub 2/(R). In practice this raises the possibility that the filter bank may produce numerical artifacts. We present some necessary conditions on the lifting scheme for the resulting wavelets to exist in L/sub 2/(R). Using these conditions, we show how valid wavelet bases can be easily generated from randomly perturbed biorthogonal filter banks.
Inferring Gene Regulatory Networks from Microarray Time Series Data Using Transfer Entropy
Authors: Thai Quang Tung, Taewoo Ryu, Kwang H. Lee, Doheon Lee
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

Reverse engineering of gene regulatory networks from microarray time series data has been a challenging problem due to the limit of available data. In this paper, a new approach is proposed based on the concept of transfer entropy. Using this information theoretic measure, causal relations between pairs of genes are assessed to draw a causal network. A heuristic rule is then applied to differentiate direct and indirect causality. Simulation on a synthetic network showed that the transfer entropy can identify both linear and nonlinear causality. Application of the method in a biological data identified many causal interactions with biological information supports.
Internet toasters as a capstone design project
Authors: B. Lovegrove
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

One of the first devices connected to the Internet for remote control in 1990 was a (literal) toaster. Since then, the term "Internet toaster" has come to denote any small device connected to the Internet, particularly for the purposes of remote control or monitoring. Such devices are a topic of much current research and development. The vision of the Internet as a home control network has captured people's imaginations. The design of such devices makes for an ideal capstone design project. Such projects can emphasize hardware and/or software, can involve detailed study of network protocols or not, can be done with 8-bit microcontrollers or 80x86 embedded PCs, and can be as small or large as the environment requires. In addition, they can easily be multidisciplinary. This paper presents guidelines for instructors on how to choose and implement such a design project, along with an example of one such project - the Internet thermostat, which was a capstone design project at Bob Jones University in 1999.
A note on Bayesian identification of change points in data sequences
Authors: R. H. Loschi, F. R. B. Cruz, R. H. C. Takahashi, P. L. Iglesias, R. B. Arellano-Valle, J. MacGregor Smith
Venue: Computers and Operations Research (2008)

Recent research in mathematical methods for finance suggests that time series for financial data should be studied with non-stationary models and with structural changes that include both jumps and heteroskedasticity (with jumps in variance). It has been recognized that discriminating between variations caused by the continuous motion of Brownian shocks and the genuine discontinuities in the path of the process constitutes a challenge for existing computational procedures. This issue is addressed here, using the product partition model (PPM), for performing such discrimination and the estimation of process jump parameters. Computational implementation aspects of PPM applied to the identification of change points in data sequences are discussed. In particular, we analyze the use of a Gibbs sampling scheme to compute the estimates and show that there is no significant impact of such use on the quality of the results. The influence of the size of the data sequence on the estimates is also of interest, as well as the efficiency of the PPM to correctly identify atypical observations occurring in close instants of time. Extensive Monte Carlo simulations attest to the effectiveness of the Gibbs sampling implementation. An illustrative financial time series example is also presented.
Robustness Testing of the Windows DDK
Authors: Manuel Mendonca, Nuno Neves
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

Modern computers interact with many kinds of external devices, which have lead to a state where device drivers (DD) account for a substantial part of the operating system (OS) code. Currently, most of the systems crashes can be attributed to DD because of flaws contained in their implementation. In this paper, we evaluate how well Windows protects itself from erroneous input coming from faulty drivers. Three Windows versions were considered in this study, Windows XP and 2003 Server, and the future Windows release Vista. Our results demonstrate that in general these OS are reasonably vulnerable, and that a few of the injected faults cause the system to hang or crash. Moreover, all of them handle bad inputs in a roughly equivalent manner, which is worrisome because it means that no major robustness enhancements are to be expected in the DD architecture of the next Windows Vista.
Integrating a command shell into a web browser
Authors: Robert C. Miller, Brad A. Myers
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (2000)

The transition from command-line interfaces to graphical interfaces has resulted in programs that are easier to learn and use, but harder to automate and reuse. Another transition is now underway, to HTML interfaces hosted by a web browser. To help users automate HTML interfaces, we propose the browser-shell, a web browser that integrates a command interpreter into the browser's Location box. The browser-shell's command language is designed for extracting and manipulating HTML and text, and commands can also invoke local programs. Command input is drawn from the current browser page, and command output is displayed as a new page. The browser-shell brings to web browsing many advantages of the Unix shell, including scripting web services and creating pipelines of web services and local programs. A browser-shell also allows legacy command-line programs to be wrapped with an HTML/CGI interface that is graphical but still scriptable, and offers a new shell interaction model, different from the conventional typescript model, which may improve usability in some respects.
Performance analysis of a random access packet radio system with joint network-spatial diversity
Authors: Ruifeng Zhang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

This paper explores how joint network and spatial diversity can be employed to improve the throughput/delay performance of packet radio systems. In the context of the recently proposed network diversity multiple access (NDMA) technique, the challenges and advantages of using antenna arrays at the base station to complement network-assisted diversity are investigated. It is shown that remarkable improvement of the system performance can be achieved by combining network and spatial diversity. A blind method based on PARAFAC analysis tools is proposed to solve the collision resolution problem under joint network/spatial diversity. The method is also applicable to, e.g., joint network/spreading diversity.
Compiler-Directed Variable Latency Aware SPM Management to CopeWith Timing Problems
Authors: O. Ozturk, G. Chen, M. Kandemir, M. Karakoy
Venue: Proceedings of the International Symposium on Code Generation and Optimization (2007)

As a result of process parameter variations, a large variability in circuit delay occurs in scaled technologies. This delay or latency variation problem is particularly pressing for memory components due to the minimum sized transistors used to build them. Current memory design techniques mostly cope with such variations by adopting a worst-case design option, which simply assumes all memory locations are operated under the worst possible latency, whereas in reality some memory locations could be much faster than the others. Note that, assuming any other latency value other than the worst-case latency for all memory locations uniformly can lead to reliability problems, since the data may not be ready when the assumed latency has passed. Instead of operating under the worst-case design option, this paper proposes and experimentally evaluates a compilerdriven approach that operates an on-chip scratch-pad memory (SPM) assuming different latencies for the different SPM lines. Our goal is to reduce execution cycles without creating any reliability problems due to variations in access latencies. The proposed scheme achieves its goal by evaluating the reuse of different data items and adopting a reuse and latency aware data-to-SPM placement. It also employs data migration within SPM when it helps to cut down the number of execution cycles further. We also discuss an alternate scheme that can reduce latency of select SPM locations by controlling a circuit level mechanism in software to further improve performance. We implemented our approach within an optimizing compiler and tested its effectiveness through extensive simulations. Our experiments with twelve embedded application codes show that the proposed approach performs much better than the worst-case based design paradigm (16.2% improvement on the average) and comes close (within 5.7%) to an hypothetical bestcase design (i.e., one with no process variation) where every SPM locations uniformly have low latency.
Design of biorthogonal MRA generating wavelets matched to specified signal
Authors: M. R. Raghuveer
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

The problem of fitting a mother wavelet to a signal such that this wavelet along with a dual generate a biorthogonal wavelet decomposition is addressed. It is shown that when the problem is addressed in the frequency domain with bandlimited scaling functions and wavelets, a simple formulation is possible. Further, a closed form sub-optimal solution is possible when the problem is broken down into a series of optimization problems. In the process of the problem formulation, a generalization of the Meyer class of wavelets to the biorthogonal case is obtained.
Building a predictive model from data in high dimensions with application to analysis of microarray experiments
Authors: Henryk Maciejewski, Lukasz Konarski
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

This work presents a comparative study of methods for building predictive models from data in high dimensionality spaces, i.e. where the number of features describing items to be classified is high as compared with the available number of items used to build the model and test its predictive performance. Application of such methods may be quite diverse, ranging from data analysis in life sciences (e.g., analysis of data from experiments generating thousands of feature-numbers per tested case, such a microarray or RT-PCR techniques), to analysis of monitoring data from a complex, highly reliable technical system, where the relationship is being sought between the monitoring data and the relatively infrequent occurrences of some event (such as a faulty or somewhat untypical state of the system). This latter case may be of special interest in early prediction of abnormal conditions in systems focused on dependability. The multidimensional data analysis challenges and generic methods are described in this paper using a very problem specific language of life sciences, namely classification of samples based on gene expression profiles obtained using DNA microarrays. We concentrate on feature selection methods (which in the context are gene selection methods). We also propose a method to evaluate performance of feature (gene) selection methods by looking at predictive power of classifiers based on selected features.
Testing Properties of Constraint-Graphs
Authors: Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur
Venue: Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity (2007)

We study a model of graph related formulae that we call the Constraint-Graph model. A constraint-graph is a labeled multi-graph (a graph where loops and parallel edges are allowed), where each edge e is labeled by a distinct Boolean variable and every vertex is associated with a Boolean function over the variables that label its adjacent edges. A Boolean assignment to the variables satisfies the constraint graph if it satisfies every vertex function. We associate with a constraint-graph G the property that consists of all assignments satisfying G, denoted SAT(G). We show that the above model is quite general. That is, for every property of strings P there exists a property of constraint-graphs P_G such that P is testable using q queries if and only if P_G is thus testable. In addition, we present a large family of constraint-graphs for which SAT(G) is testable with constant number of queries. As an implication of this, we infer the testability of some edge coloring problems (e.g. the property of two coloring of the edges in which every node is adjacent to at least one vertex of each color). Another implication is that every property of Boolean strings that can be represented by a Read-twice CNF formula is testable. We note that this is the best possible in terms of the number of occurrences of every variable in a formula.
The Engineering Concepts Institute: the foundation of a comprehensive minority student development program at the FAMU-FSU College of Engineering
Authors: M. Ohland
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

Bridge programs have sought to improve the transition and retention of minority students for over two decades. Even those that have been successful have faced a difficult challenge due to the cost-intensive nature of such programs. The purpose of this paper is to recount the success of one such bridge program, the Engineering Concepts Institute, and the rest of the comprehensive minority student development that follows it, serving students of Florida A&M University matriculating to the Florida A&M University Florida State University College of Engineering. A significant improvement in six-year graduation rates is observed for cohorts from 1987-1992 (/spl chi//sup 2/, /spl alpha/=0.05). It is hoped that the strategic partnership between Ohland and Zhang, who are using a longitudinal database compiled by the SUCCEED Coalition to study engineering programs, and Foreman and Haynes, the program's coordinators, will yield the evidence needed to seek alternative funding sources from industrial sponsors, foundations, and even participating students and their parents. This evidence is critical when budget cuts threaten to shut down this valuable program.
Speech dereverberation and noise reduction with a combined microphone array approach
Authors: J. Gonzalez-Rodriguez
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

In this contribution we have addressed the problem of speech enhancement in noisy and reverberant rooms through the use of a new approach that combines the dereverberation abilities of a structure based in the separate processing of the minimum-phase and all-pass components of the input speech signals, and the noise rejection performance of a speech-activity-based Wiener filter able to cope both with coherent and diffuse noise. Experiments have been performed with the CMU real multichannel database, which includes a clean speech reference through a head-mounted microphone. This reference signal have been also used to perform simulation experiments in controlled conditions. Extensive results have been obtained, both with log area ratio and cepstral distances of input and processed signals to the reference, and with segSNR improvements, assessing the abilities of the new system to cope both with reverberation and coherent and diffuse noise in different acoustic environments.
Over-complete blind source separation by applying sparse decomposition and information theoretic based probabilistic approach
Authors: A. Ossadtchi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

Both in the case of cellular communication and in the case of spoken dialogue based information retrieval systems on mobile platforms there exist a number of interference signals: Therefore, it is essential to separate these interference signals from the intended signal(s) in order to have clear communication in the case of cellular phones and to improve the speech recognition accuracy in the case of spoken dialogue based information retrieval system. Since the number and nature of source signals (intended + interference signals) change, it is not practical to know them a priori. Therefore, it is not always practical to apply signal separation techniques that work well when the number of source signals is equal to the number of sensors. In addition, since how the signals get mixed is unknown, we need to apply blind techniques for the separation. This paper is concerned with a blind source separation (BSS) technique for the over-complete case (#signals > #sensors) that is based on the sparse decomposition and, the joint estimation of mixing matrix and the separated source signals by applying information theoretic based probabilistic approach. Experimental results of signal separation using various real speech and noise signals indicate that the quality of separated source signals are 4 dB better than the current techniques.
The development and employment of formative evaluation instruments to enhance students' opportunity to learn
Authors: K. J. Blot
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

This paper introduces two evaluation instruments used to inform K-12 pedagogical initiatives in mathematics and science sponsored by the El Paso Collaborative for Academic Excellence (EPCAE). These instruments are an Opportunity To Learn (OTL) questionnaire and an observational framework called the School Curriculum Implementation Profile (SCIP). Data gathered locally in the last few years support the utility of these instruments to measure curricula intended to promote opportunity to learn. Differences on these measures are related to student mathematics achievement (grades 4, 6, and 8) and to a reduction in the achievement gap favoring white students over Hispanic students.
Breaking up is hard to do: modeling security threats for smart cards
Authors: Bruce Schneier, Adam Shostack
Venue: Proceedings of the USENIX Workshop on Smartcard Technology on USENIX Workshop on Smartcard Technology (1999)

Smart card systems differ from conventional computer systems in that different aspects of the system are not under a single trust boundary. The processor, I/O, data, programs, and network may be controlled by different, and hostile, parties. We discuss the security ramifications of these "splits" in trust, showing that they are fundamental to a proper understanding of the security of systems that include smart cards.
Exploiting Spatial and Temporal Parallelism in the Multithreaded Node Architecture Implemented on Superscalar RISC Processors
Authors: D. J. Hwang, S. H. Cho, Y. D. Kim, S. Y. Han
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

In most multithreaded node architectures moti¬ vated by the dataflow computational model, spatial parallelism could not be exploited at the thread level due to the resource deficit incurred by their inter nal organization. So we proposed a node architecture exploiting both spatial and temporal parallelism of a program. A multi-port non-blocking data cache is in corporated into our design to cope with the excessive data bandwidth required in parallel execution of mul tiple threads. The proposed node architecture may contribute to greatly reducing communication latency through the interconnection network. Simulation re sults show that parallel loops can be executed on this architecture more efficiently than on other competi tive ones.