Miracle-dz/UniFAR-FTUs huggingface dataset:
Nursing Student Library Usage Patterns in Online Courses

ABSTRACT This study looked at patterns of online library usage of a sample of undergraduate nursing students (n = 82) from a medium-sized southeastern university. Specifically, information-seeking behaviors of nursing students related to electronic or remotely accessible resources (i.e., electronic databases) compared to physical library resources (i.e., reference books) were examined. Additionally, this study further investigated students' preferred methods for seeking additional assistance and information about library research, as well as overall satisfaction and usage patterns relating to library tools and assistance by librarians or other school personnel. Results indicate that these undergraduates preferred electronic resources (with particular emphasis on electronic databases) to traditional, in-person research. Other relevant findings and suggestions relating to electronic access and training with library tools are provided.
Notice of Retraction A Case Study on Improving Environment Management Efficiency through Stakeholder Relations Analysis and Optimization

Petroleum companies operating in Ecuador have been facing strict environmental regulation after the nationalist government was established. Greenland petroleum Ecuador Ltd is involved in a campaign performing strict environmental regulations and high environmental claim risks. In order to improve environment management efficiency, a comprehensive stakeholder identify, analysis and optimize method was adopted by the company to maximize environment management efficiency. This method is an effective management tool on environment risk objective management. Since the method was implemented, the company has been operating to date without environment incidents and acclaims.
Scalable data-flow testing

ARAUJO, Roberto Paulo Andrioli de. Scalable data-flow testing. 2014. 100 p. Dissertation (Master of Science) – School of Arts, Sciences and Humanities, University of Sao Paulo, Sao Paulo, 2014. Data-flow (DF) testing was introduced more than thirty years ago aiming at verifying a program by extensively exploring its structure. It requires tests that traverse paths in which the assignment of a value to a variable (a definition) and its subsequent reference (a use) is verified. This relationship is called definition-use association (dua). While control-flow (CF) testing tools have being able to tackle systems composed of large and long running programs, DF testing tools have failed to do so. This situation is in part due to the costs associated with tracking duas at run-time. Recently, an algorithm, called Bitwise Algorithm (BA), which uses bit vectors and bitwise operations for tracking intra-procedural duas at run-time, was proposed. This research presents the implementation of BA for programs compiled into Java bytecodes. Previous DF approaches were able to deal with small to medium size programs with high penalties in terms of execution and memory. Our experimental results show that by using BA we are able to tackle large systems with more than 250 KLOCs and 300K required duas. Furthermore, for several programs the execution penalty was comparable with that imposed by a popular CF testing tool.
Estudo do Eletrocardiograma sob uma Abordagem Matemática

Electrocardiogram evaluation under a mathematical approach. The electrocardiogram gives information related to the passage of an electric pulse through the heart and, therefore, to his state function. Since the beginning of electrocardiogram utilization, thanks to the work of Willem Einthoven building the first machine capable of measuring the electric pulse non-invasively and with sensitivity enough to be able to provide a profitable graph, it is widely used for clinical evaluation of patients. However the evolution of the machines that describes the electrocardiogram hadn’t much more advances since the elaborated by Einthoven in the beginning of the 20 century. They become smaller (even portable for some applications), the graphs are now displayed in video screens (instead of the paper strip) and, taking place as the biggest evolutions, machines that observes the electrocardiogram became able to recognize a cardiac cycle with high reliability and, more recently, became able to measure the ST parameter with liMITed precision (it needs the help of the operator to set specific measuring points in some cases). It is based in these facts that this dissertation looks for analyzing mathematic algorithms, more specifically the mathematic models of the electric impulse during the cardiac cycles, and evaluate their capacities to expound ECG parameters in a fast and reliable way in order to the physician receive promptly the data needed for his clinical evaluation of the patient. For the first step were analyzed some algorithms for electrocardiogram pulse detection (detection of R wave), in the following step were done the windowing of the ECG wave in order to separate the cardiac cycles. In this step were analyzed the mathematic models generated by polynomial equations, Fourier Transform and Wavelet Transform. And, in order to filter noises and generate leads not measure, it was implemented a kalman’s filter at a vector model. To evaluate the obtained results were used the requirements of performance given by north-american FDA and by the European rule IEC60601-2-51. These evaluations were done by executing the generated algorithms in the waves supplied by the databank PhisioNet. The polynomial method weren’t considered interesting because it weren’t able to generate an equation for the cardiac cycle, but many equations (one for each point of the cycle). The other methods showed a better efficiency since they were capable of generate parameters with physical meaning and being able to do a better characterization of the important points of the electrocardiogram wave.
Compartim experiències dels programes d'intercanvi

