ppxscal/embedding_network huggingface dataset:
Verifying Compiler Based Refinement of BluespecTM Specifications Using the SPIN Model Checker
Authors: Gaurav Singh, Sandeep K. Shukla
Venue: Proceedings of the 15th international workshop on Model Checking Software (2008)

The underlying model of computation for PROMELA is based on interacting processes with asynchronous communication, and hence SPIN has been mainly used as a verification engine for concurrent software systems. On the other hand, hardware verification has mostly focused on clock synchronous register-transfer level (RTL) models. As a result, verification tools such as SMV which are based on synchronous state machine models have been used more frequently for hardware verification. However, as levels of abstractions are being raised in hardware design and as high-level synthesis is being promoted for synthesizing RTL, hardware design verification problems are changing in nature. In this paper, we consider a specific high-level hardware description langauge, namely, Bluespec System Verilog (BSV). The programming model of BSV is based on concurrent guarded actions, which we also call as Concurrent Action Oriented Specification (CAOS). High-level synthesis from BSV models has been shown to produce efficient RTL designs. Given the industry traction of BSV-based high-level synthesis and associated design flow, we consider the following formal verification problems: (i) Given a BSV specification ${\cal S}$ of a hardware design, does it satisfy certain temporal properties? (ii) Given a BSV specification ${\cal S}$, and an implementation R synthesized from ${\cal S}$ using a BSV-based synthesis tool, does R conform to the behaviors specified by ${\cal S}$; that is, is R a refinement of ${\cal S}$? (iii) Given a different implementation R ¿ synthesized from ${\cal S}$ using some other BSV-based synthesis tool, is R ¿ a refinement of R as well? In this paper, we show how SPIN Model Checker can be used to solve these three problems related to the verification of BSV-based designs. Using a sample design, we illustrate how our approach can be used for verifying whether the designer intent in the BSV specification is accurately matched by its synthesized hardware implementation.
Propositional Dynamic Logic for Recursive Procedures
Authors: Daniel Leivant
Venue: Proceedings of the 2nd international conference on Verified Software: Theories, Tools, Experiments (2008)

We present a simple and natural deductive formalism μPDL for propositional dynamic logic for recursive procedures, including simultaneous recursion. Though PDL with recursive programs is known to be highly undecidable, natural deductive formalisms for it are of substantial interest, because they distill the essential logical components of recursive procedures. We also show that Pratt-Kozen's μ-Calculus, in which fixpoints are taken over formulas rather than programs, is interpretable in μ PDL.
A straightforward ΣΔ fractional-N phase-locked loop HDL design for RF applications
Authors: Ahmed El Oualkadi, Denis Flandre
Venue: Proceedings of the 7th WSEAS International Conference on Microelectronics, Nanoelectronics, Optoelectronics (2008)

The present paper describes a systematic straightforward design of a Σ-Δ fractional-N Phase-Locked Loop based on HDL behavioral modeling. The proposed design consists in describing the mixed mode behavior of this Σ-Δ fractional-N PLL architecture starting from the specifications of each building block. The HDL models of critical PLL blocks have been described in VHDL-AMS to predict the different over-all specifications. The effect of different noise sources has been accurately introduced to study the PLL system performances. The obtained results are compared with transistor-level simulations to validate the effectiveness of the proposed models.
A Twofold Distributed Game-Tree Search Approach Using Interconnected Clusters
Authors: Kai Himstedt, Ulf Lorenz, Dietmar P. Möller
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

Even sophisticated classical approaches to parallelize game-tree search are restricted to using one single cluster at most. One further idea to speed up the game-tree search is to extend the cluster on the lowest level with specialized hardware components. Two well-known examples for this idea are the FPGA based Hydra system and IBM's Deep Blue. Taking computer chess as an example in this paper a contrasting idea is introduced: A parallelized chess program running on a cluster forms a base component. With a second parallel approach on top several clusters can be used to achieve a further speedup. Results based on benchmarks and on the participation in the latest World Computer-Chess Championship will be presented.
Service and Management for Multicast Based Audio/Video Collaboration System on CERNET
Authors: Xuan Zhang, Xing Li, Qingguo Zhao
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

Multicast based audio/video collaboration is one of representative applications in next generation internet. IP multicast has the advantage of saving bandwidth for group communication on large scale collaboration. The lack of ubiquitous multicast supporting and lack of effective service for multicast based A/V collaboration limit its application. This paper introduces the service and management of multicast based audio/video collaboration on China education and research network (CERNET). The multicast service, user and session management, performance monitoring and flow control are presented. The collaboration system has been applied on CERNET successfully.
Efficient Modeling of Concurrent Systems in BMC
Authors: Malay K. Ganai, Aarti Gupta
Venue: Proceedings of the 15th international workshop on Model Checking Software (2008)

