Miracle-dz/UniFAR-FTUs huggingface dataset:
View-Dependent Coding of 3 D Mesh Sequences

Visibility computations are commonly used in computer graphics applications. This paper presents a new view-dependent compression technique for 3D mesh sequences. The approach consists of geometry coding of visible parts and region descriptions of changes in visible regions. The proposed view-dependent compression method yields significant improvement in compression performance over compression method without visibility awareness with gains up to 47%.
Presence : Head Mounted Display vs . Translucid Screen

Among others, two displays are used when exposure to virtual worlds is required: Head Mounted Displays (HMD) and Translucid Screens (TS). The higher sense of immersion brought about by these two devices gives them an advantage over traditional media displays. In fact, both HMD and TS enable a superior sense of presence in virtual worlds. However, the difference in the degree of presence between them is not well documented. This article presents and discusses a study that measured presence using a HMD and a TS. Sixty-nine subjects were exposed to two different neutral virtual worlds (20 minutes each world), one using a HMD and other a TS. Presence was assessed through Slater-Usoh-Steed questionnaire (1994). Significant differences (α=.05) were found between HMD and TS. In fact, results from Paired Samples T-Test (t(68)=-5.49, p=. 00) revealed that presence with the HMD (X=3.23; s=.61) was significant higher than the one with the TS (X=3.01; s=.51). Cybersickness was found on 21.7% of the HMD subjects and on 27.5% of the TS subjects. In both conditions, presence was significantly inferior on subjects with cybersickness. ANNUAL REVIEW OF CYBERTHERAPY AND TELEMEDICINE
Greedy Channel Router Implementation in FORTRAN

During this project, the Greedy Channel Router was implemented in FORTRAN. This will allow students to break their general routing problems into channel routing problems to be done by the program. Since many students know FORTRAN, it will also be possible to build on the program and develop a more general router in the future [1]. I NTRODUCT ION The main goal of any routing scheme is to join all pins having the same electrical node number. It is generally desirable to route the wiring paths efficiently. This is especially true in the design of an integrated circuit since a smaller chip is less costly and operates at a faster speed. Thus, a second goal of a router should be to minimize the use of chip real estate. The router should be implemented on a computer in such a way as to make it reliable and repeatable, since a third goal is to achieve design automation. Specifically, a channel router wires between two parallel pin sets within a rectangular bounding box. These pins may belong to IC functional cells or gate arrays. Joining all pins with the same node will effectively join the cells. To accomplish this wiring, two levels of conduction paths are needed. One level is used for vertical wires while the second is used for horizontal wires. The horizontal and vertical wires do not short when they cross over each other due to an insulating layer between them. A via may be made in the insulating layer when it is desired to have a horizontal/vertical connection. The upper conduction path is usually a metal, such as aluminum. The lover conduction path may consist of a diffusion, doped polysilicon, or a metal. The insulating layer usually is silicon dioxide. The vertical wiring is done in a column, and the horizontal wiring is done in tracks. The number of tracks defines the channel width. A channel router may be part of a more general area routing scheme. The area router first breaks a general problem into pieces or component channels. The channel router then performs each partial routing. The area router joins all the solutions together to form the final routing solution [2]. In this case, the area routing package is only as effective as the channel router.
Cloud Computing: An Examination of Factors Impacting Users’ Adoption

ABSTRACT With a rapid growth in technology, cloud computing has become increasingly popular among individual users and businesses around the world. This computing technology continues to attract attention in both academic and business settings. The popularity of cloud computing is due to its ability to provide faster on-demand infrastructure, self-service, and independent ability to contribute to, and access, resources. Despite many potential benefits of cloud computing usage, there are certain aspects that have prohibited some consumers to accept this technology and remain reserved toward its adoption. There are some crucial factors to consider before cloud computing can be accepted entirely by the individual, larger business, or academic groups. This study thus aims at investigating how cloud computing is perceived by potential users and which factors have a tendency to encourage or discourage them to adopt cloud computing.
Multigrid Techniques: 1984 Guide with Applications to Fluid Dynamics, Revised Edition

