ppxscal/embedding_network huggingface dataset:
Online Compression Caching
Authors: C. Greg Plaxton, Yu Sun, Mitul Tiwari, Harrick Vin
Venue: Proceedings of the 11th Scandinavian workshop on Algorithm Theory (2008)

Motivated by the possibility of storing a file in a compressed format, we formulate the following class of compression caching problems. We are given a cache with a specified capacity, a certain number of compression/uncompression algorithms, and a set of files, each of which can be cached as it is or by applying one of the compression algorithms. Each compressed format of a file is specified by three parameters: encode cost, decode cost, and size. The miss penalty of a file is the cost of accessing the file if the file or any compressed format of the file is not present in the cache. The goal of a compression caching algorithm is to minimize the total cost of executing a given sequence of requests for files. We say an online algorithm is resource competitive if the algorithm is constant competitive with a constant factor resource advantage. A well-known result in the framework of competitive analysis states that the least-recently used (LRU) algorithm is resource competitive for the traditional paging problem. Since compression caching generalizes the traditional paging problem, it is natural to ask whether a resource competitive online algorithm exists or not for compression caching. In this work, we address three problems in the class of compression caching. The first problem assumes that the encode cost and decode cost associated with any format of a file are equal. For this problem we present a resource competitive online algorithm. To explore the existence of resource competitive online algorithms for compression caching with arbitrary encode costs and decode costs, we address two other natural problems in the aforementioned class, and for each of these problems, we show that there exists a non-constant lower bound on the competitive ratio of any online algorithm, even if the algorithm is given an arbitrary factor capacity blowup. Thus, we establish that there is no resource competitive algorithm for compression caching in its full generality.
Wireless Forensic: A New Radio Frequency Based Locating System
Authors: Emmanuel Velasco, Weifeng Chen, Ping Ji, Raymond Hsieh
Venue: Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics (2008)

Wireless networks are more prevalent today since they enhance the user flexibility and mobility when browsing online. However, those advantages come at a price. Wireless networks do not provide the same security features as its wired counterpart. An unprotected wireless network can be easily served as a stepping-stone in attacks through such as Warchalking. Due to the nature of wireless networks, it is very difficult to trace back to the intruder. The three current location tracking solutions: Closest Access Point, Triangulation, and Radio Frequency Fingerprinting have their own limitations in tracing wireless intruders. In this paper, we propose a more precise location tracking system - Multiple Grids System - that overcomes the limitations of the existing solutions. This new approach uses a modified wireless grid to track wireless hackers in long distance or short range at different floors of the same building. Our proposed multiple grids system can be effectively applied to detect, track and prevent wireless intruders. We also substantially present that our system can be collaborated with multiple locating applications.
Admission Control for Inter-domain Real-Time Traffic Originating from Differentiated Services Stub Domains
Authors: Stylianos Georgoulas, George Pavlou, Panos Trimintzios, Kin-Hon Ho
Venue: Proceedings of the 5th international conference on Wired/Wireless Internet Communications (2007)

Differentiated Services (DiffServ) are seen as the technology to support Quality of Service (QoS) in IP networks in a scalable manner by allowing traffic aggregation within the engineered traffic classes. In DiffServ domains, admission control additionally needs to be employed in order to control the amount of traffic into the engineered traffic classes so as to prevent overloads that can lead to QoS violations. In this paper we present an admission control scheme for inter-domain real-time traffic originating from DiffServ stub domains; that is real-time traffic originating from end-users connected to a DiffServ stub domain towards destinations outside the geographical scope of that domain. By means of simulations we show that our scheme performs well and that it compares favorably against other schemes found in the literature.
A Comparative Evaluation of XML Difference Algorithms with Genomic Data
Authors: Cornelia Hedeler, Norman W. Paton
Venue: Proceedings of the 20th international conference on Scientific and Statistical Database Management (2008)

Genome sequence data and annotations are subject to frequent changes resulting from re-assembly and re-annotation, or community feedback based on experimental evidence, giving rise to new data releases. These releases are rarely accompanied by a description of the changes, making it difficult for biologists working with the data to identify and work through the consequences of the changes that have taken place. This paper explores the extent to which existing XML difference algorithms, namely X-Diff, JXyDiff and 3DM, can be used to identify and document genome changes, in particular investigating: (i) their ability to detect typical changes in genome sequence documents; and (ii) the ease with which the difference report can be used to determine whether genes of interest are affected by changes to the genome. The evaluation compares the performance of the algorithms both with synthetic modifications and for detecting changes in a public genomic database. Typical behaviours of the algorithms are identified and a root cause analysis carried out.
Improved Distributed Dynamic Power Control for Wireless Mesh Networks
Authors: Thomas Olwal, Felix Aron, Barend J. Wyk, Yskandar Hamam, Ntsibane Ntlatlapa, Marcel Odhiambo
Venue: Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks (2008)

