Miracle-dz/UniFAR-FTUs huggingface dataset:
Computing Tutte polynomials of contact networks in classrooms

Objective: The topological complexity of contact networks in classrooms and the potential transmission of an infectious disease were analyzed by sex and age. Methods: The Tutte polynomials, some topological properties and the number of spanning trees were used to algebraically compute the topological complexity. Computations were made with the Maple package GraphTheory. Published data of mutually reported social contacts within a classroom taken from primary school, consisting of children in the age ranges of 4–5, 7–8 and 10–11, were used. Results: The algebraic complexity of the Tutte polynomial and the probability of disease transmission increases with age. The contact networks are not bipartite graphs, gender segregation was observed especially in younger children. Conclusion: Tutte polynomials are tools to understand the topology of the contact networks and to derive numerical indexes of such topologies. It is possible to establish relationships between the Tutte polynomial of a given contact network and the potential transmission of an infectious disease within such network
COMPUTATIONAL THINKING TEST: DESIGN GUIDELINES AND CONTENT VALIDATION

We live in a society full of digital and programmable objects. In this context, being code-literate involves an inescapable requirement for any citizen of the XXI century. We believe that a person is code-literate when the ability to read and write in the language of computers and to think computationally has been developed. So it is not surprising that computational thinking (CT) is being located at the focus of educational innovation as a set of problem solving skills to be acquired by new generations of students. However, we still lack international consensus on a definition of CT, nor a clear idea of how to incorporate CT to our education systems at various levels. Similarly, there is a striking gap about how to measure and assess CT. In reply, this paper presents the design of a Computational Thinking Test aimed at Spanish students between 12 and 13 years old (grades K-7 & K-8): we describe the guidelines on which whole test and each of its items have been designed, as well as the content validation process through expert's judgment procedure. Through this process, the initial version of the test (40 items length) was depurated to a 28 items version, which is currently being applied to the target population. Finally, possible limitations of the test and possible concurrency of the same with other international evidence on computational thinking assessment are discussed.
DYNAMIC STRUCTURES IN RELATIONAL DATABASES

There is a set of problems in the development of applications for work with databases. The principal cause of these problems is in non-optimized SQL queries and stored procedures. To achieve good productivity, it is necessary to make SQL queries correctly, create (or delete) additional indexes, denormalize a database (in certain cases), shift a part of logic on triggers and stored procedures. It is necessary to maintain agreed algorithms structuring methods, structuring methods of data used in these algorithms and structuring methods (storage schemes construction) for these data in databases based on a relational model. This paper is devoted to generation and a manipulation data structures in relational databases whose components in programming languages are connected by explicit indexes. The author considers a specific, rather simple data structure. It is a linear unidirectional coherent list. Lists as trees are among the most basic data models used in computer programs. In a sense, lists are simple forms of trees because one can think of a list as a binary tree where every left child is a leaf. However, lists also present some aspects that are not special cases of what we have learned about trees. For instance, we shall talk about operations on lists such as pushing and popping that have no common analog for trees.
Powder diffraction study of Ba(NH4)4(PO3)6

The crystal structure of barium tetra­ammonium poly{hexa­kis[phosphate(V)]} was solved by direct methods from laboratory X-ray powder diffraction data collected at room temperature. The trigonal crystal structure is isostructural with BaCs4(PO3)6. The Ba2+ cation and one of the N atoms lie on a threefold axis, whereas all remaining non-H atoms are in general positions. The Ba2+ cation is bonded to nine O atoms from three polyphosphate chains to form a distorted tricapped trigonal prism as coordination polyhedron. Links between the polyphosphate chains and the Ba2+ ions result in a three-dimensional network, with tunnels and cavities filled by ammonium cations.
Handbook of Functional MRI Data Analysis: Visualizing, localizing, and reporting fMRI data

