Miracle-dz/UniFAR-FTUs huggingface dataset:
MANFAAT OLAHRAGA RENANG BAGI LANJUT USIA

Secara umum kondisi fisik seseorang yang telah memasuki masa lanjut usia mengalami penurunan. Perubahan-perubahan tersebut pada umumnya mengarah pada kemunduruan kesehatan fisik dan psikis, sehingga secara umum akan berpengaruh pada aktivitas kehidupan sehari-hari. Tulisan ini membahas tentang manfaat olahraga renang dan bentuk latihan renang yang tepat bagi lanjut usia. Tulisan diambil dengan mereview beberapa hasil penelitian dan artikel-artikel olahraga kesehatan khususnya manfaat olahraga renang bagi lanjut usia. Olahraga renang merupakan salah satu olahraga kardiovaskuler (jantung dan pembuluh darah) yang bermanfaat untuk meningkatkan VO2 maks dan penurunan denyut nadi istirahat, yang sebenarnya cocok untuk semua usia khususnya untuk rehabilitasi, terapi, dan lanjut usia. Olahraga renang memiliki peran dalam menyelesaikan berbagai macam permasalahan seperti stres (dalam segi rohaniah) dan juga mampu memberi rangsangan pada tubuh dalam menyembuhkan penyakit (dalam segi jasmaniah). Olahraga renang baik bentuk aktivitasnya maupun media kolam renang, telah berfungsi sebagai terapi kesehatan ( hydrotherapy) guna mengatasi masalah-masalah kesehatan seperti hipokinesia (kurang gerak), muskuioskeletal, penyakit dalam, dan masalah psikis. Terdapat sebelas macam bentuk latihan di air yang dapat dilakukan oleh lanjut usia yang dapat meningkatkan status kebugaran jasmani. Namun demikian, dalam melakukan olahraga renang tidak boleh mengalami kelelahan yang berlebihan, bila intensitasnya berlebihan dapat terjadi sesak napas, nyeri dada, atau pusing. Pada lanjut usia olahraga renang dapat dilakukan apabila memperhatikan syarat-syarat keamanannya. Olahraga renang dapat direkomendasikan sebagai olahraga yang aman bagi lanjut usia seperti pada jenis olahraga aerobik lainnya seperti berjalan, bersepeda, atau senam lansia. Kata Kunci: manfaat renang, lanjut usia, program
An introduction to Pmax forcing

These notes are an account of a six-hour lecture series I presented at Carnegie Mellon University on September 9, 2006, at the inaugural meeting of the Appalachian Set Theory series. My remarks (occasionally improvised) were faithfully transcribed by Peter LeFanu Lumsdaine and Yimu Yin, who then presented me with a rough draft of this article. Their account aimed to capture the feel of the discussions (including some direct quotations), and I’ve tried to preserve that as much as possible.
Four Steps to Analyse Data from a Case Study Method

Four steps are proposed to assist the novice researcher analyse their data that has been collected using a case study method. The first step proposes the creation of a data repository using basic relational database theory. The second step involves creating codes to identify the respective ‘chunks’ of data. These resulting codes are then analysed and rationalised. The third step involves analysing the case study data by generating a variety of reports. The fourth step generates the final propositions by linking the rationalised codes back to the initial propositions and where appropriate new propositions are generated. The outcome of these steps is a series of propositions that reflect the nature of the data associated with the case studies data.
Suivi tridimensionnel en stéréovision

This article presents a real time estimation method of the three dimensional trajectory of a target, applied to fingertip tracking in a gesture recognition context. Our approach is based on stereoscopic vision, with two standards webcams. The hand is segmented by background subtraction, and the fingertip is detected with the analysis of the curvature of finger boundary. The fingertip tracking is carried out by a three dimensional Kalman filter, in order to improve the detection with a local research centered on the prediction of the 3D position and to filter the trajectory to reduce the estimation error.
Seminar: Specification and Verification of Object-oriented Software

v Software systems are – getting more and more complex. – used in safety and security critical applications. v We think: – Complex software systems require a precise specification of its architecture and components. – Semi-formal methods (like UML diagrams) are not strong enough. There are many reasons for using formal methods: v safety critical applications, e.g. flight or railway control. Why Formal Methods are not widely accepted in software industry? v Only a few formal methods address industrial needs: – support for object-oriented programming. – highly automatic (? ). – integration in standard CASE tools and processes. v Formal methods people and industrial software developer are often speaking different languages. The KeY tool tackles these challenges by using a industrial accepted specification languages (UML/OCL) and by providing a strong integration into standard CASE tools.
Realistic Animation Using Musculotendon Skeletal Dynamics And SuboptimalControl

