pinecone/core-2020-05-10-deduplication huggingface dataset:
Online pricing for multi-type of Items

LNCS v. 7285 entitled: Frontiers in algorithmics and algorithmic aspects in information and management: joint international conference, FAW-AAIM 2012 ... proceedingsIn this paper, we study the problem of online pricing for bundles of items. Given a seller with k types of items, m of each, a sequence of users {u 1, u 2, ...} arrives one by one. Each user is single-minded, i.e., each user is interested only in a particular bundle of items. The seller must set the price and assign some amount of bundles to each user upon his/her arrival. Bundles can be sold fractionally. Each u i has his/her value function v i (·) such that v i (x) is the highest unit price u i is willing to pay for x bundles. The objective is to maximize the revenue of the seller by setting the price and amount of bundles for each user. In this paper, we first show that the lower bound of the competitive ratio for this problem is Ω(logh + logk), where h is the highest unit price to be paid among all users. We then give a deterministic online algorithm, Pricing, whose competitive ratio is O (√k·log h log k). When k = 1 the lower and upper bounds asymptotically match the optimal result O(logh). © 2012 Springer-Verlag.postprin
Optical Cooling Using the Dipole Force

The term `laser cooling' is applied to the use of optical means to cool the
motional energies of either atoms and molecules, or micromirrors. In the
literature, these two strands are kept largely separate; both, however suffer
from severe limitations. Laser cooling of atoms and molecules largely relies on
the internal level structure of the species being cooled. As a result, only a
small number of elements and a tiny number of molecules can be cooled this way.
In the case of micromirrors, the problem lies in the engineering of
micromirrors that need to satisfy a large number of constraints---these include
a high mechanical Q-factor, high reflectivity and very good optical quality,
weak coupling to the substrate, etc.---in order to enable efficient cooling.
During the course of this thesis, I will draw these two sides of laser cooling
closer together by means of a single, generically applicable scattering theory
that can be used to explain the interaction between light and matter at a very
general level. I use this `transfer matrix' formalism to explore the use of the
retarded dipole--dipole interaction as a means of both enhancing the efficiency
of micromirror cooling systems and rendering the laser cooling of atoms and
molecules less species selective. In particular, I identify the `external
cavity cooling' mechanism, whereby the use of an optical memory in the form of
a resonant element (such as a cavity), outside which the object to be cooled
sits, can potentially lead to the construction of fully integrated
optomechanical systems and even two-dimensional arrays of translationally cold
atoms, molecules or even micromirrors.Comment: PhD Thesis. 287 pages, heavily compressed. This version fixes a few
  problems. High-resolution version available at http://andre.xuereb.info
Spherical harmonic transform with GPUs

We describe an algorithm for computing an inverse spherical harmonic
transform suitable for graphic processing units (GPU). We use CUDA and base our
implementation on a Fortran90 routine included in a publicly available parallel
package, S2HAT. We focus our attention on the two major sequential steps
involved in the transforms computation, retaining the efficient parallel
framework of the original code. We detail optimization techniques used to
enhance the performance of the CUDA-based code and contrast them with those
implemented in the Fortran90 version. We also present performance comparisons
of a single CPU plus GPU unit with the S2HAT code running on either a single or
4 processors. In particular we find that use of the latest generation of GPUs,
such as NVIDIA GF100 (Fermi), can accelerate the spherical harmonic transforms
by as much as 18 times with respect to S2HAT executed on one core, and by as
much as 5.5 with respect to S2HAT on 4 cores, with the overall performance
being limited by the Fast Fourier transforms. The work presented here has been
performed in the context of the Cosmic Microwave Background simulations and
analysis. However, we expect that the developed software will be of more
general interest and applicability
Resource Allocation for the French National Grid Initiative

International audienceDistribution of resources between different communities in production grids is the combined result of needs and policies: where the users' needs dictate what is required, resource providers' policies define how much is offered and how it is offered. From a provider point of view, getting a comprehensive and fair understanding of resources distribution is then a key element for the establishment of any scientific policy, and a prerequisite for delivering a high quality of service to users. The resource allocation model which is currently applied within most national grid initiatives (NGIs) was designed with the needs of the EGEE (Enabling Grids for E-sciencE) projects and should now be revised: NGIs now especially need to assess how resources and services are delivered to their national community, and expose the return on investment for resources delivered to international communities. The French NGI "France Grilles" is currently investigating down this route, trying to define key principles for a national resource allocation strategy that would answer this concern while allowing for the proper definition of service level agreements (SLA) between users, providers and the NGI itself. After looking for clear definitions of who are the communities we are dealing with, we propose to look at how resource allocation is done in other environments such as high performance computing (HPC) and the concepts we could possibly reuse from there while keeping the specificities of the Grid. We then review different use-cases and scenarios before concluding on a proposal which, together with open questions, could constitute a base for a resource allocation strategy for the French national grid
A pervasive approach to a real-time intelligent decision support system in intensive medicine

The decision on the most appropriate procedure to provide to the
patients the best healthcare possible is a critical and complex task in Intensive
Care Units (ICU). Clinical Decision Support Systems (CDSS) should deal with
huge amounts of data and online monitoring, analyzing numerous parameters
and providing outputs in a short real-time. Although the advances attained in
this area of knowledge new challenges should be taken into account in future
CDSS developments, principally in ICUs environments. The next generation of
CDSS will be pervasive and ubiquitous providing the doctors with the
appropriate services and information in order to support decisions regardless the
time or the local where they are. Consequently new requirements arise namely
the privacy of data and the security in data access. This paper will present a
pervasive perspective of the decision making process in the context of INTCare
system, an intelligent decision support system for intensive medicine. Three
scenarios are explored using data mining models continuously assessed and
optimized. Some preliminary results are depicted and discussed.Fundação para a Ciência e a Tecnologia (FCT
A Universal Client-based Identity Management Tool

A wide variety of identity management systems have been  introduced to improve the security and usability of user  authentication; however, password-based authentication remains  the dominant technology despite its well known shortcomings. In  this paper we describe a client-based identity management tool  we call IDSpace, designed to address this problem by providing  a single user interface and user experience for user  authentication, whilst supporting a range of existing identity  management technologies. The goal is to simplify the use of the  wide range of existing technologies, helping to encourage their  use, whilst imposing no additional burden on existing service  providers and identity providers. Operation of IDSpace with  certain existing systems is described
Design science research and the core of information systems

Design Science Research (DSR) has emerged as an important approach in Information Systems (IS) research, evidenced by the plethora of recent related articles in recognized IS outlets. Nonetheless, discussion continues on the value of DSR for IS and how to conduct strong DSR, with further discussion necessary to better position DSR as a mature and stable research paradigm appropriate for IS. This paper contributes to address this need, by providing a comprehensive conceptual and argumentative positioning of DSR relative to the core of IS. This paper seeks to argue the relevance of DSR as a paradigm that addresses the core of IS discipline well. Here we use the framework defined by Wand and Weber, to position what the core of IS is
Cryptographic Treatment of Private User Profiles

The publication of private data in user profiles in a both secure and private way is a rising problem and of special interest in, e.g., online social networks that become more and more popular. Current approaches, especially for decentralized networks, often do not address this issue or impose large storage overhead. In this paper, we present a cryptographic approach to Private Profile Management that is seen as a building block for applications in which users maintain their own profiles, publish and retrieve data, and authorize other users to access different portions of data in their profiles. In this course, we provide: (i) formalization of confidentiality and unlinkability as two main security and privacy goals for the data which is kept in profiles and users who are authorized to retrieve this data, and (ii) specification, analysis, and comparison of two private profile management schemes based on different encryption technique
Practical Use of Formal Concept Analysis in Service-Oriented Computing

International audiencePervasive applications are encountered in a number of settings, including smart houses, intelligent buildings or connected plants. Service-Oriented Computing is today the technology of choice for implementing and exposing resources in such environments. The selection of appropriate services at the right moment in order to compose meaningful applications is however a real issue. In this paper, we propose a FCA-based solution to this problem.We have integrated FCA algorithms in our pervasive gateways and adapted them in order to allow efficient runtime selection of heterogeneous and dynamic services. This work has been applied to realistic use cases in the scope of a European project
Distributed Formal Concept Analysis Algorithms Based on an Iterative
  MapReduce Framework

While many existing formal concept analysis algorithms are efficient, they
are typically unsuitable for distributed implementation. Taking the MapReduce
(MR) framework as our inspiration we introduce a distributed approach for
performing formal concept mining. Our method has its novelty in that we use a
light-weight MapReduce runtime called Twister which is better suited to
iterative algorithms than recent distributed approaches. First, we describe the
theoretical foundations underpinning our distributed formal concept analysis
approach. Second, we provide a representative exemplar of how a classic
centralized algorithm can be implemented in a distributed fashion using our
methodology: we modify Ganter's classic algorithm by introducing a family of
MR* algorithms, namely MRGanter and MRGanter+ where the prefix denotes the
algorithm's lineage. To evaluate the factors that impact distributed algorithm
performance, we compare our MR* algorithms with the state-of-the-art.
Experiments conducted on real datasets demonstrate that MRGanter+ is efficient,
scalable and an appealing algorithm for distributed problems.Comment: 17 pages, ICFCA 201, Formal Concept Analysis 201
A Closer Look at Security in Random Number Generators Design

International audienceThe issue of random number generation is crucial for the implementation of cryptographic systems. Random numbers are often used in key generation processes, authentication protocols, zeroknowledge protocols, padding, in many digital signature and encryption schemes, and even in some side channel attack countermeasures. For these applications, security depends to a great extent on the quality of the source of randomness and on the way this source is exploited. The quality of the generated numbers is checked by statistical tests. In addition to the good statistical properties of the obtained numbers, the output of the generator used in cryptography must be unpredictable. Besides quality and unpredictability requirements, the generator must be robust against aging e ects and intentional or unintentional environmental variations, such as temperature, power supply, electromagnetic emanations, etc. In this paper, we discuss practical aspects of a true random number generator design. Special attention is given to the analysis of security requirements and on the way how this requirements can be met in practice
Contactless Electromagnetic Active Attack on Ring Oscillator Based True Random Number Generator

International audienceTrue random number generators (TRNGs) are ubiquitous in data security as one of basic cryptographic primitives. They are primarily used as generators of con fidential keys, to initialize vectors, to pad values, but also as random masks generators in some side channel attacks countermeasures. As such, they must have good statistical properties, be unpredictable and robust against attacks. This paper presents a contactless and local active attack on ring oscillators (ROs) based TRNGs using electromagnetic fields. Experiments show that in a TRNG featuring fifty ROs, the impact of a local electromagnetic emanation on the ROs is so strong, that it is possible to lock them on the injected signal and thus to control the monobit bias of the TRNG output even when low power electromagnetic fields are exploited. These results confi rm practically that the electromagnetic waves used for harmonic signal injection may represent a serious security threat for secure circuits that embed RO-based TRNG
Feature reinforcement learning in practice

Following a recent surge in using history-based methods for resolving perceptual aliasing in reinforcement learning, we introduce an algorithm based on the feature reinforcement learning framework called ΦMDP [13]. To create a practical algorithm we devise a stochastic search procedure for a class of context trees based on parallel tempering and a specialized proposal distribution. We provide the first empirical evaluation for ΦMDP. Our proposed algorithm achieves superior performance to the classical U-tree algorithm [20] and the recent active-LZ algorithm [6], and is competitive with MC-AIXI-CTW [29] that maintains a bayesian mixture over all context trees up to a chosen depth. We are encouraged by our ability to compete with this sophisticated method using an algorithm that simply picks one single model, and uses Q-learning on the corresponding MDP. Our ΦMDP algorithm is simpler and consumes less time and memory. These results show promise for our future work on attacking more complex and larger problems
An algorithmic view on multi-related-segments: A unifying model for approximate common interval

International audienceA set of genes that are proximately located on multiple chromosomes often implies their origin from the same ancestral genomic segment or their involvement in the same biological process. Among the numerous studies devoted to model and infer these gene sets, the recently introduced approximate common interval (ACI) models capture gene loss events in addition to the gene insertion, duplication and inversion events already incorporated by earlier models. However, the computational tractability of the corresponding problems remains open in most of the cases. In this contribution, we propose a unifying model for ACI, namely Multi-related-segments (Mrs), and demonstrate that capturing gene losses induces intractability in many cases (answering an open question raised in [19,20])
A Leibniz notation for automatic differentiation

Notwithstanding the superiority of the Leibniz notation for differential calculus, the dot-and-bar notation predominantly used by the Automatic Differentiation community is resolutely Newtonian. In this paper we extend the Leibnitz notation to include the reverse (or adjoint) mode of Automatic Differentiation, and use it to demonstrate the stepwise numerical equivalence of the three approaches using the reverse mode to obtain second order derivatives, namely forward-over-reverse, reverse-over-forward, and reverse-over-reverse
AD in Fortran, Part 2: Implementation via Prepreprocessor

We describe an implementation of the Farfel Fortran AD extensions. These
extensions integrate forward and reverse AD directly into the programming
model, with attendant benefits to flexibility, modularity, and ease of use. The
implementation we describe is a "prepreprocessor" that generates input to
existing Fortran-based AD tools. In essence, blocks of code which are targeted
for AD by Farfel constructs are put into subprograms which capture their
lexical variable context, and these are closure-converted into top-level
subprograms and specialized to eliminate EXTERNAL arguments, rendering them
amenable to existing AD preprocessors, which are then invoked, possibly
repeatedly if the AD is nested
A Proposal of Business Model Design Parameters for Future Internet Carriers

Future Internet evolution requires innovative strategic stances and the design of original business models from actors involved in the ecosystem. The study focuses on Internet Carriers, recently striving to make their business sustainable, and proposes to enclose in a single reference framework all the critical levers, either consolidated or innovative, such actors can employ in order to design their value proposition, value network integration, and financial configuration. The framework grounds its findings on multiple case studies, and, by presenting an insightful list of business model parameters for Carriers, sheds light on key emerging strategic and tactical trends in the Internet interconnections market
An Experimental Study on the Impact of Network Segmentation to the Resilience of Physical Processes

The fact that modern Networked Industrial Control Systems (NICS) depend on Information and Communication Technologies (ICT) is well known. Although many studies have focused on the security of NICS, today we still lack a proper understanding of the impact that network design choices have on the resilience of NICS, e.g., a network architecture using VLAN segmentation. In this paper we investigate the impact of process control network segmentation on the resilience of physical processes. We consider an adversary capable of reprogramming the logic of control hardware in order to disrupt the normal operation of the physical process. Our analysis that is based on the Tennessee-Eastman chemical process proves that network design decisions significantly increase the resilience of the process using as resilience metric  the time that the process is able to run after the attack is started, before shutting down. Therefore a resilience-aware network design can provide a tolerance period of several hours that would give operators more time to intervene, e.g., switch OFF devices or disconnect equipment in order to reduce damages.JRC.G.6-Security technology assessmen
Routing on demand: Toward the energy-aware traffic engineering with OSPF

Energy consumption has already become a major challenge to the current Internet. Most researches aim at lowering energy consumption under certain fixed performance constraints. Since trade-offs exist between network performance and energy saving, Internet Service Providers (ISPs) may desire to achieve different Traffic Engineering (TE) goals corresponding to changeable requirements. The major contributions of this paper are twofold: 1) we present an OSPF-based routing mechanism, Routing On Demand (ROD), that considers both performance and energy saving, and 2) we theoretically prove that a set of link weights always exists for each trade-off variant of the TE objective, under which solutions (i.e., routes) derived from ROD can be converted into shortest paths and realized through OSPF. Extensive evaluation results show that ROD can achieve various trade-offs between energy saving and performance in terms of Maximum Link Utilization, while maintaining better packet delay than that of the energy-agnostic TE. © 2012 IFIP International Federation for Information Processing
Minimization of Network Power Consumption with Redundancy Elimination

Part 5: IP RoutingInternational audienceRecently, energy-aware routing has gained increasing popularity in the networking research community. The idea is that traffic demands are aggregated over a subset of the network links, allowing other links to be turned off to save energy. In this paper, we propose GreenRE - a new energy-aware routing model with the support of the new technique of data redundancy elimination (RE). This technique, enabled within the routers, can identify and remove repeated content from network transfers. Hence, capacity of network links are virtually increased and more traffic demands can be aggregated. Based on our real experiments on Orange Labs platform, we show that performing RE consumes some energy. Thus, while preserving connectivity and QoS, it is important to identify at which routers to enable RE and which links to turn off so that the power consumption of the network is minimized. We model the problem as an Integer Linear Program and propose a greedy heuristic algorithm. Simulations on several network topologies show that GreenRE can gain further 30% of energy savings in comparison with the traditional energy-aware routing model
Playback policies for live and on-demand P2P video streaming

Peer-to-peer (P2P) has become a popular mechanism for video distribution over the Internet, by allowing users to collaborate on locating and exchanging video blocks. The approach LiveShift supports further collaboration by enabling storage and a later redistribution of received blocks, thus, enabling time shifting and video-on-demand in anintegrated manner. Video blocks, however, are not always downloaded quickly enough to be played back without interruptions. In such situations, the playback policy defines whether peers (a) stall the playback, waiting for blocks to be found and downloaded, or (b) skip them, losing information. Thus, for the fist time this paper investigates in a reproducible manner playback policies for P2P video streaming systems. A survey on currently-used playback policies shows that existing playback policies, required by any streaming system, have been defined almost arbitrarily, with a minimal scientific methodology applied. Based on thissurvey and on major characteristics of video streaming, a set of five distinct playback policies is formalized and implemented in LiveShift. Comparative evaluations outline the behavior of those policies under both under- and over-provisioned networks with respect to the playback lag experienced by users, the share of skipped blocks, and the share of sessions that fail. Finally, playback policies with most suitable characteristics for either live or on-demand scenarios are derived