Miracle-dz/UniFAR-FTUs huggingface dataset:
Efficacité et robustesse aux distracteurs d'un retour tactile pour faciliter le pointage

Surfpad is a pointing facilitation technique that operates in the tactile domain by taking advantage of the ability to alter a touchpad's coefficient of friction. We report on two experiments comparing it to the semantic pointing technique and constant control-display gain with and without distractor targets. Our results clearly show the limits of traditional target-aware gain adaptation in the latter case, and the benefits of our tactile approach in both cases. Surfpad can lead to a performance improvement of up to 21% compared to unassisted pointing at small targets with no distractor. It is also robust to high distractor densities, keeping an average performance improvement of nearly 10% while semantic pointing can degrade up to 100%.
Approximation of α-stable probability densities using finite Gaussian mixtures

In this paper, we introduce a new analytical model for the α-stable probability density function (p.d.f). The new model is based on a corollary of the mixing theorem for symmetric α-stable (SαS) random variables (r.v.) [1] which states that a SαS r.v. can be expressed as the product of a Gaussian r.v. and a positive-stable r.v. We also extend this model to provide an analytical approximation for a subclass of multivariate a-stable p.d. f.s, namely the sub-Gaussian α-stable p.d. f.s. Simulation results indicate the success of our technique. The new analytical representation opens path to the application of maximum likelihood and Bayesian techniques for problems involving α-stable random variables. The paper is concluded with the examples of possible application areas.
05 01 19 2 v 2 8 F eb 2 00 5 QMUL-PH-051 D-brane dynamics near compactified NS 5-branes

We examine the dynamics of a Dp-brane in the background of k coincident, parallel NS5branes which have had one of their common transverse directions compactified. We find that for small energy, bound orbits can exist at sufficiently large distances where there will be no stringy effects. The orbits are dependent upon the energy density, angular momentum and electric field. The analysis breaks down at radial distances comparable with the compactification radius and we must resort to using a modified form of the harmonic function in this region. e-mail: s.thomas@qmul.ac. uk e-mail: j.ward@qmul.ac. uk
Scheduling Loop-free Network Updates: It's Good to Relax!

We consider the problem of updating arbitrary routes in a software-defined network in a (transiently) loop-free manner. We are interested in fast network updates, i.e., in schedules which minimize the number of interactions (i.e., rounds) between the controller and the network nodes. We first prove that this problem is difficult in general: The problem of deciding whether a k-round schedule exists is NP-complete already for k = 3, and there are problem instances requiring Ω(n) rounds, where n is the network size. Given these negative results, we introduce an attractive, relaxed notion of loop-freedom. We prove that O(log n)-round relaxed loop-free schedules always exist, and can also be computed efficiently.
Dynamical density functional theory for dense atomic liquids

Starting from Newton’s equations of motion, we derive a dynamical density functional theory (DDFT) applicable to atomic liquids. The theory has the feature that it requires as input the Helmholtz free energy functional from equilibrium density functional theory. This means that, given a reliable equilibrium free energy functional, the correct equilibrium fluid density profile is guaranteed. We show that when the isothermal compressibility is small, the DDFT generates the correct value for the speed of sound in a dense liquid. We also interpret the theory as a dynamical equation for a coarse grained fluid density and show that the theory can be used (making further approximations) to derive the standard mode coupling theory that is used to describe the glass transition. The present theory should provide a useful starting point for describing the dynamics of inhomogeneous atomic fluids.
A dual wideband bandpass filter for WLAN and 5G Wi-Fi applications

A two order dual-band bandpass filter using a half-wavelength step impedance resonator to operate at the passbands 2.45 GHz and 5.45 GHz is proposed. Ground slots were embedded below the coupled line section to increase coupling that resulted in passbands of 560 MHz and 470 MHz. Four transmission zeroes obtained at 1.75 GHz, 3.79 GHz, 6.23 GHz and 9.34 GHz, near the two passband edges enhanced the filter selectivity. The detailed design process is presented.
3D line segment detection algorithm for large-scale scenes

