pinecone/core-2020-05-10-deduplication huggingface dataset:
Root cause analysis with enriched process logs

In the field of process mining, the use of event logs for the purpose of root cause analysis is increasingly studied. In such an analysis, the availability of attributes/features that may explain the root cause of some phenomena is crucial. Currently, the process of obtaining these attributes from raw event logs is performed more or less on a case-by-case basis: there is still a lack of generalized systematic approach that captures this process. This paper proposes a systematic approach to enrich and transform event logs in order to obtain the required attributes for root cause analysis using classical data mining techniques, the classification techniques. This approach is formalized and its applicability has been validated using both self-generated and publicly-available logs
Predicting deadline tansgressions using event logs

Effective risk management is crucial for any organisation.\ud
One of its key steps is risk identification, but few tools exist to support this process. Here we present a method for the automatic discovery of a particular type of process-related risk, the danger of deadline transgressions or overruns, based on the analysis of event logs. We define a set of time-related process risk indicators, i.e., patterns observable in event logs that highlight the likelihood of an overrun, and then show how instances of these patterns can be identified automatically using statistical principles. To demonstrate its feasibility, the approach has been implemented as a plug-in module to the process mining framework ProM and tested using an event log from a Dutch financial institution
Investigating the Process of Process Modeling with Eye Movement Analysis

Research on quality issues of business process models has recently begun to
explore the process of creating process models by analyzing the modeler's
interactions with the modeling environment. In this paper we aim to complement
previous insights on the modeler's modeling behavior with data gathered by
tracking the modeler's eye movements when engaged in the act of modeling. We
present preliminary results and outline directions for future research to
triangulate toward a more comprehensive understanding of the process of process
modeling. We believe that combining different views on the process of process
modeling constitutes another building block in understanding this process that
will ultimately enable us to support modelers in creating better process
models.Comment: arXiv admin note: text overlap with arXiv:1511.0405
A Proficient and Dynamic Bidding Agent for Online Auctions

E-consumers face biggest challenge of opting for the best bidding strategies for competing in an environment of multiple and simultaneous online auctions for same or similar items. It becomes very complicated for the bidders to make decisions of selecting which auction to participate in, place single or multiple bids, early or late bidding and how much to bid. In this paper, we present the design of an autonomous dynamic bidding agent (ADBA) that makes these decisions on behalf of the buyers according to their bidding behaviors. The agent develops a comprehensive method for initial price prediction and an integrated model for bid forecasting. The initial price prediction method selects an auction to participate in and then predicts its closing price (initial price). Then the bid forecasting model forecasts the bid amount by designing different bidding strategies followed by the late bidders. The experimental results demonstrated improved initial price prediction outcomes by proposing a clustering based approach. Also, the results show the proficiency of the bidding strategies amongst the late bidders with desire for bargai
Ontology-based identification of music for places

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-36309-2_37Proceedings of the International Conference on Information and Communication Technologies in Tourism in Innsbruck, Austria, January 22-25, 2013Place is a notion closely linked with the wealth of human experience, and invested by values, attitudes, and cultural influences. In particular, many places are strongly linked to music, which contributes to shaping the perception and the meaning of a place. In this paper we propose a computational approach for identifying musicians and music suited for a place of interest (POI). We present a knowledge-based framework built upon the DBpedia ontology, and a graph-based algorithm that scores musicians with respect to their semantic relatedness to a POI and suggests the top scoring ones. We found that users appreciate and judge as valuable the musician suggestions generated by the proposed approach. Moreover, users perceived compositions of the suggested musicians as suited for the POIs
Design of Novel Algorithm and Architecture for Gaussian Based Color
  Image Enhancement System for Real Time Applications

This paper presents the development of a new algorithm for Gaussian based
color image enhancement system. The algorithm has been designed into
architecture suitable for FPGA/ASIC implementation. The color image enhancement
is achieved by first convolving an original image with a Gaussian kernel since
Gaussian distribution is a point spread function which smoothen the image.
Further, logarithm-domain processing and gain/offset corrections are employed
in order to enhance and translate pixels into the display range of 0 to 255.
The proposed algorithm not only provides better dynamic range compression and
color rendition effect but also achieves color constancy in an image. The
design exploits high degrees of pipelining and parallel processing to achieve
real time performance. The design has been realized by RTL compliant Verilog
coding and fits into a single FPGA with a gate count utilization of 321,804.
The proposed method is implemented using Xilinx Virtex-II Pro XC2VP40-7FF1148
FPGA device and is capable of processing high resolution color motion pictures
of sizes of up to 1600x1200 pixels at the real time video rate of 116 frames
per second. This shows that the proposed design would work for not only still
images but also for high resolution video sequences.Comment: 15 pages, 15 figure
Forward-secure hierarchical predicate encryption

