ppxscal/embedding_network huggingface dataset:
Deciding equivalence of top--down XML transformations in polynomial time
Authors: Joost Engelfriet, Sebastian Maneth, Helmut Seidl
Venue: Journal of Computer and System Sciences (2009)

Many useful XML transformations can be expressed by deterministic top-down tree transducers. A normal form is presented for such transducers (extended with the facility to inspect their input trees). A transducer in normal form has a unique canonical form which can be obtained by a minimization procedure, in polynomial time. Thus, equivalence of transducers in normal form can be decided in polynomial time. If the transducer is total, the normal form can be obtained in polynomial time as well.
Strategic Analysis of an Innovative Business Model in the Wireless Internet Access Market
Authors: Qing Yun, Marcin Solarski, Pablo Vidales, Uwe Hoeft
Venue: Proceedings of the 2009 Second International Symposium on Intelligent Information Technology and Security Informatics (2009)

This paper introduces an innovative business model in wireless Internet access market. The business model tends to construct a low-cost wireless access infrastructure through encouraging ISP (Internet Service Provider) users to share their spare Internet resource. Radical changes of the roles in the business model bring new strategic possibilities to the players involved. A new type of virtual service provider emerges accordingly. Analysis of the paper focuses on strategy analysis for this virtual service provider. Using the approach of portfolio management, possible strategic scenarios are compared. To be solution provider is found out as the best one because it has the best combination of market attractiveness and competitive advantages. In the paper the business model, Concept of strategy and the methodology involved are defined. Possible strategic scenarios are then compared and analyzed. Implementing the methodology, the alternatives are compared and evaluated. The selected strategy is described in the last part.
A Novel Visual Speech Representation and HMM Classification for Visual Speech Recognition
Authors: Dahai Yu, Ovidiu Ghita, Alistair Sutherland, Paul F. Whelan
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

This paper presents the development of a novel visual speech recognition (VSR) system based on a new representation that extends the standard viseme concept (that is referred in this paper to as Visual Speech Unit (VSU)) and Hidden Markov Models (HMM). The visemes have been regarded as the smallest visual speech elements in the visual domain and they have been widely applied to model the visual speech, but it is worth noting that they are problematic when applied to the continuous visual speech recognition. To circumvent the problems associated with standard visemes, we propose a new visual speech representation that includes not only the data associated with the articulation of the visemes but also the transitory information between consecutive visemes. To fully evaluate the appropriateness of the proposed visual speech representation, in this paper an extensive set of experiments have been conducted to analyse the performance of the visual speech units when compared with that offered by the standard MPEG-4 visemes. The experimental results indicate that the developed VSR application achieved up to 90% correct recognition when the system has been applied to the identification of 60 classes of VSUs, while the recognition rate for the standard set of MPEG-4 visemes was only in the range 62-72%.
Optimization of 2D image reconstruction for positron emission mammography using IDL
Authors: N. Oliveira, N. Matela, R. Bugalho, N. Ferreira, P. Almeida
Venue: Computers in Biology and Medicine (2009)

The Clear-PEM system is a prototype machine for Positron Emission Mammography (PEM) under development within the Portuguese PET-Mammography consortium. We have embedded 2D image reconstruction algorithms implemented in IDL within the prototype's image analysis package. The IDL implementation of these algorithms proved to be accurate and computationally efficient. In this paper, we present the implementation of the MLEM, OSEM and ART 2D iterative image reconstruction algorithms for PEM using IDL. C and IDL implementations are compared using realistic Monte Carlo simulated data. We show that IDL can be used for the easy implementation of image reconstruction algorithms for emission tomography.
Implementing a parallel matrix factorization library on the cell broadband engine
Authors: B. C. Vishwas Abhishek Gadia Mainak Chaudhuri
Venue: Scientific Programming (2009)

Matrix factorization (or often called decomposition) is a frequently used kernel in a large number of applications ranging from linear solvers to data clustering and machine learning. The central contribution of this paper is a thorough performance study of four popular matrix factorization techniques, namely, LU, Cholesky, QR and SVD on the STI Cell broadband engine. The paper explores algorithmic as well as implementation challenges related to the Cell chip-multiprocessor and explains how we achieve near-linear speedup on most of the factorization techniques for a range of matrix sizes. For each of the factorization routines, we identify the bottleneck kernels and explain how we have attempted to resolve the bottleneck and to what extent we have been successful. Our implementations, for the largest data sets that we use, running on a two-node 3.2 GHz Cell BladeCenter (exercising a total of sixteen SPEs), on average, deliver 203.9, 284.6, 81.5, 243.9 and 54.0 GFLOPS for dense LU, dense Cholesky, sparse Cholesky, QR and SVD, respectively. The implementations achieve speedup of 11.2, 12.8, 10.6, 13.0 and 6.2, respectively for dense LU, dense Cholesky, sparse Cholesky, QR and SVD, when running on sixteen SPEs. We discuss the interesting interactions that result from parallelization of the factorization routines on a two-node non-uniform memory access (NUMA) Cell Blade cluster.
Convertible multi-authenticated encryption scheme with one-way hash function
Authors: Jia-Lun Tsai
Venue: Computer Communications (2009)

