ppxscal/embedding_network huggingface dataset:
Symbolic Reachability Analysis of Integer Timed Petri Nets
Authors: Min Wan, Gianfranco Ciardo
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

Petri nets are an effective formalism to model discrete event systems, and several variants have been defined to explicitly include real time in the model. We consider two fundamental reachability problems for Timed Petri Nets with positive integer firing times: timed reachability (find all markings where the model can be at a given finite time) and earliest reachability (find the minimum time when each reachable marking is entered). For these two problems, we define efficient symbolic algorithms that make use of both ordinary and edge-valued decision diagrams, and provide runtime results on an extensive suite of models.
Adaptive Error Correction with Dynamic Initial Block Size in Quantum Cryptographic Key Distribution Protocols
Authors: Stefan Rass, Christian Kollmitzer
Venue: Proceedings of the 2009 Third International Conference on Quantum, Nano and Micro Technologies (2009)

We present an extension to the error correction facility that is at the core of classical quantum cryptographic key exchange in the spirit of the BB84 protocol. The Cascade error correction scheme proposed along with the experimental implementation of BB84 can significantly be improved by endowing it with an adaptive initial block size selection strategy that takes into account information from past protocol executions. Additionally, our model comes with learning capabilities enabling the protocol to adapt itself not only according to its past, but also to different environmental conditions which the link is subject to. At the same time, the procedure can widely be automated and can be implemented using known algorithms. We demonstrate the feasibility and efficiency of our proposal using experiments, comparing the classical approach to the dynamic extension, showing a significant efficiency benefit that we gain from an adaptive initial block size choice.
Revocation of TPM Keys
Authors: Stefan Katzenbeisser, Klaus Kursawe, Frederic Stumpf
Venue: Proceedings of the 2nd International Conference on Trusted Computing (2009)

A Trusted Platform Module (TPM) offers a number of basic security services which can be used to build complex trusted applications. One of the main functionalities of a TPM is the provision of a protected storage, including access management for cryptographic keys. To allow for scalability in spite of the resource constraints of the TPM, keys are not stored inside the TPM, but in encrypted form on external, untrusted storage. This has the consequence that the actual key storage is not under control of the TPM, and it is therefore not possible to revoke individual keys. In this paper we introduce two basic methods to implement key revocation without major changes to the TPM command set, and without inhibiting backwards compatibility with the current specification. Our methods introduce no overhead for normal operation, and a reasonable small effort for managing revocable keys.
A shape-preserving quasi-interpolation operator satisfying quadratic polynomial reproduction property to scattered data
Authors: Renzhong Feng, Feng Li
Venue: Journal of Computational and Applied Mathematics (2009)

In this paper, we construct a univariate quasi-interpolation operator to non-uniformly distributed data by cubic multiquadric functions. This operator is practical, as it does not require derivatives of the being approximated function at endpoints. Furthermore, it possesses univariate quadratic polynomial reproduction property, strict convexity-preserving and shape-preserving of order 3 properties, and a higher convergence rate. Finally, some numerical experiments are shown to compare the approximation capacity of our quasi-interpolation operator with that of Wu and Schaback's quasi-interpolation scheme.
A case study comparing defect profiles of a reused framework and of applications reusing it
Authors: Anita Gupta, Jingyue Li, Reidar Conradi, Harald Rønneberg, Einar Landre
Venue: Empirical Software Engineering (2009)

The benefits of software reuse have been studied for many years. Several previous studies have observed that reused software has a lower defect density than newly built software. However, few studies have investigated empirically the reasons for this phenomenon. To date, we have only the common sense observation that as software is reused over time, the fixed defects will accumulate and will result in high-quality software. This paper reports on an industrial case study in a large Norwegian Oil and Gas company, involving a reused Java class framework and two applications that use that framework. We analyzed all trouble reports from the use of the framework and the applications according to the Orthogonal Defect Classification (ODC), followed by a qualitative Root Cause Analysis (RCA). The results reveal that the framework has a much lower defect density in total than one application and a slightly higher defect density than the other. In addition, the defect densities of the most severe defects of the reused framework are similar to those of the applications that are reusing it. The results of the ODC and RCA analyses reveal that systematic reuse (i.e. clearly defined and stable requirements, better design, hesitance to change, and solid testing) lead to lower defect densities of the functional-type defects in the reused framework than in applications that are reusing it. However, the different "nature" of the framework and the applications (e.g. interaction with other software, number and complexity of business logic, and functionality of the software) may confound the causal relationship between systematic reuse and the lower defect density of the reused software. Using the results of the study as a basis, we present an improved overall cause---effect model between systematic reuse and lower defect density that will facilitate further studies and implementations of software reuse.
Bootstrapping sums of independent but not identically distributed continuous processes with applications to functional data
Authors: Chung Chang, R. Todd Ogden
Venue: Journal of Multivariate Analysis (2009)

