Miracle-dz/UniFAR-FTUs huggingface dataset:
Constraint-Based Inference in Probabilistic Logic Programs

A wide variety of models that combine logical and statistical knowledge can be expressed succinctly in the Probabilistic Logic Programming (PLP) paradigm. Specifically, models in standard statistical formalisms such as probabilistic graphical models (PGMs) (e.g. Bayesian Networks), can be easily encoded as PLP programs. For instance, Fig. 1(a) shows a program in PRISM, a pioneering PLP language [16]. A widget, represented by a random variable X, is tested by two different processes b1 and b2. The outcomes of these tests are represented by random variables Y and Z, respectively. In PRISM, a special predicate of the form msw(a,X) associates random variable X with a random process a. Consider the problem of determining the distribution of X given that Y and Z are identical. Note that evidence is defined as a constraint over instantiations of the random variables, in contrast to a specific instantiation as in traditional PGMs. However, such evidence can be easily specified in PLP (see predicate e/0). The probability of a specific instantiation of X can also be computed based on a PLP query (e.g. q(1) using predicate q/1). This simple example illustrates how logical clauses can be used to specify evidence and queries in PLP that go beyond what is possible in traditional PGMs.
A brief Survey: Current Trends in Cyber Security and the its challenges in India

— Cyber Security plays an important role in IT growth, as well as Internet services. Generally, our attention is drawn to "cyber security" when we hear about "cyber-crimes. " So our first thinking on "National Cyber Security" starts on how effective our "Cyber Crimes" handling system is [1]. This paper recognition on cyber safety emerging trends even as adopting new technology such as mobile computing, cloud computing, e-commerce, and social networking. The paper also describes the challenges because of loss of coordination among Security agencies and the Critical IT Infrastructure.
Adaptive Multicast of Multi-Layered Video : Rate-Based and Credit-Based Approaches *

is the highest rate that both paths can support. However, in a multicast connection with hundreds or even thousands of destinations, there is likely to be at least one very congested path. Limiting the video rate according to the most congested path penalizes the quality of video offered across all the other paths, regardless of how much bandwidth is available on them. A more scalable solution to the problem of available band-width variation is to use multi-layered video. A multi-layered video encoder encodes raw video data into one or more streams, or layers, of differing priority. The layer with the highest priority, called the base layer, contains the most important portions of the video stream. One or more enhancement layers with progressively lower priorities may then be encoded to further refine the quality of the base layer stream. For instance, in the example of Figure 1, the ideal deployment of multi-layered video results in a base layer stream transmitted at 4 Mbps and a single enhancement layer stream transmitted at 6 Mbps. There are two primary advantages to using multi-layered video encoding in multicast-capable networks. First is the ability to perform graceful degradation of video quality when loss occurs. Because each video layer is prioritized, a network experiencing congestion may discard packets from low priority layers, thereby protecting the important base layer and higher priority enhancement layers from corruption. The second advantage, which is related to the first, is the ability to support multiple destinations with different bandwidth constraints or end-system capabilities. For each source-to-destination path with a unique bandwidth constraint, an enhancement layer of video may be generated. Multi-layered video is not by itself sufficient to provide ideal network bandwidth utilization or video quality, however. To improve the bandwidth utilization of the network and optimize the quality of video received by each of the destinations, the source must respond to constantly changing network conditions by dynamically adjusting the number of video layers it generates as well as the rate at which each layer is transmitted. For the source to do this, it must have congestion feedback from the destinations and the network. In this paper, we study two novel and promising feedback mechanisms, both of which rely on adaptive, multi-layered video encoding. The first is a rate-based mechanism that uses a closed Figure 1: Example multicast video session. Abstract Network architectures that can efficiently transport high quality, multicast video …
L G ] 5 M ar 2 01 6 Fundamental Differences Between Dropout and Weight Decay in Deep Networks

We study dropout and weight decay applied to deep networks wi th rectified linear units and the quadratic loss. We show how using dropout in this context can be viewed as addi ng a regularization penalty term that grows exponentially with the depth of the network when t he more traditional weight decay penalty grows polynomially. We then show how this difference affect s the inductive bias of algorithms using one regularizer or the other: we describe a random source of data th dropout is unwilling to fit, but that is compatible with the inductive bias of weight decay. We also d escribe a source that is compatible with the inductive bias of dropout, but not weight decay. We also show that, in contrast with the case of generalized li near models, when used with deep networks with rectified linear units and the quadratic loss, the regularization penalty of dropout (a) is not just a function of the independent variables, but also depen ds o the response variables, and (b) can be negative. Finally, the dropout penalty can drive a learning algorithm to use negative weights even when trained with monotone training data.
The influence of postharvest conditioning and storage protocols on the incidence of rots in White Yams (Dioscorea rotundata Poir.) in Ghana

