ppxscal/embedding_network huggingface dataset:
Programming interactive real-time games over WLAN for pocket PCs with J2ME and .NET CF
Authors: Andreas Janecek, Helmut Hlavacs
Venue: Proceedings of 4th ACM SIGCOMM workshop on Network and system support for games (2005)

In this paper we compare the Java 2 Micro Edition and the .NET Compact Framework with respect to their performance for programming multiplayer games for PDAs. We benchmark results for both platforms dealing with computational capabilities and communication performance over WLAN. We also have developed a simple prototypical multiplayer game called 3D-Pong and evaluate how simple resilience mechanisms can hide WLAN packet losses for this game.
Enhancing Security Using Legality Assertions
Authors: Lei Wang, James R. Cordy, Thomas R. Dean
Venue: Proceedings of the 12th Working Conference on Reverse Engineering (2005)

Buffer overflows have been the most common form of security vulnerability in the past decade. A number of techniques have been proposed to address such attacks. Some are limited to protecting the return address on the stack; others are more general, but have undesirable properties such as large overhead and false warnings. The approach described in this paper uses legality assertions, source code assertions inserted before each subscript and pointer dereference that explicitly check that the referencing expression actually specifies a location within the array or object pointed at run time. A transformation system is developed to analyze a program and annotate it with appropriate assertions automatically. This approach detects buffer vulnerabilities in both stack and heap memory as well as potential buffer overflows in library functions. Runtime checking through using automatically inferred assertions considerably enhances the accuracy and efficiency of buffer overflow detection. A number of example buffer over-flow-exploitingC programs are used to demonstrate the effectiveness of this approach.
An Integrity Verification Scheme for DNS Zone file based on Security Impact Analysis
Authors: Ramaswamy Chandramouli, Scott Rose
Venue: Proceedings of the 21st Annual Computer Security Applications Conference (2005)

The Domain Name System (DNS) is the world's largest distributed computing system that performs the key function of translating user-friendly domain names to IP addresses through a process called name resolution. After looking at the protection measures for securing the DNS transactions, we discover that the trust in the name resolution process ultimately depends upon the integrity of the data repository that authoritative name servers of DNS use. This data repository is called a zone file. Hence we analyze in detail the data content relationships in a zone file that have security impacts. We then develop a taxonomy and associated population of constraints. We also have developed a platform-independent framework using XML, XML Schema and XSLT for encoding those constraints and verifying them against the XML encoded zone file data to detect integrity violations.
RNA Pseudoknot Prediction Using Term Rewriting
Authors: X. Z. Fu, H. Wang, W. Harrison, R. Harrison
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

RNA plays a critical role in mediating every step of cellular information transfer from genes to functional proteins. Pseudoknots are widely occurring structural motifs found in all types of RNA and are also functionally important. Therefore predicting their structures is an important problem. In this paper, we present a new RNA pseudoknot prediction method based on term rewriting rather than on dynamic programming, comparative sequence analysis, or context-free grammars. The method we describe is implemented using the Mfold RNA/DNA folding package and the term rewriting language Maude. Our method was tested on 211 pseudoknots in PseudoBase and achieves an average accuracy of 74.085% compared to the experimentally determined structure. In fact, most pseudoknots discovered by our method achieve an accuracy of above 90%. These results indicate that term rewriting has a broad potential in RNA applications from prediction of pseudoknots to higher level RNA structures involving complex RNA tertiary interactions. It is now well recognized that RNA structure is related to ideas from formal language theory (e.g. Context-free grammar). Primary RNA structures are simply strings of nucleotides and many researchers have applied string-based algorithms and techniques to the structure determination problems. This paper applies another idea from the study of languages — term rewriting [1] — to structure prediction. Term rewriting is a style of computation in which an input — the term — is transformed according to a predetermined set of rules. Term rewriting has a long history in theoretical Computer Science [1] and has recently found a place in bioinformatics applications [2, 3] as well. Our method described in this paper treats RNA structures as terms and discovers rules for predicting pseudoknots. Conventional secondary structure prediction programs like Mfold [4] do not predict pseudoknots. However, a set of common features are observed in the predictions they make for sequences that actually fold into pseudoknots. We applied term rewriting logic to recognize these consistent but inaccurate predictions and replaced them with more accurate predictions.
Efficient temporal-logic query checking for presburger systems
Authors: Dezhuang Zhang, Rance Cleaveland
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