To send the message to the recipient securely, authenticated encryption schemes were proposed. In 2008, Wu et al. [T.S. Wu, C.L. Hsu, K.Y. Tsai, H.Y. Lin, T.C. Wu, Convertible multi-authenticated encryption scheme, Information Sciences 178 (1) 256-263.] first proposed a convertible multi-authenticated encryption scheme based on discrete logarithms. However, the author finds that the computational complexity of this scheme is rather high and the message redundancy is used. To improve the computational efficiency and remove the message redundancy, the author proposes a new convertible multi-authenticated encryption scheme based on the intractability of one-way hash functions and discrete logarithms. As for efficiency, the computation cost of the proposed scheme is smaller than Wu et al.'s scheme.
Real-time CBR traffic scheduling in IEEE 802.16-based wireless mesh networks
Authors: Jun Zou, Dongmei Zhao
Venue: Wireless Networks (2009)

This paper studies packet transmission scheduling for real-time constant-bit-rate (CBR) traffic in IEEE 802.16-based wireless mesh networks. We first formulate and solve the scheduling problem as a binary linear programming problem. The computational complexity of the optimum scheduling solution may prevent it from being implemented in practice. We then propose a heuristic scheme, namely bottleneck first scheduling scheme, where scheduling decisions at stations (base station or subscriber stations) with higher traffic loads are done before those at stations with lower traffic loads. At each station, scheduling decisions for CBR packets with more hops to their destinations are done first. Numerical results show that the proposed scheduling scheme achieves the same capacity as the optimal one while obtaining satisfactory delay performance.
FaceBots: social robots utilizing facebook
Authors: Nikolaos Mavridis, Chandan Datta, Shervin Emami, Chiraz BenAbdelkader, Andry Tanoto, Tamer Rabie
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

Although existing robotic systems are interesting to interact with in the short term, it has been shown that after some weeks of quasi-regular encounters, humans gradually lose their interest, and meaningful longer-term human-robot relationships are not established. An underlying hypothesis driving the proposed project is that such relationships can be significantly enhanced if the human and the robot are gradually creating a pool of shared episodic memories that they can co-refer to, and if they are both embedded in a social web of other humans and robots they both know and encounter frequently. Thus, here we propose to use Facebook, a highly successful online networking resource for humans, towards enhancing longer-term human-robot relationships, by helping to address the above two prerequisites. As a starting point, we utilize social information in order to personalize human-robot dialogues, and to include references to past encounters and to encounters with friends within dialogues. A robot equipped with a modular software architecture (with IPC-intercommunicating modules for face recognition, a simple dialog system, a navigation subsystem, and a real-time Facebook connection/local social database) has been deployed, and is encountering humans in the environment of our lab. An early demonstration of a basic form of such encounters is shown in the submitted video. The system is expected to achieve two significant novelties: arguably being one of the first robots to be embedded in a social web, and being the first robot that can purposefully exploit and create social information that is available online. Furthermore, it is expected to provide empirical support for our main driving hypothesis, that the formation of shared episodic memories within a social web can lead to more meaningful long-term human-robot relationships.
Link Scheduling in Local Interference Models
Authors: Bastian Katz, Markus Völker, Dorothea Wagner
Venue: Algorithmic Aspects of Wireless Sensor Networks: Fourth International Workshop, ALGOSENSORS 2008, Reykjavik, Iceland, July 2008. Revised Selected Papers (2008)

Choosing an appropriate interference model is crucial for link scheduling problems in sensor networks. While graph-based interference models allow for distributed and purely local coloring approaches which lead to many interesting results, a more realistic and widely agreed on model such as the signal-to-noise-plus-interference ratio (SINR) inherently makes scheduling radio transmission a non-local task, and thus impractical for the development of distributed and scalable scheduling protocols in sensor networks. In this work, we focus on interference models that are local in the sense that admissibility of transmissions only depends on local concurrent transmissions, and correct with respect to the geometric SINR model.In our analysis, we show lower bounds on the limitations that these restrictions impose an any such model as well as approximation results for greedy scheduling algorithms in a class of these models.
Introduction to Part 1
Authors: Per Stenström
Venue: Transactions on High-Performance Embedded Architectures and Compilers I (2007)

