ppxscal/embedding_network huggingface dataset:
Ajax Programming for the Absolute Beginner, 1st edition
Authors: Jr,  Jerry Lee Ford
Venue:  (2008)

Learn Ajax the easy way! If you are new to programming with Ajax and are looking for a solid introduction, this is the book for you. Developed by computer science instructors, books in the for the absolute beginner series teach the principles of programming through simple game creation. You will acquire the skills that you need for more practical programming applications and will learn how these skills can be put to use in real-world scenarios. Best of all, by the time you finish the book you will be able to apply the basic principles youve learned to the next programming language you tackle.
Approximately optimal trees for group key management with batch updates
Authors: Minming Li, Ze Feng, Nan Zang, Ronald L. Graham, Frances F. Yao
Venue: Theoretical Computer Science (2009)

We investigate the group key management problem for broadcasting applications. Previous work showed that, in handling key updates, batch rekeying can be more cost effective than individual rekeying. One model for batch rekeying is to assume that every user has probability p of being replaced by a new user during a batch period with the total number of users unchanged. Under this model, it was recently shown that an optimal key tree can be constructed in linear time when p is a constant and in O(n^4) time when p->0. In this paper, we investigate more efficient algorithms for the case p->0, i.e., when membership changes are sparse. We design an O(n) heuristic algorithm for the sparse case and show that it produces a nearly 2-approximation to the optimal key tree. Simulation results show that its performance is even better in practice. We also design a refined heuristic algorithm and show that it achieves an approximation ratio of 1+@e for any fixed @e>0 and n, as p->0. Finally, we give another approximation algorithm for any p@?(0,0.693) which is shown to be quite good by our simulations.
Performance Evaluation of an Adaptive Ant Colony Optimization Applied to Single Machine Scheduling
Authors: Davide Anghinolfi, Antonio Boccalatte, Massimo Paolucci, Christian Vecchiola
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

We propose a self-adaptive Ant Colony Optimization (AD-ACO) approach that exploits a parameter adaptation mechanism to reduce the requirement of a preliminary parameter tuning. The proposed AD-ACO is based on an ACO algorithm adopting a pheromone model with a new global pheromone update mechanism. We applied this algorithm to the single machine total weighted tardiness scheduling problem with sequence-dependent setup times and we executed an experimental campaign on a benchmark available in literature. Results, compared with the ones produced by the ACO algorithm without adaptation mechanism and with those obtained by recently proposed metaheuristic algorithms for the same problem, highlight the quality of the proposed approach.
Using SVM as back-end classifier for language identification
Authors: Hongbin Suo, Ming Li, Ping Lu, Yonghong Yan
Venue: EURASIP Journal on Audio, Speech, and Music Processing (2008)

Robust automatic language identification (LID) is a task of identifying the language froma short utterance spoken by an unknown speaker. One of the mainstream approaches named parallel phone recognition language modeling (PPRLM) has achieved a very good performance. The log-likelihood radio (LLR) algorithm has been proposed recently to normalize posteriori probabilities which are the outputs of back-end classifiers in PPRLM systems. Support vector machine (SVM) with radial basis function (RBF) kernel is adopted as the back-end classifier. But for the conventional SVM classifier, the output is not probability. We use a pairwise posterior probability estimation (PPPE) algorithm to calibrate the output of each classifier. The proposed approaches are evaluated on the 2005 National Institute of Standards and Technology (NIST). Language recognition evaluation databases and experiments show that the systems described in this paper produce comparable results to the existing arts.
Robust Digital Image Watermarking Based on Principal Component Analysis and Discrete Wavelet Transform
Authors: Jen-Sheng Tsai, Win-Bin Huang, Po-Hung Li, Chao-Lieh Chen, Yau-Hwang Kuo
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

In this paper, a robust image watermarking algorithm based on principal component analysis and discrete wavelet transform is proposed for copyright protection. At first, an orientation histogram is obtained from the direction of the feature points of an image identified by a scale invariant feature transform in the proposed watermark embedding scheme. The highest peak of the orientation histogram regarded as the dominant orientation of an image is a start index to divide the image into bins covering 360 degree range of orientation. Moreover, the most important principal components of image coefficients within each bin are obtained after applying principal component analysis. Finally, the copyright watermark is inserted into the wavelet coefficients of these components in quantization steps. Similarly, the proposed watermark detecting scheme follows the above procedure to blindly extract the copyright watermark from a watermarked image. Various attacks are applied to the watermarked images in order to examine the robustness of our algorithm. The experimental results in this paper show that the proposed watermarking algorithm can tolerate JPEG compression, median filtering, Gaussian filtering, sharpening, and rotation attacks.
Maintaining user participation throughout the systems development cycle
Authors: Randy J. Raynor, Linda D. Speckmann
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