This paper presents a fast and reliable approach for detecting 3D line segment from 3D point clouds. The main idea is to discover weak matching of line segments by re-projecting 3D point to 2D image plane and infer 3D line segment by spatial constraints. On the basis of 2D Line Segment Detector (LSD) and multi-view stereo, the proposed algorithm firstly re-projects the spatial point clouds into planar set on different camera matrices; then finds the best re-projected line from tentative matched points. Finally, 3D line segment is produced by back-projection in accordance with outlier removal based on plane clustering method. Experimental results show that the approach can obtain satisfactory visual effect as well as high efficiency. The fast line detection can also be extended in the application of 3D sketch for large-scale scenes from multiple images.
Quantifying the Brown Side of Priority Schedulers: Lessons from Big Clusters

Scheduling is a central operation to achieve "green" data centers, i.e., distributing diversified workloads across heterogeneous resources in an energy efficient manner. Taking an opposite perspective from most of the related work, this paper reveals the "brown" side of scheduling, i.e., wasted core seconds (so called brown resources), using fleld analysis and trace-driven simulation of a Google cluster trace. First, based on the trace, we pinpoint the dependency between priority scheduling and task eviction that causes brown resources and present a brief characterization study focusing on workload priorities. Next, to better understand and further reduce the resource "inefficiency" of priority scheduling, we develop a slot-based scheduler and simulator with various system tunable parameters. Our key finding is that tasks of low priority suffer greatly in terms of response time as well as CPU resources because of a high probability of being evicted and resubmitted. We propose to use simple threshold-based policies that consider the trade-off between task drop rates and wasted core seconds due to task resubmission due to eviction. Our experimental results show that we are able to effectively mitigate brown resources without sacrificing the performance advantages of priority scheduling.
Optimal Converge cast Methods for Tree-Based WSNs

: A tree-based wireless sensor network (WSN) is a collection of sensors nodes, such as sink is the root of tree and leaves are the nodes. Data in such a topology flows from sensor nodes (leaves) to the sink (root) node of the tree. Collection of data from a set of sensors to an intermediate parent (sink) in a tree network is known as converge-casting. The delivery time and the data rate are application specific. As an example, in oil and gas refineries the sensor equipment and controllers need to collect data from all the sensors within a specific deadline for any kind of leakage or failures. Whereas applications like weather forecasting, under-water observations needs continuous and quick data delivery for analysis, for longer periods. In this paper our goal is on such applications focusing on fast data streaming from sensor to sink node. The two optimal approaches for data collection proposed in this paper are – aggregated-data convergecast where packets are aggregated at each hop, and raw-data convergecast where each data packet travel towards sink node individually. First method is most suitable where data is highly co-related and objective is to collect maximum sensor reading and second method is used where the reading of each sensor is equally important.
Implementing a Web Annotation System for Supporting Cooperative Works Using Tablet Devices

To support cooperative works by using tablet devices, a web annotation system and a smart sinage system are implemented in this work. We propose a web annotation system which adds the functionality of stickies to web pages, adds comments to web pages, and creates bidirectional links between the stickies. We also propose a smart sinage system for tablet devices to support collaborative works based on Web contents. The smart sinage system can synchronize displayed contents and annotation stickies on the system. In this paper, we describe the outline of these two systems and implementation of the systems. Two experiments were conducted to show that these proposed systems have potential in practical use.
Using a Hypervisor to Migrate Running Operating Systems to Secure Virtual Machines

We propose HyperShield, which is a hypervisor that can be inserted into and removed from a running operating system, for improving security. While many existing security-oriented hypervisors require modifying or rebooting an overlying operating system, HyperShield does not require this. HyperShield is intended to be a general framework for various security mechanisms. The current implementation provides two mechanisms for preventing kernel-level buffer overflow. One detects the execution of user code with the kernel privilege, and the other detects malicious modification of a return address in a control stack. HyperShield is implemented on Linux as a loadable kernel module. When the module is inserted, it places itself under the operating system and executes as a hypervisor. The operating system is migrated into a virtual machine and managed by the hypervisor. HyperShield detects attacks by combining virtualization of memory management with a hardware-assisted execution-bit feature. We have confirmed through experiments that HyperShield successfully prevented kernel-level buffer overflow attacks.
Send Orders of Reprints at Reprints@benthamscience.net Mefv Variants in Patients with Pfapa Syndrome in Japan