Secrecy of decryption keys is an important pre-requisite for security of any encryption scheme and compromised private keys must be immediately replaced. \emph{Forward Security (FS)}, introduced to Public Key Encryption (PKE) by Canetti, Halevi, and Katz (Eurocrypt 2003), reduces damage from compromised keys by guaranteeing confidentiality of messages that were encrypted prior to the compromise event. The FS property was also shown to be achievable in (Hierarchical) Identity-Based Encryption (HIBE) by Yao, Fazio, Dodis, and Lysyanskaya (ACM CCS 2004). Yet, for emerging encryption techniques, offering flexible access control to encrypted data, by means of functional relationships between ciphertexts and decryption keys, FS protection was not known to exist.\smallskip \ud
\ud
In this paper we introduce FS to the powerful setting of \emph{Hierarchical Predicate Encryption (HPE)}, proposed by Okamoto and Takashima (Asiacrypt 2009). Anticipated applications of FS-HPE schemes can be found in searchable encryption and in fully private communication. Considering the dependencies amongst the concepts, our FS-HPE scheme implies forward-secure flavors of Predicate Encryption and (Hierarchical) Attribute-Based Encryption.\smallskip \ud
\ud
Our FS-HPE scheme guarantees forward security for plaintexts and for attributes that are hidden in HPE ciphertexts. It further allows delegation of decrypting abilities at any point in time, independent of FS time evolution. It realizes zero-inner-product predicates and is proven adaptively secure under standard assumptions. As the ``cross-product" approach taken in FS-HIBE is not directly applicable to the HPE setting, our construction resorts to techniques that are specific to existing HPE schemes and extends them with what can be seen as a reminiscent of binary tree encryption from FS-PKE
Digital Holographic Interferometry in the Long-Wave Infrared for the Testing of Large Aspheric Space Reflectors

Digital holographic (DH) interferometry has been developed in the long-wave infrared spectral range with CO2 lasers and microbolometer arrays. This application has been driven by the European Space Agency’s constant need of techniques for monitoring large displacements of large structures. Here the study focuses on the case of aspheric mirrors, like parabola and ellipses. Usually they are tested through interferometric wavefront error measurements which require expensive null-lenses matching each of the reflectors considered. In the case of monitoring deformation a holographic technique can be considered where the wavefront is compared with itself at different instant. Therefore the optical can be quite simple and easily reconfigurable from one reflector to another.
The advantage of using long wavelength is that large deformations can be measured at once, in addition to being more immune against environmental perturbations. Another advantage of DH at such wavelengths is that the ratio between the wavelength and the pixel size allows reconstructing objects 5 to 10 times larger than with DH in the visible. 
In this project we considered first the case of a 1.1 meter diameter parabola for submillimeter range observations. Such specimen shows strong specular reflectivity. We have developed several set-ups with different ways to illuminate the object and to collect rays to form the object beam: either through point source or through and extended diffuser working by reflection of the laser beam. Both possibilities have been compared in terms of fringe quality as well as measurement range. We selected the diffuser illumination for applying the set-up into a large vacuum facility for measuring the deformation of the parabola between 224 and 107 K. Results of this measurement campaign are presented.
A further application has been shown by observation of off-axis ellipse. In this case interferometric testing is difficult to achieve and LWIR DHI with diffuser illumination is found quite simple to implement and gives straightforward results
Fast Fourier virtual fields method for determination of modulus distributions from full-field optical strain data

The final publication is available at www.springerlink.com.Inspection of parts for manufacturing defects or in-service damage is often carried out by full-field optical techniques (e.g., digital speckle pattern interferometry, digital holography) where the high sensitivity allows small anomalies in a load-induced deformation field to be measured. Standard phase shifting and phase unwrapping algorithms provide full-field displacement and hence strain data over the surface of the sample. The problem remains however of how to quantify the spatial variations in modulus due, for example, to porosity or damage-induced micro-cracking. Finite element model updating (FEMU) is one method to solve problems of this type, by adjusting an approximate finite element model until the responses it produces are as close to those acquired from experiments as possible
On the semantic security of functional encryption schemes

