Miracle-dz/UniFAR-FTUs huggingface dataset:
Ocean Heat Uptake in Transient Climate Change: Mechanisms and Uncertainty due to Subgrid-Scale Eddy Mixing

Abstract The ocean heat uptake (OHU) is studied using the Massachusetts Institute of Technology (MIT) ocean general circulation model (OGCM) with idealized ocean geometry. The OGCM is coupled with a statistical–dynamic atmospheric model. The simulation of OHU in the coupled model is consistent with other coupled ocean–atmosphere GCMs in a transient climate change when CO2 concentration increases by 1% yr–1. The global average surface air temperature increases by 1.7°C at the time of CO2 concentration doubling (year 70). The ocean temperature increases by about 1.0°C near the surface, 0.1°C at 1000 m in the Pacific, and 0.3°C in the Atlantic. The maximum overturning circulation (MOTC) in the Atlantic at 1350 m decreases by about 4.5 Sv (1 Sv ≡ 106 m3 s–1). The center of MOTC drifts upward about 300 m, and therefore a large OTC anomaly (14 Sv) is found at 2700 m. The MOTC recovers gradually, but the OTC anomaly at 2700 m does not seem to recover after CO2 concentration is kept constant during 400-yr simulat.
Elliptic Curve Cryptography in JavaScript

We document our development of a library for elliptic curve cryptography in JavaScript. We discuss design choices and investigate optimizations at various levels, from integer multiplication and eld selection to various xed-based EC point multiplication techniques. Relying on a small volume of public precomputed data, our code provides a speed-up of a factor 50 compared to previous existing implementations. We conclude with a discussion of the impact of our work on a concrete application: the Helios browser-based voting system.
Length of stay as a performance indicator: robust statistical methodology

This is a pre-copy-editing, author produced PDF of an article accepted for publication in IMA Journal of Management Mathematics following peer review. The definitive publisher-authenticated version [Kulinskaya, E. , Kornbrot, D. and Gao, H. (2005) 'Length of stay as a performance indicator : robust statistical methodology'. IMA Journal of Management Mathematics 16 (4) pp.369-381] is available online at : http://imaman.oxfordjournals. org/archive/index.dtl . --Copyright Institute of Mathematics and its Applications-- --DOI : 10.1093/imaman/dpi015
Relative validity of a semi-quantitative FFQ in 3-year-old Polish children

Abstract Objectives The aim of the study was to assess the relative validity of a semi-quantitative FFQ (SFFQ) which measures the usual dietary intake of 3-year-old children. Design The children's daily dietary intake was measured using the SFFQ. The average intake of three 24 h dietary recalls (24hDR) was calculated as a reference method. Wilcoxon's rank test and Spearman's rank-correlation coefficient were used to compare nutrient intakes assessed by both methods. The level of agreement between the SFFQ and the repeated 24hDR was determined by the Bland–Altman method. To assess the agreement in quartile distribution, the weighted kappa coefficient (κ w) was used. Setting Krakow, Poland. Subjects One hundred and forty-three 3-year-old children and their mothers, participants of a prospective cohort study. Results Overall, the SFFQ overestimated energy and nutrient intakes compared with the repeated 24hDR. The median correlation coefficient for energy and nutrient intakes was 0·456, with higher results for Ca, P and riboflavin. Although the κ w value showed only slight to fair agreement between the two methods, about 75 % of the children were classified into the same or adjacent quartile and the level of agreement assessed by the Bland–Altman method for most of the nutrients investigated was good. Conclusions The study indicated that the SFFQ might be a useful tool to assess dietary intakes of nutrients by small children, especially for ranking them according their nutrient intake.
Cognitive Modeling for Computer Games

One of the major challenges associated with making compelling virtual worlds for computer games is populating them with intelligent characters. Most of today’s characters are mindless automatons that follow an inflexible set of simple rules. Unfortunately, when we start to make characters try and think for themselves we can run into difficulties. For example, if we are not extra careful about how we represent a character’s knowledge we can deprive them of "common sense" as they reason about the effects of their actions. Another important issue we consider is how to provide a convenient mechanism to allow the programmer to strike a balance between lots of fast pre-programmed behavior and more expensive ran-time decision making. In addition, by using interval arithmetic to integrate sensing into our underlying theoretical framework, we enable characters to generate plans of action even when they find themselves in highly complex, dynamic virtual worlds. All these ideas are made concrete in the form of a cognitive modeling language (CML) we have developed. CML is used to express what a character knows, how that knowledge is acquired, and how it can be used to plan actions. It has enabled us to quickly, and easily, create various "intelligent" characters that inhabit a variety of different virtual worlds.
No Ordinary Judgment: Mabo, the Murray Islanders' Land Case

