ppxscal/embedding_network huggingface dataset:
Using Predicate Abstraction to Generate Heuristic Functions in UPPAAL
Authors: Jörg Hoffmann, Jan-Georg Smaus, Andrey Rybalchenko, Sebastian Kupferschmid, Andreas Podelski
Venue: Model Checking and Artificial Intelligence: 4th Workshop, MoChArt IV, Riva del Garda, Italy, August 29, 2006, Revised Selected and Invited Papers (2007)

We focus on checking safety properties in networks of extended timed automata, with the well-known UPPAAL system. We show how to use predicate abstraction, in the sense used in model checking, to generate search guidance, in the sense used in Artificial Intelligence (AI). This contributes another family of heuristic functions to the growing body of work on directed model checking. The overall methodology follows the pattern database approach from AI: the abstract state space is exhaustively built in a pre-process, and used as a lookup table during search. While typically pattern databases use rather primitive abstractions ignoring some of the relevant symbols, we use predicate abstraction, dividing the state space into equivalence classes with respect to a list of logical expressions (predicates). We empirically explore the behavior of the resulting family of heuristics, in a meaningful set of benchmarks. In particular, while several challenges remain open, we show that one can easily obtain heuristic functions that are competitive with the state-of-the-art in directed model checking.
Certificate revocation list distribution in vehicular communication systems
Authors: Panagiotis (Panos) Papadimitratos, Ghita Mezzour, Jean-Pierre Hubaux
Venue: Proceedings of the fifth ACM international workshop on VehiculAr Inter-NETworking (2008)

The need to evict compromised, faulty, or illegitimate nodes is well understood in prominent projects designing security architectures for Vehicular Communication (VC) systems. The basic approach envisioned to achieve this is via distribution of Certificate Revocation Lists (CRLs). Nonetheless, the problem of how to distribute CRLs effectively and efficiently has not been investigated. In this paper, we addresses exactly this problem. We propose a flexible, simple, and scalable design that leverages on road-side VC infrastructure. Our scheme can distribute large CRLs across wide VC regions within minutes, by utilizing a bandwidth of only a few Kbps at each road-side infrastructure unit.
Automatic Torso Engagement for Gesturing Characters
Authors: Michael Neff
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

Acting theorists such as Grotowski [1] have argued that full body engagement is a key principle in creating expressive movement. Unfortunately, torso use has received limited attention in virtual character research and torso involvement is often lacking. In procedural gesture animation, the character's gestural movements often begin at the shoulder and the character's torso is left relatively stiff. This reduces both the believability and expressiveness of the resulting motion.
Minimization of OR-XNOR expressions using four new linking rules
Authors: Khalid Faraj
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

This paper presents a minimization algorithm for fixed polarity dual Reed-Muller expressions (FPDRMs) for completely specified functions. For an n-variable function there are 2n different distinct FPDRMs. Minimum FPDRMs is one with the fewest number of sums. The minimization algorithm for the two-level dual Reed-Muller expressions has been developed, based on a four set of rules. The four new linking rules have been introduced to minimize single output dual Reed-Muller (OR/XNOR) expressions. The new rules are demonstrated using Karnaugh maps for some random functions.
An Information Theoretic Framework for Field Monitoring Using Autonomously Mobile Sensors
Authors: Hany Morcos, George Atia, Azer Bestavros, Ibrahim Matta
Venue: Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems (2008)

We consider a mobile sensor network monitoring a spatio-temporal field. Given limited caches at the sensor nodes, the goal is to develop a distributed cache management algorithm to efficiently answer queries with a known probability distribution over the spatial dimension. First, we propose a novel distributed information theoretic approach assuming knowledge of the distribution of the monitored phenomenon. Under this scheme, nodes minimize an entropic utility function that captures the average amount of uncertainty in queries given the probability distribution of query locations. Second, we propose a correlation-based technique, which only requires knowledge of the second-order statistics, relaxing the stringent constraint of a priori knowledge of the query distribution, while significantly reducing the computational overhead. We show that the proposed approaches considerably improve the average field estimation error. Further, we show that the correlation-based technique is robust to model mismatch in case of imperfect knowledge of the underlying generative correlation structure.
Case Study on the Effects of Administrative Informatization on the Organizational Structure for the Central Government in Korea
Authors: Dong-Seok Kang, Hun Yeong Kwon, Yoon-Seok Ko
Venue: Proceedings of the 7th international conference on Electronic Government (2008)