This paper presents a new methodology for model and control of the motion of an human body for the purposes of animation. The approach is to use a parameter optimization method for forward dynamic simulation to get a best set of control, and to use musculotendon skeletal model for the human body to model as close as possible. Skeletal and musculotendon dynamics enables us to do the human body animation more accurate than ever because the muscle force depends on geometry of a human as well as differential kinematic parameters. Our control for a musculotendon skeletal dynamic model is to have a moderate number of control nodes and linearly interpolates among this set of nodes. Then we use the control values from the linear interpolation to actuate each musculotendon actuators at the body. We then find a best set of control by using a parameter optimization method. The method is formulated in detail and is demonstrated by an animation of human jumping.
Evaluation of storage mechanisms for a content repository

textabstractIn this thesis, we describe and evaluate different storage mechanisms for the content repository powering a content platform. In certain usage scenarios the current RDBMS-based implementation exhibits severe performance degradation. The evaluation will focus on performance and implementation complexity. To perform a realistic evaluation, we have gathered real-world usage scenarios and data statistics. In an ex- periment, three prototypes were created and benchmarked based on these usage scenarios. The experiment results show that the object-oriented database db4o does not scale well when used as a back-end for a content repository. Additionally, the graph-oriented HypergraphDB database was shown to scale to large datasets but does not provide ordering and pagination, two important features for a content repository. The results suggest that a document-oriented database is a good alternative to an RDBMS as the back-end of a content repository in terms of both performance and implementation complexity. A disadvantage of this alternative is the reduced durability.
A model of software component interactions using the call graph technique

Interaction information that is related to operations between components is important, especially when the program needs to be modified and maintained. Therefore, the affected components must be identified and matched based on the requirement of the system. This information can be obtained through performing the code review technique, which requires an analyst to search for specific information from the source code, which is a very time consuming process. This research proposed a model for representing software component interactions where this information was automatically extracted from the source code in order to provide an effective display for the software components interaction representation. The objective was achieved through applying a research design methodology, which consists of five phases: awareness of the problem, suggestion, development, evaluation, and conclusion. The development phase was conducted by automatically extracting the components‘ interaction information using appropriate reverse engineering tools and supporting programs that were developed in this research. These tools were used to extract software information, extract the information of component interactions in software programs, and transform this information into the proposed model, which was in the form of a call graph. The produced model was evaluated using a visualization tool and by expert review. The visualization tool was used to display the call graph from a text format into a graphical view. The processed model evaluation was conducted through an expert review technique. The findings from the model evaluation show that the produced model can be used and manipulated to visualize the component interactions. It provides a process that allows a visualization display for analysts to view the interaction of software components in order to comprehend the components integrations that are involved. This information can be manipulated and improved the program comprehension, especially for other software maintenance purposes.
The effects of the study of popular music on music education

In this article we propose that the introduction of popular music into Australian music syllabuses during the 1970s caused a disruption in and subsequent rethinking of music education. This was the result of the realisation among music educators that methods of teaching art music, which formed the content basis of syllabuses prior to the 1970s, were not suitable for teaching popular music. Responses to this realisation have resulted in the development of alternative methods of music education, and these in turn have reshaped not only teaching and learning strategies but also the ways music educators theorise music education and conceptualise its object of study, music.
Automated internal web page clustering for improved data extraction

In this paper, we would like to present an algorithm to determine the repeating patterns inside the DOM tree of a webpage. By doing this we can cluster the content inside a web page and obtain more relevant structured data. The determined DOM structure can be used to mine other web pages that are similar in structure and one hop away from the initial targeted web page. Also, the clusters are similar in structure not in contents, and our method is based on in-page clustering. This is what differentiates our algorithm from similar technologies that work on entire web pages.
Determining Performance Boundaries and Automatic Loop Optimization of High-Level System Specifications

Designers are confronted with high time-to-market pressure and an increasing demand for computational power. As a result, they are required to identify as early as possible the quality of a specification for an intended technology. The designer needs to know if this specification can be improved, and at what cost. Specification trade-offs are often based on the experience and intuition of a designer, which in itself is not enough to make design decisions given the complexity of modern designs. Therefore, we need to identify the performance boundaries for the execution of a specification on an intended technology. The degree of parallelism, required resources, scheduling constraints, and possible optimizations, etc. are essential in determining design trade-offs (e.g., power consumption, execution time, etc). However, existing tools lack the capability of determining relevant performance parameters and the option to automatically optimize high-level specifications to make meaningful design trade-offs. To address these problems, we present in this thesis a new profiler tool, cprof. The Clang compiler front-end is used in this tool to parse high-level specifications, and to produce instrumented source code for the purpose of profiling. This tool automatically determines, from high-level specifications, the degree of parallelism of a given source code, specified in C and C++ programming languages. Furthermore, cprof estimates the number of clock cycles necessary to complete a program, it automatically applies loop optimization techniques, it determines the lower and upper bound on throughput capacity, and finally, it generates hardware execution traces. The tool assumes that the specification is executed on a parallel Model of Computation (MoC), referred to as a Polyhedral Process Network (PPN). The proposed tool adds new functionality to existing technologies: the estimated performance by cprof of PolyBench/C benchmarks, as compared to realistic implementations in Field-Programmable Gate Arrays (FPGA) platforms, showed to be almost identical. Cprof is capable of estimating the lower and upper bound on throughput capacity, making it possible for the designer to make performance trade-offs based on real design points. As a result, only the high-level specification is used by cprof to assist in Design Space Exploration (DSE) and to improve design quality.
The constructive semantics of pure esterel