'No Ordinary Judgment' provides the inside story of the Mabo case, a unique drama where previously unknown rights and interests came to be recognised by the High Court of Australia. In exploring the role of native title in the reshaping of Australian identity, some of the deeper questions of cultural diversity and self-determination are identified.
Impact of flow-level dynamics on QoE of video streaming in wireless networks

The Quality of Experience (QoE) of streaming service is often degraded by frequent playback interruptions. To mitigate the interruptions, the media player prefetches streaming contents before starting playback, at a cost of delay. We study the QoE of streaming from the perspective of flow dynamics. First, a framework is developed for QoE when streaming users join the network randomly and leave after downloading completion. We compute the distribution of prefetching delay using partial differential equations (PDEs), and the probability generating function of playout buffer starvations using ordinary differential equations (ODEs). Second, we extend our framework to characterize the throughput variation caused by opportunistic scheduling at the base station in the presence of fast fading. Our study reveals that the flow dynamics is the fundamental reason of playback starvation. The QoE of streaming service is dominated by the average throughput of opportunistic scheduling, while the variance of throughput has very limited impact on starvation behavior.
Service scheduling for general packet radio service classes

While the quality of service (QoS) profiles for a number of general packet radio service (GPRS) classes has been specified by ETSI, how QoS management is provided by means of traffic scheduling, traffic shaping, and connection admission control, in a GPRS network is an implementation issue that is attracting significant current research interest. This paper presents an evaluation of several traffic scheduling methods, including of FIFO, static priority scheduling (SPS) and earliest deadline first (EDF) by simulations, with the objective of meeting the delay profiles defined for a number of GPRS classes. Traffic sources representative of GPRS applications, including e-mail, fleet management and World Wide Web applications are employed. We focus on the forward link which represents the bottleneck of a typical GPRS data connection. Results show that EDF is able to meet the delay requirements at a much higher channel utilization compared to the other alternatives.
Reconstructing Borders of Manually Torn Paper Sheets Using Integer Linear Programming ausgeführt am

This thesis discusses the destruction of sheets of paper by manual tearing and evaluates two approaches for reconstruction of such pages by exact methods based on Integer Linear Programming. These methods operate solely on the shape of torn pieces of paper and reconstruct the borders of the paper sheets. For evaluation and tests within this problem domain, a tearing model of human paper tearing as well as a C++ library and an XML data interchange format were developed. The tearing simulation takes into regard shear effects which distort paper in a way that—opposed to cutting—the shapes of adjacent pieces will not prefectly fit together anymore. The ILP formulations were evaluated with extensive empirical tests using the CPLEX solver software. The performance and accuracy of several objective functions was compared, in particular functions using the CPLEX specific IloAbs absolute value calculation feature and formulations not using this feature. Further evaluation was performed on the very performance-relevant CPLEX parameters MIPEmphasis and on the CPLEX specific lazy constraints. The developed library and tools were very useful for the evaluation in this problem domain and can be reused for further studies. The ILP models are fast and yield good accuracy results on single page instance sizes which makes them well suitable for usage in hybrid algorithms. Zusammenfassung Diese Diplomarbeit behandelt die Zerstörung von Papierdokumenten durch manuelles Zerreißen und evaluiert zwei Verfahren zur Rekonstruktion solcher Dokumente basierend auf Methoden der ganzzahligen linearen Programmierung (ILP). Die vorgestellten Verfahren operieren ausschließlich auf der Form der Schnipsel und rekonstruieren die Ränder der zerstörten Dokumente. Für die Evaluierung wurde ein Modell für manuelles Zerreißen und eine C++ Bibliothek mit einem XML Datenformat entwickelt. Die Simulation des Zerreißprozesses berücksichtigt auch Schereffekte, die Papier beim Reißen—im Gegensatz zum Schneiden—plastisch so verformen, dass die Umrisse benachbarte Stücke nicht mehr exakt zusammenpassen. Die ILP Formulierungen wurden durch umfangreiche empirische Tests mit der CPLEX Software untersucht. Die Performanz und Ergebnisqualität von mehreren Zielfunktionen wurde verglichen, insbesondere solcher die von der CPLEX-spezifischen IloAbs-Absolutwertsberechnung Gebrauch machen und solcher die dies nicht tun. Weiters wurde der sehr performancekritische MIPEmphasis Parameter und das Lazy Constraint Feature von CPLEX evaluiert. Die entwickelte Bibliothek und die Programmwerkzeuge haben sich in den Tests bewährt und eignen sich für weiterführende Untersuchungen innerhalb dieser Domäne. Die ILP Formulierungen zeigen gute Performanz und gute Ergebnissgenauigkeit für Instanzen bestehend aus einer Papierseite und eignen sich deshalb für die Verwendung in Hybridalgorithmen.
Prognosis in complex regional pain syndrome 1

