Miracle-dz/UniFAR-FTUs huggingface dataset:
Understanding Delta-Sigma Data Converters

Chapter 1: Introduction.Chapter 2: The first-order delta-sigma modulator.Chapter 3: The second-order delta-sigma modulator.Chapter 4: Higher-order delta-sigma modulation.Chapter 5: Bandpass and quadrature delta-sigma modulation.Chapter 6: Implementation considerations for [Delta][Sigma] ADCs.Chapter 7: Delta-sigma DACs.Chapter 8: High-level design and simulation.Chapter 9: Example modulator systems.Appendix A: Spectral estimation.Appendix B: The delta-sigma toolbox.Appendix C: Noise in switched-capacitor delta-sigma data converters.
How Information Visualization Systems Change Users' Understandings of Complex Data.

How Information Visualization Systems Change Users’ Understandings of Complex Data Kenneth Robert Allendoerfer Chaomei Chen, Ph.D. User-centered evaluations of information systems often focus on the usability of the system rather its usefulness. This study examined how a using an interactive knowledge-domain visualization (KDV) system affected users’ understanding of a domain. Interactive KDVs allow users to create graphical representations of domains that depict important papers, authors, or terms. Interactive KDVs have several potential advantages over other presentation methods, such as making connections explicit, and the ability for users to see the overall structure of the domain. The project examined CiteSpace, an interactive KDV that uses article cocitation analysis and text analysis to create visualizations of important papers and terms in a domain. In this study, participants completed several tasks related to the field of artificial intelligence. Depending on the experimental condition, participants read a review article about the domain, interacted with a CiteSpace visualization containing equivalent information, or both. Participants who neither read the article nor used the KDV system served as a baseline. The
Notes on implementation of sparsely distributed memory

The Sparsely Distributed Memory (SDM) developed by Kanerva is an unconventional memory design with very interesting and desirable properties. The memory works in a manner that is closely related to modern theories of human memory. The SDM model is discussed in terms of its implementation in hardware. Two appendices discuss the unconventional approaches of the SDM: Appendix A treats a resistive circuit for fast, parallel address decoding; and Appendix B treats a systolic array for high throughput read and write operations.
Okul Web Sitesi Yönetim Paneli (MebWeb) Sisteminin Kullanılabilirlik Değerlendirmesi: Tasarım Rehberleri Temelli Kullanılabilirlik

Milli Egitim Bakanligi’na (MEB) bagli tum kurumlarin kurumsallasmasi amaciyla 2012 yilinda Bilgi Islem Grup Baskanligi tarafindan “Okul Web Sitesi Yonetim Paneli” isimli bir proje gerceklestirilmistir. Bu proje ile MEB’e bagli tum kurumlara ait web sitelerin ortak bir ara yuze sahip olmasi saglanmistir. Boylelikle web sitesinden sorumlu kisilerin ve kullanicilarin islemlerini daha kolay ve guvenilir bir sekilde gerceklestirmelerine olanak sunulmustur. Oldukca buyuk bir kitleye hitap eden “Okul Web Sitesi Yonetim Paneli” (MebWeb) projesinin hedef kitlesi tarafindan kolay bir bicimde kullanilmasi gerekmektedir. Bu arastirmanin amaci “Okul Web Sitesi Yonetim Paneli” projesini rehber temelli kullanilabilirlik yaklasimi ile degerlendirmektir. Degerlendirme islemi icin ise TUBITAK BILGEM Yazilim Teknolojileri Arastirma Enstitusu (YTE) tarafindan gelistirilen Kamu Internet Siteleri Rehberi’nde (KAMIS) yer alan TS EN ISO 9241-151 kontrol listesi sablonundan yararlanilmistir. Şablondan elde edilen verilerin analizi nitel arastirma tekniklerinden biri olan icerik analizi ile degerlendirilmistir. Yapilan degerlendirmeler projenin genel olarak kullanilabilir bir yapiya sahip oldugunu gostermektedir.
The Functional Abstract Machine