We present an efficient method for modeling multi-threaded concurrent systems with shared variables and locks in Bounded Model Checking (BMC), and use it to improve the detection of safety properties such as data races. Previous approaches based on synchronous modeling of interleaving semantics do not scale up well due to the inherent asynchronism in those models. Instead, in our approach, we first create independent (uncoupled) models for each individual thread in the system, then explicitly add additional synchronization variables and constraints, incrementally, and only where such synchronization is needed to guarantee the (chosen) concurrency semantics (based on sequential consistency). We describe our modeling in detail and report verification results to demonstrate the efficacy of our approach on a complex case study.
Cooperative control for groups of autonomous mobile minirobots
Authors: Radu Dobrescu
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

The paper describes a control configuration for coordination of a group of mobile minirobots designed as remote operated vehicles. The main characteristics of a minirobot are presented focusing on the adopted solution for the communication system, especially on the partition of coordination tasks between local and remote operators. Another section discusses the algorithms designed for accomplish a specific patrol mission, which ensures robot localization, terrain mapping, area partition, complete area coverage, robot motion planning and collisions avoidance. The final section outline current middleware concept and how these can be used to achieve the objectives presented above.
Cognitive Load Estimation for Optimizing Learning within Intelligent Tutoring Systems
Authors: François Courtemanche, Mehdi Najjar, André Mayers
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

This paper presents a guided learning strategy model for dynamic pedagogical tailoring within intelligent tutoring systems (ITS). The proposed model is based on the integration of the cognitive load theory within an ITS architecture. Our approach takes into account the cognitive limitations of the student in order to offers personalised learning via instructional guidance.
Extracting data from virtual data warehouses: a practical aproach of how to improve query performance
Authors: Adela Bâra, Ion Lungu, Manole Velicanu, Vlad Diaconita, Iuliana Botha
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

The Business Intelligence project's team is always confronted with a major problem: low performance in data extraction from data warehouses. This problem can be critical because of the major impact in the using the data from data warehouse: if a BI report is taking a lot of time to run then it is useless or the data displayed are no longer available for taking critical decisions, so the project can be compromised. In this case there are several techniques that can be applied to reduce queries' execution time and to improve the performance of the BI analyses and reports. In this paper we present an overview of an implementation of a Business Intelligence project in a national company, the problems we confronted with and the techniques that we applied to reduce the cost of execution for improving query performance in this decisional support system.
Delay tolerant network simulation with VNUML
Authors: Lídice Romero Amondaray, Joaquín Seoane Pascual
Venue: Proceedings of the third ACM workshop on Challenged networks (2008)

This paper describes a simulation environment to easily create complex Delay Tolerant Network (DTN) scenarios using Virtual Network User Mode Linux (VNUML), a network virtualization environment based in User Mode Linux virtual machines running the DTN reference implementation. The simulation environment allows us to explore the applicability and behavior of the DTN architecture in real isolated-areas scenarios in developing countries. Furthermore, new developments built in the reference implementation (dynamic routing, multicast, anycast) can be easily debugged and analyzed.
Advances in Computer-Generated Imagery for Flight Simulation
Authors: Johnson Yan
Venue: IEEE Computer Graphics and Applications (1985)

The world of aviation flight simulation is an old one as computer graphics applications go. How did it progress to its current state, and where is it going next? The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Conflict Analysis of Programs with Procedures, Dynamic Thread Creation, and Monitors
Authors: Peter Lammich, Markus Müller-Olm
Venue: Proceedings of the 15th international symposium on Static Analysis (2008)

We study conflict detection for programs with procedures, dynamic thread creation and a fixed finite set of (reentrant) monitors. We show that deciding the existence of a conflict is NP-complete for our model (that abstracts guarded branching by nondeterministic choice) and present a fixpoint-based complete conflict detection algorithm. Our algorithm needs worst-case exponential time in the number of monitors, but is linear in the program size.
ACHE: An Architecture for Clinical Hypothesis Examination
Authors: Laura Moss, Derek Sleeman, John Kinsella, Malcolm Sim
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

