ppxscal/embedding_network huggingface dataset:
Design of a Web-Based Synchronized Multimedia Lecture System for Distance Education
Authors: Herng-Yow Chen, Gin-Yi Chen, Jen-Shin Hong
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

Currently, the WWW has created an open-environment for convenient delivering of the HTML pages and low-bandwidth video clips. Since the HTML pages can present static text and image in much higher resolution than that presented by a low bit-rate video clip, we believe that the optimal mode for a WWW-based distance lecture is to use (1) streaming video clips for the audio/video lecturing, and (2) dynamically loaded HTML pages to present the lecture notes navigation process. To this end, in this article, we have designed a "Live/On-Demand Synchronized AV/HTML Distance Lecture System" to synchronize the presentation of the streaming video lecture, the HTML-based lecture notes, and the HTML Navigation Events. We propose a "Web-based Synchronized Multimedia Lecture (WSML)" Framework to automate the recording of the media presentation events based on the SMIL specification. The WSML framework Consists of three major modules: (1) WSML Recorder-for recording the temporal information of the AV lecture and the HTML-based lecture notes navigation process. (2) WSML Event server- for receiving, multicasting and depositing WSML events. (3) WSML Browser- for presentation of the syncronized AV lecture and the HTML-based lecture notes navigation. To evaluate the performance of the proposed framework, in this stage, we have applied the RealSystem to implement a prototype Synchronized AV/HTML Distance Lecture System using Java/Javascript. The prototype system demonstrates the feasibility of the proposed framework.
Application-Level Measurements of Performance on the vBNS
Authors: Michele Clark, Kevin Jeffay
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

We examine the performance of high-bandwidth multimedia applications over high-speed wide-area networks, such as the vBNS (Internet2). We simulate a tele-immersion application that sends 30 Mbps (2,700 datagrams per second) to various sites around the USA, and measure network- and application-level loss and throughput. We found that over the vBNS, performance is affected more by the packet-rate generated by an application than by its bit-rate. We also assess the amount of error recovery and buffering needed in times of congestion to present an effective multimedia stream to the user. Lastly, we compare our application-level measurements with data taken from a constellation of GPS-synchronized network probes (IPPM Surveyors). The comparison suggests that network-level probes will not provide information that a multimedia application can use to adapt its behavior to improve performance.
Deflecting crosstalk by routing reconsideration through refined signal correlation estimation
Authors: Mingjing Chen, Alex Orailoglu
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

Crosstalk between interconnects has become one of the major factors that tamper with VLSI signal integrity as device feature size scales down to UDSM and nanometer level. Traditional techniques for crosstalk reduction focus on reducing the coupling capacitance between interconnect nets to maximize the crosstalk slack among the nets. Although effective in reducing the worst-case crosstalk, such a strategy is incapable of minimizing the average run-time crosstalk which is equivalently critical for the timing and functional correctness of nanoscale VLSI. The minimization of both worst-case and average crosstalk necessitates the consideration of signal correlation information determined by circuit logic during the layout optimization stage. In this paper, a post-global routing technique is proposed to reduce the run-time crosstalk risk without violating the worst-case crosstalk bound specified by traditional techniques. A measure is proposed to accurately capture the signal correlation and model the run-time behavior of net pairs. Adjustment in the routing track assignment is performed under the guidance of run-time information to reduce the chance of neighboring nets having crosstalk-generating signal transitions. Meanwhile, the coupling length of each net is still controlled to within a specific bound for the maximization of the minimal crosstalk slack. Experimental results show that, compared to the conventional approaches, the proposed technique achieves significant reduction in average crosstalk without exacerbating the minimal crosstalk slack of the circuit.
Integrating Time into Spatially Represented Knowledge Structures
Authors: Claus Atzenbeck, David L. Hicks
Venue: Proceedings of the 2009 International Conference on Information, Process, and Knowledge Management (2009)

For decades hypertext has provided a means for structuring information. Versioning has been perceived as very important for hypertext, but research focusing on it has targeted almost exclusively one type of hypertext application: navigational hypertext (i.e., node-link structures). Spatial hypertext is an alternative paradigm for associating information by spatial arrangements or visual cues. There has been little work done on providing versioning for this structure type.We propose Socs, a spatial hypertext application that specializes in representing social relationships. It combines versioning, spatial interpretation through a specialized parser, awareness support, representation of time, intuitive browsing and visualization of different versions, and support for "forgetting" and "remembering" information. The benefits of these individual features have been demonstrated independently in various areas. However, Socs is the first application of its kind that combines them. A system with these capabilities creates the basis for the next development step toward a collaborative and distributed spatial hypertext system.
Blind separation of linear instantaneous mixtures of non-stationary signals in the frequency domain
Authors: Shahram Hosseini, Yannick Deville, Hicham Saylani
Venue: Signal Processing (2009)