The purpose of this study is to investigate the effects of administrative informatization on the organizational structure and manpower system at the eight selected central government bodies in the Korean government. In detail, since the Korean government took administrative informatization as a critical factor for government innovation in 1980s, it has also reshaped the governmental structure and manpower system in accordance with administrative informatiza-tion. Thus, finding out how administrative informatization influences the total number of public officials and the organizational structure of the government in horizontal and vertical is very important for setting the future direction of administrative informatization up.
A General Tableau Method for Deciding Description Logics, Modal Logics and Related First-Order Fragments
Authors: Renate A. Schmidt, Dmitry Tishkovsky
Venue: Proceedings of the 4th international joint conference on Automated Reasoning (2008)

This paper presents a general method for proving termination of tableaux-based procedures for modal-type logics and related first-order fragments. The method is based on connections between filtration arguments and tableau blocking techniques. The method provides a general framework for developing tableau-based decision procedures for a large class of logics. In particular, the method can be applied to many well-known description and modal logics. The class includes traditional modal logics such as S4 and modal logics with the universal modality, as well as description logics such as $\mathcal{ALC}$ with nominals and general TBoxes. Also contained in the class are harder and less well-studied modal logics with complex modalities and description logics with complex role operators such as Boolean modal logic, and the description logic $\mathcal{ALBO}$. In addition, the techniques allow us to specify tableau-based decision procedures for related solvable fragments of first-order logic, including the two-variable fragment of first-order logic.
A Novel Residual Capacity Estimation Method Based on Extension Neural Network for Lead-Acid Batteries
Authors: Kuei-Hsiang Chao, Meng-Hui Wang, Chia-Chang Hsu
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

This paper presents a state-of-charge (SOC) estimation method based on extension neural network (ENN) theory for lead-acid batteries. First, a constant electric current discharging experiment with an electronic load for lead-acid batteries is made to measure and record the internal resistance and open-circuit-voltage by utilizing internal resistance tester. Then, the experimental data are adopted to construct an estimation method based on ENN for recognizing the residual capacity of the lead-acid battery. The simulated results indicate that the proposed estimation method can determine the residual capacity of lead-acid batteries rapidly and accurately with less time and memory consumption.
Data Flow-Based Validation of Web Services Compositions: Perspectives and Examples
Authors: Cesare Bartolini, Antonia Bertolino, Eda Marchetti, Ioannis Parissis
Venue: Architecting Dependable Systems V (2008)

Composition of Web Services (WSs) is anticipated as the future standard way to dynamically build distributed applications, and hence their verification and validation is attracting great attention. The standardization of BPEL as a composition language and of WSDL as a WS interface definition language has led researchers to investigate verification and validation techniques mainly focusing on the sequence of events in the composition, while minor attention has been paid to the validation of the data flow exchange. In this chapter we study the potential of using data flow modelling for testing composite WSs. After an exhaustive exploration of the issues on testing based on data-related models, we schematically settle future research issues on the perspectives opened by data flow-based validation and present examples for some of them, illustrated on the case study of a composite WS that we have developed, the Virtual Scientific Book Store.
Predicting software change coupling
Authors: Gregory W. Hislop
Venue:  (2008)

This project was an exploratory study of techniques for predicting future change coupling among a program's source code files. Two source rode files are change coupled if programmers edit them together frequently, and separately infrequently. Specifically, this project investigated the predictive power of three approaches: mining of software change logs, software similarity detection, and software proximity detection. Software mining extracts patterns from source code databases, that is, version control systems containing source code and change histories. This project explored whether identification of past change coupling among source code files can predict future change coupling among those files. Software similarity detection finds files that contain similar, alias cloned, code. This project explored whether identification of similar code among source code files can predict future change coupling among those files. Finally, software proximity detection finds files that reference each other heavily. This project explored whether identification of proximity among source code files can predict future change coupling among these files. This project performed the study applied a software miner (created specifically for this project), three preexisting similarity detectors, and two proximity detectors (created specifically for this project) to four large open source code databases at multiple points in time. It determined that software mining generally generated the best predictions of the three approaches, followed by similarity detection, followed by proximity detection. Excessive source code change coupling can be a serious maintenance problem. So the prediction of future change coupling is an important challenge in software engineering. The results of this project shed light on the abilities of the three approaches, both in the absolute and relative senses, to predict change coupling. So the results of this project hold promise for decreasing program maintenance costs.
Smallest Bipartite Bridge-Connectivity Augmentation (Extended Abstract)
Authors: Pei-Chi Huang, Hsin-Wen Wei, Wan-Chen Lu, Wei-Kuan Shih, Tsan-Sheng Hsu
Venue: Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management (2007)

This paper addresses two augmentation problems related to bipartite graphs. The first, a fundamental graph-theoretical problem, is how to add a set of edges with the smallest possible cardinality so that the resulting graph is 2-edge-connected, i.e., bridge-connected, and still bipartite. The second problem, which arises naturally from research on the security of statistical data, is how to add edges so that the resulting graph is simple and dose not contain any bridges.
Proceedings of the 2006 conference on Pattern languages of programs
Venue: PLoP (2006)

