Miracle-dz/UniFAR-FTUs huggingface dataset:
Application Development for multicore Processor

With multicore processors now in every computer, server, and embedded device, the need for cost-effective, reliable parallel software has never been greater. The efficiency of single core processors does not match the necessary levels for the development of applications. Performance means more than wringing additional benefits from a single application because users commonly multitask, actively toggling between two or more applications or working in environments in which many background processes compete for scarce processor resources. All major Operating systems, including Mac OS X, Microsoft Windows Vista, Windows Server, Red Hat Linux, and Novell SuSE Linux, already are threaded to take advantage of Hyper-Threading Technology and now multi-core architecture. Any program that is in a class of applications where threading is already relatively common video encoding, 3D rendering, video/photo editing and high performance computing/workstation applications are good candidates to be moved from serial to multithreaded multi-core systems. The speed up achieved can be measured using several laws like Ahmdals law, Gustafans law, etc. Multi-core architectures like the C64 could be used to achieve a high performance implementation of FFT both in 1D and 2D cases. Graphics processing units(GPUs) are further improvements on multicore architecture that process the graphics and the CPU codes in parallel, to give improved results. One such example is the speed up achieved in implementing the Radix sort on the CPU and the GPU.
Scalable and efficient tools for multi-level tiling

In the era of many-core systems, application performance will come from parallelism and data locality. Effective exploitation of these require explicit (re)structuring of the applications. Multilevel (or hierarchical) tiling is one such structuring technique used in almost all high-performance implementations. Lack of tool support has limited the use of multi-level tiling to program optimization experts. We present solutions to two fundamental problems in multi-level tiling, viz., optimal tile size selection and parameterized tiled loop generation. Our solutions provide scalable and efficient tools for multi-level tiling. Parameterized tiled code refers to tiled loops where the tile sizes are not (fixed) compile-time constants but are left as symbolic parameters. It can enable selection and adaptation of tile sizes across a spectrum of stages through compilation to run-time. We introduce two polyhedral sets, viz., inset and outset, and use them to develop a variety of scalable and efficient multi-level tiled loop generation algorithms. The generation efficiency and code quality are demonstrated on a variety of benchmarks such as stencil computations and matrix subroutines from BLAS. Our technique can generate tiled loop nests with parameterized, fixed or mixed tile sizes, thereby providing a one-size-fits all solution ideal for inclusion in production compilers. Optimal tile size selection (TSS) refers to the selection of tile sizes that optimize some cost (e.g., execution time) model. We show that these cost models share a fundamental mathematical property, viz., positivity, that allows us to reduce optimal TSS to convex optimization problems. Almost all TSS models proposed in the literature for parallelism, caches, and registers, lend themselves to this reduction. We present the reduction of five different TSS models proposed in the literature by different authors in a variety of tiling contexts. Our convex optimization based TSS framework is the first one to provide a solution that is both efficient and scalable to multiple levels of tiling.
Doing What Comes Naturally? Student Perceptions and Use of Collaborative Technologies.

This study investigates how students perceive and use collaborative technologies while also examining the meanings students assign to both collaboration and technology. A qualitative inductive analysis of students’ assignments in a professional communication course demonstrates that students use technology to collaborate for its Accessibility, A/synchronicity, and Collaborativity. Students perceive and use technology within a functional literacy framework wherein technologies are tools providing pragmatic means to complete a shared-document assignment. These results are important for integrating collaborative assignments and collaborative technologies to promote social learning within the classroom.
SPIN's Promela to Java Compiler: With help from Stratego

In model checking a formal model of a software system is constructed. That model is verified against a set of properties expressed in some logic. Once a model has been created and verified, it is still necessary to write the application itself completely by hand. No tools have yet been developed that can automatically create a system or application using a model written in Promela. until now! The Promela2Java Compiler to be described in this paper is a unique tool transforming a Promela model into an executable Java application. The Promela2Java Compiler has been constructed using the Stratego/XT tool set. Developers can use SPIN to check their designs for certain properties and use the Promela2Java compiler to successfully create executable Java code from their designs.
Towards biologically plausible regularization mechanisms