This paper develops a framework for solving temporal-logic query-checking problems for a class of infinite-state system models that compute with integer-valued variables (so-called Presburger systems, in which Presburger formulas are used to define system behavior). The temporal-logic query checking problem may be formulated as follows: given a model and a temporal logic formula with placeholders, compute a set of assignments of formulas to placeholders such that the resulting temporal formula is satisfied by the given model. Temporal-logic query checking has proved useful as a means for requirements and design understanding; existing work, however, has focused only on propositional temporal logic and finite-state systems.Our method is based on a symbolic model-checking technique that relies on proof search. The paper first introduces this model-checking approach and then shows how it can be adapted to solving the temporal queries in which formulas may contain integer variables. We also present experimental results showing the computational efficacy of our approach.
Cross-layering for Performance Improvement in Multi-Hop Wireless Networks
Authors: Fabrizio Granelli, Dzmitry Kliazovich
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

Cross-layering represents a perspective design principle for adapting natively wired protocols to the wireless scenario and for improving their performance. The paper explores the possibilities of cross-layer design as a candidate tool for performance optimization, focusing on problems deriving from the usage of ARQ schemes in today's wireless networks and proposes a novel and general cross-layer interaction scheme between the transport and the link layers. Achieved results in the framework of a IEEE 802.11-based multi-hop wireless network demonstrate the value of the proposed framework, and allow to provide guidelines for future work on the topic.
Simulating time-dependent energy transfer between crossed laser beams in an expanding plasma
Authors: J. A. F. Hittinger, M. R. Dorr, R. L. Berger, E. A. Williams
Venue: Journal of Computational Physics (2005)

A coupled mode system is derived to investigate a three-wave parametric instability leading to energy transfer between co-propagating laser beams crossing in a plasma flow. The model includes beams of finite width refracting in a prescribed transverse plasma flow with spatial and temporal gradients in velocity and density. The resulting paraxial light equations are discretized spatially with a Crank-Nicholson-type scheme, and these algebraic constraints are nonlinearly coupled with ordinary differential equations in time that describe the ion acoustic response. The entire nonlinear differential-algebraic system is solved using an adaptive, backward-differencing method coupled with Newton's method. A numerical study is conducted in two dimensions that compares the intensity gain of the fully time-dependent coupled mode system with the gain computed under the further assumption of a strongly damped ion acoustic response. The results demonstrate a time-dependent gain suppression when the beam diameter is commensurate with the velocity gradient scale length. The gain suppression is shown to depend on time-dependent beam refraction and is interpreted as a time-dependent frequency shift.
Efficient Failure Detection in Pipelined Asynchronous Circuits
Authors: Song Peng, Rajit Manohar
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

This paper presents an efficient concurrent failure detection method for pipelined asynchronous circuits. We first validate permanent and transient fault modeling in clockless systems. By augmenting the rails to each data channel and adding extra logic to each circuit module, we make pipelined asynchronous circuits achieve fail-stop with respect to hard or soft errors. The experimental evaluations show this method incurs both reasonable hardware cost and low performance overhead.
Learning to estimate user interest utilizing the variational Bayes estimator
Authors: Taiji Suzuki, Kazuyuki x. Kazuyuki Aihara, Takamasa Koshizen, Hiroshi Tsujino
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

Many studies of Man-machine interaction using eye trackers have been tackled over recent decades. In this paper, we present a new learning system to estimate user interest with gaze sensory information. In short, a statistical learning scheme, especially the variational bayes (VB), is incorporated for building probabilistic model parameters, dealing with the uncertainty of estimated user interest. Several computational results show how the VB can cope with user interest estimation, by selectively modeling their uncertainty.
Of Health, Trust, Money ... and Integrity
Authors: Robert L. Glass
Venue: IEEE Software (2006)

There's a subtle way to lose your integrity: trying to do a task as someone else would have you do it, rather than as you believe it should be done.
Coefficient Bit Reordering Method for Configurable FIR Filtering on Folded Bit-plane Array
Authors: Vladimir Ciric, Ivan Milentijevic
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

The goal of this paper is development of coefficient bit reordering method for configurable FIR filtering that will enable correct mapping of operations onto functional units of folded bit-plane FIR filtering array, regardless to coefficient number and length. The reordering method is derived in mathematical form and used to synthesize a configurable hardware module that feeds folded array with coefficient bits in proper order. On-the-fly reconfiguration of filtering array is achieved by reconfiguration of hardware module that implements reordering algorithm. Possibilities for throughput increasing by reducing filtering parameters are explored. The derived module is able to handle feeding of folded bit-plane array with different number of coefficients and coefficient length, and it is able to increase the throughput of folded system in cases where filtering with reduced number of taps or coefficient length is performed.
AM to PM noise conversion in a cross-coupled quadrature harmonic oscillator: Research Articles
Authors: Torsten Djurhuus, Viktor Krozer, Jens Vidkjær, Tom K. Johansen
Venue: International Journal of RF and Microwave Computer-Aided Engineering (2006)