Complex Regional Pain Syndrome 1 (CRPS-1) is a condition characterized mainly by pain, swelling and changes in the skin. Symptoms usually appear in a limb after an injury or surgery. Although CRPS-1 is quiet common, the condition remains poorly understood. The diagnosis of CRPS-1 is often delayed, because the appearance resembles common post-traumatic states. The core part of the thesis is the rational of a prospective cohort study aiming at identifying risk factors associated with delayed recovery. Ideally, potential risk factors are identified at an early stage in order to initiate an early and adequate treatment.
A word predictor for inflected languages: system design and user-centric interface

We present FastType, a word prediction system for the Italian inflected language, and its user-centric interface. Fast-Type has greatly evolved from its original features. We have added new linguistic resources, implemented more effecient prediction algorithms and made a brand-new user interface. Thanks to the prediction engine upgrades, like the generation of word and Part-of-Speech n-gram collections, and to the introduction of a linear combination algorithm, performances are greatly improved. Keystroke Saving reached 48% and is now comparable to the one achieved with state-of-the-art methods for non-inflected languages. DonKey, the new human-computer interface, allows the user to benefit from automatic word completion in any application. FastType is primarily designed for users with special needs and to reduce misspellings for users with linguistic difficulties.
Individualization of music similarity perception via feature subset selection

We address the problem of modeling the subjective perception of similarity between two music files that have been extracted from a music database with use of objective features. We propose the importation of user models in content-based music retrieval systems, which embody the ability of evolving and using different music similarity measures for different users. Specifically, a user-supplied relevance feedback procedure allows the system to determine which subset of a set of objective features approximates more efficiently the subjective music similarity of a specific user. Our implementation of the proposed system verifies our hypothesis and exhibits significant improvement in perceived music similarity
UWB RADIO RESOURCE CONTROL: MAC FUNCTIONAL MODEL AND RESOURCE SHARING APPROACH

In this work the main principles of radio resource sharing with UWB are stated. Specifically different possible network scenarios are considered and the relevant brought advantages are addressed in order to investigate and identify the most flexible network paradigm to exploit the advantages of UWB. Hence a model for the network architecture is proposed which is ad-ho oriented as well as able to provide access to the fixed network. Besides, within the defined framework, the problem of radio resource control is studied by taking into account what the impact of the assumed network model is; more in detail the Radio Resource Control (RRC) functional model is drawn for different classes of service thus defining a complete system model from the resource sharing point of view. Then a RRC strategy is developed in order to support the envisaged classes of traffic within a heterogeneous traffic context.
On concircularly recurrent Finsler manifolds

Two special Finsler spaces have been introduced and inves- tigated, namely R h -recurrent Finsler space and concircularly recurrent Finsler space. The deflning properties of these spaces are formulated in terms of the flrst curvature tensor of Cartan connection. The following three results constitute the main object of the present paper: (i) a con- circularly ∞at Finsler manifold is necessarily of constant curvature (Theo- rem A); (ii) every R h -recurrent Finsler manifold is concircularly recurrent with the same recurrence form (Theorem B); (iii) every horizontally in- tegrable concircularly recurrent Finsler manifold is R h -recurrent with the same recurrence form (Theorem C). The whole work is formulated in a coordinate-free form.
USZEGED: Correction Type-sensitive Normalization of English Tweets Using Efficiently Indexed n-gram Statistics

This paper describes the framework applied by team USZEGED at the “Lexical Normalisation for English Tweets” shared task. Our approach first employs a CRFbased sequence labeling framework to decide the kind of corrections the individual tokens require, then performs the necessary modifications relying on external lexicons and a massive collection of efficiently indexed n-gram statistics from English tweets. Our solution is based on the assumption that from the context of the OOV words, it is possible to reconstruct its IV equivalent, as there are users who use the standard English form of the OOV word within the same context. Our approach achieved an F-score of 0.8052, being the second best one among the unconstrained submissions, the category our submission also belongs to.
Project STAR IST-2000-28764 Deliverable D 6 . 3 Enhanced face and arm / hand detector

KU Leuven is responsible for the work package number 6, Automated view selection and camera hand-over. The main goal is to build an intelligent virtual editor that produces as an output a single video stream from multiple input streams. The selection should be made in such a way that the resulting stream is pleasant to watch and informative about what is going on in the scene. Face detection and object tracking is needed to select the best camera view from the multi-camera system.
A Two-level Application Transparent Checkpointing Scheme in Cloud Computing Environment

