Miracle-dz/UniFAR-FTUs huggingface dataset:
An Authoring Tool for Building Mobile Phone AR Applications

This thesis describes the research on developing an authoring tool for mobile phone Augmented Reality (AR) applications. This work is based on earlier work at the HIT Lab NZ on ComposAR, a tool for authoring PC based AR applications. We describe modifications to ComposAR that allows end-users to prototype mobile AR applications on a PC, and player software that allows prototype AR applications to be delivered on a mobile phone. In this way, end-users with little programming experience can develop simple mobile AR applications. To prove the applicability of this authoring tool, a user evaluation was conducted with some users and performance compared between programmers and non-programmers and across different authoring tools.
Joint segmentation of multiple features with application to analysis of epilepsy and music.

Multivariate data is segmented into parts, called segments, with common characteristics. The segments are assumed to have an underlying model structure. It is of interest to see whether the characteristic changes originate from a subset of features or a unique feature. Various approaches can be taken when constructing such a method for multiple features. Three di erent methods are devised and compared via a simulation study. The methods use a penalized likelihood in di erent ways to estimate the number of segments. Two of these methods exhibit positive results and are examined further. They are shown to have di erent capabilities. One method favors the detection of coordinated segment changes at the expense of nding those that originate in a unique feature. The other method has an overall better performance, i.e., it is better at locating each and every characteristic change. The two methods are applied in two real life settings, one measuring physical changes in coordination with various music and the other measuring a range of physical changes in epilepsy patients. The methods capture the trends in the data but are not able to detect precisely when the music changes or the beginning and the end of a seizure.
Modeling of vertical distribution of sound speed in water using rational Bézier courves

Modeling of one variable and two variables functions can be used in hydroacoustics and hydrography i.e. for modeling the vertical distribution of the sound speed in water (one variable functions) or sea bottom (two variable functions). There are many mathematics methods of modeling one variable functions. In the paper modeling of the one variable function for the vertical distribution of the sound speed in water using rational Bézier functions have been shown.
Evaluation and Comparison of Programming Frameworks for Shared Memory Multicore Systems

In this masters thesis we explore past work trying to classify algorithmic problems. These classications are used to select problems for evaluating dierent programming languages and frameworks. We use a subset of the 13 Dwarfs of Berkeley, more specically: dense and sparse linear algebra, spectral methods, graph traversal and MapReduce. We evaluate the performance and ease of use of two programming frameworks and two languages of interest to Etteplan, a large consultant company; C++ using either OpenMP or MPI and Erlang.We show that MPI can be used to speed up programs in a shared memory system, it handles structured problems well but struggles with more dynamic work loads such as the graph traversal algorithm BFS that we use as a benchmark. Additionally we show that OpenMP is an easy way to gain performance by utilizing thread level parallelism in most situations. Erlang, the concurrency focused programming language from Ericsson is explored as an alternative to C++. However its immutable tree data structures do not compete with ecient in-place updates of memory arrays with constant access time.
The World Wide Web Complete Reference

Part 1 An introduction to the Web: what is the World Wide Web how to use this book getting connected using Web browsers turnkey access packages Web access through information services. Part 2 Creating Web pages: the phenomena of the home page the philosophy of a good Web page the language of the Web - HTML HTML editors linking and embedding integrating other Internet services creating a data entry form finding a home for your pages securing your pages and forms gathering statistics with your Web pages. Part 3 Advance connection to the Internet: establishing your presence on the Web protocols and alphabet soup digital connections taking care of formalities. Part 4 Business opportunities with the Web: selling Internet access creating HTML documents for money boarding Web pages on your system. Part 5 Interesting uses for the Web: Internet publishing other fun on the Web.
Modelling and testing proxemic behaviour for humanoid robots

Humanoid robots that share the same space with humans need to be socially acceptable and effective as they interact with people. In this paper we focus our attention on the definition of a behavior-based robotic architecture that (1) allows the robot to navigate safely in a cluttered and dynamically changing domestic environment and (2) encodes embodied non-verbal interactions: the robot respects the users personal space (PS) by choosing the appropriate distance and direction of approach. The model of the PS is derived from human–robot interaction tests, and it is described in a convenient mathematical form. The robot's target location is dynamically inferred through the solution of a Bayesian filtering problem. The validation of the overall behavioral architecture shows that the robot is able to exhibit appropriate proxemic behavior.
A Method of Detecting Outliers Matching User's intentions

