Miracle-dz/UniFAR-FTUs huggingface dataset:
The significance of program dependences for software testing, debugging, and maintenance

Program dependences are syntactic relationships between program statements, which are used in several areas of computer science to obtain "approximate" information about semantic relationships between statements. There are two basic types of program dependences: control dependences, which are features of a program's control structure, and data flow dependences, which are features of the placement of variable definitions and uses in a program. Typically, proposed uses of program dependences have been justified only informally, if at all. Since program dependences are used for such critical purposes as software testing, debugging, and maintenance, code optimization and parallelization, and computer security, this lack of rigor is unacceptable. This thesis presents the results of a rigorous investigation of the significance of program dependences for software testing, debugging, and maintenance. A concept called "semantic dependence" is defined, which is necessary condition for certain kinds of faults and modifications in a program statement to affect the execution behavior of other statements. Semantic dependence is defined by giving a semantics to a graph-theoretic program representation used to find program dependences. It is shown that a certain generalization of control and data flow dependence, called "weak syntactic dependence" is a necessary condition for semantic dependence. It is shown that a commonly used generalization of control and data flow dependence, which we call "strong syntactic dependence", is not a necessary condition for semantic dependence, although it is a necessary condition for a restricted form, called "finitely demonstrated semantic dependence". It is shown that neither weak syntactic, strong syntactic, nor data flow dependence is a sufficient condition for semantic dependence. Together, these results allow a better evaluation of the soundness of some proposed uses of program dependences in testing, debugging, and maintenance. The results support some uses, controvert others, and suggest new ones. Finally, this thesis clarifies the concept of control dependence, which is described somewhat vaguely in the literature, via the results described above and via several graph theoretic characterizations of control dependence.
Aspects of Hemifacial Microsomia

textabstractHemifaciale microsomia (HFM) is een aangeboren asymmetrische afwijking van het gelaat met grote variatie. Het ontstaan is onduidelijk. Buiten de craniofaciale (aangezichts) afwijkingen, komen ook andere defecten voor. Het klinisch beeld toont een enkelzijdige afwijking van het oor en een onderontwikkeling van het skelet, de weke delen en de aangezichtsspieren aan de aangedane gezichtshelft. Behandeling moet leiden tot een verbeterde functie en optimale gelaatssymmetrie aan het einde van de groei. Het uiteindelijke behandelresultaat wordt beinvloed door externe factoren, zoals de chirurgische techniek, maar ook door intrinsieke patient factoren zoals genetische achtergrond, groei en ontwikkeling. Het eindresultaat is afhankelijk van het psychosociale welzijn van de patient en de psychosociale invloed van ouders op de patient. Een van de bestudeerde factoren is de aangezichtsgroei in HFM. We vonden dat patienten meer terug liggende kaken hadden in vergelijking met de normale bevolking. De aangedane zijde vertoonde dit sterker dan de niet aangedane zijde. Voor de onderkaak geldt dat HFM patienten starten met een kleinere onderkaak en ook eindigen met een kleinere onderkaak. Tijdens de groei blijft de verhouding tussen aangedane en niet aangedane zijde gelijk. Er is geen toenemende gezichtsasymmetrie zichtbaar. Deze kleinere onderkaak suggereert dat er ook een afwijking aan de lokale tandontwikkeling bestaat. We vonden een vertraagde tandontwikkeling in ernstig aangedane jonge HFM patienten. Dit en de verdeling van aangeboren afwezige gebitselementen gerelateerd aan de ernst van de aandoening doen vermoeden dat er een vroege interactie bestaat tussen tand- en onderkaaksontwikkeling. De psychosociale implicaties van HFM op patient en ouders zijn onvoldoende bestudeerd. Voor het aanpassen aan de stressvolle gebeurtenis van het krijgen van een kind met een aangezichtsafwijking, zoals HFM, kan een grote rol zijn weggelegd voor verwerkingsstrategieen door de ouders. We onderzochten ouderlijke stress in relatie tot zowel kenmerken van het kind als de ouderlijke cognitieve verwerkingsprocessen. De manier van verwerking door ouders blijkt een groot deel van de ouderlijke stress te verklaren naast bepaalde kenmerken van hun kind. Vervolg onderzoek zou zich ook op functionele veranderingen moeten richten, zoals beweging van de onderkaak, esthetiek bij het lachen en de effectiviteit van kauwen waarbij rekening wordt gehouden met de drie dimensionale aard van de afwijking. Er kan dieper in gegaan worden op de manier waarop ouders verwerken dat zij een kind hebben met HFM en de strategie die zij daarvoor gebruiken. Dit kan het eindresultaat van de behandeling van hun kind beinvloeden en daarmee, de kwaliteit van leven van hun kind.
Hardcore AI for computer games and animation

