pinecone/core-2020-05-10-deduplication huggingface dataset:
Entropies, volumes, and Einstein metrics

We survey the definitions and some important properties of several asymptotic
invariants of smooth manifolds, and discuss some open questions related to
them. We prove that the (non-)vanishing of the minimal volume is a
differentiable property, which is not invariant under homeomorphisms. We also
formulate an obstruction to the existence of Einstein metrics on four-manifolds
involving the volume entropy. This generalizes both the Gromov--Hitchin--Thorpe
inequality and Sambusetti's obstruction.Comment: This is a substantial revision and expansion of the 2004 preprint,
  which I prepared in spring of 2010 and which has since been published. The
  version here is essentially the published one, minus the problems introduced
  by Springer productio
A Semantic Model for Enhancing Network Services Management and Auditing

The road toward ubiquity, heterogeneity and virtualization of network services and resources urges for a formal and systematic approach to network management tasks. In particular,   the semantic characterization and modeling of services provided to users assume an essential role in fostering autonomic service management, service negotiation and auditing.
 This paper is centered on the definition of an ontology for multiservice IP networks which intends to address multiple service management goals, namely: (i) to foster client and service provider interoperability; (ii) to manage network service contracts, facilitating the dynamic negotiation between clients and ISPs; (iii) to access and query SLA/SLSs data on an individual or aggregated basis to assist service provisioning in the network; and (iv) to sustain service monitoring and auditing. In order to take full advantage of the proposed semantic model, a service model API is provided to allow service management platforms to access the ontological contents. This ontological development also takes advantage of SWRL to discover new knowledge, enriching the possibilities of systems described using this support
Groups and frequent visitors shaping the space dynamics