Outlier detection has many applications like fraud detection, medical analysis, etc. Recently, several methods for finding outliers in large datasets have been reported. These existing techniques traditionally detect based on some prescribed definitions of outliers. However, it is very difficult for a user to decide the definition of outliers in prior. Usually, they have a few outlier examples in hand, and want to find more objects just like those examples. To solve this problem, we propose a novel method to detect outliers adaptive to users’ intensions implied by the outlier examples. This is, to the best of our knowledge, the first that detect outliers based on user-provided examples. Our experiments on both synthetic and real datasets show that the method has the ability to discover outliers that match the users’ intentions.
Profiling, Optimization and Parallelization of a Seismic Inversion Code

Modern chip multi-processors offer increased computing power through hardware parallelism. However, for applications to exploit this parallelism, they have to be either designed for or adapted to the new processor architectures. Seismic processing applications usually handle large amounts of data that are well suited for the task-level parallelism found in multi-core shared memory computer systems. In this thesis, a large production code for seismic inversion is profiled and analyzed to find areas of the code suitable for parallel optimization. These code fragments are then optimized through parallelization and by using highly optimized multi-threaded libraries. Our parallelizations of the linearized AVO seismic inversion algorithm used in the application, scales up to 24 cores, with almost linear speedup up to 16 cores, on a quad twelve-core AMD Opteron system. Overall, our optimization efforts result in a performance increase of about 60 % on a dual quad-core AMD Opteron system. The optimization efforts are guided by the Seven Dwarfs taxonomy and proposed benchmarks. This thesis thus serves as a case study of their applicability to real-world applications. This work is done in collaborations with Statoil and builds on previous works by Andreas Hysing, a former HPC-Lab master student, and by the author.
Semiparametric maximum likelihood for multi-phase response-selective sampling and missing data problems

Missing data is a common occurrence in most medical (or other) research data collection processes. Missing data patterns can be sometimes caused by design. In multi-phase response-selective sampling, the response variable Y and some easily-obtainable variables are fully observed for a first-phase sample or finite population. Some of the covariates of interest, X, which might be difficult or too expensive to obtain, are then observed at later phases for smaller subsamples. The selection of data at each phase is dependent on the categorical information of Y , with the choice of considering other fullyobserved discrete variables as a crossor post-stratification. In this thesis, we start from the simple case-control study in which the data are collected under a two-phase response-selective sampling scheme. Special conditions are considered subsequently to pose different questions of interest. In a secondary study, we may be interested in another binary response variable Y2, which is associated with the original case-control response Y in the data. Conventional logistic regression analysis can no longer provide consistent parameter estimates in this case. We also consider the situation in which the case-control status of each subject is actually defined by dichotomising a continuous variable which is potentially available in the population. Ignoring this source of information as in binary logistic regression typically results in a loss of efficiency which may be substantial. Linear regression analysis can be carried out to efficiently estimate the logistic model odds-ratios and their 95% confidence intervals. The behaviour of various methods of analyses and sampling strategies for linear models are also discussed. We finally consider three-phase response-selective sampling designs, methods of analyses and some applications of three-phase methods. Our main approach for data analysis is semiparametric maximum likelihood. Survey-weighted methods, as well as other semiparametric approaches, are also considered for comparison. Their relative efficiencies and robustness properties are investigated using a wide range of simulation studies and real
Evolution of statistical averages: an interdisciplinary proposal using the Chapman-Enskog method

This work examines the idea of applying the Chapman-Enskog (CE) method for approximating the solution of the Boltzmann equation beyond the realm of physics, using an information theory approach. Equations describing the evolution of averages and their fluctuations in a generalized phase space are established up to first order in the Knudsen parameter, which is defined as the ratio of the time between interactions (mean free time) and a characteristic macroscopic time. Although the general equations here obtained may be applied in a wide range of disciplines, in this paper only a particular case related to the evolution of averages in speculative markets is examined.
Non-Blocking Concurrent Operations on Heap

We present a non-blocking implementation for the concurrent Heap data structure in the asynchronous shared memory system. The system may be a traditional one with a single processor with multiple threads, or it may be the one with multiple processors each possibly with multiple threads. Our implementation supports readMin, deleteMin, and insert operations on the heap. The deleteMin and insert operations are non-blocking operations, whereas the readMin is wait-free. One easy approach of using a heap in multi-threading environment could be by locking the entire heap before performing any operation. This would make the implementation very slow to have any practical application. The above inefficiency could be reduced by using the fine-grained locking mechanism as shown by Herlihy and Shavit[16]. But, this would still be a blocking implementation, where some threads may be waiting forever for some other threads holding the locks that might have crashed or failed. Israeli and Rappoport[20] gave a non-blocking implementation which supports deleteMin and insert operations using some primitives which they claim could be built using transactional memory. Moreover, their implementation has a limitation on the range of values a node in the heap can have. We propose a different implementation which supports all three operations using a primitive, called Double-Compare-And-Set(DCAS). DCAS is a synchronization operation supported in hardware by Motorola 68K family of processors [19]. It was also going to be supported by Sun’s canceled Rock processor[4]. DCAS takes two memory locations as input, and writes new values to them only if they match input expected values. Our algorithm has no limitation on the range of numbers a node can have.
Graph Algorithms in the Language of Linear Algebra