Functional encryption (FE) is a powerful cryptographic primitive that generalizes many asymmetric encryption systems proposed in recent years. Syntax and security definitions for FE were proposed by Boneh, Sahai, and Waters (BSW) (TCC 2011) and independently by O’Neill (ePrint 2010/556). In this paper we revisit these definitions, identify several shortcomings in them, and propose a new definitional approach that overcomes these limitations. Our definitions display good compositionality properties and allow us to obtain new feasibility and impossibility results for adaptive token-extraction attack scenarios that shed further light on the potential reach of general FE for practical applications.ENIAC Joint UndertakingFundação para a Ciência e a Tecnologia (FCT
GIS application and geodatabase for archaeological site documentation system: Bujang Valley, Malaysia

Recently, Geographic Information System (GIS) technology had
becoming a common tool in various fields. The central and local authorities responsible for cultural heritage also embarked on creating an integrated information system, having GIS as one of the main infrastructure component. The
objectives of the research are to capture the archaeological site (monument) spatial data using the technique of terrestrial laser scanning (TLS), as well as developing a 2D map and 3D visualization of Site Number 23. This research also examines the design and development of a GIS database and documentation system of an archaeological site. If all the data are made available in GIS, it can be combined and further analyzed by archaeologist as well as by the museum. The technique for spatial data capturing was TLS because its advantages to measure the distances and angles of objects without any contact and 3D visualization can be made from the point cloud data. A user-friendly interface of the system was completed by using Microsoft Visual Basic software. Thus, in this study, the archival documentation of an archaeological site which is Site Number 23 at Bujang Valley, Kedah was compiled into a GIS database.
Calibration and accuracy assessment of Leica ScanStation C10 terrestrial laser scanner

Requirement of high accuracy data in surveying applications has made calibration procedure a standard routine for all surveying instruments. This is due to the assumption that all observed data are impaired with errors. Thus, this routine is also applicable to terrestrial laser scanner (TLS) to make it available for surveying purposes. There are two calibration approaches: (1) component, and (2) system calibration. With the intention to specifically identify the errors and accuracy of the Leica ScanStation C10 scanner, this study investigates component calibration. Three components of calibration were performed to identify the constant, scale error, accuracy of angular measurement and the effect of angular resolution for distance measurement. The first calibration has been processed using closed least square solutions and has yielded the values of constant (1.2 mm) and scale error (1.000008879). Using variance ratio test (F-Test), angles observation (horizontal and vertical) for Leica C10 scanner and Leica TM5100A theodolite have shown significance difference. This is because the accuracy of both sensors are not similar and these differences are 0.01 and 0.0075º for horizontal and vertical measurements, respectively. Investigation on the resolution setting for Leica C10 scanner has highlighted the drawback of the tilt-and-turn target. Using the highest resolution, Leica Cyclone software only able to recognize the tilt-and-turn target up to 10 m distance compare to 200 m for the black and white target.
Reliability of a high accuracy image-based system for 3D modelling of the medial longitudinal arch during gait

The Medial Longitudinal Arch (MLA) is the largest arch of the foot and is regarded as the most important foot arch in clinical foot assessments due to its influence on lower limb function, foot stability and foot pain. Each foot is classified as either high arched, low arched or normally arched depending on the structure of the MLA. There are currently a number of techniques that are used to classify the foot in a static state based on measurements of the MLA. These static measurements are then used to predict the behaviour of the foot arch in a dynamic state. However, it is easy to identify limitations with these techniques as the shape of the MLA in a static state cannot predict the behaviour of the MLA during dynamic activities. Therefore, the aim of this chapter is to introduce a high accuracy 3D modelling system that has been developed to map the shape of the MLA during gait using high definition video camcorders. The objectives of the study were hence: (1) to determine whether changes can be detected along the MLA for different weight bearings during gait, (2) to test the accuracy and reliability of the developed imaging system for creating dynamic 3D models of the foot arch and (3) to determine the quality and suitability of the 3D model. The results of the study show that changes can be detected along the MLA during gait with a level of accuracy of less than 0.4 mm when a 3D model of the foot is generated in PhotoModeler Scanner.
Justification of the Bending-Gradient Plate Model Through Asymptotic Expansions

In a recent work, a new plate theory for thick plates was suggested where the static unknowns are those of the Kirchhoff-Love theory, to which six components are added representing the gradient of the bending moment [1]. This theory, called the Bending-Gradient theory, is the extension to multilayered plates of the Reissner-Mindlin theory which appears as a special case when the plate is homogeneous. This theory was derived following the ideas from Reissner [2] without assuming a homogeneous plate. However, it is also possible to give a justiﬁcation through asymptotic expansions. In the present paper, the latter are applied one order higher than the leading order to a laminated plate following monoclinic symmetry. Using variational arguments, it is possible to derive the Bending-Gradient theory. This could explain the convergence when the thickness is small of the Bending-Gradient theory to the exact solution illustrated in [3]. However, the question of the edge-effects and boundary conditions remains open
Effect of Emotion and Personality on Deviation from Purely Rational Decision-Making

Human decision-making has consistently demonstrated deviation from "pure" rationality. Emotions are a primary driver of human actions and the current study investigates how perceived emotions and personality traits may affect decision-making during the Ultimatum Game (UG). We manipulated emotions by showing images with emotional connotation while participants decided how to split money with a second player. Event-related potentials (ERPs) from scalp electrodes were recorded during the whole decision-making process. We observed significant differences in the activity of central and frontal areas when participants offered money with respect to when they accepted or rejected an offer. We found that participants were more likely to offer a higher amount of money when making their decision in association with negative emotions. Furthermore, participants were more likely to accept offers when making their decision in association with positive emotions. Honest, conscientious, and introverted participants were more likely to accept offers. Our results suggest that factors others than a rational strategy may predict economic decision-making in the UG
Temporal networks of face-to-face human interactions

The ever increasing adoption of mobile technologies and ubiquitous services
allows to sense human behavior at unprecedented levels of details and scale.
Wearable sensors are opening up a new window on human mobility and proximity at
the finest resolution of face-to-face proximity. As a consequence, empirical
data describing social and behavioral networks are acquiring a longitudinal
dimension that brings forth new challenges for analysis and modeling. Here we
review recent work on the representation and analysis of temporal networks of
face-to-face human proximity, based on large-scale datasets collected in the
context of the SocioPatterns collaboration. We show that the raw behavioral
data can be studied at various levels of coarse-graining, which turn out to be
complementary to one another, with each level exposing different features of
the underlying system. We briefly review a generative model of temporal contact
networks that reproduces some statistical observables. Then, we shift our focus
from surface statistical features to dynamical processes on empirical temporal
networks. We discuss how simple dynamical processes can be used as probes to
expose important features of the interaction patterns, such as burstiness and
causal constraints. We show that simulating dynamical processes on empirical
temporal networks can unveil differences between datasets that would otherwise
look statistically similar. Moreover, we argue that, due to the temporal
heterogeneity of human dynamics, in order to investigate the temporal
properties of spreading processes it may be necessary to abandon the notion of
wall-clock time in favour of an intrinsic notion of time for each individual
node, defined in terms of its activity level. We conclude highlighting several
open research questions raised by the nature of the data at hand.Comment: Chapter of the book "Temporal Networks", Springer, 2013. Series:
  Understanding Complex Systems. Holme, Petter; Saram\"aki, Jari (Eds.
Dynamic communicability predicts infectiousness

Using real, time-dependent social interaction data, we look at correlations between some recently proposed dynamic centrality measures and summaries from large-scale epidemic simulations. The evolving network arises from email exchanges. The centrality measures, which are relatively inexpensive to compute, assign rankings to individual nodes based on their ability to broadcast information over the dynamic topology. We compare these with node rankings based on infectiousness that arise when a full stochastic SI simulation is performed over the dynamic network. More precisely, we look at the proportion of the network that a node is able to infect over a fixed time period, and the length of time that it takes for a node to infect half the network.We find that the dynamic centrality measures are an excellent, and inexpensive, proxy for the full simulation-based measures
Random Walks on Stochastic Temporal Networks

In the study of dynamical processes on networks, there has been intense focus
on network structure -- i.e., the arrangement of edges and their associated
weights -- but the effects of the temporal patterns of edges remains poorly
understood. In this chapter, we develop a mathematical framework for random
walks on temporal networks using an approach that provides a compromise between
abstract but unrealistic models and data-driven but non-mathematical
approaches. To do this, we introduce a stochastic model for temporal networks
in which we summarize the temporal and structural organization of a system
using a matrix of waiting-time distributions. We show that random walks on
stochastic temporal networks can be described exactly by an
integro-differential master equation and derive an analytical expression for
its asymptotic steady state. We also discuss how our work might be useful to
help build centrality measures for temporal networks.Comment: Chapter in Temporal Networks (Petter Holme and Jari Saramaki
  editors). Springer. Berlin, Heidelberg 2013. The book chapter contains minor
  corrections and modifications. This chapter is based on arXiv:1112.3324,
  which contains additional calculations and numerical simulation