Physiological monitoring equipment can be found in many hospital settings. This allows a wide range of physiological parameters to be stored, which in turn allows clinicians and analysts to investigate a range of medical hypotheses. This paper introduces ACHE (Architecture for Clinical Hypotheses Examination), a framework specifically designed to support the preparation of such analyses. To evaluate the initial version of ACHE, a study to detect Acute Myocardial Infarctions, was conducted with data from Glasgow Royal Infirmary's Intensive Care Unit (ICU). Initial results from the study are very encouraging and ACHE substantially reduced the time required to perform the study. A study of the same phenomena across a much larger patient dataset will be undertaken shortly.
Comparison of Unsupervised Band Selection Methods for Hyperspectral Imaging
Authors: Adolfo Martínez-Usó, Filiberto Pla, Jose M. Sotoca, Pedro García-Sevilla
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part I (2007)

Different methods have been proposed in order to deal with the huge amount of information that hyperspectral applications involve. This paper presents a comparison of some of the methods proposed for band selection. A relevant and recent set of methods have been selected that cover the main tendencies in this field. Moreover, a variant of an existing method is also introduced in this work. The comparison criterion used is based on pixel classification tasks.
On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak
Authors: Jonathan J. Hoch, Adi Shamir
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

At Crypto 2004 Joux showed a novel attack against the concatenated hash combiner instantiated with Merkle-Damgård iterated hash functions. His method of producing multicollisions in the design was the first in a recent line of generic attacks against the Merkle-Damgård construction. In the same paper, Joux raised an open question concerning the strength of the concatenated hash combiner and asked whether his attack can be improved when the attacker can efficiently find collisions in both underlying compression functions. We solve this open problem by showing that even in the powerful adversarial scenario first introduced by Liskov (SAC 2006) in which the underlying compression functions can be fully inverted (which implies that collisions can be easily generated), collisions in the concatenated hash cannot be created using fewer than 2 n/2 queries. We then expand this result to include the double pipe hash construction of Lucks from Asiacrypt 2005. One of the intermediate results is of interest on its own and provides the first streamable construction provably indifferentiable from a random oracle in this model.
Adaptiveness in Agent Communication: Application and Adaptation of Conversation Patterns
Authors: Felix Fischer, Michael Rovatsos, Gerhard Weiss
Venue: Agent Communication II: International Workshops on Agent Communication, AC 2005 and AC 2006, Utrecht, Netherlands, July 25, 2005, and Hakodate, Japan, May 9, 2006, Selected and Revised Papers (2006)

Communication in multi-agent systems (MASs) is usually governed by agent communication languages (ACLs) and communication protocols carrying a clear cut semantics. With an increasing degree of openness, however, the need arises for more flexible models of communication that can handle the uncertainty associated with the fact that adherence to a supposedly agreed specification of possible conversations cannot be ensured on the side of other agents.In this paper, we argue for adaptiveness in agent communication. We present a particular approach that combines conversation patterns as a generic way of describing the available means of communication in a MAS with a decisiontheoretic framework and various different machine learning techniques for applying these patterns in and adapting them from actual conversations.
A Study of the Packer Problem and Its Solutions
Authors: Fanglu Guo, Peter Ferrie, Tzi-Cker Chiueh
Venue: Proceedings of the 11th international symposium on Recent Advances in Intrusion Detection (2008)

An increasing percentage of malware programs distributed in the wild are packed by packers, which are programs that transform an input binary's appearance without affecting its execution semantics, to create new malware variants that can evade signature-based malware detection tools. This paper reports the results of a comprehensive study of the extent of the packer problem based on data collected at Symantec and the effectiveness of existing solutions to this problem. Then the paper presents a generic unpacking solution called Justin (Just-In-Time AV scanning), which is designed to detect the end of unpacking of a packed binary's run and invoke AV scanning against the process image at that time. For accurate end-to-unpacking detection, Justin incorporates the following heuristics: Dirty Page Execution, Unpacker Memory Avoidance, Stack Pointer Check and Command-Line Argument Access. Empirical testing shows that when compared with SymPack, which contains a set of manually created unpackers for a collection of selective packers, Justin's effectiveness is comparable to SymPack for those binaries packed by these supported packers, and is much better than SymPack for binaries packed by those that SymPack does not support.
The Effect of Internet Use on Political Participation
Authors: Ellen Quintelier, Sara Vissers
Venue: Social Science Computer Review (2008)