Hardcore AI for Computer Games and Animation SIGGRAPH 98 Course Notes John David Funge 1998 Welcome to this tutorial on AI for Computer Games and Animation. These course notes consist of two parts: Part I is a short overview that misses out lots of details. Part II goes into all these details in great depth.
TERMINATION OF WORKFLOWS

A workflow is a set of activities usually organized using a graph structure that has one beginning and one end. A workflow includes human participants and software applications that have the responsibility to carry out activities. A workflow is known to be the formal definition of the process used to manage business processes (e.g., sales order processing, article reviewing, member registration, etc). In this paper we describe and analyze the behavior of workflows using graph theory to verify an important property: their termination. It is essential to formally verify if a workflow, such as a sales order processing, will eventually terminate and be completed. We verify the termination of workflows using a new approach based on what we call snapshot-based theory.
ANALISIS PERSEPSI DAN MOTIVASI KONSUMEN TERHADAP RITEL MODERN DAN RITEL TRADISIONAL (Studi pada Konsumen Toko Tamanan dan Alfamart Ki Mangun Sarkoro di Kabupaten Tulungagung)

Keberadaan ritel tradisional dan ritel modern dipandang secara berbeda oleh masing-masing konsumennya. Hal tersebut tidak lepas dari prespektif yang didapat konsumen melalui pengalaman dan perasaan konsumen ketika berbelanja di masing-masing ritel tersebut. Beberapa perspektif tersebut terkait masalah pelayanan, harga dan fasilitas seperti AC, parkir, CCTV, serta kebersihan toko. Kemudian konsumen dari masing-masing ritel tersebut juga mempunyai motivasi yang beragam dalam keputusan membelinya dalam ritel-ritel tersebut. Metode kualitatif digunakan untuk menganalisis motif-motif dan alasan konsumen tersebut dalam memutuskan tempat berbelanja. Berbagai alasan seperti alasan rekomendasi keluarga, harga yang lebih murah serta fasilitas lebih yang ditawarkan dalam ritel menjadi pertimbangan konsumen dalam melakukan keputusan pembelian. Lebih lanjut masing-masing konsumen menyatakan kecenderungannya lebih suka untuk berbelanja di ritel tradisional atau ritel modern. Keyword: Ritel Tradisional, Ritel Modern, Belanja, Motivasi Pembelian
Comparison of Asynchronous vs. Synchronous Design Technologies Using a 16-Bit Binary Adder

Asynchronous design is a promising technology that is gaining more and more attention. It’s claimed to offer several advantages over synchronous designs including high-speed performance, low power, and modularity. To compare asynchronous to synchronous design technologies, two 16-bit binary adders are designed. All design decisions are based on high-speed performance with area and power as secondary concerns. Architectures are chosen for each adder design that enables the given technology. The asynchronous design is optimized for the best case average delay and the synchronous design is optimized for the best worse case delay. The asynchronous 16-bit adder is implemented with a carry look-ahead architecture using 2-bit blocks. The carry-select architecture is selected for implementing the synchronous 16-bit adder. The two 16-bit adder designs are compared using two experiments. The first experiment measures the computation delay for 10,000 random input permutations. The synchronous design worse case delay is compared to the asynchronous average delay. The asynchronous adder average delay outperforms the synchronous worse case delay by more than 250 ps. In the second experiment the 16-bit binary adders are implemented into an adder test-bench system, and 32 consecutive additions are performed. In this experiment the synchronous adder design has a better computation delay by approximately 500 ps per addition. In the adder test-bench system the asynchronous adder performance realizes the full overhead delay associated with an asynchronous implementation.
Validation of Medical Image Analysis Techniques

This chapter focuses on the problem of measuring the performance of medical image processing and analysis techniques. There are two important, but quite different, possible definitions of the term "performance" in this context. One definition of performance is the time taken to execute an algorithm on a computer. On this dimension, an algorithm that requires less computation time is better. The other definition of performance relates to how frequently an algorithm results in a correct decision. On this dimension, a better algorithm is one that gives a correct decision more frequently. This chapter is concerned with measuring the performance of algorithms in this second sense. As one example, we want to be able to make meaningful statements of the form - "Algorithm A performs better than algorithm B at detecting signs of cancer in medical images" or "Algorithm A performs better than algorithm B at registering CT and MRI images of the brain. " It is only when algorithms have similar performance on this dimension that their relative computation time becomes of interest.
Multi-agent Planning with Confidentiality (Extended Abstract)