Effective user participation is well known to be an important aspect of good system development methodology. Specific tools and techniques for managing user participation in all phases of the systems development life cycle are illustrated by a large business system development project at Texas Instruments. Emphasis is placed on maintaining a constant level of communication between user and developer as the system design evolves.
Vector-field consistency for ad-hoc gaming
Authors: Nuno Santos, Luís Veiga, Paulo Ferreira
Venue: Proceedings of the ACM/IFIP/USENIX 2007 International Conference on Middleware (2007)

Developing distributed multiplayer games for ad-hoc networks is challenging. Consistency of the replicated shared state is hard to ensure at a low cost. Current consistency models and middleware systems lack the required adaptability and efficiency when applied to ad-hoc gaming. Hence, developing such robust applications is still a daunting task. We propose i) Vector-Field Consistency (VFC), a new consistency model, and ii) the Mobihoc middleware to ease the programming effort of these games, while ensuring the consistency of replicated objects. VFC unifies i) several forms of consistency enforcement and a multi-dimensional criteria (time, sequence and value) to limit replica divergence, with ii) techniques based on locality-awareness (w.r.t. players position). Mobihoc adopts VFC and provides game programmers the abstractions to manage game state easily and efficiently. A Mobihoc prototype and a demonstrating game were developed and evaluated. The results obtained are very encouraging.
Exploring Visual and Motor Accessibility in Navigating a Virtual World
Authors: Shari Trewin, Mark Laff, Vicki Hanson, Anna Cavender
Venue: ACM Transactions on Accessible Computing (TACCESS) (2009)

For many millions of users, 3D virtual worlds provide an engaging, immersive experience heightened by a synergistic combination of visual realism with dynamic control of the user&rsquo;s movement within the virtual world. For individuals with visual or dexterity impairments, however, one or both of those synergistic elements are impacted, reducing the usability and therefore the utility of the 3D virtual world. This article considers what features are necessary to make virtual worlds usable by such individuals. Empirical work has been based on a multiplayer 3D virtual world game called PowerUp, to which we have built in an extensive set of accessibility features. These features include in-world navigation and orientation tools, font customization, self-voicing text-to-speech output, key remapping options, and keyboard-only and mouse-only navigation. Through empirical work with legally blind teenagers and adults with cerebral palsy, these features have been refined and validated. Whereas accessibility support for users with visual impairment often revolves around keyboard navigation, these studies emphasized the need to support visual aspects of pointing device actions too. Other notable findings include use of speech to supplement sound effects for novice users, and, for those with cerebral palsy, a general preference to use a pointing device to look around the world, rather than keys or on-screen buttons. The PowerUp accessibility features provide a core level of accessibility for the user groups studied.
Visualization, Digital Content, and Simulation
Authors: Bruno Feijó
Venue: IEEE MultiMedia (2009)

This article by Bruno Feijó explores high-quality digital-content production in emerging and developing countries, Brazil in particular, for many sophisticated visualization and simulation applications.
Spine Crossing Minimization in Upward Topological Book Embeddings
Authors: Tamara Mchedlidze, Antonios Symvonis
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

An upward topological book embedding of a planar st-digraph G is an upward planar drawing of G such that its vertices are aligned along the vertical line, called the spine, and each edge is represented as a simple Jordan curve which is divided by the intersections with the spine (spine crossings) into segments such that any two consecutive segments are located at opposite sides of the spine. When we treat the problem of obtaining an upward topological book embedding as an optimization problem, we are naturally interested in embeddings with the minimum possible number of spine crossing.
XML compression techniques: A survey and comparison
Authors: Sherif Sakr
Venue: Journal of Computer and System Sciences (2009)

XML has been acknowledged as the defacto standard for data representation and exchange over the World Wide Web. Being self describing grants XML its great flexibility and wide acceptance but on the other hand it is the cause of its main drawback that of being huge in size. The huge document size means that the amount of information that has to be transmitted, processed, stored, and queried is often larger than that of other data formats. Several XML compression techniques has been introduced to deal with these problems. In this paper, we provide a complete survey over the state-of-the-art of XML compression techniques. In addition, we present an extensive experimental study of the available implementations of these techniques. We report the behavior of nine XML compressors using a large corpus of XML documents which covers the different natures and scales of XML documents. In addition to assessing and comparing the performance characteristics of the evaluated XML compression tools, the study also tries to assess the effectiveness and practicality of using these tools in the real world. Finally, we provide some guidelines and recommendations which are useful for helping developers and users for making an effective decision towards selecting the most suitable XML compression tool for their needs.
Diagnostic Feature Analysis of a Dobutamine Stress Echocardiography Dataset Using Rough Sets
Authors: Kenneth Revett
Venue: Transactions on Rough Sets IX (2008)

