Miracle-dz/UniFAR-FTUs huggingface dataset:
A robust patch-based synthesis framework for combining inconsistent images

Current methods for combining different images produce visible artifacts when the sources have very different textures and structures, come from far view points, or capture dynamic scenes with motions. In this thesis, we propose a patch-based synthesis algorithm to plausibly combine different images that have color, texture, structural, and geometric inconsistencies. For some applications such as cloning and stitching where a gradual blend is required, we present a new method for synthesizing a transition region between two source images, such that inconsistent properties change gradually from one source to the other. We call this process image melding. For gradual blending, we generalized patch-based optimization foundation with three key generalizations: First, we enrich the patch search space with additional geometric and photometric transformations. Second, we integrate image gradients into the patch representation and replace the usual color averaging with a screened Poisson equation solver. Third, we propose a new energy based on mixed L2/L0 norms for colors and gradients that produces a gradual transition between sources without sacrificing texture sharpness. Together, all three generalizations enable patch-based solutions to a broad class of image melding problems involving inconsistent sources: object
Cognitive tools of ClassSim: Building connections between theory and practice

Abstract This paper reports on the incorporation of an embedded tool within a virtual classroom environment(ClassSim) and the use of this by pre-service teachers as they engage with the software. The classroomsimulation reported on in this research was developed to provide pre-service teachers with a safe virtualenvironment in which they are able to explore ‘authentic’ and practical classroom scenarios. The embeddedtool, referred to as the ‘Thinking Space’, was developed to support pre-service teachers in capturing theirreflections about the complex role of a teacher as they move through the experience. Encouraging reflectionhas long been acknowledged as an important strategy in the development of new understandings. Our trials ofthe software have shown that pre-service teachers have used the tool to reflect upon issues within theclassroom, articulating their rationale at decision points and to identify underlying influences that affect theiruse of the classroom simulation (ClassSim) and their understandings of the role of a teacher. Our findings alsoreveal that the ‘Thinking Space’ provides a framework in which pre-service teachers are able to buildconnections between the theory of their pre-service training and practical experiences.
Tomographie depuis plusieurs sources vers de multiples destinations dans les réseaux de grilles informatiques hautes performances

Nowadays grids connect up to thousands communicating resources that may interact in a partially or totally coordinated way. Consequently, applications running upon this kind of platform often involve massively concurrent bulk data transfers. In order to optimize overall completion times, those transfers have to be scheduled based on knowledge about network performances and topology. Identifying and inferring performances of a network topology is a classic problem. Achieving this by using only end-to-end measurements at the application level is a method known as network tomography. When topology reflects capacities of sets of links with respect to a metric, the model used to represent the topology obtained is called a Metric-Induced Network Topology (MINT). Such a type of representation, obtained using statistical methods, has been widely used in order to represent performances of client/server communication protocols. However, it is no longer accurate when dealing with grids. In this thesis, we introduce a novel representation of the infered knowledge from multiple source and multiple destination measurements, algorithms in order to reconstruct such representations, methods to probe network in order to obtain an initial set of data from which we can reconstruct such topology. We also describe the tool we have designed an implemented in order to achieve these goals and experiences we have made in order to validate our methods and algorithms.
Improving syntactic matching for multi-level filtering

Abstract : At the center of software reuse is the search and retrieval of software components from large software libraries. Recent research has illuminated a promising approach called multi-level filtering that breaks the problem up into a series of increasingly stringent filters that move along a continuum of high recall, low-precision syntactic techniques towards the more computationally expensive, high-precision semantic techniques. In multi-level filtering, syntactic matching is decomposed into two phases: profile filtering and signature matching. This thesis presents improvements to the resolution of syntactic profiles where the intent is to increase precision without a loss in recall during profile filtering. Large integer representation of profiles and profile lookup tables lead to an optimal time and space solution to profile representation. Finally, a new approach to signature matching is proposed that provides early pruning of the search space in an effort to cut down the time it takes to find valid signature maps. The resulting software is mature enough for future integration with the other elements of multi-level filtering as well as inclusion in a CASE tool such as CAPS.
ISIS: An Interactive Facility for Scene Analysis Research