The dimensionality of fMRI data is so large that, in order to understand the data, it is necessary to use visualization tools that make it easier to see the larger patterns in the data. Parts of this chapter are adapted from Devlin & Poldrack (2007) and Poldrack (2007). Visualizing activation data It is most useful to visualize fMRI data using a tool that provides simultaneous viewing in all three canonical orientations at once (see Figure 10.1), which is available in all of the major analysis packages. Because we wish to view the activation data overlaid on brain anatomy, it is necessary to choose an anatomical image to serve as an underlay. This anatomical image should be as faithful as possible to the functional image being overlaid. When viewing an individual participant's activation, the most accurate representation is obtained by overlaying the statistical maps onto that individual's own anatomical scan coregistered to the functional data. When viewing activation from a group analysis, the underlay should reflect the anatomical variability in the group as well as the smoothing that has been applied to the fMRI data. Overlaying the activation on the anatomical image from a single subject, or on a single-subject image, implies a degree of anatomical precision that is not actually present in the functional data. Instead, the activation should be visualized on an average structural image from the group coregistered to the functional data, preferably after applying the same amount of spatial smoothing as was applied to the functional data.
Building knowledge systems in a-prolog

This work is written in the context of the logic-based approach to Artificial Intelligence (AI) proposed by John McCarthy in 1959 [134]. According to this approach an agent should have knowledge of its world and its goals, and the ability to use this knowledge to infer its course of action. This logic-based method suggests that a mathematical model of an agent should contain: a formal language capable of expressing commonsense knowledge about the world, a precise characterization of valid conclusions which can be derived from theories stated in this language, and a means which will allow the agent to arrive at these conclusions. The purpose of this dissertation is to investigate the applicability of one such language, A-Prolog [71, 73], for the development of medium-size knowledge-intensive systems. A-Prolog is a declarative logic programming language based on stable models/answer sets semantics of logic programs [74, 75]. It allows the representation of defaults and several interesting aspects of reasoning about actions and their effects. There is a recently developed methodology of representing knowledge in A-Prolog, and there are also rather efficient inference engines associated with the language. Our goal was to test this methodology and these inference engines on sizeable engineering applications. In this dissertation, we developed two such applications. The first is a small system, designed as a classroom tool for teaching digital circuits, which allows the functional and behavioral representation of these circuits at the gate-level of abstraction. The second is a substantially larger application—the implementation of a decision support system for the space shuttle's flight controllers. This work involved the representation of a substantial amount of knowledge about the shuttle as well as the execution of complex planning (and other reasoning) tasks. The project was successful, and the system is now in the hands of United Space Alliance (USA), the company responsible for overseeing the operation of the space shuttle. This dissertation describes the design and implementation of these systems and discusses some lessons derived from this experience. We believe that the lessons can be of interest to AI researchers working in the areas of knowledge representation, nonmonotonic reasoning, and planning, as well as to software engineers involved in the construction of knowledge-intensive systems.
Metaphors We Live By and its Czech translation

This master thesis deals with orientational metaphors in English and Czech. The first part provides the theoretical preliminaries of metaphor, the traditional approach and the conceptual metaphor theory are discussed. In the second part, the linguistic realizations of orientational metaphors, retrieved from Metaphors We Live By and its Czech translation Metafory, kterými žijeme, are analyzed in terms of what kind of morpheme and what part of speech expresses the UP or DOWN orientation. The third part shows the usage of the corpora in the translation of metaphorical expressions. The last part introduces new examples of orientational metaphors gained by an analysis of the collocations of the verbs fall, upadnout, upadat, padnout and padat with the help of the corpora.
Making sense of complexity : Dimensions for designing classroom inquiry activities

Recent developments in scientific research and educational technologies have radically changed the kinds of materials available for use in classrooms. Powerful computer tools like data visualizers, simulations, world wide web browsers and connectivity, and huge databases of information are increasingly being made available for use in instruction across the curriculum. These rich information resources hold the promise of opening up new possibilities for sophisticated student-directed inquiry on complex problems. Students can now find more information on a given topic or question, including up-to-date scientific findings and sophisticated data-generating environments, than they have ever had access to in traditional school libraries and textbooks -in some cases, without leaving the classroom. New education standards (NRC, 1993) call on us to take advantage of such tools to create student-directed inquiry situations, where students engage information in ways that map meaningfully to the work done by scientists.
Deciding on Optimum Set of Measures in Software Organizations

