pinecone/core-2020-05-10-deduplication huggingface dataset:
'They’ve Got Their Wine Bars, We’ve Got Our Pubs’: Housing, diversity and community in two south London neighbourhoods

This chapter explores how housing policies and the nature of housing stock have conditioned residential geographies and diversity patterns in two south London neighbourhoods, Bermondsey and Camberwell. The key drivers are policy changes to social housing allocation and the post-industrial reconfiguration of urban space expressed in processes of gentrification and the redevelopment of riverside docklands into expensive housing units. These developments have challenged existing narratives of community, but they have also shifted the focus of analytical enquiry towards emerging us-them divides based on class and generation. Within the context of diversity and social cohesion, both neighbourhoods are characterized by a comparatively unproblematic day-to-day muddling along with difference, but also a generally declining level of civic engagement and neighbourhood cohesion, expressed by a sense of ‘living together apart
Cutting edge localisation in an edge profile milling head

This is a Conference paper presented by the authors at the CAiP 2015: 16th International Conference on Computer Analysis of  Images and Patterns, held in Malta from the 2 to 4 September, 2015.Wear evaluation of cutting tools is a key issue for prolonging\ud
their lifetime and ensuring high quality of products. In this paper, we\ud
present a method for the effective localisation of cutting edges of inserts\ud
in digital images of an edge profile milling head. We introduce a new\ud
image data set of 144 images of an edge milling head that contains 30\ud
inserts. We use a circular Hough transform to detect the screws that\ud
fasten the inserts. In a cropped area around a detected screw, we use\ud
Canny’s edge detection algorithm and Standard Hough Transform to\ud
localise line segments that characterise insert edges. We use this information\ud
and the geometry of the insert to identify which of these line\ud
segments is the cutting edge. The output of our algorithm is a set of\ud
quadrilateral regions around the identified cutting edges. These regions\ud
can then be used as input to other algorithms for the quality assessment\ud
of the cutting edges. Our results show that the proposed method is very\ud
effective for the localisation of the cutting edges of inserts in an edge\ud
profile milling machine.This work has been supported by DPI2012-36166 grant from the\ud
Spanish Government.peer-reviewe
Model-free head pose estimation based on shape factorisation and particle filtering

This work forms part of the project Eye-Communicate funded by the Malta Council for Science and Technology through the National Research & Innovation Programme (2012) under Research Grant No. R&I-2012-057.Head pose estimation is essential for several applications and is particularly required for head pose-free eye-gaze tracking where estimation of head rotation permits free head movement during tracking. While the literature is broad, the accuracy of recent vision-based head pose estimation methods is contingent upon the availability of training data or accurate initialisation and tracking of specific facial landmarks. In this paper, we propose a method to estimate the head pose in real time from the trajectories of a set of feature points spread randomly over the face region, without requiring a training phase or model-fitting of specific facial features. Conversely, without seeking specific facial landmarks, our method exploits the sparse 3-dimensional shape of the surface of interest, recovered via shape and motion factorisation, in combination with particle filtering to correct mistracked feature points and improve upon an initial estimation of the 3-dimensional shape during tracking. In comparison with two additional methods, quantitative results obtained through our model- and landmark-free method yield a reduction in the head pose estimation error for a wide range of head rotation angles.peer-reviewe
Fusion of intra- and inter-modality algorithms for face-sketch recognition

Identifying and apprehending suspects by matching sketches created from eyewitness and victim descriptions to mugshot photos is a slow process since law enforcement agencies lack automated methods to perform this task. This paper attempts to tackle this problem by combining Eigentransformation, a global intra-modality approach, with the Eigenpatches local intra-modality technique. These algorithms are then fused with an inter-modality method called Histogram of Averaged Orientation Gradients (HAOG). Simulation results reveal that the intra- and inter- modality algorithms considered in this work provide complementary information since not only does fusion of the global and local intra-modality methods yield better performance than either of the algorithms individually, but fusion with the inter-modality approach yields further improvement to achieve retrieval rates of 94.05% at Rank-100 on 420 photo-sketch pairs. This performance is achieved at Rank-25 when filtering of the gallery using demographic information is carried out.peer-reviewe
Analysis of approaches to Internet traffic generation for cyber security research and excercise

Because of the severe global security threat of malwares, vulnerabilities and attacks against networked systems cyber-security research, training and exercises are required for achieving cyber resilience of organizations. Especially requirement for organizing cyber security exercises has become more and more relevant for companies or government agencies. Cyber security research, training and exercise require closed Internet like environment and generated Internet traffic. JAMK University of Applied Sciences has built a closed Internet-like network called Realistic Global Cyber Environment (RGCE). The traffic generation software for the RGCE is introduced in this paper. This paper describes different approaches and use cases to Internet traffic generation. Specific software for traffic generation is created, to which no existing traffic generation solutions were suitable
Implementation of multidimensional databases in column-oriented NoSQL systems

