Miracle-dz/UniFAR-FTUs huggingface dataset:
Development of Gait Analysis System Based on Continuous Plantar Images Obtained Using CaTTaP Device

This paper presents a novel gait analysis system that is easy to use by patients and doctors. The system uses a new gait analysis device called “CAterpillar Type trAnsParent treadmill (CaTTaP)” and an image processing method. The CaTTaP has a “caterpillar” type of walking surface made of acrylic resin plates. A camera embedded in the CaTTaP walking surface continuously captures images of the sole during walking. Image processing of the plantar images extracts the plantar regions and determines the position of the subject’s sole on the CaTTaP. To evaluate the usefulness of the proposed method, we calculated the step length and width. For this study, we recruited 6 robust elderly persons. We conducted measurements with each subject walking at 3 different velocities. A total of 302 step lengths and widths were calculated from the image data, and the accuracy of the results were estimated by comparing with measurements obtained simultaneously using a motion capture system. Analysis of the absolute values of differences showed that the accuracy of the proposed system varied among subjects. In the higher accuracy group, step length and width were estimated with absolute differences of approximately 16.1 mm and 31.2 mm, respectively, and the entire sole was stably and steadily in ground contact from the heel to the toe. However, in the lower accuracy group, step length and width were estimated with absolute differences of approximately 61.2 mm and 34.4 mm, respectively, and the toes were sometimes off ground. The results suggest that the accuracy of the proposed system varies depending on the type of gait, and that the image processing method requires further improvement. However, the proposed system provides a new approach to gait analysis that requires a short walk and no preparations or special wear. In addition, the CaTTaP has the potential to measure parameters such as the plantar contact area, plantar skin deformation, and shape of the sole with clearer dynamic plantar images that are dif cult to obtain continuously by other devices. The novel CaTTaP is one of the best gait analysis systems available for clinical use.
Equivalence Testing for FORTRAN Mutation System Using Data Flow Analysis.

Abstract : Program mutation is a new approach to program testing, a method designed to test whether a program is either correct or radically incorrect. It requires the creation of a nearly correct program called a mutant from a program P. An adequate set of test data distinguishes all mutants from P by comparing the outputs. Obviously, an equivalent mutant, which performs identically to P, produces the same outputs as those of P. Thus, for adequate data selection, it is desirable that an equivalent mutant be excluded from the testing process. For this purpose, the system equivalence command has been implemented as an equivalent mutant detector. As yet, the command has not been automated. Automatic detection by this command is implemented here as an application of data flow analysis. Algorithms and implementation techniques of data flow analysis are described. Also its application as an automatic detector is described. (Author)
Custom optimization algorithms for efficient hardware implementation

The focus is on real-time optimal decision making with application in advanced control systems. These computationally intensive schemes, which involve the repeated solution of (convex) optimization problems within a sampling interval, require more efficient computational methods than currently available for extending their application to highly dynamical systems and setups with resource-constrained embedded computing platforms. A range of techniques are proposed to exploit synergies between digital hardware, numerical analysis and algorithm design. These techniques build on top of parameterisable hardware code generation tools that generate VHDL code describing custom computing architectures for interior-point methods and a range of first-order constrained optimization methods. Since memory limitations are often important in embedded implementations we develop a custom storage scheme for KKT matrices arising in interior-point methods for control, which reduces memory requirements significantly and prevents I/O bandwidth limitations from affecting the performance in our implementations. To take advantage of the trend towards parallel computing architectures and to exploit the special characteristics of our custom architectures we propose several high-level parallel optimal control schemes that can reduce computation time. A novel optimization formulation was devised for reducing the computational effort in solving certain problems independent of the computing platform used. In order to be able to solve optimization problems in fixed-point arithmetic, which is significantly more resource-efficient than floating-point, tailored linear algebra algorithms were developed for solving the linear systems that form the computational bottleneck in many optimization methods. These methods come with guarantees for reliable operation. We also provide finite-precision error analysis for fixed-point implementations of first-order methods that can be used to minimize the use of resources while meeting accuracy specifications. The suggested techniques are demonstrated on several practical examples, including a hardware-in-the-loop setup for optimization-based control of a large airliner.
Static and dynamic job-shop scheduling using rolling-horizon approaches and the Shifting Bottleneck Procedure

