pinecone/core-2020-05-10-deduplication huggingface dataset:
Practices surrounding event photos

Sharing photos through mobile devices has a great potential for creating shared experiences of social events between co-located as well as remote participants. In order to design novel event sharing tools, we need to develop in-depth understanding of current practices surrounding these so called ‘event photos’- photos about and taken during different social events such as weddings picnics, and music concert visits among others. We studied people’s practices related to event photos through in-depth interviews, guided home visits and naturalistic observations. Our results show four major themes describing practices surrounding event photos: 1) representing events, 2) significant moments, 3) situated activities through photos, and 4) collectivism and roles of participants
The ‘Relay Ideation’ Technique: Moving from Problem Understanding to Problem Solving in the Design Process

When describing the design process in product innovation, many authors identify phases that can be described as ‘problem analysis’ and ‘generating ideas’. Several techniques are available to support design teams in each of these phases, but it remains a challenge to move from understanding a problem to coming up with ideas for concepts that might solve the problem. In addition, some of these techniques have counterproductive social side effects, which in fact may impede creativity in a design team. In this paper we describe a new technique for product idea generation called the ‘relay ideation’ technique. This technique was developed to help design teams move from understanding a problem to thinking creatively and concretely about the problem in order to generate concepts for innovative products or services. The technique is illustrated with a case study about IT applications for hearing-impaired children.status: publishe
HCI for city farms : design challenges & opportunities

Urban agriculture plays an important role in many facets of food security, health and sustainability. The city farm is one such manifestation of urban agriculture: it functions as a location centric social hub that supplies food, education, and opportunities for strengthening the diverse sociocultural fabrics of the local community. This paper presents the case of Northey Street City Farm in Brisbane, Australia as an opportunity space for design. The paper iden-tifies four areas that present key challenges and opportunities for HCI design that support social sustainability of the city farm: A preference for face-to-face contact leads to inconsistencies in shared knowledge; a dependence on volun-teers and very limited resources necessitates easily accessible interventions; other local urban agricultural activity needing greater visibility; and the vulner-ability of the physical location to natural phenomenon, in this instance flooding, present a design challenge and a need to consider disaster management
Hierarchical structuring of Cultural Heritage objects within large
  aggregations

Huge amounts of cultural content have been digitised and are available
through digital libraries and aggregators like Europeana.eu. However, it is not
easy for a user to have an overall picture of what is available nor to find
related objects. We propose a method for hier- archically structuring cultural
objects at different similarity levels. We describe a fast, scalable clustering
algorithm with an automated field selection method for finding semantic
clusters. We report a qualitative evaluation on the cluster categories based on
records from the UK and a quantitative one on the results from the complete
Europeana dataset.Comment: The paper has been published in the proceedings of the TPDL
  conference, see http://tpdl2013.info. For the final version see
  http://link.springer.com/chapter/10.1007%2F978-3-642-40501-3_2
PoliMedia - Improving Analyses of Radio, TV & Newspaper Coverage of  Political Debates

Abstract. Analysing media coverage across several types of media-outlets is a\ud
challenging task for academic researchers. The PoliMedia project aimed to\ud
showcase the potential of cross-media analysis by linking the digitised transcriptions\ud
of the debates at the Dutch Parliament (Dutch Hansard) with three\ud
media-outlets: 1) newspapers in their original layout of the historical newspaper\ud
archive at the National Library, 2) radio bulletins of the Dutch National Press\ud
Agency (ANP) and 3) newscasts and current affairs programs from the Netherlands\ud
Institute for Sound and Vision. In this paper we describe generally how\ud
these links were created and we introduce the PoliMedia search user interface\ud
developed for scholars to navigate the links. In evaluation it was found that the\ud
linking algorithm had a recall of 67% and precision of 75%. Moreover, in an\ud
eye tracking evaluation we found that the interface enabled scholars to perform\ud
known-item and exploratory searches for qualitative analysis
Eye Tracking the Use of a Collapsible Facets Panel in a Search Interface

Abstract. Facets can provide an interesting functionality in digital libraries.\ud
However, while some research shows facets are important, other research found\ud
facets are only moderately used. Therefore, in this exploratory study we compare\ud
two search interfaces; one where the facets panel is always visible and one\ud
where the facets panel is hidden by default. Our main research question is “Is\ud
folding the facets panel in a digital library search interface beneficial to academic\ud
users?” By performing an eye tracking study with N=24, we measured\ud
search efficiency, distribution of attention and user satisfaction. We found no\ud
significant differences in the eye tracking data nor in usability feedback and\ud
conclude that collapsing facets is neither beneficial nor detrimental
Social information behaviour in Bookshops: implications for digital libraries