This study aims at proposing an implementation of regularization mechanisms compatible with biological operators. More precisely, cortical maps code vectorial parametric quantities, computed by network of neurons. One of these methods is based on an integral approximation of the diffusion operator used in regularization mechanisms. Following this formulation, the present development defines an optimal implementation of such an integral operator with the interesting property that, when used as a model of biological plausible mechanisms, it corresponds to a simple local feedback defined over a small bounded region of the parametric space. This formalism also allows to develop the case of several cortical maps in interaction. We propose simple biologically inspired conditions to guaranty the stability of such interactions. As such it may be linked to what is processed in a cortical column of the brain and provides a biological plausible model of cortical maps computation: here feedbacks between related cortical maps are discussed.
Desambiguación de sentidos de palabras usando sinónimos

We present a method for word sense disambiguation (WSD) basing on the KORAsupervised learning algorithm. The advantage of the method is its simplicity and a very small feature set used, though, as we show, this is achieved at the cost of lower accuracy of the final result than the complex stateof-the-art methods achieve.
The effects of Reed-Solomon code shortening on the performance of coded telemetry systems

The theory of Reed-Solomon code shortening in general was developed and the degradation due to shortening in the context of concatenated coding was qualified. It is shown that in the NASA/ESA concatenated system, significant degradations occur only when N 180. A Reed-Solomon code was concatenated with an inner (7, 1/2) convolutional code. Under some circumstances, it would be desirable to use a shorter outer code word length. For example, the format of the data coming from science instruments on board a spacecraft may lend itself naturally to a word length of 200 symbols rather than 223. To accommodate such code word lengths, the Reed-Solomon code can be shortened to an (N, N-32) code where N can be any integer between 33 and 255. Shortening the code, however, changes its performance. On one hand, the amount of redundancy per information symbol increases. Because of this increased redundancy, the amount of energy per information symbol is decreased by code shortening. The overall effect is to degrade the performance of the code.
Toward a model of perspective in contemporary computer games

While the relatively new medium of the computer game has elicited an increasing amount of academic attention from a variety of disciplines in the last few years, research on perspective and point of view in computer games generally focuses on questions regarding the presentation of space, i.e. on perspective as being determined by a point of view in the purely spatial sense. Within narratology, on the other hand, it is quite common to conceptualize point of view and perspective as multidimensional phenomena, both with regard to literary texts and, albeit to a lesser extent, narrative films. It therefore seems as if our understanding of perspective in computer games could benefit from the complex models of perspective that narratology has developed. Computer games, however, are neither literary narratives nor narrative films, and although the results of narratological research on perspective are doubtlessly inspiring, most of the models developed for the description of literary texts (or narrative films, for that matter) cannot be directly applied to computer games without missing some of their most central characteristics. Hence, the present paper proposes a multidimensional model of perspective in computer games that takes into account their specific medial properties. For this purpose, we distinguish between three dimensions of perspective. The first dimension is that of spatial perspective, which is determined by the point of view, i.e. the spatial position from which the game
Multimodal interactions for expressive interfaces

This paper presents an overview of a range of gestural, audio and tactile interaction techniques that can be used to create expressive interfaces that allow rich communication while reducing the demands on the visual display. We also discuss issues of social acceptability and how these new kinds of interactions will be accepted by different types of users in different types of settings.
A Spatio-temporal Model for Agricultural Yield Prediction

The paper presents a spatio-temporal statistical model of agricultural yield prediction based on spatial mixtures of distributions. The proposed method combines several hierarchical and sequential Bayesian estimation procedures that allow the general problem to be addressed with a series of simpler tasks, providing the required flexibility of the model while decreasing the complexity associated with the large dimensionality of the spatial data sets. The data used for the study are 1970 - 2009 annual Iowa state county level corn yield data. The spatial correlation hypothesis is studied by comparing the alternative models using the posterior predictive criterion under squared loss function.
MAKING AGENTS LESS ANNOYING: TOWARDS AN ANIMATED AGENT THAT RESPONDS TO SOCIAL CUES

Animated interface agents have been proposed as a more natural way for the user to interact with computers. Such agents are frequently used in pedagogical and program help applications. While many aspects of social agents have been investigated, that of keeping an appropriate social distance seems to have been overlooked. This ability is coupled with an understanding of when advice is and is not wanted. An agent that gives advice in an Othello program is implemented, which using reinforcement learning adapts its frequency of suggestions to whether or not the user takes the advice. The amount of suggestions that the user can expect is visualized for the user by agent size and position. This agent is compared to one which always gives advice. In the evaluation, test participants experienced that the first agent adapted to their behavior and also found it less distracting.
The specification language Z