The thesis presents usefulness of duality between graph and his adjacency matrix. The teoretical part provides the basis of graph theory and matrix algebra mainly focusing on sparse matrices and options of their presentation witch takes into account the number of nonzero elements in the matrix. The thesis includes presentation of possible operations on sparse matrices and algorithms that basically work on graphs, but with help of duality between graph and his adjacency matrix can be presented with sequence of operations on matrices. Practical part presents implementation of some algorithms that can work both with graphs or their adjacency matrices in programming language Java and testing algorithms that work with matrices. It focuses on comparison in efficiency of algorithm working with matrix written in standard mode and with matrix written in format for sparse matrices. It also studies witch presentation of matrices works beter for witch algorithm.
Artificial Intelligence and the Future of Testing

Contents: R. Freedle, Introduction: Artificial Intelligence and Its Implications for the Future of ETS's Tests. Part I:Assessment of Quantitative Skills. T. Ager, From Interactive Instruction to Interactive Testing. R. Milson, M. Lewis, J.R. Anderson, The Teacher's Apprentice Project: Building an Algebra Tutor. Part II:Graphs and Computer Vision: Selected Applications. S. Pinker, A Theory of Graph Comprehension. L. Kitchen, A Sketch of Accomplishments in Computer Vision with Speculations on Its Use in Educational Testing Part III:Learning, Memory, Reasoning and Language Issues. M. Burstein, B. Adelson, Issues for a Theory of Analogical Learning. B. Ross, The Access and Use of Relevant Information: A Specific Case and General Issues. B. Adelson, Modeling Software Design Within a Problem-Space Architecture. L. Rau, Memory Organization and Retrieval. P. Jacobs, Two Hurdles for Natural Language Systems. Part IV:Invited Critique. S. Amarel. A. Joshi. Part V:Toward the Future of Testing at ETS. R. Bennett, B. Gong, R. Kershaw, D. Rock, E. Soloway, A. Macalalad, Assessment of an Expert System's Ability to Automatically Grade and Diagnose Student's Constructed Responses to Computer Science Problems.
Annotation scheme for deep dependency syntax of French (Un schéma d’annotation en dépendances syntaxiques profondes pour le français) [in French]

We describe in this article an annotation scheme for deep dependency syntax, built from the surface annotation scheme of the Sequoia corpus, abstracting away from it and expressing the grammatical relations between content words. When these grammatical relations take part into verbal diatheses, we consider the diatheses as resulting from redistributions from the canonical diathesis, which we retain in our annotation scheme. Mots-cles : schema d'annotation, syntaxe profonde, grammaires de dependance.
Shaders for Game Programmers and Artists

PART 1: From the Ground Up 1. Welcome to the World of Shaders 2. The Art of 3D 3. RenderMonkey Version 1.5 4. Getting Started, Your First Shaders PART 2: Screen Effects 5. Looking Through a Filter 6. Blurring Things Up 7. It's Getting Hot in Here 8. Making Your Day Brighter PART 3: Making It Look Real 9. May There Be Light 10. Shiny Little Pixels 11. Mirror, Mirror, on the Wall 12. Not All Materials Are the Same 13. Building Materials from Scratch 14. Why Does It Always Need to Look Real? PART 4: Advanced Topics 15. Watch Out for that Morning Fog 16. Moving Objects Around 17. Advanced Lighting 18. Shadowing 19. Geometry Tricks Appendices A: High-Level Shader Language Reference B: RenderMonkey Version 1.5 User Manual C: What's on the CD D: Solutions to Exercises E: Shader Library
Using Actors to Implement Sequential Simulations

