Miracle-dz/UniFAR-FTUs huggingface dataset:
Logic Simulation Using Graphics Processors

iii ACKNOWLEDGMENTS I would like to thank my advisor, Sandip Kundu, for his thoughtful and patient guidance, motivation and support. I would also like to extend my gratitude to the members of my committee, Wayne P. Burleson and Ramgopal Mettu, for their helpful comments and suggestions on all stages of this thesis. I would like to thank Ian Buck and his team at Stanford University whose material I have used, excerpted and referenced in this thesis. The members of the GPGPU (General Purpose Computation using Graphics Hardware) forums, particularly Mike Houston and the Brook GPU community at Stanford University deserve appreciation. The forums were an invaluable source of information and helped clear many concepts. The GPU Gems 2 book was an extremely useful reference. A special thank you to all those, whose support and friendship helped me to stay focused on this project and provided me with constant encouragement. Thanks are also due to my family for their support, love and affection. Logic Simulation is widely used to verify the logical correctness of hardware designs. In this work, we present the implementation of a generic graphics processor based logic simulator and compare it with the corresponding CPU (desktop) based implementation. The motivation for this study arises from the increasing computational power of graphics processors (GPUs). Graphics hardware performance is roughly doubling every six months, and they are outpacing CPUs in raw computational power. GPUs are becoming increasingly programmable and their prices are falling steeply. Most desktops now come built-in with programmable graphics processors. The highly parallel nature of graphics computations enables GPUs to use additional transistors for computation, achieving higher arithmetic intensity with the same transistor count. Applications such as Ray Tracing, Fluid Modeling, Radiology imaging etc have shown speed-ups on graphics processors. This led us to investigate the use of GPUs to run concurrent algorithms for logic simulation. We present the implementation and analyze performance bottlenecks and finally draw conclusions as to whether the GPU can be used for speeding up the logic simulation algorithm.
Information Extraction and Integration with Florid: The MONDIAL Case Study

For accessing and processing this information provided on the Web there is a need for integration of data from di erent heterogeneous sources Languages for this purpose have to serve for querying the web extracting information from semistructured data and restructuring the results In LHL we argue that languages supporting deduction and object orientation are particularly suited in this context we proposed a formal model for querying structure and contents of Web data A main advantage of our approach is that it brings together the above mentioned issues in a uni ed formal framework The approach is implemented in the Florid system HLLS which is an implementation of the deductive objectorientes database language F Logic KLW This report substantiates the above claims by a case study using Florid We show how several information sources on the Web containing political and geographical data are integrated to a geographical database using Florid The case study illustrates the trade o gained from an integrated Web querying and data manipulation language supporting a concise and elegant programming style Using a deductive language a process of rapid prototyping and re ne ment of the program implementing both a wrapper and a mediator can be easily followed the program consists of a skeleton of generic wrapping rules MHLL augmented by re ning rules and application speci c rules Homepage of the Mondial Case Study http www informatik uni freiburg de may Mondial
Common Divisors of Elliptic Divisibility Sequences over Function Fields

Let E/k(T ) be an elliptic curve defined over a rational function field and fix a Weierstrass equation for E. For a point P ∈ E(k(T )), we can write xP = AP B2 P with relatively prime polynomials AP , BP ∈ k[T ]. The sequence (BnP )n≥1 is called the elliptic divisibility sequence of P ∈ E. For two such elliptic divisibility sequences (BnP )n≥1 and (BnQ)n≥1, we consider the degree of the greatest common divisor of terms in the elliptic divisibility sequences, deg gcd(BnP , BnQ). We conjecture a complete theory for how this degree is bounded as n increases, and we support this conjecture with proofs and experiments. In characteristic 0, Silverman already conjectured that this degree is always bounded by a constant, and he gave a proof for curves with constant jinvariant. In characteristic p, Silverman conjectured that there is always a constant c such that there are infinitely many n with deg gcd(BnP , BnQ) ≥ cn. We conjecture that there are curves that do as well as curves that don’t satisfy the stronger bound that deg gcd(BnP , BnQ) ≥ cn for infinitely many n, and that this is still true when we do not allow the field characteristic p to divide n.
PLANETARY EXPLORATION USING HOPPING ROBOTS