Stress echocardiography is an important functional diagnostic and prognostic tool that is now routinely applied to evaluate the risk of cardiovascular artery disease (CAD). In patients who are unable to safely undergo a stress based test, dobutamine is administered which provides a similar effect to stress on the cardiovascular system. In this work, a complete dataset containing data on 558 subjects undergoing a prospective longitudinal study is employed to investigate what diagnostic features correlate with the final outcome. The dataset was examined using rough sets, which produced a series of decision rules that predicts which features influence the outcomes measured clinically and recorded in the dataset. The results indicate that the ECG attribute was the most informative diagnostic feature. In addition, prehistory information has a significant impact on the classification accuracy.
Adaptive Visible Watermarking of Images
Authors: Mohan S. Kankanhalli, Rajmohan, K R. Ramakrishnan
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

Digital watermarks are emerging as a tool to provide copyright protection for high quality images and video. Though a lot of work has been done in the area of invisible watermarks, relatively less earlier work exists for visible watermarks. As a consensus on the various issues for invisible watermarks to be legally admissible eludes us, a visible watermark could serve as a deterrence to theft and also to provide instantaneous recognition of the owner or creator of an image. We propose a technique in which the location and strength of the watermark image to be embedded is varied in accordance with the underlying content of the image to be watermarked. We propose a new algorithm that classifies each block of 8 × 8 of pixels into one of 8 classes depending on the sensitivity of the block to distortion. We analyze the texture, edge and luminance information in the block for this purpose. The embedding process is automated and the bits are embedded in the DCT transform domain. Since the strength of the watermark in a block depends on the class to which the block belongs, the result is a pleasant and unobtrusively watermarked image irrespective of the type of image.
Scene Determination Based on Video and Audio Features
Authors: Rainer Lienhart, Silvia Pfeiffer, Wolfgang Effelsberg
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

Determining automatically what constitutes a scene in a video is a challenging task, particularly since there is no precise definition of the term "scene". It is left to the individual to set attributes shared by consecutive shots which group them into scenes. Certain basic attributes such as dialogs, like settings and continuing sounds are consistent indicators. We have therefore developed a scheme for identifying scenes by clustering shots according to detected dialogs, like settings and similar audio. Results from experiments show automatic identification of these types of scenes to be reliable.
Expressive, yet tractable XML keys
Authors: Sven Hartmann, Sebastian Link
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

Constraints are important for a variety of XML recommendations and applications. Consequently, there are numerous opportunities for advancing the treatment of XML semantics. In particular, suitable notions of keys will enhance XML's capabilities of modeling, managing and processing native XML data. However, the different ways of accessing and comparing XML elements make it challenging to balance expressiveness and tractability. We investigate XML keys which uniquely identify XML elements based on a very general notion of value-equality: isomorphic subtrees with the identity on data values. Previously, an XML key fragment has been recognised that is robust in the sense that its implication problem can be expressed as the reachability problem in a suitable digraph. We analyse the impact of extending this fragment by structural keys that uniquely identify XML elements independently of any data. We establish a sound and complete set of inference rules for this expressive fragment of XML keys, and encode these rules in an algorithm that decides the associated implication problem in time quadratic in the size of the input keys. Consequently, we gain significant expressiveness without any loss of efficiency in comparison to less expressive XML key fragments.
Identification of Wavelet Modulation Based on Gaussian Detection and Kurtosis of Power Spectrum
Authors: Xianghong Tang, Liyue Li, Ling Zhao
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

Wavelet modulation is a new type of multi-carrier modulation, this paper based on the asymptotically Gaussian distribution and frequency spectrum's feature of OFDM and wavelet modulated (WM) signal, studies the recognition of wavelet modulated signal in the additive white Gaussian noise channel. Using the joint estimation of the signal to noise ratio (SNR) and features value based on higher order moments and kurtosis of power spectrum can respectively identify single-carrier modulated signals and multi-carrier modulated signals; OFDM and WM signal. Simulation results show that good performance is obtained and Gaussian noise interference is eliminated.
What e-politicians do with words: Online communication between councillors and citizens
Authors: Arthur Edwards
Venue: Information Polity (2008)

