Miracle-dz/UniFAR-FTUs huggingface dataset:
Camera Models and Fundamental Concepts Used in Geometric Computer Vision

This survey is mainly motivated by the increased availability and use of panoramic image acquisition devices, in computer vision and various of its applications. Different technologies and different computational models thereof exist and algorithms and theoretical studies for geometric computer vision ("structure-from-motion") are often re-developed without highlighting common underlying principles. One of the goals of this survey is to give an overview of image acquisition methods used in computer vision and especially, of the vast number of camera models that have been proposed and investigated over the years, where we try to point out similarities between different models. Results on epipolar and multi-view geometry for different camera models are reviewed as well as various calibration and self-calibration approaches, with an emphasis on non-perspective cameras. We finally describe what we consider are fundamental building blocks for geometric computer vision or structure-from-motion: epipolar geometry, pose and motion estimation, 3D scene modeling, and bundle adjustment. The main goal here is to highlight the main principles of these, which are independent of specific camera models.
Modeling and Simulation of Skeletal Muscle for Computer Graphics: A Survey

Muscles provide physiological functions to drive body movement and anatomically characterize body shape, making them a crucial component of modeling animated human figures. Substantial effort has been devoted to developing computational models of muscles for the purpose of increasing realism and accuracy in computer graphics and biomechanics. We survey various approaches to model and simulate muscles both morphologically and functionally. Modeling the realistic morphology of muscle requires that muscle deformation be accurately depicted. To this end, several methodologies are presented, including geometrically-based, physically-based, and data-driven approaches. On the other hand, the simulation of physiological muscle functions aims to identify the biomechanical controls responsible for realistic human motion. Estimating these muscle controls has been pursued through static and dynamic simulations. We review and discuss all these approaches, and conclude with suggestions for future research.
Three-dimensional Integrated Circuits: Design, EDA, and Architecture

The emerging three-dimensional (3D) integration technology is one of the promising solutions to overcome the barriers in interconnection scaling, thereby offering an opportunity to continue performance improvements using CMOS technology. As the fabrication of 3D integrated circuits has become viable, developing CAD tools and architectural techniques are imperative for the successful adoption of 3D integration technology. In this article, we first give a brief introduction on the 3D integration technology, and then review the EDA challenges and solutions that can enable the adoption of 3D ICs, and finally present design and architectural techniques on the application of 3D ICs, including a survey of various approaches to design future 3D ICs, leveraging the benefits of fast latency, higher bandwidth, and heterogeneous integration capability that are offered by 3D technology.
Web History Tools and Revisitation Support: A Survey of Existing Approaches and Directions

Millions of web pages are visited, and revisited every day. On average, every second page loaded was already visited before by the same user — individual means for recurrence rates range between 20% and 72% (cf. p. 24). People revisit pages within a session or between parallel ones, they reuse web-based tools habitually, monitor specific content or resume interrupted sessions, and they want to re-find content after longer periods of time. Current history tools that support such revisits show unique and severe shortcomings. Often, revisits are cumbersome, more than necessary. This survey summarizes existing knowledge about revisitations on the web, and surveys the potential of graphic-based web history tools. A taxonomy of revisit-types distinguishes between short-, medium-, and long-term revisits, but also intra-and inter-session revisits. Assisted by a clear nomenclature this provides more clarity to the current discussion. The potential use of graphic-based tools is analyzed and discussed with respect to the found categories. The value of the current, mainly non-graphical history tools, such as back button, bookmarks, history list, search engines, and search bars is examined and related to the potential offered by graphic-based tools. The survey provides summaries of key studies and bodies of research for those who are interested in improving the web users' experience by simplifying the processes of going back to resources visited seconds, minutes, hours, weeks, or even months ago. It is meant for developers and researchers, browser and search engine producers, web usability professionals, and those who feel an irresistible urge to creatively innovate the web. The time has come to design and offer more appropriate history support. This survey aims at providing a foundation, as well as valuable ideas for doing so.
Tangible User Interfaces: Past, Present and Future Directions