The recent trend towards small and frequent space mission to Mars and other celestial bodies such as moons, asteroids, and comets has sparked new interest towards multi-functional vehicles, capable of providing excellent mobility to dedicated scientific packages. Currently, the only deployed, and actively engineered, mobility paradigm is a 6-wheeled rover, as seen in the Pathfinder mission's Sojourner vehicle [12] and in the planned Mars 2003 exploration missions. Most 6-wheeled rover designs can traverse obstacles that are about 1.5 times their wheel diameter, but they also have significant drawbacks preventing their use as truly general exploration platform. For example, they can only drive over obstacles that are a fraction of the vehicle's body length, and use a significant number of actuators and complex suspension linkages. To address the two goals of reducing rover complexity and developing more efficient mobility methods, in the past few years we have been developing planetary robots equipped with a very small number of actuators and capable of moving by hopping. Since planetary bodies of current interest are characterized by low to medium gravitational environments, wheeled mobility can be replaced, for certain operations, by hopping, which is a more efficient mobility method. Key to the good performance of these systems is the trade-offs between functionality and complexity in the context of the design and development of a small robot, capable of moving a camera and a science package by jumping. Our hopper's operation is more akin to the movement of a frog, rather than the oscillatory behaviour of typical hopping robots [14]. In particular, with our first prototype we have investigated the basic problems of rover jumping. With the second prototype we have shown that a system weighting less than 1.5 kg can efficiently convert the energy stored a single actuator to propel, steer, self-right a simple hopper, and pan an on-board camera. With the third prototype, we have shown the ability to combine coarse motion generated by hopping with wheeled motion for fine position of science instruments. Figure 1 shows a picture of the first three generations of hopping robotis. There are, however, several important aspects, which must be solved before this mobility concept can be used in real exploration missions.
Exploring Local Feature Descriptors for Construction Site Video Stabilization

Recent studies on automated activity analysis have adopted construction videos as an input data source to recognize and categorize construction workers’ actions. To ensure the representativeness of its analysis results, these videos have to be gathered randomly in terms of time and location. In doing so, such videos must be taken with hand-held cameras, a fact that inevitably leads to videos including jittery frames. Such frames can decrease the accuracy of automated activity analysis results. One area of the most recent and effective action recognition methods involves using spatio-temporal action recognition algorithms. The jittery frames, however, are fatal to the recognizing of a human worker’s action using such an algorithm. Jitters can be removed from the videos by using video stabilization technologies. The video stabilization is the pre-processing of action recognition for automated activity analysis. Regarding the video stabilization, local feature descriptor plays a major role in the stabilization process, and the correct selection of proper descriptor is critical. Therefore, the purpose of this study is to identify the best local feature descriptor for the video stabilization. This paper describes detail steps of the stabilization and provides performance analysis of various local feature descriptors in terms of stabilization of videos from construction site.
Question Answering Techniques for the World Wide Web

Question answering systems have become increasingly popular because they deliver users short, succinct answers instead of overloading them with a large number of irrelevant documents. The vast amount of information readily available on the World Wide Web presents new opportunities and challenges for question answering. In order for question answering systems to benefit from this vast store of useful knowledge, they must cope with large volumes of useless data.
Using Evolutionary Programming to increase the accuracy of an ensemble model for energy forecasting

USING EVOLUTIONARY PROGRAMMING TO INCREASE THE ACCURACY OF AN ENSEMBLE MODEL FOR ENERGY FORECASTING James Gramz, B.S. Marquette University, 2014 Natural gas companies are always trying to increase the accuracy of their forecasts. We introduce evolutionary programming as an approach to forecast natural gas demand more accurately. The created Evolutionary Programming Engine and Evolutionary Programming Ensemble Model use the current GasDay models, along with weather and historical flow to create an overall forecast for the amount of natural gas a company will need to supply to their customers on a given day. The existing ensemble model uses the GasDay component models and then tunes their individual forecasts and combines them to create an overall forecast. The inputs into the Evolutionary Programming Engine and Evolutionary Programming Ensemble Model were determined based on currently used inputs and domain knowledge about what variables are important for natural gas forecasting. The ensemble model design is based on if–statements that allow different equations to be used on different days to create a more accurate forecast, given the expected weather conditions. This approach is compared to what GasDay currently uses based on a series of error metrics and comparisons on different types of weather days and during different months. Three different operating areas are evaluated, and the results show that the created Evolutionary Programming Ensemble Model is capable of creating improved forecasts compared to the existing ensemble model, as measured by Root Mean Square Error (RMSE) and Standard Error (Std Error). However, the if–statements in the ensemble models were not able to produce individually reasonable forecasts, which could potentially cause errant forecasts if a different set of if–statements are true on a given day.
Local Binary Patterns applied to Face Detection and Recognition