Les noves generacions d'estudiants busquen experimentar i descobrir noves experiencies en altres universitats del mon. Per a facilitar-los el cami, les universitats han desenvolupat els programes de mobilitat que permeten als alumnes gaudir d'intercanvis a l'estranger per fer una part dels estudis. El que es busca en aquest treball es facilitar als estudiants que volen marxar d'intercanvi l'acces a la informacio necessaria per poder decidir-se pel millor desti possible. D'aquesta forma, qualsevol alumne de la Universitat Autonoma tindra a la seva disposicio un portal web que li mostrara de manera grafica totes les universitats de desti, les quals podra filtrar segons les seves preferencies. A mes, podra ampliar la informacio d'un desti i coneixer mes profundament les assignatures que s'imparteixen i que es reconeixen a la UAB, gracies a la generacio de contingut proporcionat pels alumnes que ja hi han estat previament. A part, podran llegir les opinions d'aquests alumnes que han gaudit d'aquesta experiencia. D'altra banda, els coordinadors de cada grau podran mantenir i millorar facilment les dades que es mostren als estudiants.
The Optimal Number of Menu Options per Panel

As the number of levels of a hierarchical menu structure grows, users find it difficult to navigate from their current location to their desired location. Despite the navigation problem, designers of menu interfaces may want to trade more depth for less breadth in order to take advantage of funneling. Indeed, Lee and MacGregor (1985) have presented an analysis of search time that suggests that the optimal number of options per menu panel over a wide range of conditions is in the range of only four to eight. However, Lee and MacGregor's analysis applies only to cases where the user cannot restrict the scope of search based on either experience with the menu panel or on the organization of the options on the panel. The analysis is extended to cases of restricted search. Assuming optimal grouping, the optimal number of alternatives on a single page ranges from 16 to 78 across the same parameter values explored by Lee and MacGregor.
A 2.4 GOPS data-driven reconfigurable multiprocessor IC for DSP

Existing hardware prototyping platforms, often based on commercial processors or FPGAs, cannot cope with the high computation requirements of complex DSP algorithms, especially those with high sampling rate and heterogeneous data-now patterns. The multiprocessor IC presented here is designed to handle these types of algorithms. The chip presented here contains 48 16 b PEs interconnected by a 2-level high bandwidth communication network.
A 9 ns 1 Mb CMOS SRAM

A 1-Mb (256k*4/1M*1) CMOS SRAM (static random access memory), fabricated using a half-micron triple-poly double-metal CMOS technology, is reported. A 9-ns access time is attained with 5-V supply and 30-pF load capacitance. This access time has been achieved with a three-stage pMOS cross-coupled sense amplifier, 0.6- mu m high-performance MOSFETs, and an optimized internal supply voltage scheme. A redundancy scheme with no access time penalty has been incorporated. The sense amplifier circuit combined with a CMOS cross-coupled preamplifier has under 10-ns access time. Address and data output waveforms are shown. Typical active current is 55 mA at 30 MHz, and typical standby current is 15 mA (TTL). Typical RAM characteristics are listed. <<ETX>>
The Theory of Parsing, Translation, and Compiling

From volume 1 Preface (See Front Matter for full Preface) This book is intended for a one or two semester course in compiling theory at the senior or graduate level. It is a theoretically oriented treatment of a practical subject. Our motivation for making it so is threefold. (1) In an area as rapidly changing as Computer Science, sound pedagogy demands that courses emphasize ideas, rather than implementation details. It is our hope that the algorithms and concepts presented in this book will survive the next generation of computers and programming languages, and that at least some of them will be applicable to fields other than compiler writing. (2) Compiler writing has progressed to the point where many portions of a compiler can be isolated and subjected to design optimization. It is important that appropriate mathematical tools be available to the person attempting this optimization. (3) Some of the most useful and most efficient compiler algorithms, e.g. LR(k) parsing, require a good deal of mathematical background for full understanding. We expect, therefore, that a good theoretical background will become essential for the compiler designer. While we have not omitted difficult theorems that are relevant to compiling, we have tried to make the book as readable as possible. Numerous examples are given, each based on a small grammar, rather than on the large grammars encountered in practice. It is hoped that these examples are sufficient to illustrate the basic ideas, even in cases where the theoretical developments are difficult to follow in isolation. From volume 2 Preface (See Front Matter for full Preface) Compiler design is one of the first major areas of systems programming for which a strong theoretical foundation is becoming available. Volume I of The Theory of Parsing, Translation, and Compiling developed the relevant parts of mathematics and language theory for this foundation and developed the principal methods of fast syntactic analysis. Volume II is a continuation of Volume I, but except for Chapters 7 and 8 it is oriented towards the nonsyntactic aspects of compiler design. The treatment of the material in Volume II is much the same as in Volume I, although proofs have become a little more sketchy. We have tried to make the discussion as readable as possible by providing numerous examples, each illustrating one or two concepts. Since the text emphasizes concepts rather than language or machine details, a programming laboratory should accompany a course based on this book, so that a student can develop some facility in applying the concepts discussed to practical problems. The programming exercises appearing at the ends of sections can be used as recommended projects in such a laboratory. Part of the laboratory course should discuss the code to be generated for such programming language constructs as recursion, parameter passing, subroutine linkages, array references, loops, and so forth.
A smart fall and activity monitor for telecare applications