One of the main objectives of transmission power control (TPC) in wireless mesh networks (WMNs) for rural area applications is to guarantee successful packet transmission and reception (SPT-R) with low power consumption. However, the SPT-R depends on co-channel multiple access interferences (MAI) including the effects from hidden terminals. In this paper we investigate how MAI can be minimized through a MAC-dependent transmission scheduling probability (TSP) model. In what follows, we show how a distributed scheduling probability model improves the dynamic power control algorithm. The resulting optimal power control is derived from a network centric objective function. The analytical results show that transmit power solutions converge to a unique fixed point. The simulation results show that a high average feasibility rate, given a coexistence pattern, can be achieved. There is significant average transmission power savings compared to conventional methods.
Improved Non-Repudiable Threshold Proxy Signature Scheme with Known Signers
Authors: Chwei-Shyong Tsai, Shiang-Feng Tzeng, Min-Shiang Hwang_aff1n3
Venue: Informatica (2003)

In 2001, Hsu et al. proposed a non-repudiable threshold proxy signature with known signers. In their scheme, the proxy group cannot deny having signed the proxy signature if they did. However, Hsu et al.'s scheme is vulnerable to some attacks. A malicious original signer or malicious proxy signer can impersonate some other proxy signers to generate proxy signatures. In this article, we shall present our cryptanalysis of the Hsu et al.'s scheme. After that, we shall propose a new threshold proxy signature that can overcome the weaknesses.
The challenged identity of a field: The state of the art of eParticipation research
Authors: Rony Medaglia
Venue: Information Polity (2007)

A growing number of research contributions deal with the issues of technologically mediated participation in public decision-making in an ever-wider number of disciplinary fields. As research on eParticipation begins to mushroom, the effort of the international research community in this area is being put in creating an identifiable common framework for eParticipation research. Among other instruments, trying to establish a solid body of literature to be referred to mainly pursues this. But how is this process actually evolving? Which are the currently available outcomes of this effort? What is the nature of the research framing process in progress so far? In this paper I analyse the features of a literature database on eParticipation developed within DEMO-net, the European Network of Excellence on eParticipation research. I conduct a quantitative analysis on the 651 items of the DEMO-net bibliographical library and a qualitative review of 73 items. Results show that the acknowledged literature on eParticipation features a surprisingly little occurrence of all the expected central key concepts and instruments of eParticipation, while the majority of the contributions are descriptive in nature and come from non-journal sources. Findings depict a research field still in search of a more coherent, stronger identity, and suggest the need for concept clarification and dissemination, more strictly connected to empirical and interpretative studies.
An Efficient Quantum-Behaved Particle Swarm Optimization for Multiprocessor Scheduling
Authors: Xiaohong Kong, Jun Sun, Bin Ye, Wenbo Xu
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Quantum-behaved particle swarm optimization (QPSO) is employed to deal with multiprocessor scheduling problem (MSP), which speeds the convergence and has few parameters to control. We combine the QPSO search technique with list scheduling to improve the solution quality in short time. At the same time, we produce the solution based on the problem-space heuristic. Several benchmark instances are tested and the experiment results demonstrate much advantage of QPSO to some other heuristics in search ability and performance.
Real-Time 3D Body Pose Tracking from Multiple 2D Images
Authors: Chi-Wei Chu, Ramakant Nevatia
Venue: Proceedings of the 5th international conference on Articulated Motion and Deformable Objects (2008)

We present a human body motion tracking system for an interactive virtual simulation training environment. This system captures images using IR illumination and near-IR cameras to overcome limitations of a dimly lit environment. Features, such as silhouettes and medial axis of blobs are extracted from the images which lack much internal texture. We use a combination of a 2D ICP and particle filtering method to estimate the articulated body configuration of a trainee from image features. The method allows articulation of the arms at elbows and shoulders and of the body at the waist; this is a considerable improvement over previous such methods. Our system works in real-time and is robust to temporary errors in image acquisition or tracking. The system serves as part of a multi-modal user-input device for interactive simulation.
Specifying and Composing Interaction Protocols for Service-Oriented System Modelling
Authors: João Abreu, Laura Bocchi, José Luiz Fiadeiro, Antónia Lopes
Venue: Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems (2007)