NoSQL (Not Only SQL) systems are becoming popular due to  known advantages such as horizontal scalability and elasticity. In this paper, we  study the implementation of multidimensional data warehouses with columnoriented  NoSQL systems. We define mapping rules that transform the conceptual  multidimensional data model to logical column-oriented models. We consider  three different logical models and we use them to instantiate data warehouses.  We focus on data loading, model-to-model conversion and OLAP cuboid  computation
A framework for building OLAP cubes on graphs

Graphs are widespread structures providing a powerful abstraction for modeling networked data. Large and complex graphs have emerged in various domains such as social networks, bioinformatics, and chemical data. However, current warehousing frameworks are not equipped to handle efficiently the multidimensional modeling and analysis of complex graph data. In this paper, we propose a novel framework for building OLAP cubes from graph data and analyzing the graph topological properties. The framework supports the extraction and design of the candidate multidimensional spaces in property graphs. Besides property graphs, a new database model tailored for multidimensional modeling and enabling the exploration of additional candidate multidimensional spaces is introduced. We present novel techniques for OLAP aggregation of the graph, and discuss the case of dimension hierarchies in graphs. Furthermore, the architecture and the implementation of our graph warehousing framework are presented and show the effectiveness of our approach.Peer ReviewedPostprint (author's final draft
Strong Authentication for Web services with Mobile Universal Identity

To access services on the Web, users need quite often to have accounts, i.e. user names and passwords. This becomes a problem when the number of accounts keeps increasing at the same time password is a very weak form of authentication exposing the users to fraud and abuses. To address both mentioned issues we propose a Mobile Universal identity, which by combining Internet identifiers with mobile identifiers is capable of delivering strong authentication for Internet services. By introducing an identity provider, the solution enables the user to employ the Mobile Universal identity for multiple service providers. By federation with other identities, Mobile Universal identity can be used with service providers worldwide.© Springer International Publishing Switzerland 2015. This is the authors' accepted and refereed manuscript to the article. Locked until 2016-08-08
Sustaining cocoa production on oxisols in Malaysia

Oxisols are dominated by variable charge minerals in their clay fraction, containing an insufficient amount of Ca and Mg in their soil solutions. Under natural conditions, cocoa grown on the soils is subjected to the stress of low pH and Al and/or Mn toxicity, which eventually produces low yields. This chapter discusses the chemical properties of Oxisols in Malaysia and explains how the productivity of  the soils is enhanced using lime or basalt, which increases soil pH. When the pH goes up above 5, Al in the soil solutions is precipitated as inert Al-hydroxides, with the concomitant elimination of toxic Mn. The increase in pH would result in the increase of the CEC, attributed to the reaction of the variable charge minerals present in the soils. Basalt application would also lower pH of the soils, which further increases the CEC. On dissolution, lime supplies Ca and Mg into the soils, and basalt not only releases these metals, but also K, P, and S. Ca, by itself, is able to reduce Al toxicity. One of the best methods of alleviating the infertility of Oxisols \ud
for cocoa cultivation is to apply basalt in combination with organic materials.  Growing cocoa on Oxisols requires heavy application of NPK fertilizers, usually in the form of ammonium sulfate, rock phosphate, and muriate of potash, respectively. Occasionally, kieserite is applied to increase Mg reserve in the soils. Application of a high amount of N fertilizer will in the end acidify the soils, but it will be offset by the production of hydroxyl ions due to the specific adsorption of phosphate and sulfate ions on the surfaces of the oxides of Fe present in the soils. In that way, the production of cocoa on the Oxisols of Malaysia is sustained.\ud
\ud
\ud
\ud
\u
Network-on-Chip Firewall: Countering Defective and Malicious
  System-on-Chip Hardware

Mobile devices are in roles where the integrity and confidentiality of their
apps and data are of paramount importance. They usually contain a
System-on-Chip (SoC), which integrates microprocessors and peripheral
Intellectual Property (IP) connected by a Network-on-Chip (NoC). Malicious IP
or software could compromise critical data. Some types of attacks can be
blocked by controlling data transfers on the NoC using Memory Management Units
(MMUs) and other access control mechanisms. However, commodity processors do
not provide strong assurances regarding the correctness of such mechanisms, and
it is challenging to verify that all access control mechanisms in the system
are correctly configured. We propose a NoC Firewall (NoCF) that provides a
single locus of control and is amenable to formal analysis. We demonstrate an
initial analysis of its ability to resist malformed NoC commands, which we
believe is the first effort to detect vulnerabilities that arise from NoC
protocol violations perpetrated by erroneous or malicious IP.Comment: 33 pages, 6 figure
Satisfiability of constraint specifications on XML documents

Jose Meseguer is one of the earliest contributors in the area of Algebraic Specification. In this paper, which we are happy to dedicate to him on the occasion of his 65th birthday, we use ideas and methods coming from that area with the aim of presenting an approach for the specification of the structure of classes of XML documents and for reasoning about them. More precisely, we specify the structure of documents using sets of constraints that are based on XPath and we present inference rules that are shown to define a sound and complete refutation procedure for checking satisfiability of a given specification using tableaux.Peer ReviewedPostprint (author's final draft
Debits and Credits in Petri Nets and Linear Logic

Exchanging resources often involves situations where a participant gives a resource without obtaining immediately the expected reward. For instance, one can buy an item without paying it in advance, but contracting a debt which must be eventually honoured. Resources, credits and debits can be represented, either implicitly or explicitly, in several formal models, among which Petri nets and linear logic. In this paper we study the relations between two of these models, namely intuitionistic linear logic with mix and Debit Petri nets. In particular, we establish a natural correspondence between provability in the logic, and marking reachability in nets
On First-Order Model-Based Reasoning

Reasoning semantically in first-order logic is notoriously a challenge. This
paper surveys a selection of semantically-guided or model-based methods that
aim at meeting aspects of this challenge. For first-order logic we touch upon
resolution-based methods, tableaux-based methods, DPLL-inspired methods, and we
give a preview of a new method called SGGS, for Semantically-Guided
Goal-Sensitive reasoning. For first-order theories we highlight hierarchical
and locality-based methods, concluding with the recent Model-Constructing
satisfiability calculus.Comment: In Narciso Marti-Oliet, Peter Olveczky, and Carolyn Talcott (Eds.),
  "Logic, Rewriting, and Concurrency: Essays in Honor of Jose Meseguer"
  Springer, Lecture Notes in Computer Science 9200, September 2015, 24 page
A Homologically Persistent Skeleton is a fast and robust descriptor of interest points in 2D images.

2D images often contain irregular salient features and interest points with non-integer coordinates. Our skeletonization problem for such a noisy sparse cloud is to summarize the topology of a given 2D cloud across all scales in the form of a graph, which can be used for combining local features into a more powerful object-wide descriptor.\ud
\ud
We extend a classical Minimum Spanning Tree of a cloud to a Homologically Persistent Skeleton, which is scale-and-rotation invariant and depends only on the cloud without extra parameters. This graph\ud
\ud
(1) \ud
is computable in time O(nlogn)  for any n points in the plane;\ud
\ud
(2) \ud
has the minimum total length among all graphs that span a 2D cloud at any scale and also have most persistent 1-dimensional cycles;\ud
\ud
(3) \ud
is geometrically stable for noisy samples around planar graphs
A case study on the influence of the user profile enrichment on buzz propagation in social media: Experiments on Delicious

The user is the main contributor for creating information in social media. In these media, users are influenced by the information shared through thenetwork. In a social context, there are so-called “buzz”, which is a technique to make noise around an event. This technique engenders that several users will be interested in this event at a time t. A buzz is then popular information in a specific time. A buzz may be a fact (true information) or a rumour (fake, false information). We are interested in studying buzz propagation through time in the social network Delicious. Also, we study the influence of enriched user profilesthat we proposed [2] to propagate the buzz in the same social network. In this paper, we state a case study on some information of the social network Delicious. This latter contains social annotations (tags) provided by users. These tags contribute to influence the other users to follow this information or to use it. This study relies onthree main axes: 1) we focus on tags considered as buzz and analyse their propagation through time 2) we consider a user profile as the set of tags provided by him. We will use the result of our previous work on dynamic user profile enrichment in order to analyse the influence of this enrichment in the buzz propagation. 3) we analyse each enriched user profile in order to show if the enrichment approach anticipate the buzz propagation. So, we can see the interest of filtering the information in order to avoid potential rumours and then, to propose relevant results to the user (e.g. avoid “bad” recommendation)
OLAP4Tweets: Multidimensional Modeling of tweets