Software measurement process is a significant part of process improvement in software organizations. The organizations usually follow a measurement process that includes measures selection, data collection, and analysis to improve their processes. Most of the software organizations face difficulties in deciding the measures to collect since there is no universal set of measures for all types of organizations and projects. Experience shows that measurement can be more successful if the measures are collected based on the goals of the organization or the project which it will serve. A few methodologies exist to aid the software organizations. Goal Question Metric (GQM) is one of the most widely known and used one. However, one of the major constraints for the organizations is the associated cost when collecting the measures. Therefore, software organizations also require selecting the optimum set of measures which are good enough for the organization. This thesis study aims to provide solution for this problem. We propose a model, named ‗Optimum Measure Set Decision Model (OMSD)‘, which is an extension of GQM paradigm. The model is based on a heuristics approach, which aims to provide the optimum set of measures from a large number of possible measures. To develop the model, we identified the factors which are significant in selecting the optimum set of measures based on the literature survey results. Then, we evaluated those factors by conducting an empirical study. As the empirical research strategy, we used traditional fixed non-experimental design strategy. We performed a survey by distributing a structured questionnaire in order to evaluate the important factors we identified when selecting the optimum number of measures to be collected in an organization. We evaluated the heuristics rules by means of some sample cases we created. Moreover, we provided an idea for an alternative solution to optimize the number of measures to be collected for the future research.
An architecture for parallel multipliers

A novel architecture for parallel multipliers is proposed based on a previously published architecture that used five-counters as the basic building block. The architecture removes the redundancy associated with an incompletely spanned output range of the five-counter cell, by changing the building block to a two-bit full adder. This cell has the same number of inputs, but produces an output that completely spans the output dynamic range. It is shown that a dynamic logic implementation of the five-counter has a 46% hardware increase over the two-bit full adder cell proposed for this architecture. The resulting two-bit adder cell architecture shows an almost 50% decrease in silicon area and almost a 30% decrease in evaluation time compared to the five-counter cell architecture. <<ETX>>
Pengaruh Penambahan Serbuk Pegagan (Centella asiatica (L.) Urban) dengan Konsentrasi yang Berbeda Terhadap Sifat Fisik, Kimia, dan Organoleptik Crackers