Our research is about a dynamic symbolic space model that
is fed with data from the environment by a set of processing modules that
receive raw data from sensor networks. For the conducted experiments
we have been using data from a WiFi network as it is a widely available
infrastructure in our campus. Here we propose two processing modules
which will provide more information about the spaces described in the
model. The first one tries to implement our human perception of the
usual visitors of a place using two measures, the long term and the short
term tenant level. The second one detects where groups of users emerge,
how many there are and what are their dimensions. Based on this new
perspective of the campus we intend to realize how the presence of people
shapes the dynamics of a space.Fundação para a Ciência e a Tecnologia (FCT
A Characterization of Mobility Management in User-centric Networks

Mobility management is a key aspect to consider in future Internet
architectures, as these architectures include a highly nomadic end-user which
often relies on services provided by multi-access networks. In contrast,
today's mobility management solutions were designed having in mind simpler
scenarios and requirements from the network and where roaming could often be
taken care of with previously established agreements. With a more dynamic
behavior in the network, and also with a more prominent role from the end-user,
mobility management has to deal with additional requirements derived from new
Internet paradigms. To assist in understanding such requirements and also how
to deal with them, this paper proposes a starting point to dismantle current
mobility management notions. Our contribution is an initial proposal on
defining mobility management in concrete functional blocks, their interaction,
as well as a potential grouping which later can assist in deriving novel and
more flexible mobility management architectures.Comment: New2AN 201
Characterising University WLANs within Eduroam Context

The eduroam initiative is assuming an ever growing relevance in providing a secure, worldwide roaming access within the university WLAN context. Although several studies have focused on educational WLAN traffic characterisation, the increasing variety of devices, mobility scenarios and user applications, motivate assessing the effective use of eduroam in order to sustain consistent network planning and deployment. Based on recent WLAN traffic traces collected at the University of Minho (Portugal) and University of Vigo (Spain), the present work contributes for identifying and characterising patterns of user behaviour regarding, for instance, the location and activity sector of users. The results of data analysis quantify the impact of network access location on the number of associated users, on the number and duration of sessions and  corresponding traffic volumes. The results also illustrate to what extent users take advantage of mobility in the WLAN. Complementing the analysis on a monthly basis, a fine grain study of WLAN traffic is provided through the identification of users' behaviour and patterns in small timescales
Hybrid Inter-Domain QoS Routing with Crankback Mechanisms

International audienceIn this paper we tackle the challenging problem of Quality of Service (QoS) routing in multiple domains. We propose a novel inter-domain QoS routing algorithm named HID-MCP. HID-MCP benefits from two major concepts that ensure high performance in terms of success rate and computational complexity. First, HID-MCP is a hybrid algorithm that combines the advantages of pre-computation and on-demand computation to obtain end-to-end QoS paths. Second, HID-MCP integrates crankback mechanisms for improving the path computation results in a single domain or in multiple domains. Extensive simulations confirm the efficiency of our algorithm on randomly generated topologies
A Cooperative Network Monitoring Overlay

This paper proposes a ﬂexible network monitoring overlay which resorts to cooperative interaction among measurement points to monitor the quality of network services. The proposed overlay model, which relies on the deﬁnition of representative measurement points, the avoidance of measurement redundancy and a simple measurement methodology as main design goals, is able to articulate intra- and inter-area measurements efﬁciently. The distributed nature of measurement control and data confers to the model the required autonomy, robustness and adaptiveness to accommodate network topology evolution, routing changes or nodes failure. In addition to these characteristics, the avoidance of explicit addressing and routing at the overlay level, and the low-overhead associated with the measurement process constitute a step forward for deploying large scale monitoring solutions. A JAVA prototype was also implemented to test the conceptual model design
Challenges in information systems procurement in the Norwegian public sector

Published version of a chapter in the book Lecture Notes in Computer Science, 6846, 404-417. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-642-22878-0_34Public procurement of information systems (IS) and IS services provides several challenges to the stakeholders involved in the procurement processes. This paper reports initial results from a Delphi study, which involved 46 experienced procurement managers, chief information officers, and vendor representatives in the Norwegian public sector. The participants identified altogether 98 challenges related to IS procurement, divided further into 13 categories: requirements specification, change management, cooperation among stakeholders, competence, competition, contracting, inter-municipal cooperation, governmental management, procurement process, rules and regulations, technology and infrastructure, vendors, and IT governance. The results contribute by supporting a few previous findings from conceptual and case-based studies, and by suggesting additional issues which deserve both further research and managerial and governmental attention. As such, the results provide altogether a rich overview of the IS procurement challenges in the Norwegian public context
eGovernment and organizational changes: towards anextended governance model

Over the last decade the diffusion of Information Technologies has represented one of the main drivers of government reform. The adoption process of such technologies has posed significant challenges for public organizations. The aim of this paper is thus to look into the process of organizational change that public agencies have undergone, in order to single out its most salient characteristics, such as understanding changes in the adoption of technologies, in organizational choices, in skill needs and in customer-public administrations relationship. On the one hand, organizations are gradually opening up their institutional boundaries in order to proactively answer to environmental changes. On the other hand, citizens play an increasing role in the context of e-Government, since their suggestions and contributions may considerably influence decisions taken by public administrations. Specifically, we attempt to answer this research question: What are e-Government organizational implications in the back office and in the interaction with citizens due to Information Technologies diffusion? Using data from a survey on 1,206 Italian public administrations, we show how organizational changes are emerging, based on the overcoming of traditional bureaucratic organizational forms. The implications of these findings are also discusse
Learning Problem Solving Skills from Demonstration: An Architectural Approach

We present an architectural approach to learning problem solving skills from demonstration, using internal models to represent problem-solving operational knowledge. Internal forward and inverse models are initially learned through active interaction with the environment, and then enhanced and finessed by observing expert teachers. While a single internal model is capable of solving a single goal-oriented task, it is their sequence that enables the system to hierarchically solve more complex task. Activation of models is goal-driven, and internal ”mental” simulations are used to predict and anticipate future rewards and perils and to make decisions accordingly. In this approach intelligent system behavior emerges as a coordinated activity of internal models over time governed by sound architectural principles. In this paper we report preliminary results using the game of Sokoban, where the aim is to learn goal-oriented patterns of model activations capable of solving the problem in various contexts
The Illusion of Internal Joy

International audienceJ. Schmidhuber proposes a "theory of fun & intrinsic motivation & creativity" that he has developed over the last two decades. This theory is precise enough to allow the programming of artificial agents exhibiting the requested behaviors. Schmidhuber's theory relies on an explicit 'internal joy drive' implemented by an 'information compression indicator'. In this paper, we show that this indicator is not necessary as soon as the 'brain' implementation involves associative memories, i.e., hierarchical cortical maps. The 'compression factor' is replaced by the 'smallest common activation pattern' in our framework, with the advantage of an immediate and plausible neural implementation. Our conclusion states that the 'internal joy' is an illusion. This remind us of the eliminative materialism position which claims that 'free-will' is also an illusion
Facial Action Unit Recognition using Filtered Local Binary Pattern Features with Bootstrapped and Weighted ECOC Classifiers

Within the context face expression classification using the facial action coding system (FACS), we address the problem of detecting facial action units (AUs). The method adopted is to train a single error-correcting output code (ECOC) multiclass classifier to estimate the probabilities that each one of several commonly occurring AU groups is present in the probe image. Platt scaling is used to calibrate the ECOC outputs to probabilities and appropriate sums of these probabilities are taken to obtain a separate probability for each AU individually. Feature extraction is performed by generating a large number of local binary pattern (LBP) features and then selecting from these using fast correlation-based filtering (FCBF). The bias and variance properties of the classifier are measured and we show that both these sources of error can be reduced by enhancing ECOC through the application of bootstrapping and class-separability weighting
Bias-variance analysis of ECOC and bagging using neural nets

One of the methods used to evaluate the performance of ensemble classifiers is bias and variance analysis. In this chapter, we analyse bootstrap aggregating (bagging) and Error Correcting Output Coding (ECOC) ensembles using a biasvariance framework; and make comparisons with single classifiers, while having Neural Networks (NNs) as base classifiers. As the performance of the ensembles depends on the individual base classifiers, it is important to understand the overall trends when the parameters of the base classifiers -nodes and epochs for NNs-, are changed.We show experimentally on 5 artificial and 4 UCI MLR datasets that there are some clear trends in the analysis that should be taken into consideration while designing NN classifier systems
Hybrid correlation and causal feature selection for ensemble classifiers

PC and TPDA algorithms are robust and well known prototype algorithms, incorporating constraint-based approaches for causal discovery. However, both algorithms cannot scale up to deal with high dimensional data, that is more than few hundred features. This chapter presents hybrid correlation and causal feature selection for ensemble classifiers to deal with this problem. Redundant features are removed by correlation-based feature selection and then irrelevant features are eliminated by causal feature selection. The number of eliminated features, accuracy, the area under the receiver operating characteristic curve (AUC) and false negative rate (FNR) of proposed algorithms are compared with correlation-based feature selection (FCBF and CFS) and causal based feature selection algorithms (PC, TPDA, GS, IAMB)
Integrating Cdk signaling in Candida albicans environmental sensing networks

El pdf del capítulo es la versión de autor.Cyclin-dependent protein kinases (Cdks) control cell cycle progression and morphological switches in eukaryotic cells. Based on recent findings concerning the evolution of Cdk phosphorylation sites in the Ascomycete linage, we shall analyze the density of Cdk motifs in the Candida proteome using the S LR algorithm, focusing on protein sequences of regulatory modules that play important roles in the environmental sensing of Candida albicans. Since Cdks are also involved in morphogenesis and environmental signaling, this search could help us to speculate about how Cdk signaling might be integrated in these regulatory networks that control C. albicans morphopathogenic determinants. © 2012 Springer-Verlag Berlin Heidelberg.This work was supported by grants from the Spanish Ministry of Science and Innovation to JCB (BFU2009-11251) and to CRV (BFU2010-15884) and the Regional Government of Extremadura (PRI08A017 and GRU09001) to JCB. The IBFG is institutionally supported by Fundación Ramón Areces.Peer Reviewe
Sparse recovery with partial support knowledge

The goal of sparse recovery is to recover the (approximately) best k-sparse approximation [ˆ over x] of an n-dimensional vector x from linear measurements Ax of x. We consider a variant of the problem which takes into account partial knowledge about the signal. In particular, we focus on the scenario where, after the measurements are taken, we are given a set S of size s that is supposed to contain most of the “large” coefficients of x. The goal is then to find [ˆ over x]  such that [ ||x-[ˆ over x]|| [subscript p] ≤ C min ||x-x'||[subscript q]. [over] k-sparse x' [over] supp (x') [c over _] S]
We refer to this formulation as the sparse recovery with partial support knowledge problem ( SRPSK  ). We show that SRPSK  can be solved, up to an approximation factor of C = 1 + ε, using O( (k/ε) log(s/k)) measurements, for p = q = 2. Moreover, this bound is tight as long as s = O(εn / log(n/ε)). This completely resolves the asymptotic measurement complexity of the problem except for a very small range of the parameter s.
To the best of our knowledge, this is the first variant of (1 + ε)-approximate sparse recovery for which the asymptotic measurement complexity has been determined.14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. ProceedingsSpace and Naval Warfare Systems Center San Diego (U.S.) (Contract N66001-11-C-4092)David & Lucile Packard Foundation (Fellowship)Center for Massive Data Algorithmics (MADALGO)National Science Foundation (U.S.) (Grant CCF-0728645)National Science Foundation (U.S.) (Grant CCF-1065125
An efficient partitioning oracle for bounded-treewidth graphs

Partitioning oracles were introduced by Hassidim et al. (FOCS 2009) as a generic tool for constant-time algorithms. For any ε > 0, a partitioning oracle provides query access to a fixed partition of the input bounded-degree minor-free graph, in which every component has size poly(1/ε), and the number of edges removed is at most εn, where n is the number of vertices in the graph.
However, the oracle of Hassidim et al. makes an exponential number of queries to the input graph to answer every query about the partition. In this paper, we construct an efficient partitioning oracle for graphs with constant treewidth. The oracle makes only O(poly(1/ε)) queries to the input graph to answer each query about the partition.
Examples of bounded-treewidth graph classes include k-outerplanar graphs for fixed k, series-parallel graphs, cactus graphs, and pseudoforests. Our oracle yields poly(1/ε)-time property testing algorithms for membership in these classes of graphs. Another application of the oracle is a poly(1/ε)-time algorithm that approximates the maximum matching size, the minimum vertex cover size, and the minimum dominating set size up to an additive εn in graphs with bounded treewidth. Finally, the oracle can be used to test in poly(1/ε) time whether the input bounded-treewidth graph is k-colorable or perfect.Simons FoundationNational Science Foundation (U.S.) (grant 0732334)National Science Foundation (U.S.) (grant 0728645
Approximating the influence of monotone boolean functions in O(√n) query complexity

The Total Influence (Average Sensitivity) of a discrete function is one of its fundamental measures. We study the problem of approximating the total influence of a monotone Boolean function f : {0, 1}[superscript n] → {0, 1}, which we denote by I[f]. We present a randomized algorithm that approximates the influence of such functions to within a multiplicative factor of (1 ±  ) by performing O([√n log n[over]I[f]] poly(1/Є ))queries. We also prove a lower bound of Ω ([√ n [over] log n·I[f]])on the query complexity of any constant-factor approximation algorithm for this problem (which holds for I[f] = Ω(1)), hence showing that our algorithm is almost optimal in terms of its dependence on n. For general functions we give a lower bound of Ω ([n [over] I[f]]), which matches the complexity of a simple sampling algorithm.Author Manuscript received 27 Jan 2011. 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. Proceeding
O(1)-approximations for maximum movement problems

We develop constant-factor approximation algorithms for minimizing the maximum movement made by pebbles on a graph to reach a configuration in which the pebbles form a connected subgraph (connectivity), or interconnect a constant number of stationary nodes (Steiner tree). These problems model the minimization of the total time required to reconfigure a robot swarm to achieve a proximity (e.g., radio) network with these connectivity properties. Our approximation factors are tight up to constant factors, as none of these problems admit a (2 − ε)-approximation assuming P ≠ NP.14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. Proceeding
Coalgebraic semantics for derivations in logic programming

Every variable-free logic program induces a Pf P f -coalgebra on the set of atomic formulae in the program. The coalgebra p sends an atomic formula A to the set of the sets of atomic formulae in the antecedent of each clause for which A is the head. In an earlier paper, we identified a variable-free logic program with a Pf P f -coalgebra on Set and showed that, if C(Pf P f ) is the cofree comonad on Pf P f , then given a logic program P qua Pf P f -coalgebra, the corresponding C(Pf P f )-coalgebra structure describes the parallel and-or derivation trees of P. In this paper, we extend that analysis to arbitrary logic programs. That requires a subtle analysis of lax natural transformations between Poset-valued functors on a Lawvere theory, of locally ordered endofunctors and comonads on locally ordered categories, and of coalgebras, oplax maps of coalgebras, and the relationships between such for locally ordered endofunctors and the cofree comonads on the
Hybridization of institutions

Extended version including all proofsModal logics are successfully used as specification logics for reactive systems. However, they are not expressive enough to refer to individual states and reason about the local behaviour of such systems. This limitation is overcome in hybrid logics which introduce special symbols for naming states in models. Actually, hybrid logics have recently regained interest, resulting in a number of new results and techniques as well as applications to software specification.
In this context, the first contribution of this paper is an attempt to ‘universalize’ the hybridization idea. Following the lines of [DS07], where a method to modalize arbitrary institutions is presented, the paper introduces a method to hybridize logics at the same institution-independent level. The method extends arbitrary institutions with Kripke semantics (for multi-modalities with arbitrary arities) and hybrid features. This paves the ground for a general result: any encoding (expressed as comorphism) from an arbitrary institution to first order logic (FOL) deter- mines a comorphism from its hybridization to FOL. This second contribution opens the possibility of effective tool support to specification languages based upon logics with hybrid features.Fundação para a Ciência e a Tecnologia (FCT