ppxscal/embedding_network huggingface dataset:
A Case for Specification Validation
Authors: Mats P. Heimdahl
Venue: Verified Software: Theories, Tools, Experiments: First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Zurich, Switzerland, October 10-13, 2005, Revised Selected Papers and Discussions (2005)

As we are moving from a traditional software development process to a new development paradigm where the process it largely driven by tools and automation, new challenges for verification and validation (V V) emerge. Productivity improvements will in this new paradigm be achieved through reduced emphasis on testing of implementations, increased reliance on automated analysis tools applied in the specification domain, verifiability correct generation of source-code, and verifiably correct compilation. The V V effort will now be largely focused on assuring that the formal specifications are correct and that the tools are trustworthy so we can rely on the results of the analysis and code generation without extensive additional testing of the resulting implementation. Most effort has traditionally been devoted to the verification problem. In this position paper we point out the importance of validation and argue that if we fail to adequately address the validation problem problem the impact of verifying code generation and compilation will be limited.
Concept-Based Document Recommendations for CiteSeer Authors
Authors: Kannan Chandrasekaran, Susan Gauch, Praveen Lakkaraju, Hiep Phuc Luong
Venue: Proceedings of the 5th international conference on Adaptive Hypermedia and Adaptive Web-Based Systems (2008)

The information explosion in today's electronic world has created the need for information filtering techniques that help users filter out extraneous content to identify the right information they need to make important decisions. Recommender systems are one approach to this problem, based on presenting potential items of interest to a user rather than requiring the user to go looking for them. In this paper, we propose a recommender system that recommends research papers of potential interest to authors known to the CiteSeer database. For each author participating in the study, we create a user profile based on their previously published papers. Based on similarities between the user profile and profiles for documents in the collection, additional papers are recommended to the author. We introduce a novel way of representing the user profiles as trees of concepts and an algorithm for computing the similarity between the user profiles and document profiles using a tree-edit distance measure. Experiments with a group of volunteers show that our concept-based algorithm provides better recommendations than a traditional vector-space model based technique.
Max-Min-Fair Best Effort Flow Control in Network-on-Chip Architectures
Authors: Fahimeh Jafari, Mohammad H. Yaghmaee, Mohammad S. Talebi, Ahmad Khonsari
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

Network-on-Chip (NoC) has been proposed as an attractive alternative to traditional dedicated busses in order to achieve modularity and high performance in the future System-on-Chip (SoC) designs. Recently, end to end flow control has gained popularity in the design process of network-on-chip based SoCs. Where flow control is employed, fairness issues need to be considered as well. In fact, one of most difficult aspects of flow control is that of treating all sources fairly when it is necessary to turn traffic away from the network. In this paper, we proposed a flow control scheme which admits Max-Min fairness criterion for all sources. In fact, we formulated Max-Min fairness criterion for the NoC architecture and presented implementation to be used as flow control mechanism.
Tutorials at MODELS 2007
Authors: Jeff Gray
Venue: Proceedings of the 10th international conference on Model Driven Engineering Languages and Systems (2007)

The MODELS 2007 conference offered four high-quality tutorials from leading experts in the area of model-driven engineering. Each tutorial was presented as a half-day event that was organized during the first two days of the conference. This short overview provides an introduction to the tutorials program and a summary of each tutorial as submitted by the presenters.
Simulation of a Random perturbation upon the gyroscopic stability
Authors: Diana Cotoros, Mihaela Baritz, Enescu Ioan, Margareta Florescu
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

The paper studies by help of Mathcad programs, the behavior of a dynamically tuned gyroscope motion equations. To achieve the simulation we used different random perturbations and studied their effect on the results of the motion equations proving the fact that the stability is assured and also the benefits of using a dynamically tuned gyroscope.
Obligations: Building a Bridge between Personal and Enterprise Privacy in Pervasive Computing
Authors: Susana Alcalde Bagüés, Jelena Mitic, Andreas Zeidler, Marta Tejada, Ignacio R. Matias, Carlos Fernandez Valdivielso
Venue: Proceedings of the 5th international conference on Trust, Privacy and Security in Digital Business (2008)

In this paper we present a novel architecture for extending the traditional notion of access control to privacy-related data toward a holistic privacy management system. The key elements used are obligations. They constitute a means for controlling the use of private data even after the data was disclosed to some third-party. Today's laws mostly are regulating the conduct of business between an individual and some enterprise. They mainly focus on long-lived and static relationships between a user and a service provider. However, due to the dynamic nature of pervasive computing environments, rather more sophisticated mechanisms than a simple offer/accept-based privacy negotiation are required. Thus, we introduce a privacy architecture which allows a user not only to negotiate the level of privacy needed in a rather automated way but also to track and monitor the whole life-cycle of data once it has been disclosed.
Fuzzy-Timing Petri Nets with Choice Probabilities for Response Time Analysis
Authors: Jaegeol Yim, Kye-Young Lee
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