In November 2005, the first in the series of International Conferences on High-Performance Embedded Architectures and Compilers (HiPEAC 2005) was held in Barcelona. We were fortunate to attract close to 100 submissions of which only 18 were selected for presentation. Among these, we asked the authors of the five most highly rated contributions to make extended versions of them. They all accepted to do that and their articles appear in this section of the volume.
Easy Steps to Speed Up Windows XP: Now That You've Had Windows XP for Awhile, How to Make It Run Faster
Authors: Michael Palmer
Venue:  (2007)

You bought your computer to help you work faster, enjoy your entertainment, and make the most of the Internet. This book will help put the fun back into computing so you are spending less time waiting and more time using your computer. In Easy Steps to Speed Up Windows XP, best-selling author Michael Palmer shows you all kinds of ways to speed up your computer. All of the techniques are presented in easy-to-follow steps, like following a recipe. There are plenty of screen captures to illustrate the steps, and there are tips to show you how to get the most out of what you learn. There is no need to be a computer expert to use the techniques presented here-only the desire to make your Windows XP computer run faster. Use this book to: - Help your computer start up faster - Make your programs run faster - Speed up access to information on your disks - Optimize network and Internet access - Learn ways to speed up computer equipment, such as your printer, CD/DVD drives, and CPU
Modelling damping ratio and shear modulus of sand-mica mixtures using genetic programming
Authors: Abdulkadir Cevik, Ali Firat Cabalar
Venue: Expert Systems with Applications: An International Journal (2009)

This study presents two Genetic Programming (GP) models for damping ratio and shear modulus of sand-mica mixtures based on experimental results. The experimental database used for GP modelling is based on a laboratory study of dynamic properties of saturated coarse rotund sand and mica mixtures with various mix ratios under different effective stresses. In the tests, shear modulus, and damping ratio of the geomaterials have been measured for a strain range of 0.001% up to 0.1% using a Stokoe resonant column testing apparatus. The input variables in the developed NN models are the mica content, effective stress and strain, and the outputs are damping ratio and shear modulus. The performance of accuracies of proposed NN models are quite satisfactory (R^2=0.95 for damping ratio and R^2=0.98 for shear modulus).
To Construct Implicit Link Structure by Using Frequent Sequence Miner (FS-Miner)
Authors: May Thu Aung, Khin Nwe Ni Tun
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

Generally, link analysis is based re-ranking web-page retrieval in current web search engine. The primary reason lies in the difference of link structures and data scale between global web and website. In this paper, we propose a framework to construct implicit link structure by using Frequent Sequence Miner (FS-Miner) in the User Web Log. And then, the Page Rank algorithm is applied to re-ranked Web Pages. The popular web paths are used to extract in user’s navigation web log and predict current user’s next step. Our system can solve the sparsity of Web links and the diversity problem of user’s access behavior. Moreover, our approach discovers users’ relevant documents to improve the performance of search results.
Application for a Secure Fax System
Authors: Sanmitra Kale, Snehal Naphade, Vinod Valecha
Venue: Proceedings of the 5th International Conference on Distributed Computing and Internet Technology (2008)

Fax is an important means to transfer official documents even today because of its features like instant acknowledgement and legal recognition; giving it an edge over Internet facilities like e-mail. Some problems still persist today. One is that sending text only data by fax is expensive.This project document describes a system for compression and encryption of fax documents and error recovery over the channel. The document to be faxed, which may contain text, pictures, charts, and other graphic images, is first converted into a portable bitmap. Bitmap compression thus used reduces the size of the document. This portable bitmap is further compressed by applying JBIG compression technique which is highly suitable for fax documents. The compressed file is then encrypted using the fast Salsa20 routine using the private key. The encrypted file is then converted into portable grayscale format for printing. The file is now sent via the fax machine as any other normal document, but without disclosing its contents to anyone other than the intended recipient. The fax machine at the receiving end is able to recover the errors introduced during transmission, using an error correcting code (specifically LDPC), ensuring correct reception of file. The received data is decoded, producing the encrypted file which is unintelligible. This is then converted to portable grayscale format, printed and scanned and given to decryption device, which performs decryption using the private key. Finally, decompression is performed and the original document is recovered as a portable bitmap. This document is now displayed or converted to any suitable format for printing.This project solves the problem of achieving secure, loss less, and efficient transmission of data by facsimile (where a direct computer network is not available).
Equipment control in transportation
Authors: Eugene Jones
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

At no time in the history of this industry has the control of its equipment been as vital. The energy crisis has resulted in a forced reduction of inventory. Control over the availability of this inventory is going to be the key not only to short term profits, but to providing the maximum level of customer service in this highly competitive industry which has significant long term implications. 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
MPEG-4 Video Decoder Optimization
Authors: Franco Casalino, Gianluca Di Cagno, Ronco Luca
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

This paper provides an overview of the MPEG standard focusing mainly on the video decoding aspects that, by their nature, represent one of the most peculiar features of the future specifications which are scheduled to become an International Standard by the beginning of year 1999. The paper first briefly introduces the MPEG standards focusing on the MPEG-4 Video part of the specification giving an extensive presentation of a coding/decoding video process. The main part of this paper is focused on the optimization performed to realize a real time software video decoder based on the MMXTM architecture compliant to the VM 8 MPEG-4 Video standard. A comparison with the reference video decoder is also presented.
The protection of personal information in public registers: the case of urban planning information in Ireland
Authors: Maeve McDonagh
Venue: Information and Communications Technology Law (2009)

This article commences by describing public registers. Examples of such registers in use in Ireland are set out. The advantages of allowing the public access to public registers are discussed, as are the negative consequences that can arise from the provision of access. In particular, privacy issues arising from the provision of access are explored. The extent to which the provision of electronic access to public registers may give rise to special concern is raised. The making available to the public of planning related information in Ireland is used as a case study in exploring these issues. Examples of personal information used in the Irish planning process are set out and the legislative provisions governing access are described. Statutory protection available for privacy of such information contained in both planning law and data protection law are evaluated and suggestions are made with respect to achieving an appropriate balance between access and privacy of personal information in public registers.
On the Optimal Radius to Deploy Antennas in Multi-user Distributed Antenna System with Circular Antenna Layout
Authors: Wei Feng, Yunzhou Li, Shidong Zhou, Jing Wang, Minghua Xia
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

In this paper, the uplink of a multi-user distributed antenna system (DAS) with antennas deployed on a circle is investigated. The optimal radius to deploy antennas is studied with the target of sum capacity maximization. Adopting random matrix theory, a good approximation of the per-user sum capacity is derived. We also present a numerical method to calculate the unknown parameters in the approximation. Consequently, as the sum capacity is maximized, we find out the optimal radius of the circle on which the distributed antennas are deployed.
Multi-service traffic profiles to realise and maintain QoS guarantees in wireless LANs
Authors: F. J. M. Panken, G. J. Hoekstra
Venue: Computer Communications (2009)

This paper shows that throughput parameter ''bits/s'' does not provide accurate insight in load conditions and/or traffic demands in Wireless LANs (WLANs). A multi-service traffic profile that does provide this insight is therefore defined. The multi-service traffic profile is natural to define network resource demands for real-time applications. Simulation results are used to show how to set the traffic profile parameters for elastic traffic. The paper subsequently uses the multi-service profiles to define the notion of a QoS budget. The QoS budget is given to a terminal and the terminal can determine locally if network consumption does not exceed the budget and whether a new network greedy application fits within the QoS budget given. Finally, it is shown how the QoS budget with its multi-service traffic profiles can be used to guarantee quality of service in wireless LANs, in a situation where WLAN channel conditions may vary in time and WLAN stations may move around within a BSS. Simulation results found in literature are used to validate the accuracy of the novel algorithms proposed to guarantee QoS in wireless LANs.
The augmented conversation engine: a system for achieving believable conversation in games and interactive stories
Authors: Chris Swain
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

Much work has been done by academic researchers as well as game industry designers to achieve more compelling and emotionally rich storytelling in interactive media. Many projects take character-based approaches by allowing the player to act as the main character in the story and by communicating key story elements via software-based non-player characters (NPCs). This paper provides details about an innovative methodology and writer-centric system called the Augmented Conversation Engine. The engine enables authoring for crafting believable interactive conversations with NPC characters.
Elementary electrodynamics
Authors: Jacques Jossinet_ca
Venue: Journal of Visualization (2008)

The paper describes the physical phenomena involved in the conduction of electricity, with particular reference to living tissue. The conduction of electricity depends on the flow of charge carriers in the material, while the dielectric properties are due to the rotation of dipoles that can align along an applied electric field. The relation between the electric variables in a conducting medium and their physical meanings are explained. The phenomena responsible for the electric and dielectric properties of living tissues are described. The presence of cells limits the flow of charge carriers, in particular at low frequency, and the membranes are responsible for dielectric relaxation. The passive response of cell membranes to weak applied signals enables bioelectrical tissue characterisation. Practical tools for electrical impedance spectroscopy are given with an overview of the most recent applications.