The Functional Abstract Machine (Fam) is a stack machine designed to support functional languages on large address space computers. It can be considered a SECD machine [1] which has been optimized to allow very fast function application and the use of true stacks (as opposed to linked lists). The machine qualifies to be called functional because it supports functional objects (closures, which are dynamically allocated and garbage collected), and aims to make function application as fast as, say, taking the head of a list. All the optimization and support techniques which make application slower are strictly avoided, while tail recursion and pattern-matching calls are supported. Restricted side effects and arrays are provided, but they are less efficient than one might expect. Moreover the performance of the proposed garbage collector deteriorates in the presence of large numbers of updatable objects. The machine is intended to make compilation from high level languages easy and regular, by providing a rich and powerful set of operations and an open-ended collection of data types. This richness of types can also facilitate portability, because every type can be independently implemented in different ways. However the number of machine instructions tends to be high, and in general there is little concern for minimality. The instructions of the machine are not supposed to be interpreted, but assembled into machine code and then executed. This explains why no optimized special-case operations are provided; special cases can be easily detected at assembly time. For efficiency considerations, the abstract machine is not supposed to perform runtime type checking (even if a hardware implementation of it might), and hence it is not type-safe. Moreover, as a matter of principle, there is no primitive to test the type of an object; the correct application of machine operations should be guaranteed by typechecking in the source language. Where needed, the effect of run-time typechecking can be achieved by the use of variant (i.e. tagged) data types.
Roth-Karp decomposition of large boolean functions with application to logic design

Functional decomposition aims at finding efficient representations for Boolean functions. It is used in many applications, including multi-level logic synthesis, formal verification, and testing. This dissertation presents novel heuristic algorithms for functional decomposition. These algorithms take advantage of suitable representations of the Boolean functions in order to be efficient. The first two algorithms compute simple-disjoint and disjoint-support decompositions. They are based on representing the target function by a Reduced Ordered Binary Decision Diagram (BDD). Unlike other BDD-based algorithms, the presented ones can deal with larger target functions and produce more decompositions without requiring expensive manipulations of the representation, particularly BDD reordering. The third algorithm also finds disjoint-support decompositions, but it is based on a technique which integrates circuit graph analysis and BDD-based decomposition. The combination of the two approaches results in an algorithm which is more robust than a purely BDD-based one, and that improves both the quality of the results and the running time. The fourth algorithm uses circuit graph analysis to obtain non-disjoint decompositions. We show that the problem of computing non-disjoint decompositions can be reduced to the problem of computing multiple-vertex dominators. We also prove that multiple-vertex dominators can be found in polynomial time. This result is important because there is no known polynomial time algorithm for computing all non-disjoint decompositions of a Boolean function. The fifth algorithm provides an efficient means to decompose a function at the circuit graph level, by using information derived from a BDD representation. This is done without the expensive circuit re-synthesis normally associated with BDD-based decomposition approaches. Finally we present two publications that resulted from the many detours we have taken along the winding path of our research.
Dynamic Modeling, Predictive Control and Performance Monitoring: A Data-driven Subspace Approach

I Dynamic Modeling through Subspace Identification. - System Identification: Conventional Approach. - Open-loop Subspace Identification. - Closed-loop Subspace Identification. - Identification of Dynamic Matrix and Noise Model Using Closed-loop Data. - II Predictive Control. - Model Predictive Control: Conventional Approach. - Data-driven Subspace Approach to Predictive Control. - III Control Performance Monitoring. - Control Loop Performance Assessment: Conventional Approach. - State-of-the-art MPC Performance Monitoring. - Subspace Approach to MIMO Feedback Control Performance Assessment. - Prediction Error Approach to Feedback Control Performance Assessment. - Performance Assessment with LQG-benchmark from Closed-loop Data.
COMPLEMENTARY APPROACHES TO CREW SCHEDULING. FROM THE BOOK COMPUTER SCHEDULING OF PUBLIC TRANSPORT 2

Two programs for bus crew scheduling are described. One is fully automatic, is based on a mathematical programming formulation, and is about to be adopted by a major transport undertaking. The other is interactive, incorporating heuristics developed in an earlier automatic program, and is currently undergoing trials with a number of organizations. The background to these complementary developments is outlined, and each of the programs is described.
Auto-tunable GPU BLAS