List of figures List of tables Preface to the Classics Edition Preface Introduction 1. Elementary acquaintance with multigrid Part I. Stages in Developing Fast Solvers: 2. Stable discretization 3. Interior relaxation and smoothing factors 4. Interior two-level cycles 5. Boundary conditions and two-level cycling 6. Many-level cycles 7. Full multi-grid (FMG) algorithms Part II. Advanced Techniques and Insights: 8. Full approximation scheme (FAS) and applications 9. Local refinements and grid adaptation 10. Higher-order techniques 11. Coarsening guided by discretization 12. True role of relaxation 13. Dealgebraization of multigrid 14. Practical role of rigorous analysis and quantitative predictions 15. Chains of problems: frozen tau 16. Time dependent problems Part III. Applications to Fluid Dynamics: 17. Cauchy-Riemann equations 18. Steady-state Stokes equations 19. Steady-state incompressible Navier-Stokes equations 20. Compressible Navier-Stokes and Euler equations 21. Remarks on solvers for transonic potential equations Appendix: test cycle: MATLAB code Bibliography Index.
User Interface Issues in Multimedia

Much has changed in computer interfacing since the early days of computing—or has it? Admittedly, gone are the days of punched cards and/or paper tape readers as input devices; likewise, monitors (displays) have superseded printers as the primary output device. Nevertheless, the QWERTY keyboard shows little sign of falling into disuse—this is essentially the same input device as those used on the earliest (electromechanical) TeleTYpewriters, in which the “worst” key layout was deliberately chosen to slow down user input (i.e., fast typists). The three major advances since the 1950s have been (1) the rise of low cost (commodity off-theshelf) CRT monitors in the 1960s (and in more recent times, LCD ones), (2) the replacement of (text-based) command line interfaces with graphical user interfaces in the 1980s, and (3) the rise of the Internet/World Wide Web during the 1990s. In recent times, while speech recognition (and synthesis) has made some inroads (i.e., McTeal, 2002; O’Shaughnessy, 2003), the QWERTY keyboard and mouse remain the dominant input modalities.
UWB COMMUNICATIONS – A STANDARDS WAR Dillip

Ultra Wideband radio communications is an emerging technology for very high speed wireless communications, especially suited for data connections between consumer devices such as computer peripherals, laptops, PDAs, home theater equipment, digital cameras and portable audio devices. Key advantages of UWB include unprecedentedly high wireless data transfer speeds (ranging from 100 Mb/s to 500 Mb/s or more), low power consumption, very high spatial capacity of wireless data transmission, and sophisticated usage of radio frequencies that allows UWB to coexist with other simultaneously operating RF systems. At present, two competing proposals are being presented as candidates for a UWB communication standard under IEEE standardizing process. The IEEE 801.15. 3a Task Group has been trying to reach a decision upon a standard for a UWB Physical Layer (PHY) specification, but the opposing parties, Motorola and the MBOA Alliance (consisting of more than 90 companies as of April 2004), have been unable to agree. It is unclear if the IEEE process will ever reach its goal as both parties may eventually start launching products hoping their products will eventually emerge as de facto
A Systematic Literature Review of Applications of the Physics of Notations

