Miracle-dz/UniFAR-FTUs huggingface dataset:
Efficient Directionless Weakest Preconditions (CMU-CyLab-10-002)

Verification condition (VC) generation is a fundamental part of many program analysis and applications, including proving program correctness, automatic test case generation, and proof carrying code. One might imagine VC applications would use the theoretically most appealing VC generation algorithm. This is often not the case. The most theoretically appealing algorithms are based upon weakest preconditions, and generate VCs at most O(M) for M program statements, however they process statements from last to first. In practice, many application domains choose forward symbolic execution (FSE), which generates predicates O(2 ) in size. FSE is chosen because it builds VCs in execution order, which allows a number of pragmatic optimizations. We reconcile the differences between FSE and WP by proposing a new directionless weakest precondition that can be run in both the forward and backward direction. Our algorithm provides the more attractive O(M) VC generation time and predicate size while allowing VC generation in execution order, which is what makes FSE attractive in practice. Thus, our algorithm can act as a “drop-in” replacement for either algorithm. We provide proofs of correctness, size, and generation time. We also show a correspondence between FSE and WP for deterministic programs, and perhaps surprisingly that they are not equivalent for the full class of GCL programs.
Anti-Tamper Method for Field Programmable Gate Arrays through Dynamic Reconfiguration and Decoy Circuits

Abstract : As Field Programmable Gate Arrays (FPGAs) become more widely used, security concerns have been raised regarding FPGA use for cryptographic, sensitive, or proprietary data. Storing or implementing proprietary code and designs on FPGAs could result in compromise of sensitive information if the FPGA device was physically relinquished or remotely accessible to adversaries seeking to obtain the information. Although multiple defensive measures have been implemented (and overcome), the possibility exists to create a secure design through the implementation of polymorphic Dynamically Reconfigurable FPGA (DRFPGA) circuits. Using polymorphic DRFPGAs removes the static attributes from their design; thus, substantially increasing the difficulty of successful adversarial reverse-engineering attacks. A variety of dynamically reconfigurable methodologies exist for implementations that challenge designers in the reconfigurable technology field. A Hardware Description Language (HDL) DRFPGA model is presented for use in security applications. The Very High Speed Integrated Circuit HDL(VHSIC)language was chosen to take advantage of its capabilities, which are well suited to the current research. Additionally, algorithms that explicitly support granular autonomous reconfiguration have been developed and implemented on the DRFPGA as a means of protecting its designs. Documented testing validated the reconfiguration results, compared original FPGA and DRFPGA, security, power usage, and area estimates.
On the geometry of electromagnetism

What is this series of articles about? Examine the following figure, which displays Maxwell equations in three different formalisms. Never mind what these equations mean (this is summarized in the caption, but it’s a secondary point). My immediate purpose is to call attention on how they look. In spite of describing the same physical phenomena, they are as different as three sentences with the same meaning can be in three different languages. The fact that one can discuss the same physics within widely different mathematical formalisms is what will concern us here. In particular, I wish to show that different geometrical objects can serve in describing electromagnetism: vector fields, differential forms, even quaternions, as in Maxwell’s time, and so forth: “axial” vectors, “polar” vectors . There is terrible confusion around the latter concepts, which I hope to dispel a little by showing how they relate. This will be, if not the exclusive subject, at the very least the red thread connecting these columns.
Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications (Studies in Computational Intelligence)

The Factorized Distribution Algorithm and the Minimum Relative Entropy Principle. - Linkage Learning via Probabilistic Modeling in the Extended Compact Genetic Algorithm (ECGA). - Hierarchical Bayesian Optimization Algorithm. - Numerical Optimization with Real-Valued Estimation-of-Distribution Algorithms. - A Survey of Probabilistic Model Building Genetic Programming. - Efficiency Enhancement of Estimation of Distribution Algorithms. - Design of Parallel Estimation of Distribution Algorithms. - Incorporating a priori Knowledge in Probabilistic-Model Based Optimization. - Multiobjective Estimation of Distribution Algorithms. - Effective and Reliable Online Classification Combining XCS with EDA Mechanisms. - Military Antenna Design Using a Simple Genetic Algorithm and hBOA. - Feature Subset Selection with Hybrids of Filters and Evolutionary Algorithms. - BOA for Nurse Scheduling. - Searching for Ground States of Ising Spin Glasses with Hierarchical BOA and Cluster Exact Approximation.
Design of Wrapper Integration Within the DataFoundry Bioinformatics Application

The DataFoundry bioinformatics application was designed to enable scientists to directly interact with large datasets, gathered from multiple remote data sources, through a graphical, interactive interface. Gathering information from multiple data sources, integrating that data, and providing an interface to the accumulated data is non-trivial. Advanced techniques are required to develop a solution that adequately completes this task. One possible solution to this problem involves the use of specialized information access programs that are able to access information and transmute that information to a form usable by a single application. These information access programs, called wrappers, were decided to be the most appropriate way to extend the DataFoundry bioinformatics application to support data integration from multiple sources. By adding wrapper support into the DataFoundry application, it is hoped that this system will be able to provide a single access point to bioinformatics data for scientists. We describe some of the computer science concepts, design, and the implementation of adding wrapper support into the DataFoundry bioinformatics application, and then discuss issues of performance.
Deadlock Prediction And Avoidance In An AGV System

Automated Guided Vehicle Systems (AGVS) form a very important part of automated material handling and its performance affects the eff iciency of the entire system. Deadlock formation is a serious problem as it stalls the AGVS. The objective of this project is to develop an eff icient deadlock prediction and avoidance algorithm. Deadlock in a broad sense is a situation in which at least a part of the system stalls. There are a lot of situations in which the system may stall and most of these situations can be avoided by designing a good control and navigation system. The project concentrates on developing an algorithm to predict the occurrence of cyclic deadlock and the other kinds of deadlocks are avoided by using control logic. A variety of deadlock-detecting algorithms are available but, the AGVS under study is huge and complex and none of the existing methods can be used. This is because, it is the first time that such a complex port AGVS layout has been taken for study and all the existing methods are for simpler and smaller layouts. A semi-dynamic routing system is proposed which employs a prediction phase and an avoidance phase. The routes for the vehicles are obtained by using a shortest path algorithm, which takes congestion effects into consideration. Leighton, Maggs and Richa [11] have earlier shown that there exists a routing schedule in O(c+d) if the congestion effects are taken into account. A computationally eff icient method for updating the network with the congestion effects is also suggested. The proposed solution is implemented in a simulation software, AutoMod, and the performance of the technique is analyzed. A detailed description of the algorithm and specific details of implementation in AutoMod and C are provided. The algorithm is implemented first on a small-scale model and then on the actual model. In the actual model, realistic loads are simulated so that the algorithm can be evaluated with as much real data as possible. Simulation shows that all the potential deadlock situations are detected and avoided. Also, the proposed strategy is computationally eff icient and is able to provide the movement decision to the vehicles within the 1.5-sec sampling time. The simulations show that the deadlocks formation is inherent in the layout and they cannot be avoided by simply reducing the number of vehicles in the system. This suggests that the prediction-avoidance strategy has to be a vital ingredient of the AGVS routing system.
Mismatch patterns in similar business processes

To unify similar business processes, such as processes of similar business units or similar organizations, the similarities and differences between these business processes must be detected and the differences must be resolved. This paper presents a collection of patterns that describe frequently occurring mismatches between similar business processes. These patterns are helpful in the mismatch detection step. We discovered them in practice by comparing processes that we obtained from different business units in two organizations. The patterns help when merging processes in case of a merger between organizations. They also help when merging processes to construct a standardized process that allows organizations that adhere to the standard to interact successfully.
CyberGIS: Empowering the Synthesis of Computational and Spatial Thinking

Spatial thinking and associated geographic approaches, supported by geographic information systems (GIS), play essential roles in solving scientific problems and improving decision-making practices of significant societal impact. Fulfilling such roles is increasingly dependent on the capabilities of synthesizing spatial and computational thinking (Wing 2006) enabled by cyberinfrastructure. Cyberinfrastructure promises to revolutionize how science and engineering are conducted in the 21st century as computation has become the third pillar of science and engineering (along with theory and experiment) (NSF 2003). CyberGIS represent a new GIS modality comprising a seamless blending of cyberinfrastructure, GIS, and spatial analysis capabilities to empower computational and spatial thinking and, thus, promise to transform geospatial problem-solving and decision-making while advancing cyberinfrastructure. Recent research and development in cyberinfrastructure and geographic information science (GIScience) have demonstrated the benefits and possibilities of CyberGIS from individual perspectives. These efforts span the realm of Internet-based GIS, geospatial middleware, spatial analysis based on high-performance computing approaches, geospatial problem-solving environments and portals, sensor webs and networks, geospatial ontology and semantic web, and volunteered geospatial information. To effectively establish and exploit CyberGIS, however, requires the treatment of CyberGIS as an integrative framework of synthesizing cyberinfrastructure, GIS, and spatial analysis capabilities (Wang 2010). Moreover, past experiences in bridging cyberinfrastructure and domain sciences suggest that participation of domain application researchers is crucial to increasing the effectiveness and impact of cyberinfrastructure (Wang and Zhu 2008; Wilkins-Diehr 2007). The experience of the NSF TeraGrid GIScience Gateway based on the GISolve Toolkit (www.gisolve.org) has proved the feasibility of a CyberGIS prototype (Wang and Liu 2009), and demonstrated that experiences gained from experiments with a functional CyberGIS are extremely valuable to approach the science and applications of CyberGIS. Significant research and education challenges remain to be tackled with the following thee listed as some examples: 1)
Vision Based Multiple Target Tracking Using Recursive RANSAC

Vision Based Multiple Target Tracking Using Recursive RANSAC James Kyle Ingersoll Department of Mechanical Engineering, BYU Master of Science In this thesis, the Recursive-Random Sample Consensus (R-RANSAC) multiple target tracking (MTT) algorithm is further developed and applied to video taken from static platforms. Development of R-RANSAC is primarily focused in three areas: data association, the ability to track maneuvering objects, and track management. The probabilistic data association (PDA) filter performs very well in the R-RANSAC framework and adds minimal computation cost over less sophisticated methods. The interacting multiple models (IMM) filter as well as higher-order linear models are incorporated into R-RANSAC to improve tracking of highly maneuverable targets. An effective track labeling system, a more intuitive track merging criteria, and other improvements were made to the track management system of R-RANSAC. R-RANSAC is shown to be a modular algorithm capable of incorporating the best features of competing MTT algorithms. A comprehensive comparison with the Gaussian mixture probability hypothesis density (GM-PHD) filter was conducted using pseudo-aerial videos of vehicles and pedestrians. R-RANSAC maintains superior track continuity, especially in cases of interacting and occluded targets, and has fewer missed detections when compared with the GM-PHD filter. The two algorithms perform similarly in terms of the number of false positives and tracking precision. The concept of a feedback loop between the tracker and sensor processing modules is extensively explored; the output tracks from R-RANSAC are used to inform how video processing is performed. We are able to indefinitely detect stationary objects by zeroing out the background update rate of target-associated pixels in a Gaussian mixture models (GMM) foreground detector. False positive foreground detections are eliminated with a minimum blob area threshold, a ghost suppression algorithm, and judicious tuning of the R-RANSAC parameters. The ability to detect stationary targets also allows R-RANSAC to be applied to a class of problems known as stationary object detection. Additionally, moving camera foreground detection techniques are applied to the static camera case in order to produce measurements with a velocity component; this is accomplished by using sequential-RANSAC to cluster optical flow vectors of FAST feature pairs. This further improves R-RANSAC’s track continuity, especially with interacting targets. Finally, a hybrid algorithm composed of R-RANSAC and the Sequence Model (SM), a machine learner, is presented. The SM learns sequences of target locations and is able to assist in data association once properly trained. In simulation, we demonstrate the SM’s ability to significantly improve tracking performance in situations with infrequent measurement updates and a high proportion of clutter measurements.
The Overlay Network Content Distribution Problem

Due to the lack of deployment of a network-layer multicast service, many overlay multicast protocols have been designed and deployed across the Internet to support content distribution. To our knowledge, however, none have provided a rigorous analysis of the problem or the effectiveness of their proposed solutions. Here, we set aside the engineering challenges of protocol design to focus on the fundamental graph problem. We begin by formulating the Overlay Network Content Distribution (OCD) problem and show that variants that attempt to optimize for either speed or bandwidth utilization are NP-complete. Using both a time-indexed Integer Program and a branch-and-bound search strategy, we calculate optimal solutions for small graphs. While solutions to OCD provide performance bounds, realistic deployment scenarios will not have global network information. Hence, we introduce an on-line variant, the Local-knowledge Overlay Content Distribution (LOCD) problem and show that no constantcompetitive approximation exists. Instead, we present several heuristics that perform well in realistic topologies. We conclude with an evaluation of our global and local heuristics and enumerate a number of open problems.
Class-based NewtonScript Programming

NewtonScript is often described as an "object-oriented" language. However, even if (or especially if) you have some experience with other object-oriented languages, such as Smalltalk or C++, you may be a bit confused by it. NewtonScript does have many features that will be familiar to you, but it has one important difference: NewtonScript is prototype-based, rather than class-based. That is, rather than dividing the world into classes and instances for the purposes of inheritance, NewtonScript objects inherit directly from other objects.
Carnage and the media: the making and breaking of news about violence

Our online web service was launched having a wish to work as a comprehensive on the web digital library which o ers entry to large number of PDF file document assortment. You might find many kinds of e-publication and other literatures from the documents data base. Certain well-liked issues that distribute on our catalog are famous books, solution key, test test questions and answer, guide paper, practice guide, test sample, end user handbook, owners guidance, services instructions, repair guidebook, and so on.
Theoretical Linguistics Meets Pedagogical Practice: Pronominal Subject Use in Spanish as a Second Language