The post-harvest conditioning of root and tuber crops (such as potatoes and cassava) by exposure to elevated temperature and humidity (‘curing’) has long been used to extend their storage life. The use of this strategy on yams is not, however, well documented and appears not to be practised with any consistent conviction in West Africa. During the period 2000 to 2003, a series of on-farm trials was conducted on White Yams (Dioscorea rotundata Poir.) in Ghana to assess whether curing and other related protocols could be exploited. The factors investigated included the impact of yam variety, tuber maturity (immature ‘milk’ yams and physiologically mature ‘ware’ yams), different curing environments (plastic bags, clamps or modified storage rooms) and subsequent storage in different structures (pits or barns). Interactions were observed between the conditioning treatments and varieties, and the different storage structures had a significant impact on yam weight loss, sprouting and the incidence and prevalence of rots. Overall ‘milk’ yams were more prone to deterioration than ‘ware’ yams and, irrespective of the possible benefits of curing, were much better conserved in traditional pits than in barns. Irrespective of treatment, rots were more often associated with the upper sections of the tubers, suggesting a link with pre-harvest insect damage and harvest cuts at the site of the vine. It was determined that the levels of relative humidity in pits, clamps and modified storage rooms could engender curing, whereas the humidity in plastic bags was excessive and simply brought about rapid rotting. Achieving the correct temperature for curing was problematic. Ambient temperatures (high 20°C) proved sub-optimal whereas temperatures above 37°C were too high. These field trials suggest, however, that the conditions necessary to cure yams can be established in rural communities with limited resources.
The Restricted Isometry Property for the General p-Norms

The Restricted Isometry Property (RIP) is a fundamental property of a matrix which enables sparse recovery. Informally, an $m \times n$ matrix satisfies RIP of order $k$ for the $\ell_p$ norm, if $\|Ax\|_p \approx \|x\|_p$ for every vector $x$ with at most $k$ non-zero coordinates. For every $1 \leq p<\infty$ we obtain almost tight bounds on the minimum number of rows $m$ necessary for the RIP property to hold. Prior to this work, only the cases $p = 1$, $1 + 1 / \log k$, and $2$ were studied. Interestingly, our results show that the case $p = 2$ is a"singularity"point: the optimal number of rows $m$ is $\widetilde{\Theta}(k^{p})$ for all $p\in [1,\infty)\setminus \{2\}$, as opposed to $\widetilde{\Theta}(k)$ for $k=2$. We also obtain almost tight bounds for the column sparsity of RIP matrices and discuss implications of our results for the Stable Sparse Recovery problem.
Synchronized clusters in coupled map networks: Stability analysis

We study self-organized (s-) and driven (d-) synchronization in coupled map networks for some simple networks, namely two and three node networks and their natural generalization to globally coupled and complete bipartite networks. We use both linear stability analysis and Lyapunov function approach for this study and determine stability conditions for synchronization. We see that most of the features of coupled dynamics of small networks with two or three nodes, are carried over to the larger networks of the same type. The phase diagrams for the networks studied here have features very similar to the different kinds of networks studied in Ref. \cite{sarika-REA2}. The analysis of the dynamics of the difference variable corresponding to any two nodes shows that when the two nodes are in driven synchronization, all the coupling terms cancel out whereas when they are in self-organized synchronization, the direct coupling term between the two nodes adds an extra decay term while the other couplings cancel out.
(k, j)-coloring of sparse graphs

A graphG is called improperly (d1, . . . , dk)-colorable, or just (d1, . . . , dk)-colorable, if the vertex set ofG can be partitioned into subsets V1, . , Vk such that the graph G[Vi] induced by the vertices ofVi has maximum degree at most di for all 1 ≤ i ≤ k. This notion generalizes those of properk-coloring (whend1 = . . . = dk = 0) andd-improperk-coloring (whend1 = . . . = dk = d ≥ 1). Proper andd-improper colorings have been widely studied. As shown by Ap pel and Haken [1, 2], every planar graph is 4-colorable, i.e. (0, 0, 0, 0)-colorable. Eaton and Hull [4] and independently Škrekovski [5] proved that every planar grap h is 2-improperly 3-colorable (in fact, 2-improper 3-choosable), i.e. (2, 2, 2)-colorable. In this talk, we will focus on(k, j)-colorability of sparse graphs (in the meaning of small maxi mum average degree). We recall that the maximum average degree of a graphG, writtenmad(G), is the largest average degree among the subgraphs of G:
Optimality and approximate optimality of source-channel separation in networks

