pinecone/core-2020-05-10-deduplication huggingface dataset:
Social-aware Opportunistic Routing Protocol based on User's Interactions
  and Interests

Nowadays, routing proposals must deal with a panoply of heterogeneous
devices, intermittent connectivity, and the users' constant need for
communication, even in rather challenging networking scenarios. Thus, we
propose a Social-aware Content-based Opportunistic Routing Protocol, SCORP,
that considers the users' social interaction and their interests to improve
data delivery in urban, dense scenarios. Through simulations, using synthetic
mobility and human traces scenarios, we compare the performance of our solution
against other two social-aware solutions, dLife and Bubble Rap, and the
social-oblivious Spray and Wait, in order to show that the combination of
social awareness and content knowledge can be beneficial when disseminating
data in challenging networks
Eolas: video retrieval application for helping tourists

In this paper, a video retrieval application for the Android mobile platform is described. The application utilises computer vision technologies that, given a photo of a landmark of interest, will automatically locate online videos about that landmark. Content-based video retrieval technologies are adopted to find the most relevant videos based on visual similarity of video content. The system has been evaluated us- ing a custom test collection with human annotated ground truth. We show that our system is effective, both in terms of speed and accuracy. This application is proposed for demonstration at MMM2014 and we are sure that this application would benefit tourists either planning travel or while travelling in real-time.\u
Partial Type Signatures for Haskell

Abstract. Strong type systems can be used to increase the reliability and performance of programs. In combination with type inference the overhead for the programmer can be kept small. Nevertheless, explicit type signatures often remain needed or useful. In languages with standard Hindley-Milner-based type systems, programmers have a binary choice between omitting the type signature (and rely on type inference) or explicitly providing the type entirely; there are no intermediate options. Proposals for partial type signatures exist, but none support features like local constraints and GHC’s non-generalisation of local bindings. Therefore we propose and motivate a practical form of partial type signatures for present-day Haskell. We formally describe our proposal as an extension of the OutsideIn(X) system and prove some of its properties. We have developed a (not yet complete) implementation for the GHC Haskell compiler. Our design fits naturally in both the OutsideIn(X) formalism and the compiler.status: publishe
Improving Key Negotiation in Transitory Master Key Schemes for Wireless Sensor Networks

In recent years, wireless sensor networks have been adopted in different areas of daily life, exposing the network data and the hardware to different security threats. Many key management schemes have been proposed aiming at securing the communications among nodes, for instance the popular LEAP+ protocol. This paper proposes an enhanced variant of the LEAP+ protocol that decreases the key setup time through the reduction of the number of exchanged packets thus improving the security of communications. The results extracted from extensive test sessions obtained by network simulation have been compared to the corresponding data derived from the LEAP+ protocol in order to quantify the improvement
On the use of social trajectory-based clustering methods for public transport optimization

Public transport optimisation is becoming everyday a more di cult and challenging task, because of the increasing number of transportation options as well as the exponential increase of users. Many research contributions about this issue have been recently published under the umbrella of the smart cities research. In this work, we sketch a possible framework to optimize the tourist bus in the city of Barcelona. Our framework will extract information from Twitter and other web services, such as Foursquare to infer not only the most visited places in Barcelona, but also the trajectories and routes that tourist follow. After that, instead of using complex geospatial or trajectory clustering methods, we propose to use simpler clustering techniques as k-means or DBScan but using a real sequence of symbols as a distance measure to incorporate in the clustering process the trajectory information.This work is partially supported by the Ministry of Science and Technology of Spain under contract TIN2012-34557 and by the BSC-CNS
Severo Ochoa program (SEV-2011-00067) and with the support of ACC1Ó, the
Catalan Agency to promote applied research and innovation; and by the Spanish Centre for Development of Industrial Technology under the INNPRONTA program, project IPT-20111006, \CIUDAD2020".Postprint (author’s final draft
Beyond multivariate microaggregation for large record anonymization