OpenCL is fast becoming the preferred framework used to make programs for heterogeneous platforms consisting of at least one CPU and one or more accelerators. The GPU being readily available in almost all computers, it is the most common accelerator in use. Good libraries are important to reduce development time and to make particular development environments, such as OpenCL, useful for the masses. All OpenCL programs can execute on any device that have support for it, however to achieve optimal performance, a OpenCL program must be optimized for a specific device. Auto-tuning is a strategy to automatically generate and find a good performing program for a specific device, without requiring the user to perform optimizations manually. BLAS contains routines that are useful for many algorithms suited for GPUs, and is a good candidate for a library that can prove useful for many OpenCL programmers. We have chosen, in this thesis, to implement the matrix multiplication routine from BLAS as it is important for the performance of many higher-level linear algebra algorithms to have a fast implementation of matrix multiplication. The exact operation we have implemented is $C = alpha * A * B + beta * C$, were A, B and C are MxK, KxN and MxN matrices respectively. In this thesis, we implement an auto-tuning framework that generates source code for OpenCL kernels and find the best one for the device it is being executed on. We compare our version with ViennaCL, a OpenCL BLAS library, and the vendor provided BLAS libraries provided by AMD and NVIDIA. Our version provides approximately 85% of the performance of the vendor specific library provided by NVIDIA, in general, and gives a speedup over the native library provided by AMD. This speedup is usually between 1.5 and 2. On both platforms our version outperforms ViennaCL by a large margin.
THE CARNEGIE SUPERNOVA PROJECT: ANALYSIS OF THE FIRST SAMPLE OF LOW-REDSHIFT TYPE-Ia SUPERNOVAE

An analysis of the first set of low-redshift (z < 0.08) Type Ia supernovae (SNe Ia) monitored by the Carnegie Supernova Project between 2004 and 2006 is presented. The data consist of well-sampled, high-precision optical (ugriBV) and near-infrared (NIR; YJHKs) light curves in a well-understood photometric system. Methods are described for deriving light-curve parameters, and for building template light curves which are used to fit SN Ia data in the ugriBVYJH bands. The intrinsic colors at maximum light are calibrated using a subsample of supernovae (SNe) assumed to have suffered little or no reddening, enabling color excesses to be estimated for the full sample. The optical–NIR color excesses allow the properties of the reddening law in the host galaxies to be studied. A low average value of the total-to-selective absorption coefficient, RV ≈ 1.7, is derived when using the entire sample of SNe. However, when the two highly reddened SNe (SN 2005A and SN 2006X) in the sample are excluded, a value RV ≈ 3.2 is obtained, similar to the standard value for the Galaxy. The red colors of these two events are well matched by a model where multiple scattering of photons by circumstellar dust steepens the effective extinction law. The absolute peak magnitudes of the SNe are studied in all bands using a two-parameter linear fit to the decline rates and the colors at maximum light, or alternatively, the color excesses. In both cases, similar results are obtained with dispersions in absolute magnitudes of 0.12–0.16 mag, depending on the specific filter–color combination. In contrast to the results obtained from the comparison of the color excesses, these fits of absolute magnitude give RV≈ 1–2 when the dispersion is minimized, even when the two highly reddened SNe are excluded. This discrepancy suggests that, beyond the “normal” interstellar reddening produced in the host galaxies, there is an intrinsic dispersion in the colors of SNe Ia which is correlated with luminosity but independent of the decline rate. Finally, a Hubble diagram for the best-observed subsample of SNe is produced by combining the results of the fits of absolute magnitude versus decline rate and color excess for each filter. The resulting scatter of 0.12 mag appears to be limited by the peculiar velocities of the host galaxies as evidenced by the strong correlation between the distance-modulus residuals observed in the individual filters. The implication is that the actual precision of SNe Ia distances is 3%–4%.
Extensible records without subsumption