We consider the optimality of source-channel separation in networks, and show that such a separation approach is optimal or approximately optimal for a large class of scenarios. More precisely, for lossy coding of memoryless sources in a network, when the sources are mutually independent, and each source is needed only at one destination (or at multiple destinations at the same distortion level), the separation approach is optimal; for the same setting but each source is needed at multiple destinations under a restricted class of distortion measures, the separation approach is approximately optimal, in the sense that the loss from optimum can be upper-bounded. The communication channels in the network are general, including various multiuser channels with finite memory and feedback, the sources and channels can have different bandwidths, and the sources can be present at multiple nodes.
Untangling Fine-Grained Code Changes

—After working for some time, developers commit their code changes to a version control system. When doing so, they often bundle unrelated changes ( e.g., bug ﬁx and refactoring) in a single commit, thus creating a so-called tangled commit. Sharing tangled commits is problematic because it makes review, reversion, and integration of these commits harder and historical analyses of the project less reliable. Researchers have worked at untangling existing commits, i.e., ﬁnding which part of a commit relates to which task. In this paper, we contribute to this line of work in two ways: (1) A publicly available dataset of untangled code changes, created with the help of two developers who accurately split their code changes into self contained tasks over a period of four months; (2) a novel approach, EpiceaUntangler , to help developers share untangled commits (aka. atomic commits) by using ﬁne-grained code change information. EpiceaUntangler is based and tested on the publicly available dataset, and further evaluated by deploying it to 7 developers, who used it for 2 weeks. We recorded a median success rate of 91% and average one of 75%, in automatically creating clusters of untangled ﬁne-grained code changes.
THE FACT THAT COMPETITIVE STRATEGIES CAN RESULT IN SIGNIFICANT DEGRADATION DUE TO THE PRISONER ’ S DILEMMA HAS BEEN CALLED THE PRICE OF ANARCHY

T he success of unlicensed broadband communication has led to very rapid deployment of communication networks that work independently of each other using a relatively narrow spectrum. For example, the 802.11g standard uses the industrial, scientific, and medical (ISM) band that has a total bandwidth of 80 MHz. This band is divided into 12 partially overlapping bands of 20 MHz. These technologies could become the victims of their own success, since the relatively small number of channels and the massive use of the technology in densely populated metropolitan areas can cause significant mutual interference. This is especially important for high quality real-time distribution of multimedia content that is intolerant to errors as well as latency. Existing 802.11 [wireless fidelity (WiFi)] networks have very limited means to coordinate spectrum with other interfering systems. It would be highly desirable to reduce the interference environment, for instance by distributed spectral coordination between different access points. Another option is centralized access points such as 802.16 [worldwide interoperability for microwave access (WiMax)], where resources are allocated centrally by a single base station. Advanced digital subscriber line (DSL) systems such as ADSL2 and VDSL are facing a similar situation. These systems are currently limited by crosstalk between lines. As such, the DSL environment is another example of a frequency selective interference channel. While the need to operate over interference limited frequency selective channels is clear in many of the current and future communication technologies, the theoretical situation is much less satisfying. The capacity region of the interference channel is still open (see [1] for a short overview) even for the fixed channel two-user case. Recently, major advances in understanding the situation for flat channels under weak interference have been made. It can be shown that [ A practical and theoretic point of view ] in this case, treating the interference as noise leads to a virtually optimal solution. On the other hand, for medium-strength interference as is typical in the wireless environment, the simplest strategy is to use orthogonal signaling, e.g., time division multiple access/frequency division multiple access (TDMA/ FDMA) for high spectral efficiency networks, or code division multiple access (CDMA) for very strong interference with low spectral efficiency per user. Moreover, sequential cancellation techniques that are required for the best-known capacity region in the medium-interference case [2] are only practical for small numbers of interferers. The interference channel can be seen as a conflict situation, …
A Simple Algorithm for Semi-supervised Learning with Improved Generalization Error Bound

i 6=j (γ∗ i − αi)(γ j − αj)Ex [φi(x)φj(x)] = ‖γ∗ − α‖2 Second, since γ∗ is the optimal solution to L(γ), we have L(α) ≥ L(γ∗) + (α − γ∗)ZZ>(αs − γ∗) Since 0 ≤ L(γ∗) ≤ L(α), we have (α − γ∗)ZZ>(αs − γ∗) ≤ L(α). Then ‖γ∗ − α‖2 ≤ L(α)/λmin(ZZ). Third, since L(α)/n is the empirical regression error of gs(x), by the Talagrand inequality (Koltchinskii, 2011) and Lemma 1, we have , with a probability at least 1 − N−3, L(α)/n ≤ η. We complete the proof by combining the above results.
Server B Server C Transaction ? Ack Server D 2 Phase Commit Tx ? ACK ! Commit ? ACK ! Phase 1 Tx ? ACK Phase 2 Commit ? ACK Storage Stack Database