Blind source separation (BSS) methods aim at restoring source signals from their mixtures. For linear instantaneous mixtures of stationary random sources, a natural and widely used approach consists in using some statistics associated to the temporal representation of the signals. On the contrary, we here consider non-stationary real sources and we show that they have interesting frequency-domain properties which motivate the introduction of two new frequency-domain BSS methods. The first method works by diagonalizing a zero-lag, second-order statistics matrix, created using both covariance and pseudo-covariance matrices of Fourier transforms of real-valued observations. In practice, this method is specially suitable for separating cyclo-stationary sources. The second method is particularly important because it allows the existing time-domain algorithms developed for stationary, temporally correlated sources (like AMUSE or SOBI) to be extended to non-stationary, temporally uncorrelated sources just by mapping the mixtures into the frequency domain. Both methods set no constraint on the piecewise stationarity of the sources, unlike most previously reported BSS methods exploiting source non-stationarity. The experimental results using artificial and real-world sources confirm the good performance of the proposed methods for non-stationary sources.
Semantically structured tag clouds: an empirical evaluation of clustered presentation approaches
Authors: Johann Schrammel, Michael Leitner, Manfred Tscheligi
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Tag clouds have become a frequently used interaction technique in the web. Recently several approaches to present tag clouds with the tags semantically clustered have been proposed. However, it remains unclear whether the expected gains in performance and advantages in interaction actually can be realized as no empirical evaluations of such approaches are available yet. In this paper we describe a series of experiments designed to evaluate the effects of semantic versus alphabetical and random arrangements of tags in tag clouds. The results of our work indicate that semantically clustered tag clouds can provide improvements over random layouts in specific search tasks and that they tend to increase the attention towards tags in small fonts compared to other layouts. Also, semantically structured tag clouds were preferred by about half of the users for general search tasks. Tag cloud layout does not seem to influence the ability to remember tags.
Adaptive quantization for video compression in frequency domain
Authors: Aree A. Mohammed, Alan A. Abdulla
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

Delivery of video in the presence of bandwidth constraints is one of the most important video compression problems. In this work, the preprocessing for video compression is started by extracting any video format into raw data format and applying float wavelet transform on each frame. This step provides the video frames to perform an adaptive quantization in a frequency domain. This leads to reduce the quantity of information in higher bands (HL, LH, and HH). The proposed preprocessing method is tested on different video sequences and its performance is compared in terms of quality and compression ratio. The obtained results show that for the second level of wavelet decomposition the effect of quantization is reasonable with preserving the quality (PSNR = 28 dB) of reconstructed frame.
A Useful COFDM Demodulator for DVB-T
Authors: HongLi Zhu, GuangChun Gao, Gang Bi
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

In this paper, a new kind of COFDM demodulator is proposed, which is conforming to the European DVB-T standard. The proposed prototype mainly contains four blocks: time synchronization, frequency synchronization, 2K/8K FFT processor, and channel estimation. Each block is implemented by the relatively simple algorithm to avoid the overhead of hardware complexity.
Presentation of uncertain information in user interfaces to support decision making in complex military systems
Authors: Hasmik Atoyan, Jean-Marc Robert, Jean-Rémi Duquet
Venue: Proceedings of the 20th International Conference of the Association Francophone d'Interaction Homme-Machine (2008)

Utilization of Decision Support Systems (DSSs) in complex dynamic environments can create several types of uncertainties. A comprehensive understanding of uncertainties in data and their adequate presentation to the operator becomes very important, particularly when the information is used in a dynamic environment where high-risk decisions should be made. Based on a review of the literature, in this paper we explain the concept of uncertain information, classify different types of uncertainties and different reasoning strategies applied to uncertain information, and propose guidelines on how to best present uncertainties on human computer interfaces.
Finding Motifs of Financial Data Streams in Real Time
Authors: Tao Jiang, Yucai Feng, Bin Zhang, Jie Shi, Yuanzhen Wang
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

Finding motifs of financial data streams in real time is a very interesting and valuable work. We hope to find the motif existing in financial data streams on local trend subsequence. A stock market trader might use such a tool to spot arbitrage opportunities or escape the underlying venture. The paper introduces a novel distance measurement, that is SDD (Slope Duration Distance), for local subsequences. At the same time, we propose an efficient algorithm of motif discovery over a great deal of financial data streams, that is PMDGS (P-Motif Discovery based on Grid Structure), which make use of PLA (Piecewise Linear Approximation) technology and grid structure. Extensive experiments on synthetic data and real world financial trading data show that our model provides several orders of magnitude performance improvement relative to traditional naive linear scan techniques.
A Spectral Element Method to Price European Options. I. Single Asset with and without Jump Diffusion
Authors: Wuming Zhu, David A. Kopriva
Venue: Journal of Scientific Computing (2009)