Over the last decade, the semiconductor industry has witnessed a steady increase in its complexity based on improvements in manufacturing processes and equipment. Progress in the technology used is no longer the key to success, however. In fact, the semiconductor technology has reached such a high level of complexity that improvements appear at a slow pace. Moreover, the diffusion of technology among competitors shows that traditional approaches based on technological advances and innovations are not sufficient to remain competitive. A recent crisis in the semiconductor field in the summer 2001 made it even clearer that optimizing the operational control of semiconductor wafer fabrication facilities is a vital key to success. Operating research-oriented studies have been carried out to this end for the last 5 years. None of them, however, suggest a comprehensive model and solution to the operational control problem of a semiconductor manufacturing facility. Two main approaches, namely mathematical programming and dispatching rules, have been explored in the literature so far, either partially or entirely dealing with this problem. Adapting the Shifting Bottleneck (SB) procedure is a third approach that has motivated many studies. Most research focuses on optimizing a certain objective function under idealized conditions and thus does not take into consideration system disruptions such as machine breakdown. While many papers address the adaptations of the SB procedure, the problem of re-scheduling jobs dynamically to take disruptions and local disturbances (machines breakdown, maintenance.) into consideration shows interesting perspectives for research. Dealing with local disturbances in a production environment and analyzing their impact on scheduling policies is a complex issue. It becomes even more complex in the semiconductor industry because of the numerous inherent constraints to take into account. The problem that is addressed in this thesis consists of studying dynamic scheduling in a job-shop environment where local disturbances occur. This research focuses on scheduling a large job shop and developing re-scheduling policies when local disturbances occur. The re-scheduling can be applied to the whole production horizon considered in the instance, or applied to a restricted period T that becomes a decision variable of the problem. The length of the restricted horizon T of re-scheduling can influence significantly the overall results. Its impact on the general performance is studied. Future extensions can be made to include constraints that arise in the semiconductors industry, such as the presence of parallel and batching machines, reentrant flows and the lot dedication problem. The theoretical results developed through this research will be applied to data sets to study their efficiency. We hope this methodology will bring useful insights to dealing effectively with local disturbances in production environments.
Systolic algorithms & architectures

Part 1 Systolic algorithms: introduction convolution arrays dense matrix-matrix product linear systems bank matrices graph algorithms systolic stacks and applications. Part 2 Architectures and methodologies: systolic chips and architectures partitioning techniques and fault tolerance languages (OCCAM, SISYC) systolizing synchronous circuits automatic sythesis of systolic architectures extensions of the dependence analysis methodology.
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Distributed Formation Control for Target-enclosing Operation by Multiple Dynamic Agents based on a Cyclic Pursuit Strategy

This paper studies a design methodology of a distributed cooperative controller for target-enclosing operations by multiple dynamic agents. To this end, we first present an on-line path generator design method based on a cyclic pursuit scheme. Then, we provide the stability condition which the developed path generator should satisfy. This condition is derived based on a simple stability analysis method for hierarchical large-scale linear systems with generalized frequency variable. The formation control scheme combined with a cyclic pursuit based distributed on-line path generator satisfying the derived stability condition guarantees the required global convergence property with theoretical rigor. Further, in order to show clearly its distinctive features, we present how to design a formation controller for a class of multiagent systems where each agent is modeled as a second-order system and is locally stabilized by the PD/PID controllers. For each cases, we also show that the formation stability can be easily analyzed based on the generalized Kalman-Yakubovich-Popov (KYP) lemma. Simulation examples illustrate its distinctive features and the achievement of a desired pursuit pattern.
Statistical Group Comparison

Preface. 1. Introduction. 1.1 Rationale for Statistical Comparison. 1.2 Comparative Research in the Social Sciences. 1.3 Focus of the Book. 1.4 Outline of the Book. 2. Statistical Foundation for Comparison. 2.1 A System for Statistical Comparison. 2.2 Test Statistics. 2.3 What to Compare? 3. Comparison in Linear Models. 3.1 Introduction. 3.2 An Example. 3.3 Some Preliminary Considerations. 3.4 The Linear Model. 3.5 Comparing Two Means. 3.6 ANOVA. 3.7 Multiple Comparison Methods. 3.8 ANCOVA. 3.9 Multiple Linear Regression. 3.10 Regression Decomposition. 3.11 Which Linear Method to Use? 4. Nonparametric Comparison. 4.1 Nonparametric Tests. 4.2 Resampling Methods. 4.3 Relative Distribution Methods. 5. Comparison of Rates. 5.1 The Data. 5.2 Standardization. 5.3 Decomposition. 6. Comparison in Generalized Linear Models. 6.1 Introduction. 6.2 Comparing Generalized Linear Models. 6.3 A Logit Model Example. 6.4 A Hazard Rate Model Example. 6.A Data Used in Section 6.4. 7. Additional Topics of Comparison in Generalized Linear Models. 7.1 Introduction. 7.2 GLM for Matched Case--Control Studies. 7.3 Dispersion Heterogeneity. 7.4 Bayesian Generalized Linear Models. 7.A The Data for the n : m Design. 8. Comparison in Structural Equation Modeling. 8.1 Introduction. 8.2 Statistical Background. 8.3 Mean and Covariance Structures. 8.4 Group Comparison in SEM. 8.5 An Example. 8.A Examples of Computer Program Listings. 9. Comparison with Categorical Latent Variables. 9.1 Introduction. 9.2 Latent Class Models. 9.3 Latent Trait Models. 9.4 Latent Variable Models for Continuous Indicators. 9.5 Casual Models with Categorical Latent variables. 9.6 Comparison with Categorical Latent Variables. 9.7 Examples. 9.A Software for Categorical Latent Variables. 9.B Computer Program Listings for the Examples. 10. Comparison in Multilevel Analysis. 10.1 Introduction. 10.2 An Introduction to Multilevel Analysis. 10.3 The Basics of the Linear Multilevel Model. 10.4 The Basics of the Generalized Linear Multilevel Model. 10.5 Group as an External Variable in Multilevel Analysis. 10.6 The Relation between Multilevel Analysis and Group Comparison. 10.7 Multiple Membership Models. 10.8 Summary. 10.A Software for Multilevel Analysis. 10.B SAS Program Listings for GLMM Examples. References. Index.
Refining Composition Skills: Academic Writing and Grammar