Storage systems in data centers are an important component of large-scale online services. They typically perform replicated transactional operations for high data availability and integrity. Today, however, such operations suffer from high tail latency even with recent kernel bypass and storage optimizations, and thus affect the predictability of end-to-end performance of these services.We observe that the root cause of the problem is the involvement of the CPU, a precious commodity in multi-tenant settings, in the critical path of replicated transactions. In this paper, we presentHyperLoop, a new framework that removes CPU from the critical path of replicated transactions in storage systems by offloading them to commodity RDMA NICs, with non-volatile memory as the storage medium. To achieve this, we develop new and general NIC offloading primitives that can perform memory operations on all nodes in a replication group while guaranteeing ACID properties without CPU involvement. We demonstrate that popular storage applications can be easily optimized using our primitives. Our evaluation results with microbenchmarks and application benchmarks show that HyperLoop can reduce 99th percentile latency ≈ 800× with close to 0% CPU consumption on replicas. ∗The first two authors contributed equally to this work. †The author is now in Alibaba Group. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org. SIGCOMM ’18, August 20–25, 2018, Budapest, Hungary © 2018 Copyright held by the owner/author(s). Publication rights licensed to ACM. ACM ISBN 978-1-4503-5567-4/18/08. $15.00 https://doi.org/10.1145/3230543.3230572 CCS CONCEPTS •Networks→Data center networks; • Information systems→Remote replication; •Computer systems organization → Cloud computing;
Facial Expressions Tracking and Recognition : Database Protocols for Systems Validation and Evaluation

Each human face is unique. It has its own shape, topology, and distinguishing features. As such, developing and testing facial tracking systems are challenging tasks. The existing face recognition and tracking algorithms in Computer Vision mainly specify concrete situations according to particular goals and applications, requiring validation methodologies with data that fits their purposes. However, a database that covers all possible variations of external and factors does not exist, increasing researchers’ work in acquiring their own data or compiling groups of databases. To address this shortcoming, we propose a methodology for facial data acquisition through definition of fundamental variables, such as subject characteristics, acquisition hardware, and performance parameters. Following this methodology, we also propose two protocols that allow the capturing of facial behaviors under uncontrolled and real-life situations. As validation, we executed both protocols which lead to creation of two sample databases: FdMiee (Facial database with Multi input, expressions, and environments) and FACIA (Facial Multimodal database driven by emotional induced acting). Using different types of hardware, FdMiee captures facial information under environmental and facial behaviors variations. FACIA is an extension of FdMiee introducing a pipeline to acquire additional facial behaviors and speech using an emotion-acting method. Therefore, this work eases the creation of adaptable database according to algorithm’s requirements and applications, leading to simplified validation and testing processes.
María no abofeteó a la bruja verde Maria did not slap the green witch

Open domain relation extraction systems identify relation and argument phrases in a sentence without relying on any underlying schema. However, current state-of-the-art relation extraction systems are available only for English because of their heavy reliance on linguistic tools such as part-of-speech taggers and dependency parsers. We present a cross-lingual annotation projection method for language independent relation extraction. We evaluate our method on a manually annotated test set and present results on three typologically different languages. We release these manual annotations and extracted relations in ten languages from Wikipedia.
When Being Soft Makes You Tough: A Collision Resilient Quadcopter Inspired by Arthropod Exoskeletons

Flying robots are usually rather delicate, and require protective enclosures when facing the risk of collision. High complexity and reduced payload are recurrent problems with collision-tolerant flying robots. Inspired by arthropods’ exoskeletons, we design a simple, easily manufactured, semi-rigid structure with flexible joints that can withstand high-velocity impacts. With an exoskeleton, the protective shell becomes part of the main robot structure, thereby minimizing its loss in payload capacity. Our design is simple to build and customize using cheap components and consumer-grade 3D printers. Our results show we can build a sub-250 g, autonomous quadcopter with visual navigation that can survive multiple collisions at speeds up to 7m s−1 that is also suitable for automated battery swapping, and with enough computing power to run deep neural network models. This structure makes for an ideal platform for highrisk activities (such as flying in a cluttered environment or reinforcement learning training) without damage to the hardware or the environment.
Managing Change in Graph-structured Data Using Description Logics (long version with appendix)

In this paper, we consider the setting of graph-structured data that evolves as a result of operations carried out by users or applications. We study different reasoning problems, which range from ensuring the satisfaction of a given set of integrity constraints after a given sequence of updates, to deciding the (non-)existence of a sequence of actions that would take the data to an (un)desirable state, starting either from a specific data instance or from an incomplete description of it. We consider an action language in which actions are finite sequences of conditional insertions and deletions of nodes and labels, and use Description Logics for describing integrity constraints and (partial) states of the data. We then formalize the above data management problems as a static verification problem and several planning problems. We provide algorithms and tight complexity bounds for the formalized problems, both for an expressive DL and for a variant of DL-Lite.