In many areas of application, the data are of functional nature, such as (one-dimensional) spectral data and two- or three-dimensional imaging data. It is often of interest to test for the significance of some set of factors in the functional observations (e.g., test for the mean differences between two groups). Testing hypotheses point-by-point (voxel-by-voxel in neuroimaging studies) results in a severe multiple-comparisons problem as the number of measurements made per observation is typically much larger than the number of observations (''large p, small n''). Thus solutions to this problem should take into account the spatial correlation structure inherent in the data. Popular approaches in such a setting include the general Statistical Parametric Mapping (SPM) approach and the permutation test, but these rely on strong parametric and exchangeability assumptions. In situations in which these assumptions are not satisfied, a nonparametric multiplier bootstrap approach may be used. Motivated by this problem, we present general results for multiplier bootstraps for sums of independent but not identically distributed processes. We also consider the application of these results to an imaging setting and provide sufficient conditions that will ensure asymptotic control of the familywise error rate.
Text entry performance of state of the art unconstrained handwriting recognition: a longitudinal user study
Authors: Per Ola Kristensson, Leif C. Denby
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

We report on a longitudinal study of unconstrained handwriting recognition performance. After 250 minutes of practice, participants had a mean text entry rate of 24.1 wpm. For the first four hours of usage, entry and error rates of handwriting recognition are about the same as for a baseline QWERTY software keyboard. Our results reveal that unconstrained handwriting is faster than what was previously assumed in the text entry literature.
Building Websites with e107: A step by step tutorial to getting your e107 website up and running fast
Authors: Tad Boomer
Venue:  (2007)

This book is a fast paced tutorial to creating a website using e107. If you have never used e107, or even any web content management system before, then this book will walk you through each step in a friendly and accessible way. From installation, to initial set up and content entry and then on to customization for your own look and feel, this book will get you to a stable and working e107 based web site fast. You do not have to be an experienced web developer or designer to get a great looking site with a full set of functions using this book and e107. This book will guide you through every step. This book is primarily for entrepreneurs, small office/home office, small businesses and non-profit agencies who would like to have interactive, business and/or e-commerce web sites at a low cost without sacrificing power or usability. No knowledge of PHP programming, Apache, or MySQL is required.
Recognition of noisy images by PLL networks
Authors: M. K. S. Kunyosi, L. H. A. Monteiro
Venue: Signal Processing (2009)

We use networks composed of three phase-locked loops (PLLs), where one of them is the master, for recognizing noisy images. The values of the coupling weights among the PLLs control the noise level which does not affect the successful identification of the input image. Analytical results and numerical tests are presented concerning the scheme performance.
Dynamic relocation of hybrid tasks: Strategies and methodologies
Authors: Marcelo Götz, Florian Dittmann, Tao Xie
Venue: Microprocessors Microsystems (2009)

Reconfiguration-based architectures are increasingly gaining attention of designers due to their benefits of flexibility, re-programmability and high computational performance. The combination of general purpose processors and reconfigurable fabrics (e.g., FPGAs), may provide those valuable characteristics, which are becoming essential for modern and future embedded systems. Such hybrid systems permit the existence of hardware tasks, which shall be properly managed by the operating system, thus allowing for their coexistence with software tasks. Nevertheless, in order to completely exploit this feature, the operating system must be capable of relocating a task between hardware and software execution domains. Runtime relocation of tasks (including preemption and resumption) between two devices following different computation paradigms (parallel vs. instruction based) however is a challenging job. In this work we propose a comprehensive and embracing methodology, which starts from a unified task representation, and goes to the final implementation of such hybrid tasks. For its accomplishment, a framework is proposed to help the user in designing a hybrid task, which also generates automatically the underlying infrastructure that is in charge of performing the dynamic relocation of a hybrid task. In order to prove the applicability of our concept and the efficiency of our framework, a case study is presented including its results.
A new principle for circular APSK constellation optimization
Authors: Jiang-Yao Chen, Chin-Feng Lin, Shun-Hsyung Chang, Shao-Wei Leu
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

In this paper, the symbol error rate for circular Amplitude-and-Phase Shift Keying (APSK) modulation in linear additive white Gaussian noise (AWGN) channel was theoretical evaluated and a new principle for optimal constellation design was proposed. The new principle can maximize the normalized Euclidean distance and reduce the variation between inter-ring and intra-ring distances for high level M-ary APSK modulation. The simulation results showed that the proposed optimal constellation can achieve lower symbol error rate (SER) than the Quadrature Amplitude Modulation (QAM) constellation.
Efficient deterministic method for detecting new U2R attacks
Authors: Rachid Beghdad
Venue: Computer Communications (2009)