Background: The pathogenesis of PFAPA (periodic fever, aphthous stomatitis, pharyngitis, adenitis) syndrome is unknown as yet. In order to understand whether genes implicated in other auto-inflammatory diseases might be involved in the pathogenesis of PFAPA, all variants in the genes causing familial Mediterranean fever (FMF), tumor necrosis factor (TNF) receptor-associated periodic syndrome (TRAPS), and Hyper IgD syndrome were analyzed in children with PFAPA. Patients and Methods: All variants in MEFV, TNFRSF1A, and MVK were analyzed in 20 patients with PFAPA. PFAPA were diagnosed by previous published criteria. The findings of all analyses in PFAPA patients were compared with those of unaffected normal subjects (n=62). Results: In the 13 children of 20 with PFAPA, the heterozygous variants of MEFV (5 patients: E148Q-L110P, 2 patients: E148Q, 1 patient: E148Q-L110P/E148Q, 1 patient: E148Q-P369S-R408Q-E84K, 1 patient: E148Q-L110P-P369S-A408G, 1 patient: R202Q, 1 patient: P115R) were found. No variants belonging to TNFRSF1A or MVK were detected in children with PFAPA. The frequency of the E148Q-L110P variants in children with PFAPA was significantly higher than that observed in unaffected normal subjects (7/20 versus 8/62). The duration of the episodes of illness in PFAPA children with MEFV variants was shorter than that of patients without variants. Conclusion: Genes involved in the development and progression of MEFV may affect the incidence and the phenotype of PFAPA in children.
Inference of !-languages from pre $ xes C

B+ uchi automata are used to recognize languages of in$nite strings. Such languages have been introduced to describe the behavior of real-time systems or in$nite games. The question of inferring them from in$nite examples has already been studied, but it may seem more reasonable to believe that the data from which we want to learn is a set of $nite strings, namely the pre$xes of accepted or rejected in$nite strings. We describe the problems of identi$cation in the limit and polynomial identi$cation in the limit from given data associated to di2erent interpretations of these pre$xes: a positive pre$x is universal (respectively existential) when all the in$nite strings of which it is a pre$x are in the language (respectively when at least one is); the same applies to the negative pre$xes. We prove that the classes of regular ! -languages (those recognized by B+ uchi automata) and of deterministic ! -languages (those recognized by deterministic B+ uchi automata) are not identi$able in the limit, whatever interpretation for the pre$xes is taken. We give a polynomial algorithm that identi$es the class of safe languages from positive existential pre$xes and negative universal pre$xes. We show that this class is maximal for polynomial identi$cation in the limit from given data, in the sense that no superclass can even be identi$ed in the limit. c © 2003 Elsevier B.V. All rights reserved.
Signal descriptors and temporal modeling for automatic sound classification

CUIDADO [16] and ECRINS [7] are new projects which aims at providing content-based music applications . Among these applications is an authoring tool for managing sample databases. It includes search by similarity, search by textual attributes, but also automatic sound classification based on predefined taxonomies and user defined taxonomies. This last point raises a crucial issue concerning the design of the classifier and the choice of the appropriate signal descriptors well suited for classification. This paper concentrates on the design of CUIDADO and ECRINS classifiers and on two algorithms for automatic selection of the most appropriate signal descriptors for a given taxonomy: based on discriminant analysis and on mutual information.
Evidence Of Chaotic Behavior In American Stock Markets