Twitter, a popular microblogging platform, is at the epicenter of the social media explosion, with millions of users being able to create and publish short posts, referred to as tweets, in real time. The application of the OLAP (On-Line Analytical Processing) on large volumes of tweets is a challenge that would allow the extraction of information (especially knowledge) such as user behavior, new emerging issues, trends… In this paper, we pursue a goal of providing a generic multidimensional model dedicated to the OLAP of tweets. The proposed model reflects on some specifics such as recursive references between tweets and calculated attributes
Conflict Ordering Search for Scheduling Problems

We introduce a new generic scheme to guide backtrack search, called Conflict Ordering Search (COS), that reorders variables on the basis of conflicts that happen during search. Similarly to generalized Last Conflict (LC), our approach remembers the last variables on which search decisions failed. Importantly, the initial ordering behind COS is given by a specified variable ordering heuristic, but contrary to LC, once consumed, this first ordering is forgotten, which makes COS conflict-driven. Our preliminary experiments show that COS – although simple to implement and parameter-free – is competitive with specialized searches on scheduling problems. We also show that our approach fits well within a restart framework, and can be enhanced with a value ordering heuristic that selects in priority the last assigned values
Simple and Scalable Time-Table Filtering for the Cumulative Constraint

Cumulative is an essential constraint in the CP framework, and is present in scheduling and packing applications. The lightest filtering for the cumulative constraint is time-tabling. It has been improved several times over the last decade. The best known theoretical time complexity for time-table is O(nlogn) introduced by Ouellet and Quimper. We show a new algorithm able to run in O(n), by relying on range min query algorithms. This approach is more of theoretical rather than practical interest, because of the generally larger number of iterations needed to reach the fixed point. On the practical side, the recent synchronized sweep algorithm of Letort et al, with a time-complexity of O(n^2), requires fewer iterations to reach the fix-point and is considered as the most scalable approach. Unfortunately this algorithm is not trivial to implement. In this work we present a O(n^2) simple two step alternative approach: first building the mandatory profile, then updating all the bounds of the activities. Our experimental results show that our algorithm outperforms synchronized sweep and the time-tabling implementations of other open-source solvers on large scale scheduling instances, sometimes significantly
Automatically improving SAT encoding of constraint problems through common subexpression elimination in Savile Row