INTRODUCTION: The Physics of Notations (PoN) is a theory for the design of cognitively effective visual notations, emphasizing the need for design grounded in objective and verifiable rationale. Although increasingly applied, no systematic analysis of PoN applications has yet been performed to assess the theory's efficacy in practice. OBJECTIVES: Our primary objective was to assess the scope and verifiability of PoN applications. METHOD: We performed a systematic literature review (SLR) of peer-reviewed PoN applications. We analyzed what visual notations have been evaluated and designed using the PoN, for what reasons, to what degree applications consider requirements of their notation's users, and how verifiable these applications are. RESULTS: Seventy PoN applications were analyzed. We found major differences between applications evaluating existing notations and applications designing new notations. Particularly, in the case of new notations, we found that most applications adopted the PoN with little critical thought towards it, rarely considered its suitability for a particular context, and typically treated and discussed the PoN with few, if any, verifiable details and data. CONCLUSION: The results warrant consideration for those applying the PoN to do so carefully, and show the need for additional means to guide designers in systematically applying the PoN.
Resilient Iterative Linear Solvers Running Through Errors.

ELLIOTT III, JAMES JOHN. Resilient Iterative Linear Solvers Running Through Errors. (Under the direction of Frank Mueller.) Future extreme-scale computer systems may expose incorrect behavior to applications, in order to save energy or increase performance. However, resilience research struggles to come up with useful abstract programming models for reasoning about faults in applications. This work mainly focuses on silent soft errors, that is, errors that do not cause the system to halt and provide no indication that they occurred. The approach presented is not specific to silent soft errors; it is a general model for tolerating abnormal behavior in numerical algorithms. We present findings targeted at silent faults that impact the data used by an algorithm. Silent faults in data, which we refer to as silent data corruption (SDC), may lead to the algorithm operating on incorrect data and presenting invalid outputs. The overarching goal of this work is to ensure that we obtain valid solutions given soft faults. Existing work in algorithm fault tolerance randomly flips bits in running applications, but this only shows average-case behavior for a low-level, artificial hardware model. Algorithm developers need to understand worst-case behavior with the higher-level data types they actually use, in order to make their algorithms more resilient. Also, we know so little about how soft faults may manifest in future hardware, that it seems premature to draw conclusions about the average case. We argue instead that numerical algorithms can benefit from a numerical unreliability fault model, where faults manifest as unbounded perturbations to floating-point data. Algorithms can use inexpensive “sanity” checks that bound or exclude error in the results of computations. Given a selective reliability programming model that requires reliability only when and where needed, such checks can make algorithms reliable despite unbounded errors. Sanity checks, and in general a healthy skepticism about the correctness of subroutines, are wise even if hardware is perfectly reliable. c © Copyright 2015 by James John Elliott III
Active Labour Market Policy in Ireland Ronan Clarke

Designing an appropriate policy response to unemployment is an ongoing and seemingly intractable problem for many governments. There is much at stake both for economies and for individuals in designing effective labour market policies. Measures designed to combat unemployment or its effects may even introduce inefficiencies that serve to increase joblessness. The recent dramatic growth in employment in Ireland poses new difficulties for policy-makers and it is necessary to ask if the existing policy framework is appropriate given current conditions.
Primary cervical cancer prevention in Morocco : HPV vaccine awareness and acceptability among parents

Cervical cancer is a major public health concern in Morocco where it represents the second most common and lethal cancer in women. Human papillomavirus (HPV) vaccines have been licensed in Morocco since 2008 but there is no available data on their acceptability. This study aimed to assess awareness of HPV and the vaccine, and to identify factors associated with acceptability of the vaccine among parents in Morocco. A questionnaire-based survey using face-to-face interviews was conducted in a sample of 852 parents (670 mothers and 182 fathers) with at least one unmarried daughter ≤26 years. The study took place within public and private health centres and clinics in four regions in Morocco between July and August 2012. The main outcome measure was willingness to consider vaccinating a daughter against HPV. Responses revealed very low awareness of HPV infection (5%) and the HPV vaccine (14%). None of the participants had vaccinated their daughters against HPV and only 35% (32% of mothers and 45% of fathers) were willing to consider doing so in the future. Higher education and income, previous awareness of the HPV vaccine and endorsement of the belief that a recommendation from the ministry of health or a doctor to have the vaccine would be encouraging, were associated with mothers’ HPV vaccine acceptance. Non-acceptance among mothers was associated with having more than two daughters, believing the vaccine was expensive and lack of information. The only factor associated with the fathers’ acceptance of the vaccine was the cost. Increasing HPV and HPV vaccine awareness through educational campaigns, along with active recommendation by physicians and a publically funded vaccination programme could increase parental acceptance of the vaccine in Morocco. © 2014 The Authors. Published by Elsevier B.V. Selection and peer-review under responsibility of the 7th Vaccine Conference Organizing Committee.
Window Detection in Facades for Aerial Texture Files of 3D CityGML Models