We discuss here our observations of the interaction of bookshop customers with the books and with each other. Contrary to our initial expectations, customers do not necessarily engage in focused, joint information search, as observed in libraries, but rather the bookshop is treated as a social space similar to a cafe. Our results extend the known repertoire of collaborative behaviours, supporting further development of models of user tasks and goals. We compare our findings with previous work and discuss possible implications of our observations for the design of digital libraries as places of both information access and social interaction
Towards a Pervasive Access Control within Video Surveillance Systems

This paper addresses two emerging challenges that multimedia distributed systems have to deal with: the user’s constant mobility and the information’s sensitivity. The systems have to adapt, in real time, to the user’s context and situation in order to provide him with relevant results without breaking the security and privacy policies. Distributed multimedia systems, such as the oneproposed by the LINDO project, do not generally consider both issues. In this paper, we apply an access control layer on top of the LINDO architecture that takes into consideration the user’s context and situation and recommends alternative resources to the user when he is facing an important situation. The proposed solution was implemented and tested in a video surveillance use case
Immersive Interactive Information Mining with Application to Earth Observation Data Retrieval

The exponentially increasing amount of Earth Observation (EO) data requires novel approaches for data mining and exploration. Visual analytic systems have made valuable contribution in understanding the structure of data by providing humans with visual perception of data. However, these systems have limitations in dealing with large-scale high-dimensional data. For instance, the limitation in dimension of the display screen prevents visualizing high-dimensional data points. In this paper, we propose a virtual reality based visual analytic system, so called Immersive Information Mining, to enable knowledge discovery from the EO archive. In this system, Dimension Reduction (DR) techniques are applied to high-dimensional data to map into a lower-dimensional space to be visualized in an immersive 3D virtual environment. In such a system, users are able to navigate within the data volume to get visual perception. Moreover, they can manipulate the data and provide feedback for other processing steps to improve the performance of data mining system
Autonomic computing to manage green Core networks with Quality of Service

In a context where data and computing services are moving to external specialized datacenters the manual management of these systems is becoming an issue. Human administrators have to deal with hardware resources optimization while meeting the users’ needs. In our approach we propose to reconfigure both a set of applications deployed in a datacenter (by adapting their behaviors using autonomic computing) and the wired network (by switching on and off its equipments like routers, modules). We take into account both the energetic costs with the network equipments and the quality of service provided to the end user by the deployed applications. The main contribution of the proposed model is to consider a compromise between the total power consumption of the network equipments and the application quality of service. We validated our approach by simulating deployed applications on the Grid’Mip infrastructure similar to a small core network made up of Cisco routers (part of Grid’5000 project)
Standardization Bodies, Initiatives and their relation to Green IT focused on the Data Centre Side

The aim of this paper is to provide an overview of the main relevant standardization bodies and organizations (national, international, industry groups, standards bodies and regulators) as well as projects, initiatives and actual standards in the field of Green IT, and more especially in the Data Centre area. The co-operation between these different organisations and their different point of views and working areas are also investigated. A critical analysis concerning the motivations and approaches of academia and industry towards the various standardization bodies and initiatives is given
A Terminating Evaluation-Driven Variant of G3i

We present Gbu, a terminating variant of the sequent calculus G3i for intuitionistic propositional logic. Gbu modifies G3i by annotating the sequents so to distinguish rule applications into two phases: an unblocked phase where any rule can be backward applied, and a blocked phase where only right rules can be used. Derivations of Gbu have a trivial translation into G3i. Rules for right implication exploit an evaluation relation, defined on sequents; this is the key tool to avoid the generation of branches of infinite length in proof-search. To prove the completeness of Gbu, we introduce a refutation calculus Rbu for unprovability dual to Gbu. We provide a proof-search procedure that, given a sequent as input, returns either a Rbu-derivation or a Gbu-derivation of it
Compression of Propositional Resolution Proofs by Lowering Subproofs

This paper describes a generalization of the LowerUnits algorithm for the compression of propositional resolution proofs. The generalized algorithm, here called LowerUnivalents, is able to lower not only units but also subproofs of non-unit clauses, provided that they satisfy some additional conditions. This new algorithm is particularly suited to be combined with the RecyclePivotsWithIntersection algorithm. A formal proof that LowerUnivalents always compresses more than LowerUnits is shown, and both algorithms are empirically compared on thousands of proofs produced by the SMT-Solver veriT
A Publish-Subscribe Scheme Based Open Architecture for Crowd-Sourcing