Cloud computing has been widely applied to a wide variety of computing environments, with the traditional distributed computing environment, cloud computing using virtual machines to achieve dynamic resource partitioning. Checkpoint recovery technology is a low-cost method to improve the system availability. This paper analyzes the characteristics of cloud computing, virtualization technology and the checkpoint/recovery technology, a mechanism for integration of virtualization technology and checkpoint/recovery technology has been proposed, this mechanism uses coordinated checkpoint protocols at node level, while uses communication-induced protocols at system level. This scheme is transparent to applications with small performance overhead.
Economic Rise and Decline in Indonesia – As Seen from Space

Satellite-detected luminosity is sometimes used to proxy for economic activity although only recently within the mainstream economics literature (Henderson et al., 2012). If this method works it holds great promise for developing countries with weak statistical systems that face difficulties in consistently measuring long-term economic change. Regardless of how chaotic are statistical efforts on the ground, viewed from space it may be possible to detect economic change, with high frequency and for small areas. But doubts remain about how much trust can be put in night lights data as a proxy for economic growth since previous validation attempts just compare with other error-ridden measures (Henderson et al., 2012; Chen and Nordhaus, 2011; Kulkarni et al., 2011). This paper uses gold standard data on electrification and economic growth for 5000 sub-districts in Indonesia from 1992 to 2008 to evaluate the reliability of night-light based measures of local economic change. Our results also contribute to debate in the literature about the severity of the shock to Indonesia from the Asian Financial Crisis of 1997 and the subsequent rate of rebound in economic activity.
Exploring Network Economics

In this paper, we explore what \emph{network economics} is all about, focusing on the interesting topics brought about by the Internet. Our intent is make this a brief survey, useful as an outline for a course on this topic, with an extended list of references. We try to make it as intuitive and readable as possible. We also deliberately try to be critical at times, and hope our interpretation of the topic will lead to interests for further discussions by those doing research in the same field.
FP-Viz: Visual Frequent Pattern Mining

Frequent pattern mining plays an essential role in many data analysis tasks including association-, correlation-, and causality analysis and has broad applications. Examples are market basket analysis and web click stream analysis. Although a number of ecient methods for mining frequent patterns where proposed in the past, there exist only a small number of visual exploration tools for discovering frequent patterns. In this paper we present a novel visualization technique for exploring frequent itemsets interactivly, based on a radial visual layout approach.
Topology optimization for a trade off between energy cost and network lifetime in average consensus

Consensus algorithms are simple processes that involve repeated communications between the nodes of the network until a consensus is reached with certain accuracy. In this setting, the lifetime of the network and the total required energy not only depend on the number of iterations needed to achieve consensus, but also on the power consumption per node and iteration. In this work, we propose a method to optimize the network topology in order to reduce the total energy required to achieve consensus while increasing the network lifetime. Our solution is based on an optimization technique that performs a tradeoff between these two concepts. Simulation results, under different types of networks, are presented to show clearly the efficiency and validity of our approach.
Revisiting User Information Needs in Aggregated Search

Aggregated search interfaces are a common way to present web search results, mixing different types of results into one single result page. Although numerous efforts have been made to infer users' information needs in "standard" search, we know little about users' information needs within the context of aggregated search. This paper presents the outcomes of a survey of 117 respondents, investigating users' preferences for their type of search result (image, news, video) and their type of information need (informational, navigational and transactional). The survey reveals that users' result preferences differ based on their underlying information needs, suggesting that the taxonomy provided by Broder [1] requires updating to reflect user information needs in the context of aggregated search. For instance, respondents indicated a preference for diverse results (news and reviews about a particular software product) for navigational and transactional queries rather than a single result (the web page to download that software product).
Integrated Resiliency Planning in Storage Clouds

Storage clouds use economies of scale to host data for diverse enterprises. However, enterprises differ in the requirements for their data. In this work, we investigate the problem of resiliency or disaster recovery (DR) planning in a storage cloud. The resiliency requirements vary greatly between different enterprises and also between different datasets for the same enterprise. We present in this paper Resilient Storage Cloud Map (RSCMap), a generic cost-minimizing optimization framework for disaster recovery planning, where the cost function may be tailored to meet diverse objectives. We present fast algorithms that come up with a minimum cost DR plan, while meeting all the DR requirements associated with all the datasets hosted on the storage cloud. Our algorithms have strong theoretical properties: 2 factor approximation for bandwidth minimization and fixed parameter constant approximation for the general cost minimization problem. We perform a comprehensive experimental evaluation of RSCMap using models for a wide variety of replication solutions and show that RSCMap outperforms existing resiliency planning approaches.