The system response time is one of the most critical user's requirements. Therefore, a response time analysis must be done at the design stage. This paper proposes a response time analysis method based on `Fuzzy-Timing Petri net with choice probabilities (FTCP)'. FTCP is a modified version of timed net: A delay time associated with a transition is not a crisp number but a possibility distribution function and a transition of FTCP is also associated with a choice probability. We are proposing a response time analysis procedure for FTCP. It is similar to the minimum cycle time analysis for Timed Nets. The difference is that we take account of choice probabilities of the transitions in the process of generating the T-invariant. The other feature of our analysis method is that it can handle temporal uncertainties. This paper finally demonstrates the usefulness of the method by applying the method on a Web Service System.
Associative Parallel Containers in STAPL
Authors: Gabriel Tanase, Chidambareswaran Raman, Mauro Bianco, Nancy M. Amato, Lawrence Rauchwerger
Venue: Languages and Compilers for Parallel Computing: 20th International Workshop, LCPC 2007, Urbana, IL, USA, October 11-13, 2007, Revised Selected Papers (2007)

The Standard Template Adaptive Parallel Library (stapl) is a parallel programming framework that extends C++ and stl with support for parallelism. stapl provides a collection of parallel data structures (pContainers) and algorithms (pAlgorithms) and a generic methodology for extending them to provide customized functionality. stapl pContainers are thread-safe, concurrent objects, i.e., shared objects that provide parallel methods that can be invoked concurrently. They also provide appropriate interfaces that can be used by generic pAlgorithms. In this work, we present the design and implementation of the stapl associative pContainers: pMap, pSet, pMultiMap, pMultiSet, pHashMap, and pHashSet. These containers provide optimal insert, search, and delete operations for a distributed collection of elements based on keys. Their methods include counterparts of the methods provided by the stl associative containers, and also some asynchronous (non-blocking) variants that can provide improved performance in parallel. We evaluate the performance of the stapl associative pContainers on an IBM Power5 cluster, an IBM Power3 cluster, and on a linux-based Opteron cluster, and show that the new pContainer asynchronous methods, generic pAlgorithms (e.g., pfind) and a sort application based on associative pContainers, all provide good scalability on more than 103 processors.
Rough Sets in Oligonucleotide Microarray Data Analysis
Authors: Magdalena Alicja Tkacz
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

This paper shows attempts of the rough set theory application to the oligonucleotide microarrays data analysis. 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
Protein-protein Interactions and Networks: Identification, Computer Analysis, and Prediction, 1 edition
Authors: Anna Panchenko, Teresa Przytycka
Venue: Computational Biology (2008)

The biological interactions of living organisms, and protein-protein interactions in particular, are astonishingly diverse and present numerous challenges to modern biomolecular research because of their complexity. Analysis of patterns and principles governing these interactions has prompted a rapid development of computational methods to identify protein interaction partners and to understand the roles of individual components of protein interaction networks in cell functions. This book integrates different approaches from bioinformatics, biochemistry, computational analysis and systems biology to offer the reader a comprehensive global view of the diverse data on protein-protein interactions and protein interaction networks. It brings together the descriptions of experimental techniques and expounds on different computational algorithms for protein network analysis and prediction of protein and domain interactions, with each chapter containing a description of the problem, a review of methods and algorithms, a list of resources and current conclusions. Features Reviews experimental techniques for identification of protein interactions Discusses protein interaction databases and methods of integrating data from diverse sources Describes computational methods to predict protein and domain interaction partners Explores the properties of interaction interfaces and highlights approaches to model the assembly of protein complexes Examines the topological and dynamical properties of protein interaction networks and presents the tools for comparative analysis of these networks Written by leading experts, Protein-protein Interactions and Networks provides a broad, thorough and multidisciplinary coverage of this field. It will be invaluable to researchers from academia and the bioinformatics industry, as well as an excellent auxiliary text for graduate students studying the topic.
The Simulation Course: An Innovative Way of Teaching Computational Science in Aeronautics
Authors: Ricard González-Cinca, Eduard Santamaria, J. Luis Yebra
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