Pattern Languages of Programs (PLoP) conference is a place for pattern authors to have their pattern languages reviewed by fellow authors. The purpose of PloP is to promote development of pattern languages on all aspects of software, including design and programming, software architecture, user interface design, domain modeling, and software process. Domain-specific patterns were encouraged for PLoP 2006.
A review of uniqueness and variations in throughput due to performance parameters of simulators on Manet routing protocols
Authors: M. Sulleman Memon, Manzoor Hashmani, Niaz A. Memon
Venue: Proceedings of the 7th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications (2008)

Very prestigious work has been performed in the field of mobile ad hoc networks (MANETS) with respect to their routing protocols. Researchers have developed and designed so many protocols for these networks, but due to the dynamic change in topology, decentralization, power management, bandwidth and many other factors like these no specific routing protocol is exclusively recommended, up to today, which comply and fulfill all the needs and requirements of users for ad hoc networks in all situations of network variation statuses and traffic overhead. This paper contributes an effort towards anthology of one of the major segment of routing protocols i.e. uni cast, their categories and the main types of uni cast routing protocols such as WRP and DSDV from proactive plus DSR and AODV from reactive. The protocols and their performances are evaluated on the basis of some simulation results acquired by simulation of certain model with some parameters with the help of NS-2, OPNET and GloMoSim like simulators. The performance evaluations are declared on the basis of those simulations results, but all the results peter out when magnitudes of those attributes or load of network changes (increased or decreased ) with respect to bandwidth, power management, end to end delay, data errors, packet dropping ratio or even with distance. Here in this paper we have scrupulously reviewed the work done on these protocols and majority of the simulated results are examined and finally suggest few common uniqueness and differences with respect to their properties which remain unchanged in all the situations and scenarios.
Slim VM: optimistic partial program loading for connected embedded Java virtual machines
Authors: Gregor Wagner, Andreas Gal, Michael Franz
Venue: Proceedings of the 6th international symposium on Principles and practice of programming in Java (2008)

Embedded systems are inherently limited in terms of local storage capacity. This limitation conflicts with the demands of modern virtual machine platforms, which require large amounts of library code to be present on each client device. These conflicting requirements are often resolved by providing specialized embedded versions of the standard libraries, but even these stripped down libraries consume significant resources. We present a solution for "always connected" mobile devices that is based on a zero footprint paradigm. In our approach, all code resides on a remote host. Only those parts of applications and libraries that are likely to be needed are transferred to the mobile device. Since it is difficult to predict statically which library parts will be needed at runtime, we combine static analysis and lazy code loading to transfer code with a high likelihood of execution ahead of time while other code (such as exception code) remains on the remote host and is provided only on demand. This allows us to perform not only dead code elimination, but also aggressive elimination of cold (or potentially unused) code. The granularity of our approach is flexible all the way down to individual basic blocks. Our method achieves total code size reductions of up to 95%.
Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
Authors: Martijn Stam
Venue: Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology (2008)

Suppose we are given a perfect n + c-to-n bit compression function f and we want to construct a larger m + s-to-s bit compression function H instead. What level of security, in particular collision resistance, can we expect from H if it makes r calls to f? We conjecture that typically collisions can be found in 2(nr + cr ¿ m)/(r + 1) queries. This bound is also relevant for building a m + s-to-s bit compression function based on a blockcipher with k-bit keys and n-bit blocks: simply set c = k, or c = 0 in case of fixed keys.We also exhibit a number of (conceptual) compression functions whose collision resistance is close to this bound. In particular, we consider the following four scenarios: 1 A 2n-to-n bit compression function making two calls to an n-to-n bit primitive, providing collision resistance up to 2 n/3/n queries. This beats a recent bound by Rogaway and Steinberger that 2 n/4 queries to the underlying random n-to-n bit function suffice to find collisions in any rate-1/2 compression function. In particular, this shows that Rogaway and Steinberger's recent bound of 2(nr ¿ m ¿ s/2)/r) queries (for c = 0) crucially relies upon a uniformity assumption; a blanket generalization to arbitrary compression functions would be incorrect. 1 A 3n-to-2n bit compression function making a single call to a 3n-to-n bit primitive, providing collision resistance up to 2 n queries. 1 A 3n-to-2n bit compression function making two calls to a 2n-to-n bit primitive, providing collision resistance up to 2 n queries. 1 A single call compression function with parameters satisfying m ≤ n + c, n ≤ s, c ≤ m. This result provides a tradeoff between how many bits you can compress for what level of security given a single call to an n + c-to-n bit random function.
A Fault-Tolerant Real-Time Scheduling Algorithm in Software Fault-Tolerant Module
Authors: Dong Liu, Weiyan Xing, Rui Li, Chunyuan Zhang, Haiyan Li
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