ABSTRACT Intartia, Nuridatul. 2016. Pengaruh Penambahan Serbuk Pegagan (Centella asiatica (L.) Urban) dengan Konsentrasi yang Berbeda Terhadap Sifat Fisik, Kimia, dan Organoleptik Crackers. Skripsi, Jurusan Teknologi Industri, Fakultas Teknik, Universitas Negeri Malang. (I) Dr. Dra. Mazarina Devi, M.Si. (II) Laili Hidayati, S.Pd, M.Si Kata Kunci: pegagan, crackers, serbuk pegagan Pegagan merupakan tanaman herbal yang dapat meningkatkan kemampuan kognitif. Penelitian ini bertujuan untuk mengetahui kandungan kimia (protein, lemak, air, abu, karbohidrat, serat kasar, dan asam asiatik) serbuk pegagan, menganalisis kandungan kimia (protein, lemak, air, abu, karbohidrat, serat kasar, dan asam asiatik), sifat fisik (tekstur dan warna) dan sifat hedonik (warna, rasa, dan tekstur) crackers pegagan serta menentukan formula terbaik crackers pegagan. Penelitian yang dilakukan adalah penelitian eksperimen. Rancangan penelitian yang digunakan adalah Rancangan Acak Lengkap dengan konsentrasi penambahan serbuk pegagan dengan taraf 5%, 7,5%, dan 10%. Data yang diperoleh dianalisis menggunakan ANOVA. Apabila terdapat perbedaan dilanjutkan uji DMRT (Duncan Multiple Range Test). Perlakuan terbaik ditentukan menggunakan metode indeks efektivitas. Hasil penelitian menunjukkan bahwa serbuk pegagan mengandung protein 11,505%, lemak 0,450%, air 7,393%, abu 7,093%, karbohidrat 73,560%, serat kasar 13,829%, dan asam asiatik 187,017 mg/100 g. Formulasi crackers pegagan dengan penambahan berbeda menghasilkan kandungan protein, air, abu, karbohidrat, serat kasar, asam asiatik, sifat fisik (tekstur dan warna), dan sifat hedonik (warna, rasa, dan tekstur) yang berbeda, tetapi tidak berbeda terhadap kandungan lemak. Formula terbaik dengan skor 143,571 diperoleh dari crackers pegagan penambahan serbuk pegagan 5%. Kandungan kimia yang diperoleh yaitu protein 6,182%, lemak 17,513%, abu 0,995%, air 0,997%, karbohidrat 74,363%, serat kasar 1,07I%, dan asam asiatik 2,102 mg/100g. Sifat fisik yang diperoleh yaitu tingkat kecerahan (L) 76,46, tingkat kehijauan (a-) 14,30, tingkat kekuningan (b+) 82,10, dan tekstur 0,0170 N/m2. Tingkat kesukaaan terhadap rasa dengan skor 4,24 (suka), tingkat kesukaaan terhadap tekstur dengan skor 4,48 (suka), dan tingkat kesukaaan terhadap warna dengan skor 4,62 (suka). Normal 0 false false false EN-US X-NONE X-NONE /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-qformat:yes; mso-style-parent:""; mso-padding-alt:0in 5.4pt 0in 5.4pt; mso-para-margin:0in; mso-para-margin-bottom:. 0001pt; mso-pagination:widow-orphan; font-size:11.0pt; font-family:"Calibri","sans-serif"; mso-ascii-font-family:Calibri; mso-ascii-theme-font:minor-latin; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast; mso-hansi-font-family:Calibri; mso-hansi-theme-font:minor-latin; mso-bidi-font-family:"Times New Roman"; mso-bidi-theme-font:minor-bidi;}
A RELIABILITY-BASED ROUTING PROTOCOL FOR VEHICULAR AD-HOC NETWORKS

OF THESIS A RELIABILITY-BASED ROUTING PROTOCOL FOR VEHICULAR AD-HOC NETWORKS Vehicular Ad hoc NETworks (VANETs), an emerging technology, would allow vehicles to form a self-organized network without the aid of a permanent infrastructure. As a prerequisite to communication in VANETs, an efficient route between communicating nodes in the network must be established, and the routing protocol must adapt to the rapidly changing topology of vehicles in motion. This is one of the goals of VANET routing protocols. In this thesis, we present an efficient routing protocol for VANETs, called the Reliable Inter-VEhicular Routing (RIVER) protocol. RIVER utilizes an undirected graph that represents the surrounding street layout where the vertices of the graph are points at which streets curve or intersect, and the graph edges represent the street segments between those vertices. Unlike existing protocols, RIVER performs real-time, active traffic monitoring and uses this data and other data gathered through passive mechanisms to assign a reliability rating to each street edge. The protocol then uses these reliability ratings to select the most reliable route. Control messages are used to identify a node’s neighbors, determine the reliability of street edges, and to share street edge reliability information with other nodes.
Rancang Bangun Aplikasi Web Scraping Untuk Korpus Paralel Indonesia - Inggris Dengan Metode HTML DOM

Abstrak - Korpus paralel merupakan dua dokumen text yangsaling berhubungan dimana dokumen text pertama berisikumpulan kalimat sumber dan dokumen kedua berisi kumpulankalimat terjemahan. Korpus paralel berfungsi sebagai sumberutama dalam mengembangkan mesin penerjemah statistik.Pengumpulan korpus paralel secara manual memerlukan waktuyang lama dan biaya yang tidak sedikit. Web scraping adalahsuatu teknik penggalian informasi dari situs web. Pembuatanaplikasi web scraping dapat dikombinasikan dengan berbagaimetode, dalam penelitian ini metode yang digunakan adalahHTML DOM. Sistem ini dibangun untuk mengumpulkan korpusparalel Bahasa Indonesia dan Inggris. Pengujian dari aplikasi iniadalah menggunakan metode blackbox, serta beberaparangkaian pengujian secara manual untuk mengetahui tingkatkeberhasilan aplikasi ini dalam mengumpulkan data korpusparalel dan kecepatan sistem dalam mengumpulkan korpusparalel. Hasil implementasi dan pengujian akhir dari aplikasiweb scraping dengan metode HTML DOM adalah proses yangberjalan dalam aplikasi web scraping dengan metode HTMLDOM adalah proses scraping, tokenisasi, cleaning, danlowercased, semua proses tersebut berjalan secara otomatissehingga sangat menghemat waktu dan biaya dan menghasilkankorpus paralel Bahasa Indonesia dan Inggris.Kata kunci : Web Scraping, HTML DOM, Korpus Paralel,Tokenisasi, Mesin Penerjemah Statistik
A robust horizontal LOS rate estimator for 2-axes gimballed seeker

In this paper, a robust horizontal LOS (line-of-sight) rate estimator for sea skimming anti-ship missile is proposed. A exact LOS rate dynamics model for two-axes gimballed seeker is derived in homing geometry. A new LOS rate estimator is designed by applying a robust Kalman filter to the LOS rate dynamics model. The proposed filter takes into account roll motions and detection gain uncertainties. Simulation results show that the proposed filter performs very well and guarantees the robustness against parameter uncertainties.
Random Generation of Response Patterns under Computerized Adaptive Testing with the R Package catR

This paper outlines a computerized adaptive testing (CAT) framework and presents an R package for the simulation of response patterns under CAT procedures. This package, called catR, requires a bank of items, previously calibrated according to the four-parameter logistic (4PL) model or any simpler logistic model. The package proposes several methods to select the early test items, several methods for next item selection, different estimators of ability (maximum likelihood, Bayes modal, expected a posteriori, weighted likelihood), and three stopping rules (based on the test length, the precision of ability estimates or the classification of the examinee). After a short description of the different steps of a CAT process, the commands and options of the catR package are presented and practically illustrated.
Profiling university students' use of technology: where is the NET generation divide?

The paper presents work from a longitudinal study on how first year students from the Net Generation use ICT tools. Using factor analysis, the research found that students can be categorized into clusters based on whether they were using web 2.0 tools (web interactive), audio and video editing tools (technical-oriented), social networking tools (social interactive), gaming consoles (game-oriented) and online resources or word processing/presentation software tools (work-oriented). Young students within the Net Generation were highly social interactive whilst distance-learning students were less social interactive. International students were mainly found to be web-interactive with a growing social interaction over the course of their first year. The research supports the argument that there is no single Net Generation with common characteristics. It suggests that age is the most significant variable with gender, mode of study and the national origin of students all playing a role in patterning students’ engagement with new technologies.
NEURAL NETWORK FILTRATION FOR ARC FAULTS LOCATION ON POWER TRANSMISSION LINES

This paper presents filtration using neural network for arc fault location, which allows to determine the distance to a fault, as a result of considering natural fault loops. It is assumed that three-phase voltages and currents from both ends of the line are the input signals of the fault locator and naturally of the neutral network applied for filtering the input signals. In addition to natural fault loop signals also use of symmetrical components (positive and negative or incremental positive sequence components) to fault location were considered as well. Results of evaluation study have been included, analyzed and discussed. Influence of filtration has been also considered.
Object Analysis with Visual Sensors and RFID

Object analysis using visual sensors is one of the most important and challenging issues in computer vision research due principally to difficulties in object representation, segmentation and recognition within a general framework. This has motivated researchers to investigate exploiting the potential identification capability of RFID (radio frequency identification) technology for object analysis. RFID however, has a number of fundamental limitations including a short sensing range, missing tag detection, not working for all objects and some items being just too small to be tagged. This has meant applying RFID alone has not been entirely effective in computer vision applications. To address these restrictions, object analysis approaches based on a combination of visual sensors and RFID have recently been successfully introduced. This chapter presents a contemporary review on these object analysis techniques for localization, tracking, and object and activity recognition, together with some future research directions in this burgeoning field.