The author inspects the optimal way to extract geometric facade features of windows from aerial texture files of CityGML models. The following method can be integrated and used for aerial texture modifications or 3D modeling details of 3D CityGML models. The author uses the Mask R-CNN with different configurations and backbone graphs to be tested on two data sets. As to improve the scores on the data sets, two traditional solutions to adjust the results are used: The author tests to integrate the more traditional approach of dbscan clustering to correct the results. Further the author also uses the texture coordinates available from the 3D CityGML file to correct our predictions. As those 3D model textures origin from aerial photos, but are essentially smaller crops of a bigger image, facing typical challenges associated with low-level vision problems and bad image resolution and quality. This application can detect windows and facades from the Berlin CityGML model, extract the windows and doors and adjust the 3D model to integrate those. In addition, it is possible to replace the original windows and doors and insert black counterparts or standard models. The latter procedure will play a crucial role in privacy, as those elements might reveal private objects or persons next to the windows and can be automatically replaced.
Isolation, identification and attenuation of a pathogenic duck hepatitis virus type 1 in China, and complete genomic sequence comparison between the embryo-passaged, attenuated derivatives and their parent strain

Correspondence to: X. Liu, e-mail: liuxiaoli0365@sina.com, fax: +86 561 3803237 Duck viral hepatitis (DVH) is an acute and fatal disease of young ducklings characterized by rapid transmission and damages. The most important agent of DVH is duck hepatitis virus 1 (DHV-1). The effective control of DVH was achieved by active immunization of 1-day-old ducklings with an attenuated DHV-1 virus vaccine. However, the attenuated virus might reverse to virulence. In this study, a DHV-1 strain, Du/CH/LBJ/090809, was identified and its genomic sequences were determined. The genome of Du/CH/LBJ/090809 is composed of 7,692 nt excluding poly A and the virus was clustered into genotype A by comparing with other referenced DHV-1 strains. Du/CH/LBJ/090809 could lead to 30% mortality of 10-day-old specific pathogen free (SPF) ducklings. The virus was passaged serially in SPF chicken embryonated eggs and three viruses, passage 16 (P16), P29 and P40, were selected for genomic analysis. P29 and P40 were used to evaluate the attenuation in duckling by inoculating the virus to 10-day-old SPF ducklings. Results of vaccination-challenge assay showed that the inactivated virus P40 could evoke protection against the pathogenic parent virus. Nucleotide and amino acid sequences of the genomes of Du/ CH/LBJ/090809, P16, P29 and P40 were compared. Changes both in nucleotides and amino acids, which might be contributed to the decreasing in virulence by chicken embryo-passaging of DHV1, were observed. We speculated that these changes might be important in the adaption and attenuation of the virulent virus. Additionally, strains obtained in this study will provide potential candidate in the development of vaccines against DHV-1.
An Examination of Non-waged Labor and Local Food Movement Growth in the Southern Appalachians

This Thesis is brought to you for free and open access. It has been accepted for inclusion in Dissertations and Theses by an authorized administrator of PDXScholar. For more information, please contact pdxscholar@pdx.edu. Recommended Citation Marion, Amy Kathryn, "An Examination of Non-waged Labor and Local Food Movement Growth in the Southern Appalachians" (2019). Dissertations and Theses. Paper 5036.
Identification of Low Frequency Oscillations Based on Multidimensional Features and ReliefF-mRMR