Conflicting claims have been put forward regarding the effects of Internet use on real-life political participation. Some argue that Internet use, and the accompanying political resources, stimulates political participation; others fear that intensive Internet use is associated with a withdrawal from public life. This article's authors test both claims on a representative sample of 6,330 16-year-olds in Belgium. They investigate young people's behavior, assuming that young people are the most avid information and communication technologies users and the most susceptible to the influence of various socialization experiences. The authors introduce a distinction between time spent on the Internet (time-replacement hypothesis) and various activities performed online. Results show time on the Internet does not have an effect on the propensity to participate in public life. Although some online activities are clearly and significantly associated with offline political participation, it remains to be investigated whether this relation is a form of causality.
A Probabilistic Approach on Estimating the Number of Modular Sonar Sequences
Authors: Ki-Hyeon Park, Hong-Yeop Song
Venue: Proceedings of the 5th international conference on Sequences and Their Applications (2008)

We report some results of an extensive computer search for m ×n modular sonar sequences and estimate the number of inequivalent examples of size m ×n using a probabilistic approach. Evidence indicates strongly that a full size example exists with extremely small probability for large m.
A New Type of Embedded File System Based on SPM
Authors: Tianzhou Chen, Feng Sha, Wei Hu, Qingsong Shi
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

Commonly, embedded file systems reside in main memory to manage the external memory such as flash memory in embedded systems. With the progress of hardware of embedded systems, the gap of speed between main memory and CPU is becoming larger and larger. The traditional embedded file systems can not be able to support real-time response enough for their main memory management policy. A new type of embedded file system is presented to provide more real-time performance. This new embedded file system, SPM file system, is based on the internal SRAM on chip and is able to reduce response time.
Prediction of Protein Subcellular Locations by Combining K-Local Hyperplane Distance Nearest Neighbor
Authors: Hong Liu, Haodi Feng, Daming Zhu
Venue: Proceedings of the 3rd international conference on Advanced Data Mining and Applications (2007)

A huge number of protein sequences have been generated and collected. However, the functions of most of them are still unknown. Protein subcellular localization is important to elucidate protein function. It would be worthwhile to develop a method to predict the subcellular location for a given protein when only the amino acid sequence of the protein is known. Although many efforts have been done to accomplish such a task, there is the need for further research to improve the accuracy of prediction. In this paper, with K-local Hyperplane Distance Nearest Neighbor algorithm (HKNN) as base classifier, an ensemble classifier is proposed to predict the subcellular locations of proteins in eukaryotic cells. Each basic HKNN classifiers are constructed from a separated feature set, and finally combined with majority voting scheme. Results obtained through 5-fold cross-validation test on the same protein dataset showed an improvement in pre-diction accuracy over existing algorithms.
Modular Reduction in GF(2n) without Pre-computational Phase
Authors: M. Knežević, K. Sakiyama, J. Fan, I. Verbauwhede
Venue: Proceedings of the 2nd international workshop on Arithmetic of Finite Fields (2008)

In this study we show how modular multiplication with Barrett and Montgomery reductions over certain finite fields of characteristic 2 can be implemented efficiently without using a pre-computational phase. We extend the set of moduli that is recommended by Standards for Efficient Cryptography (SEC) by defining two distinct sets for which either Barrett or Montgomery reduction is applicable. As the proposed algorithm is very suitable for a fast modular multiplication, we propose an architecture for the fast modular multiplier that can efficiently be used without pre-computing the inverse of the modulus.
Resilience Markers for Safer Systems and Organisations
Authors: Jonathan Back, Dominic Furniss, Michael Hildebrandt, Ann Blandford
Venue: Proceedings of the 27th international conference on Computer Safety, Reliability, and Security (2008)

If computer systems are to be designed to foster resilient performance it is important to be able to identify contributors to resilience. The emerging practice of Resilience Engineering has identified that people are still a primary source of resilience, and that the design of distributed systems should provide ways of helping people and organisations to cope with complexity. Although resilience has been identified as a desired property, researchers and practitioners do not have a clear understanding of what manifestations of resilience look like. This paper discusses some examples of strategies that people can adopt that improve the resilience of a system. Critically, analysis reveals that the generation of these strategies is only possible if the system facilitates them. As an example, this paper discusses practices, such as reflection, that are known to encourage resilient behavior in people. Reflection allows systems to better prepare for oncoming demands. We show that contributors to the practice of reflection manifest themselves at different levels of abstraction: from individual strategies to practices in, for example, control room environments. The analysis of interaction at these levels enables resilient properties of a system to be `seen', so that systems can be designed to explicitly support them. We then present an analysis of resilience at an organisational level within the nuclear domain. This highlights some of the challenges facing the Resilience Engineering approach and the need for using a collective language to articulate knowledge of resilient practices across domains.