Microaggregation is one of the most commonly employed microdata protection methods. The basic idea of microaggregation is to anonymize data by aggregating original records into small groups of at least k elements and, therefore, preserving k -anonymity. Usually, in order to avoid information loss, when records are large, i.e., the number of attributes of the data set is large, this data set is split into smaller blocks of attributes and microaggregation is applied to each block, successively and independently. This is called multivariate microaggregation. By using this technique, the information loss after collapsing several values to the centroid of their group is reduced. Unfortunately, with multivariate microaggregation, the k -anonymity property is lost when at least two attributes of different blocks are known by the intruder, which might be the usual case.\ud
\ud
In this work, we present a new microaggregation method called one dimension microaggregation ( Mic1D-k ). With Mic1D-k , the problem of k -anonymity loss is mitigated by mixing all the values in the original microdata file into a single non-attributed data set using a set of simple pre-processing steps and then, microaggregating all the mixed values together. Our experiments show that, using real data, our proposal obtains lower disclosure risk than previous approaches whereas the information loss is preserved.Postprint (author’s final draft
Equivariant bifurcation in geometric variational problems

We prove an extension of a celebrated equivariant bifurcation result of J.
Smoller and A. Wasserman, in an abstract framework for geometric variational
problems. With this purpose, we prove a slice theorem for continuous affine
actions of a (finite-dimensional) Lie group on Banach manifolds. As an
application, we discuss equivariant bifurcation of constant mean curvature
hypersurfaces, providing a few concrete examples and counter-examples.Comment: LaTeX2e, 27 pages, 2 figures. To appear in Proceedings of the 9th
  WNLDE (Birkhauser
Tasks Model Composition : beyond data, representing user activities

The aim of this paper is to illustrate, by way of a few case studies, the value of model-based task analysis in interaction and design specification of Web mashups. Task analysis is recognized as one fundamental way to focus on the specific user needs and to improve the general understanding of how users may interact with a user interface to accomplish a given goal when using an interactive system. It is argued that some of current challenges to the design and development of Web mashups are commonplace when building task models. So that, in some extension, model-based task analysis can help designers of Web mashups to better understand and describe users’ tasks for combining data sources. The cases studies presented hereafter focused on tasks carried out by both developers and end-users of Web mahsups. More than simple illustrations, all cases studies are issued from real life applications
The Interactive API (iAPI)

The claim of this paper is that reuse on the Web - if sensibly facilitated - can be achieved in a much more intuitive and efficient fashion than today. The idea is to invert the current perspective on reuse by moving away from programmer-oriented artifacts, such as APIs, web services and data feeds, and focusing on user-oriented artifacts, i.e., graphical user interfaces (UIs). The paper defines a new kind of API, the interactive API (iAPI), which reconciles the intuitiveness of interactive UIs with the power of programmable APIs and enables (i) programmatic access to UIs and (ii) interactive, live programming. The paper discusses use cases and implementation options and lays the foundation for UI-oriented computing as a discipline. © Springer International Publishing 2013
From a simple flow to social applications

Currently, there are a lot of people trying to leverage on the success of social networks by implementing social applications. However, implementing social applications is complex, due to the requirements and constraints put by the social networks to protect their data. In this work we present Simple Flow, a tool that simplifies the creation of social applications. Simple Flow proposes a processes-based approach to the design and execution of social applications. Simple Flow targets end-users and programmers with no experience in programming for social networks, giving them the possibility to design processes by concatenating social network actions (like post a message or comment a photo). For the execution of the designed processes Simple Flow interconnects, at runtime, template web pages (one page per action) according to the process design defined previously. These templates abstract the complexities of the interactions with social networks. © Springer International Publishing 2013
Living lab methodology as an assessment tool for mass customization

Mass customization has been regularly used as a growth strategy during the last decades. The strength of this approach stems from offering products adjusted to customers' individual needs, resulting in added value. The latter resides in the word 'custom,' implying unique and utilitarian products allowing for self-expression of the consumer. Researchers and practitioners however predominantly focused on the company's internal processes to optimize mass customization, often resulting in market failure. As a response, a framework with five factors determining the success of mass customization was developed. Additionally, Living Lab methodologies have been used to improve innovation contexts that were too closed. This paper will fill a gap in the literature by demonstrating that the integration of the five-factor framework in the Living Lab methodology is well suited to determine the possible success or failure of a mass-customized product in the market by means of a single case study
Salus: Non-hierarchical memory access rights to enforce the principle of least privilege

Consumer devices are increasingly being used to perform security and privacy critical tasks. The software used to perform these tasks is often vulnerable to attacks, due to bugs in the application itself or in included software libraries. Recent work proposes the isolation of security-sensitive parts of applications into protected modules, each of which can only be accessed through a predefined public interface. But most parts of an application can be considered security-sensitive at some level, and an attacker that is able to gain in-application level access may be able to abuse services from protected modules.

We propose Salus, a Linux kernel modification that provides a novel approach for partitioning processes into isolated compartments. By enabling compartments to restrict the system calls they are allowed to perform and to authenticate their callers and callees, the impact of unsafe interfaces and vulnerable compartments is significantly reduced. We describe the design of Salus, report on a prototype implementation and evaluate it in terms of security and performance. We show that Salus provides a significant security improvement with a low performance overhead, without relying on any non-standard hardware support.status: publishe
Safety contracts for timed reactive components

A variety of system design and architecture description languages, such as SysML, UML or AADL, allows the decomposition of complex system designs into communicating timed components. In this paper we consider the contract-based specification of such components. A contract is a pair formed of an assumption, which is an abstraction of the component’s environment, and a guarantee, which is an abstraction of the component’s behavior given that the environment behaves according to the assumption. Thus, a contract concentrates on a specific aspect of the component’s functionality and on a subset of its interface, which makes it relatively simpler to specify. Contracts may be used as an aid for hierarchical decomposition during design or for verification of properties of composites. This paper defines contracts for components formalized as a variant of timed input/output automata, introduces compositional results allowing to reason with contracts and shows how contracts can be used in a high-level modeling language (SysML) for specification and verification, based on an example extracted from a real-life system
Minimum activation cost node-disjoint paths in graphs with bounded treewidth

In activation network problems we are given a directed or undirected graph G = (V,E) with a family {f uv : (u,v) ∈ E} of monotone non-decreasing activation functions from D2 to {0,1}, where D is a constant-size subset of the non-negative real numbers, and the goal is to find activation values xv for all v ∈ V of minimum total cost ∑  v ∈ V x v such that the activated set of edges satisfies some connectivity requirements. We propose algorithms that optimally solve the minimum activation cost of k node-disjoint st-paths (st-MANDP) problem in O(tw ((5 + tw)|D|)2tw + 2|V|3) time and the minimum activation cost of node-disjoint paths (MANDP) problem for k disjoint terminal pairs (s 1,t 1),…,(s k ,t k ) in O(tw ((4 + 3tw)|D|)2tw + 2|V|) time for graphs with treewidth bounded by tw.Peer-reviewedPost-print40th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 26-29, 2014
Visiting the Iron Cage: Bureaucracy and the Contemporary Workplace

Bureaucracy as an organizational form has always been a controversial issue and placed at the very heart of most discussions within organizational theory. One side of this prolonged discussion praises this administrative form as the ‘rational’ way to run an organization. It provides needed guidance and clarifies responsibilities, which enables employees to become more efficient. However, the opposition claims that in a non-linear world, where industrial organizations are forced to confront the challenging task of sensing and responding to unpredictable, novel situations of highly competitive markets, such an organizational form stifles creativity, fosters de-motivation and causes pressure on employees. Dealing with a bureaucratic form of organization and its consequences begs for a context. It would be appropriate to quit ‘taking sides’ and develop a sound analysis of this phenomenon under the conditions of today’s global workplace environment. This chapter intends to delineate the conditions under which bureaucracy has emerged and the way it has been interpreted since its inception and develop a sound and appropriate analytical approach to its functioning given the prevailing conditions of the contemporary workplace.Publisher's VersionAuthor Post Prin
Evidence for a stratigraphic basis for the Anthropocene

The Anthropocene was proposed as a term (Crutzen and Stoermer 2000) before consideration was given to the nature of the key signatures, contrasting with standard procedures for defining such units. The term is being widely used in both popular and scientific publications before a decision is made as to whether it warrants formalisation and definition of a Global Stratigraphic Section and Point (GSSP). The deliberate human modification of the landscape and its subsurface, and the creation of human-generated novel sedimentary deposits, minerals, and landforms, are characteristic features of the development of Earth’s surface and near surface, which has accelerated in the past two centuries. The large-scale intentional excavation, transportation, and deposition of mixtures of rock and soil to form anthropogenic deposits and landforms represent a new geological process that could be used as a diagnostic signature of the Anthropocene
Upper Pliensbachian-Middle Toarcian foraminiferal assemblages\ud
at Camino Section (Basque-Cantabrian Basin, Spain)

Boreal foraminiferal faunas have been recorded in the Upper Pliensbachian-Middle Toarcian at Camino Section\ud
(Western Sector of the Basque-Cantabrian Basin, Spain). The results reveal stepwise extinction, replacement and\ud
renewal events along the Pliensbachian-Toarcian transition. The extinction of typical long-ranging Lower\ud
Jurassic foraminiferal species takes place mainly in the Tenuicostatum Zone of the Toarcian. Besides this, the\ud
most significant renewal event occurs in the Serpentinum Zone with the first appearance of the genus Citharina\ud
represented by various species. Typical Lower Toarcian species are recorded in the Tenuicostatum Zone both in\ud
the Paltum and Semicelatum Subzones
Hiring Workers with Disabilities when a Quota Requirement Exists: The relevance of firm’s size

We evaluate the impact of a mandatory quota of workers with disabilities using a sharp regression discontinuity design. We use data from a panel of Spanish firms where there is a mandatory quota of 2 per cent for firms with 50 or more workers. Non-parametric estimations show that strictly beyond the cut off of 50 workers there is an increase of 1.4 points in the percentage of workers with disabilities in the firm, just fulfilling the quota of 2 per cent. However, this effect has some lack of precision. In addition, for larger firm’s sizes the variation in the percentage of workers with disabilities will be more related with differences in firms’ characteristics.
Applying semantic web technologies to context modeling in ambient intelligence

http://www.emse.fr/~picard/publications/sorici13percam.pdfInternational audienceRepresentation and reasoning about context information is a main area of research in Ambient Intelligence (AmI). Given the openness and decentralization of many AmI applications, we argue that usage of se- mantic web technologies for context modeling brings advantages in terms of standards, uniform representation and expressive reasoning. We present an approach for modeling of context information which builds and improves upon related lines of work (SOUPA, CML, annotated RDF). We provide a formalization of the model and an innovative realization using the latest proposals for semantic web standards like RDF and SPARQL. A commonly encountered ambient intelligence scenario showcases the approach
Towards a transfer learning-based approach for monitoring fitness levels

The mobile ecosystem is rife with applications that aim for
individuals to persue a more active and healthier lifestyle. Applications vary from simple diaries that track your weight, calorie intake or blood glucose values towards more advanced ones that offer health recommendations while monitoring your fitness levels during workouts and throughout the day. Leveraging machine learning techniques is a popular approach to recognize non-trivial activities, such as different types of sports. However, such applications face a time consuming training phase before they become practical. In this work, we report on our feasibility analysis of transfer learning as a way to apply learned models from one individual on another, and report on various feature variabilities that may jeopardize the applicability of transfer learning.status: publishe
On the convergence of the combination technique

Sparse tensor product spaces provide an efficient tool todiscretize higher dimensional operator equations. The direct Galerkin method in such ansatz spaces may employ hierarchical bases, interpolets, wavelets or multilevel frames. Besides, an alternative approach is provided by the so-called combination technique. It properly combines the Galerkin solutions of the underlying problem on certain full (but small) tensor product spaces. So far, however, the combination technique has been analyzed only for special model problems. In the present paper, we provide now the analysis of the combination technique for quite general operator equations in sparse tensor product spaces. We prove that the combination technique produces the same order of convergence as the Galerkin approximation with respect to the sparse tensor product space. Furthermore, the order of the cost complexity is the same as for the Galerkin approach in the sparse tensor product space. Our theoretical findings are validated by numerical experiments
Damage detection on the Z24 bridge by a spectral-based dynamic identification technique

The paper tackles the dynamic identification and the damage detection carried out by a spectral-based method on the well-known Z24 bridge, a three-span pre-stressed concrete bridge located in Switzerland. Before being destroyed, the bridge was progressively damaged and tested in the framework of the Brite Euram project SIMCES. Starting from this benchmark, the presented spectral-based identification technique is validated and the usefulness of this method as a non-destructive tool able to catch the dynamic behavior of a structure and locate the damage is widely discussed. Firstly, a FE model of the bridge was built and calibrated in order to analyze its response to different excitation types (free vibration, triangular pulse, swept sine, shaker and random vibrations) and several damage scenarios. Secondly, aiming at identifying both the modal parameters and the damage of the bridge, the spectral-based method is applied making use of the power spectral matrix decomposition. Finally, a proper index is defined and applied to this case-study in order to locate the damage
Assessment and Localization of Active Discontinuities Using Energy Distribution Between Intrinsic Modes

A method for localization and severity assessment of structural damages is proposed. The algorithm works based on nonlinear behavior of certain type of damages such as breathing cracks which are called active discontinuities in this paper. Generally, nonlinear features are more sensitive to such damages although their extraction is sometimes controversial. A major controversy is the imposition of spurious modes on the expansion of the signal which needs to be addressed for an effective application and robustness of the method. The energy content of Intrinsic Mode Functions (IMFs), which are the resultants of Empirical Mode Decomposition (EMD), and also the shape of energy distribution between these modes before and after damage, are used for localization and severity assessment of the damages. By using EMD, we preserve the nonlinear aspects of the signal while avoiding imposition of spurious harmonics on its expansion without any assumption of stationarity. The developed algorithms are used to localize and assess the damage in a steel cantilever beam. The results show that the method can be used effectively for detecting active structural discontinuities due to damage
The use of orbitals and full spectra to identify misalignment

In this paper, a SpectraQuest demonstrator is used to introduce misalignment in a rotating set-up. The vibrations caused by misalignment is measured with both accelerometers on the bearings and eddy current probes on the shaft itself. A comparison is made between the classical spectral analysis, orbitals and full spectra. Orbitals are used to explain the physical interpretation of the vibration caused by misalignment. Full spectra allow to distinguish unbalance from misalignment by looking at the forward and reversed phenomena. This analysis is done for different kinds of misalignment, couplings, excitation forces and combined machinery faults