pinecone/core-2020-05-10-deduplication huggingface dataset:
Face search in encrypted domain

Visual information of images and videos usually is encrypted for the purposes of security applications. Straightforward manipulations on the encrypted data without requiring any decryption have the advantage of speed over performing those operations in spatial, temporal, frequency or compressed domain. In this paper, we will investigate encrypted image search. More specifically, given a face image as the target object, we search it amongst encrypted images. We accomplish the search by using a novel method that extracts features and locates the face object region within the given encrypted image. We evaluate the search results by using precision and recall as well as F-measure. Our experiments reveal that there exists a trade-off between the quality of search and the quality of encryption, namely, stronger encryption leads to poorer search results
Mitigating Server Breaches in Password-Based Authentication: Secure and Efficient Solutions

International audiencePassword-Authenticated Key Exchange allows users to generate a strong cryptographic key based on a shared " human-memorable " password without requiring a public-key infrastructure. It is one of the most widely used and fundamental cryptographic primitives. Unfortunately, mass password theft from organizations is continually in the news and, even if passwords are salted and hashed, brute force breaking of password hashing is usually very successful in practice. In this paper, we propose two efficient protocols where the password database is somehow shared among two servers (or more), and authentication requires a distributed computation involving the client and the servers. In this scenario, even if a server compromise is doable, the secret exposure is not valuable to the adversary since it reveals only a share of the password database and does not permit to brute force guess a password without further interactions with the parties for each guess. Our protocols rely on smooth projective hash functions and are proven secure under classical assumption in the standard model (i.e. do not require idealized assumption, such as random oracles)
Non-Interactive Plaintext (In-)Equality Proofs and Group Signatures with Verifiable Controllable Linkability

International audienceGroup signatures are an important privacy-enhancing tool that allow to anonymously sign messages on behalf of a group. A recent feature for group signatures is controllable linkability, where a dedicated linking authority (LA) can determine whether two given signatures stem from the same signer without being able to identify the signer(s). Currently the linking authority is fully trusted, which is often not desirable. In this paper, we firstly introduce a generic technique for non-interactive zero-knowledge plaintext equality and inequality proofs. In our setting, the prover is given two ciphertexts and some trapdoor information, but neither has access to the decryption key nor the randomness used to produce the respective ciphertexts. Thus, the prover performs these proofs on unknown plaintexts. Besides a generic technique, we also propose an efficient instantiation that adapts recent results from Blazy et al. (CT-RSA'15), and in particular a combination of Groth-Sahai (GS) proofs (or sigma proofs) and smooth projective hash functions (SPHFs). While this result may be of independent interest, we use it to realize verifiable controllable linkability for group signatures. Here, the LA is required to non-interactively prove whether or not two signatures link (while it is not able to identify the signers). This significantly reduces the required trust in the linking authority. Moreover, we extend the model of group signatures to cover the feature of verifiable controllable linkability
Adjusting an older residential care facility to contemporary dementia care visions

Older residential care facilities are increasingly confronted with an incongruity between contemporary visions on dementia care and outdated infrastructure. In this context a case study analyses how the architecture of such a facility hampers or supports the implementation of its dementia care vision. Interviews, participant observation and document analysis offer nuanced insights into the interplay between care vision and architecture. The latter's limitations include its spatial organisation, lack of high-quality communal areas, authoritarian character and hospital-like atmosphere, while potential lies in using adaptable lighting, homelike materials and furniture, and small spatial interventions. These interventions can be framed within a major renovation in the long term, which would allow to realize far-reaching improvements in the ward. Since many older facilities display similar features, the case study's approach and outcome can help them in adjusting their outdated infrastructure to increase the autonomy of people with dementia and support their individuality and emancipation.status: publishe
An optimization approach for the inverse kinematics of a highly redundant robot

This paper describes a robot with 12 degrees of freedom  for pick-and-place operations using bricks. In addition, an  optimization approach is proposed, which determines the state of each joint (that establishes the pose for the robot) based on the target position while minimizing the effort of the servomotors avoiding the inverse kinematics problem, which is a hard task for a 12 DOF robot manipulator. Therefore, it is a multi-objective optimization problem that will be solved using two optimization methods: the Stretched Simulated Annealing method and the NSGA II method. 
The experiments conducted in a simulation environment prove that the proposed approach is able to determine a solution for the inverse kinematics problem. A real robot formed by several servomotors and a gripper is also presented in this research for validating the solutions.info:eu-repo/semantics/publishedVersio
An Executable Semantics of Clock Constraint Specification Language and its Applications

International audienceThe Clock Constraint Specification Language (ccsl) is a language to specify logical and timed constraints between logical clocks. Given a set of clock constraints specified in ccsl, formal analysis is preferred to check if there exists a schedule that satisfies all the constraints, if the constraints are valid or not, and if the constraints satisfy expected properties. In this paper, we present a formal executable semantics of ccsl in rewriting logic and demonstrate some applications of the formal semantics to its formal analysis: 1) to automatically find bounded or periodic schedules that satisfy all the given constraints; 2) to simulate the execution of schedules with customized simulation policies; and 3) to verify LTL properties of ccsl constraints by bounded model checking. Compared with other existing modeling approaches, advantages with the rewriting-based semantics of ccsl are that we do not need to assume a bounded number of steps for the formalization, and we can exhaustively explore all the solutions within a given bound for the analysis
Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time