Low frequency oscillations (LFOs) in power systems usually fall into two types, i.e., forced oscillations and natural oscillations. Waveforms of the two are similar, but the suppression methods are different. Therefore, it is important to accurately identify LFO type. In this paper, a method for discriminating LFO type based on multi-dimensional features and a feature selection algorithm combining ReliefF and minimum redundancy maximum relevance algorithm (mRMR) is proposed. Firstly, 53 features are constructed from six aspects—time domain, frequency domain, energy, correlation, complexity, and modal analysis—which comprehensively characterize the multidimensional features of LFO. Then, the optimal feature subset with greater relevance and less redundancy is extracted by ReliefF-mRMR. In order to improve the classification performance, a modified Support Vector Machine (SVM) with Genetic Algorithm (GA) optimizing the key parameters is adopted, which is conducted in MATLAB. Finally, in 179-bus system, the samples of LFOs are generated by the Power System Analysis Toolbox (PSAT) and the accuracy of the LFO type identification model is verified. In ISO New England and East China power grid, it is proven that the proposed method can accurately identify LFO type considering the influences of noise, oscillation mode, and data incompletion. Hence, it has good robustness, noise immunity, and practicability.
Neural Network Optimal Design Based on Orthogonal Experiment Method

In this paper, using orthogonal experiment method, taking three layers feed forward neural network as a example, problem of choosing training samples, weights and bias, training parameter of neural network is analyzed and studied. And on the basis of it, a neural network optimal design method based on orthogonal experiment method is carried out. The research result proved that using orthogonal experiment method in the conform of neural network model, an effective result can be obtained, and it is an intuitionistic, easy, objective and scientific method.
Semantic Foundations for F ?

F [23] is a verification system for ML programs developed collaboratively by Inria and Microsoft Research. ML types are extended with logical predicates that can conveniently express precise specifications for programs (preand postconditions of functions as well as stateful invariants), including functional correctness and security properties. The F type-checker implements a weakest-precondition calculus [24] to produce first-order logic formulas that are automatically discharged using the Z3 SMT solver [7]. The original F implementation [21] has been successfully used to verify nearly 50,000 lines of code, including cryptographic protocol implementations [21, 2], web browser extensions [13, 24], cloud-hosted web applications [21], and key parts of the F system itself [20]. F has also been used for formalizing the semantics of other languages, including JavaScript and a compiler from a subset of F to JavaScript [12] and TS, a secure subset of TypeScript [22]. Programs verified with F can be extracted to F#, OCaml, and JavaScript and then efficiently executed and integrated into larger code bases. While the old F design [21] was a quite successful, it had reached its limits in terms of expressiveness. Over the past 2 years, we have completely redesigned and reimplemented F [23], producing a new prototype tool that is open source and cross-platform,12 and that is already surpassing old F both in terms of external users and size of the verified code (about 55,000 lines). One of the main problems we aim to address in this redesign is that the user of old F had very few escape hatches when SMT-based automation fails. In particular, users of old F had often no way to tell whether the property they were trying to verify was true or not. This problem is not specific to old F, but general to SMT-based type-checkers and verification systems like Liquid Haskell [26], Dafny [16], and Why3 [11] where often users are left shooting in the dark when verification fails, having to enter an extremely costly debug loop of adding assertions to narrow down the problems. Instead, we want a system that combines SMT-based automation with some of the power and expressiveness of proof assistants like Coq [25] and Lean [8], which enable users to prove arbitrarily complex properties manually. To address this our F redesign has introduced full dependent types and tracking of effects, while isolating a core language of pure total functions that can be used to write specifications and proof terms. While the redesigned F verification system shows great promise in practice, its theory is more difficult and interesting than before and to a large extent work in progress. Many challenging problems remain for which operational techniques seem insufficient, and for which deeper semantic techniques seem required. We will follow three research directions: