Miracle-dz/UniFAR-FTUs huggingface dataset:
Teachersâ€™ Problems and Solutions in Implementing Curriculum 2013

Curriculum 2013 as an effort to reform educational system. However, the Curriculum demands teacher and school to be skilled and trained and because of this, in implementing School Based Curriculum teachers deal with some problems. Thus, this study aims to find out the problems faced by the English teacher in implementing Curriculum 2013 and their solution to overcome those problems. With regard to the purpose of the research, a qualitative approach was employed. The data were obtained through observation, questionnaires and documents. The data were transcribed, categorized, and interpreted to answer the research questions. The respondents of this study were three English teachers of three high school in Batujajar. The result of the study showed that dealing with the the implementation of Curriculum 2013 the teachers had the problem related to three aspects namely: problems related to teaching and learning process, problems related to creating lesson plan, and problems related with teaching material. It was also revealed that the respondents do some efforts to overcome those problems such as maximizing the provided facilities, cooperating with others teachers, getting involved in workshop or MGMP,searching the example of lesson plan from internet, reading the various sources, copying and using lesson plan from the other schools, download E book, asking for friend to send E book through email and using the previous book. Â Key Words: Curriculum 2013, Problem and Solution
Evolución paralela de los lenguajes documentales y la terminología

Terminology and Information Science are related from the common perspective of being useful to the representation of scientific concepts. Mainly the evolution of both disciplines is analyzed as well as the basic scientific theory of positivist origin. Likewise the evolution after the II World War is considered, besides the parallelism between the information retrieval and the terminology, in special by means of the contributions of Cutter, Dewey, Lafontaine and Otlet, and Bush. It is pointed out the function of the terminology in the new indexing languages: automatic thesauri and Topic maps.
Towards a Historical Notion of ‘Turing—the Father of Computer Science’

In the popular imagination, the relevance of Turing's theoretical ideas to people producing actual machines was significant and appreciated by everybody involved in computing from the moment he published his 1936 paper ‘On Computable Numbers’. Careful historians are aware that this popular conception is deeply misleading. We know from previous work by Campbell-Kelly, Aspray, Akera, Olley, Priestley, Daylight, Mounier-Kuhn, Haigh, and others that several computing pioneers, including Aiken, Eckert, Mauchly, and Zuse, did not depend on (let alone were they aware of) Turing's 1936 universal-machine concept. Furthermore, it is not clear whether any substance in von Neumann's celebrated 1945 ‘First Draft Report on the EDVAC’ is influenced in any identifiable way by Turing's work. This raises the questions: (i) When does Turing enter the field? (ii) Why did the Association for Computing Machinery (ACM) honor Turing by associating his name to ACM's most prestigious award, the Turing Award? Previous authors have been rather vague about these questions, suggesting some date between 1950 and the early 1960s as the point at which Turing is retroactively integrated into the foundations of computing and associating him in some way with the movement to develop something that people call computer science. In this paper, based on detailed examination of hitherto overlooked primary sources, attempts are made to reconstruct networks of scholars and ideas prevalent in the 1950s, and to identify a specific group of actors interested in theorizing about computations in computers and attracted to the idea of language as a frame in which to understand computation. By going back to Turing's 1936 paper and, more importantly, to re-cast versions of Turing's work published during the 1950s (Rosenbloom, Kleene, Markov), I identify the factors that made this group of scholars particularly interested in Turing's work and provided the original vector by which Turing became to be appreciated in retrospect as the father of computer science.
Extendable pattern-oriented optimization directives

Algorithm-specific, that is, semantic-specific optimizations have been observed to bring significant performance gains, especially for a diverse set of multi/many-core architectures. However, current programming models and compiler technologies for the state-of-the-art architectures do not exploit well these performance opportunities. In this article, we propose a pattern-making methodology that enables algorithm-specific optimizations to be encapsulated into “optimization patterns”. Such optimization patterns are expressed in terms of preprocessor directives so that simple annotations can result in significant performance improvements. To validate this new methodology, a framework, named EPOD, is developed to map these directives into the underlying optimization schemes for a particular architecture. It is difficult to create an exact performance model to determine an optimal or near-optimal optimization scheme (including which optimizations to apply and in which order) for a specific application, due to the complexity of applications and architectures. However, it is trackable to build individual optimization components and let compiler developers synthesize an optimization scheme from these components. Therefore, our EPOD framework provides an Optimization Programming Interface (OPI) for compiler developers to define new optimization schemes. Thus, new patterns can be integrated into EPOD in a flexible manner. We have identified and implemented a number of optimization patterns for three representative computer platforms. Our experimental results show that a pattern-guided compiler can outperform the state-of-the-art compilers and even achieve performance as competitive as hand-tuned code. Therefore, such a pattern-making methodology represents an encouraging direction for domain experts' experience and knowledge to be integrated into general-purpose compilers.
An Out-of-Core Dataflow Middleware Applied to Spare Linear Algebra

