Latest YouTube Video
Saturday, March 11, 2017
I have a new follower on Twitter
Pulseway
Making IT heroes. #RMMsoftware
Dublin, Ireland
http://t.co/QaKeoEgsBq
Following: 1475 - Followers: 4789
March 11, 2017 at 08:49PM via Twitter http://twitter.com/pulsewayapp
I have a new follower on Twitter
Rosie Cleveland
Are you active on Twitter? Do you want get more Twitter followers? Click here https://t.co/bIytZO3XJx
USA
Following: 2766 - Followers: 38
March 11, 2017 at 11:54AM via Twitter http://twitter.com/naotatsufukunag
Get 8-Course Online Hacking Training Package For Just $39
from The Hacker News http://ift.tt/2mdvQsQ
via IFTTT
I have a new follower on Twitter
nativeMsg
A conversation and bot messaging platform reaching your customer where they communicate.
Chicago, IL
https://t.co/8RZYbkyXpX
Following: 3928 - Followers: 1244
March 11, 2017 at 07:14AM via Twitter http://twitter.com/TheNativeMsg
Beware! Pre-Installed Android Malware Found On 36 High-end Smartphones
from The Hacker News http://ift.tt/2mbhdWg
via IFTTT
Friday, March 10, 2017
WBC Highlight: Adam Jones delivers walk-off single in bottom of 10th inning to lead USA past Colombia 3-2 in their opener (ESPN)
via IFTTT
Anonymous has now removed more than 10000 child porn sites from the internet
from Google Alert - anonymous http://ift.tt/2n94M2d
via IFTTT
[FD] DAVOSET v.1.3
Source: Gmail -> IFTTT-> Blogger
[FD] CVE-2017-6550: Kinsey Infor-Lawson - Multiple SQL Injections
Source: Gmail -> IFTTT-> Blogger
Ravens inform S Lardarius Webb they are releasing him; move frees up $5.5 million in cap room (ESPN)
via IFTTT
ISS Daily Summary Report – 3/09/2017
from ISS On-Orbit Status Report http://ift.tt/2mrbKMK
via IFTTT
7 Things That Happened After WikiLeaks Dumped The CIA Hacking Files
from The Hacker News http://ift.tt/2m7I9Xa
via IFTTT
User::getRoles() assumed unauthenticated users are anonymous
from Google Alert - anonymous http://ift.tt/2maqOxA
via IFTTT
[InsideNothing] hitebook.net liked your post "[FD] Apple iOS v10.1 & 10.1.1 - iCloud & Device Lock Bypass on Activate via local Buffer Overflow Vulnerability (Wifi Network)"
|
Source: Gmail -> IFTTT-> Blogger
How Dutch Police Decrypted BlackBerry PGP Messages For Criminal Investigation
from The Hacker News http://ift.tt/2mqqDyP
via IFTTT
[InsideNothing] hitebook.net liked your post "[FD] Apple iOS 10.2 (Notify - iTunes) - Filter Bypass & Persistent Vulnerability"
|
Source: Gmail -> IFTTT-> Blogger
Carrie Lam caught in anonymous briefings row
from Google Alert - anonymous http://ift.tt/2nm6hWW
via IFTTT
[FD] Multiple vulnerabilities discovered in dnaLIMS DNA sequencing web-application
[FD] CVE-2017-6466 - Remote Code Execution under SYSTEM via MITM in F-Secure AV
Source: Gmail -> IFTTT-> Blogger
[FD] Bypassing Authentication on iball Baton Routers
Source: Gmail -> IFTTT-> Blogger
[FD] SICUNET Physical Access Controller - Multiple Vulnerabilities
Source: Gmail -> IFTTT-> Blogger
Anonymous peer-review in science
from Google Alert - anonymous http://ift.tt/2n6oNq0
via IFTTT
Sinfonia in A Major
from Google Alert - anonymous http://ift.tt/2nd16JB
via IFTTT
I have a new follower on Twitter
César Castillo López
Comments, reviews, articles, curiosities, concerns, recommendations./// Comentarios, opiniones, artículos, curiosidades, preocupaciones, recomendaciones.
Barcelona
http://t.co/GVfq1PvRAi
Following: 2483 - Followers: 1099
March 10, 2017 at 01:46AM via Twitter http://twitter.com/cclopezbcn
Thursday, March 9, 2017
I have a new follower on Twitter
A Perfect Storm
Parsippany, NJ
https://t.co/GCYee4t7yR
Following: 4615 - Followers: 4949
March 09, 2017 at 10:56PM via Twitter http://twitter.com/perfectstormMD
NFL Free Agency: Ravens re-signing NT Brandon Williams to 5-year, $54M deal ($27.5M guaranteed) - Adam Schefter (ESPN)
via IFTTT
NFL Free Agency: Ravens will re-sign NT Brandon Williams - Adam Schefter; 32 starts over last 2 seasons (ESPN)
via IFTTT
WBC Video: Domincan Republic 3B Manny Machado lays out for great diving catch to rob Canada's Freddie Freeman (ESPN)
via IFTTT
Combining Bayesian Approaches and Evolutionary Techniques for the Inference of Breast Cancer Networks. (arXiv:1703.03041v1 [cs.LG])
Gene and protein networks are very important to model complex large-scale systems in molecular biology. Inferring or reverseengineering such networks can be defined as the process of identifying gene/protein interactions from experimental data through computational analysis. However, this task is typically complicated by the enormously large scale of the unknowns in a rather small sample size. Furthermore, when the goal is to study causal relationships within the network, tools capable of overcoming the limitations of correlation networks are required. In this work, we make use of Bayesian Graphical Models to attach this problem and, specifically, we perform a comparative study of different state-of-the-art heuristics, analyzing their performance in inferring the structure of the Bayesian Network from breast cancer data.
from cs.AI updates on arXiv.org http://ift.tt/2mGELGG
via IFTTT
Deep Variation-structured Reinforcement Learning for Visual Relationship and Attribute Detection. (arXiv:1703.03054v1 [cs.CV])
Despite progress in visual perception tasks such as image classification and detection, computers still struggle to understand the interdependency of objects in the scene as a whole, e.g., relations between objects or their attributes. Existing methods often ignore global context cues capturing the interactions among different object instances, and can only recognize a handful of types by exhaustively training individual detectors for all possible relationships. To capture such global interdependency, we propose a deep Variation-structured Reinforcement Learning (VRL) framework to sequentially discover object relationships and attributes in the whole image. First, a directed semantic action graph is built using language priors to provide a rich and compact representation of semantic correlations between object categories, predicates, and attributes. Next, we use a variation-structured traversal over the action graph to construct a small, adaptive action set for each step based on the current state and historical actions. In particular, an ambiguity-aware object mining scheme is used to resolve semantic ambiguity among object categories that the object detector fails to distinguish. We then make sequential predictions using a deep RL framework, incorporating global context cues and semantic embeddings of previously extracted phrases in the state vector. Our experiments on the Visual Relationship Detection (VRD) dataset and the large-scale Visual Genome dataset validate the superiority of VRL, which can achieve significantly better detection results on datasets involving thousands of relationship and attribute types. We also demonstrate that VRL is able to predict unseen types embedded in our action graph by learning correlations on shared graph nodes.
from cs.AI updates on arXiv.org http://ift.tt/2m8e2zu
via IFTTT
Interpretable Structure-Evolving LSTM. (arXiv:1703.03055v1 [cs.CV])
This paper develops a general framework for learning interpretable data representation via Long Short-Term Memory (LSTM) recurrent neural networks over hierarchal graph structures. Instead of learning LSTM models over the pre-fixed structures, we propose to further learn the intermediate interpretable multi-level graph structures in a progressive and stochastic way from data during the LSTM network optimization. We thus call this model the structure-evolving LSTM. In particular, starting with an initial element-level graph representation where each node is a small data element, the structure-evolving LSTM gradually evolves the multi-level graph representations by stochastically merging the graph nodes with high compatibilities along the stacked LSTM layers. In each LSTM layer, we estimate the compatibility of two connected nodes from their corresponding LSTM gate outputs, which is used to generate a merging probability. The candidate graph structures are accordingly generated where the nodes are grouped into cliques with their merging probabilities. We then produce the new graph structure with a Metropolis-Hasting algorithm, which alleviates the risk of getting stuck in local optimums by stochastic sampling with an acceptance probability. Once a graph structure is accepted, a higher-level graph is then constructed by taking the partitioned cliques as its nodes. During the evolving process, representation becomes more abstracted in higher-levels where redundant information is filtered out, allowing more efficient propagation of long-range data dependencies. We evaluate the effectiveness of structure-evolving LSTM in the application of semantic object parsing and demonstrate its advantage over state-of-the-art LSTM models on standard benchmarks.
from cs.AI updates on arXiv.org http://ift.tt/2mGAYsJ
via IFTTT
Learning the Probabilistic Structure of Cumulative Phenomena with Suppes-Bayes Causal Networks. (arXiv:1703.03074v1 [cs.LG])
One of the critical issues when adopting Bayesian networks (BNs) to model dependencies among random variables is to "learn" their structure, given the huge search space of possible solutions, i.e., all the possible direct acyclic graphs. This is a well-known NP-hard problem, which is also complicated by known pitfalls such as the issue of I-equivalence among different structures. In this work we restrict the investigations on BN structure learning to a specific class of networks, i.e., those representing the dynamics of phenomena characterized by the monotonic accumulation of events. Such phenomena allow to set specific structural constraints based on Suppes' theory of probabilistic causation and, accordingly, to define constrained BNs, named Suppes-Bayes Causal Networks (SBCNs). We here investigate the structure learning of SBCNs via extensive simulations with various state-of-the-art search strategies, such as canonical local search techniques and Genetic Algorithms. Among the main results we show that Suppes' constraints deeply simplify the learning task, by reducing the solution search space and providing a temporal ordering on the variables.
from cs.AI updates on arXiv.org http://ift.tt/2m8gPJ3
via IFTTT
Efficient Simulation of Financial Stress Testing Scenarios with Suppes-Bayes Causal Networks. (arXiv:1703.03076v1 [cs.LG])
The most recent financial upheavals have cast doubt on the adequacy of some of the conventional quantitative risk management strategies, such as VaR (Value at Risk), in many common situations. Consequently, there has been an increasing need for verisimilar financial stress testings, namely simulating and analyzing financial portfolios in extreme, albeit rare scenarios. Unlike conventional risk management which exploits statistical correlations among financial instruments, here we focus our analysis on the notion of probabilistic causation, which is embodied by Suppes-Bayes Causal Networks (SBCNs), SBCNs are probabilistic graphical models that have many attractive features in terms of more accurate causal analysis for generating financial stress scenarios. In this paper, we present a novel approach for conducting stress testing of financial portfolios based on SBCNs in combination with classical machine learning classification tools. The resulting method is shown to be capable of correctly discovering the causal relationships among financial factors that affect the portfolios and thus, simulating stress testing scenarios with a higher accuracy and lower computational complexity than conventional Monte Carlo Simulations.
from cs.AI updates on arXiv.org http://ift.tt/2mGxOoV
via IFTTT
Information Extraction in Illicit Domains. (arXiv:1703.03097v1 [cs.CL])
Extracting useful entities and attribute values from illicit domains such as human trafficking is a challenging problem with the potential for widespread social impact. Such domains employ atypical language models, have `long tails' and suffer from the problem of concept drift. In this paper, we propose a lightweight, feature-agnostic Information Extraction (IE) paradigm specifically designed for such domains. Our approach uses raw, unlabeled text from an initial corpus, and a few (12-120) seed annotations per domain-specific attribute, to learn robust IE models for unobserved pages and websites. Empirically, we demonstrate that our approach can outperform feature-centric Conditional Random Field baselines by over 18\% F-Measure on five annotated sets of real-world human trafficking datasets in both low-supervision and high-supervision settings. We also show that our approach is demonstrably robust to concept drift, and can be efficiently bootstrapped even in a serial computing environment.
from cs.AI updates on arXiv.org http://ift.tt/2m7SWS0
via IFTTT
A Structured Self-attentive Sentence Embedding. (arXiv:1703.03130v1 [cs.CL])
This paper proposes a new model for extracting an interpretable sentence embedding by introducing self-attention. Instead of using a vector, we use a 2-D matrix to represent the embedding, with each row of the matrix attending on a different part of the sentence. We also propose a self-attention mechanism and a special regularization term for the model. As a side effect, the embedding comes with an easy way of visualizing what specific parts of the sentence are encoded into the embedding. We evaluate our model on 3 different tasks: author profiling, sentiment classification, and textual entailment. Results show that our model yields a significant performance gain compared to other sentence embedding methods in all of the 3 tasks.
from cs.AI updates on arXiv.org http://ift.tt/2mGQip9
via IFTTT
Behavior-based Navigation of Mobile Robot in Unknown Environments Using Fuzzy Logic and Multi-Objective Optimization. (arXiv:1703.03161v1 [cs.RO])
This study proposes behavior-based navigation architecture, named BBFM, to deal with the problem of navigating the mobile robot in unknown environments in the presence of obstacles and local minimum regions. In the architecture, the complex navigation task is split into principal sub-tasks or behaviors. Each behavior is implemented by a fuzzy controller and executed independently to deal with a specific problem of navigation. The fuzzy controller is modified to contain only the fuzzification and inference procedures so that its output is a membership function representing the behavior's objective. The membership functions of all controllers are then used as the objective functions for a multi-objective optimization process to coordinate all behaviors. The result of this process is an overall control signal, which is Pareto-optimal, used to control the robot. A number of simulations, comparisons, and experiments were conducted. The results show that the proposed architecture outperforms some popular behavior-based architectures in term of accuracy, smoothness, traveled distance, and time response.
from cs.AI updates on arXiv.org http://ift.tt/2lJmzge
via IFTTT
Embedding Tarskian Semantics in Vector Spaces. (arXiv:1703.03193v1 [cs.AI])
We propose a new linear algebraic approach to the computation of Tarskian semantics in logic. We embed a finite model M in first-order logic with N entities in N-dimensional Euclidean space R^N by mapping entities of M to N dimensional one-hot vectors and k-ary relations to order-k adjacency tensors (multi-way arrays). Second given a logical formula F in prenex normal form, we compile F into a set Sigma_F of algebraic formulas in multi-linear algebra with a nonlinear operation. In this compilation, existential quantifiers are compiled into a specific type of tensors, e.g., identity matrices in the case of quantifying two occurrences of a variable. It is shown that a systematic evaluation of Sigma_F in R^N gives the truth value, 1(true) or 0(false), of F in M. Based on this framework, we also propose an unprecedented way of computing the least models defined by Datalog programs in linear spaces via matrix equations and empirically show its effectiveness compared to state-of-the-art approaches.
from cs.AI updates on arXiv.org http://ift.tt/2m8eGwR
via IFTTT
Modeling the Ellsberg Paradox by Argument Strength. (arXiv:1703.03233v1 [cs.AI])
We present a formal measure of argument strength, which combines the ideas that conclusions of strong arguments are (i) highly probable and (ii) their uncertainty is relatively precise. Likewise, arguments are weak when their conclusion probability is low or when it is highly imprecise. We show how the proposed measure provides a new model of the Ellsberg paradox. Moreover, we further substantiate the psychological plausibility of our approach by an experiment (N = 60). The data show that the proposed measure predicts human inferences in the original Ellsberg task and in corresponding argument strength tasks. Finally, we report qualitative data taken from structured interviews on folk psychological conceptions on what argument strength means.
from cs.AI updates on arXiv.org http://ift.tt/2mGDXRM
via IFTTT
Abductive, Causal, and Counterfactual Conditionals Under Incomplete Probablistitic Knowledge. (arXiv:1703.03254v1 [cs.AI])
We study abductive, causal, and non-causal conditionals in indicative and counterfactual formulations using probabilistic truth table tasks under incomplete probabilistic knowledge (N = 80). We frame the task as a probability-logical inference problem. The most frequently observed response type across all conditions was a class of conditional event interpretations of conditionals; it was followed by conjunction interpretations. An interesting minority of participants neglected some of the relevant imprecision involved in the premises when inferring lower or upper probability bounds on the target conditional/counterfactual ("halfway responses"). We discuss the results in the light of coherence-based probability logic and the new paradigm psychology of reasoning.
from cs.AI updates on arXiv.org http://ift.tt/2m87UHE
via IFTTT
Counterfactuals, indicative conditionals, and negation under uncertainty: Are there cross-cultural differences?. (arXiv:1703.03255v1 [cs.AI])
In this paper we study selected argument forms involving counterfactuals and indicative conditionals under uncertainty. We selected argument forms to explore whether people with an Eastern cultural background reason differently about conditionals compared to Westerners, because of the differences in the location of negations. In a 2x2 between-participants design, 63 Japanese university students were allocated to four groups, crossing indicative conditionals and counterfactuals, and each presented in two random task orders. The data show close agreement between the responses of Easterners and Westerners. The modal responses provide strong support for the hypothesis that conditional probability is the best predictor for counterfactuals and indicative conditionals. Finally, the grand majority of the responses are probabilistically coherent, which endorses the psychological plausibility of choosing coherence-based probability logic as a rationality framework for psychological reasoning research.
from cs.AI updates on arXiv.org http://ift.tt/2mGAYcd
via IFTTT
LesionSeg: Semantic segmentation of skin lesions using Deep Convolutional Neural Network. (arXiv:1703.03372v1 [cs.CV])
We present a method for skin lesion segmentation for the ISIC 2017 Skin Lesion Segmentation Challenge. Our approach is based on a Fully Convolutional Network architecture which is trained end to end, from scratch, on a limited dataset. Our semantic segmentation architecture utilizes several recent innovations in particularly in the combined use of (i) use of \emph{atrous} convolutions to increase the effective field of view of the network's receptive field without increasing the number of parameters, (ii) the use of network-in-network $1\times1$ convolution layers to increase network capacity without incereasing the number of parameters and (iii) state-of-art super-resolution upsampling of predictions using subpixel CNN layers for accurate and efficient upsampling of predictions. We achieved a IOU score of 0.642 on the validation set provided by the organisers.
from cs.AI updates on arXiv.org http://ift.tt/2m83Sio
via IFTTT
Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks. (arXiv:1703.03400v1 [cs.LG])
We propose an algorithm for meta-learning that is model-agnostic, in the sense that it is compatible with any model trained with gradient descent and applicable to a variety of different learning problems, including classification, regression, and reinforcement learning. The goal of meta-learning is to train a model on a variety of learning tasks, such that it can solve new learning tasks using only a small number of training samples. In our approach, the parameters of the model are explicitly trained such that a small number of gradient steps with a small amount of training data from a new task will produce good generalization performance on that task. In effect, our method trains the model to be easy to fine-tune. We demonstrate that this approach leads to state-of-the-art performance on a few-shot image classification benchmark, produces good results on few-shot regression, and accelerates fine-tuning for policy gradient reinforcement learning with neural network policies.
from cs.AI updates on arXiv.org http://ift.tt/2mGupGI
via IFTTT
Exposing the Probabilistic Causal Structure of Discrimination. (arXiv:1510.00552v3 [cs.DB] UPDATED)
Discrimination discovery from data is an important task aiming at identifying patterns of illegal and unethical discriminatory activities against protected-by-law groups, e.g., ethnic minorities. While any legally-valid proof of discrimination requires evidence of causality, the state-of-the-art methods are essentially correlation-based, albeit, as it is well known, correlation does not imply causation.
In this paper we take a principled causal approach to the data mining problem of discrimination detection in databases. Following Suppes' probabilistic causation theory, we define a method to extract, from a dataset of historical decision records, the causal structures existing among the attributes in the data. The result is a type of constrained Bayesian network, which we dub Suppes-Bayes Causal Network (SBCN). Next, we develop a toolkit of methods based on random walks on top of the SBCN, addressing different anti-discrimination legal concepts, such as direct and indirect discrimination, group and individual discrimination, genuine requirement, and favoritism. Our experiments on real-world datasets confirm the inferential power of our approach in all these different tasks.
from cs.AI updates on arXiv.org http://ift.tt/1JNnXOd
via IFTTT
Modeling cumulative biological phenomena with Suppes-Bayes Causal Networks. (arXiv:1602.07857v3 [cs.AI] UPDATED)
Several diseases related to cell proliferation are characterized by the accumulation of somatic DNA changes, with respect to wildtype conditions. Cancer and HIV are two common examples of such diseases, where the mutational load in the cancerous/viral population increases over time. In these cases, selective pressures are often observed along with competition, cooperation and parasitism among distinct cellular clones. Recently, we presented a mathematical framework to model these phenomena, based on a combination of Bayesian inference and Suppes' theory of probabilistic causation, depicted in graphical structures dubbed Suppes-Bayes Causal Networks (SBCNs). SBCNs are generative probabilistic graphical models that recapitulate the potential ordering of accumulation of such DNA changes during the progression of the disease. Such models can be inferred from data by exploiting likelihood-based model-selection strategies with regularization. In this paper we discuss the theoretical foundations of our approach and we investigate in depth the influence on the model-selection task of: (i) the poset based on Suppes' theory and (ii) different regularization strategies. Furthermore, we provide an example of application of our framework to HIV genetic data highlighting the valuable insights provided by the inferred.
from cs.AI updates on arXiv.org http://ift.tt/24sg8eL
via IFTTT
Bootstrapping with Models: Confidence Intervals for Off-Policy Evaluation. (arXiv:1606.06126v2 [cs.AI] UPDATED)
For an autonomous agent, executing a poor policy may be costly or even dangerous. For such agents, it is desirable to determine confidence interval lower bounds on the performance of any given policy without executing said policy. Current methods for exact high confidence off-policy evaluation that use importance sampling require a substantial amount of data to achieve a tight lower bound. Existing model-based methods only address the problem in discrete state spaces. Since exact bounds are intractable for many domains we trade off strict guarantees of safety for more data-efficient approximate bounds. In this context, we propose two bootstrapping off-policy evaluation methods which use learned MDP transition models in order to estimate lower confidence bounds on policy performance with limited data in both continuous and discrete state spaces. Since direct use of a model may introduce bias, we derive a theoretical upper bound on model bias for when the model transition function is estimated with i.i.d. trajectories. This bound broadens our understanding of the conditions under which model-based methods have high bias. Finally, we empirically evaluate our proposed methods and analyze the settings in which different bootstrapping off-policy confidence interval methods succeed and fail.
from cs.AI updates on arXiv.org http://ift.tt/28MFYDc
via IFTTT
Neighborhood Mixture Model for Knowledge Base Completion. (arXiv:1606.06461v3 [cs.CL] UPDATED)
Knowledge bases are useful resources for many natural language processing tasks, however, they are far from complete. In this paper, we define a novel entity representation as a mixture of its neighborhood in the knowledge base and apply this technique on TransE-a well-known embedding model for knowledge base completion. Experimental results show that the neighborhood information significantly helps to improve the results of the TransE model, leading to better performance than obtained by other state-of-the-art embedding models on three benchmark datasets for triple classification, entity prediction and relation prediction tasks.
from cs.AI updates on arXiv.org http://ift.tt/28MfaGu
via IFTTT
Universal adversarial perturbations. (arXiv:1610.08401v3 [cs.CV] UPDATED)
Given a state-of-the-art deep neural network classifier, we show the existence of a universal (image-agnostic) and very small perturbation vector that causes natural images to be misclassified with high probability. We propose a systematic algorithm for computing universal perturbations, and show that state-of-the-art deep neural networks are highly vulnerable to such perturbations, albeit being quasi-imperceptible to the human eye. We further empirically analyze these universal perturbations and show, in particular, that they generalize very well across neural networks. The surprising existence of universal perturbations reveals important geometric correlations among the high-dimensional decision boundary of classifiers. It further outlines potential security breaches with the existence of single directions in the input space that adversaries can possibly exploit to break a classifier on most natural images.
from cs.AI updates on arXiv.org http://ift.tt/2eHr3Q8
via IFTTT
Joint Causal Inference from Observational and Experimental Datasets. (arXiv:1611.10351v2 [cs.LG] UPDATED)
We introduce Joint Causal Inference (JCI), a powerful formulation of causal discovery from multiple datasets that allows to jointly learn both the causal structure and targets of interventions from statistical independences in pooled data. Compared with existing constraint-based approaches for causal discovery from multiple data sets, JCI offers several advantages: it allows for several different types of interventions in a unified fashion, it can learn intervention targets, it systematically pools data across different datasets which improves the statistical power of independence tests, and most importantly, it improves on the accuracy and identifiability of the predicted causal relations. A technical complication that arises in JCI is the occurrence of faithfulness violations due to deterministic relations. We propose a simple but effective strategy for dealing with this type of faithfulness violations. We implement it in ACID, a determinism-tolerant extension of Ancestral Causal Inference (ACI) (Magliacane et al., 2016), a recently proposed logic-based causal discovery method that improves reliability of the output by exploiting redundant information in the data. We illustrate the benefits of JCI with ACID with an evaluation on a simulated dataset.
from cs.AI updates on arXiv.org http://ift.tt/2gzXQob
via IFTTT
ASHACL: Alternative Shapes Constraint Language. (arXiv:1702.01795v2 [cs.AI] UPDATED)
ASHACL, a variant of the W3C Shapes Constraint Language, is designed to determine whether an RDF graph meets some conditions. These conditions are grouped into shapes, which validate whether particular RDF terms each meet the constraints of the shape. Shapes are themselves expressed as RDF triples in an RDF graph, called a shapes graph.
from cs.AI updates on arXiv.org http://ift.tt/2kjRZ82
via IFTTT
Similarity Preserving Representation Learning for Time Series Analysis. (arXiv:1702.03584v2 [cs.AI] UPDATED)
A considerable amount of machine learning algorithms take instance-feature matrices as their inputs. As such, they cannot directly analyze time series data due to its temporal nature, usually unequal lengths, and complex properties. This is a great pity since many of these algorithms are effective, robust, efficient, and easy to use. In this paper, we bridge this gap by proposing an efficient representation learning framework that is able to convert a set of time series with equal or unequal lengths to a matrix format. In particular, we guarantee that the pairwise similarities between time series are well preserved after the transformation. The learned feature representation is particularly suitable to the class of learning problems that are sensitive to data similarities. Given a set of $n$ time series, we first construct an $n\times n$ partially observed similarity matrix by randomly sampling $O(n \log n)$ pairs of time series and computing their pairwise similarities. We then propose an extremely efficient algorithm that solves a highly non-convex and NP-hard problem to learn new features based on the partially observed similarity matrix. We use the learned features to conduct experiments on both data classification and clustering tasks. Our extensive experimental results demonstrate that the proposed framework is both effective and efficient.
from cs.AI updates on arXiv.org http://ift.tt/2l9uMcr
via IFTTT
Microsoft update – anonymous access and internal lnks
from Google Alert - anonymous http://ift.tt/2n5kJXd
via IFTTT
NFL Free Agency: Ravens pick up 2017 contract option on WR Mike Wallace; sign RB Danny Woodhead to 3-year deal (ESPN)
via IFTTT
Anonymous donor gives NY Times $1M for student subscriptions
from Google Alert - anonymous http://ift.tt/2m5rfYV
via IFTTT
Anonymous - Chef
from Google Alert - anonymous http://ift.tt/2mqNP1D
via IFTTT
ISS Daily Summary Report – 3/08/2017
from ISS On-Orbit Status Report http://ift.tt/2lHBxmT
via IFTTT
New Apache Struts Zero-Day Vulnerability Being Exploited in the Wild
from The Hacker News http://ift.tt/2lH4pf1
via IFTTT
Secure Messaging App 'Confide' Used by White House Staffers Found Vulnerable
from The Hacker News http://ift.tt/2m2K3bf
via IFTTT
How to setup anonymous acces to NextCloud (without password or as guest)?
from Google Alert - anonymous http://ift.tt/2mm4Nwu
via IFTTT
Call for Papers: Call for Papers on Occator Crater on Ceres
The Dawn mission has collected a wealth of data about the dwarf planet Ceres with its Framing Camera, Visible and Infrared Mapping Spectrometer, Gamma Ray and Neutron Detector and gravity science investigation. Occator crater is one of the most intriguing locations on Ceres as observed by Dawn, and it contains distinctive bright regions called the Cerealia Facula and Vinalia Faculae. Our understanding of the formation and evolution of Occator crater, in particular the Cerealia and Vinalia Faculae, is currently under investigation. We hereby call for submissions of papers to a special issue on the “The Formation and Evolution of Ceres’ Occator Crater”.
from Icarus http://ift.tt/2m1Iv1e
via IFTTT
An anonymous company is hiring
from Google Alert - anonymous http://ift.tt/2n2bzed
via IFTTT
Ravens re-sign backup QB Ryan Mallett - NFL Network; 3 of 6 for 26 yards, INT last season (ESPN)
via IFTTT
I have a new follower on Twitter
BORING GIRLS
Official Twitter for BORING GIRLS, a digital series about teen girls who enter the world of death metal on a journey of artistic self-expression.
Toronto, Ontario
https://t.co/fpXIZfCbyi
Following: 692 - Followers: 175
March 09, 2017 at 12:01AM via Twitter http://twitter.com/boringgirlstv
Wednesday, March 8, 2017
8th Street, Ocean City, MD's surf is at least 5.25ft high
8th Street, Ocean City, MD Summary
At 3:00 AM, surf min of 5.25ft. At 9:00 AM, surf min of 6.28ft. At 3:00 PM, surf min of 6.27ft. At 9:00 PM, surf min of 5.26ft.
Surf maximum: 5.52ft (1.68m)
Surf minimum: 5.25ft (1.6m)
Tide height: -0.44ft (-0.13m)
Wind direction: NE
Wind speed: 32.29 KTS
from Surfline http://ift.tt/1kVmigH
via IFTTT
Ravens expected to sign S Tony Jefferson - Dianna Russini and Adam Schefter; 96 tackles last season with Cardinals (ESPN)
via IFTTT
AA Alcoholics Anonymous Meetings
from Google Alert - anonymous http://ift.tt/2m4suZj
via IFTTT
I have a new follower on Twitter
MLeads
MLeads is a cloud technology based one-stop innovative mobile platform for #leads and #event management.Let's Create Your Dream Event https://t.co/cGXnupD0Zb
Philadelphia, PA
https://t.co/J9ufYcDnci
Following: 6030 - Followers: 6784
March 08, 2017 at 08:41PM via Twitter http://twitter.com/MLeadsApp
I have a new follower on Twitter
Nate Regier, PhD
Next Element CEO, Author, Keynote Speaker, Blogger, Leadership Communication Coach, #ConflictWithoutCasualties, #CompassionateAccountability
Newton, KS
https://t.co/1Eddh4z99u
Following: 7524 - Followers: 8519
March 08, 2017 at 08:41PM via Twitter http://twitter.com/NextNate
Multi-Robot Active Information Gathering with Periodic Communication. (arXiv:1703.02610v1 [cs.RO])
A team of robots sharing a common goal can benefit from coordination of the activities of team members, helping the team to reach the goal more reliably or quickly. We address the problem of coordinating the actions of a team of robots with periodic communication capability executing an information gathering task. We cast the problem as a multi-agent optimal decision-making problem with an information theoretic objective function. We show that appropriate techniques for solving decentralized partially observable Markov decision processes (Dec-POMDPs) are applicable in such information gathering problems. We quantify the usefulness of coordinated information gathering through simulation studies, and demonstrate the feasibility of the method in a real-world target tracking domain.
from cs.AI updates on arXiv.org http://ift.tt/2lFoL8h
via IFTTT
Cost-Optimal Learning of Causal Graphs. (arXiv:1703.02645v1 [cs.AI])
We consider the problem of learning a causal graph over a set of variables with interventions. We study the cost-optimal causal graph learning problem: For a given skeleton (undirected version of the causal graph), design the set of interventions with minimum total cost, that can uniquely identify any causal graph with the given skeleton. We show that this problem is solvable in polynomial time. Later, we consider the case when the number of interventions is limited. For this case, we provide polynomial time algorithms when the skeleton is a tree or a clique tree. For a general chordal skeleton, we develop an efficient greedy algorithm, which can be improved when the causal graph skeleton is an interval graph.
from cs.AI updates on arXiv.org http://ift.tt/2m0TzLX
via IFTTT
Towards Generalization and Simplicity in Continuous Control. (arXiv:1703.02660v1 [cs.LG])
This work shows that policies with simple linear and RBF parameterizations can be trained to solve a variety of continuous control tasks, including the OpenAI gym benchmarks. The performance of these trained policies are competitive with state of the art results, obtained with more elaborate parameterizations such as fully connected neural networks. Furthermore, existing training and testing scenarios are shown to be very limited and prone to over-fitting, thus giving rise to only trajectory-centric policies. Training with a diverse initial state distribution is shown to produce more global policies with better generalization. This allows for interactive control scenarios where the system recovers from large on-line perturbations; as shown in the supplementary video.
from cs.AI updates on arXiv.org http://ift.tt/2m4dcDR
via IFTTT
Robust Adversarial Reinforcement Learning. (arXiv:1703.02702v1 [cs.LG])
Deep neural networks coupled with fast simulation and improved computation have led to recent successes in the field of reinforcement learning (RL). However, most current RL-based approaches fail to generalize since: (a) the gap between simulation and real world is so large that policy-learning approaches fail to transfer; (b) even if policy learning is done in real world, the data scarcity leads to failed generalization from training to test scenarios (e.g., due to different friction or object masses). Inspired from H-infinity control methods, we note that both modeling errors and differences in training and test scenarios can be viewed as extra forces/disturbances in the system. This paper proposes the idea of robust adversarial reinforcement learning (RARL), where we train an agent to operate in the presence of a destabilizing adversary that applies disturbance forces to the system. The jointly trained adversary is reinforced -- that is, it learns an optimal destabilization policy. We formulate the policy learning as a zero-sum, minimax objective function. Extensive experiments in multiple environments (InvertedPendulum, HalfCheetah, Swimmer, Hopper and Walker2d) conclusively demonstrate that our method (a) improves training stability; (b) is robust to differences in training/test conditions; and c) outperform the baseline even in the absence of the adversary.
from cs.AI updates on arXiv.org http://ift.tt/2lFovX8
via IFTTT
An Integrated and Scalable Platform for Proactive Event-Driven Traffic Management. (arXiv:1703.02810v1 [cs.AI])
Traffic on freeways can be managed by means of ramp meters from Road Traffic Control rooms. Human operators cannot efficiently manage a network of ramp meters. To support them, we present an intelligent platform for traffic management which includes a new ramp metering coordination scheme in the decision making module, an efficient dashboard for interacting with human operators, machine learning tools for learning event definitions and Complex Event Processing tools able to deal with uncertainties inherent to the traffic use case. Unlike the usual approach, the devised event-driven platform is able to predict a congestion up to 4 minutes before it really happens. Proactive decision making can then be established leading to significant improvement of traffic conditions.
from cs.AI updates on arXiv.org http://ift.tt/2m4bm5O
via IFTTT
Introduction to Formal Concept Analysis and Its Applications in Information Retrieval and Related Fields. (arXiv:1703.02819v1 [cs.IR])
This paper is a tutorial on Formal Concept Analysis (FCA) and its applications. FCA is an applied branch of Lattice Theory, a mathematical discipline which enables formalisation of concepts as basic units of human thinking and analysing data in the object-attribute form. Originated in early 80s, during the last three decades, it became a popular human-centred tool for knowledge representation and data analysis with numerous applications. Since the tutorial was specially prepared for RuSSIR 2014, the covered FCA topics include Information Retrieval with a focus on visualisation aspects, Machine Learning, Data Mining and Knowledge Discovery, Text Mining and several others.
from cs.AI updates on arXiv.org http://ift.tt/2n0L1d4
via IFTTT
Memory Enriched Big Bang Big Crunch Optimization Algorithm for Data Clustering. (arXiv:1703.02883v1 [cs.AI])
Cluster analysis plays an important role in decision making process for many knowledge-based systems. There exist a wide variety of different approaches for clustering applications including the heuristic techniques, probabilistic models, and traditional hierarchical algorithms. In this paper, a novel heuristic approach based on big bang-big crunch algorithm is proposed for clustering problems. The proposed method not only takes advantage of heuristic nature to alleviate typical clustering algorithms such as k-means, but it also benefits from the memory based scheme as compared to its similar heuristic techniques. Furthermore, the performance of the proposed algorithm is investigated based on several benchmark test functions as well as on the well-known datasets. The experimental results show the significant superiority of the proposed method over the similar algorithms.
from cs.AI updates on arXiv.org http://ift.tt/2lFxNSP
via IFTTT
A quantum dynamic belief model to explain the interference effects of categorization on decision making. (arXiv:1703.02894v1 [cs.AI])
Categorization is necessary for many decision making tasks. However, the categorization process may interfere the decision making result and the law of total probability can be violated in some situations. To predict the interference effect of categorization, some model based on quantum probability has been proposed. In this paper, a new quantum dynamic belief (QDB) model is proposed. Considering the precise decision may not be made during the process, the concept of uncertainty is introduced in our model to simulate real human thinking process. Then the interference effect categorization can be predicted by handling the uncertain information. The proposed model is applied to a categorization decision-making experiment to explain the interference effect of categorization. Compared with other models, our model is relatively more succinct and the result shows the correctness and effectiveness of our model.
from cs.AI updates on arXiv.org http://ift.tt/2m4aVZu
via IFTTT
Learning a Unified Control Policy for Safe Falling. (arXiv:1703.02905v1 [cs.RO])
Being able to fall safely is a necessary motor skill for humanoids performing highly dynamic tasks, such as running and jumping. We propose a new method to learn a policy that minimizes the maximal impulse during the fall. The optimization solves for both a discrete contact planning problem and a continuous optimal control problem. Once trained, the policy can compute the optimal next contacting body part (e.g. left foot, right foot, or hands), contact location and timing, and the required joint actuation. We represent the policy as a mixture of actor-critic neural network, which consists of n control policies and the corresponding value functions. Each pair of actor-critic is associated with one of the n possible contacting body parts. During execution, the policy corresponding to the highest value function will be executed while the associated body part will be the next contact with the ground. With this mixture of actor-critic architecture, the discrete contact sequence planning is solved through the selection of the best critics while the continuous control problem is solved by the optimization of actors. We show that our policy can achieve comparable, sometimes even higher, rewards than a recursive search of the action space using dynamic programming, while enjoying 50 to 400 times of speed gain during online execution.
from cs.AI updates on arXiv.org http://ift.tt/2lFoB0M
via IFTTT
Learning Invariant Feature Spaces to Transfer Skills with Reinforcement Learning. (arXiv:1703.02949v1 [cs.AI])
People can learn a wide range of tasks from their own experience, but can also learn from observing other creatures. This can accelerate acquisition of new skills even when the observed agent differs substantially from the learning agent in terms of morphology. In this paper, we examine how reinforcement learning algorithms can transfer knowledge between morphologically different agents (e.g., different robots). We introduce a problem formulation where two agents are tasked with learning multiple skills by sharing information. Our method uses the skills that were learned by both agents to train invariant feature spaces that can then be used to transfer other skills from one agent to another. The process of learning these invariant feature spaces can be viewed as a kind of "analogy making", or implicit learning of partial correspondences between two distinct domains. We evaluate our transfer learning algorithm in two simulated robotic manipulation skills, and illustrate that we can transfer knowledge between simulated robotic arms with different numbers of links, as well as simulated arms with different actuation mechanisms, where one robot is torque-driven while the other is tendon-driven.
from cs.AI updates on arXiv.org http://ift.tt/2m3Yltf
via IFTTT
STransE: a novel embedding model of entities and relationships in knowledge bases. (arXiv:1606.08140v3 [cs.CL] UPDATED)
Knowledge bases of real-world facts about entities and their relationships are useful resources for a variety of natural language processing tasks. However, because knowledge bases are typically incomplete, it is useful to be able to perform link prediction or knowledge base completion, i.e., predict whether a relationship not in the knowledge base is likely to be true. This paper combines insights from several previous link prediction models into a new embedding model STransE that represents each entity as a low-dimensional vector, and each relation by two matrices and a translation vector. STransE is a simple combination of the SE and TransE models, but it obtains better link prediction performance on two benchmark datasets than previous embedding models. Thus, STransE can serve as a new baseline for the more complex models in the link prediction task.
from cs.AI updates on arXiv.org http://ift.tt/296ni3T
via IFTTT
DESPOT: Online POMDP Planning with Regularization. (arXiv:1609.03250v2 [cs.AI] UPDATED)
The partially observable Markov decision process (POMDP) provides a principled general framework for planning under uncertainty, but solving POMDPs optimally is computationally intractable, due to the "curse of dimensionality" and the "curse of history". To overcome these challenges, we introduce the Determinized Sparse Partially Observable Tree (DESPOT), a sparse approximation of the standard belief tree, for online planning under uncertainty. A DESPOT focuses online planning on a set of randomly sampled scenarios and compactly captures the "execution" of all policies under these scenarios. We show that the best policy obtained from a DESPOT is near-optimal, with a regret bound that depends on the representation size of the optimal policy. Leveraging this result, we give an anytime online planning algorithm, which searches a DESPOT for a policy that optimizes a regularized objective function. Regularization balances the estimated value of a policy under the sampled scenarios and the policy size, thus avoiding overfitting. The algorithm demonstrates strong experimental results, compared with some of the best online POMDP algorithms available. It has also been incorporated into an autonomous driving system for real-time vehicle control. The source code for the algorithm is available online.
from cs.AI updates on arXiv.org http://ift.tt/2cSC7X6
via IFTTT
Averaged-DQN: Variance Reduction and Stabilization for Deep Reinforcement Learning. (arXiv:1611.01929v3 [cs.AI] UPDATED)
Instability and variability of Deep Reinforcement Learning (DRL) algorithms tend to adversely affect their performance. Averaged-DQN is a simple extension to the DQN algorithm, based on averaging previously learned Q-values estimates, which leads to a more stable training procedure and improved performance by reducing approximation error variance in the target values. To understand the effect of the algorithm, we examine the source of value function estimation errors and provide an analytical comparison within a simplified model. We further present experiments on the Arcade Learning Environment benchmark that demonstrate significantly improved stability and performance due to the proposed extension.
from cs.AI updates on arXiv.org http://ift.tt/2egK64j
via IFTTT
3 teens send anonymous apology, $50 for library swastika
from Google Alert - anonymous http://ift.tt/2ng7L4U
via IFTTT
Ravens will release 5-time Pro Bowl LB Elvis Dumervil - NFL Network; frees up $6M in cap space (ESPN)
via IFTTT
Anonymous family gives custodian truck to keep him working at Oklahoma school
from Google Alert - anonymous http://ift.tt/2n6Xvg5
via IFTTT
10 Things You Need To Know About 'Wikileaks CIA Leak'
from The Hacker News http://ift.tt/2n6R38J
via IFTTT
Journalists should be careful with anonymous sources
from Google Alert - anonymous http://ift.tt/2m2VxfG
via IFTTT
3 teens send anonymous apology, $50 for library swastika
from Google Alert - anonymous http://ift.tt/2lYDdUf
via IFTTT
Anonymous download co
from Google Alert - anonymous http://ift.tt/2lEcfpI
via IFTTT
Ravens: Free agent WR Torrey Smith stops short of saying he'll return; "Top secret information" - Baltimore's 98 Rock (ESPN)
via IFTTT
ISS Daily Summary Report – 3/07/2017
from ISS On-Orbit Status Report http://ift.tt/2mXYoLc
via IFTTT
Proposed Bill Would Legally Allow Cyber Crime Victims to Hack Back
from The Hacker News http://ift.tt/2mBdyVv
via IFTTT
[FD] SEC Consult SA-20170308-0 :: Multiple vulnerabilities in Navetti PricePoint
Source: Gmail -> IFTTT-> Blogger
The Liberal Media's Anonymous-Sources Hypocrisy
from Google Alert - anonymous http://ift.tt/2mEPiCx
via IFTTT
Ravens place $1.797M tender on RFA Terrance West - source; would get 3rd-round pick if they don't match offer sheet from another team (ESPN)
via IFTTT
Tuesday, March 7, 2017
Johnny Anonymous
from Google Alert - anonymous http://ift.tt/2m0sAkN
via IFTTT