In software fault-tolerant module, the key issue that affects the performance of fault-tolerant scheduling algorithm is how to predict precisely whether a primary is executable. In order to improve the prediction precision, a new algorithm named DPA, Deep-Prediction based Algorithm, is put forward. DPA uses prediction-table to predict whether a primary can be completed before it is scheduled. Simulation results show that DPA provides more execution time for primaries and wastes less processor time than the well-known similar algorithms.
Speed Up SVM Algorithm for Massive Classification Tasks
Authors: Thanh-Nghi Do, Van-Hoa Nguyen, François Poulet
Venue: Proceedings of the 4th international conference on Advanced Data Mining and Applications (2008)

We present a new parallel and incremental Support Vector Machine (SVM) algorithm for the classification of very large datasets on graphics processing units (GPUs). SVM and kernel related methods have shown to build accurate models but the learning task usually needs a quadratic program so that this task for large datasets requires large memory capacity and long time. We extend a recent Least Squares SVM (LS-SVM) proposed by Suykens and Vandewalle for building incremental and parallel algorithm. The new algorithm uses graphics processors to gain high performance at low cost. Numerical test results on UCI and Delve dataset repositories showed that our parallel incremental algorithm using GPUs is about 70 times faster than a CPU implementation and often significantly faster (over 1000 times) than state-of-the-art algorithms like LibSVM, SVM-perf and CB-SVM.
A Branch-and-Bound Method for the Multichromosomal Reversal Median Problem
Authors: Meng Zhang, William Arndt, Jijun Tang
Venue: Proceedings of the 8th international workshop on Algorithms in Bioinformatics (2008)

The ordering of genes in a genome can be changed through rearrangement events such as reversals, transpositions and translocations. Since these rearrangements are "rare events", they can be used to infer deep evolutionary histories. One important problem in rearrangement analysis is to find the median genome of three given genomes that minimizes the sum of the pairwise genomic distance between it and the three others. To date, MGR is the most commonly used tool for multichromosomal genomes. However, experimental evidence indicates that it leads to worse trees than an optimal median-solver, at least on unichromosomal genomes. In this paper, we present a new branch-and-bound method that provides an exact solution to the multichromosomal reversal median problem. We develop tight lower bounds and improve the enumeration procedure such that the search can be performed efficiently. Our extensive experiments on simulated datasets show that this median solver is efficient, has speed comparable to MGR, and is more accurate when genomes become distant.
Linear Slide Attacks on the KeeLoq Block Cipher
Authors: Andrey Bogdanov
Venue: Information Security and Cryptology: Third SKLOIS Conference, Inscrypt 2007, Xining, China, August 31 - September 5, 2007, Revised Selected Papers (2007)

KeeLoq is a block cipher used in numerous widespread passive entry and remote keyless entry systems as well as in various component identification applications. The KeeLoq algorithm has a 64-bit key and operates on 32-bit blocks. It is based on an NLFSR with a nonlinear feedback function of 5 variables.In this paper new key recovery attacks on KeeLoq are proposed. The first one has a complexity of about 250.6 KeeLoq encryptions. The second attack finds the key in 237 encryptions and works for the whole key space. In our attacks we use the techniques of guess-and-determine, slide, and linear attacks as well as cycle structure analysis. Both attacks need 232 known plaintext-ciphertext pairs.We also analyze the KeeLoq key management and authentication protocols applied in rolling-code and IFF access systems widely used in real-world applications. We demonstrate several practical vulnerabilities.
Differences in technology access, use, and skills among third grade students in the mississippi delta region served by the delta area association for improvement of schools
Authors: Joe Garrison
Venue:  (2007)

The purpose of this research study was to determine if the digital divide exists in homes and schools for children in the Delta region of Mississippi. The study compared the computer access, use, and skill level of children living in low socioeconomic areas and children living in middle or upper socioeconomic areas. A total of 1,119 surveys were administered to third-grade students in the study area. Five hundred seventy-one students from Title I schools and 548 students from non-Title I schools completed the survey. Frequency tables were used to aggregate the data. Further more, a comparison was made between data from the study area and national data. Results showed that the digital divide in the Delta region of Mississippi has closed in the school setting. The gap is closing in homes at a slightly higher rate than the national average. Even so, there remains a gap in home computer access and use. The findings also indicate that a significant gap exists in the skill level between the two socioeconomic groups.