This research was sponsored by the Defense Advanced Research Projects Agency ( D O D ) and the Office of Naval Research under Contract N00014-84-K-0415. T h e views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Defense Advanced Research Projects Agencv or the U.S . government Subject classification keywords: F.4. 1 Lambda calculus and related systems D.3. 1 Language Theory. Programming F.3. 3 Type structure D.3. 3 Da ta types and structures Records
Triage Visualization for Digital Media Exploitation

Abstract : Digital forensic examiners are overwhelmed by case loads and data volumes and must prioritize their work. This thesis hypothesis that digital forensic examiners can employ triage visualizations to prioritize work loads. This thesis presents a simple one page visualization of disk activity for Windows FAT and NTFS filesystems. The visualization is constructed from filesystem meta data carved by the open source bulk_extractor digital forensics application. The visualization does not require further examination or reconstruction of file system metadata. The visualization is able to detect minor obfuscation or modification and overwriting of file system timestamps.
Crystal Reports 9 on Oracle

1: Connectivity, Authentication, and Privileges 2: Oracle Structures 3: Oracle SQL 4: Oracle Advanced SELECT Options 5: PL/SQL 6: Optimizing: The Crystal Reports Side 7: Optimizing: The Oracle Side 8: Optimizing: Reducing Parses 9: Other Tips 10: Data Dictionary Report 11: The Crystal Repository Appendix A: Common Issues Appendix B: Functions
Musculoskeletal modeling of cerebral palsy children

The analysis of pathological gait using musculoskeletal modeling is a promising approach to qualify and quantify the pathology as well as to monitor the potential recovery after therapy. When dealing with cerebral palsy, its specific neurological disorders and consequently bones deformities, specific-subject musculoskeletal models has been developed. The imaging techniques are still unaffordable in clinical practises. So, using the LifeMod software, we aimed to develop musculoskeletal model in a retrospective study to evaluate the accuracy of surgical treatments on cerebral palsy. Two principles studies are performed. First, relying on the accuracy of a rescaled generic adult skeleton, the musculoskeletal modeling limitation have been determined when applying normal gait and pathological crouch and jump postures, imitated by healthy adults and children. Second, calibration technique had been developed to refine the model’s parameters based on data collectid from the subject. Results from musculoskeletal modeling are compared to gait analysis date. As results, even if the model outputs gave correct results with healthy adults, the standard rescaled musculoskeletal modeling showed limits on predicted kinematics and muscle forces for healthy and CP children. The refinement of subject-specific joint parameters and driving the model with the experimental GRF data have a huge influence in model outputs and improve quantitatively the predicted muscle activations and forces. This work pointed out that the parameters of a rescaled generic musculoskeletal moded can be refined and personalized to improve model’s outcomes. It may represent a new perspective in clinical applications.
Phonetic cues and phonological constraints in prosodic unit definition: evidence for the intermediate phrase in French

The two experiments reported here support an analysis based on constraints which reflect the syntax-prosody interface. This analysis proves that the Intermediate Phrase (ip) exists in French. The ip is ranked higher than the Accentual Phrase and smaller than the Intonation Phrase in the prosodic hierarchy and it is not restricted to specific syntactic marked constructions as it was previously proposed. We predict that the interaction of (i) a syntactic constraint (ALIGN-XP,R, ip, R) which align the right edge of a maximal projection with the right edge of an ip with (ii) a phonological constraint (MIN-BIN) stating that non final ip consists of minimally two APs, conspires to place an ip-boundary in French. An interesting interplay of duration and pitch height is responsible for signaling the boundary.
Integrity Analysis and Coercion in Distributed Systems

This thesis presents a new approach to modelling the security and integrity of data in distributed and ad-hoc networks of processes. An annotated type based analysis is introduced which ensures that no contamination will occur between data considered trustworthy and data that may have been corrupted. A method of performing safe run-time coercion of security properties of data is also presented. This is novel because it enables users to perform run-time coercions of data in a manner that may be statically proven safe. Both plain networks and dynamic (agent-based) networks are considered. These are modelled as systems of first-order and higher-order pi-calculus, respectively. The higher-order system examined introduces a new notion of trustworthiness dependent on the context in which it is typed or executed. This allows programs with malicious intent to be safely executed when it can be demonstrated that no possibility for interaction with other programs, including the host, is possible. A concept of execution context is introduced to perform this analysis. In addition, annotated type systems with and without sub-typing are described, and sub ject reduction is shown to hold for all systems considered. Implementation of the method is demonstrated via type-inference algorithms, and these are shown to be both sound and complete for all systems.
A Study of the Intention of Tourists Who Visiting Sanyi Painting