We present and discuss a formal, high-level approach to the specification and composition of interaction protocols for service-oriented systems. This work is being developed within the SENSORIA project as part of a language and formal framework supporting the modelling of complex services at the business level, i.e. independent of the underlying platform and the languages in which services are programmed and deployed. Our approach is based on a novel language and logic of interactions, and a mathematical semantics of composition based on graphs. We illustrate our approach using a case study provided by Telecom Italia, one of our industrial partners in the project.
Exploring Perceptual Based Timbre Feature for Singer Identification
Authors: Swe Zin Kalayar Khine, Tin Lay Nwe, Haizhou Li
Venue: Computer Music Modeling and Retrieval. Sense of Sounds: 4th International Symposium, CMMR 2007, Copenhagen, Denmark, August 27-31, 2007. Revised Papers (2008)

Timbre can be defined as feature of an auditory stimulus that allows us to distinguish the sounds which have the same pitch and loudness. In this paper, we explore timbre based perceptual feature for singer identification. We start with a vocal detection process to extract the vocal segments from the sound. The cepstral coefficients, which reflect timbre characteristics, are then computed from the vocal segments. The cepstral coefficients of timbre are formulated by combining information of harmonic and the dynamic characteristics of the sound such as vibrato and the attack-decay envelope of the songs. Bandpass filters that spread according to the octave frequency scale are used to extract vibrato and harmonic information of sounds. The experiments are conducted on a database of 84 popular songs. The results show that the proposed timbre based perceptual feature is robust and effective. We achieve an average error rate of 12.2% in segment level singer identification.
A Study on Prediction Models for Massive Data Processing
Authors: RongHua Du, AiPing Li
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

Study on data stream processing between massive data and resource restriction is the hot topics. A framework is proposed which provides a mechanism to maintain adaptive prediction models that significantly reduce communication cost over the distributed environment while still guaranteeing sufficient precision of query results. Prediction models are also proposed to process prediction queries over future data streams in this paper. Three particular models, static model, linear model and acceleration model, and the corresponding tuning schemas are given. Experimentations are performed based on the simulated data and ocean air temperature data measured by TAO (tropical atmosphere ocean). Analytical and experimental evidence show that the proposed approach significantly reduces overall communication cost and performs well over prediction queries.
Navitime: Supporting Pedestrian Navigation in the Real World
Authors: Masatoshi Arikawa, Shin'ichi Konomi, Keisuke Ohnishi
Venue: IEEE Pervasive Computing (2007)

In Japan, 1.82 million citizens use a commercial mobile phone-based navigation service called Navitime, which is influencing how people get around in complex urban environments. This article reports on experiences with this large-scale service and discusses its implications for designing urban-computing services. This article is part of a special issue on Urban Computing.
A Mash Up Home Library Management System
Authors: Suresh Jeyaverasingam, Yuhong Yan
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

We present an online system to manage a home library that consist of multiple collections, such as books and CDs, using Service Oriented Architecture. Many home collections can contain hundreds and thousands of books and CDs. Managing a personal collection of such magnitude could be difficult if one were to rely on using databases or spread sheets. Entering detailed information of each item is a huge undertaking and tedious work. We present a solution to solve this complexity by building an online service to manage a home library. The online service maintains a database to record each user’s collection. The users will scan the bar code of the books and CDs. The detailed information of the items will be retrieved from Amazon.com via Amazon Associates Web Service interface and automatically entered into the database. Users are able to edit and search their items. A simple loan management functionality is provided to allow users to borrow out items. Doing so would allow them to share their collections with their friends. Compared to other commercial products for managing home libraries, our solution is a purely online service that absolves users from performing complicated installations and maintenance. The usage of Amazon.com’s Web Service to retrieve item information provides a reliable source for information retrieval. This is due to the currency of information available and the fact that Amazon.com has one of the largest catalogues of items, from books, CDs to home appliances. All these are made available via the Amazon Associates Web Service. Our system can be extended to manage other items such as prescription medications, and kitchen items. These features make the developed solution an attractive alternative to commercially developed products.
Evolution of General Driving Rules of a Driving Agent
Authors: Ivan Tanev, Hirotaka Yamazaki, Tomoyuki Hiroyasu, Katsunori Shimohara
Venue: Proceedings of the 10th international conference on Simulation of Adaptive Behavior: From Animals to Animats (2008)