Nowadays, applications in the field of surveillance, banking and multimedia equipment are becoming more important, but since each application related to face analysis demands different requirements on the analysis process, almost all algorithms and approaches for face analysis are application dependent and a standardization or generalization is quite difficult. For that reason and since many key problems are still not completely solved, the face analysis research community is still trying to cope with face detection and recognition challenges. Although emulating human vision system would be the ideal solution, it is a heuristic and complicated approach which takes into account multiple clues such as textures, color, motion and even audio information. Therefore, and due to the fast evolution of technology that makes it possible, the recent trend is moving towards multimodal analysis combining multiple approaches to converge to more accurate and satisfactory results. Contributions to specific face detection and recognition applications are helpful to enable the face analysis research community to continue building more robust systems by concatenating different approaches and combining them. Therefore, the aim of this research is to contribute by exploring the Local Binary Patterns operator, motivated by the following reasons. On one hand, it can be applied to face detection and recognition and on the other hand due to its robustness to pose and illumination changes. Local Binary Patterns were first used in order to describe ordinary textures and, since a face can be seen as a composition of micro textures depending on the local situation, it is also useful for face description. The LBP descriptor consists of a global texture and a local texture representation calculated by dividing the image into blocks and computing the texture histogram for each one. The global is used for discriminating the most non-face objects (blocks), whereas the second provides specific and detailed face information which can be used not only to select faces, but also to provide face information for recognition. The results will be concatenated in a general descriptor vector, that will be later used to feed an adequate classifier or discriminative scheme to decide the face likeness of the input image or the identity of the input face in case of face recognition. It is in that stage where this research will focus, first evaluating more simple classification methods and then trying to improve face detection and recognition ratios by trying to eliminate features vector redundancy.
Scrum Maturity Model

Within the agile development methodologies context, the topic of client relationship management is strongly focused, mainly due to the importance of collaboration between the development team and its clients. Most clients avoid or are unable to develop a close cooperation with vendor organizations, since it requires a motivation and close participation among key stakeholders in the development processes within and correct usage of the adopted software development methodology. Hence, software development projects fail and become unsuccessful because of this lack of communication. In order to increase the rate of successful projects, this paper will present the journey of the validation process for this roadmap to lead and aid software vendor organizations improve their development processes, concentrating mainly on the client’s role throughout the process. This concept is called Scrum Maturity Model; therefore, our main goal is to validate this concept with organizations that use Scrum agile methodology as their main development process, which turns out to be an viable approach to reduce the rate failed development projects. Keywords-development methodologies; agile methodologies; scrum development methodology; maturity model; action research
A Novel way of Improving CPU Utilization In Cloud

Cloud computing is the collection of best software practices derived from dis-tributed computing systems like cluster and grid. Emerging as a superior design amongst them. Cloud not only has the capability of batch processing and massive massive parallel data computation like its parents but also, things hitherto was not imagined. The main concentration of our work is on IaaS(Infrastructure as a service) aspect of cloud. Wherein, the customer avails the computation resource over simple web interface. though the cloud has most of the good design choices of its parents, certain drawbacks of them have crept in. This may be the result of the lack of ecient preexisting tools or naive implementation/setup of system at certain layer. In our work, we've optimized the performance by identifying some of those implementation choices making the overall system more ecient. This thesis is an extension of the work on Nephele. Which is a parallel data processing framework(still experimental). Nephele facilitates on demand alloacation of resource by deducing few infor-mations from the users. Using these informations, Nephele splits the overall job to smaller stages and resource for the same is allocated. By doing so, unnecessary resource allocation like in conventional systems is being avoided. thus, eventually increasing the CPU utilization. In our proposal, we deduce few more informations from the user which helps in making more optimal scheduling of the resources.
Verification Condition Generation for Conditional Information Flow∗ **DRAFT** as of June 17, 2007

We formulate an intraprocedural information flow analysis algorithm for sequential, heap manipulating programs. We prove correctness of the algorithm, and argue that it can be used to verify some naturally occurring examples in which information flow is conditional on some Hoare-like state predicates being satisfied. Because the correctness of information flow analysis is typically formulated in terms of noninterference of pairs of computations, the algorithm takes as input a program together with two-state assertions as postcondition, and generates two-state preconditions together with verification conditions. To process heap manipulations and while loops, the algorithm must additionally be supplied “object flow invariants” as well as “loop flow invariants” which are themselves two-state, and possibly conditional.
Skills Capture and Transfer: Human Motion Capture