Many applications in scientific computing require a tremendous amount of data, running on thousands of computing nodes so as to ensure all the data fits in the main memory of the distributed machine. However, for some irregular applications, like sparse linear solvers, running on thousands of nodes typically do not achieve high efficiency, leading to a significant waste of computing time. Out-ofcore computing allows using hard drives to store the state of the application. In this paper, we propose to build a task-based out-of-core programming model based on the filter stream programming model. Coupling a distributed storage system with a data-aware scheduler allows achieving communication and computation overlapping as well as a reutilization. Experiments on an in-house cluster equipped with regular hard drive indicates that using a single SSD drive per node should be enough to reach equivalent computation time usage between in-core and out-of-core computations, while a RAID SSD configuration will achieve higher efficiency in out-of-core mode.
New methodologies and techniques for evaluating user performance in advanced 3D virtual interfaces

The trend in computer interfaces is rapidly moving towards non-physical virtual interfaces. Virtual interfaces are highly interactive and promote a degree of presence or a sense of being in the virtual environment. This means that users should experience a higher situation awareness, particularly where a spatially immersive environment is used. This brings with it exciting possibilities for providing intuitive and flexible interaction with advanced computer systems. Developers of these new style interfaces frequently make claims that virtual interfaces are much better than more conventional interfaces. However, the development of virtual interfaces is still very much in its infancy. Designers of such systems have almost unbounded freedom in the way they design the interface and this has the potential to introduce undesirable user interface attributes. The design process must incorporate a robust human factors based evaluation process. Unfortunately, without the user evaluation it will be difficult or impossible to determine the effectiveness of the interface. User performance measurement and selection of metrics will be crucial in establishing benchmarks so that comparisons can be made and interfaces developed more effectively. Special attention must be given to the way user performance with virtual interfaces is measured. Traditional human computer interaction evaluation techniques are unable to deal with virtual interfaces. The paper reports on a methodology that has been used to measure the usability and situation awareness of a virtual interface.
Indexación distribuida con restricción de recursos

En la actualidad, las organizaciones de todo tipo y tamaño tienen a su disposición grandes volúmenes de información a muy bajo costo. Aún más, aumentan su capacidad de generar datos y, por consiguiente, una necesidad intrı́nseca de almacenarlos y procesarlos. El paradigma actual para el gestión de datos masivos, conocido como Big Data, ofrece técnicas, algoritmos y plataformas desarrollados especı́ficamente en este contexto. Una de las plataformas más utilizadas es Hadoop y su implementación del paradigma de programación MapReduce. En este trabajo se aborda el problema de la indexación distribuida con restricción de recursos. Se cuenta con un número máximo de nodos de computo con caracterı́sticas de equipo de escritorio. Los experimentos variando el tamaño de la entrada muestran que se escala linealmente en las configuraciones estudiadas aunque el speedup resultante es bajo.
SPARE: Spiking Networks Acceleration Using CMOS ROM-Embedded RAM as an In-Memory-Computation Primitive

Data-intensive applications, like neural networks, require frequent and extensive data transfers between the memory and the CPU. The limited bandwidth and latency of these memory transactions results in von-Neumann bottlenecks in most state-of-the-art hardware implementations. To that effect, we propose SPARE, an in-memory processing architecture built on CMOS ROM-embedded RAM (ROAM) for accelerating neural networks. The neuro-synaptic models are stored in lookup tables locally, using the spare (no extra area) ROM (endowed by ROAM), thereby alleviating the von-Neumann bottleneck. We evaluate SPARE for spiking neural networks and obtain 2x, 1.9x and 1.5x improvement in energy, performance, and area, respectively, compared to similar architecture built with typical SRAMs.
A Leonardo da Vinci project: Blended Learning Methods in Vocational Education - Just in Time reBlending

Surveys and experience of daily business in EU show the need to learn languages and culture sensitive communication skills. New information technology especially mobile devices, offers possib ilities to enhance the interaction between actors. To guide such learning processes a new generation of pedagogical methods, practices and learning tools a re needed. Intelligent learning and automated tutoring tools are required. Developing new pedagogical methods should always take place within a context. We chose German is a pilot content for this project. The main aim of the project is to design, create and test e-learning co ntent, blended learning methods and mobile learning tools for vocational education. The project provides learning materials in the form of Learning Objects (LOs), which are interactive unitary pieces of the learning mate rial. These can be used in various devices such as computers, mobile phones, PDAs and communicators (multiple platforms). Learning Objects are also ope n source products. Both teachers and students can develop new objects.
A Node Monitoring Algorithm for Efficient LDPC Decoding