In the last two decades, Tangible User Interfaces (TUIs) have emerged as a new interface type that interlinks the digital and physical worlds. Drawing upon users' knowledge and skills of interaction with the real non-digital world, TUIs show a potential to enhance the way in which people interact with and leverage digital information. However, TUI research is still in its infancy and extensive research is required in order to fully understand the implications of tangible user interfaces, to develop technologies that further bridge the digital and the physical, and to guide TUI design with empirical knowledge. This monograph examines the existing body of work on Tangible User Interfaces. We start by sketching the history of tangible user interfaces, examining the intellectual origins of this field. We then present TUIs in a broader context, survey application domains, and review frameworks and taxonomies. We also discuss conceptual foundations of TUIs including perspectives from cognitive sciences, psychology, and philosophy. Methods and technologies for designing, building, and evaluating TUIs are also addressed. Finally, we discuss the strengths and limitations of TUIs and chart directions for future research.
Trained to accept?: a field experiment on consent dialogs

A typical consent dialog was shown in 2 x 2 x 3 experimental variations to 80,000 users of an online privacy tool. We find that polite requests and button texts pointing to a voluntary decision decrease the probability of consent---in contrast to findings in social psychology. Our data suggests that subtle positive effects of polite requests indeed exist, but stronger negative effects of heuristic processing dominate the aggregated results. Participants seem to be habituated to coercive interception dialogs---presumably due to ubiquitous EULAs---and blindly accept terms the more their presentation resembles a EULA. Response latency and consultation of online help were taken as indicators to distinguish more systematic from heuristic responses.
The role of emotion in believable agents

Abstract Arti(cid:12)cial intelligence researchers attempting to create engaging, apparently living creatures may (cid:12)nd important insight in the work of artists who have explored the idea of believable character. In particular, appropriately timed and clearly expressed emotion is a central requirement for believable characters. We discuss these ideas and suggest how they may apply to believable interactive characters, which we call \believable agents. " This work was supported in part by Fujitsu Laboratories and Mitsubishi Electric Research Laboratories. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the o(cid:14)cial policies, either expressed or implied, of any other parties.
RAID: high-performance, reliable secondary storage

Disk arrays were proposed in the 1980s as a way to use parallelism between multiple disks to improve aggregate I/O performance. Today they appear in the product lines of most major computer manufacturers. This article gives a comprehensive overview of disk arrays and provides a framework in which to organize current and future work. First, the article introduces disk technology and reviews the driving forces that have popularized disk arrays: performance and reliability. It discusses the two architectural techniques used in disk arrays: striping across multiple disks to improve performance and redundancy to improve reliability. Next, the article describes seven disk array architectures, called RAID (Redundant Arrays of Inexpensive Disks) levels 0–6 and compares their performance, cost, and reliability. It goes on to discuss advanced research and implementation topics such as refining the basic RAID levels to improve performance and designing algorithms to maintain data consistency. Last, the article describes six disk array prototypes of products and discusses future opportunities for research, with an annotated bibliography disk array-related literature.
Music Information Retrieval: Recent Developments and Applications

We provide a survey of the field of Music Information Retrieval (MIR), in particular paying attention to latest developments, such as semantic auto-tagging and user-centric retrieval and recommendation approaches. We first elaborate on well-established and proven methods for feature extraction and music indexing, from both the audio signal and contextual data sources about music items, such as web pages or collaborative tags. These in turn enable a wide variety of music retrieval tasks, such as semantic music search or music identification ("query by example"). Subsequently, we review current work on user analysis and modeling in the context of music recommendation and retrieval, addressing the recent trend towards user-centric and adaptive approaches and systems. A discussion follows about the important aspect of how various MIR approaches to different problems are evaluated and compared. Eventually, a discussion about the major open challenges concludes the survey.
Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering: (extended abstract)

