Latest YouTube Video
Saturday, November 5, 2016
UK police arrest nearly 50 at Anonymous protest in London
from Google Alert - anonymous http://ift.tt/2fPvrO0
via IFTTT
More Insights On Alleged DDoS Attack Against Liberia Using Mirai Botnet
from The Hacker News http://ift.tt/2fc0TlT
via IFTTT
I have a new follower on Twitter
Tom Greathouse
It Solutions for a better world! #Retail #SmartLabels #RFID #StoreOperations Husband, Dad, #StarWarsGeek, Lightsaber duelist, IT Pro, Passion for Cybersecurity
Buffalo, NY
https://t.co/3iIkukZigX
Following: 703 - Followers: 174
November 05, 2016 at 01:25PM via Twitter http://twitter.com/tgr8house1
Ravens elevate S Matt Elam to 53-man roster; previously designated to return off injured reserve (ESPN)
via IFTTT
Re: [FD] [oss-security] CVE request:Lynx invalid URL parsing with '?'
Source: Gmail -> IFTTT-> Blogger
Over 1 Billion Android App Accounts can be Hijacked Remotely with this Simple Hack
from The Hacker News http://ift.tt/2eatYkG
via IFTTT
Re: [FD] [oss-security] CVE request:Lynx invalid URL parsing with '?'
Source: Gmail -> IFTTT-> Blogger
[FD] Bypass Imperva by confusing HTTP Pollution Normalization Engine
Source: Gmail -> IFTTT-> Blogger
[FD] MySQL / MariaDB / PerconaDB - Root Privilege Escalation Exploit ( CVE-2016-6664 / CVE-2016-5617 )
Source: Gmail -> IFTTT-> Blogger
[FD] MSIE 9 MSHTML CPtsTextParaclient::CountApes out-of-bounds read
Source: Gmail -> IFTTT-> Blogger
Friday, November 4, 2016
Zayn Malik wants to know what it feels like to be anonymous
from Google Alert - anonymous http://ift.tt/2fMMLmO
via IFTTT
Ravens claim former Bengals CB Chris Lewis-Harris off of waivers and cut CB Will Davis (ESPN)
via IFTTT
I have a new follower on Twitter
Rank K.O. Lab
Growth Hacking and Skunkworks Project for @rankkousa, the leader in Reputation Management. Our mission is to radically innovate the Enterprise ORM Industry.
USA
http://t.co/AijmU3WyFZ
Following: 6601 - Followers: 6910
November 04, 2016 at 06:55PM via Twitter http://twitter.com/rankkolab
Anonymous Pastor in Central Asia Describes Exactly What Christian Persecution Looks Like
from Google Alert - anonymous http://ift.tt/2fkqdGM
via IFTTT
Anonymous scout blasts Revis
from Google Alert - anonymous http://ift.tt/2eHEa0h
via IFTTT
An Anonymous Group Is Sending Out Mailers Touting Libertarian Candidates In 2 Key State House ...
from Google Alert - anonymous http://ift.tt/2e9pz1n
via IFTTT
Ravens: WR Steve Smith (ankle), LB Terrell Suggs (bicep) questionable for Week 9; both practiced in full Friday (ESPN)
via IFTTT
Privatoria — Protect Your Privacy Online with Fast and Encrypted VPN Service
from The Hacker News http://ift.tt/2fjR3yK
via IFTTT
[FD] KL-001-2016-009 : Sophos Web Appliance Remote Code Execution
Source: Gmail -> IFTTT-> Blogger
[FD] KL-001-2016-008 : Sophos Web Appliance Privilege Escalation
Source: Gmail -> IFTTT-> Blogger
Learn Python Online — From Scratch to Penetration Testing
from The Hacker News http://ift.tt/2fjskuz
via IFTTT
ISS Daily Summary Report – 11/03/2016
from ISS On-Orbit Status Report http://ift.tt/2euU6W5
via IFTTT
[FD] [oss-security] CVE request:Lynx invalid URL parsing with '?'
Source: Gmail -> IFTTT-> Blogger
Re: [FD] [oss-security] CVE request:Lynx invalid URL parsing with '?'
Source: Gmail -> IFTTT-> Blogger
Re: [FD] [oss-security] CVE request:Lynx invalid URL parsing with '?'
Source: Gmail -> IFTTT-> Blogger
[FD] MSIE 10 MSHTML CElement::GetPlainTextInScope out-of-bounds read
Source: Gmail -> IFTTT-> Blogger
Wi-Fi can be turned into IMSI Catcher to Track Cell Phone Users Everywhere
from The Hacker News http://ift.tt/2e7MTwC
via IFTTT
Thursday, November 3, 2016
Predicting Domain Generation Algorithms with Long Short-Term Memory Networks. (arXiv:1611.00791v1 [cs.CR])
Various families of malware use domain generation algorithms (DGAs) to generate a large number of pseudo-random domain names to connect to a command and control (C&C) server. In order to block DGA C&C traffic, security organizations must first discover the algorithm by reverse engineering malware samples, then generating a list of domains for a given seed. The domains are then either preregistered or published in a DNS blacklist. This process is not only tedious, but can be readily circumvented by malware authors using a large number of seeds in algorithms with multivariate recurrence properties (e.g., banjori) or by using a dynamic list of seeds (e.g., bedep). Another technique to stop malware from using DGAs is to intercept DNS queries on a network and predict whether domains are DGA generated. Such a technique will alert network administrators to the presence of malware on their networks. In addition, if the predictor can also accurately predict the family of DGAs, then network administrators can also be alerted to the type of malware that is on their networks. This paper presents a DGA classifier that leverages long short-term memory (LSTM) networks to predict DGAs and their respective families without the need for a priori feature extraction. Results are significantly better than state-of-the-art techniques, providing 0.9993 area under the receiver operating characteristic curve for binary classification and a micro-averaged F1 score of 0.9906. In other terms, the LSTM technique can provide a 90% detection rate with a 1:10000 false positive (FP) rate---a twenty times FP improvement over comparable methods. Experiments in this paper are run on open datasets and code snippets are provided to reproduce the results.
from cs.AI updates on arXiv.org http://ift.tt/2f6AoOJ
via IFTTT
Quantile Reinforcement Learning. (arXiv:1611.00862v1 [cs.LG])
In reinforcement learning, the standard criterion to evaluate policies in a state is the expectation of (discounted) sum of rewards. However, this criterion may not always be suitable, we consider an alternative criterion based on the notion of quantiles. In the case of episodic reinforcement learning problems, we propose an algorithm based on stochastic approximation with two timescales. We evaluate our proposition on a simple model of the TV show, Who wants to be a millionaire.
from cs.AI updates on arXiv.org http://ift.tt/2fhzt0F
via IFTTT
Extracting Actionability from Machine Learning Models by Sub-optimal Deterministic Planning. (arXiv:1611.00873v1 [cs.AI])
A main focus of machine learning research has been improving the generalization accuracy and efficiency of prediction models. Many models such as SVM, random forest, and deep neural nets have been proposed and achieved great success. However, what emerges as missing in many applications is actionability, i.e., the ability to turn prediction results into actions. For example, in applications such as customer relationship management, clinical prediction, and advertisement, the users need not only accurate prediction, but also actionable instructions which can transfer an input to a desirable goal (e.g., higher profit repays, lower morbidity rates, higher ads hit rates). Existing effort in deriving such actionable knowledge is few and limited to simple action models which restricted to only change one attribute for each action. The dilemma is that in many real applications those action models are often more complex and harder to extract an optimal solution.
In this paper, we propose a novel approach that achieves actionability by combining learning with planning, two core areas of AI. In particular, we propose a framework to extract actionable knowledge from random forest, one of the most widely used and best off-the-shelf classifiers. We formulate the actionability problem to a sub-optimal action planning (SOAP) problem, which is to find a plan to alter certain features of a given input so that the random forest would yield a desirable output, while minimizing the total costs of actions. Technically, the SOAP problem is formulated in the SAS+ planning formalism, and solved using a Max-SAT based approach. Our experimental results demonstrate the effectiveness and efficiency of the proposed approach on a personal credit dataset and other benchmarks. Our work represents a new application of automated planning on an emerging and challenging machine learning paradigm.
from cs.AI updates on arXiv.org http://ift.tt/2f6AA0u
via IFTTT
Maximizing Investment Value of Small-Scale PV in a Smart Grid Environment. (arXiv:1611.00890v1 [math.OC])
Determining the optimal size and orientation of small-scale residential based PV arrays will become increasingly complex in the future smart grid environment with the introduction of smart meters and dynamic tariffs. However consumers can leverage the availability of smart meter data to conduct a more detailed exploration of PV investment options for their particular circumstances. In this paper, an optimization method for PV orientation and sizing is proposed whereby maximizing the PV investment value is set as the defining objective. Solar insolation and PV array models are described to form the basis of the PV array optimization strategy. A constrained particle swarm optimization algorithm is selected due to its strong performance in non-linear applications. The optimization algorithm is applied to real-world metered data to quantify the possible investment value of a PV installation under different energy retailers and tariff structures. The arrangement with the highest value is determined to enable prospective small-scale PV investors to select the most cost-effective system.
from cs.AI updates on arXiv.org http://ift.tt/2fhEYfZ
via IFTTT
Probabilistic Modeling of Progressive Filtering. (arXiv:1611.01080v1 [cs.AI])
Progressive filtering is a simple way to perform hierarchical classification, inspired by the behavior that most humans put into practice while attempting to categorize an item according to an underlying taxonomy. Each node of the taxonomy being associated with a different category, one may visualize the categorization process by looking at the item going downwards through all the nodes that accept it as belonging to the corresponding category. This paper is aimed at modeling the progressive filtering technique from a probabilistic perspective, in a hierarchical text categorization setting. As a result, the designer of a system based on progressive filtering should be facilitated in the task of devising, training, and testing it.
from cs.AI updates on arXiv.org http://ift.tt/2f6Aeag
via IFTTT
Long-term causal effects via behavioral game theory. (arXiv:1501.02315v7 [stat.ME] UPDATED)
Planned experiments are the gold standard in reliably comparing the causal effect of switching from a baseline policy to a new policy. One critical shortcoming of classical experimental methods, however, is that they typically do not take into account the dynamic nature of response to policy changes. For instance, in an experiment where we seek to understand the effects of a new ad pricing policy on auction revenue, agents may adapt their bidding in response to the experimental pricing changes. Thus, causal effects of the new pricing policy after such adaptation period, the {\em long-term causal effects}, are not captured by the classical methodology even though they clearly are more indicative of the value of the new policy. Here, we formalize a framework to define and estimate long-term causal effects of policy changes in multiagent economies. Central to our approach is behavioral game theory, which we leverage to formulate the ignorability assumptions that are necessary for causal inference. Under such assumptions we estimate long-term causal effects through a latent space approach, where a behavioral model of how agents act conditional on their latent behaviors is combined with a temporal model of how behaviors evolve over time.
from cs.AI updates on arXiv.org http://ift.tt/1AK82il
via IFTTT
Surprising properties of dropout in deep networks. (arXiv:1602.04484v4 [cs.LG] UPDATED)
We analyze dropout in deep networks with rectified linear units and the quadratic loss. Our results expose surprising differences between the behavior of dropout and more traditional regularizers like weight decay. For example, on some simple data sets dropout training produces negative weights even though the output is the sum of the inputs. This provides a counterpoint to the suggestion that dropout discourages co-adaptation of weights. We also show that the dropout penalty can grow exponentially in the depth of the network while the weight-decay penalty remains essentially linear, and that dropout is insensitive to various re-scalings of the input features, outputs, and network weights. This last insensitivity implies that there are no isolated local minima of the dropout training criterion. Our work uncovers new properties of dropout, extends our understanding of why dropout succeeds, and lays the foundation for further progress.
from cs.AI updates on arXiv.org http://ift.tt/1KSFax2
via IFTTT
Analyzing Games with Ambiguous Player Types using the ${\rm MINthenMAX}$ Decision Model. (arXiv:1603.01524v3 [cs.GT] UPDATED)
In many common interactive scenarios, participants lack information about other participants, and specifically about the preferences of other participants. In this work, we model an extreme case of incomplete information, which we term games with type ambiguity, where a participant lacks even information enabling him to form a belief on the preferences of others. Under type ambiguity, one cannot analyze the scenario using the commonly used Bayesian framework, and therefore he needs to model the participants using a different decision model.
In this work, we present the ${\rm MINthenMAX}$ decision model under ambiguity. This model is a refinement of Wald's MiniMax principle, which we show to be too coarse for games with type ambiguity. We characterize ${\rm MINthenMAX}$ as the finest refinement of the MiniMax principle that satisfies three properties we claim are necessary for games with type ambiguity. This prior-less approach we present her also follows the common practice in computer science of worst-case analysis.
Finally, we define and analyze the corresponding equilibrium concept assuming all players follow ${\rm MINthenMAX}$. We demonstrate this equilibrium by applying it to two common economic scenarios: coordination games and bilateral trade. We show that in both scenarios, an equilibrium in pure strategies always exists and we analyze the equilibria.
from cs.AI updates on arXiv.org http://ift.tt/1LKDCWt
via IFTTT
DeepDGA: Adversarially-Tuned Domain Generation and Detection. (arXiv:1610.01969v1 [cs.CR] CROSS LISTED)
Many malware families utilize domain generation algorithms (DGAs) to establish command and control (C&C) connections. While there are many methods to pseudorandomly generate domains, we focus in this paper on detecting (and generating) domains on a per-domain basis which provides a simple and flexible means to detect known DGA families. Recent machine learning approaches to DGA detection have been successful on fairly simplistic DGAs, many of which produce names of fixed length. However, models trained on limited datasets are somewhat blind to new DGA variants.
In this paper, we leverage the concept of generative adversarial networks to construct a deep learning based DGA that is designed to intentionally bypass a deep learning based detector. In a series of adversarial rounds, the generator learns to generate domain names that are increasingly more difficult to detect. In turn, a detector model updates its parameters to compensate for the adversarially generated domains. We test the hypothesis of whether adversarially generated domains may be used to augment training sets in order to harden other machine learning models against yet-to-be-observed DGAs. We detail solutions to several challenges in training this character-based generative adversarial network (GAN). In particular, our deep learning architecture begins as a domain name auto-encoder (encoder + decoder) trained on domains in the Alexa one million. Then the encoder and decoder are reassembled competitively in a generative adversarial network (detector + generator), with novel neural architectures and training strategies to improve convergence.
from cs.AI updates on arXiv.org http://ift.tt/2f6yjm5
via IFTTT
Google Linking Anonymous Browser Tracking with Identifiable Tracking
from Google Alert - anonymous http://ift.tt/2f6t45H
via IFTTT
Someone is Using Mirai Botnet to Shut Down Internet for an Entire Country
from The Hacker News http://ift.tt/2f5Fgnd
via IFTTT
Ravens: Terrell Suggs tells his younger teammates about rivalry with the Steelers - "These games will define you" (ESPN)
via IFTTT
Ravens: WR Steve Smith Sr. (ankle) in doubt for Sunday vs. Steelers after not practicing Thursday; out since Oct. 9 (ESPN)
via IFTTT
Limitations and Alternatives for the Evaluation of Large-scale Link Prediction. (arXiv:1611.00547v1 [cs.SI])
Link prediction, the problem of identifying missing links among a set of inter-related data entities, is a popular field of research due to its application to graph-like domains. Producing consistent evaluations of the performance of the many link prediction algorithms being proposed can be challenging due to variable graph properties, such as size and density. In this paper we first discuss traditional data mining solutions which are applicable to link prediction evaluation, arguing about their capacity for producing faithful and useful evaluations. We also introduce an innovative modification to a traditional evaluation methodology with the goal of adapting it to the problem of evaluating link prediction algorithms when applied to large graphs, by tackling the problem of class imbalance. We empirically evaluate the proposed methodology and, building on these findings, make a case for its importance on the evaluation of large-scale graph processing.
from cs.AI updates on arXiv.org http://ift.tt/2eBxf8V
via IFTTT
Chi d'amor non vuol le pene (Anonymous)
from Google Alert - anonymous http://ift.tt/2ffJcEZ'amor_non_vuol_le_pene_(Anonymous)&ct=ga&cd=CAIyGjgxMzAxNTQ0ZWE3M2NhMmQ6Y29tOmVuOlVT&usg=AFQjCNETxFuDQtnN_2uvyrqHBwW__xSg4w
via IFTTT
ISS Daily Summary Report – 11/02/2016
from ISS On-Orbit Status Report http://ift.tt/2ehTLma
via IFTTT
Hundreds Of Operations Canceled After Malware Hacks Hospitals Systems
from The Hacker News http://ift.tt/2eXHg3c
via IFTTT
Anonymous user f578cd
from Google Alert - anonymous http://ift.tt/2eXGMKF
via IFTTT
Critical Flaws in MySQL Give Hackers Root Access to Server (Exploits Released)
from The Hacker News http://ift.tt/2ff1gws
via IFTTT
Is it possible for people taking my jotform survey to remain anonymous?
from Google Alert - anonymous http://ift.tt/2egqkkL
via IFTTT
Anonymous And Met Police In Fierce War Of Words Over Million Mask March
from Google Alert - anonymous http://ift.tt/2fGK5ag
via IFTTT
I have a new follower on Twitter
Spiral.ac
Challenge every student! Spiral provides FREE tools for classroom-based collaborative learning with 1:1 devices. Get it here: https://t.co/BtlYquZ8DY
London
https://t.co/jhg8OifGTz
Following: 1745 - Followers: 2404
November 03, 2016 at 01:59AM via Twitter http://twitter.com/SpiralEducation
Yearly Arctic Sea Ice Age with Graph of Ice Age by Area: 1984 - 2016
from NASA's Scientific Visualization Studio: Most Popular
via IFTTT
Wednesday, November 2, 2016
I have a new follower on Twitter
Josh Luke
Gen X dude who wears socks with sandals. CEO, Healthcare futurist, #Alzheimers champ, #readmission guru, Family man, Author, Speaker. Enjoy hairbands & baseball
So Cal - USC Faculty
https://t.co/tN62ro9eWL
Following: 6582 - Followers: 6444
November 02, 2016 at 09:59PM via Twitter http://twitter.com/JoshLuke4Health
Bots as Virtual Confederates: Design and Ethics. (arXiv:1611.00447v1 [cs.CY])
The use of bots as virtual confederates in online field experiments holds extreme promise as a new methodological tool in computational social science. However, this potential tool comes with inherent ethical challenges. Informed consent can be difficult to obtain in many cases, and the use of confederates necessarily implies the use of deception. In this work we outline a design space for bots as virtual confederates, and we propose a set of guidelines for meeting the status quo for ethical experimentation. We draw upon examples from prior work in the CSCW community and the broader social science literature for illustration. While a handful of prior researchers have used bots in online experimentation, our work is meant to inspire future work in this area and raise awareness of the associated ethical issues.
from cs.AI updates on arXiv.org http://ift.tt/2fekWk5
via IFTTT
Natural-Parameter Networks: A Class of Probabilistic Neural Networks. (arXiv:1611.00448v1 [cs.LG])
Neural networks (NN) have achieved state-of-the-art performance in various applications. Unfortunately in applications where training data is insufficient, they are often prone to overfitting. One effective way to alleviate this problem is to exploit the Bayesian approach by using Bayesian neural networks (BNN). Another shortcoming of NN is the lack of flexibility to customize different distributions for the weights and neurons according to the data, as is often done in probabilistic graphical models. To address these problems, we propose a class of probabilistic neural networks, dubbed natural-parameter networks (NPN), as a novel and lightweight Bayesian treatment of NN. NPN allows the usage of arbitrary exponential-family distributions to model the weights and neurons. Different from traditional NN and BNN, NPN takes distributions as input and goes through layers of transformation before producing distributions to match the target output distributions. As a Bayesian treatment, efficient backpropagation (BP) is performed to learn the natural parameters for the distributions over both the weights and neurons. The output distributions of each layer, as byproducts, may be used as second-order representations for the associated tasks such as link prediction. Experiments on real-world datasets show that NPN can achieve state-of-the-art performance.
from cs.AI updates on arXiv.org http://ift.tt/2fjlW5p
via IFTTT
Collaborative Recurrent Autoencoder: Recommend while Learning to Fill in the Blanks. (arXiv:1611.00454v1 [cs.LG])
Hybrid methods that utilize both content and rating information are commonly used in many recommender systems. However, most of them use either handcrafted features or the bag-of-words representation as a surrogate for the content information but they are neither effective nor natural enough. To address this problem, we develop a collaborative recurrent autoencoder (CRAE) which is a denoising recurrent autoencoder (DRAE) that models the generation of content sequences in the collaborative filtering (CF) setting. The model generalizes recent advances in recurrent deep learning from i.i.d. input to non-i.i.d. (CF-based) input and provides a new denoising scheme along with a novel learnable pooling scheme for the recurrent autoencoder. To do this, we first develop a hierarchical Bayesian model for the DRAE and then generalize it to the CF setting. The synergy between denoising and CF enables CRAE to make accurate recommendations while learning to fill in the blanks in sequences. Experiments on real-world datasets from different domains (CiteULike and Netflix) show that, by jointly modeling the order-aware generation of sequences for the content information and performing CF for the ratings, CRAE is able to significantly outperform the state of the art on both the recommendation task based on ratings and the sequence generation task based on content information.
from cs.AI updates on arXiv.org http://ift.tt/2fggeCJ
via IFTTT
An application of incomplete pairwise comparison matrices for ranking top tennis players. (arXiv:1611.00538v1 [cs.AI])
Pairwise comparison is an important tool in multi-attribute decision making. Pairwise comparison matrices (PCM) have been applied for ranking criteria and for scoring alternatives according to a given criterion. Our paper presents a special application of incomplete PCMs: ranking of professional tennis players based on their results against each other. The selected 25 players have been on the top of the ATP rankings for a shorter or longer period in the last 40 years. Some of them have never met on the court. One of the aims of the paper is to provide ranking of the selected players, however, the analysis of incomplete pairwise comparison matrices is also in the focus. The eigenvector method and the logarithmic least squares method were used to calculate weights from incomplete PCMs. In our results the top three players of four decades were Nadal, Federer and Sampras. Some questions have been raised on the properties of incomplete PCMs and remains open for further investigation.
from cs.AI updates on arXiv.org http://ift.tt/2feiVEn
via IFTTT
Inferring Coupling of Distributed Dynamical Systems via Transfer Entropy. (arXiv:1611.00549v1 [cs.AI])
In this work, we are interested in structure learning for a set of spatially distributed dynamical systems, where individual subsystems are coupled via latent variables and observed through a filter. We represent this model as a directed acyclic graph (DAG) that characterises the unidirectional coupling between subsystems. Standard approaches to structure learning are not applicable in this framework due to the hidden variables, however we can exploit the properties of certain dynamical systems to formulate exact methods based on state space reconstruction. We approach the problem by using reconstruction theorems to analytically derive a tractable expression for the KL-divergence of a candidate DAG from the observed dataset. We show this measure can be decomposed as a function of two information-theoretic measures, transfer entropy and stochastic interaction. We then present two mathematically robust scoring functions based on transfer entropy and statistical independence tests. These results support the previously held conjecture that transfer entropy can be used to infer effective connectivity in complex networks.
from cs.AI updates on arXiv.org http://ift.tt/2fx3YBf
via IFTTT
Strong Neutrosophic Graphs and Subgraph Topological Subspaces. (arXiv:1611.00576v1 [cs.AI])
In this book authors for the first time introduce the notion of strong neutrosophic graphs. They are very different from the usual graphs and neutrosophic graphs. Using these new structures special subgraph topological spaces are defined. Further special lattice graph of subgraphs of these graphs are defined and described. Several interesting properties using subgraphs of a strong neutrosophic graph are obtained. Several open conjectures are proposed. These new class of strong neutrosophic graphs will certainly find applications in Neutrosophic Cognitive Maps (NCM), Neutrosophic Relational Maps (NRM) and Neutrosophic Relational Equations (NRE) with appropriate modifications.
from cs.AI updates on arXiv.org http://ift.tt/2fegcLm
via IFTTT
The new hybrid COAW method for solving multi-objective problems. (arXiv:1611.00577v1 [cs.NE])
In this article using Cuckoo Optimization Algorithm and simple additive weighting method the hybrid COAW algorithm is presented to solve multi-objective problems. Cuckoo algorithm is an efficient and structured method for solving nonlinear continuous problems. The created Pareto frontiers of the COAW proposed algorithm are exact and have good dispersion. This method has a high speed in finding the Pareto frontiers and identifies the beginning and end points of Pareto frontiers properly. In order to validation the proposed algorithm, several experimental problems were analyzed. The results of which indicate the proper effectiveness of COAW algorithm for solving multi-objective problems.
from cs.AI updates on arXiv.org http://ift.tt/2fx3Wt7
via IFTTT
TorchCraft: a Library for Machine Learning Research on Real-Time Strategy Games. (arXiv:1611.00625v1 [cs.LG])
We present TorchCraft, an open-source library that enables deep learning research on Real-Time Strategy (RTS) games such as StarCraft: Brood War, by making it easier to control these games from a machine learning framework, here Torch. This white paper argues for using RTS games as a benchmark for AI research, and describes the design and components of TorchCraft.
from cs.AI updates on arXiv.org http://ift.tt/2fegd1Q
via IFTTT
A Framework for Searching for General Artificial Intelligence. (arXiv:1611.00685v1 [cs.AI])
There is a significant lack of unified approaches to building generally intelligent machines. The majority of current artificial intelligence research operates within a very narrow field of focus, frequently without considering the importance of the 'big picture'. In this document, we seek to describe and unify principles that guide the basis of our development of general artificial intelligence. These principles revolve around the idea that intelligence is a tool for searching for general solutions to problems. We define intelligence as the ability to acquire skills that narrow this search, diversify it and help steer it to more promising areas. We also provide suggestions for studying, measuring, and testing the various skills and abilities that a human-level intelligent machine needs to acquire. The document aims to be both implementation agnostic, and to provide an analytic, systematic, and scalable way to generate hypotheses that we believe are needed to meet the necessary conditions in the search for general artificial intelligence. We believe that such a framework is an important stepping stone for bringing together definitions, highlighting open problems, connecting researchers willing to collaborate, and for unifying the arguably most significant search of this century.
from cs.AI updates on arXiv.org http://ift.tt/2fwXYbS
via IFTTT
Extensions and Limitations of the Neural GPU. (arXiv:1611.00736v1 [cs.NE])
The Neural GPU is a recent model that can learn algorithms such as multi-digit binary addition and binary multiplication in a way that generalizes to inputs of arbitrary length. We show that there are two simple ways of improving the performance of the Neural GPU: by carefully designing a curriculum, and by increasing model size. The latter requires careful memory management, as a naive implementation of the Neural GPU is memory intensive. We find that these techniques to increase the set of algorithmic problems that can be solved by the Neural GPU: we have been able to learn to perform all the arithmetic operations (and generalize to arbitrarily long numbers) when the arguments are given in the decimal representation (which, surprisingly, has not been possible before). We have also been able to train the Neural GPU to evaluate long arithmetic expressions with multiple operands that require respecting the precedence order of the operands, although these have succeeded only in their binary representation, and not with 100\% accuracy.
In addition, we attempt to gain insight into the Neural GPU by understanding its failure modes. We find that Neural GPUs that correctly generalize to arbitrarily long numbers still fail to compute the correct answer on highly-symmetric, atypical inputs: for example, a Neural GPU that achieves near-perfect generalization on decimal multiplication of up to 100-digit long numbers can fail on $000000\dots002 \times 000000\dots002$ while succeeding at $2 \times 2$. These failure modes are reminiscent of adversarial examples.
from cs.AI updates on arXiv.org http://ift.tt/2fek8LZ
via IFTTT
Building Machines That Learn and Think Like People. (arXiv:1604.00289v3 [cs.AI] UPDATED)
Recent progress in artificial intelligence (AI) has renewed interest in building systems that learn and think like people. Many advances have come from using deep neural networks trained end-to-end in tasks such as object recognition, video games, and board games, achieving performance that equals or even beats humans in some respects. Despite their biological inspiration and performance achievements, these systems differ from human intelligence in crucial ways. We review progress in cognitive science suggesting that truly human-like learning and thinking machines will have to reach beyond current engineering trends in both what they learn, and how they learn it. Specifically, we argue that these machines should (a) build causal models of the world that support explanation and understanding, rather than merely solving pattern recognition problems; (b) ground learning in intuitive theories of physics and psychology, to support and enrich the knowledge that is learned; and (c) harness compositionality and learning-to-learn to rapidly acquire and generalize knowledge to new tasks and situations. We suggest concrete challenges and promising routes towards these goals that can combine the strengths of recent neural network advances with more structured cognitive models.
from cs.AI updates on arXiv.org http://ift.tt/223IhEY
via IFTTT
Know Your Anonymous Audience
from Google Alert - anonymous http://ift.tt/2eeOBHJ
via IFTTT
I have a new follower on Twitter
Jason Reid
Jason M. Reid, Esq. Board Certified Criminal Trial Expert, DUI attorney, injury attorney, and amateur sportswriter.
Bradenton, FL
http://t.co/ZLyDU8mBFz
Following: 12968 - Followers: 14474
November 02, 2016 at 01:44PM via Twitter http://twitter.com/attysportwriter
19-Year-Old Teenage Hacker Behind DDoS-for-Hire Service Pleads Guilty
from The Hacker News http://ift.tt/2fEJ6XX
via IFTTT
Ravens: WR Steve Smith (ankle), LB Elvis Dumervil (foot) not practicing Wednesday; LB C.J. Mosley (hamstring) returns (ESPN)
via IFTTT
[FD] Disclose [10 * cve] in Exponent CMS
Source: Gmail -> IFTTT-> Blogger
[FD] MSIE 11 MSHTML CView::CalculateImageImmunity use-after-free details
Source: Gmail -> IFTTT-> Blogger
Anonymous Mouse
from Google Alert - anonymous http://ift.tt/2e2dr2q
via IFTTT
I have a new follower on Twitter
Michael Semer
Providing #Branding | #ContentMarketing | #ContentWriting | #Copywriting | #InboundMarketing | #MarketingStrategy and more for agencies and brands alike.
Casa de Kiki, BevHills, CA
http://t.co/f0QdjbdlbH
Following: 4772 - Followers: 5007
November 02, 2016 at 10:54AM via Twitter http://twitter.com/michaelsemer
FSHISD rolls out new anonymous alerts tool
from Google Alert - anonymous http://ift.tt/2fcDMb8
via IFTTT
ISS Daily Summary Report – 11/01/2016
from ISS On-Orbit Status Report http://ift.tt/2fE6KUL
via IFTTT
Integrate with anonymous log-in module
from Google Alert - anonymous http://ift.tt/2ezvrNM
via IFTTT
Multiple Critical Remotely Exploitable Flaws Discovered in Memcached Caching System
from The Hacker News http://ift.tt/2emR1aq
via IFTTT
Microsoft Says Russian Hackers Using Unpatched Windows Bug Disclosed by Google
from The Hacker News http://ift.tt/2ecQtRs
via IFTTT
Simplifying SSH keys and SSL Certs Management across the Enterprise using Key Manager Plus
from The Hacker News http://ift.tt/2e11oSL
via IFTTT
Arp 299: Black Holes in Colliding Galaxies
I have a new follower on Twitter
Andrew Thomas
Co-Founder & CRO of SkyBell. Writer at Inc, Forbes, HuffPo. #IoT & Crowdfunding Expert. Advisor & Speaker. YEC. USC. Snapchat: ibeapt
San Francisco, CA
https://t.co/gj15v3Xby1
Following: 3486 - Followers: 3941
November 02, 2016 at 12:04AM via Twitter http://twitter.com/apthomas
Tuesday, November 1, 2016
I have a new follower on Twitter
Marty Loughlin
Smart #datalake - #semantic #bigdata #fintech #analytics #hadoop #spark @CamSemantics Family, F1, Soccer, fast cars, cooking, cycling; Married to @marialoughlin
Boston, MA (from Dublin, Ire)
https://t.co/ILJHVSwKay
Following: 12107 - Followers: 15088
November 01, 2016 at 11:24PM via Twitter http://twitter.com/mloughlin
I have a new follower on Twitter
Chris Gadek
Head of Marketing | Growth @Doorman. Dandy. Rockstar lookalike. Full stack marketer. Data science nerd.
San Francisco, CA
https://t.co/Y4HPcGOfDr
Following: 9222 - Followers: 13348
November 01, 2016 at 08:54PM via Twitter http://twitter.com/dappermarketer
I have a new follower on Twitter
Internet Billboards
Official Twitter account for Internet Billboards. The Web Curated. Content #Curator's. #curation services. Hello, I am the founder Tom George. Follow US!
USA
https://t.co/ZnJMi4Q0gT
Following: 15862 - Followers: 19700
November 01, 2016 at 08:54PM via Twitter http://twitter.com/netbillboards
[FD] Microsoft Internet Explorer 9 MSHTML CAttrArray use-after-free details
Source: Gmail -> IFTTT-> Blogger
[FD] CVE-2016-8580 - Alienvault OSSIM/USM Object Injection Vulnerability
Source: Gmail -> IFTTT-> Blogger
[FD] CVE-2016-8581 - Alienvault OSSIM/USM Stored XSS Vulnerability
Source: Gmail -> IFTTT-> Blogger
Neural Symbolic Machines: Learning Semantic Parsers on Freebase with Weak Supervision. (arXiv:1611.00020v1 [cs.CL])
Extending the success of deep neural networks to natural language understanding and symbolic reasoning requires complex operations and external memory. Recent neural program induction approaches have attempted to address this problem, but are typically limited to differentiable memory, and consequently cannot scale beyond small synthetic tasks. In this work, we propose the Manager-Programmer-Computer framework, which integrates neural networks with non-differentiable memory to support abstract, scalable and precise operations through a friendly neural computer interface. Specifically, we introduce a Neural Symbolic Machine, which contains a sequence-to-sequence neural "programmer", and a non-differentiable "computer" that is a Lisp interpreter with code assist. To successfully apply REINFORCE for training, we augment it with approximate gold programs found by an iterative maximum likelihood training process. NSM is able to learn a semantic parser from weak supervision over a large knowledge base. It achieves new state-of-the-art performance on WebQuestionsSP, a challenging semantic parsing dataset, with weak supervision. Compared to previous approaches, NSM is end-to-end, therefore does not rely on feature engineering or domain specific knowledge.
from cs.AI updates on arXiv.org http://ift.tt/2eZ8KDc
via IFTTT
Learning recurrent representations for hierarchical behavior modeling. (arXiv:1611.00094v1 [cs.AI])
We propose a framework for detecting action patterns from motion sequences and modeling the sensory-motor relationship of animals, using a generative recurrent neural network. The network has a discriminative part (classifying actions) and a generative part (predicting motion), whose recurrent cells are laterally connected, allowing higher levels of the network to represent high level phenomena. We test our framework on two types of data, fruit fly behavior and online handwriting. Our results show that 1) taking advantage of unlabeled sequences, by predicting future motion, significantly improves action detection performance when training labels are scarce, 2) the network learns to represent high level phenomena such as writer identity and fly gender, without supervision, and 3) simulated motion trajectories, generated by treating motion prediction as input to the network, look realistic and may be used to qualitatively evaluate whether the model has learnt generative control rules.
from cs.AI updates on arXiv.org http://ift.tt/2ebHXSA
via IFTTT
Robust Spectral Inference for Joint Stochastic Matrix Factorization. (arXiv:1611.00175v1 [cs.LG])
Spectral inference provides fast algorithms and provable optimality for latent topic analysis. But for real data these algorithms require additional ad-hoc heuristics, and even then often produce unusable results. We explain this poor performance by casting the problem of topic inference in the framework of Joint Stochastic Matrix Factorization (JSMF) and showing that previous methods violate the theoretical conditions necessary for a good solution to exist. We then propose a novel rectification method that learns high quality topics and their interactions even on small, noisy data. This method achieves results comparable to probabilistic techniques in several domains while maintaining scalability and provable optimality.
from cs.AI updates on arXiv.org http://ift.tt/2f7Z9Ny
via IFTTT
Local Subspace-Based Outlier Detection using Global Neighbourhoods. (arXiv:1611.00183v1 [cs.AI])
Outlier detection in high-dimensional data is a challenging yet important task, as it has applications in, e.g., fraud detection and quality control. State-of-the-art density-based algorithms perform well because they 1) take the local neighbourhoods of data points into account and 2) consider feature subspaces. In highly complex and high-dimensional data, however, existing methods are likely to overlook important outliers because they do not explicitly take into account that the data is often a mixture distribution of multiple components.
We therefore introduce GLOSS, an algorithm that performs local subspace outlier detection using global neighbourhoods. Experiments on synthetic data demonstrate that GLOSS more accurately detects local outliers in mixed data than its competitors. Moreover, experiments on real-world data show that our approach identifies relevant outliers overlooked by existing methods, confirming that one should keep an eye on the global perspective even when doing local outlier detection.
from cs.AI updates on arXiv.org http://ift.tt/2eZ8swm
via IFTTT
Towards Lifelong Self-Supervision: A Deep Learning Direction for Robotics. (arXiv:1611.00201v1 [cs.RO])
Despite outstanding success in vision amongst other domains, many of the recent deep learning approaches have evident drawbacks for robots. This manuscript surveys recent work in the literature that pertain to applying deep learning systems to the robotics domain, either as means of estimation or as a tool to resolve motor commands directly from raw percepts. These recent advances are only a piece to the puzzle. We suggest that deep learning as a tool alone is insufficient in building a unified framework to acquire general intelligence. For this reason, we complement our survey with insights from cognitive development and refer to ideas from classical control theory, producing an integrated direction for a lifelong learning architecture.
from cs.AI updates on arXiv.org http://ift.tt/2f7ZZcR
via IFTTT
Towards Blended Reactive Planning and Acting using Behavior Trees. (arXiv:1611.00230v1 [cs.RO])
In this paper, we study the problem of using a planning algorithm to automatically create and update a Behavior Tree (BT), controlling a robot in a dynamic environment. Exploiting the characteristic of BTs, in terms of modularity and reactivity, the robot continually acts and plans to achieve a given goal using a set of abstract actions and conditions. The construction of the BT is based on an extension of the Hybrid Backward-Forward algorithm (HBF) that allows us to refine the acting process by mapping the descriptive models onto operational models of actions, thus integrating the ability of planning in infinite state space of HBF with the continuous modular reactive action execution of BTs. We believe that this might be a first step to address the recently raised open challenge in automated planning: the need of a hierarchical structure and a continuous online planning and acting framework. We prove the convergence of the proposed approach as well as the absence of deadlocks and livelocks, and we illustrate our approach in two different robotics scenarios.
from cs.AI updates on arXiv.org http://ift.tt/2eZcqEZ
via IFTTT
Detecting Affordances by Visuomotor Simulation. (arXiv:1611.00274v1 [cs.AI])
The term "affordance" denotes the behavioral meaning of objects. We propose a cognitive architecture for the detection of affordances in the visual modality. This model is based on the internal simulation of movement sequences. For each movement step, the resulting sensory state is predicted by a forward model, which in turn triggers the generation of a new (simulated) motor command by an inverse model. Thus, a series of mental images in the sensory and in the motor domain is evoked. Starting from a real sensory state, a large number of such sequences is simulated in parallel. Final affordance detection is based on the generated motor commands. We apply this model to a real-world mobile robot which is faced with obstacle arrangements some of which are passable (corridor) and some of which are not (dead ends). The robot's task is to detect the right affordance ("pass-through-able" or "non-pass-through-able"). The required internal models are acquired in a hierarchical training process. Afterwards, the robotic agent is able to distinguish reliably between corridors and dead ends. This real-world result enhances the validity of the proposed mental simulation approach. In addition, we compare several key factors in the simulation process regarding performance and efficiency.
from cs.AI updates on arXiv.org http://ift.tt/2f83fFd
via IFTTT
Using Artificial Intelligence to Identify State Secrets. (arXiv:1611.00356v1 [cs.AI])
Whether officials can be trusted to protect national security information has become a matter of great public controversy, reigniting a long-standing debate about the scope and nature of official secrecy. The declassification of millions of electronic records has made it possible to analyze these issues with greater rigor and precision. Using machine-learning methods, we examined nearly a million State Department cables from the 1970s to identify features of records that are more likely to be classified, such as international negotiations, military operations, and high-level communications. Even with incomplete data, algorithms can use such features to identify 90% of classified cables with <11% false positives. But our results also show that there are longstanding problems in the identification of sensitive information. Error analysis reveals many examples of both overclassification and underclassification. This indicates both the need for research on inter-coder reliability among officials as to what constitutes classified material and the opportunity to develop recommender systems to better manage both classification and declassification.
from cs.AI updates on arXiv.org http://ift.tt/2eZ8DYe
via IFTTT
Separating Sets of Strings by Finding Matching Patterns is Almost Always Hard. (arXiv:1604.03243v2 [cs.CC] UPDATED)
We study the complexity of the problem of searching for a set of patterns that separate two given sets of strings. This problem has applications in a wide variety of areas, most notably in data mining, computational biology, and in understanding the complexity of genetic algorithms. We show that the basic problem of finding a small set of patterns that match one set of strings but do not match any string in a second set is difficult (NP-complete, W[2]-hard when parameterized by the size of the pattern set, and APX-hard). We then perform a detailed parameterized analysis of the problem, separating tractable and intractable variants. In particular we show that parameterizing by the size of pattern set and the number of strings, and the size of the alphabet and the number of strings give FPT results, amongst others.
from cs.AI updates on arXiv.org http://ift.tt/1VkQl5g
via IFTTT
Hadamard Product for Low-rank Bilinear Pooling. (arXiv:1610.04325v2 [cs.CV] UPDATED)
Bilinear models provide rich representations compared with linear models. They have been applied in various visual tasks, such as object recognition, segmentation, and visual question-answering, to get state-of-the-art performances taking advantage of the expanded representations. However, bilinear representations tend to be high-dimensional, limiting the applicability to computationally complex tasks. We propose low-rank bilinear pooling using Hadamard product for an efficient attention mechanism of multimodal learning. We show that our model outperforms compact bilinear pooling in visual question-answering tasks with the state-of-the-art results on the VQA dataset, having a better parsimonious property.
from cs.AI updates on arXiv.org http://ift.tt/2ed1inE
via IFTTT
[FD] CVE-2016-8582 - Alienvault OSSIM/USM SQL Injection Vulnerability
Source: Gmail -> IFTTT-> Blogger
[FD] CVE-2016-8583 - Alienvault OSSIM/USM Reflected XSS
Source: Gmail -> IFTTT-> Blogger
[FD] MySQL / MariaDB / PerconaDB - Privilege Escalation / Race Condition Exploit [CVE-2016-6663 / OCVE-2016-5616]
Source: Gmail -> IFTTT-> Blogger
User: anonymous is not authorized
from Google Alert - anonymous http://ift.tt/2eYZPBB
via IFTTT
One Way B2B Marketers Should be Using Website Traffic (But Aren't)
from Google Alert - anonymous http://ift.tt/2fC2jtk
via IFTTT
Ravens (3-4) up 1 spot to No. 20 in Week 9 NFL Power Rankings; next game Sunday vs. Steelers (4-3) (ESPN)
via IFTTT
[FD] Researchers Claim Wickr Patched Flaws but Didn't Pay Rewards
Source: Gmail -> IFTTT-> Blogger
The Hacker News (THN) Celebrates 6th Anniversary Today
from The Hacker News http://ift.tt/2fqq5ct
via IFTTT
New IoT Botnet Malware Discovered; Infecting More Devices Worldwide
from The Hacker News http://ift.tt/2fcyPOj
via IFTTT