We develop a spectral element method to price single factor European options with and without jump diffusion. The method uses piecewise high order Legendre polynomial expansions to approximate the option price represented pointwise on a Gauss-Lobatto mesh within each element, which allows an exact representation of the non-smooth payoff function. The convolution integral is approximated by high order Gauss-Lobatto quadratures. A second order implicit/explicit (IMEX) approximation is used to integrate in time, with the convolution integral integrated explicitly. The method is spectrally accurate (exponentially convergent) in space for the solution and Greeks, and second-order accurate in time. The spectral element solution to the Black-Scholes equation is ten to one hundred times faster than commonly used second order finite difference methods.
An Efficient Networking Management for a Protocol Processor
Authors: Yul Chu, Amit Uppal
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

This paper implements an efficient networking management for a protocol processor in a network terminal. The protocol processor is to handle high-speed data streams, more than 10 Gb/s, in a network terminal. We propose an algorithm, which contributes to fairness and full utilization of the packet buffer memory. In our experimental results, the proposed algorithm shows good improvement for the packet loss ratio compared to conventional dynamic algorithms.
The design and realisation of the Experimentmy Virtual Research Environment for social sharing of workflows
Authors: David De Roure, Carole Goble, Robert Stevens
Venue: Future Generation Computer Systems (2009)

In this paper we suggest that the full scientific potential of workflows will be achieved through mechanisms for sharing and collaboration, empowering scientists to spread their experimental protocols and to benefit from those of others. To facilitate this process we have designed and built the Experimentmy Virtual Research Environment for collaboration and sharing of workflows and experiments. In contrast to systems which simply make workflows available, Experimentmy provides mechanisms to support the sharing of workflows within and across multiple communities. It achieves this by adopting a social web approach which is tailored to the particular needs of the scientist. We present the motivation, design and realisation of Experimentmy.
Ontology-based curriculum content sequencing system with semantic rules
Authors: Yu-Liang Chi
Venue: Expert Systems with Applications: An International Journal (2009)

Curriculum content sequencing involves managing a learning route to help users achieve learning goals. A conventional learning route consists of ordered content and is primarily based on a single course material. In an e-learning system, amount of similar course contents are available. These contents are expected to mutually substitute for one another in creating flexible learning routes. Owing to inconsistency in materials editing and cataloging, composing contents based on multiple sources leads to sequencing complexity. Most significantly, most e-learning systems lack a sequencing mechanism for dominating content composition. This study utilizes a knowledge-intensive approach to create a general sequencing knowledge base. This approach includes two components: (1) ontology is used to represent abstract views of content sequencing and course materials and (2) added semantic rules are used to represent relationships between individuals. Following knowledge base creation, both practical curriculum sequences and course materials can be inserted as factual knowledge. A reliable knowledge base can be established using inference power. An example involving mathematics course in elementary school education is designed using Web Ontology Language (OWL) and Semantic Web Rule Language (SWRL). Experimental lessons demonstrate that semantic rules in conjunction with ontologies not only solve sequencing problems but also achieve a durable knowledge base and a reliable system.
The Codewriting Workbook: Creating Meta-level Architecture in AutoLISP, 1 edition
Authors: Robert J. Krawczyk
Venue:  (2008)

The Codewriting Workbook introduces students and practitioners to basic programming concepts for computer-aided design (CAD). Through a series of guided exercises and examples readers learn how to develop and write procedures for creating two-dimensional drawings and three-dimensional models using a variety of algorithmic functions. Each exercise begins with a simple concept and evolves into a family of possible solutions. A primer on programming The Codewriting Workbook presents efficient methods for computing singular results that when compounded generate the broadest range of design possibilities. Though exercises are presented in AutoLISP the workbook outlines general processes for structuring procedures that can be adapted to almost any CAD-based scripting language.
A Robust Feature Extraction Algorithm for Audio Fingerprinting
Authors: Jianping Chen, Tiejun Huang
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

In this paper, we present a new feature extraction algorithm which is referred to as weighted ASF (WASF) in a fingerprint system. The feature in our algorithm is extracted based on a MPEG-7 descriptor-Audio Spectrum Flatness (ASF) and Human Auditory System (HAS). It also applies several effective filters and another MPEG-7 descriptor: Audio Signature (AS). This algorithm is tested under several audio distortions: sampling rate change, noise addition, and speed-change and so on. For these distortions, the WASF algorithm can get discrimination more than 90%. The MFCC feature and another MPEG-7 descriptor-Audio spectrum Centroid (ASC) are also considered.
The F5 criterion revised
Authors: Alberto Arri
Venue: ACM Communications in Computer Algebra (2009)