The design of a smart sensor to detect falls and monitor activity is discussed in terms of its integration within an intelligent telecare system. The proposed device measures the impacts associated with a fall and monitors the status of the faller to identify whether assistance is required. The device thus distinguishes between a fall-event (faller gets up of their own accord) and a fall-alarm (faller remains down) and transmits an appropriate message to a local intelligence unit (LIU) which is connected to a response network. Fall-event codes provide essential input data for algorithms to determine fall prediction indices (FPI), whilst fall-alarm codes instruct the LIU to automatically notify an appropriate care provider. The device also provides a measure of activity which may be utilised in the automatic calculation of the activities of daily living (ADL), for use by social workers and occupational therapists for continuously determining a person's ability to live independently in the community. It is hoped that such a device will promote an integrated approach to the management of falls by the elderly in the community.
Dynamic hierarchical self-organizing neural networks

In this paper, we integrate the concept of self-organizing feature maps and the architecture of dynamic trees to develop dynamic hierarchical self-organizing neural networks. The proposed network is capable of allocating new neurons dynamically during the learning process and then determining its own topology. A fuzzy membership function which measures the similarity of the input data is employed in the weight updating procedure and used as an criterion to allocate new neurons. Unlike the conventional self-organizing neural networks, the training samples are not input in sequence to update the weights. Instead, the weight updating procedure takes into account all the training data at one time. All these provide the proposed networks several advantages including revelation of hierarchical structure in data, dynamic allocation of neurons, short learning time, and short search time. To demonstrate their capabilities, the proposed networks are applied to solve the image segmentation problems. <<ETX>>
Augmented Reality: A Practical Guide

"Augmented Reality" is a natural way to explore 3D objects and data, as it brings virtual objects into the real world, where we live, rather than forcing us to learn how to navigate inside the computer. With video-see-through technology, AR handheld devices such as tablet PC's, PDA's, or camera cell phones, (or in many cases just a webcam and our standard computer monitor), you hold the device up and "see through" the display to view both the real world and the superimposed virtual object. You can move around and see the virtual object, model, animation, or game from different views as the AR system performs alignment of the real and virtual cameras automatically.This book will introduce you to Augmented Reality (AR), provide detailed explanations of how the technology works, and provide samples for you to try on your own. Code samples using the freely downloadable ARTag software SDK in C++ and C# are included; all you need is a computer, printer, and a webcam. Create something new today!
Multimedia with Animated Sign Language for Deaf Learners

This paper describes how animated sign language can be integrated into multimedia teaching material for deaf learners with a sign language as their first language. For the creation of animated sign language special techniques were developed in which the animation is driven by a special sign language notation system. This so- called synthetic animation enables a trained sign language user to easily create signed content at the computer at his/her own pace. To demonstrate and evaluate the quality of synthetic signing, several web applications were developed and tested with deaf users. The results were sufficiently promising to develop other applications and our focus is now on educational applications for deaf pupils at primary and secondary level. Several examples of this are presented.
Model Evaluasi Rekaman Percakapan Di Audio Forensik

Metadata pada rekaman percakapan berisi berbagai informasi, salah satunya adalah ciri frekuensi yang digunakan untuk identifikasi identitas. Ciri tersebut sangat rentan interferensi noise. Untuk menghilangkannya digunakan filter, namun penggunaan filter menyebabkan sebagian komponen ciri frekuensi tereduksi, sehingga tidak dapat digunakan dalam hal ini. Untuk hasil acquisisi dari metadata mempunyai kualitas yang baik maka dilakukan evaluasi terhadap data rekaman yang terpengaruh noise. Agar diketahui batas perbandingan noise dan derau (SNR) yang tidak menyebabkan perubahan ciri. Metodologi yang digunakan dengan membandingkan hasil ekstraksi tanpa noise dengan varian noise, dan diukur perubahan cirinya. Hasil pengujian didapatkan bahwa, untuk nilai SNR antara --5.4078 dB sampai -7.0632 dB, ciri masih dapat dikenali, sedangkan lebih dari -7.0632 dB ciri telah mengalami perubahan.
Machine Coded Genetic Algorithms For Real Parameter Optimization Problems