International audienceA phylogenetic network is a rooted acyclic digraph whose leaves are labeled with a set of taxa. The tree containment problem is a fundamental problem arising from model validation in the study of phylogenetic networks. It asks to determine whether or not a given network displays a given phylogenetic tree over the same leaf set. It is known to be NP-complete in general. Whether or not it remains NP-complete for stable networks is an open problem. We make progress towards answering that question by presenting a quadratic time algorithm to solve the tree containment problem for a new class of networks that we call genetically stable networks, which include tree-child networks and comprise a subclass of stable networks
Filling the complexity gaps for colouring planar and bounded degree graphs.

We consider a natural restriction of the List Colouring problem, k-Regular List Colouring, which corresponds to the List Colouring problem where every list has size exactly k. We give a complete classification of the complexity of k-Regular List Colouring restricted to planar graphs, planar bipartite graphs, planar triangle-free graphs and to planar graphs with no 4-cycles and no 5-cycles. We also give a complete classification of the complexity of this problem and a number of related colouring problems for graphs with bounded maximum degree
Continuous assessment in the evolution of a CS1 course: The pass rate/workload ratio

The first programming course (Programming-1, CS1) in the Informatics Engineering Degree of the Facultat d'Informàtica de Barcelona was completely redesigned in 2006 in order to reinforce the learn-by-\ud
doing methodology. Along the following eight years several pedagogical measures - mostly related with continous assessment - were introduced with the aim of increasing the pass rate of the course without lowering its high quality standards. This paper analyzes to what extent the added workload on faculty entailed by these measures affects the pass rate. We use  a  classical  marginal  cost-benefit  approach - from  Economics -  to compare  these  two  values  along  time.  This  process  allows  us  to  relate the evolution of the pass rate of students with the workload of the faculty through a productivity curve, as well as to assess the impact of each pedagogical measure. We conclude that, for this course, continuous assessment is expensive. In fact, abstracting from short term oscillations, the slope of the productivity curve is close to zero.Peer ReviewedPostprint (author's final draft
The K Group Nearest-Neighbor Query on Non-indexed RAM-Resident Data

Data sets that are used for answering a single query only once (or just a few times) before they are replaced by new data sets appear frequently in practical applications. The cost of buiding indexes to accelerate query processing would not be repaid for such data sets. We consider an extension of the popular (K) Nearest-Neighbor Query, called the (K) Group Nearest Neighbor Query (GNNQ). This query discovers the (K) nearest neighbor(s) to a group of query points (considering the sum of distances to all the members of the query group) and has been studied during recent years, considering data sets indexed by efficient spatial data structures. We study (K) GNNQs, considering non-indexed RAM-resident data sets and present an existing algorithm adapted to such data sets and two Plane-Sweep algorithms, that apply optimizations emerging from the geometric properties of the problem. By extensive experimentation, using real and synthetic data sets, we highlight the most efficient algorithm
A transformational approach to parametric accumulated-cost static profiling

Traditional static resource analyses estimate the total resource usage of a program, without executing it. In this paper we present a novel resource analysis whose aim is instead the static profiling of accumulated cost, i.e., to discover, for selected parts of the program, an estimate or bound of the resource usage accumulated in each of those parts. Traditional resource analyses are parametric in the sense that the results can be functions on input data sizes. Our static profiling is also parametric, i.e., our accumulated cost estimates are also parameterized by input data sizes. Our proposal is based on the concept of cost centers and a program transformation that allows the static inference of functions that return bounds on these accumulated costs depending on input data sizes, for each cost center of interest. Such information is much more useful to the software developer than the traditional resource usage functions, as it allows identifying the parts of a program that should be optimized, because of their greater impact on the total cost of program executions. We also report on our implementation of the proposed technique using the CiaoPP program analysis framework, and provide some experimental results
Update in laparoscopic approach to acute mesenteric ischemia

AMI is an uncommon but serious disease often associated with a bad prognosis, associated with occlusion of Superior Mesenteric Artery (SMA) for embolism or thrombosis (67.2%), mesenteric venous thrombosis (15.7%), and non-occlusive mesenteric ischemia (15.4%). Clinical markers are often aspecific and symptoms low suggestive. The gold standard for the diagnosis is multidetector CT Angiography (CTA) with sensibility of 93.3% and specificity of 95.9%. Abdominal exploration could be useful to confirm cases of AMI without signs of SMA occlusion at CTA. Few reports have been found on the diagnostic role of Exploratory Laparoscopy. To increase the sensibility of laparoscopy in the diagnosis of AMI in the last ten years, some studies had shown the possibility of using fluorescein to underline the bowel areas of interest by ischemia. The best of laparoscopy in AMI diagnosis remains the second look and bedside use (directly in ICU when possible) overall in patients with Aortic dissection type B (preferable chronic type). In a limited number of cases, it is possible to evaluate bowel perfusion laparoscopically and at the same time perform a laparoscopical bowel resection of residual ischemic segments. However, laparoscopic primary access overall in AoD is an important tool for leading therapeutic decision and timing. Finally, laparoscopy may be a feasible alternative to CTA in patients with kidney failure that contraindicates injection of iodate CT contrast medium
Intersexuality and Trans-Identities within the Diversity Management Discourse

Within both the scientific discourse on workforce diversity, and diversity management practice, intersexuality and transgender issues have hitherto remained marginalized topics. This chapter gives an overview of the discourses on both phenomena, and proposes starting points for more inclusive organizational diversity management initiatives. It is shown that both topics represent different aspects of the category of "gender". The common practice of conceptually lumping together intersexuality, transgenderism, and sexual orientation can be seen as one important reason that intersexuality and transgenderism are rarely considered in organizational diversity management programs in terms of concrete action. Against this background, a modified, and more integrated approach to structuring the workforce alongside the different dimensions of diversity is proposed. It is shown that the categories of "biological sex and gender", "gender identity", and "sexual orientation" cannot be regarded as being separate from each other. They represent, rather, an interrelated organizational field of action that should be considered as being one interrelated topic for organizational diversity practices. This chapter derives this claim theoretically and discusses the consequences for organizational diversity management practices. For most organizations, this would mean a fundamental rethinking of their goals, in terms of workforce diversity, and the shaping of their diversity management programs
Cross-cutting Perspective Freshwater

One singularity of northwestern Europe (NWE) is that severe droughts are rare events in the region and water scarcity has hardly been experienced in its history. The DROP pilot sites are not exceptions to this context. Although the lack of a drought history in wet areas can explain why drought and water scarcity are not necessarily the focus of (if ever considered in) river basin management plans, it must be noted that freshwater availability for drinking water provision remains a priority stake in both quantitative and qualitative aspects. Providing a reliable and safe supply of drinking water may thus be a leading entryway to the development of drought risk awareness and drought adaptation measures in a river basin. When such essential resource is threatened and the competition for water among users increases, there is a good chance that reflections and changes will be triggered. Water use conflicts and drinking water supply threats may arise due to increased water demand, but also due to decreased water availability. The later may occur because of natural climate variability, i.e., drier years than average, or as the result of the impact of climate change on local water resources. Climate change awareness is then an important asset to manage water availability. Where climate change awareness is low and adaptation measures are basically inexistent, social and political responses to drought adaptation may be slow and inefficient. However, even in those cases where climate change awareness is still low in general society, water authorities and other stakeholders are conscious that water demand tends to  intensify with population and economic growth, rendering water scarcity conceivable and even foreseeable.  Freshwater availability for drinking water supply is therefore an issue that  can motivate the introduction of drought and water scarcity risks into the  political and public agenda  , even in  &amp;#8220;  drought-scarce  &amp;#8221;  regions. This chapter highlights the links between drought governance and the vulnerability of freshwater for drinking water supply, with a focus on drought adaptation. The main issues presented  here are illustrated with how freshwater issues are managed in the DROP project  cases with a particular focus on the two  &amp;#8220;  freshwater reservoir  &amp;#8221;  pilot sites: the Arzal  dam in Brittany France (see Chap.  6 ) and the Eifel-Rur in Germany (see Chap.  4 ).  Those two cases deal with reservoir management not only for drinking water supply  (Fig.  11.1 ) but also for other uses, with various priority sets
A Simple Plankton Model with Complex Behaviour

In this paper we extend the   P1P2ZN  model, introduced by Cropp and Norbury (J Plankton Res 31:939–963, 2009) to investigate the effects of specialist (or discriminate) and generalist (or indiscriminate) grazing (as parameterised by ρ) on a prey-prey-predator model for plankton, in the presence of a limiting nutrient. We also examine the influence of facultative and obligate omnivory on the survival of Z as a generalist predator, as we vary the linear mortality parameter   σZ . This leads to bifurcation transition diagrams, which also include steady state stability branches for certain critical points. For specialist grazing (ρ = 0) the bifurcation transition diagram shows steady states, periodic and chaotic dynamics, with very small windows of periodic behaviour, as   σZ  varies, while for generalist grazing (ρ = 1), we only find periodic or steady state behaviours. The dynamics is interpretable in terms of facultative/obligate omnivory of Z. Results suggest that green ocean plankton code in global climate change modelling might run more stably with generalist grazing terms and careful control of grazer mortality.Full Tex
The Kolmogorov Law of turbulence, What can rigorously be proved ? Part II

International audienceWe recall what are the different known solutions for the incompressible Navier-Stokes Equations, in order to fix a suitable functional setting for the probabilistic frame that we use to derive turbulence models, in particular to define the mean velocity and pressure fields, the Reynolds stress and eddy viscosities. Homogeneity and isotropy are discussed within this framework and we give a mathematical proof of the famous −5/3 Kolmogorov law, which is discussed in a numerical simulation performed in a numerical box with a non trivial topography on the ground
Preserving context privacy in distributed hash table wireless sensor networks

Wireless Sensor Networks (WSN) are often deployed in hostile or difficult scenarios, such as military battlefields and disaster recovery, where it is crucial for the network to be highly fault tolerant, scalable and decentralized. For this reason, peer-to-peer primitives such as Distributed Hash Table (DHT), which can greatly enhance the scalability and resilience of a network, are increasingly being introduced in the design of WSN’s. Securing the communication within the WSN is also imperative in hostile settings. In particular, context information, such as the network topology and the location and identity of base stations (which collect data gathered by the sensors and are a central point of failure) can be protected using traffic encryption and anonymous routing. In this paper, we propose a protocol achieving a modified version of onion routing over wireless sensor networks based on the DHT paradigm. The protocol prevents adversaries from learning the network topology using traffic analysis, and therefore p reserves the context privacy of the network. Furthermore, the proposed scheme is designed to minimize the computational burden and power usage of the nodes, through a novel partitioning scheme and route selection algorithm
Building national identity in newborn Kosovo: Challenges of integrating national identity with ethnic identity among Kosovar Albanians and Kosovar Serbs

On February 17th 2008, these slogans, together with the typographical sculpture “NEWBORN” , were revealed at the centre of Prishtina, marking Kosovo’s Declaration of Independence. Every year, tribute to independence is paid by having Kosovo citizens paint the letters of the monument to refl ect major events that marked the past year. On its fi rst anniversary, NEWBORN was painted on the fl ags of all countries that accepted Kosovo’s independence, thanking them for their support. However, on marking the 7th birthday in 2015, NEWBORN refl ected a very different reality, after the glow of independence had worn off: It represented newborn Kosovo in bright multi-colours, with letter E completely painted in black to symbolise the gloom of the recent “Exodus” of about 10,000 Kosovo citizens who fled to European countries in just 1 month at the beginning of 2015 (Bytyçi & Than, 2015 ). The black E was also said to be refl ective of the country’s gloomy “Economy”, one of the main reasons people seek a better life abroad. Most of the people seeking asylum from Kosovo into European countries are young, as is Kosovo’s population. Demographically, it represents the country with one of the youngest populations in Europe, with over 60 % under the age of 35 (Kosovo Agency of Statistics [KAS], 2012 ). However, despite the potential and big dreams following independence, Kosovo remains one of the poorest countries in Europe (World Bank, 2010 ). Although the country has a lot of potential, one of its major problems is that it struggles with its history and the ethnic segregation among its population. The two largest ethnic groups , an overwhelming majority of ethnic Albanians and a much smaller minority of ethnic Serbs, have a confl icting past and now have to come to terms with one another in the new country. In the current chapter we present our fi rst steps in a new research project that aims to uncover the diffi culties of creating a new national identity based on these two highly segregated ethnic groups. In so doing, we fi rst provide a short historical background of the territory and these ethnic groups to understand the particularities of the context. Then, we present a recent study into the identities of Kosovar Albanians and Kosovar Serbs with the goal of determining strategies to improve relations between them.status: publishe