Participatory sensing, when a crowd of users collaborate to collect useful information, based applications are getting popular these days thanks to the proliferation of powerful mobile devices. The built-in sensors of smartphones offer an easy and handy way to monitor the environment and collect data which can serve as the basis of smart applications. However, the quick and flexible development and deployment of these applications call for a unifying open architecture. In this paper we propose a publish-subscribe based open participatory sensing architecture
A Type System for Components

International audienceIn modern distributed systems, dynamic reconfiguration, i.e., changing at runtime the communication pattern of a program, is challenging. Generally, it is difficult to guarantee that such modifications will not disrupt ongoing computations. In a previous paper, a solution to this problem was proposed by extending the object-oriented language ABS with a component model allowing the programmer to: i) perform updates on objects by means of communication ports and their rebinding; and ii) precisely specify when such updates can safely occur in an object by means of critical sections. However, improper rebind operations could still occur and lead to runtime errors. The present paper introduces a type system for this component model that extends the ABS type system with the notion of ports and a precise analysis that statically enforces that no object will attempt illegal rebinding
Rule-level verification of graph transformations for invariants based on edges' transitive closure

This paper develops methods to reason about graph transformation rules for proving the preservation of structural properties, especially global properties on reachability. We characterize a graph transformation rule with an applicability condition specifying the matching conditions of the rule on a host graph as well as the properties to be preserved during the transformation. Our previous work has demonstrated the possibility to reason about a graph transformation at rulelevel with applicability conditions restricted to Boolean combinations of edge expressions. We now extend the approach to handle the applicability conditions containing transitive closure of edges, which implicitly refer to an unbounded number of nodes. We show how these can be internalized into a finite pattern graph in order to enable verification of global properties on paths instead of local properties on edges only
Combining equilibrium logic and dynamic logic

We extend the language of here-and-there logic by two kinds of atomic programs allowing to minimally update the truth value of a propositional variable here or there, if possible. These atomic programs are combined by the usual dynamic logic program connectives. We investigate the mathematical properties of the resulting extension of equilibrium logic: we prove that the problem of logical consequence in equilibrium models is EXPTIME complete by relating equilibrium logic to dynamic logic of propositional assignments
Linear Logic Programming for Narrative Generation

In this paper, we explore the use of Linear Logic programming for story generation. We use the language Celf to represent narrative knowledge, and its own querying mechanism to generate story instances, through a number of proof terms. Each proof term obtained is used, through a resource-flow analysis, to build a directed graph where nodes are narrative actions and edges represent inferred causality relationships. Such graphs represent narrative plots structured by narrative causality. This approach is a candidate technique for narrative generation which unifies declarative representations and generation via query and deduction mechanisms
Belief Change in Nonmonotonic Multi-Context Systems

Brewka and Eiter's nonmonotonic multi-context system is an elegant knowledge representation framework to model heterogeneous and nonmonotonic multiple contexts. Belief change is a central problem in knowledge representation and reasoning. In this paper we follow the classical AGM approach to investigate belief change in multi-context systems. Specifically, we formulate semantically the AGM postulates of belief expansion, revision and contraction for multi-context systems. We show that the change operations can be characterized in terms of minimal change by ordering equilibria of multi-context systems. Two distance based revision operators are obtained and related to the classical Satoh and Dalal revision operators (via loop formulas).Full Tex
Real world coordinate from image coordinate using single calibrated camera based on analytic geometry

The determination of real world coordinate from image coordinate has many applications in computer vision. This paper proposes the algorithm for determination of real world coordinate of a point on a plane from its image coordinate using single calibrated camera based on simple analytic geometry. Experiment has been done using the image of chessboard pattern taken from five different views. The experiment result shows that exact real world coordinate and its approximation lie on the same plane and there are no significant difference between exact real world coordinate and its approximation
Periodicity forcing words

The Dual Post Correspondence Problem asks, for a given word α, if there exists a non-periodic morphism g and an arbitrary morphism h such that g(α) = h(α). Thus α satisfies the Dual PCP if and only if it belongs to a non-trivial equality set. Words which do not satisfy the Dual PCP are called periodicity forcing, and are important to the study of word equations, equality sets and ambiguity of morphisms. In this paper, a 'prime' subset of periodicity forcing words is presented. It is shown that when combined with a particular type of morphism it generates exactly the full set of periodicity forcing words. Furthermore, it is shown that there exist examples of periodicity forcing words which contain any given factor/prefix/suffix. Finally, an alternative class of mechanisms for generating periodicity forcing words is developed, resulting in a class of examples which contrast those known already
Building a hybrid : chatterbot - dialog system