This article describes an innovative methodology for teaching an undergraduate course on Computational Science, with a particular emphasis in Computational Fluid Dynamics (CFD), and the experiences derived from its implementation. The main activities taking place during this course are: development by students of a training project on a topic in materials science, development of a larger CFD project, and an introduction to a CFD commercial package. Projects are carried out by groups of students and are assigned from a set of different available possibilities. Project development consists in the implementation in code of the corresponding mathematical models and a graphical interface which permits the visualization of the results derived from the numerical resolution of the models. The main innovative aspects of the methodology are the use of Project Based Learning combined with the participation of lecturers from different areas of expertise. Other innovative issues include the opportunity for students to practice skills such as report writing, doing oral presentations, the use of English (a foreign language for them) and the use of Linux as the development environment.
Fuzzy systems with recurrent rules in population and medical models
Authors: Horia-Nicolai L. Teodorescu
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

Decision and recognition / classification processes are complex processes, involving rational, emotional, social, and cultural factors. The modeling of a decision process by simple IF-Then fuzzy logic rules is oversimplifying. We propose a new type of fuzzy logic rules that improve the modeling of the decision process by mimicking the human iterative process of decision-making. Then, we investigate the analytical aspects of systems based on such rules. We present applications in population and medical models; moreover, we discuss implementations on GRID distributed systems for such models.
Towards Learning Non-recursive LPADs by Transforming Them into Bayesian Networks
Authors: Hendrik Blockeel, Wannes Meert
Venue: Inductive Logic Programming: 16th International Conference, ILP 2006, Santiago de Compostela, Spain, August 24-27, 2006, Revised Selected Papers (2007)

Logic programs with annotated disjunctions, or LPADs, are an elegant knowledge representation formalism that can be used to combine first order logical and probabilistic inference. While LPADs can be written manually, one can also consider the question of how to learn them from data. Methods for learning restricted classes of LPADs have been proposed before, but the problem of learning any kind of LPADs was still open. In this paper, we describe a reduction of non-recursive LPADs with a finite Herbrand universe to Bayesian networks. This reduction makes it possible to learn such LPADs using standard learning techniques for Bayesian networks. Thus the class of learnable LPADs is extended.
Efficient Remote Data Possession Checking in Critical Information Infrastructures
Authors: Francesc Sebé, Josep Domingo-Ferrer, Antoni Martinez-Balleste, Yves Deswarte, Jean-Jacques Quisquater
Venue: IEEE Transactions on Knowledge and Data Engineering (2008)

Checking data possession in networked information systems such as those related to critical infrastructures (power facilities, airports, data vaults, defense systems, etc.) is a matter of crucial importance. Remote data possession checking protocols permit to check that a remote server can access an uncorrupted file in such a way that the verifier does not need to know beforehand the entire file that is being verified. Unfortunately, current protocols only allow a limited number of successive verifications or are impractical from the computational point of view. In this paper, we present a new remote data possession checking protocol such that: i) it allows an unlimited number of file integrity verifications; ii) its maximum running time can be chosen at set-up time and traded off against storage at the verifier.
Fast track article: Generating random graphs for the simulation of wireless ad hoc, actuator, sensor, and internet networks
Authors: Furuzan Atay Onat, Ivan Stojmenovic, Halim Yanikomeroglu
Venue: Pervasive and Mobile Computing (2008)

In this paper, we consider generation of graphs that represent specific scenarios that appear in wireless ad hoc, actuator, sensor and Internet networks. Most simulation studies for these networks use connected random unit disk graphs generated by placing nodes randomly and independently from each other. However, in real life usually networks are created in a cooperative manner; certain restrictions are imposed during the placement of a new node in order to improve network connectivity and functionality. This article is an initial study on how constrained connected random unit graphs (C-CRUG) can be generated by fast algorithms and what kind of desirable characteristics can be achieved compared to completely random graphs, especially for sparse node densities.
Research on a Novel Hashing Stream Cipher
Authors: Yong Zhang, Xia-Mu Niu, Jun-Cao Li, Chun-Ming Li
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

A stream cipher namely the HSC (Hashing Stream Cipher) which uses a regular one-way hash function to generate pseudorandom keystream iteratively is proposed. Since the timestamp is used in the keystream generator, the algorithm achieves the robustness against the adaptive-chosen-plaintext attack. The one-way hash function is the core of the algorithm, so the security analysis of the algorithm is shifted to that of the hash function. If the core one-way hash function is chosen properly, it can be asserted that there would be no period in the HSC keystream. Firstly the algorithm was introduced detailedly. Then its applying security and efficiency respectively discussed deeply. The experimental result shows that the algorithm has both a high security and good efficiency.
Evolving Variability-Tolerant CMOS Designs
Authors: James Alfred Walker, James A. Hilder, Andy M. Tyrrell
Venue: Proceedings of the 8th international conference on Evolvable Systems: From Biology to Hardware (2008)