In this paper we consider the<italic>k</italic>-clustering problem for a set <italic>S</italic> of <italic>n</italic> points <inline-equation><f><inf>i</inf>=<fen lp="par"><b>x<inf>i</inf></b><rp post="par"> </fen></f> </inline-equation> in the<italic>d</italic>-dimensional space with variance-based errors as clustering criteria, motivated from the color quantization problem of computing a color lookup table for frame buffer display. As the inter-cluster criterion to minimize, the sum on intra-cluster errors over every cluster is used, and as the intra-cluster criterion of a cluster<inline-equation><f>S<inf>j</inf></f> </inline-equation>, <display-equation><fd><fl><fen lp="vb"><g>a </g>-1<sum align="c"><ll>p<inf>i</inf>∈S<inf>j</inf></ll></sum><fen lp="vb" style="d"><b>x<inf>i</inf>-<ovl>x</ovl></b><fen lp="par"> S<inf>j</inf><rp post="par"></fen><rp post="vb"style="d"></fen> <sup>2</sup><rp post="vb"></fen></fl></fd></display-equation> is considered, where <inline-equation><f><fen lp="vb" style="d">˙<rp post="vb" style="d"></fen></f> </inline-equation> is the <inline-equation><f>L<inf>2</inf></f></inline-equation> norm and <inline-equation><f><b><ovl>x</ovl><fen lp="par">S<inf>j</inf><rp post="par"></fen></b></f></inline-equation> is the centroid of points in <inline-equation><f>S<inf>j</inf></f></inline-equation>, i.e., <inline-equation><f><fen lp="par">1/<fen lp="vb">S<inf>j</inf><rp post="vb"></fen><rp post="par"></fen><sum align="c"><ll>p<inf>i</inf>∈S<inf>j</inf></ll></sum><b>x<inf>i</inf></b></f></inline-equation>. The cases of <inline-equation><f><g>a</g>=1,2</f></inline-equation> correspond to the sum of squared errors and the all-pairs sum of squared errors, respectively. The <italic>k</italic>-clustering problem under the criterion with <inline-equation><f><g>a</g>=1,2</f></inline-equation> are treated in a unified manner by characterizing the optimum solution to the <italic>k</italic>clustering problem by the ordinary Euclidean Voronoi diagram and the weighted Voronoi diagram with both multiplicative and additive weights. With this framework, the problem is related to the generalized primary shutter function for the Voronoi diagrams. The primary shutter function is shown to be <inline-equation><f>O<fen lp="par">n<sup>O<fen lp="par">kd<rp post="par"></fen></sup><rp post="par"></fen></f></inline-equation>, which implies that, for fixed <italic>k</italic>, this clustering problem can be solved in a polynomial time. For the problem with the most typicalintra-cluster criterion of the sum of squared errors, we also present anefficient randomized algorithm which, roughly speaking, finds an <inline-equation><f>∈</f></inline-equation>–approximate 2–clustering in<inline-equation><f>O<fen lp="par">n<fen lp="par">1/∈<rp post="par"></fen><sup>d</sup><rp post="par"></fen></f></inline-equation> time, which is quite practical and may be used to real large-scale problems such as the color quantization problem.
Big Graph Analytics Platforms

Due to the growing need to process large graph and network datasetscreated by modern applications, recent years have witnessed a surginginterest in developing big graph platforms. Tens of such big graphsystems have already been developed, but there lacks a systematic categorizationand comparison of these systems. This article provides atimely and comprehensive survey of existing big graph systems, andsummarizes their key ideas and technical contributions from variousaspects. In addition to the popular vertex-centric systems which espousea think-like-a-vertex paradigm for developing parallel graph applications,this survey also covers other programming and computationmodels, contrasts those against each other, and provides a vision forthe future research on big graph analytics platforms. This survey aimsto help readers get a systematic picture of the landscape of recent biggraph systems, focusing not just on the systems themselves, but alsoon the key innovations and design philosophies underlying them.
Novel Methods of Inspiratory Muscle Training via the Test of Incremental Respiratory Endurance (TIRE)