1 Preface We present a new semantical framework for Esterel, the constructive framework. After a detailed explanation of the causality issues in the lann guage and an intuitive presentation of constructiveness, we show the equivv alence between three semantics: the constructive behavioral semantics, the constructive operational semantics, and the electrical semantics that uses a translation of Esterel programs into digital circuits. The main full abstracc tion result is that an Esterel program is constructive if and only if its possibly cyclic circuit reaches electrical stabilization in bounded time. The constructive semantics is implemented in the Esterel v5 compiler. This new compiler accepts all programs accepted by the previous Esterel v3 and v4 compiler, as well as all the constructive programs these compilers reject. This draft book is mostly directed to the users of the Esterel v5 system, which is based on the new constructive semantics presented here. Our central aims are to explain the constructive semantics, which, to our belief, should be the nal semantics for the language, to make causality issues understandable, a thing that has long be missing, and to fully explain the translation of Esterel programs into circuits. In the former release 1.0 of this book, there was a bug in the behavioral semantics rules forsuspend and a bug in the deenition of the Can predicate for local signal declaration. Please accept my apologies, and throw away verr sion 1.0. The only thing you will lose is the operational semantics, which will be greatly improved and simpliied in the next release. Our work on the constructive semantics owes much to Frddric Boussinot, to Ellen Sentovich and Emmanuel Ledinot (from Dassault Aviation) who perr formed a careful proofreading. Comments from readers are welcome. Please send them by e-mail to berry@cma.cma. fr. 2 Chapter 1 Introduction Esterel 8, 10, 3, 4] is an imperative synchronous parallel programming lann guage dedicated to reactive systems 17]. Esterel is tailored for programming hardware or software synchronous controllers for which the control-handling aspects are predominant. Esterel programs are input-driven: they wait for inputs and compute corresponding outputs in a cycle-based way. An inn put-output computation is called a reaction. Synchrony conceptually means that reactions take no time, or, in other words, that outputs are available as soon as inputs are. By abstracting away reaction times, synchrony reconciles concurrency and determinism, and it greatly simpliies controller programm ming. Furthermore, it makes it possible to use …
An inverted index generator for CINDI

Human maintained search engines are expensive, slow to update, and cannot cover all the web pages. Automated search engines that rely on keyword matching usually return too many low quality results, with most users only looking at the first few tens of the search results. Because search engine development has gone on at companies with little publication of technical details, it is a challenging task to develop a search engine. The use of hypertextual information can help to improve search quality. This report addresses the question of how to build an inverted index for a search system that can use the additional information presented in hypertext to produce better search results. This report is part of the work of the Concordia INdexing and DIscovery (CINDI) Digital Library System. In this report, we summarize the research work I have done; we present some implementation issues for the project; and present the data structures that can be used in indexing web pages. The design decision was driven by the desire to have a reasonable compact data structure, and the ability to fetch a record in few disk seeks during a search. This project has been implemented in C++ on Linux platform.
Silk cocoon grading by fuzzy expert systems

Abstract: This chapter discusses using an intelligent fuzzy expert system as a grading method for silk cocoon selection problems. It begins by reviewing the need for an expert quality system for cocoon assessment and proposes fuzzy logic as the best approach for this. The chapter then offers a brief outline of fuzzy logic and the development of a fuzzy expert system for cocoon grading. The significance of shell ratio (%), defective cocoon (%) and cocoon size in governing the quality of cocoons has meant that these are the three main quality parameters used for cocoon grading. This provides a good flexibility in reflecting the expectations and visual grading into the results.
A General Framework for Exploiting Background Knowledge in Natural Language Processing

