ppxscal/embedding_network huggingface dataset:
Myview: customizable automatic visual space management for multi-stream environment
Authors: Klara Nahrstedt
Venue:  (2006)

Recent years witnessed the emergence of more "multi-stream" Multimedia applications, such as multi-site distributed video conferencing, multi-perspective IPTV, and virtual touring of 3D digital worlds from multiple view points, etc.In this work, we study the problem of visual space management in such applications. The key observation is that there are multiple visual streams that need to be presented to the users, while the visual space is limited both by availability of physical display devices and by user's visual attention space. We argue that the visual space is a type of critical resource that requires careful management in similar way as other resources (such as CPU cycles and memory slots). Specifically, the unique challenges are how to model the visual streams and the viewers' preference among them, how to determine which of these visual streams should be presented to the viewer, and how the output windows of these selected streams should be arranged on the display devices.Many existing systems have explored the solution space from different perspectives, but none of them provide a solution that is customized to user interest, automatic to avoid unnecessary user input, and yields high visual quality screen output. In this work, we introduce a 3-phase visual space management framework called MyView that makes the following three key contributions. First, a generic shot-based visual stream model and a score-based viewer interest model are designed to represent user interest, which lays the foundation for automatic visual space management decisions. Second, an automatic stream selection algorithm is developed that maintains a timed automaton to calculate which visual streams should be selected for display. Third, a screen layout calculation algorithm is designed to compute the screen layout for presenting the selected visual stream(s) on one or multiple display devices in a visual pleasing way that maximizes screen space utilization.We have built a lecture recording and broadcasting system on top of the ConferenceXP platform to evaluate our solution. Results from both simulation experiments and user study have confirmed the functional correctness and usability of the MyView framework.
Large-scale code reuse in open source software
Authors: Audris Mockus
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

We are exploring the practice of large-scale reuse involving at least a group of source code files. Our research question is to determine the extent of such reuse occurring in open source projects, to identify the code that is reused the most, and to investigate patterns of large-scale reuse. We start by identifying a sample of projects involving all code in several large repositories of open source projects, all projects bundled with popular distributions of Linux and BSD, and several large individual projects. In the next step we obtain the source code and identify groups of files reused among projects and determine the code that is most widely reused in our sample. Our findings indicate that more than 50% of the files were used in more than one project. The most widely reused components were small and represented templates requiring major and minor modifications and a group of files reused without any change. Some widely reused components involved hundreds of files.
Kernel support for zero-loss Internet service restart
Authors: Da-Wei Chang, Chuan-Ming Tsai, Wei-Kou Li, Tzu-Rung Lee
Venue: Software&mdash;Practice Experience (2007)

Owing to long serving time and huge numbers of clients, Internet services can easily suffer from transient faults. Although restarting a service can solve this problem, information of the on-line requests will be lost owing to the service restart, which is unacceptable for many commercial or transaction-based services. In this paper, we propose an approach to achieve the goal of zero-loss restart for Internet services. Under this approach, a kernel subsystem is responsible for detecting the transient faults, retaining the I&sol;O channels of the service, and managing the service restart flow. In addition, some straightforward modifications to the service should be made to take advantage of the kernel support. To demonstrate the feasibility of our approach, we implemented the subsystem in the Linux kernel. Moreover, we modified a Web server and a CGI program to take advantage of the kernel support. According to the experimental results, our approach incurs little runtime overhead (i.e. less than 3.2&percnt;). When the service crashes, it can be restarted quickly (i.e. within 210 &mu;s) with no information loss. Furthermore, the performance impact due to the service crash is small. These results show that the approach can efficiently achieve the goal of zero-loss restart for Internet services. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Measuring and characterizing system behavior using kernel-level event logging
Authors: Karim Yaghmour, Michel R. Dagenais
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (2000)

Analyzing the dynamic behavior and performance of complex software systems is diffcult. Currently available systems either analyze each process in isolation, only provide system level cumulative statistics, or provide a fixed and limited number of process group related statistics. The Linux Trace Toolkit (LTT) introduced here provides a novel, modular, and extensible way of recording and analyzing complete system behavior. Because all significant system events are recorded, it is possible to analyze any desired subset of the running processes, and for instance distinguish between the time spent waiting for some relevant event (data from disk or another process) versus time spent waiting for some unrelated process to use up its time slice. Despite the extensive information gathered, experimental results show that the LTT time and memory overhead is minimal (< 2:5% when observing core kernel events). Moreover, due to the LTT and Linux kernel modularity and open source code availability, the system is easily extended both in terms of system events gathered, and of later post-processing and graphical presentation.
MP3 resistant oblivious steganography
Authors: Litao Gang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