Distributed planning has seen a wide range of techniques aiming to address problems such as distributed plan formation and distributed plan execution. Common to these techniques is the notion of Multi-Agent Planning (MAP) as a combination of planning and coordination by de Weerdt et al. [2]. Among the three types of MAP problems summarised by Durfee [3], distributed planning for distributed plans is considered to be the most challenging. The key issue to tackle is the plan merging, which concerns about resolving potential conflicts (negative interactions) between individual plans (sequences of actions) of the agents. A more complex version of the problem that has many real world examples, is that where agents need to maintain confidential information such as private knowledge, and/or do not wish to expose their individual plans. Such confidentiality constraints may make the central/direct analysis of action interactions impossible. This paper focuses on the task of distributed planning for distributed plans with confidentiality. Abductive Reasoning (AR) is a special type of reasoning technique that can generate hypotheses to explain given observations. When combined with Event Calculus [6] (EC), it can be used for planning [8] where actions and goals are viewed as hypotheses and observations respectively. This approach is particularly suitable for non-classical planning problems involving, for instance, explicit time (e.g. actions with duration), concurrent actions or extended goals [5]. The inherent logical semantic of the framework allows properties of MAP such as the soundness to be proven. A distributed version of AR, called DARE [7], can be used as a unified framework for distributed planning. Its direct use would see plan construction, goal refinement and allocation handled by the Global Abductive Phase, and negative interactions analysis and resolution by the Global Consistency Phase. During the planning process, the plan (actions as hypotheses) would be collected and passed around the agents. However, by doing so confidentiality may not be preserved. This paper shows how DARE can be extended to allow agents to collaboratively construct consistent sub-plans for a given global goal without exposing them. The idea is that during the local plan construction, each agent collects the
Fast Packet Filtering Using N-ary Decision Diagrams

Packet filters are security devices that connect multiple packet-based networks and provide access control between them. The security policy of a packet filter is specified according to a set of rules which describes what packet types should be allowed from one network to another. However, the improved network security that packet filters provide comes with a cost. The rules of a packet filter are commonly evaluated sequentially, and so long rule sets result in significantly increased look-up latency. Also long rule sets typically occur at high-bandwidth network interfaces such as on border routers, where fast packet processing is essential. This paper presents a novel technique for representing the rule sets of packet filters, founded on the concept that a rule set can be expressed as a single Boolean function. When these functions are represented as decision diagrams, this rule set representation provides a constant upper bound on packet filtering latency, independent of the rule set length. Furthermore, by increasing the degree of the decision diagram, faster look-up times can be achieved, at the expense of memory. Empirical research examines this space-time trade-off to provide a packet filtering technique that is both fast and reasonable in memory usage.
Intelligenter Zugang zu Umweltinformationen durch ontologiebasiertes Information Retrieval

Der Zugriff auf Umweltinformationen über das Internet wirft zahlreiche Probleme auf die vor allem durch die Komplexität der unterschiedlichen Informationen sowie deren Heterogenität und Verteilt entstehen. Das Problem wird noch durch die Teilweise sehr unterschiedlichen Anforderungen verschärft, die für unterschiedliche Benutzer von Umweltinformationssystemen zu berücksichtigen si nd. In diesem Papier wird das Konzept eines intelligenten Zugriffs auf Umweltinformationen vorgestellt, welches die vorhandenen Probleme teilweise lösen könnte. Das Konzept basiert auf zwei grundlegenden Prinzipien. (1) Verwendung unterschiedlicher Bezüge von Umweltinformationen zur Reflektion der unterschiedlichen Sichten von Benutzern auf die vorhandenen Informationen. (2) Verwendung wissensbasierter Methoden, insbesondere formaler Ontologien und dedu ktiver Inferenz, zur Unterstütz ung des Zugri ffs auf die Informationen über festgelegte Bezüge. Ausgangspunkt der Betrachtung sind die Anforderungen an das zur Zeit entstehende Bremer Umweltinformationssystems BUISY.
Query- vs. Crawling-based Classification of Searchable Web Databases.

The World-Wide Web is one of the main channels through which people currently exchange information. Unfortunately, this information is not characterized in a way that would make its semantics readily understandable by computers, which complicates building value-added services on top of the existing information. An ambitious effort that aims to facilitate the development of such services is the so-called “Semantic Web. ” According to Berners-Lee et al. [1]:
Derivation and Implementation of a Full 6D EKF-based Solution to Bearing-Range SLAM

This report addresses the formulation and the implementation of a full 6D (3D positions plus 3D attitude angles) solution to Simultaneous Localization and Mapping (SLAM) using a range and bearing sensor. It will be not assumed here that the sensor coordinate reference system coincide with that of the robot, which severely complicates the equations required for the implementation but in turn allows the usage of any number of sensors on a robot without restrictions. It is also briefly discussed two implementations in C++ within the context of the Mobile Robot Programming Toolkit (MRPT) project, corresponding to a straightforward O(N) and a more efficient O(N) algorithm. Update rates in excess of 120Hz are demonstrated for a simulated sensor. An online version of this document is available in: http://babel.isa. uma.es/mrpt/index.php/6D-SLAM
On Metrics for Keyword-Based Document Selection and Classification