An extracting tool for removing a lug from an electronic part includes a pair of handle members, a gripping member and a ram, with the handle members being so related to the gripping member that on squeezing of the handles, jaws of the gripping member and of one of the handle members grip the lug of a condenser and on further squeezing of the handles a lever joined to the other of the handles moves the ram, which is mounted adjacent to one of the jaws, against the condenser, thereby causing relative motion of the condenser and the lug and extracting the lug from the condenser. Also described is a method for replacing an electrolytic can type condenser by detaching the lugs therefrom without detaching the electrical connections to the lugs and then soldering the lugs of a replacement condenser to said connected lugs.
Un Mcanisme de Synchronisation pour les Rseaux Sans Fil Multi-Sauts

A vibrating plate is mounted in a case, and a first coil is secured to the vibrating plate. A magnetic circuit composition is mounted in the case. The magnetic circuit composition comprises a yoke having a flange and a core formed on the flange, an annular magnet mounted on the flange of the yoke, and a top plate comprising an annular portion and a cylindrical portion projection from a peripheral portion of the annular portion. The magnetic circuit composition is resiliently supported in the case. A coil holding plate is secured to the case, and a second coil is secured to the coil holding plate. The first coil is inserted in a first magnetic gap formed in the magnetic circuit composition and the second coil is inserted in a second magnetic gap formed in the magnetic circuit composition.
Interference-aware resource management in multihop wireless networks

This thesis is written with an attempt to address some of the challenges of resource allocation in multihop wireless mesh and ad hoc networks. The main focus of this thesis is on CDMA although some of the design issues considered are applicable to TDMA networks. A framework on implementation of different network design components is suggested including power control, routing and scheduling. Also, the deployment issues of each of these network components are investigated and suggestions are made on their design to address the problems involved. These suggestions include a new distributed power control algorithm that provides end-to-end QoS guarantee, an SINR-sensitive link metric for routing, and a hybrid centralized-decentralized scheduling scheme. We also consider a relaying incentivization mechanism in the context of mesh networks for Internet access when selfish but rational users are present.
Adaptation to affective factors: architectural impacts for natural language generation and dialogue

We are currently developing automatic natural language dialogue capabilities for assistence systems where the perceived ‘naturalness’ and ease of use for the systems’ users is a central consideration. We are, in addition, aiming at generic solutions that will enable a broad range of users to be supported. Our applications focus on issues that arise in the spatial domain—that is, our assistence systems are concerned with shared user-system tasks that are to be carried out in both shared and non-shared spatial configurations. The potential for miscommunication in these kinds of situations is extremely high since the perception and representation of space by our systems and by their human users is generally quite different; nevertheless, the interaction between user and system must be made to work even in the face of mutual non-comprehension. This potentially frustrating situation must be explicitly recognised and catered for in order to keep the system and user in an effective working relationship, thus raising issues of producing language with appropriate affect and of recognising the user’s affective state. In this paper, we present how this capability is being added into our dialogue architecture as an integral part of the mechanisms for dialogue support in general. We relate this to existing mechanisms for affective language generation/interpretation, user-adaptability and the importance of maintaining a tight inter-relationship between language and situation.
A framework for dynamic node-scheduling of two-sided blocked matrix computations

Dense linear algebra represents fundamental building blocks in many computational science and engineering applications. The dense linear algebra algorithms must be numerically stable, robust, and reliable in order to be usable as black-box solvers by expert as well as non-expert users. The algorithms also need to scale and run efficiently on massively parallel computers with multi-core nodes. Developing high-performance algorithms for dense matrix computations is a challenging task, especially since the widespread adoption of multi-core architectures. Cache reuse is an even more critical issue on multi-core processors than on uni-core processors due to their larger computational power and more complex memory hierarchies. Blocked matrix storage formats, in which blocks of the matrix are stored contiguously, and blocked algorithms, in which the algorithms exhibit large amounts of cache reuse, remain key techniques in the effort to approach the theoretical peak performance. In Paper I, we present a packed and distributed Cholesky factorization algorithm based on a new blocked and packed matrix storage format. High performance node computations are obtained as a result of the blocked storage format, and the use of look-ahead leads to improved parallel efficiency. In Paper II and Paper III, we study the problem of in-place matrix transposition in general and in-place matrix storage format conversion in particular. We present and evaluate new high-performance parallel algorithms for in-place conversion between the standard column-major and row-major formats and the four standard blocked matrix storage formats. Another critical issue, besides cache reuse, is that of efficient scheduling of computational tasks. Many weakly scalable parallel algorithms are efficient only when the problem size per processor is relatively large. A current research trend focuses on developing parallel algorithms which are more strongly scalable and hence more efficient also for smaller problems. In Paper IV, we present a framework for dynamic node-scheduling of two-sided matrix computations and demonstrate that by using priority-based scheduling one can obtain an efficient scheduling of a QR sweep. In Paper V and Paper VI, we present a blocked implementation of two-stage Hessenberg reduction targeting multi-core architectures. The main contributions of Paper V are in the blocking and scheduling of the second stage. Specifically, we show that the concept of look-ahead can be applied also to this two-sided factorization, and we propose an adaptive load-balancing technique that allow us to schedule the operations effectively.
Semantic Web Service for Bioinformatics Provenance Research Paper for ICTCC '08