We derive the dynamic equations governing the cross-coupled quadrature oscillator, perturbed by noise, leading to an expression for the close-in phase noise. The theory shows that a nonlinear coupling transconductance results in AM-PM noise conversion close to the carrier, which increases with the coupling strength. A simple linear time-domain model is employed to illustrate the results. &copy; 2005 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2006.
Usable privacy and security for personal information management
Authors: Clare-Marie Karat, Carolyn Brodie, John Karat
Venue: Communications of the ACM (2006)

The goal is a policy workbench enabling users to create and transform natural language policies into machine-readable code for enforcement and compliance audits.
Fine-Grained Task Reweighting on Multiprocessors
Authors: Aaron Block, James H. Anderson, Gary Bishop
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

We consider the problem of task reweighting in fair-scheduled multiprocessor systems wherein each task¿s processor share is specified as a weight. Task reweighting can be used as a means for consuming (or making available) spare processing capacity. In this paper, we propose a multiprocessor reweighting scheme that can change a task¿s processor share with "minimal" error per share change.
Frequencies Decomposition and Partial Similarities Retrieval for Ancient Handwriting Documents Compression
Authors: Abir EL ABED, Veronique EGLIN, Frank LEBOURGEOIS, Hubert EMPTOZ
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper presents a new segmentation free approach of partial similarities retrieval in ancient handwritten documents. The method has been developed to improve usual handwritings compression approaches that are not adapted to patrimonial images specificities. We present here the similarities characterization that lies on oriented handwriting shapes decomposition. The frequencies page decomposition realizes a pavement of handwritten regions stored in directional maps where partial similarities are estimated. This decomposition is obtained by a frequencies analysis implying Gabor bank filters with an adequate parameter setting based on the most significant directions of the text. For each map, we compute a similarity graph that reveals redundant shapes and determines a resulting redundancy rate. The resulting graph is the first part of the compression system currently under development.
Crossing patterns of semi-algebraic sets
Authors: Noga Alon, János Pach, Rom Pinchasi, Radoš Radoičić, Micha Sharir
Venue: Journal of Combinatorial Theory Series A (2005)

We prove that, for every family F of n semi-algebraic sets in Rd of constant description complexity, there exist a positive constant ε that depends on the maximum complexity of the elements of F, and two subfamilies F1, F2 ⊆ F with at least εn elements each, such that either every element of F1 intersects all elements of F2 or no element of F1 intersects any element of F2. This implies the existence of another constant δ such that F has a subset F' ⊆ F with nδ elements, so that either every pair of elements of F' intersect each other or the elements of F' are pairwise disjoint. The same results hold when the intersection relation is replaced by any other semi-algebraic relation. We apply these results to settle several problems in discrete geometry and in Ramsey theory.
A motion-flow-based fast video retrieval system
Authors: Chih-Wen Su, Hong-Yuan Mark Liao, Kuo-Chin Fan
Venue: Proceedings of the 7th ACM SIGMM international workshop on Multimedia information retrieval (2005)

In this paper, we propose the use of motion vectors embedded in MPEG bitstreams to generate so-called "motion-flows", which are applied them to perform quick video retrieval. By using the motion vectors directly, we do not need to consider the shape of a moving object and its corresponding trajectory. Instead, we simply "link" the local motion vectors across consecutive video frames to form motion flows, which are then annotated and stored in a video database. In the video retrieval phase, we propose a coarse-to-fine strategy to execute the video retrieval task. Motions that do not belong to the main-stream motion flows are filtered out by our proposed algorithm. The retrieval process can be triggered by query-by-sketch (QBS) or query-by-example (QBE). The experiment results show that our method is indeed efficient and accurate in the video retrieval process.
Multi-media Applications and Imprecise Computation
Authors: Melvin A. Breuer
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