This article validates the chaotic behavior in the Argentinean, Brazilian, Canadian, Chilean, American, Peruvian and Mexican Stock Markets using the MERVAL, BOVESPA, S&P TSX COMPOSITE, IPSA, IGPA, S&P 500, DOW JONES INDUSTRIALS, NASDAQ, IGBVL and IPC Stock Indexes respectively. The results of different techniques and methods like: Graphic Analysis, Recurrence Analysis, Temporal Space Entropy, Hurst Coefficient, Lyapunov Exponential and Correlation Dimension support the hypothesis that the stock markets behave in a chaotic way and rejected the hypothesis of randomness. Our conclusion validates the use of prediction techniques in those stock markets. It’s remarkable the result of the Hurst Coefficient Technique, that in average was of 0,75 for the indexes of this study which would justify the use of ARFIMA models among others for the prediction of such series.
Survey on Cache Partition for Cloud Security Purpose

Cache-based side-channel is a behavior of cache memory which will possibly leak secret information. In cloud computing services, providers share physical resources, i.e. infrastructures, to support multi-tenancy of cloud platform, which will achieve high quality of cost efficiency, availability, and on-demand scaling. However, by sharing the infrastructure, sensitive data from individual users will leak to the public or some malicious user through hardware side-channels, such as the cache-based side-channel mentioned above. Side-channel attack through CPU-caches is usually leveraged by adversaries, such as Flush-Reload based side-channel attack in PaaS cloud computing services by Zhang et al. in 2014. By this survey, we aim at finding an effective way to mitigate the risk coming from shared cache. Recent years, concepts and techniques about cache partitioning are proposed. The general idea is to control the accessibility of running instances, such processes or VMs, to shared level cache, preventing the accessible region on the shared cache of each instance from overlapping.
Controller-free ratio-variable gearbox for parallel hybrid powertrain

A transmission from the engine crank to the main transmission with variable reduction ratio is desirable for the hybrid electric vehicles, especially for micro/mild hybrid vehicles with auto start-stop function, for the sake of reducing the design requirements for integrated starter-generator and thus reducing the cost. This paper presents a solution to the issue by introducing a Controller-Free Ratio-Variable gearbox. Unlike other solutions, the proposed gearbox avoids from using actuators to change gear ratios but realize the function in a purely mechanical and fully automatic way. This feature reduces system complexity and improves system stability, as electronic-based info sensing and actuating are not as robust in the engine compartment. Also, the feature allows to change gear ratio faster and thus better protecting integrated starter-generator from over speeding. In this paper, the principle of the gearbox is explained and its performance under different conditions is studied.
Innovación para el Análisis de Sentimientos en Texto, una revisión de la técnica actual aplicando metodologías de crowdsourcing / Innovation for the Analysis of Feelings in Text, a revision of the current technique applying crowdsourcing methodologies

En el presente trabajo se investiga un recurso de aprendizaje relativo a tecnicas actuales de analisis de Sentimientos en Texto en el contexto de la Computacion Afectiva. Se realiza un experimento con un texto en redes sociales orientado hacia la tecnica de crowdsourcing basado en opiniones o sentimientos, utilizando la plataforma IBM Watson ToneAnalyzer, lo cual puede proporcionar a los investigadores, empresarios y responsables politicos informacion valiosa que va desde indices de satisfaccion del cliente hasta tendencias de opinion publica. / This paper investigates a learning resource related to current techniques of Feelings in Text analysis in the context of Affective Computing. An experiment is conducted with a text on social networks oriented towards crowdsourcing technique based on opinions or feelings, using the IBM Watson Tone Analyzer platform, which can provider searchers, entrepreneurs and policy makers with valuable information ranging from customer satisfaction rates to public opinion trends.
Authentic and confidential policy distribution in software defined wireless network