In this paper, we introduce a new encoding-decoding strategy for the floating-point genetic algorithms and we call the genetic algorithms which use this strategy Machine Coded Genetic Algorithms. We suggest applying classical crossover and mutation operations on the byte representations of real values which are already encoded in memory. This is equivalent to use a 256-unary alphabet with 8 genes for a single real value. Use of byte representations makes the classical genetic operators interpretable in floating-point chromosomes and increases the search capabilities in a wide range without losing accuracy. This strategy also decreases the computation time needed for the genetic operators. Simulation studies show that our strategy performs well on many test functions by means of converging to global optimum and time efficiency. Key Words : Genetic algorithms, Chromosome encoding, Real parameter optimization.
Adapting Educational Resources for Collaborative On-line Peer Review

_______________ Date The final copy of this thesis has been examined by the signatories, and we find that both the content and the form meet acceptable presentation standards of scholarly work in the above mentioned discipline. This thesis looks at a computer-mediated communication (CMC) and publishing system used to facilitate collaborative peer review of multimedia educational objects. The occurrence of electronic scholarly publishing has increased dramatically in recent years due in part to the immediacy and overall reach of the Internet and it's ability to transmit diverse forms of electronic media. Previous studies indicate, however, that there is a perceived lack of prestige and legitimacy associated with electronic journals as well as electronically enabled peer review. This is due in part to a perceived lack of permanence associated with electronic media, a lack of familiarity with electronic media and a lack of fully developed conventions of citation. New forms of electronically based peer review have been explored that enable a collaborative review process among reviewers and authors, breaking from traditional models where communication channels are mediated through an editor. The ability of CMC to enable collaboration within geographically dispersed communities offers strong motivation for its use. This thesis develops a framework for collaborative peer review based on social capital that suggests an overall benefit for scholarly communities that incorporate collaborative forms of review. An examination is performed of collaborative peer review used in a new journal that features multimedia-rich geoscience educational objects – the Journal of Earth System Science in Education (JESSE). Technical issues surrounding the preparation of these objects for the CMC review environment are discussed and a process model for publishing is developed. A redesign of the toolkit used to prepare objects for the review environment is implemented and task-centered usability assessments are performed. The outcome of these steps suggested a potential for increased legitimacy and prestige of electronic publishing could develop out of a well-designed CMC environment and collaborative review model. It was found that scholars who participated in the peer review perceived a benefit from the collaborative process and that the process was seen as providing a separate service from traditional peer review. On the publishing end, the redesigned toolkit implementation was seen as providing greater accessibility to non-technically oriented users. iv Acknowledgements I would like to thank the following for their support and contributions:
Effective Diagramming Techniques

There are a number of modeling techniques (e.g. E/R, UML, ORM) available to the software developer that claim to have features that facilitate communication o f complex systems between the problem and solution domain expert. However, the basis for what “facilitate” means is rarely if at all defined in concrete terms. A new metric for measuring the effectiveness (e.g. comprehensibility, leamability, and facility to support conununications) of software modeling techniques based upon Noam Chomsky’s Universal Grammar is proposed.
Reliability of lead-free solder interconnects-a review

This paper discusses reliability issues related to lead-free printed circuit board interconnects. A comprehensive review of the published literature was carried out, and complemented further by reliability experiments that have been conducted to understand the behavior of some of the lead-free alternatives. The failure mechanisms for lead-free flip chips during accelerated testing are discussed. Some of the metallurgical effects due to the change in soldering system are also reviewed. In the case of assembly of lead-free flip chips, solder joint properties were still found to depend on the reflow profile (peak temperature and time above the liquidus temperature). The ultimate shear strength of Sn/Ag/Cu (SAC) joints on Ni/Au-coated substrate pads proved very sensitive to small changes in peak temperature and time above liquidus. A similar effect was not observed on Cu/OSP pads. The reflow profile with a lower peak temperature and a lower time above the liquidus temperature gave slightly lower shear strength of joints between two Ni-pads, while the profile with a higher peak temperature and a higher time above the liquidus gave a considerably higher strength. Not surprisingly, the fatigue resistance of both encapsulated and nonencapsulated Sn/Ag/Cu joints was significantly lower on Ni/Au-pads than on Cu/OSP.
Cooperative task-space control with kinetostatic filtering of a two-manipulator system

This paper addresses the problem of cooperative task-space control of a two-manipulator system holding a rigid object. The cooperative task-space is defined as a set of meaningful absolute and relative variables fully characterizing the system, and a task-space control is devised. Then, a kinetostatic filtering of the control action is introduced which is shown to cancel out stresses on the held object at steady state; this is obtained without resorting to force measurements. Simulation analysis and experimental validation of the proposed control scheme for a planar cooperative task is performed on a setup of two industrial manipulators.