The formulation of a Propositional Satisfiability (SAT) problem instance is vital to efficient solving. This has motivated research on preprocessing, and inprocessing techniques where reformulation of a SAT instance is interleaved with solving. Preprocessing and inprocessing are highly effective in extending the reach of SAT solvers, however they necessarily operate on the lowest level representation of the problem, the raw SAT clauses, where higher-level patterns are difficult and/or costly to identify. Our approach is different: rather than reformulate the SAT representation directly, we apply automated reformulations to a higher level representation (a constraint model) of the original problem. Common Subexpression Elimination (CSE) is a family of techniques to improve automatically the formulation of constraint satisfaction problems, which are often highly beneficial when using a conventional constraint solver. In this work we demonstrate that CSE has similar benefits when the reformulated constraint model is encoded to SAT and solved using a state-of-the-art SAT solver. In some cases we observe speed improvements of over 100 times.Postprin
MiniSearch: a solver-independent meta-search language for MiniZinc

Much of the power of CP comes from the ability to create
complex hybrid search algorithms specific to an application. Unfortu-
nately there is no widely accepted standard for specifying search, and
each solver typically requires detailed knowledge in order to build com-
plex searches. This makes the barrier to entry for exploring different
search methods quite high. Furthermore, search is a core part of the
solver and usually highly optimised. Any imposition on the solver writer
to change this part of their system is significant.
In this paper we investigate how powerful we can make a uniform lan-
guage for meta-search without placing any burden on the solver writer.
The key to this is to only interact with the solver when a solution is found.
We present MiniSearch, a meta-search language that can directly use
any FlatZinc solver. Optionally, it can interact with solvers through an
efficient C++ API. We illustrate the expressiveness of the language and
performance using different solvers on a number of examples.status: publishe
Hybridization of Interval CP and Evolutionary Algorithms for Optimizing
  Difficult Problems

The only rigorous approaches for achieving a numerical proof of optimality in
global optimization are interval-based methods that interleave branching of the
search-space and pruning of the subdomains that cannot contain an optimal
solution. State-of-the-art solvers generally integrate local optimization
algorithms to compute a good upper bound of the global minimum over each
subspace. In this document, we propose a cooperative framework in which
interval methods cooperate with evolutionary algorithms. The latter are
stochastic algorithms in which a population of candidate solutions iteratively
evolves in the search-space to reach satisfactory solutions.
  Within our cooperative solver Charibde, the evolutionary algorithm and the
interval-based algorithm run in parallel and exchange bounds, solutions and
search-space in an advanced manner via message passing. A comparison of
Charibde with state-of-the-art interval-based solvers (GlobSol, IBBA, Ibex) and
NLP solvers (Couenne, BARON) on a benchmark of difficult COCONUT problems shows
that Charibde is highly competitive against non-rigorous solvers and converges
faster than rigorous solvers by an order of magnitude.Comment: 21st International Conference on Principles and Practice of
  Constraint Programming (CP 2015), 201