Robustness to compression is a basic requirement for any data hiding scheme. We concentrate on MP3 resistant oblivious data hiding. First the MP3 compression algorithm is briefly introduced. We then propose three effective data hiding schemes, where the message is embedded in amplitude, DFT phase domain, and noisy components, respectively. All these schemes demonstrate robustness to MP3 compression.
Existence and uniqueness of positive solutions for a higher order boundary value problem
Authors: Zhilin Yang
Venue: Computers Mathematics with Applications (2007)

The goal of this paper is to study the existence and uniqueness of positive solutions for the 2nth order boundary value problem: {(-1)^nu^(^2^n^)=f(t,u,-u^'',...,(-1)^n^-^1u^(^2^n^-^2^)),@a"0u^(^2^i^)(0)-@b"0u^(^2^i^+^1^)(0)=0(i=0,1,...,n-1),@a"1u^(^2^i^)(1)+@b"1u^(^2^i^+^1^)(1)=0(i=0,1,...,n-1). The Krein-Rutman theorem and the Krasnoselskii-Zabreiko fixed point theorem are the main tools that have been used to develop our work.
Beehive: O(1)lookup performance for power-law query distributions in peer-to-peer overlays
Authors: Venugopalan Ramasubramanian, Emin Gün Sirer
Venue: Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1 (2004)

Structured peer-to-peer hash tables provide decentralization, self-organization, failure-resilience, and good worst-case lookup performance for applications, but suffer from high latencies (O(log N)) in the average case. Such high latencies prohibit them from being used in many relevant, demanding applications such as DNS. In this paper, we present a proactive replication framework that can provide constant lookup performance for common Zipf-like query distributions. This framework is based around a closed-form optimal solution that achieves O(1) lookup performance with low storage requirements, bandwidth overhead and network load. Simulations show that this replication framework can realistically achieve good latencies, outperform passive caching, and adapt efficiently to sudden changes in object popularity, also known as flash crowds. This framework provides a feasible substrate for high-performance, low-latency applications, such as peer-to-peer domain name service.
The two-dimensional discrete cosine transform applied to speech data
Authors: L. Baghai-Ravary, S. W. Beet, M. O. Tokhi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

A two-dimensional discrete cosine transform (2-D DCT), often used for image coding, has been applied to sequences of speech spectra produced by the maximum likelihood method (MLM). The coded data was compressed by nearly 90%, reducing it to a size smaller than that needed to store the coefficients of a 10th order linear predictive coding (LPC) model. The DCT-encoded data was then reconstructed and tested for intelligibility. It was found that the two-dimensional DCT method was significantly more intelligible and more natural-sounding than the LPC technique.
Binaural sound localization in an artificial neural network
Authors: C. Schauer
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

We describe a biological inspired model of binaural sound localization using interaural time differences (ITDs). To handle the problem of temporal coding and to facilitate a hardware implementation in analog VLSI, the simulation of the system is based on a spike response model. This neuron model takes up physiological properties like postsynaptic potentials (PSPs) and a refractory period. A winner-take-all (WTA) network selects the dominant source from the representation of the sound's angles of incidences, and can be biased by a multisensory support. We use simulations on real audio data to investigate the function and the practical application of the system.
Position Paper: Thoughts on Programming with Proof Assistants
Authors: Adam Chlipala
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

Today the reigning opinion about computer proof assistants based on constructive logic (even from some of the developers of these tools!) is that, while they are very helpful for doing math, they are an absurdly heavy-weight solution to use for practical programming. Yet the Curry-Howard isomorphism foundation of proof assistants like Coq [Yves Bertot and Pierre Casteran. Interactive Theorem Proving and Program Development. Coq'Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science. Springer Verlag, 2004] gives them clear interpretations as programming environments. My purpose in this position paper is to make the general claim that Coq is already quite useful today for non-trivial certified programming tasks, as well as to highlight some reasons why you might want to consider using it as a base for your next project in dependently-typed programming.
Wux: Unix tools under windows
Authors: Diomidis Spinellis
Venue: Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference (1994)

Wux is a port of Unix tools to the Microsoft Windows environment. It is based on a library providing a Unix-compatible set of system calls on top of Windows. Unix-derived tools run in parallel, communicating using the Unix pipe abstraction. All processes are run within an application template that gives them basic Windows compatibility such as input and output windows and an icon. The performance of the system is comparable to that of Unix ports to the PC architecture.
ABW--Short-Timescale Passive Bandwidth Monitoring
Authors: Sven Ubik, Demetres Antoniades, Arne Oslebo
Venue: Proceedings of the Sixth International Conference on Networking (2007)

Bandwidth usage monitoring is important for network troubleshooting and planning. Traditionally, used bandwidth is computed from router interface byte counters read by SNMP. This method only allows to check long-term averages of the total used bandwidth without information about short-term dynamics and without knowledge of what applications are consuming most bandwidth. We describe the architecture of a novel passive bandwidth usage monitoring application. This application uses packet capture and advanced processing to continuously provide real-time information about bandwidth usage. The produced characteristics include information about shor-tterm peaks and about the percentage of bandwidth used by different protocols in different layers of the OSI model hierarchy, including detection of application protocols that use dynamic ports.
A Framework for Data Dependence Testing in the Presence of Pointers
Authors: Joseph Hummel, Laurie J. Hendren, Alexandru Nicolau
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02 (1994)

In the presence of pointers, data dependence testing is a difficult and increasingly common problem. Existing approaches work well for pointers to named memory locations (i.e. other variables), but are overly conservative given pointers to unnamed memory locations. In this paper we present a new framework for performing more accurate data dependence testing in the latter case, which occurs in the context of dynamic, pointer-based data structures. We will demonstrate the effectiveness of our approach by breaking false dependences that existing approaches cannot, and provide results which show that removing such dependences can enable significant paralleltzation.
Transversal connecting orbits from shadowing
Authors: Brian A. Coomes, H&#x00fc;seyin Ko&#x00e7;ak, Kenneth J. Palmer
Venue: Numerische Mathematik (2007)

A rigorous numerical method for establishing the existence of a transversal connecting orbit from one hyperbolic periodic orbit to another of a differential equation in $${\mathbb{R}^n}$$ is presented. As the first component of this method, a general shadowing theorem that guarantees the existence of such a connecting orbit near a suitable pseudo connection orbit given the invertibility of a certain operator is proved. The second component consists of a refinement procedure for numerically computing a pseudo connecting orbit between two pseudo periodic orbits with sufficiently small local errors so as to satisfy the hypothesis of the theorem. The third component consists of a numerical procedure to verify the invertibility of the operator and obtain a rigorous upper bound for the norm of its inverse. Using this method, existence of chaos is demonstrated on examples with transversal homoclinic orbits, and with cycles of transversal heteroclinic orbits.
Research on the Design of Helmet-Mounted Display Symbology
Authors: Tao Liu, Guorong Zhao, Qingwei Gao, Yujin Dai
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

Firstly, the design principles of ownship status information and target locator line are given out after analyzing the results of empirical research and the feedback of some flight tests. Then the advanced target location line (TLL) with reflected cue angular distance indication and Non-Distributed Flight Reference (NDFR) are introduced in detail. At last, the design idea of the color mode is analyzed seriously and some effectual improvements are brought forward.
Introducing propositional logic and queueing theory with the infotraffic interactive learning environments
Authors: Ruedi Arnold
Venue: Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education (2007)

InfoTraffic [2] is a collection of learning environments forteaching fundamental concepts of computer science and mathematics. So far, the two programs LogicTraffic, targeted at propositional logic, and QueueTraffic, targeted at queueing theory have been released1. Both are freely availableand can be downloaded (along with teaching materials) from [1]. This demonstration abstract gives a very brief introductionto these two programs and their use in class.
Soft Error Rates in 65nm SRAMs--Analysis of new Phenomena
Authors: Franz X. Ruckerbauer, Georg Georgakos
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

Soft error rates measured on embedded SRAMs in a 65nm CMOS technology show a significant increase of the error rate induced by neutron radiation (NSER), while the number of soft errors due to alpha radiation (ASER) is within the expected range. In this paper it will be discussed, that the increase of the NSER values is caused by an unexpected high number of single event upsets (SEU) that flip multiple SRAM cells simultaneously (multi-bit upset). As root cause radiation induced switching of parasitic bipolar transistors was found.
A new resource allocation scheme for Gaussian traffic sources
Authors: K. Nagarajan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

Communication networks have finite resources (bandwidth, buffer size etc.) that need to be shared among many users. In order to improve the utilization level while providing certain guarantees on the quality of service, the resources have to be allocated intelligently to the users based on the statistical characteristics of the traffic they offer. We propose a new algorithm that is more efficient in allocating resources than existing methods, when the traffic exhibits short and/or long memories. We also provide examples based on synthetic and real traffic data.
Mining Concept Drifts from Data Streams Based on Multi-Classifiers
Authors: Yue Sun, Guojun Mao, Xu Liu, Chunnian Liu
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Mining concept drifts is one of the most important fields in mining data streams. In this paper, a new ensemble algorithm called ICEA is proposed for mining concept drifts from data streams, which uses ensemble multi-classifiers to detect concept changes from the data streams in an incremental way. The experimental results show that ICEA algorithm performs higher accuracy and better adaptability than the popular methods such as SEA algorithm.
Writing- and communications-across-the-curriculum in the Materials Science and Engineering Department at Virginia Tech
Authors: R. W. Hendricks, E. Pappas
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

The Materials Science and Engineering Department (MSE) comprehensive undergraduate writing- and communications-across-the-curriculum program is integrated into eight required MSE courses over students' three years of study in the Department. The program focuses mostly on the development of students' discipline-specific writing skills but also includes instruction in public speaking, interpersonal communications in the workplace, creative scientific thinking, and collaborative writing. In addition, the program includes faculty training and support for integrating writing into technical coursework, developing writing assignments, assisting students in revising their own writing, and grading written assignments. Our writing and communications program is integrated into eight required MSE courses in such a way that the writing and communication tasks in each class do not too often duplicate those addressed in subsequent program classes. We are developing methods for teaching course content using writing and communications as learning tools in such a way that time for technical content instruction is not sacrificed.
On the Correlation of Geographic and Network Proximity at Internet Edges and Its Implications for Mobile Unicast and Multicast Routing
Authors: Thomas C. Schmidt, Matthias Wahlisch, Ying Zhang
Venue: Proceedings of the Sixth International Conference on Networking (2007)

Significant effort has been invested recently to ac- celerate handover operations in a next generation mo- bile Internet. Corresponding works for developing effi- cient mobile multicast management are emergent. Both problems simultaneously expose routing complexity be- tween subsequent points of attachment as a characteris- tic parameter for handover performance in access net- works. As continuous mobility handovers necessarily occur between access routers located in geographic vicinity, this paper investigates on the hypothesis that geograph- ically adjacent edge networks attain a reduced network distances as compared to arbitrary Internet nodes. We therefore evaluate and analyze edge distance distribu- tions in various regions for clustered IP ranges on their geographic location such as a city. We use traceroute to collect packet forwarding path and round-trip-time of each intermediate node to scan-wise derive an upper bound of the node distances. Results of different scan- ning origins are compared to obtain the best estima- tion of network distance of each pair. Our results are compared with corresponding analysis of CAIDA Skit- ter data, overall leading to fairly stable, reproducible edge distance distributions. As a first conclusion on ex- pected impact on handover performance measures, our results indicate a general optimum for handover antic- ipation time in 802.11 networks of 25 ms.
The architecture of high-speed matched filter for searching synchronization in DSSS receiver
Authors: Myong-Lyol Song
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

A high-speed matched filter for searching synchronization in direct sequence spread spectrum (DSSS) receiver is studied. A model to implement the matched filter by hardware description languages (HDL) is proposed. The proposed model is based on parallel processing and pipeline architecture including circular buffer, multiplier, adder, and code look-up table. The proposed model is analyzed with respect to the performance and compared with a conventional digital signal processor (DSP) implementation. 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
What Supercomputers Say: A Study of Five System Logs
Authors: Adam Oliner, Jon Stearley
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

If we hope to automatically detect and diagnose failures in large-scale computer systems, we must study real deployed systems and the data they generate. Progress has been hampered by the inaccessibility of empirical data. This paper addresses that dearth by examining system logs from five supercomputers, with the aim of providing useful insight and direction for future research into the use of such logs. We present details about the systems, methods of log collection, and how alerts were identified; propose a simpler and more effective filtering algorithm; and define operational context to encompass the crucial information that we found to be currently missing from most logs. The machines we consider (and the number of processors) are: Blue Gene/L (131072), Red Storm (10880), Thunderbird (9024), Spirit (1028), and Liberty (512). This is the first study of raw system logs from multiple supercomputers.