The new edition of this best-selling series combines comprehensive development and practice in the rhetorical modes while integrating instruction in reading, grammar, critical thinking, and vocabulary development. -Developing Composition Skills focuses students on narrating, describing, analyzing, comparing and contrasting, classifying, and evaluating at the paragraph level and offers a complete introduction that bridges the gap between the paragraph and the essay level. -Refining Composition Skills develops essay writing skills needed for success at the college level by thoroughly reviewing and presenting the following rhetorical modes: compare and contrast, example, classification, process analysis, cause and effect, and argument
FREQUENCY AND FACT: LEARNING ABOUT THE WORLD THROUGH A CORPUS OF WORLD-ENGLISHES

Two studies are presented, linking word-frequency information within the Global Corpus of Web-based English to real world facts. The first study concerns how patterns of the use of place names reflect geospatial and geopolitical relationships of English-speaking nations. The second study concerns how the emotional connotation of words before place names reflects general well-being in that place. Taken together, these studies demonstrate that the surface structure of language, as embodied in word frequencies, is a useful source of information about the real world.
Charge-domain sampling of high-frequency signals with embedded filtering

Subsampling can be used in a radio receiver to perform signal downconversion and sample-and-hold operations in order to relieve the operation frequency and bandwidth requirements of the subsequent discrete-time circuitry. However, due to the inherent aliasing behaviour of wideband noise and interference in subsampling, and the difficulty of implementing appropriate bandpass anti-aliasing filtering at high frequencies, straightforward use of a low subsampling rate can result in significant degradation of the receiver dynamic range. The aim of this thesis is to investigate and implement methods for integrating filtering into high-frequency signal sampling and downconversion by subsampling to alleviate the requirements for additional front-end filters and to mitigate the effects of noise and out-of-band signal aliasing, thereby facilitating use in integrated high-quality radio receivers. The charge-domain sampling technique studied here allows simple integration of both continuous-and discrete-time filtering functions into high-frequency signal sampling. Gated current integration results in a lowpass sin(x)/x(sinc(x)) response capable of performing built-in anti-aliasing filtering in baseband signal sampling. Weighted integration of several successive current samples can be further used to obtain an embedded discrete-time finite-impulse-response (FIR) filtering response, which can be used for internal anti-aliasing and image-rejection filtering in the downconversion of bandpass signals by subsampling. The detailed analysis of elementary charge-domain sampling circuits presented here shows that the use of integrated FIR filtering with subsampling allows acceptable noise figures to be achieved and can provide effective internal anti-aliasing rejection. The new methods for increasing the selectivity of elementary charge-domain sampling circuits presented here enable the integration of advanced, digitally programmable FIR filtering functions into high-frequency signal sampling, thereby markedly relieving the requirements for additional antialiasing, image rejection and possibly even channel selection filters in a radio receiver. BiCMOS and CMOS IF sampler implementations are presented in order to demonstrate the feasibility of the charge-domain sampling technique for integrated anti-aliasing and image-rejection filtering in IF signal quadrature downconversion by subsampling. Circuit measurements show that this sampling technique for built-in filtering results in an accurate frequency response and allows the use of high subsampling ratios while still achieving a competitive dynamic range.
Smartphone applications in the support of weight reduction and goal maintenance