This paper explores how Dutch councillors used an online forum that was established for communication between citizens and councillors. Councillor participation varied widely across parties and individuals. Councillors vary in their attitudes toward online communication with citizens. These differences are partly attributable to styles of representation. A research strategy based on speech act theory is used to identify these styles. Councillors have outspoken viewpoints concerning anonymity and tone. Personal competences to communicating with citizens effectively online are also important. The paper concludes by presenting a theoretical framework for explaining elected politicians' uses of online forums.
Ontology versus semantic networks for medical knowledge representation
Authors: Abdel-Badeeh M. Salem, Marco Alfonse
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

The efficient Semantic Web, needs knowledge to be presented in a well defined form which enables people and software agents to understand it. There are many knowledge representation techniques such as rules, frames, scripts, semantic network and ontology. The purpose of this paper is to illustrate the difference between semantic network and ontology techniques for medical knowledge representation. The paper presents a development of semantic net and ontology for lung cancer using PROLOG and Protégé-OWL respectively. The results show that ontology supports representing knowledge semantically for building a robust knowledge-based system.
Implementation of a genetic algorithm on a virtex-ii pro FPGA
Authors: Michalis Vavouras, Kyprianos Papadimitriou, Ioannis Papaefstathiou
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

This paper presents the implementation of a Genetic Algorithm on a XUPV2P platform with a Virtex-II Pro FPGA. A Genetic Algorithm (GA) is a search technique finding exact or approximate solutions to optimization and search problems. It is a computer simulation approach in which a population of abstract representations of candidate solutions to an optimization problem evolves toward better solutions. The aim is the optimization of a given function, called fitness function, which is evaluated upon the initial population as well as upon the solutions after successive generations. The motivation for implementing GAs in hardware stems from the fact that they are very CPU intensive while they are also intrinsically parallel algorithms and the basic operations of a GA can execute in a pipelining fashion. Our architecture incorporates a Power PC, and built-in hardcore resources like multiplier blocks and BRAMs in order to create an efficient hardware-based genetic algorithm. We have fine tuned the architecture so as to be more parallel, and added complex fitness functions. The design executes on 100 MHz and although complex in logic, it has low silicon requirements as it utilizes 16% slices, 7% BRAMs and 11% multiplier blocks, plus the Power PC of the XC2VP30 FPGA. The result is a functional prototype on which experiments for a range of different genetic parameters can be conducted. We explore the GA's behavior with real-world experiments for different fitness functions and different number of generations. Our design is the first single-chip fully embedded approach that optimizes six fitness functions, which is more than any other proposed solution, while its current implementation supports populations of up to 32 members. The experiments show that our system outperforms in terms of execution time the existing and proposed hardware systems from 23% up to 5895%.
The subdivision-constrained minimum spanning tree problem
Authors: Jianping Li, Weidong Li, Tongquan Zhang, Zhongxu Zhang
Venue: Theoretical Computer Science (2009)

Motivated by the constrained minimum spanning tree (CST) problem in Hassin and Levin [R. Hassin, A. Levin, An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection, SIAM Journal on Computing 33 (2) (2004) 261-268], we study a new combinatorial optimization problem in this paper, called the general subdivision-constrained spanning tree problem (GSCST): given a graph G=(V,E;w,c) with two nonnegative integers w(e) and c(e) for each edge e&isin;E, two positive integers B and d, the GSCST problem is to first find a spanning tree T=(V,ET) of G with weight &Sigma;e&isin;ETw(e)&le;B and then to insert some new vertices on some suitable edges in T such that each edge in the subdivision tree T' of T has its weight not beyond d. The objective is to minimize the cost &Sigma;e&isin;ETinsert(e)c(e) of such new vertices inserted on the suitable edges among all spanning trees of G subject to the two preceding constraints, where a subdivision tree T' of T is constructed by inserting some new vertices on the suitable edges in T, the value insert(e)=[w(e)/d] - 1 is the least number of vertices inserted and c(e) is the cost of each vertex inserted on the edge e. We obtain the following main results: (1) the GSCST problem and its variant are still NP-hard, by a reduction from the 0-1 knapsack problem, respectively; (2) the GSCST problem as well as its variant is polynomially equivalent to the CST problem, which implies the existence of a polynomial time approximation scheme to solve the GSCST problem and its variant; (3) we finally design three strongly polynomial time algorithms to solve the special versions of the GSCST problem and its variant, respectively.
When RFIDs meet artist's painting
Authors: Olivier Haberman, Romain Pellerin, Ugo Haberman
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

This work challenges to create paintings augmented with RFIDs.