For understanding the intention of tourists who visit Sanyi painting, this research applies the theory of planned behavior to study the tourists’ intentions and opinions. The questionnaire was distributed and collected in front of the Sanyi Painting Ladder. The results indicate that the tourists’ attitudes, subjective norms, and perceived behavioral control had positive effect on their intention respectively. Attitudes have the most significant impact on intention. The construct of attitudes and perceived behavior control have partial mediation effect on the subjective norms to the intention. According to semi-structure questions result, increasing painting areas and to repairing the picture could help with sustainable tourism development of the community.
To Teach a Social Studies Concept--Chunk It!

”I don’t know why they couldn’t answer the questions. We covered the subject in our social studies class. Besides, all the answers are in the textbook! ” Has such a thought ever passed through your mind as you looked with dismay at your class’ test results? Unfortunately, this kind of reaction is common to the social studies teacher in our nation’s classrooms. Difficulties in learning to read in content area subjects tend to baffle the teacher and present obstacles to the learner. All this can be overcome by a strategy which is based on knowledge of how a student learns to read fluently. One solution to the problem is derived from research findings in the fields of memory processing and reading (Adams, 1967; Smith, 1971, 1975; Wilson, 1966). From memory processing, we will borrow a principle known as chunking and adapt it to the aim of reading, that is, to get meaning from written language. TO TEACH A SOCIAL STUDIES CONCEPT-CHUNK IT! Esther P. Volentine and Olive R. Francks
CRAMm — Memories for Everyday Robotic Manipulation Activities

Agents that learn from experience can profit immensely from memorizing what they have done, why, how, and what happened. For autonomous robots performing complex manipulation tasks, these memories include low level data, such as perceptual snapshots of relevant scenes that influenced decision making, detailed complex motions the robot performed, and effects of these motions. They also include high level representations of the intended actions and the belief-dependent descisions that led to the chosen course of action. In this paper, we present CRAMm, a memory management system that records very comprehensive and informative memories without slowing down the operation of the robot. CRAMm offers a query interface that lets the robot retrieve the kinds of information stated above. This is done using a first-order logical language that provides predicates concerning the beliefs and intentions of the robot, its physical state, perceptual information, and action effects, as well as their relations at different levels of abstraction.
Relación entre la calidad de vida y el perfil lipídico en pacientes Diabéticos con exceso de peso de la Casa del Diabético Tena 2017.

El objetivo de la investigacion fue determinar la relacion entre Calidad de vida y Perfil lipidico en pacientes Diabeticos con exceso de peso de la Casa del Diabetico Tena 2017. La poblacion estuvo conformada por 65 pacientes Diabeticos con Indice de masa corporal (IMC) > a 25 Kg/m2 con edades de 18 a 65 anos que acudian a consulta externa a esta casa de salud. En el estudio se observo que la calidad de vida influye sobre el perfil lipidico, encontrandose en sujetos con mayor calidad de vida trigliceridos con valores (221,87+147,9) y lipoproteina de alta densidad (HDL) con valores (38,00+14,99), asi como en sujetos con menor calidad de vida trigliceridos con valores (156,80+38,59) y lipoproteina de alta densidad (HDL) con valores (38,50+9,30). En donde las anormalidades lipidicas en el grupo de menor calidad de vida fueron mas bajas en relacion a los de mayor calidad de vida. Entre las variables que se relacionan para observar estos resultados estan, Indice de masa corporal (IMC), edad del sujeto y tiempo de debutacion de la enfermedad. Los resultados obtenidos son de gran importancia ya que a traves de esta investigacion se brinda informacion para la implementacion a futuro de programas que promuevan y vigilen el mejoramiento de la calidad de vida en aquellas personas que presentan Diabetes.