Software-defined networking (SDN) empowers network operators with more flexibility to program their networks. By separating the complexity of state distribution from network specification, SDN provides new ways to deal with age-old problems in networking, for example, routing. At the same time, SDN also brings about some new security problems, such as forged traffic flow, vulnerability, etc. In wireless SDN, the controller will send some policies to the switches. It is very important to remain these policies authentic and confidential due to the wireless and insecure channel. In this paper, we propose a secure and efficient policy distribution scheme in wireless SDN which can realize authentication and secrecy simultaneously. The proposed scheme takes use of the symmetric encryption/decryption algorithms, bilinear pairings and multi-linear map. Through security analysis and efficiency analysis, our scheme is provably secure and efficient in the random oracle model (ROM).
Scandinavian Journal of Trauma, Resuscitation and Emergency Medicine Precision of Field Triage in Patients Brought to a Trauma Centre after Introducing Trauma Team Activation Guidelines

Background: Field triage is important for regional trauma systems providing high sensitivity to avoid that severely injured are deprived access to trauma team resuscitation (undertriage), yet high specificity to avoid resource over-utilization (overtriage). Previous informal trauma team activation (TTA) at Ulleval University Hospital (UUH) caused imprecise triage. We have analyzed triage precision after introduction of TTA guidelines.
Antihemolytic Activities of Green Tea, Safflower, and Mulberry Extracts during Plasmodium berghei Infection in Mice

Malaria-associated hemolysis is associated with mortality in adult patients. It has been speculated that oxidative stress and inflammation induced by malaria parasite are involved in its pathophysiology. Hence, we aimed to investigate the antihemolytic effect of green tea, safflower, and mulberry extracts against Plasmodium berghei infection. Aqueous crude extracts of these plants were prepared using hot water method and used for oral treatment in mice. Groups of ICR mice were infected with 6 × 106 infected red blood cells of P. berghei ANKA by intraperitoneal injection and given the extracts (500, 1500, and 3000 mg/kg) twice a day for 4 consecutive days. To assess hemolysis, hematocrit levels were then evaluated. Malaria infection resulted in hemolysis. However, antihemolytic effects were observed in infected mice treated with these extracts at dose-dependent manners. In conclusion, aqueous crude extracts of green tea, safflower, and mulberry exerted antihemolysis induced by malaria infection. These plants may work as potential source in the development of variety of herbal formulations for malarial treatment.
Hillclimbing in a Hierarchy of Abstraction Spaces

Hillclimbing search has been shown to be useful for solving constraint satisfaction problems that are too large to be attacked using backtracking search. Nevertheless, hillclimbing search can be computationally expensive when the length of each climb is long, or when many climbs are required due to the presence of local, but non-global optima. \Hierarchic Hillclimbing" (HHC) is an extension of ordinary \Flat Hillclimb-ing" that is designed to attack such di(cid:14)culties. HHC carries out hillclimbing search in a hierarchy of abstraction spaces, starting with the most abstract and proceeding to the most concrete. HHC takes as input a description of the abstraction hierarchy, as well as an evaluation function for each abstraction level. The HHC algorithm has been implemented along with a program to synthesize the required abstraction hierarchies and evaluation functions. The synthesis program and the HHC algorithm have been tested in the domains of uniprocessor scheduling and two dimensional tile packing. Re-sults show HHC to improve in two ways on ordinary hillclimbing without abstraction: HHC requires less computation time to complete a single climb. In addition, when the abstraction hierarchy is chosen with care HHC is more likely to (cid:12)nd a solution on a single climb.
Head First: Living Labs for Ad-hoc Search Evaluation

The information retrieval (IR) community strives to make evaluation more centered on real users and their needs. The living labs evaluation paradigm, i.e., observing users in their natural task environments, offers great promise in this regard. Yet, progress in an academic setting has been limited. This paper presents the first living labs for the IR community benchmarking campaign initiative, taking as test two use-cases: local domain search on a university website and product search on an e-commerce site. There are many challenges associated with this setting, including incorporating results from experimental search systems into live production systems, and obtaining sufficiently many impressions from relatively low traffic sites. We propose that head queries can be used to generate result lists offline, which are then interleaved with results of the production system for live evaluation. An API is developed to orchestrate the communication between commercial parties and benchmark participants. This campaign acts to progress the living labs for IR evaluation methodology, and offers important insight into the role of living labs in this space.