The favorable effects of inspiratory muscle training (IMT) in health and disease are becoming much more apparent. A variety of IMT methods exist, but few studies have compared IMT methods. The purpose of this article is to review the methods and outcomes of the Test of Incremental Respiratory Endurance (TIRE).
Practical power modeling of data transmission over 802.11g for wireless applications

Previous studies have shown that a significant part of the overall energy consumption of battery-powered mobile devices is caused by network data transmission. Power models that describe the power consumption behavior of the network data transmission are therefore an essential tool in estimating the battery lifetime and in minimizing the energy usage of mobile devices. In this paper, we present a simple and practical power model for data transmission over an 802.11g WLAN and show its accuracy against physical data measured from three popular mobile platforms, Maemo, Android and Symbian. Our model estimates the energy usage based on the data transmission flow characteristics which are easily available on all the platforms without modifications to low-level software components or hardware. Based on our measurements and experimentation on real networks we conclude that our model is easy to apply and of adequate accuracy.
Theory of Disagreement-Based Active Learning

Active learning is a protocol for supervised machine learning, in which a learning algorithm sequentially requests the labels of selected data points from a large pool of unlabeled data. This contrasts with passive learning, where the labeled data are taken at random. The objective in active learning is to produce a highly-accurate classifier, ideally using fewer labels than the number of random labeled data sufficient for passive learning to achieve the same. This article describes recent advances in our understanding of the theoretical benefits of active learning, and implications for the design of effective active learning algorithms. Much of the article focuses on a particular technique, namely disagreement-based active learning, which by now has amassed a mature and coherent literature. It also briefly surveys several alternative approaches from the literature. The emphasis is on theorems regarding the performance of a few general algorithms, including rigorous proofs where appropriate. However, the presentation is intended to be pedagogical, focusing on results that illustrate fundamental ideas, rather than obtaining the strongest or most general known theorems. The intended audience includes researchers and advanced graduate students in machine learning and statistics, interested in gaining a deeper understanding of the recent and ongoing developments in the theory of active learning.
Improvement of Hölbl et al. user authentication protocol and password change protocol

Many remote authentication and key exchange protocols have been published in recent years. In 2008 Hölbl et al. proposed a password-based protocol for remote user authentication and password changing. This protocol protects message transmission between senders and receivers over insecure networks. In this paper we will show that the Hölbl et al. protocol remains vulnerable to stolen-verifier attack, off-line password guessing attack, and Denial-of-Service (DoS) attack. In addition, we proposed an improve protocol to withstand such security flaws.
Venous thromboembolism : risk profile and management of prophylaxis in gynaecological surgery patients

Objectives. This study aims to describe the venous thromboembolism (VTE) risk profile of women undergoing elective gynaecological surgery in a tertiary hospital and to audit the VTE prophylaxis prescribed. Methods. One hundred and nine women who underwent elective gynaecological surgery at Kalafong Provincial Tertiary Hospital were assessed in terms of their risk of developing perioperative VTE, using the modified Caprini VTE risk assessment model. An audit of the VTE prophylaxis they received was conducted postoperatively . Results. Of the 109 women, 45% were classified as at very high risk for VTE, 38% as at high risk, 14% as at moderate risk and 3% as at low risk. The audit revealed that only 5% of patients received the correct VTE prophylaxis, 55% received inadequate prophylaxis and 40% received no prophylaxis. Discussion. The majority of patients undergoing elective gynaecological surgery are either at high risk or very high risk for developing postoperative VTE-related morbidity. This group of patients require formal preoperative VTE risk assessment using a recognised scoring model. VTE prophylaxis should be administered according to recognised guidelines to avoid inadequate prophylaxis.
Effects of nutrition on the conjugated linoleic acid content of milk