This thesis investigates using an approach based on the Actors paradigm for implementing a discrete event simulation system and comparing the results with more traditional approaches. The goal of this work is to determine if using Actors for sequential programming is viable. If Actors are viable for this type of programming, then it follows that they would be usable for general programming. One potential advantage of using Actors instead of traditional paradigms for general programming would be the elimination of a distinction between designing for a sequential environment and a concurrent/distributed one. Using Actors for general programming may also allow for a single implementation that can be deployed on both single core and multiple core systems. Most of the existing discussions about the Actors model focus on its strengths in distributed environments and its ability to scale with the amount of available computing resources. The chosen system for implementation is intentionally sequential to allow for examination of the behaviour of existing Actors implementations where managing concurrency complexity is not the primary task. Multiple implementations of the simulation system were built using different languages (C++, Erlang, and Java) and different paradigms, including traditional ones and Actors. These different implementations were compared quantitatively, based on their execution time, memory usage, and code complexity. The analysis of these comparisons indicates that for certain existing development environments, Erlang/OTP, following the Actors paradigm, produces a comparable or better implementation than traditional paradigms. Further research is suggested to solidify the validity of the results presented in this research and to extend their applicability.
Microsoft Excel 2010 Step by Step

Experience learning made easy-and quickly teach yourself how to organize, analyze, and present data with Excel 2010. With STEP BY STEP, you set the pace-building and practicing the skills you need, just when you need them! Topics include creating formulas, calculating values, and analyzing data; presenting information visually with graphics, charts, and diagrams; building PivotTable dynamic views; using the new Excel Web App; reusing information from databases and other documents; creating macros to automate repetitive tasks and simplify your work; and other core topics. From Inside the Book: Using Pivot Tables
Macmillan English dictionary : for advanced learners

The second edition of the Macmillan English Dictionary contains a wealth of new material, while building on the innovative features that won it two prestigious awards. The most frequently used 7,500 words in English - the ideal vocabulary size for an advanced learner - are printed in red, graded with stars, and explained with extra detail about how to use them. The Macmillan English Dictionary is specially deisgned to help learners to understand English, use English, and be more aware of how English works. The many features include: Menus to take students straight to the right meaning Coverage of subject-specific vocabulary, World English and encyclopaedic information Clear definitions, using the most common words Detailed information about the 7,500 most frequent words, identified by their red headwords Collocation boxes Vocabulary-building sections Metaphor boxes Usage notes on style, grammar and varieties of English Language Awareness pages on idioms, pragmatics, word formation and much, much more The second edition includes: Hundreds of new words (satnav, greenwash, carbon trading, adspend, crystal meth, cyberlaw, geoeconomics) Many more collocations, synonyms and antonyms Extra clearly labelled subject-specific vocabulary (equity capital, faultline, heritage language, link rot, culture medium, data compression) Multi-page vocabulary building sections on the themes of movement, communication and emotions A complete package of unique, carefully researched materials based on a detailed analysis of learners' own writing. Full-page writing sections and 'Get it right' boxes help students to become more confident writers in academic and professional situations. This material has been created following a two-year collaboration with the Centre for English Corpus Linguistics, led by Professor Sylviane Granger, at the Universite catholique de Louvain in Belgium.
Connecting Business Objects to Relational Databases

These patterns describe how to implement business objects so that they can be mapped to non objectoriented databases. There is an impedance mismatch between these technologies since objects consist of both data and behavior while a relational database consists of tables and relations between them. Although it is impossible to completely eliminate this impedance mismatch, you can minimize it by following the proper patterns. The proper patterns hide persistence from the developer so that effort can be spent on understanding the domain rather than in making objects persistent.
The Relationship Between Phonological Working Memory, Phonological Sensitivity, and Incidental Word Learning

Lynne E. Hewitt, Advisor Rapid learning of novel vocabulary is crucial to overall success in language acquisition. While the exact mechanisms underlying the acquisition of the lexicon remain under investigation, it is well known that children are able to form rapid initial associations between novel words and their referents during everyday experiences. This ability is referred to as incidental word learning, a process by which a learner makes a sparse initial representation of a word in lexical memory, following only a brief exposure. The cognitive abilities needed to succeed at this task were investigated, specifically by examining the role of working memory and phonological sensitivity in novel word learning by 4-year-olds who were typically developing. It evaluated two competing models, the phonological loop model proposed by Baddeley and colleagues (Baddeley & Hitch, 1974), and the lexical restructuring model of Metsala (Metsala & Walley, 1998; Metsala, 1999). Forty 4 year olds were administered a test of nonword repetition (to investigate phonological working memory), rhyming and phoneme alliteration tasks (to investigate phonological sensitivity), and an incidental word learning task, via a computer-based presentation of a cartoon story. A multiple regression analysis revealed that nonword repetition scores did not contribute significantly to incidental word learning. Phonological sensitivity scores were significant predictors of incidental word learning. These findings provide support for a model of lexical acquisition in which phonological knowledge plays an important role.