As the size of CMOS devices is approaching the atomic level, the increasing intrinsic device variability is leading to higher failure rates in conventional CMOS designs. In this paper, two approaches are proposed for evolving unconventional variability-tolerent CMOS designs: one uses a simple Genetic Algorithm, whilst the other uses Cartesian Genetic Programming. Both approaches successfully evolve unconventional designs for logic gates, whilst an inverter design also shows signs of variability-tolerance.
Proceedings of the third ACM international workshop on Wireless network testbeds, experimental evaluation and characterization
Venue: International Conference on Mobile Computing and Networking (2008)

Welcome to the Third ACM International Workshop on Wireless Network Testbeds, Experimental Evaluation and CHaracterization (WiNTECH'08), held in conjunction with ACM MobiCom 2008 in San Francisco, California. Three years ago, WiNTECH was created to promote experimental evaluation of wireless network protocols/applications using realistic testbeds and characterization using traces from operational wireless networks of which the importance has been increasingly recognized by the research community. Following the success of WiNTECH'06 and WiNTECH'07, also held in conjunction with MobiCom, WiNTECH'08 continues as a forum focusing on research issues concerning the experimental wireless network community. WiNTECH'08 received 22 regular paper submissions from around the world. Members of the Technical Program Committee reviewed the submissions rigorously, with the help of a few external reviewers. Each paper had three reviews on average. Twelve regular were accepted for publication. The accepted papers cover a wide range of topics from tools and methodologies to metro-area testbeds. In addition, we are holding a contest for technical demonstrations, which will have at least ten participants. Cash prizes for the demo contest are being sponsored by Nokia Siemens Networks, BBN Technologies and ViaSat. We hope that the demo contest will spark more creative uses of testbeds and also serve as a conduit for increased awareness in the research and development community of new innovations. Finally, we are very pleased that the workshop will feature a keynote speech by Professor Nitin Vaidya. The talk is titled "Can theory meet practice? The case of multi-channel wireless networks."
COMPASS - A tool for evaluation of compression strategies for embedded processors
Authors: Sreejith K. Menon, Priti Shankar
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2008)

A major concern of embedded system architects is the design for low power. We address one aspect of the problem in this paper, namely the effect of executable code compression. There are two benefits of code compression - firstly, a reduction in the memory footprint of embedded software, and secondly, potential reduction in memory bus traffic and power consumption. Since decompression has to be performed at run time it is achieved by hardware. We describe a tool called COMPASS which can evaluate a range of strategies for any given set of benchmarks and display compression ratios. Also, given an execution trace, it can compute the effect on bus toggles, and cache misses for a range of compression strategies. The tool is interactive and allows the user to vary a set of parameters, and observe their effect on performance. We describe an implementation of the tool and demonstrate its effectiveness. To the best of our knowledge this is the first tool proposed for such a purpose.
Passage Retrieval Using Graph Vertices Comparison
Authors: Taoufiq Dkaki, Josiane Mothe, Quoc Dinh Truong
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

In this paper, we describe an Information retrieval Model based on graph comparison. It is inspired from previous work such as Kleinberg’Hits and Blondel et al.’s model. Unlike previous methods, our model considers different types of nodes: text nodes (elements to retrieve and query) and term nodes, so that the resulting graph is a bipartite graph. The results on passage retrieval task show that high precision is improved using this model.
Using overlays for efficient data transfer over shared wide-area networks
Authors: Gaurav Khanna, Umit Catalyurek, Tahsin Kurc, Rajkumar Kettimuthu, P. Sadayappan, Ian Foster, Joel Saltz
Venue: Proceedings of the 2008 ACM/IEEE conference on Supercomputing (2008)

Data-intensive applications frequently transfer large amounts of data over wide-area networks. The performance achieved in such settings can often be improved by routing data via intermediate nodes chosen to increase aggregate bandwidth. We explore the benefits of overlay network approaches by designing and implementing a service-oriented architecture that incorporates two key optimizations -- multi-hop path splitting and multi-pathing - within the GridFTP file transfer protocol. We develop a file transfer scheduling algorithm that incorporates the two optimizations in conjunction with the use of available file replicas. The algorithm makes use of information from past GridFTP transfers to estimate network bandwidths and resource availability. The effectiveness of these optimizations is evaluated using several application file transfer patterns: one-to-all broadcast, all-to-one gather, and data redistribution, on a wide-area testbed. The experimental results show that our architecture and algorithm achieve significant performance improvement.