In this paper, we propose an efficient algorithm for reducing the complexity of LDPC code decoding by using node monitoring (NM). This NM algorithm is based on a new node-threshold method, and the message passing algorithm. This algorithm was simulated in order to verify its efficiency. Simulation results show that the complexity of our NM algorithm is improved to about 10%, compared with well-known methods. I. NODE MONITORING ALGORITHM We introduce a decoding method based on the node monitoring algorithm. It updates messages only that instable nodes send at some iteration. In order to describe the degree of some nodes that have achieved a certain stable state, we define the "aggregate messages" Bi for each variable node as follows: Bi=|V ( i) n |= |Uch,n+ ∑ m∈M ( n ) U ( i) mn| (1) Checking Bi against the node-thresholds tv, will find the nodes that are stable. Bi is the confidence of the variable node to be in state 0 or 1, and the bigger Bi is, the more stable variable node is. We give two vectors to store the state of check nodes and variable nodes, respectively. Deactivated vectors are filled with zeros. Variable nodes get the information bits, and V(0)nm = Uch,n . They send values as messages to their neighbor check nodes. When check nodes receive these messages, they send their messages U(i)mn to variable nodes. Then the variable nodes compute Bi to compare with the node-threshold tv. If it is bigger than the tv, the element in deactivated-v to this node will change to 1 from 0 representing a stable variable node. If a check node's neighbor variable nodes are all in stable state, the element in deactivated-c to this node will change to 1 from 0 representing a stable check node. They will never send the message to its neighbors. It reduces the complexity of the decoding process, but barely brings out degradation of the bit error rate (BER) and the frame error rate (FER) performance.
Efficient Approach to find Bigram Frequency in Text Document using E-VSM

This paper proposes a novel and efficient approach to calculate bigram frequency which uses E-VSM as basis to represent text document. E-VSM: Enhanced-Vector Space Model is nothing but an extension to simple VSM which stores positions of tokens in addition to their frequency in document. Many recent methodologies in Information Retrieval and Text Mining have used bigram along with unigram since bigram gives more information gain than unigrams. Also recent efforts to provide more richer text document representation than simple ‘Bag of Words’ have also used bigram along with unigram. Proposed approach to calculate bigram frequency outperforms state-of-art in terms of time complexity. Analysis show that proposed approach improves time complexity to significant extent. General Terms Information Retrieval, Text Mining, Text Processing.
Fuzzy Control of a New Tendon-Driven Exoskeletal Power Assistive Device

This paper proposes a tendon-driven exoskeletal power assistive device to reduce some problems of the existing exoskeletal power assistive equipment. In addition, this paper suggests a caster walker carrying heavy peripheral devices and maintaining stable balance of the user at the same time. A muscle fiber expansion signal is used to control this device in order to compensate for the delay time of motors and perform an easy assistance by sensing the user's action in advance. The muscle fiber expansion signal has the characteristics that the signal is ahead of action and in proportion to joint torque. A fuzzy control method is applied to control the proposed exoskeletal assistive device. This paper also describes a number of action tests such as sitting, standing, and walking. The experimental results were quantitatively evaluated by comparing the EMG signal before and after wearing of the proposed exoskeletal assistive device.
Assessing program code through static structural similarity

Learning to write software requires much practice and frequent assessment. Consequently, the use of computers to assist in the assessment of computer programs has been important in supporting large classes at universities. The main approaches to the problem are dynamic analysis (testing student programs for expected output) and static analysis (direct analysis of the program code). The former is very sensitive to all kinds of errors in student programs, while the latter has traditionally only been used to assess quality, and not correctness. This research focusses on the application of static analysis, particularly structural similarity, to marking student programs. Existing traditional measures of similarity are limiting in that they are usually only effective on tree structures. In this regard they do not easily support dependencies in program code. Contemporary measures of structural similarity, such as similarity flooding, usually rely on an internal normalisation of scores. The effect is that the scores only have relative meaning, and cannot be interpreted in isolation, ie. they are not meaningful for assessment. The SimRank measure is shown to have the same problem, but not because of normalisation. The problem with the SimRank measure arises from the fact that its scores depend on all possible mappings between the children of vertices being compared. The main contribution of this research is a novel graph similarity measure, the Weighted Assignment Similarity measure. It is related to SimRank, but derives propagation scores from only the locally optimal mapping between child vertices. The resulting similarity scores may be regarded as the percentage of mutual coverage between graphs. The measure is proven to converge for all directed acyclic graphs, and an efficient implementation is outlined for this case. Attributes on graph vertices and edges are often used to capture domain specific information which is not structural in nature. It has been suggested that these should influence the similarity propagation, but no clear method for doing this has been reported. The second important contribution of this research is a general method for incorporating these local attribute similarities into the larger similarity propagation method. An example of attributes in program graphs are identifier names. The choice of identifiers in programs is arbitrary as they are purely symbolic. A problem facing any comparison between programs is that they are unlikely to use the same set of identifiers. This problem indicates that a mapping between the identifier sets is required. The third contribution of this research is a method for applying the structural similarity measure in a two step process to find an optimal identifier mapping. This approach is both novel and valuable as it cleverly reuses the similarity measure as an existing resource.
A Spectral Co-Clustering Approach for Dynamic Data