CLA refers to a group of positional and geometric isomers of the omega-6 essential fatty acid, octadecadienoic acid. CLA, and more specifically cis-9, trans-11C 18:2, has received considerable attention due to reports of its possible health effects on consumers, whether they are humans or animals. This survey reports on the CLA content of milk from Holstein and Jersey cows on two production systems in the Western Cape, South Africa. Samples were collected from bulk tanks and co-operative silos representing Jersey and Holstein milk from both pasture and TMR-based systems. Samples were analysed for milk and fatty acid composition. Protein and fat content varied between breeds, but not between production systems whilst lactose differed between production systems but not breeds. The CLA levels in the milk from both cow breeds on both production systems were on the low side, but within the range of reported values. CLA levels in milk from the two different production systems differed significantly. Mean CLA level in milk fat of cows from pasture and TMR-based systems were 10.5 and 5.45 mg/g of FA, respectively. Breeds did not differ in the CLA content of milk fat. This is a first report of the CLA levels in milk fat produced in South Africa.
Schism: fragmentation-tolerant real-time garbage collection

Managed languages such as Java and C# are being considered for use in hard real-time systems. A hurdle to their widespread adoption is the lack of garbage collection algorithms that offer predictable space-and-time performance in the face of fragmentation. We introduce SCHISM/CMR, a new concurrent and real-time garbage collector that is fragmentation tolerant and guarantees time-and-space worst-case bounds while providing good throughput. SCHISM/CMR combines mark-region collection of fragmented objects and arrays (arraylets) with separate replication-copying collection of immutable arraylet spines, so as to cope with external fragmentation when running in small heaps. We present an implementation of SCHISM/CMR in the Fiji VM, a high-performance Java virtual machine for mission-critical systems, along with a thorough experimental evaluation on a wide variety of architectures, including server-class and embedded systems. The results show that SCHISM/CMR tolerates fragmentation better than previous schemes, with a much more acceptable throughput penalty.
Sensor Fault Diagnosis

This tutorial investigates the problem of the occurrence of multiple faults in the sensors used to monitor and control a network of cyberphysical systems. The goal is to formulate a general methodology, which will be used for designing sensor fault diagnosis schemes with emphasis on the isolation of multiple sensor faults, and for analyzing the performance of these schemes with respect to the design parameters and system characteristics. The backbone of the proposed methodology is the design of several monitoring and aggregation cyber agents (modules) with specific properties and tasks. The monitoring agents check the healthy operation of sets of sensors and infer the occurrence of faults in these sensor sets based on structured robustness and sensitivity properties. These properties are obtained by deriving analytical redundancy relations of observer-based residuals sensitive to specific subsets of sensor faults, and adaptive thresholds that bound the residuals under healthy conditions, assuming bounded modeling uncertainty and measurement noise. The aggregation agents are employed to collect and process the decisions of the agents, while they apply diagnostic reasoning to isolate combinations of sensor faults that have possibly occurred. The design and performance analysis methodology is presented in the context of three different architectures: for cyber-physical systems that consist of a set of interconnected systems, a distributed architecture and a decentralized architecture, and for cyber-physical systems that are treated as monolithic, a centralized architecture. For all three architectures, the decomposition of the sensor set into subsets of sensors plays a key role in their ability to isolate multiple sensor faults. A discussion of the challenges and benefits of the three architectures is provided, based on the system scale, the type of system nonlinearities, the number of sensors and the communication needs. Lastly, this tutorial concludes with a discussion of open problems in fault diagnosis. V. Reppa, M. M. Polycarpou and C. G. Panayiotou. Sensor Fault Diagnosis. Foundations and Trends © in Systems and Control, vol. 3, no. 1-2, pp. 1–248, 2016. DOI: 10.1561/2600000007. Full text available at: http://dx.doi. org/10.1561/2600000007