This article attempts to highlight the importance of theoretical linguistics and empirical cognitive linguistics studies for the practical teaching of Spanish as a second language. Looking at the domain of subject pronominal use as an example, I endeavor to show how formal linguistics can be useful to language instructors. This is a significant enterprise since language instructors could benefit from both a better understanding of the linguistic properties of the languages they teach and what psycholinguistic studies have revealed about the nature of adult language learning in general.
Gimp the Official Handbook with Cdrom

From the Publisher: Comprehensively covers the program by teaching readers all aspects ranging from installing, to scripting, to working faster and more efficiently through shortcuts. Thoroughly covers one of the most powerful aspects of GIMP  filters, including how to create images invoking Cubism, Van Gogh, embossing, warping, rippling, glass tile, and fractals. While this book does not teach readers how to be artists, it offers plenty of examples to inspire new ideas and grab on to the power and versatility of the application. Gimp: The Official Handbook is written by two Gimp experts and is the most comprehensive source of information available on this freely distributed image-manipulation program for the Open Source community. The only book to teach the entire program, including all built-in filters and third-party plug-ins. Beats the competition by teaching the program from cover to cover. Other books gloss over key features and focus on learning the program quickly, or are theoretical and provide no practical information on the product. Features a 32-page Color Studio with inspiring images readers can create by learning all of the program's techniques in the book. Core Gimp software. Plug-ins and libraries that add file formats and effects to harness the power of this expandable and extensible program.
Annotating CBC4Kids: A Corpus for Reading Comprehension and Question Answering Evaluation

Reading comprehension tests are receiving increased attention within the NLP community as a controlled test-bed for developing, evaluating and comparing robust question answering (NLQA) methods. To support this, we have enriched the MITRE CBC4Kids corpus with multiple XML annotation layers recording the output of various tokenizers, lemmatizers, a stemmer, a semantic tagger, POS taggers and syntactic parsers. To demonstrate its use, we have built a baseline NLQA system for word-overlap based answer retrieval, NLQA evaluation and corpus browsing.
Practical pointer aliasing analysis

Two names are aliased if they refer to the same location at a program point during execution. Pointer aliasing analysis for C programs is essential for compile-time analyses and optimizations. Many techniques have been proposed in the literature. Some are fast, but not so precise; some are quite precise, but not fast in some cases. We have developed a technique which decomposes program statements into independent sets in terms of their effects on pointer aliasing. Each set implies a program segment which includes the statements in the set and some control statements. Each segment can be analyzed for pointer aliasing independently. Therefore the program decomposition allows the use of more than one analysis algorithm on a same program and the use of appropriate aliasing analyses based on characteristics of pointers being analyzed. We handle features in C such as function pointers, indirect calls through functions pointers, unions, and type casting with some restrictions. We have also developed a points-to analysis algorithm and an aliasing analysis algorithm. Both are flow-insensitive and context-insensitive; thus they are efficient and can be used on large programs. For each assignment lhs = rhs in a program, the aliasing analysis effectively assumes there is also an assignment rhs = lhs while the points-to analysis does not make such assumptions. Therefore the points-to analysis is more precise than the aliasing analysis. We have implemented prototypes of the program decomposition, the points-to and the aliasing analysis algorithms; empirical results on a set of C programs are given. We have also experimented with combining two or more aliasing/points-to analyses for a same program by using the program decomposition; we present empirical results of our preliminary experiment.
Shallow Water and Navier-Stokes SPH-like numerical modelling of rapidly varying free-surface flows

In coastal engineering, Lagrangian meshless numerical methods have reached a good popularity and they have been applied with success to describe wave breaking, impact of wave on structures and other rapid phenomena. This is due to the fact that they have a number of advantages in comparison with classical Eulerian schemes: no explicit treatment of the free surface and no computational grid mean that sophisticated meshing is not needed for complex geometries and therefore a number of problems that were considered largely intractable using classical Eulerian numerical methods such as finite volume or finite elements can now be simulated. As a relatively new method in Computational Fluid Dynamics, this kind of methods may be considered immature and many fundamental aspects and key characteristics remain to be fully investigated. The solid boundary condition is such an example: imposing closed boundary conditions in meshless methods in general, and in Smoothed Particle Hydrodynamic (SPH) in particular, is still an open problem. In the first chapter of this thesis an approximate Virtual Boundary Particle Method (VBP) for solid boundary conditions in two-dimensional (2-D) SPH models is presented; this is a development of the original VBP method recently proposed by Ferrari et al. (A new 3-D parallel SPH scheme for free-surface flows, Computers & Fluids, 38(6), 1203-1217, 2009). The aim is to maintain the zeroth moment of the kernel function as closely as possible to unity, (a property referred to as zero-consistency), for particles close to solid boundaries. The main advantage of the MVBP in comparison with other methods such as Mirrored Particles is