The use of smartphones gets promoted in healthcare self-intervention setups. Its benefits include convenience, cost effectiveness and accessible weight management features among others. The aim of this study is to gather real-world smartphone application user data in order to analyse the efficiency of smartphone application features. This aim encloses applications for the reduction or maintenance of weight. Relevant members of online health communities were invited to participate in an online survey. The survey lasted for 6 weeks and received a total of 51 valid respondents. The analysis was divided into 2 groups, one group (n=29) had experience using a smartphone application in their weight management goal while another group did not use applications before (n=22). Among the application users, a significant BMI improvement was found (9.1%). We conclude that in our sample, the use of automatic weight control applications leads to a more healthy living style.
Proofs of Correctness for Three Decentralized Authentication Protocols Using Strand Spaces

Proofs of Correctness for Three Decentralized Authentication Protocols Using Strand Spaces Pavan Kumar Vankamamidi Department of Computer Science, BYU Master of Science Security is a major concern is today’s online world. As online activities become increasingly sensitive, service providers rely on security protocols to ensure confidentiality, integrity and authentication of their users and data. Greater assurance is provided when these protocols are verified to be correct. Strand Spaces is a method to formally analyze security protocols. The arguments are based on the messages being transmitted and received while assuming that the underlying cryptographic primitives are secure. This thesis demonstrates that the protocols Luau, pwdArmor and Kiwi are secure using Strand Spaces methodology.
Extending the Java Programming Language with Generators

The Java programming language allows to create portable applications in a variety of domains. With the continuous development and demanding environment in industrial and research fields many proposals exist to extend the language in order to facilitate a more easier development and implementation of applications. Many extensions have been implemented by applying several program transformation techniques such as Domain Specific Languages (DSLs), extensions to existing compilers, language extension assimilation, intermediate code transformation and strategy rewriting frameworks. A particular extension that has not yet been integrated in the Java programming language and merits further research is generators. This extension allows an easier implementation of iterators and is suitable for many other patterns due to its semantics. In this thesis report we introduce generators and discuss the design and implementation of a non-intrusive solution that extends the Java programming language with this construct by means of intermediate code manipulation (bytecode weaving). We also evaluate the implemented solution and demonstrate a sample application where we assess the performance of generators. Finally, we discuss our experiences of implementing this extension in relation to a solution for language extensions in general by means of this non-intrusive approach.
The development of life transition skills in Inter-Life: a novel, 3-dimensional virtual learning environment

Inter-Life is a novel multi-modal, immersive virtual learning environment for the development of life transition skills in young people. Current policy highlights the role of technology in collaborative learning in a social and interactive manner. This article illustrates how Inter-Life is appropriated by a group of Looked After and Accommodated Children (LAAC) to help shape their own learning. Such a learner centred approach resonates with the current policy debate on the role of technology in education.
Parâmetros hídricos em angiospermas lenhosas de clima temperado durante os estádios de repouso e crescimento

O conhecimento dos processos fisiologicos, tanto na fase de repouso quanto no desenvolvimento vegetativo, e importante na adaptacao das angiospermas lenhosas de clima temperado, especialmente na questao da gestao da agua pela planta. Os objetivos deste trabalho foram avaliar o conteudo da agua e o metabolismo de carboidratos durante o progresso da dormencia em pereiras, avaliar estrategias do uso da agua em duas especies lenhosas (macieira e nogueira), que foram submetidas a tres niveis de deficit hidrico, e por fim, avaliar a confiabilidade da tecnica de injecao de ar para inducao a cavitacao em tres especies de angiospermas lenhosas. No primeiro experimento, conduzido durante o outono e inverno de 2008 no Brasil, utilizou-se plantas de pereira cultivares Housui e Packham´s Triumph. O segundo experimento foi desenvolvido na Franca durante o verao de 2009, com macieiras e nogueiras sob estresse hidrico. O terceiro experimento foi conduzido na Franca em 2009 com tres especies de angiospermas lenhosas com diferentes comprimentos dos vasos do xilema, Betula pendula, Prunus persica e Quercus robur. A partir dos resultados concluiu-se que o conteudo de agua nos tecidos pode ser um marcador do progresso da dormencia para cv. Packham s Triumph. Porem os dados nao foram conclusivos para cv. Housui. O fechamento estomatico pode ser um importante parâmetro na prevencao a cavitacao xilematica em nogueiras e macieiras submetidas a deficit hidrico no solo. Em regime de secas severas, a macieira mantem os estomatos parcialmente abertos, indicando maior tolerância desta especie a seca quando comparado a nogueira. E por fim, a tecnica de injecao de ar utilizando câmara de ar com duas saidas e fiavel para especies com xilema de porosidade difusa, utilizando câmaras curtas e amostras de ramo que tenha comprimento superior aos vasos do xilema.