For a large set of documents, certain numerical characteristics (metrics) are discussed that allow to select the documents relevant to a given topic and divide the set of the relevant documents into several groups (clusters) reflecting various subtopics of the given topic. The choice of the metrics is justified by expected results for known examples. A given topic is defined by a domain-oriented keyword dictionary. The results are implemented in a program Text Classifier.
Ontwikkelen en kopiëren van software

• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers.
Real-Time Cloud Rendering for Games

This paper presents a method for realistic real-time rendering of clouds for flight simulators and games. It describes a cloud illumination algorithm that approximates multiple forward scattering in a preprocess, and first order anisotropic scattering at runtime. Impostors are used to accelerate cloud rendering by exploiting frame-to-frame coherence in an interactive flight simulation. Impostors are particularly well suited to clouds, even in circumstances under which they cannot be applied to the rendering of polygonal geometry. The method allows hundreds of clouds with hundreds of thousands of particles to be rendered at high frame rates, and improves interaction with clouds by reducing artifacts introduced by direct particle rendering.
An Empirical Evaluation of and Toolkit for Asynchronous Programming in C# Windows Phone Apps

Microsoft has introduced the async/await keywords in C# 5.0 to support developers that need to apply asynchronous programming techniques. However, do developers really use the new keywords, and do they use them correctly? An empirical survey of 1378 open source repositories from GitHub and CodePlex shows that developers often make mistakes. By providing live feedback in the IDE, and by providing a refactoring tool to automatically refactor legacy APM-based code to modern async/await-based code, developers can be supported in using the new language feature correctly. An evaluation of the developed tools shows that they are useful: GitHub pull requests based on patches generated with the developed tools were readily accepted by several open source projects.
Rich prior knowledge in learning for NLP

We present an approach to grammar induction that utilizes syntactic universals to improve dependency parsing across a range of languages. Our method uses a single set of manually-specified language-independent rules that identify syntactic dependencies between pairs of syntactic categories that commonly occur across languages. During inference of the probabilistic model, we use posterior expectation constraints to require that a minimum proportion of the dependencies we infer be instances of these rules. We also automatically refine the syntactic categories given in our coarsely tagged input. Across six languages our approach outperforms state-of-theart unsupervised methods by a significant margin. 1
Wireless Urban Sensing Systems

The creation over the past decade of unanticipated applications of the Internet, such as web services, peer-to-peer file sharing, networked gaming, podcasting, and voice telephony, is resulting in a recent rethinking of the core Internet infrastructure and the original architecture choices. In this project however we propose to go beyond reacting to these applications that have already emerged, and proactively consider the network architecture implications of a new class of applications involving embedded sensing technology as it moves from scientific, engineering, defense, and industrial contexts to the wider personal, social and urban contexts. Today, applications are emerging which draw on sensed information about people, objects, and physical spaces. These applications enable new kinds of social exchange: By collecting, processing, sharing, and visualizing this information, they can offer us new and unexpected views of our communities. They require new algorithms and software mechanisms because unlike scientific applications of distributed sensing, a single system is widely distributed, intermittently connected, and privately administered; and unlike traditional Internet applications the physical inputs are critical to the behavior.
A strategy for analysing product line software architectures

The purpose of the architecture evaluation of a software system is to analyze the architecture to identify potential risks and to verify that the quality requirements have been addressed in the design. This research report addresses the issue of how to perform an analysis of software product line architectures. Throughout the chapters we will try to present a way of thinking founded on an analysis at the architecture level of the quality attributes with the purpose to initiate and maintain a software product line considering the quality as the main driver in the product line development. The analysis strategy is exemplified with a spectrometer controller product line, a case study where the product line is initiated in a revolutionary style, which is such that the product line architecture and its components are elaborated to match the requirements of all expected product line members. In this report, we will present our original contributions in developing this significant and, at the same time, new research domain. In order to be able to discuss an analysis strategy for a product line architecture, it is a considerable advantage to have a good knowledge of the state of art and practice in the software architecture domain. One of our contributions is to extract the main concepts that are common to software architectures and to present what is specific for the product line approach in software development. The study in the first part of the report gathers together, for the first time to our knowledge, all of the important published software architecture analysis methods and attempts to compare them. This survey shows the state of the research at this moment, in this domain, by presenting and discussing eight of the most representative architecture analysis methods. The study represents a step towards defining a general product line architecture analysis strategy. In practice, we will simplify our analysis approach and the last part of this report focuses on our experiences with the product line architecture analysis of the spectrometer controller PL.