As feature sizes continue to decrease and clock rates and device count on a VLSI chip increase, it becomes increasingly more difficult to maintain yields at their present levels. Process variation, noise and spot defects create very costly problems for our industry. Luckily, in the domain of multi-media, there exists a large body of functions where computational results need not always be correct. We will show that for many VLSI implementations of signal processing algorithms, such as MPEG and JPEG encoders, a significant proportion of chips having low levels of defects provide erroneous but acceptable results. We introduce the concept of errortolerance, and mention related issues needed to support this concept, including ways for specifying performance, design techniques that consider yield, test techniques for quantifying erroneous behavior, and finally the issue of marketing. The motivation for this work is to significantly increase the effective yield of a process, encourage the implementation of complex data processing chips, and drastically reduce chip costs.
An Efficient Key Management Scheme for Pervasive Computing
Authors: He Ge
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

In this paper we propose a variant of RSA public key scheme, called "Hidden Exponent RSA". Based on this new scheme, we devised an efficient key distribution/ management scheme for secure communication among devices in the context of pervasive computing, with emphasis on the simplicity and efficiency of the protocol. We show the new scheme is secure under the strong RSA assumption.
Simulated research experiences for teaching research methodology: some educational computing implications
Venue: ACM SIGSOC Bulletin (1976)

Despite the enormous growth of educational computing, the systemic connections of these efforts with important aspects of sociological education and research remain ambiguous. Notable are the tenuous linkages with sociological theory, university priorities on research, and enduring concerns of sociologists over social criticism and reform. This paper is addressed to this ambiguity. Drawing illustrations from the use of computer simulations of social research, a broad base for the development of educational computing is advocated which allows a clearer interface of such computing with theory, research, and social criticism within sociology. (I) Educational computing based on sociological theory allows a translation of experiences across variable educational contexts. (II) Recognizing the human-computer interface in these settings as an ubiquitous contemporary occurrence and hence a crucial research site obviates the traditional split between teaching and research which can be problematic in educational computing. (III) Evaluation lends realism to discussion of theory in sociology courses and is responsive to traditional and contemporary concerns with social criticism and social reform.
Green Computing
Authors: Carl E. Landwehr
Venue: IEEE Security and Privacy (2005)

We need computing and networking environments that support many forms of accountability, but we also need to understand how to construct systems with interfaces simple enough to be usable, yet capable of supporting the kinds of security policies we employ intuitively every day.
Analyzing Government Regulations Using Structural and Domain Information
Authors: Gloria T. Lau, Kincho H. Law, Gio Wiederhold
Venue: Computer (2005)

To address the difficulties encountered in comparing regulatory documents with multiple authoritative sources, the RegNet project is developing a relatedness analysis system that exploits such documents' unique computational properties.
Defending software against process-subversion attacks
Authors: Gaurav Singh Kc
Venue:  (2005)

This dissertation addresses the significant problem of protecting computing resources against attack mechanisms commonly utilised by malware such as Internet worms and Internet cracking tools. These attacks typically exploit security vulnerabilities in applications, middleware, system libraries, and even the underlying operating system, to break in and compromise the targeted software. We analysed the anatomy of common process-subversion attacks, and have derived from the analysis a model for describing and evaluating defence techniques that thwart such attacks. We have incorporated this model into a software tool called esBench, which can be used to perform security evaluations of defence techniques in implemented systems. We illustrate the comprehensiveness of our model and the power of esBench by evaluating three defence techniques, Casper, RiSA, and e-NeXSh. We designed these techniques to create a secure software-execution environment to counter the problem of process-subversion attacks. These techniques build defensive support within application code or the underlying operating system, and are incorporated into specific components of the x86/Linux run-time environment, including the compiler, system libraries, the operating system, and the underlying hardware. These techniques extend the run-time environment with capabilities to automatically detect and thwart a variety of attack mechanisms. Our techniques are general and practical, and can be applied to other software run-time environments.
Mining Chains of Relations
Authors: Foto Afrati, Gautam Das, Aristides Gionis, Heikki Mannila, Taneli Mielikainen, Panayiotis Tsaparas
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Traditional data mining applications consider the problem of mining a single relation between two attributes. For example, in a scientific bibliography database, authors are related to papers, and we may be interested in discovering association rules between authors. However, in real life, we often have multiple attributes related though chains of relations. For example, authors write papers, and papers concern one or more topics. Mining such relational chains poses additional challenges. In this paper we consider the following problem: given a chain of two relationsR₁(A, P) and R₂(P, T) we want to find selectors for the objects in T such that the projected relation between A and P satisfies a specific property. The motivation for our approach is that a given property might not hold on the whole dataset, but it might hold when projecting the data on a selector set. We discuss various algorithms and we examine the conditions under which the apriori technique can be used. We experimentally demonstrate the effectiveness of our methods.