Abstract : This paper summarizes initial progress in developing a computer system that can be rapidly programmed to analyze any class of pictorial scenes. Scene analysis programs have been awkward to develop using conventional programming systems because of the difficulty of formulating pictorial descriptions in symbolic terms. Picture processing techniques are inherently ad hoc and must be deduced empirically for each application. We have constructed an interactive system specifically designed for expressing and experimenting with perceptual strategies. The system allows an experimenter to describe basic perceptual concepts to a computer in terms of pictorial examples. The examples are designated graphically by encircling areas of a displayed scene with a cursor. A concept is represented internally by values of primitive feature-extraction operators that distinguish it from examples of previously defined concepts. Concepts so defined constitute a common vocabulary, shared by man and machine, that can be used symbolically in describing objects and specifying scene analysis procedures. The system bas been used to formulate interactively descriptions that distinguish objects in indoor room scenes and programs that locate these objects in images.
Algorithmic compositional methods and their role in genesis : a multi-functional real-time computer music system

Algorithmic procedures have been applied in computer music systems to generate compositional products using conventional musical formalism, extensions of such musical formalism and extra-musical disciplines such as mathematical models. This research investigates the applicability of such algorithmic methodologies for real-time musical composition, culminating in Genesis, a multi-functional real-time computer music system written for Mac OS X in the SuperCollider object-oriented programming language, and contained in the accompanying DVD. Through an extensive graphical user interface, Genesis offers musicians the opportunity to explore the application of the sonic features of real-time sound-objects to designated generative processes via different models of interaction such as unsupervised musical composition by Genesis and networked control of external Genesis instances. As a result of the applied interactive, generative and analytical methods, Genesis forms a unique compositional process, with a compositional product that reflects the character of its interactions between the sonic features of real-time sound-objects and its selected algorithmic procedures. Within this thesis, the technologies involved in algorithmic methodologies used for compositional processes, and the concepts that define their constructs are described, with consequent detailing of their selection and application in Genesis, with audio examples of algorithmic compositional methods demonstrated on the accompanying DVD. To demonstrate the real-time compositional abilities of Genesis, free explorations with instrumentalists, along with studio recordings of the compositional processes available in Genesis are presented in audiovisual examples contained in the accompanying DVD. The evaluation of the Genesis system’s capability to form a real-time compositional process, thereby maintaining real-time interaction between the sonic features of real-time sound objects and its selected algorithmic compositional methods, focuses on existing evaluation techniques founded in HCI and the qualitative issues such evaluation methods present. In terms of the compositional products generated by Genesis, the challenges in quantifying and qualifying its compositional outputs are identified, demonstrating the intricacies of assessing generative methods of compositional processes, and their impact on a resulting compositional product. The thesis concludes by considering further advances and applications of Genesis, and inviting further dissemination of the Genesis system and promotion of research into evaluative methods of generative techniques, with the hope that this may provide additional insight into the relative success of products generated by real-time algorithmic compositional processes.
ANALISIS KEBERHASILAN IMPLEMENTASI RAIL TICKET SYSTEM MENGGUNAKAN PENDEKATAN TECHNOLOGY ACCEPTANCE MODEL

Most topical issues in management of IS/IT is difficult to identify factors affecting the users to accepting new technology. Rail Ticket System is new online ticket booking which implemented by PT. KAI. Over time some of the people consider this system has not been optimal and effective. It is a challenge for PT. KAI to develop the RTS to be accepted and utilized for long time. Research model most commonly used to identify user acceptance is Technology Acceptance Model, by testing a model using Structural Equation Modeling. The research was done by distributing questionnaires to some people in Surabaya. The results showed that RTS can be received with value of the influence of perceived ease of use and perceived usefulness.
Topics in Nonlinear Time Series Analysis, with Implications for Eeg Analysis

This book provides a thorough review of a class of powerful algorithms for the numerical analysis of complex time series data which were obtained from dynamical systems. These algorithms are based on the concept of state space representations of the underlying dynamics, as introduced by nonlinear dynamics. In particular, current algorithms for state space reconstruction, correlation dimension estimation, testing for determinism and surrogate data testing are presented — algorithms which have been playing a central role in the investigation of deterministic chaos and related phenomena since 1980. Special emphasis is given to the much-disputed issue whether these algorithms can be successfully employed for the analysis of the human electroencephalogram.
Bioarcheological Report For the 2009 Amarna South Tombs Cemetery Skeletal Analysis

Analysis of the skeletal material recovered during the fifth excavation season of the Amarna South Tombs Cemetery was conducted from 13 May to 8 June 2009. The analysis was directed by Dr. Melissa Zabecki, Dr. Gretchen Dabbs, and Professor Jerry Rose, who were assisted by a team from the University of Arkansas including Amy Chancellor, Nicole Fumo, John Gorski, Jessica Kinsey, Sean Lee, Andrew LoPinto, Daniel Neubauer, Ronald Pursley, Brad Rega, William Schaffer, Bryony Simmons, and Blair Viguet.
Trade, Superstars, and Welfare