A skidplate projecting into a body of water from a marine craft hull has a symmetric wedge formation extending from the leading edge to differently profiled surfaces on opposite sides of the skidplate producing lift and side force during travel. No side force is however produced during straight line travel by virtue of ventilated cavity enclosure of the profiled surfaces on both sides between cavity establishing streamlines extending through the water from the symmetric wedge formation.
USE OF GENETIC PROGRAMMING TO FIND AN IMPULSE RESPONSE FUNCTION IN SYMBOLIC FORM(

The recently developed genetic programming paradigm provides a way to genetically breed a computer program to solve a wide variety of problems. Genetic programming starts with a population of randomly created computer programs and iteratively applies the Darwinian reproduction operation and the genetic crossover (sexual recombination) operation in order to breed better individual programs. This paper illustrates how genetic programming can be used to find the symbolic form of a good approximation to the impulse response function for a linear time-invariant system using only the observed response of the system to a particular forcing function.
Reliable and fast eye detection

Automatic detection of human eyes in images plays an important role in face recognition and human computer interaction. In this paper, we present a reliable and fast eye detection method. First, it detects a face region from a gray image using an Ada-boosting algorithm. Second, it estimates the head tilt angle and the vertical location of two eyes using intensity valley and edge patterns. Third, it detects the candidate regions for irises with a simple effective filter responding to the generic eye pattern. Finally it accurately localizes the eye using a fast deformable template matching algorithm.
Workshop on understanding, predicting and mitigating error in routine procedural tasks

Although infrequent, slip errors can have disastrous consequences, particularly in safety-critical environments such as busy hospital wards. It is for this reason that there has been a growing body of research focused on understanding, predicting, and mitigating error in routine procedural tasks. The aim of this workshop is to bring together researchers with an interest in the area of error with the aim of consolidating what is known and identifying the next set of major challenges in the area. There is growing interest in investigating factors that affect the likelihood that people will make a slip error while performing a routine procedural task. Ament et al (2009) have shown that errors are more common on particular kinds of steps in a task structure. Interruptions have been shown to increase error-rates (e.g., Li et al., 2008; Altmann & Trafton, 2007), while various methods have been shown to reduce error-rates (e.g., Altmann & Trafton, 2002; Back et al., 2007; Chung & Byrne, 2008; Hodgetts & Jones, 2006; Li et al., 2008; Ratwani & Trafton, 2008). Just-in-time visual cues have been shown to be particularly effective at eliminating errors in certain circumstances (Chung & Byrne, 2008), but there is concern that these cues might not always be noticed under high workload conditions (Lavie et al., 2004). Back, Brumby, & Cox (2010) have recently demonstrated that introducing an enforced lockout period following an interruption can also significantly reduce error rates. An alternative approach to mitigating error might be to develop a real-time system that can predict the likelihood of an error being made (Ratwani, McCurry & Trafton, 2008). Thus, there is a developing body of knowledge that can advance our understanding of the causes of slips and how they might be reduced.
A Calculus for Symbolic Names Management

We define a basic calculus ML for manipulating symbolic names inspired by λcalculi with extensible records. The resulting calculus supports the use of symbolic names for meta-programming and programming in-the-large, it subsumes Ancona and Zucca’s CMS, and partly Nanevski and Pfenning’s ν , and seems able to model some aspects of the mechanism of Java class loaders. We present two different extensions of the basic calculus, the first consider the interaction with computational effects (in the form of imperative computations), the second shows how CMS can be naturally encoded into ML .
MODELING THE USER IN INTELLIGENT USER INi’ERFACES

A methodology for explicitly defining s model )f l program’s usere and for evahmting the effectiveness of the user interface ie prezented. The development of an explicit user model will reduce user costs by both reducing the cod of eoftware development l nd ificreaeing ueer productivity. The components of the methodology we described, l rd an example of ueing the methodology in the development of an expert consultant system is given. The methodology can be ueeful in preliminary deeign and testing of such interactive eoftware w electronic mail, information retrieval systeme, editore, and management information eyetenm
Two Novel Techniques for Interactive Navigation of Graph Layouts

Navigation of the view space is an essential task during visual exploration of graphs. A fairly standard approach not only in graph visualization is to let users grab a view and drag it as necessary. Though being a very natural and intuitive interaction, it implies higher physical costs in terms of mouse milage [Harrower and Benjamin 2005]. To alleviate these costs, we propose two alternative navigation methods: pan-wheel navigation with radar view for the view space and edge-based travelling as a dedicated data space navigation method.
Ten Usability Heuristics

10. Help and documentation Even though it is better if the system can be used without documentation, it may be necessary to provide help and documentation. Any such information should be easy to search, focused on the user's task, list concrete steps to be carried out, and not be too large. I originally developed the heuristics for heuristic evaluation in collaboration with Rolf Molich in 1990 [Molich and Nielsen 1990; Nielsen and Molich 1990]. I since refined the