The two key aspects of natural language processing (NLP) applications based on machine learning techniques are the learning algorithm and the feature representation of the documents, entities, or words that have to be manipulated. Until now, the majority of the approaches exploited syntactic features, while semantic feature extraction suffered from low coverage of the available knowledge resources and the difficulty to match text and ontology elements. Nowadays, the Semantic Web made available a large amount of logically encoded world knowledge called Linked Open Data (LOD). However, extending state-of-the-art natural language applications to use LOD resources is not a trivial task due to a number of reasons, including natural language ambiguity and heterogeneity and ambiguity of the schemes adopted by different LOD resources. In this thesis we define a general framework for supporting NLP with semantic features extracted from LOD. The main idea behind the framework is to (i) map terms in text to the unique resource identifiers (URIs) of LOD concepts through Wikipedia mediation; (ii) use the URIs to obtain background knowledge from LOD; (iii) integrate the obtained knowledge as semantic features into machine learning algorithms. We evaluate the framework by means of case studies on coreference resolution and relation extraction. Additionally, we propose an approach for increasing accuracy of the mapping step based on the "one sense per discourse" hypothesis. Finally, we present an open-source Java tool for extracting LOD knowledge through SPARQL endpoints and converting it to NLP features.
Fixed-Priority Scheduling of Periodic Tasks With End-to-End Deadlines

In recent years more and more real-time applications run on multiprocessor or distributed systems. In such systems, a task may execute sequentially on many different processors. Such a task can be viewed as a linear chain of subtasks, each of which represents a segment of the task that executes on one of those processors. The response time of the task is measured from the release of its first subtask to the completion of its last subtask and is called the end-to-end response time. A task is schedulable if its end-to-end response time is never greater than the specified end-to-end relative deadline. This thesis deals with the problem of scheduling periodic tasks to meet their end-to-end deadlines. Specifically, the thesis focuses on fixed-priority scheduling algorithms, where each subtask is assigned a fixed priority and is scheduled preemptively. According to this approach, three related problems need to be solved. Priority assignment. How we assign the priorities to subtasks so that the system schedulability can be maximized. Execution synchronization. How we synchronize the releases of subtasks so that the precedence constraints among subtasks are satisfied, and the system schedulability is optimized. Schedulability analysis. Given a certain priority assignment and an execution synchronization method, how we compute the worst-case end-to-end response time of each task, so that we can verify the schedulability of the task and hence the schedulability of the system. As solutions to these three problems, the thesis describes five synchronization protocols, several deadline-based priority assignment methods, and corresponding schedulability analysis algorithms. These solutions form an integrated end-to-end scheduling framework for scheduling tasks with end-to-end deadlines and analyzing the schedulability of an end-to-end system. As an application of the framework, the thesis proposes an end-to-end scheduling based approach to the resource contention problem in distributed real-time systems. Simulation results show that the end-to-end scheduling approach performs better in many cases than an existing approach, known as the Multiprocessor Priority Ceiling Protocol. In the appendix, the thesis includes an in-depth discussion of sporadic server algorithms.
Investigating the Role of Companions in the Art Museum Experience

This paper analyzes the role played by the presence or the absence of companions in the individual experience of visiting an art museum. Until now, little research has focused on the visitor's accompaniment, even though the dual nature of visiting a museum, both a social leisure activity and an introspective experience, points to its potential importance. I present the principal results of a qualitative study of art museum visitors (a content analysis of twenty-four semi-directed interviews), from which I then draw implications of relevance to further research and to museum management.
Design of Analog CMOS Circuits for Batteryless Implantable Telemetry Systems

A wireless biomedical telemetry system is a device that collects biomedical signal measurements and transmits data through wireless RF communication. Testing medical treatments often involves experimentation on small laboratory animals, such as genetically modified mice and rats. Using batteries as a power source results in many practical issues, such as increased size of the implant and limited operating lifetime. Wireless power harvesting for implantable biomedical devices removes the need for batteries integrated into the implant. This will reduce device size and remove the need for surgical replacement due to battery depletion. Resonant inductive coupling achieves wireless power transfer in a manner modelled by a step down transformer. With this methodology, power harvesting for an implantable device is realized with the use of a large primary coil external to the subject, and a smaller secondary coil integrated into the implant. The signal received from the secondary coil must be regulated to provide a stable direct current (DC) power supply, which will be used to power the electronics in the implantable device. The focus of this work is on development of an electronic front–end for wireless powering of an implantable biomedical device. The energy harvesting front–end circuit is comprised of a rectifier, LDO regulator, and a temperature insensitive voltage reference. Physical design of the front–end circuit is developed in 0.13 μm CMOS technology with careful attention to analog layout issues. Post–layout simulation results are presented for each sub–block as well as the full front–end structure. The LDO regulator operates with supply voltages in the range of 1V to 1.5V with quiescent current of 10.5 μA The complete power receiver front–end has a power conversion efficiency of up to 29%.