In recent decades, many countries experienced both a rise in top income shares and an increase of income inequality among the top earners. In this paper, I study the role of international trade as a catalyst for this development and analyze the associated welfare effects. I build a simple general equilibrium model that incorporates Lucas’ (1978) idea of individual heterogeneity regarding managerial talents into the framework of intra-industry trade with two symmetric countries. By scrutinizing effects of trade integration on entrepreneurial compensation and endogenous occupational decisions, this model can reproduce the observed pattern of income changes in the top percentiles. Despite positive joint welfare effects of trade liberalization, individual gains from trade may be non-monotonic in agents’ skills. While the welfare of workers and most productive entrepreneurs unambiguously rises, the least- and medium-productive entrepreneurs may be worse off, if their preferences for the traded goods are small enough.
The Instructional Functionality of Multiple Adjunct Aids.

Adjunct aids are instructional interventions inserted in textbooks in view of supporting learners to process the information. Different types of adjunct aids are assumed to support different cognitive processes. Research on adjunct aids has focussed on the learning effects of single types of adjunct aids. In this study, the learning effects of combinations of adjunct aids are studied. After completing a pre-test, 255 students studied a text presented on 21 separate computer screens in one of eight conditions. Their use of the adjunct aids was logged. After studying the text, a post-test was administered. Results show no impact of conditions on either knowledge or transfer items. However, when the use of the adjunct aids is considered, it is shown that this result can be explained by referring to the use of the aids at least for knowledge items.
Analyzing conceptual gains in introductory calculus with interactively-engaged teaching styles

This dissertation examines the relationship between an instructional style called Interactive-Engagement (IE) and gains on a measure of conceptual knowledge called the Calculus Concept Inventory (CCI). The data comes from two semesters of introductory calculus courses (Fall 2010 and Spring 2011), consisting of a total of 482 students from the first semester and 5 instructors from the second semester. The study involved the construction and development of a videocoding protocol to analyze the type of IE episodes which occurred during classes. The counts of these episodes were then studied along with student gains, measured in a number of different ways. These methods included a traditionally used measure of gain, called normalized gain, which is computed at the instructor level. Additionally, gains were further investigated by constructing hierarchical linear models (HLMs) which allowed us to consider individual student characteristics along with the measures of classroom interactivity. Another framework for computing ability estimates, called Item Response Theory (IRT), was used to compute gains, allowing us to determine whether the method of computing gains affected our conclusions. The initial investigation using instructor-level gain scores indicated that the total number of interactions in a classroom and a particular type of interaction called “encouraging revisions” were significantly associated with normalized gain scores. When individual-level gain scores were considered, however, these instructor-level variables were no longer significantly associated with gains unless a variable indicating whether a student had taken calculus or precalculus in high school or in college was included in the
Efficient Decoding of Variable Length Endoded Image Data on the Nios II Soft-Core Processor

The entropy coding of high peak, heavy-tailed probability distributions such as the Laplacian, Cauchy, and generalized Gaussian have been a topic of interest because they are able to provide good models for data in many coding systems, especially in image and video coding systems. This thesis studies the entropy coding of such high peak, heavy-tailed probability distributions. By summarizing the encoding of such distributions under the concept “Unary Prefixed Codes” (UPC), the thesis depicts the encoding via a different approach. By extending the concept of UPC, the thesis proposes a universally applicable coding algorithm “Unary Prefixed Huffman” (UPH) that could be applied to both finite and infinite sources. The code set resulting from the UPH algorithm has a coding efficiency which is upper-bounded by entropy + 2 given that the entropy is finite, and is able to provide sub-optimal encoding of the sources studied in the thesis. The thesis also proposes several different variations of UPCs that are simple in structure yet efficient for use for several variations of the high peak, heavy-tailed distributions that are commonly found in image and video coding systems. By applying the concept of the UPC, the thesis further proposes a coding method named the “Alternating Coding” (ALT) method. The ALT coding provides a coding pattern that is different from the conventional method which enables the extraction of special properties of the UPCs. Using the extraction of the special property of the UPCs, decoding could be greatly simplified and parallel decoding could be a possibility. Moreover, for the highly structured UPCs that are widely used in image and video coding systems, the ALT coding enables an error resiliency mechanism to be applied, which helps to improve the error tolerance of these UPC packets to a significant extent. Simulations and actual application results of the ALT coding are discussed in the thesis. By applying the ALT coding, the hardware architecture of the decoder changes accordingly. The ALT decoder is different to the conventional variable length decoders that have been applied in the decoding of UPCs, as it is able to utilize the special properties of the UPCs and thus simplify the decoder architecture. As shown in the thesis, the ALT decoders are smaller in size, faster in speed and consume much less power compared to the conventional decoders. This is particularly true for those highly structured UPCs that are commonly used in image and video coding systems. Actual realizations of several ALT decoders are discussed in the thesis, and comparisons are made to the conventional decoders. The improvements are shown to be very evident.
Spectroscopic Survey of Eclipsing Binaries with a Low-cost Echelle Spectrograph: Scientific Commissioning