Generic conversational agents often use hard-coded stimulus- response data to generate responses, for which little to no effort is attributed to effectively understand and comprehend the input. The limitation of these types of systems is obvious: the general and linguistic knowledge of the system is limited to what the developer of the system explicitly defined. Therefore, a system which analyses user input at a deeper level of abstraction which backs its knowledge with common sense information will essentially result in a system that is capable of providing more adequate responses which in turn result in a better over- all user experience. From this premise, a framework was proposed, and a working prototype was implemented upon this framework. The prototype makes use of various natural language processing tools, online and offline knowledge bases, and other information sources, to enable it to comprehend and construct relevant responses.peer-reviewe
A Monte Carlo strategy to integrate detection and model-based face analysis

We present a novel probabilistic approach for tting a statistical model to an image. A 3D Morphable Model (3DMM) of faces is interpreted as a generative (Top-Down) Bayesian model. Random Forests are used as noisy detectors (Bottom-Up) for the face and facial landmark positions. The Top-Down and Bottom-Up parts are then combined using a Data-Driven Markov Chain Monte Carlo Method (DDMCMC). As core of the integration, we use the Metropolis-Hastings algorithm which has two main advantages. First, the algorithm can handle unreliable detections and therefore does not need the detectors to take an early and possible wrong hard decision before tting. Second, it is open for integration of various cues to guide the tting process. Based on the proposed approach, we implemented a completely automatic, pose and illumination invariant face recognition application. We are able to train and test the building blocks of our application on di erent databases. The system is evaluated on the Multi-PIE database and reaches state of the art performance
A Comparison of Directional Distances for Hand Pose Estimation

Benchmarking methods for 3d hand tracking is still an open problem due to the
difficulty of acquiring ground truth data. We introduce a new dataset and
benchmarking protocol that is insensitive to the accumulative error of other
protocols. To this end, we create testing frame pairs of increasing difficulty
and measure the pose estimation error separately for each of them. This
approach gives new insights and allows to accurately study the performance of
each feature or method without employing a full tracking pipeline. Following
this protocol, we evaluate various directional distances in the context of
silhouette-based 3d hand tracking, expressed as special cases of a generalized
Chamfer distance form. An appropriate parameter setup is proposed for each of
them, and a comparative study reveals the best performing method in this
context.Comment: German Conference on Pattern Recognition (GCPR) 2013,
  http://files.is.tue.mpg.de/dtzionas/GCPR_2013.htm
Revisiting loss-specific training of filter-based MRFs for image
  restoration

It is now well known that Markov random fields (MRFs) are particularly
effective for modeling image priors in low-level vision. Recent years have seen
the emergence of two main approaches for learning the parameters in MRFs: (1)
probabilistic learning using sampling-based algorithms and (2) loss-specific
training based on MAP estimate. After investigating existing training
approaches, it turns out that the performance of the loss-specific training has
been significantly underestimated in existing work. In this paper, we revisit
this approach and use techniques from bi-level optimization to solve it. We
show that we can get a substantial gain in the final performance by solving the
lower-level problem in the bi-level framework with high accuracy using our
newly proposed algorithm. As a result, our trained model is on par with highly
specialized image denoising algorithms and clearly outperforms
probabilistically trained MRF models. Our findings suggest that for the
loss-specific training scheme, solving the lower-level problem with higher
accuracy is beneficial. Our trained model comes along with the additional
advantage, that inference is extremely efficient. Our GPU-based implementation
takes less than 1s to produce state-of-the-art performance.Comment: 10 pages, 2 figures, appear at 35th German Conference, GCPR 2013,
  Saarbr\"ucken, Germany, September 3-6, 2013. Proceeding
Subobject-oriented programming

Classes are fundamental elements in object-oriented programming, but they cannot be assembled in a truly flexible manner from other classes. As a result, cross-cutting structural code for implementing associations, graph structures, and so forth must be implemented over and over again. Subobject-oriented programming overcomes this problem by augmenting object-oriented programming with subobjects. Subobjects can be used as buildings blocks to configure and compose classes without suffering from name conflicts. This paper gives an overview of subobject-oriented programming and introduces mechanisms for subobject initialization, navigation of the subobject structure in super calls, and subobject refinement. Subobject-oriented programming has been implemented as a language extension to Java with Eclipse support and as a library in Python.status: publishe