The purpose of this work is to generalize the theory behind the "F5" algorithm presented by J.C. Faugère in [3] and its matrix variant described by M. Bardet in [1]. The F5 algorithm is an algorithm which computes the Gröbner basis of a given polynomial ideal I from its generators F = (f1 , ... , fm). Faugère's main idea is to consider the expression of an element p ∈ I in terms of the generators, p = ∏hifi , and keep explicitly track of the leading term S(p) of the vector (h1 , ... , hm), taken in its normal form with respect to the module of syzygies of F. We provide a novel rigorous proof of a more general criterion than the one stated by Faugère, which establishes when a set of polynomials G is a Gröbner basis by considering the values S(g) for all g ∈ G; we further generalize our result by removing the requirement that the sequence f1 , ... ,fm is a regular sequence. The criterion itself is based on the knowledge of the module LT(Syz F), we have however devised an algorithm which simultaneously computes (a subset of) LT(Syz F) and a Gröbner basis of I. We had written a first prototypal implementation in C++ using CoCoAlib [2] and we are currently working on a new implementation of the algorithm again in C++ from scratch.
A quasi-polynomial time approximation scheme for minimum weight triangulation
Authors: Jan Remy, Angelika Steger
Venue: Journal of the ACM (JACM) (2009)

The Minimum Weight Triangulation problem is to find a triangulation T&ast; of minimum length for a given set of points P in the Euclidean plane. It was one of the few longstanding open problems from the famous list of twelve problems with unknown complexity status, published by Garey and Johnson [1979]. Very recently, the problem was shown to be NP-hard by Mulzer and Rote [2006]. In this article, we present a quasi-polynomial time approximation scheme for Minimum Weight Triangulation.
Action specific Massive Multiplayer Online Role Playing Games traffic analysis: case study of World of Warcraft
Authors: Mirko Suznjevic, Maja Matijasevic, Ognjen Dobrijevic
Venue: Proceedings of the 7th ACM SIGCOMM Workshop on Network and System Support for Games (2008)

In Massive Multiplayer Online Role Playing Games (MMORPGs) players can perform various actions in the virtual world. We try to answer the question how is generated network traffic, and to what extent, dependent of the action that player performs and overall context/situation in the virtual world. We have divided action types in four major categories: questing, trading, raiding, and player versus player (PvP) combat. We have carried out action-specific measurements of the network traffic for the World of Warcraft (WoW) game and gathered 1.28 GB of data on which the analysis was performed. The traffic analysis included network bandwidth usage, packet payload size, percentage of data packets in the total traffic, packet rate, and packet interarrival and interdeparture times. While the category of PvP combat has highest overall demands on the client side traffic, raiding imposes highest demands on the server side. Trading showed lowest demands on the both sides in almost all categories of the analysis.
ReST-Based Web Access to Learning Design Services
Authors: Juan Manuel Dodero, Ernie Ghiglione
Venue: IEEE Transactions on Learning Technologies (2008)

The IMS Learning Design model defines how users are engaged in learning activities to use learning objects and learning services. Although these are similarly accessible from URLs in a learning design, they are essentially different in the form of accessing their features and operations from a learning activity user interface. This paper proposes a Representational State Transfer (ReST) architectural style of accessing a learning service and its constituent resources from a web-based environment. A methodology to guide the design of learning service access is also described. The method is applied to integrating operations of a generic wiki service in the client interface of a learning activity, and validated on actual wiki services providing ReST-based programming interfaces.
Modelling Trust Requirements by Means of a Visualization Language
Authors: Kamaljit Kaur Bimrah, Haralambos Mouratidis, David Preston
Venue: Proceedings of the 2008 Requirements Engineering Visualization (2008)

Little effort has been put into understanding how trust can be modelled and reasoned when developing information systems. Equally little effort has been put into developing visual languages to support trust modelling. Our motivation comes from this situation and we aim to develop a visualization language for trust related requirements elicitation. In this paper we highlight the lack of substantial work in this area and we describe the foundation for such a visualization language.
A density-based method for adaptive LDA model selection
Authors: Juan Cao, Tian Xia, Jintao Li, Yongdong Zhang, Sheng Tang
Venue: Neurocomputing (2009)

Topic models have been successfully used in information classification and retrieval. These models can capture word correlations in a collection of textual documents with a low-dimensional set of multinomial distribution, called ''topics''. However, it is important but difficult to select the appropriate number of topics for a specific dataset. In this paper, we study the inherent connection between the best topic structure and the distances among topics in Latent Dirichlet allocation (LDA), and propose a method of adaptively selecting the best LDA model based on density. Experiments show that the proposed method can achieve performance matching the best of LDA without manually tuning the number of topics.