The purpose of this study is to describe an efficient deterministic intrusion detection approach that detects both old and new attacks. We especially focused on detecting the user to root (U2R) attacks of the 1999 DARPA evaluation dataset. The main idea of our approach is to test if an unknown behavior is close enough to a known behavior (attack or normal) such as we can conclude that it belongs to its class. To achieve that, we formulate the problem of intrusion detection as a linear programming system (LPS). The objective function of this LPS leads to minimize the distance between an unknown behavior and one of the known behaviors, by respect of some constraints. The solution of such a problem is a set of bivalent variables x"i"j. If (x"i"j=1) then we can conclude that the unknown behavior i belong to the class of behaviors j. Our experiments demonstrated the efficiency of our approach.
Brief paper: Suppressing intersample behavior in iterative learning control
Authors: Tom Oomen, Jeroen van de Wijdeven, Okko Bosgra
Venue: Automatica (Journal of IFAC) (2009)

Iterative Learning Control (ILC) is a control strategy to improve the performance of digital batch repetitive processes. Due to its digital implementation, discrete time ILC approaches do not guarantee good intersample behavior. In fact, common discrete time ILC approaches may deteriorate the intersample behavior, thereby reducing the performance of the sampled-data system. In this paper, a generally applicable multirate ILC approach is presented that enables to balance the at-sample performance and the intersample behavior. Furthermore, key theoretical issues regarding multirate systems are addressed, including the time-varying nature of the multirate ILC setup. The proposed multirate ILC approach is shown to outperform discrete time ILC in realistic simulation examples.
Designing Aircraft Cockpit Displays: Borrowing from Multimodal User Interfaces
Authors: Mladjan Jovanovic, Dusan Starcevic, Zeljko Obrenovic
Venue: Transactions on Computational Science III (2009)

In this paper, we present an approach to design of command tables in aircraft cockpits. To date, there is no common standard for designing this kind of command tables. Command tables impose high load on human visual senses for displaying flight information such as altitude, attitude, vertical speed, airspeed, heading and engine power. Heavy visual workload and physical conditions significantly influence cognitive processes of an operator in an aircraft cockpit. Proposed solution formalizes the design process describing instruments in terms of estimated effects they produce on flight operators. In this way, we can predict effects and constraints of particular type of flight instrument and avoid unexpected effects early in the design process.
Game bot identification based on manifold learning
Authors: Kuan-Ta Chen, Hsing-Kuo Kenneth Pao, Hong-Chung Chang
Venue: Proceedings of the 7th ACM SIGCOMM Workshop on Network and System Support for Games (2008)

In recent years, online gaming has become one of the most popular Internet activities, but cheating activity, such as the use of game bots, has increased as a consequence. Generally, the gaming community disapproves of the use of game bots, as bot users obtain unreasonable rewards without corresponding efforts. However, bots are hard to detect because they are designed to simulate human game playing behavior and they follow game rules exactly. Existing detection approaches either disrupt players' gaming experiences, or they assume game bots are run as standalone clients or assigned a specific goal, such as aim bots in FPS games. In this paper, we propose a manifold learning approach for detecting game bots. It is a general technique that can be applied to any game in which avatars' movement is controlled by the players directly. Through real-life data traces, we show that the trajectories of human players and those of game bots are very different. In addition, although game bots may endeavor to simulate players' decisions, certain human behavior patterns are difficult to mimic because they are AI-hard. Taking Quake 2 as a case study, we evaluate our scheme's performance based on real-life traces. The results show that the scheme can achieve a detection accuracy of 98% or higher on a trace of 700 seconds.
Parallel Architecture for 2-D Discrete Wavelet Transform with Low Energy Consumption
Authors: Nozomi Ishihara, Kôki Abe
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