We present an approach for automated design of the functionary of driving agent, able to operate a software model of fast running car. Our objective is to discover a single driving rule (if existent) that is general enough to be able to adequately control the car in all sections of predefined circuits. In order to evolve an agent with such capabilities, we propose an indirect, generative representation of the driving rules as algebraic functions of the features of the perceived surroundings of the car. These functions, when evaluated for the current surrounding of the car yield concrete values of the main attributes of the driving style (e.g., straight line velocity, turning velocity, etc.), applied by the agent in the currently negotiated section of the circuit. Experimental results verify both the very existence of the general driving rules and the ability of the employed genetic programming framework to automatically discover them. The evolved driving rules offer a favorable generality, in that a single rule can be successfully applied (i) not only for all the sections of a particular circuit, but also (ii) for the sections in several a priori defined circuits featuring different characteristics.
Iterative Estimation Algorithm of Autoregressive Parameters
Authors: Kazys Kazlauskas, Jaunius Kazlauskas
Venue: Informatica (2006)

This paper presents an iterative autoregressive system parameter estimation algorithm in the presence of white observation noise. The algorithm is based on the parameter estimation bias correction approach. We use high order Yule-Walker equations, sequentially estimate the noise variance, and exploit these estimated variances for the bias correction. The improved performance of the proposed algorithm in the presence of white noise is demonstrated via Monte Carlo experiments.
Spreadsheet Knowledge and Skills of French Secondary School Students
Authors: Françoise Tort, François-Marie Blondel, Éric Bruillard
Venue: Proceedings of the 3rd international conference on Informatics in Secondary Schools - Evolution and Perspectives: Informatics Education - Supporting Computational Thinking (2008)

The aim of our research project called DidaTab --- Didactics of Spreadsheets --- is to get a more comprehensive picture of ICT uses in French schools and to obtain a better knowledge of students' spreadsheet competencies. The exploratory study of curricula and practices shows very sparse use during secondary education. To achieve a more precise estimation of what students can do with spreadsheets, we identified detailed competencies and designed computer performance tasks to serve as a basis for tests. The analysis of the results of a few groups indicates that in most cases students' knowledge and skills are rather low. A deeper investigation of students' work shows close links between lack of confidence with spreadsheets and lack of knowledge in mathematics and informatics.
A Hierarchical Learning System Incorporating with Supervised, Unsupervised and Reinforcement Learning
Authors: Jinglu Hu, Takafumi Sasakawa, Kotaro Hirasawa, Huiru Zheng
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

According to Hebb's Cell assembly theory, the brain has the capability of function localization. On the other hand, it is suggested that the brain has three different learning paradigms: supervised, unsupervised and reinforcement learning. Inspired by the above knowledge of brain, we present a hierarchical learning system consisting of three parts: supervised learning (SL) part, unsupervised learning (UL) part and reinforcement learning (RL) part. The SL part is a main part learning input-output mapping; the UL part realizes the function localization of learning system by controlling firing strength of neurons in SL part based on input patterns; the RL part optimizes system performance by adjusting parameters in UL part. Simulation results confirm the effectiveness of the proposed hierarchical learning system.
The Quality Monitoring Technology in the Process of the Pulping Papermaking Alkaline Steam Boiling Based on Neural Network
Authors: Jianjun Su, Yanmei Meng, Chaolin Chen, Funing Lu, Sijie Yan
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II (2008)

On the status quo that being lack of the testing equipment which gives reliable and direct parameters on measuring the quality of pulp in the cooking process, this article focus on the lignin value soft-measurement technology in the pulp and papermaking process. The pulp lignin value soft-measurement model is built basing on artificial neural network; It takes cooking process temperature, cooking time and the effective alkaline concentration as network input, and an improved BP algorithm to train the network for obtaining the predictive output value of the lignin value. Utilizing online measurement of cooking process temperature, cooking time and effective alkaline concentration, the soft-measurement model can monitor the quality of pulp.
Crystal: An Emulation Framework for Practical Peer-to-Peer Multimedia Streaming Systems
Authors: Mea Wang, Hassan Shojania, Baochun Li
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

To rapidly evolve new designs of peer-to-peer (P2P) multimedia streaming systems, it is highly desirable to test and troubleshoot them in a controlled and repeatable experimental environment in a local cluster of servers, as it is risky to integrate untested protocols in live production and mission-critical peer-to-peer sessions, such as live P2P streaming. Though it is possible to construct such controlled experiments with virtual machine monitors, there are a number of challenges and roadblocks: (1) The deployment of such resource-hungry virtual machine environments are complicated and time-consuming for researchers without prior systems expertise; (2) The system designer needs to implement many basic streaming elements, such as playback buffers and message switches. In this paper, we seek to address these challenges by introducing Crystal, an emulation framework for practical P2P multimedia streaming systems, which provides support for developing, testing, and troubleshooting new streaming system designs in a controlled server cluster environment. It is our imperative design objective that Crystal offers ease of use, rapid experimental turnaround, and the capability of emulating realistic P2P environments.