There are two other important benefits of provenance management. The first one is for self-referencing. Bioinformatic analysis is a long and complex process, and each step usually has a large number of parameters that creates a large space of possible processes. Without a detailed record, it is difficult to remember which of the many trial-and-error paths was conducted. The second benefit is sharing. A recorded process can be shared with colleagues and within the research community, which is valuable for others working on similar problems. While there are existing efforts to support process sharing such as myExperiment [3], it requires the users to generate the process manually, which is time consuming and error prone.
Guidelines for Authors of Learning Objects.

A global leader in educational materials and professional information, with offices in more than 30 countries and publications in more than 40 languages, McGraw-Hill Education develops products that influence people's lives, throughout their lives, from preschool through career. McGraw-Hill publishes in all media, from print to CD-ROM, to the Web, and is dedicated to integrating technology into the lifelong learning environment. Permission is granted under a Creative Commons license to replicate and distribute this monograph freely provided that it is distributed only in its entirety. To view a copy of this license visit
The Digital Revolution

This is a practical, pocket-sized guide to the digital revolution which will give you the information and skills to succeed. Learn more about the digital revolution, you'll find out how to assess online opportunities, plan your strategy and succeed in the digital sector. Tables, illustrations and 'In Focus' panels on what to do in a particular situation, plus real-life case studies demonstrate how to understand technology, set up and maintain a website, analyse data and reach new markets. Read it cover-to-cover, or dip in and out of topics for quick reference.
Mining Multiple Web Sources Using Non-Deterministic Finite State Automata

iv DEDICATION v LIST OF TABLES x LIST OF FIGURES xi CHAPTER 1 Introduction 1 1.1 Information Extraction 3 1.1.1 Types of web page 3 1.1.1.1 Unstructured pages 3 1.1.1.2 Structured/semi-structured web page 4 1.1.1.3 List page: 5 1.2 Data types in data warehouse 7 1.2. 1 Historical data: 7 1.2. 2 Derived Data: 7 1.2. 3 Metadata: 8 1.3 Application of Information Extraction 8 1.3.1 Wrapper 8 1.3.2 Traditional Information Extraction versus Web Information Extraction 9 1.3.3 Applications of web information extraction 10 1.3.3.1 Manually-Constructed IE Systems 11 1.3.3.2 Supervised IE System 12 1.3.3. 3 Semi-supervised IE systems 13 1.3.3.4 Unsupervised IE Systems 14 1.4 Document Object Model 15 1.5 Finite Automata 17 1.5. 1 Deterministic finite automata 17 1.5. 2 Non-deterministic finite Automata 19
Online handwriting recognition using multiple pattern class models

The field of personal computing has begun to make a transition from the desk-top to handheld devices, thereby requiring input paradigms that are more suited for single hand entry than a keyboard and recent developments in online handwriting recognition allow for such input modalities. Data entry using a pen forms a natural, convenient interface. The large number of writing styles and the variability between them makes the problem of writer-independent unconstrained handwriting recognition a very challenging pattern recognition problem. The state-of-the-art in online handwriting recognition is such that it has found practical success in very constrained problems. In this thesis, a method of identifying different writing styles, referred to as lexemes, is described. Approaches for constructing both non-parametric and parametric classifiers are described that take advantage of the identified lexemes to form a more compact representation of the data, while maintaining good recognition accuracies. Experimental results are presented on different sets of unconstrained online handwritten characters and words. In addition, a method of combining information from lexeme models built on different feature sets is described, and results are presented on both English characters and Devanagari characters. Finally, a method of writer-adaptation is described which makes use of the lexemes identified from a large group of writers to define lexemes within a small amount of data from a single writer.