We present scientific results obtained with a recently commissioned échelle spectrograph on the 0.5 m Solaris-1 telescope in the South African Astronomical Observatory. BACHES is a low-cost slit échelle spectrograph that has a resolution of 21,000 at 5500 Å. The described setup is fully remotely operated and partly automated. Custom hardware components have been designed to allow both spectroscopic and photometric observations. The setup is controlled via dedicated software. The throughput of the system allows us to obtain spectra with an average signal-to-noise ratio of 22 at 6375 Å for a 30 minute exposure of a V = 10 mag target. The stability of the instrument is influenced mainly by the ambient temperature changes. We have obtained radial velocity (RV) rms values for a bright (V = 5.9 mag) spectroscopic binary as good as 0.59 and 1.34 km s−1 for a V = 10.2 mag eclipsing binary. RV measurements have been combined with available photometric light curves. We present models of six eclipsing binary systems, and for previously known targets, we compare our results with those available in the literature. Masses of binary components have been determined with 3% errors for some targets. We confront our results with benchmark values based on measurements from the HARPS and UCLES spectrographs on 4 m class telescopes and find very good agreement. The described setup is very efficient and well suited for a spectroscopic survey. We can now spectroscopically characterize about 300 eclipsing binary stars per year up to 10.2 mag assuming typical weather conditions at SAAO without a single observing trip.
A Light-Weight Defect Detection System for Edge Computing

Recently, many factories have utilized AI to help Automatic Optical Inspection (AOI) machines accurately detect defects. They usually deploy AI models on the clouds and submit the data to the clouds for inference. However, transmission delay increases the response time of the AI model. If AI can differentiate defects on the local edge devices, the production efficiency can be significantly improved. In this paper, we propose a light-weight defect detection system that utilizes pruning techniques to compress the model and can accurately detect defects at a faster speed. Besides, we compare the performance of pruned and unpruned models on Kneron KL520 AI dongle and NVIDIA Jetson Nano to verify the superior ability of pruning to accelerate inference. The accuracy of the pruned model in the proposed system can reach 97.7% on Kneron KL520 AI dongle. The inference speed is 28.2 frames per second, 1.6 times faster than the unpruned model. Also, compared to NVIDIA Jetson Nano, the inference speed on Kneron KL520 AI dongle is two times faster. This result shows the better performance of Kneron KL520 AI dongle than NVIDIA Jetson Nano on inference. In summary, the proposed system can significantly improve the efficiency of production lines and avoid the information security risks brought by cloud computing.
A graph-based framework for comparing curricula

The problem addressed in this thesis was identified in a real life context in which an attempt was made to re-constitute a BSc Computer Science degree programme. The curriculum was modelled on the ACM/IEEE Computing Curriculum of 2001. It was further required to comply with accreditation requirements as defined by ABET’s Computing Accreditation Commission. Relying on a spreadsheet, the curriculum was iteratively and manually evaluated against the ACM/IEEE curriculum specification. A need was identified to automate or at least semi-automate this process. In this thesis a generalisation of the problem is presented. Curricula are modelled as directed graphs (digraphs) in which graph vertices represent curriculum elements such as topics, knowledge areas, knowledge units yearlevels or modules. Edges in the graph represent dependencies between these vertices such as belonging to grouping or pre-requisites. The task of curriculum comparison then abstracts to a task of digraph comparison. A framework, the Graph Comparison Framework, is proposed. The framework comprises of components which are used to guide the digraph comparison process. The so-called Graph Trans-morphism algorithm component is the only component in the framework which is mandatory. The algorithm converts the information from one of the digraphs being compared into the structure of the other. This conversion enables the graphs to be compared as graph isomorphisms. All digraphs are modelled as sets of triples, making it possible to subtract one digraph from another using the set minus operator. The resultant difference sets are used by components defined in the i © University of Pretoria framework to quantify and visualise the differences. By modelling curricula as digraphs and applying the framework to the digraphs, it is possible to compare curricula. This application of the framework to a real-world problem forms the applications research part of the thesis. In this part, domain knowledge of curriculum design is necessary to apply to the curriculum being developed in order to improve it. ACM