A novel two-dimensional discrete wavelet transform (2-DDWT) parallel architecture for higher throughput and lower energy consumption is proposed. The proposed architecture fully exploits full-page burst accesses of DRAM and minimizes the number of DRAM activate and precharge operations. Simulation results revealed that the architecture reduces the number of clock cycles for DRAM memory accesses as well as the DRAM power consumption with moderate cost of internal memory. Evaluation of the VLSI implementation of the architecture showed that the throughput of wavelet filtering was increased by parallelizing row filtering with a minimum area cost, thereby enabling DRAM full-page burst accesses to be exploited.
A cycle-based synthesis algorithm for reversible logic
Authors: Zahra Sasanian, Mehdi Saeedi, Mehdi Sedighi, Morteza Saheb Zamani
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Several algorithms have been proposed for the synthesis of reversible circuits. In this paper, a cycle-based synthesis algorithm for reversible logic, based on the NCT library, has been proposed. In other words, direct implementation of a single 3-cycle, a pair of 3-cycles and a pair of 2-cycles have been explored and used to propose an efficient Toffoli-based synthesis algorithm for reversible circuits. The synthesis algorithm decomposes a given large cycle into a set of single 3-cycles, pairs of 3-cycles and pair of 2-cycles and synthesizes the resulted cycles directly. Our experimental results show that the proposed synthesis algorithm can outperform the available 2-cycle-based approach about 34% on average. In addition, several discussions for the generalization of the proposed method to the 2m-cycles are given.
A Hybrid Phonic Web News Recommender System for Pervasive Access
Authors: Wei Chen, Li-jun Zhang, Chun Chen, Jia-jun Bu
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

With the development of Mobile Internet, it is possible for people to access their daily portion of news over the Web with various types of terminals connected to it. EagleRadio is a phonic Web news recommendation system which helps users access personalized news via mobile Internet. It reads news via a speech synthesizer to users. We propose a hybrid news recommending strategy considering not only the user's listening history, but also taking the user's neighbors with similar tastes and preferences into account. It can track multiple threads of user's interests and the diversity of recommended news list is also guaranteed. Finally, we evaluate the proposed algorithms and quantify the effect of them from a user's perspective.
Abstraction of Agent Cooperation in Agent Oriented Programming Language
Authors: Nguyen Tuan Duc, Ikuo Takeuchi
Venue: Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems (2008)

Collective operation is a concept of parallel programming in which many processes participate in an operation. Since collective operations are suitable for modeling the coordination of many processes, they can be used to model cooperating agents in a multiagent system. In this paper, we propose an agent oriented programming language that exploits collective operations to abstract the cooperating process of agents. We also present a method for implementing collective operations while maintaining the autonomous computational model of agent. Our experiment shows that our language and cooperation model have many advantages in developing multiagent systems....
Applications of Finite Duality to Locally Finite Varieties of BL-Algebras
Authors: Stefano Aguzzoli, Simone Bova, Vincenzo Marra
Venue: Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science (2009)

We are concerned with the subvariety of commutative, bounded, and integral residuated lattices, satisfying divisibility and prelinearity, namely, BL-algebras. We give an explicit combinatorial description of the category that is dual to finite BL-algebras. Building on this, we obtain detailed structural information on the locally finite subvarieties of BL-algebras that are analogous to Grigolia's subvarieties of finite-valued MV-algebras. As an illustration of the power of the finite duality presented here, we give an exact recursive formula for the cardinality of free finitely generated algebras in such varieties.
ACM SIGGRAPH ASIA 2008 artgallery: emerging technologies
Venue: International Conference on Computer Graphics and Interactive Techniques (2008)

This year, the 35th annual SIGGRAPH conference was held in Los Angeles, and the first SIGGRAPH Art Gallery was presented in 1982. Since then, the conference has featured many ambitious displays of digital art and interactive technologies, from Tomorrow's Realities in the early 1990s to Slow Art at SIGGRAPH 2008. The title of our show, Synthesis, refers to a kind of creative chaos, a random transformation of structured knowledge and exploration in digital art and emerging technologies. Thus we have combined the two programmes, Art Gallery & Emerging Technologies, this year to merge their experimental histories. We are so happy to show you this fruitful result of emerging creativity, here in Singapore, at the melting point of culture and business. There are over 30 brilliant works altogether, and in all the projects, attendees can enjoy the vast potential and rich diversity of hybrid art and technologies. The Art Gallery presents art that transforms, melds, and transcends current Asian paradigms. Emerging Technologies presents a rich resource of delicate, aesthetic technologies and vivid, innovative ideas that define the future of computer graphics and interactive techniques. The Art Gallery in SIGGRAPH Asia 2008 reflects a culmination of creative minds - a showcase of various cultures from all corners of the globe. The experience: profound, thought provoking and visually stimulating. Twenty works selected from nearly 300 entries, while different in content, application, and inspiration, have one thing in common: successful representation of culture and exploration. Through ground-breaking digital works, the artists question and invite responses from attendees. We are extremely pleased to bring to you, at the inaugural SIGGRAPH Asia 2008 in Singapore, a collection of exciting, inventive, and inspiring creative works that will certainly make its mark as the first in Asia.