ppxscal/embedding_network huggingface dataset:
Dynamic Verification of MPI Programs with Reductions in Presence of Split Operations and Relaxed Orderings
Authors: Sarvani Vakkalanka, Ganesh Gopalakrishnan, Robert M. Kirby
Venue: Proceedings of the 20th international conference on Computer Aided Verification (2008)

Dynamic verification methods are the natural choice for debugging real world programs when model extraction and maintenance are expensive. Message passing programs written using the MPI library fall under this category. Partial order reduction can be very effective for MPI programs because for each process, all its local computational steps, as well as many of its MPI calls, commute with the corresponding steps of all other processes. However, when dependencies arise among MPI calls, they are often a function of the runtime state. While this suggests the use of dynamic partial order reduction (DPOR), three aspects of MPI make previous DPOR algorithms inapplicable: (i) many MPI calls are allowed to complete out of program order; (ii) MPI has global synchronization operations (e.g., barrier) that have a special weak semantics; and (iii) the runtime of MPI cannot, without intrusive modifications, be forced to pursue a specific interleaving because of MPI's liberal message matching rules, especially pertaining to `wildcard receives'. We describe our new dynamic verification algorithm `POE' that exploits the out of order completion semantics of MPI by delaying the issuance of MPI calls, issuing them only according to the formation of match-sets, which are ample `big-step' moves. POE guarantees to manifest any feasible interleaving by dynamically rewriting wildcard receives by specific-source receives. This is the first dynamic model-checking algorithm with reductions for (a large subset of) MPI that guarantees to catch all deadlocks and local assertion violations, and is found to work well in practice.
Development of Generic Field Classes for Finite Element and Finite Difference Problems
Authors: Diane A. Verner, Gregory L. Heileman, Kent G. Budge, Allen C. Robinson
Venue: Scientific Programming (1993)

This article considers the development of a reusable object-oriented array library, as well as the use of this library in the construction of finite difference and finite element codes. The classes in this array library are also generic enough to be used to construct other classes specific to finite difference and finite element methods. We demonstrate the usefulness of this library by inserting it into two existing object-oriented scientific codes developed at Sandia National Laboratories. One of these codes is based on finite difference methods, whereas the other is based on finite element methods. Previously, these codes were separately maintained across a variety of sequential and parallel computing platforms. The use of object-oriented programming allows both codes to make use of common base classes. This offers a number of advantages related to optimization and portability. Optimization efforts, particularly important in large scientific codes, can be focused on a single library. Furthermore, by encapsulating machine dependencies within this library, the optimization of both codes on different architec-tures will only involve modification to a single library.
Uncertainties, Sensor Motes, Trust Issues
Venue: IEEE Pervasive Computing (2003)

This Works in Progress department features three submissions. The first focuses on the uncertainties associated with identifying nodes that are faulty or malicious. The second addresses the challenges of programming in the decentralized programming environment of sensor motes. Sensor motes are limited-functionality devices-they have limited memory, computational capabilities, and power resources. The final work in progress discusses a project to address pervasive computing trust issues in healthcare environments.
Applications of the Visible Korean Human
Authors: Jun Won Lee, Min Suk Chung, Jin Seo Park
Venue: Medical Imaging and Informatics: 2nd International Conference, MIMI 2007, Beijing, China, August 14-16, 2007 Revised Selected Papers (2008)

Visible Korean Human (VKH) consisting of magnetic resonance, computer tomography, anatomic, and segmented images was created. In the VKH, several techniques were developed and numerous data were acquired. The VKH techniques mainly contributed to the generation of advanced segmented images, Visible Living Human, and Visible Mouse. Also, a software for viewing sectional anatomy, three dimensional images for virtual dissection and virtual endoscopy, was developed based on the VKH data distributed worldwide. The VKH technique and data are expected to promote development of other serially sectioned images and software, which are helpful in medical education and clinical practice.
Towards Diagrammatic Patterns
Authors: Merete Skjelten Tveit
Venue: Proceedings of the 5th international conference on Diagrammatic Representation and Inference (2008)

This article presents the idea that the graphical representation (concrete syntax) of a visual language can be specified based on some pre-defined diagrammatic patterns. A diagram from the Specification and Description Language (SDL) is used as illustration.
Exceptions as Chance for Computational Chance Discovery
Authors: Akinori Abe, Norihiro Hagita, Michiko Furutani, Yoshiyuki Furutani, Rumiko Matsuoka
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

In this paper, we analyze clinical data to model relationships between clinical data and health levels. During analyses of data, we discovered models which are important for determining health levels but cannot be extracted during machine learning process. We regard such models as chance and propose an interactive determination of such models. The obtained models can be referred to when standard models cannot correctly explain certain individual health levels.
Efficient Computation of Statistical Significance of Query Results in Databases
Authors: Vishwakarma Singh, Arnab Bhattacharya, Ambuj K. Singh
Venue: Proceedings of the 20th international conference on Scientific and Statistical Database Management (2008)

Queries such as database similarity searches return results satisfying certain properties of distances or scores. For domain scientists, the absolute values of scores are seldom sufficient. Statistical significance or p-value of the result is a more useful criterion. This can be computed using an appropriate model of random objects. The problem of computing p-values becomes more acute when queries have multiple components. In this case, the returned score is an aggregate of individual scores. The simple way of calculating the p-value by enumerating all random possibilities fails for large database and query sizes. We propose an efficient method to calculate the approximate p-value of a multi-attribute result when the distribution of scores for the database objects is non-parametric. Experimental evaluation on large databases shows that our method is practical, runs 5 orders of magnitude faster than the basic approach, and has an error of less than 5% in p-value computation.
Summarization system evaluation revisited: N-gram graphs
Authors: George Giannakopoulos, Vangelis Karkaletsis, George Vouros, Panagiotis Stamatopoulos
Venue: ACM Transactions on Speech and Language Processing (TSLP) (2008)

This article presents a novel automatic method (AutoSummENG) for the evaluation of summarization systems, based on comparing the character n-gram graphs representation of the extracted summaries and a number of model summaries. The presented approach is language neutral, due to its statistical nature, and appears to hold a level of evaluation performance that matches and even exceeds other contemporary evaluation methods. Within this study, we measure the effectiveness of different representation methods, namely, word and character n-gram graph and histogram, different n-gram neighborhood indication methods as well as different comparison methods between the supplied representations. A theory for the a priori determination of the methods' parameters along with supporting experiments concludes the study to provide a complete alternative to existing methods concerning the automatic summary system evaluation process.
Dynamic Routing and Travel Time Prediction with Ant Based Control
Authors: Bogdan Tatomir, Adriana-Camelia Suson, Leon Rothkrantz
Venue: Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence (2008)

At this moment the capacity of the highways is not sufficient to transport all car drivers without delay. Especially in the rush hours there are enormous traffic jams. In case of special events such as traffic accidents car drivers can be delayed by hours. The losses in time and money are enormous, so the problem of traffic congestion has a high priority.
Multiobjective Optimization on a Limited Budget of Evaluations Using Model-Assisted $\mathcal{S}$-Metric Selection
Authors: Wolfgang Ponweiser, Tobias Wagner, Dirk Biermann, Markus Vincze
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

Real-world optimization problems often require the consideration of multiple contradicting objectives. These multiobjective problems are even more challenging when facing a limited budget of evaluations due to expensive experiments or simulations. In these cases, a specific class of multiobjective optimization algorithms (MOOA) has to be applied. This paper provides a review of contemporary multiobjective approaches based on the singleobjective meta-model-assisted 'Efficient Global Optimization' (EGO) procedure and describes their main concepts. Additionally, a new EGO-based MOOA is introduced, which utilizes the $\mathcal{S}$-metric or hypervolume contribution to decide which solution is evaluated next. A benchmark on recently proposed test functions is performed allowing a budget of 130 evaluations. The results point out that the maximization of the hypervolume contribution within a real multiobjective optimization is superior to straightforward adaptations of EGO making our new approach capable of approximating the Pareto front of common problems within the allowed budget of evaluations.
Performance Evaluation of the High Speed Downlink Packet Access in Communications Networks Based on High Altitude Platforms
Authors: Tien Do, Nam H. Do, Ram Chakka
Venue: Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications (2008)

In this paper, we provide a performance model and viable evaluation for the Adaptive Modulation and Coding (AMC) used in High Altitude Platforms (HAP) based HSDPA/UMTS telecommunication networks. We incorporate the HAP channel model into a new queueing model which is able to capture most of the features of wireless communications, such as traffic-burstiness, channel fading, channel allocation policy, etc., in an integrated way. In a case study we validate the model with the use of ns-2 simulator and also present numerical results to evaluate the impact of the HAP environment on the performance of HSDPA user terminal categories.
On-Line Benchmarking for Multimedia Applications with www.MyMultimediaWorld.com
Authors: Benoît Le Bonhomme, Marius Preda, Françoise Prêteux
Venue: Proceedings of the 2008 Ninth International Workshop on Image Analysis for Multimedia Interactive Services (2008)

Here, we present a new method for benchmarking multi-media related algorithms by providing a web-based architecture able to continuously update (1) the relevant data set through a common representation based on MPEG-4, and (2) the set of algorithms by an open API. The platform benchmark results are updated in real-time and presented for each media, for each group of media or for the entire database. Functionalities for on-line multimedia benchmarking are illustrated for indexation and compression purpose.
Properties of the Hermite Activation Functions in a Neural Approximation Scheme
Authors: Bartlomiej Beliczynski
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II (2007)

The main advantage to use Hermite functions as activation functions is that they offer a chance to control high frequency components in the approximation scheme. We prove that each subsequent Hermite function extends frequency bandwidth of the approximator within limited range of well concentrated energy. By introducing a scalling parameter we may control that bandwidth.
Using the ProdFlow(TM) approach to address the myth of productivity in r&d organizations
Authors: Melanie Ruhe, Stefan Wagner
Venue: Proceedings of the Second ACM-IEEE international symposium on Empirical software engineering and measurement (2008)

Software productivity has been analyzed traditionally in terms of size measures such as LOC or FP. These measures have failed to provide a comprehensive basis for productivity analysis. In the research department of the Siemens AG the new approach ProdFLOW™ for the analysis and management of a research & development organization's productivity is being created based on a revised understanding of the term productivity. Former studies often start with fixed, typical indicators and quantitatively analyze the relation between productivity and the indicator by regression models. ProdFLOW™ departs from the fixed model approach, which might not fit to the conditions of the organization. Instead an organization-specific model based on the substantial levers of the productivity, which are both influenceable and measurable, are compiled together with the experts of the organization. The paper explains the new approach as well as gives an example to illustrate our approach based on the results of three performed case studies.
A Note on Rewriting Proofs and Fibonacci Numbers
Authors: Max Kanovich
Venue: Proceedings of the international symposium on Logical Foundations of Computer Science (2007)

One basic activity in combinatorics is to establish combinatorial identities by so-called `bijective proofs,' which amounts to constructing explicit bijections between two types of the combinatorial objects in question.The aim of this paper is to show how techniques from the formal logic world can be applied directly to such problems studied completely independently in the world of combinatorics.The basic idea is to characterize equinumerous partition ideals in terms of the minimal elements generating the order filters, the complements to the original ideals.For the case where the minimal elements of each of these order filters are disjoint, we have developed a general automated method to remove the mystery of certain known results and establish new results in the theory of integer partitions: Kanovich [Finding direct partition bijections by two-directional rewriting techniques. Discrete Math., 285 (1-3) (2004) 151-166], and Kanovich [The two-way rewriting in action: Removing the mystery of Euler-Glaisher's map. Discrete Math., (2006), doi:10.1016/j.disc.2006.10.005].Here we address the case of filters having overlapping minimal elements. Essentially this is a case study related to the Fibonacci numeration system.In addition to a `bijective proof' for Zeckendorf's theorem - that every positive integer is uniquely representable within the Fibonacci numeration system, we establish `bijective proofs' for a new series of partition identities related to Fibonacci and Lucas numbers.The main result is proved using the idea of filter supports, and rewriting systems on multisets having overlapping patterns.The main technical step is a suitable construction of such a rewriting system and then a proof that this rewriting system and the system consisting of its reverse rewriting rules, both have the Church-Rosser property, with providing the bijections we are looking for.
Breaking the Curse of Cardinality on Bitmap Indexes
Authors: Kesheng Wu, Kurt Stockinger, Arie Shoshani
Venue: Proceedings of the 20th international conference on Scientific and Statistical Database Management (2008)

Bitmap indexes are known to be efficient for ad-hoc range queries that are common in data warehousing and scientific applications. However, they suffer from the curse of cardinality, that is, their efficiency deteriorates as attribute cardinalities increase. A number of strategies have been proposed, but none of them addresses the problem adequately. In this paper, we propose a novel binned bitmap index that greatly reduces the cost to answer queries, and therefore breaks the curse of cardinality. The key idea is to augment the binned index with an Order-preserving Bin-based Clustering (OrBiC) structure. This data structure significantly reduces the I/O operations needed to resolve records that can not be resolved with the bitmaps. To further improve the proposed index structure, we also present a strategy to create single-valued bins for frequent values. This strategy reduces index sizes and improves query processing speed. Overall, the binned indexes with OrBiC great improves the query processing speed, and are 3 --- 25 times faster than the best available indexes for high-cardinality data.
Threat-Driven Modeling and Verification of Secure Software Using Aspect-Oriented Petri Nets
Authors: Dianxiang Xu
Venue: IEEE Transactions on Software Engineering (2006)

Design-level vulnerabilities are a major source of security risks in software. To improve trustworthiness of software design, this paper presents a formal threat-driven approach, which explores explicit behaviors of security threats as the mediator between security goals and applications of security features. Security threats are potential attacks, i.e., misuses and anomalies that violate the security goals of systems' intended functions. Security threats suggest what, where, and how security features for threat mitigation should be applied. To specify the intended functions, security threats, and threat mitigations of a security design as a whole, we exploit aspect-oriented Petri nets as a unified formalism. Intended functions and security threats are modeled by Petri nets, whereas threat mitigations are modeled by Petri net-based aspects due to the incremental and crosscutting nature of security features. The unified formalism facilitates verifying correctness of security threats against intended functions and verifying absence of security threats from integrated functions and threat mitigations. As a result, our approach can make software design provably secured from anticipated security threats and, thus, reduce significant design-level vulnerabilities. We demonstrate our approach through a systematic case study on the threat-driven modeling and verification of a real-world shopping cart application.
Stork: secure package management for vm environments
Authors: John H. Hartman
Venue:  (2008)

Package managers are a common tool for installing, removing, and updating software on modern computer systems. Unfortunately existing package managers have two major problems. First, inadequate security leads to vulnerability to attack. There are nine feasible attacks against modern package managers, many of which are enabled by flaws in the underlying security architecture. Second, in Virtual Machine (VM) environments such as Xen, VMWare, and VServers, different VMs on the same physical machine are treated as separate systems by package managers leading to redundant package downloads and installations. This dissertation focuses on the design, development, and evaluation of a package manager called Stork that does not have these problems. Stork provides a security architecture that prevents the attacks other package managers are vulnerable to. Stork also is efficient in VM environments and reduces redundant package management actions. Stork is a real system that has been in use for four years and has managed half a million VM instantiations.
Towards the Integration of Symbolic and Numerical Static Analysis
Authors: Arnaud Venet
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)

Verifying properties of large real-world programs requires vast quantities of information on aspects such as procedural contexts, loop invariants or pointer aliasing. It is unimaginable to have all these properties provided to a verification tool by annotations from the user. Static analysis will clearly play a key role in the design of future verification engines by automatically discovering the bulk of this information. The body of research in static program analysis can be split up in two major areas: one-probably the larger in terms of publications-is concerned with discovering properties of data structures (shape analysis, pointer analysis); the other addresses the inference of numerical invariants for integer or floating-point algorithms (range analysis, propagation of round-off errors in numerical algorithms).We will call the former "symbolic static analysis" and the latter "numerical static analysis". Both areas were successful in effectively analyzing large applications [16,6,11,2,4]. However, symbolic and numerical static analysis are commonly regarded as entirely orthogonal problems. For example, a pointer analysis usually abstracts away all numerical values that appear in the program, whereas the floating-point analysis tool ASTREE [2,4] does not abstract memory at all.
Internal Computability
Authors: Guido Gherardi
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

We extend the notion of (TTE-)computability to nonstandard universes by the traditional method of enlarging universes through ultrafilters. In this way a nonstandard notion of effectivity is obtained.
Global existence and uniqueness of solutions for fuzzy differential equations under dissipative-type conditions
Authors: Zengtai Gong, Yabin Shao
Venue: Computers Mathematics with Applications (2008)

In this paper, using the properties of a differential and integral calculus for fuzzy set valued mappings and completeness of metric space of fuzzy numbers, the global existence, uniqueness and the continuous dependence of a solution on a fuzzy differential equation are derived under the dissipative-type conditions. We also present the global existence and uniqueness of solutions for a fuzzy differential equation on a closed convex subset of fuzzy number space.
Quantified Positive Temporal Constraints
Authors: Witold Charatonik, Michał Wrona
Venue: Proceedings of the 22nd international workshop on Computer Science Logic (2008)

A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order without endpoints using a relational symbol ≤, logical conjunction and disjunction. This paper gives a complete complexity characterization for quantified constraint satisfaction problems (QCSP) over positive temporal languages. Although the constraint satisfaction problem (CSP) for an arbitrary positive temporal language is trivial (all these templates are closed under constant functions), the corresponding QCSP problems are decidable in LOGSPACE or complete for one of the following classes: NLOGSPACE, P, NP or PSPACE.