A common task in many domains with a temporal aspect involves identifying and tracking clusters over time. Often dynamic data will have a feature-based representation. In some cases, a direct mapping will exist for both objects and features over time. But in many scenarios, smaller subsets of objects or features alone will persist across successive time periods. To address this issue, we propose a dynamic spectral co-clustering algorithm for simultaneously clustering objects and features over time, as represented by a set of related bipartite graphs. We evaluate the algorithm on several synthetic datasets, a benchmark text corpus, and social bookmarking data.
Cell phone panel designs for the visually impaired: Application of the Tactile sensation

Abstract Although cell phones have become increasing popular and much more innovative these days, most input interfaces still rely on the sense of sight. In order to improve the usability and convenience of using a cell phone for the visually impaired, this research fo- cuses on the tactile touch when using cell phone buttons – a non-visual operation. We have designed two kinds of tactile function buttons and two kinds of tactile number buttons. We test the designs and analyze the cognition behavior of the users using non-visual think-aloud protocols and interviews. The result shows people tend to recognize shapes by a clear edge outline and are able to distinguish several basic features.
The utility of selected measures for the initiation of treatment for PTSD in the VA healthcare system : a review of contemporary literature

Through appropriate use of available instruments, recognition and diagnosis of posttraumatic stress disorder (PTSD) can be accomplished, leading to the initiation of treatments vital to achieving optimal health outcomes. Inappropriate use of these same instruments can lead to delayed, inappropriate or ineffective condition treatment, and squandering of limited resources. It was the purpose of this project to identify and analyze factors related to accurate identification through exploration of contemporary literature evaluating psychometric properties of a collection of selected screening tools commonly used within the Veterans Administration (VA) system. A limited journal article search was performed using three electronic health science databases, focusing on the Primary Care PTSD Screen (PC-PTSD), Posttraumatic Stress Disorder Checklist (PCL-M), Mississippi PTSD Scale (M-PTSD) and the Clinician Administrated PTSD Scale (CAPS). Emphasis was placed on each instrument’s reported psychometric properties, specifically, the internal consistency, test-retest reliability, discriminant validity, convergent validity and diagnostic utility. Journal results were separated by instrument and organized into table form for ease of comparison. Additional instrument administration details were added in efforts to assemble a comprehensive assessment. Psychometric incongruencies between instruments were found. Specifically between the simple four question PC-PTSD and the comprehensive CAPS instrument. Significant disparity was observed in terms of diagnostic utility when one instrument is used for the purpose of the other. Sensitivity and specificity varied considerably dependent on cut-off scores utilized. Considerable inequality exists in relationship to administration details, resource, and time requirements. The author concluded that with many appropriate instruments available to assist providers with diagnostic efforts, it is unwarranted and inapposite to attempt to attain equivalent results through the use of instruments with inferior psychometric abilities. It is the responsibility of the practitioner to ensure that the strengths and limitations of an instrument are considered before making a diagnosis or treatment decisions based upon results from the administration of any given instrument.
Using deformable templates to infer visual speech dynamics

The visual image of a talker provides information complementary to the acoustic speech waveform, and enables improved recognition accuracy, especially in environments corrupted by high acoustic noise or multiple talkers. Because most of the phonologically relevant visual information is from the mouth and lips, it is important to infer accurately and robustly their dynamics; moreover it is desirable to extract this information without the use of invasive markers or patterned illumination. We describe the use of deformable templates for speechreading, in order to infer the dynamics of lip contours throughout an image sequence. Template computations can be done relatively quickly and the resulting small number of shape description parameters are quite robust to visual noise and variations in illumination. Such templates delineate the inside of the mouth, so that the teeth and the tongue can also be found. <<ETX>>