Latest YouTube Video
Saturday, January 28, 2017
NFL Video: Lions K Matt Prater one-ups Ravens K Justin Tucker, boots 76-yard FG at Pro Bowl practice (ESPN)
via IFTTT
[FD] Persistent Cross-Site Scripting vulnerability in User Access Manager WordPress Plugin
Source: Gmail -> IFTTT-> Blogger
[FD] Multiple blind SQL injection vulnerabilities in FormBuilder WordPress Plugin
Source: Gmail -> IFTTT-> Blogger
[FD] Cross-Site Request Forgery vulnerability in FormBuilder WordPress Plugin allows plugin permissions modification
Source: Gmail -> IFTTT-> Blogger
Anonymous donor pays students' lunch debt
from Google Alert - anonymous http://ift.tt/2kE6u6q
via IFTTT
Police Arrest 5 Cyber Thieves Who Stole 3.2 Million From ATMs Using Malware
from The Hacker News http://ift.tt/2kx9RN9
via IFTTT
Google becomes its own Root Certificate Authority
from The Hacker News http://ift.tt/2kE6HdW
via IFTTT
Andrea Condividi (@EducateForYou) liked one of your Tweets!
Source: Gmail -> IFTTT-> Blogger
new support group - clutterers anonymous
from Google Alert - anonymous http://ift.tt/2jfEedZ
via IFTTT
I have a new follower on Twitter
Andrea Condividi
Promoting calls for paper (#CFP). Just to make sure that I do not miss anything :-) feel free to DM me if you have a #CFP to share.
Switzerland
https://t.co/HbgJnheHJK
Following: 335 - Followers: 190
January 28, 2017 at 12:49AM via Twitter http://twitter.com/EducateForYou
Friday, January 27, 2017
I have a new follower on Twitter
Brian Wood
I'm a reviewer of products on Amazon U.K. Click here to see my profile,. https://t.co/6e7i4BFi1d
Stockton-on-Tees, England
https://t.co/DRLF01hhFL
Following: 443 - Followers: 325
January 27, 2017 at 10:09PM via Twitter http://twitter.com/woodb180
Anonymous Peer Review Assignments also anonymous in SpeedGrader
from Google Alert - anonymous http://ift.tt/2kcLE1y
via IFTTT
Ravens: S Eric Weddle voted by teammates to be one of four captains for AFC's Pro Bowl team; was added to roster as an alternate (ESPN)
via IFTTT
[FD] Digital Ocean ssh key authentication security risk -- password authentication is re-enabled
Source: Gmail -> IFTTT-> Blogger
Facebook Adds FIDO U2F Security Keys Feature For Secure Logins
from The Hacker News http://ift.tt/2kaFiPR
via IFTTT
I have a new follower on Twitter
FullAI
FullAI is the world's first NGO advocating human decisions over machine decisions. Artificial Intelligence is not science fiction. #AI
Amsterdam, Nederland
https://t.co/IC2c2dy0Of
Following: 1531 - Followers: 516
January 27, 2017 at 11:24AM via Twitter http://twitter.com/FullArtIntel
ISS Daily Summary Report – 1/26/2017
from ISS On-Orbit Status Report http://ift.tt/2ksZNVw
via IFTTT
Breach Database Site 'LeakedSource' Goes Offline After Alleged Police Raid
from The Hacker News http://ift.tt/2kAaLMc
via IFTTT
Commercials
from Google Alert - anonymous http://ift.tt/2jY43MK
via IFTTT
I have a new follower on Twitter
Dr Morten Middelfart
Tampa, Florida
https://t.co/bpoICsyaBo
Following: 45578 - Followers: 54044
January 27, 2017 at 03:14AM via Twitter http://twitter.com/dr_morton_
I have a new follower on Twitter
SEO For Growth
SEO for Growth: The Ultimate Guide for Marketers, Web Designers & Entrepreneurs, a search engine optimization book by John Jantsch & Phil Singleton.
https://t.co/GRp3tyjskY
Following: 3458 - Followers: 3819
January 27, 2017 at 03:14AM via Twitter http://twitter.com/seoforgrowth
President Trump's @POTUS Twitter Linked To A Private Gmail Account
from The Hacker News http://ift.tt/2k9ZZvw
via IFTTT
NCIIPC: It's Time to Step Forward And Protect Our Critical Infrastructures from Cyber Attacks
from The Hacker News http://ift.tt/2k8rDbP
via IFTTT
Thursday, January 26, 2017
Logic Programming Petri Nets. (arXiv:1701.07657v1 [cs.AI])
With the purpose of modeling, specifying and reasoning in an integrated fashion with procedural and declarative aspects (both commonly present in cases or scenarios), the paper introduces Logic Programming Petri Nets (LPPN), an extension to the Petri Net notation providing an interface to logic programming constructs. Two semantics are presented. First, a hybrid operational semantics that separates the process component, treated with Petri nets, from the constraint/terminological component, treated with Answer Set Programming (ASP). Second, a denotational semantics maps the notation to ASP fully, via Event Calculus. These two alternative specifications enable a preliminary evaluation in terms of reasoning efficiency.
from cs.AI updates on arXiv.org http://ift.tt/2kqiI3n
via IFTTT
Identifying Consistent Statements about Numerical Data with Dispersion-Corrected Subgroup Discovery. (arXiv:1701.07696v1 [cs.AI])
Existing algorithms for subgroup discovery with numerical targets do not optimize the error or target variable dispersion of the groups they find. This often leads to unreliable or inconsistent statements about the data, rendering practical applications, especially in scientific domains, futile. Therefore, we here extend the optimistic estimator framework for optimal subgroup discovery to a new class of objective functions: we show how tight estimators can be computed efficiently for all functions that are determined by subgroup size (non-decreasing dependence), the subgroup median value, and a dispersion measure around the median (non-increasing dependence). In the important special case when dispersion is measured using the average absolute deviation from the median, this novel approach yields a linear time algorithm. Empirical evaluation on a wide range of datasets shows that, when used within branch-and-bound search, this approach is highly efficient and indeed discovers subgroups with much smaller errors.
from cs.AI updates on arXiv.org http://ift.tt/2k7s9XK
via IFTTT
Dynamic time warping distance for message propagation classification in Twitter. (arXiv:1701.07756v1 [cs.AI])
Social messages classification is a research domain that has attracted the attention of many researchers in these last years. Indeed, the social message is different from ordinary text because it has some special characteristics like its shortness. Then the development of new approaches for the processing of the social message is now essential to make its classification more efficient. In this paper, we are mainly interested in the classification of social messages based on their spreading on online social networks (OSN). We proposed a new distance metric based on the Dynamic Time Warping distance and we use it with the probabilistic and the evidential k Nearest Neighbors (k-NN) classifiers to classify propagation networks (PrNets) of messages. The propagation network is a directed acyclic graph (DAG) that is used to record propagation traces of the message, the traversed links and their types. We tested the proposed metric with the chosen k-NN classifiers on real world propagation traces that were collected from Twitter social network and we got good classification accuracies.
from cs.AI updates on arXiv.org http://ift.tt/2jkuwlI
via IFTTT
Ethical Considerations in Artificial Intelligence Courses. (arXiv:1701.07769v1 [cs.AI])
The recent surge in interest in ethics in artificial intelligence may leave many educators wondering how to address moral, ethical, and philosophical issues in their AI courses. As instructors we want to develop curriculum that not only prepares students to be artificial intelligence practitioners, but also to understand the moral, ethical, and philosophical impacts that artificial intelligence will have on society. In this article we provide practical case studies and links to resources for use by AI educators. We also provide concrete suggestions on how to integrate AI ethics into a general artificial intelligence course and how to teach a stand-alone artificial intelligence ethics course.
from cs.AI updates on arXiv.org http://ift.tt/2kq6AiC
via IFTTT
Ancestral Causal Inference. (arXiv:1606.07035v3 [cs.LG] UPDATED)
Constraint-based causal discovery from limited data is a notoriously difficult challenge due to the many borderline independence test decisions. Several approaches to improve the reliability of the predictions by exploiting redundancy in the independence information have been proposed recently. Though promising, existing approaches can still be greatly improved in terms of accuracy and scalability. We present a novel method that reduces the combinatorial explosion of the search space by using a more coarse-grained representation of causal information, drastically reducing computation time. Additionally, we propose a method to score causal predictions based on their confidence. Crucially, our implementation also allows one to easily combine observational and interventional data and to incorporate various types of available background knowledge. We prove soundness and asymptotic consistency of our method and demonstrate that it can outperform the state-of-the-art on synthetic data, achieving a speedup of several orders of magnitude. We illustrate its practical feasibility by applying it on a challenging protein data set.
from cs.AI updates on arXiv.org http://ift.tt/28RsdVY
via IFTTT
Improving Policy Gradient by Exploring Under-appreciated Rewards. (arXiv:1611.09321v2 [cs.LG] UPDATED)
This paper presents a novel form of policy gradient for model-free reinforcement learning (RL) with improved exploration properties. Current policy-based methods use entropy regularization to encourage undirected exploration of the reward landscape, which is ineffective in high dimensional spaces with sparse rewards. We propose a more directed exploration strategy that promotes exploration of under-appreciated reward regions. An action sequence is considered under-appreciated if its log-probability under the current policy under-estimates its resulting reward. The proposed exploration strategy is easy to implement, requiring small modifications to an implementation of the REINFORCE algorithm. We evaluate the approach on a set of algorithmic tasks that have long challenged RL methods. Our approach reduces hyper-parameter sensitivity and demonstrates significant improvements over baseline methods. Our algorithm successfully solves a benchmark multi-digit addition task and generalizes to long sequences. This is, to our knowledge, the first time that a pure RL method has solved addition using only reward feedback.
from cs.AI updates on arXiv.org http://ift.tt/2gA9tyq
via IFTTT
Dating / Relationship podcast seeks anonymous guests (audio only)
from Google Alert - anonymous http://ift.tt/2kyx195
via IFTTT
DuckDuckGo Celebrates 10 Billion Anonymous Searches
from Google Alert - anonymous http://ift.tt/2jCuEhJ
via IFTTT
[FD] Call for Papers: DigitalSec2017 in Kuala Lumpur, Malaysia on July 11-13, 2017
Source: Gmail -> IFTTT-> Blogger
Proposal: Convert anonymous objects to known types
from Google Alert - anonymous http://ift.tt/2kx4Q6q
via IFTTT
ISS Daily Summary Report – 1/25/2017
from ISS On-Orbit Status Report http://ift.tt/2k7x3Em
via IFTTT
I have a new follower on Twitter
McNeil
A Twitter account about nothing. Divorced. Dad Tweets for days. Browns Cavs Indians CBJ Buckeyes Miami RedHawks #LoveAndHonor
Granville, OH
https://t.co/aIaBFKwQat
Following: 31687 - Followers: 38958
January 26, 2017 at 03:42AM via Twitter http://twitter.com/Reflog_18
NFL Video: Justin Tucker boots 75-yard field goal that hooks inside upright during Pro Bowl practice (ESPN)
via IFTTT
Monitoring and Forecasting Chimpanzee Habitat Health in Africa
from NASA's Scientific Visualization Studio: Most Recent Items http://ift.tt/2jry4pA
via IFTTT
CATS studies volcanic plumes, wildfires, and hurricanes
from NASA's Scientific Visualization Studio: Most Recent Items http://ift.tt/2jzzfRJ
via IFTTT
Wednesday, January 25, 2017
Artificial Intelligence Approaches To UCAV Autonomy. (arXiv:1701.07103v1 [cs.AI])
This paper covers a number of approaches that leverage Artificial Intelligence algorithms and techniques to aid Unmanned Combat Aerial Vehicle (UCAV) autonomy. An analysis of current approaches to autonomous control is provided followed by an exploration of how these techniques can be extended and enriched with AI techniques including Artificial Neural Networks (ANN), Ensembling and Reinforcement Learning (RL) to evolve control strategies for UCAVs.
from cs.AI updates on arXiv.org http://ift.tt/2jTmfqM
via IFTTT
Towards Automatic Learning of Heuristics for Mechanical Transformations of Procedural Code. (arXiv:1701.07123v1 [cs.PL])
The current trends in next-generation exascale systems go towards integrating a wide range of specialized (co-)processors into traditional supercomputers. Due to the efficiency of heterogeneous systems in terms of Watts and FLOPS per surface unit, opening the access of heterogeneous platforms to a wider range of users is an important problem to be tackled. However, heterogeneous platforms limit the portability of the applications and increase development complexity due to the programming skills required. Program transformation can help make programming heterogeneous systems easier by defining a step-wise transformation process that translates a given initial code into a semantically equivalent final code, but adapted to a specific platform. Program transformation systems require the definition of efficient transformation strategies to tackle the combinatorial problem that emerges due to the large set of transformations applicable at each step of the process. In this paper we propose a machine learning-based approach to learn heuristics to define program transformation strategies. Our approach proposes a novel combination of reinforcement learning and classification methods to efficiently tackle the problems inherent to this type of systems. Preliminary results demonstrate the suitability of this approach.
from cs.AI updates on arXiv.org http://ift.tt/2j6AhZg
via IFTTT
Fast Exact k-Means, k-Medians and Bregman Divergence Clustering in 1D. (arXiv:1701.07204v1 [cs.DS])
The $k$-Means clustering problem on $n$ points is NP-Hard for any dimension $d\ge 2$, however, for the 1D case there exist exact polynomial time algorithms. The current state of the art is a $O(kn^2)$ dynamic programming algorithm that uses $O(nk)$ space. We present a new algorithm improving this to $O(kn \log n)$ time and optimal $O(n)$ space. We generalize our algorithm to work for the absolute distance instead of squared distance and to work for any Bregman Divergence as well.
from cs.AI updates on arXiv.org http://ift.tt/2k5Hxo1
via IFTTT
Learn&Fuzz: Machine Learning for Input Fuzzing. (arXiv:1701.07232v1 [cs.AI])
Fuzzing consists of repeatedly testing an application with modified, or fuzzed, inputs with the goal of finding security vulnerabilities in input-parsing code. In this paper, we show how to automate the generation of an input grammar suitable for input fuzzing using sample inputs and neural-network-based statistical machine-learning techniques. We present a detailed case study with a complex input format, namely PDF, and a large complex security-critical parser for this format, namely, the PDF parser embedded in Microsoft's new Edge browser. We discuss (and measure) the tension between conflicting learning and fuzzing goals: learning wants to capture the structure of well-formed inputs, while fuzzing wants to break that structure in order to cover unexpected code paths and find bugs. We also present a new algorithm for this learn&fuzz challenge which uses a learnt input probability distribution to intelligently guide where to fuzz inputs.
from cs.AI updates on arXiv.org http://ift.tt/2k2lcqT
via IFTTT
Hadith Web Browser Verification Extension. (arXiv:1701.07382v1 [cs.CY])
Internet users are more likely to ignore Internet content verification and more likely to share the content. When it comes to Islamic content, it is crucial to share and spread fake or inaccurate content. Even if the verification process of Islamic content is becoming easier every day, the Internet users generally ignore the verification step and jump into sharing the content. How many clicks away from users results? , this is the common question that is considered as a rule in modern website design. Internet users prefer the results to come to their page rather than to navigate it on their own. This paper presents a simple method of bringing hadith verification to the user web browser using web browser plugin.
from cs.AI updates on arXiv.org http://ift.tt/2j6B3FA
via IFTTT
LAREX - A semi-automatic open-source Tool for Layout Analysis and Region Extraction on Early Printed Books. (arXiv:1701.07396v1 [cs.CV])
A semi-automatic open-source tool for layout analysis on early printed books is presented. LAREX uses a rule based connected components approach which is very fast, easily comprehensible for the user and allows an intuitive manual correction if necessary. The PageXML format is used to support integration into existing OCR workflows. Evaluations showed that LAREX provides an efficient and flexible way to segment pages of early printed books.
from cs.AI updates on arXiv.org http://ift.tt/2jgLHVo
via IFTTT
Learning an attention model in an artificial visual system. (arXiv:1701.07398v1 [cs.CV])
The Human visual perception of the world is of a large fixed image that is highly detailed and sharp. However, receptor density in the retina is not uniform: a small central region called the fovea is very dense and exhibits high resolution, whereas a peripheral region around it has much lower spatial resolution. Thus, contrary to our perception, we are only able to observe a very small region around the line of sight with high resolution. The perception of a complete and stable view is aided by an attention mechanism that directs the eyes to the numerous points of interest within the scene. The eyes move between these targets in quick, unconscious movements, known as "saccades". Once a target is centered at the fovea, the eyes fixate for a fraction of a second while the visual system extracts the necessary information. An artificial visual system was built based on a fully recurrent neural network set within a reinforcement learning protocol, and learned to attend to regions of interest while solving a classification task. The model is consistent with several experimentally observed phenomena, and suggests novel predictions.
from cs.AI updates on arXiv.org http://ift.tt/2kuX7dn
via IFTTT
Adaptive ADMM with Spectral Penalty Parameter Selection. (arXiv:1605.07246v4 [cs.LG] UPDATED)
The alternating direction method of multipliers (ADMM) is a versatile tool for solving a wide range of constrained optimization problems, with differentiable or non-differentiable objective functions. Unfortunately, its performance is highly sensitive to a penalty parameter, which makes ADMM often unreliable and hard to automate for a non-expert user. We tackle this weakness of ADMM by proposing a method to adaptively tune the penalty parameters to achieve fast convergence. The resulting adaptive ADMM (AADMM) algorithm, inspired by the successful Barzilai-Borwein spectral method for gradient descent, yields fast convergence and relative insensitivity to the initial stepsize and problem scaling.
from cs.AI updates on arXiv.org http://ift.tt/1YXeMoa
via IFTTT
Query Complexity of Tournament Solutions. (arXiv:1611.06189v3 [cs.DS] UPDATED)
A directed graph where there is exactly one edge between every pair of vertices is called a {\em tournament}. Finding the "best" set of vertices of a tournament is a well studied problem in social choice theory. A {\em tournament solution} takes a tournament as input and outputs a subset of vertices of the input tournament. However, in many applications, for example, choosing the best set of drugs from a given set of drugs, the edges of the tournament are given only implicitly and knowing the orientation of an edge is costly. In such scenarios, we would like to know the best set of vertices (according to some tournament solution) by "querying" as few edges as possible. We, in this paper, precisely study this problem for commonly used tournament solutions: given an oracle access to the edges of a tournament T, find $f(T)$ by querying as few edges as possible, for a tournament solution f. We first show that the set of Condorcet non-losers in a tournament can be found by querying $2n-\lfloor \log n \rfloor -2$ edges only and this is tight in the sense that every algorithm for finding the set of Condorcet non-losers needs to query at least $2n-\lfloor \log n \rfloor -2$ edges in the worst case, where $n$ is the number of vertices in the input tournament. We then move on to study other popular tournament solutions and show that any algorithm for finding the Copeland set, the Slater set, the Markov set, the bipartisan set, the uncovered set, the Banks set, and the top cycle must query $\Omega(n^2)$ edges in the worst case. On the positive side, we are able to circumvent our strong query complexity lower bound results by proving that, if the size of the top cycle of the input tournament is at most $k$, then we can find all the tournament solutions mentioned above by querying $O(nk + \frac{n\log n}{\log(1-\frac{1}{k})})$ edges only.
from cs.AI updates on arXiv.org http://ift.tt/2eVft4D
via IFTTT
Overcoming catastrophic forgetting in neural networks. (arXiv:1612.00796v2 [cs.LG] UPDATED)
The ability to learn tasks in a sequential fashion is crucial to the development of artificial intelligence. Neural networks are not, in general, capable of this and it has been widely thought that catastrophic forgetting is an inevitable feature of connectionist models. We show that it is possible to overcome this limitation and train networks that can maintain expertise on tasks which they have not experienced for a long time. Our approach remembers old tasks by selectively slowing down learning on the weights important for those tasks. We demonstrate our approach is scalable and effective by solving a set of classification tasks based on the MNIST hand written digit dataset and by learning several Atari 2600 games sequentially.
from cs.AI updates on arXiv.org http://ift.tt/2g10lhQ
via IFTTT
Ravens Image: FB Kyle Juszczyk's last name misspelled on back of Pro Bowl jersey; led the position with 37 catches for 266 yards (ESPN)
via IFTTT
anonymous tip lends hope
from Google Alert - anonymous http://ift.tt/2jgif1I
via IFTTT
reflect: rename StructField.Anonymous into Embedded
from Google Alert - anonymous http://ift.tt/2kudZAY
via IFTTT
[FD] InfiniteWP Client WordPress Plugin unauthenticated PHP Object injection vulnerability
Source: Gmail -> IFTTT-> Blogger
[FD] CMS Commander Client WordPress Plugin unauthenticated PHP Object injection vulnerability
Source: Gmail -> IFTTT-> Blogger
[FD] Google Forms WordPress Plugin unauthenticated PHP Object injection vulnerability
Source: Gmail -> IFTTT-> Blogger
I have a new follower on Twitter
David R. Guitard
I'm a Signed Professional Musician currently working on my second retail album! All my thanks & love to family, friends and fans!
Bathurst, N.B.; Canada!
https://t.co/bF70Bv9kIy
Following: 106358 - Followers: 120201
January 25, 2017 at 12:24PM via Twitter http://twitter.com/IamDavidGuitard
Nodes wrongly marked as not accessible by anonymous user in wmlsitemap table and not ...
from Google Alert - anonymous http://ift.tt/2kjunRe
via IFTTT
New Trojan Turns Thousands Of Linux Devices Into Proxy Servers
from The Hacker News http://ift.tt/2jfcUaU
via IFTTT
Anonymous donor helps nearly 150 Iowa students
from Google Alert - anonymous http://ift.tt/2kjjzCY
via IFTTT
ISS Daily Summary Report – 1/24/2017
from ISS On-Orbit Status Report http://ift.tt/2jZrjw5
via IFTTT
A chat with the anonymous curator behind Scenic Simpsons
from Google Alert - anonymous http://ift.tt/2k2IZr5
via IFTTT
AlphaBay Dark Web Marketplace Hacked; Exposes Over 200,000 Private Messages
from The Hacker News http://ift.tt/2khvQrv
via IFTTT
Viagra anonymous
from Google Alert - anonymous http://ift.tt/2jvYi8a
via IFTTT
Last 6 Months, Anonymous
from Google Alert - anonymous http://ift.tt/2kh2MjO
via IFTTT
Tuesday, January 24, 2017
Sortie ou Offertoire sur 'O Filii'
from Google Alert - anonymous http://ift.tt/2kgJLOx'O_Filii'_(Anonymous)&ct=ga&cd=CAIyGjgxMzAxNTQ0ZWE3M2NhMmQ6Y29tOmVuOlVT&usg=AFQjCNFJSJLHz37gaMCZS0blss5T26QPzw
via IFTTT
Women with hairy legs, arms, underarms, etc. wanted
from Google Alert - anonymous http://ift.tt/2kqe6gZ
via IFTTT
I have a new follower on Twitter
Aranca IP
Providing technology intelligence, #intellectualproperty (#patent) strategy and litigation support to enterprise and law firms.
New York | London | Mumbai
https://t.co/8TyxPZf5nr
Following: 1217 - Followers: 1677
January 24, 2017 at 09:54PM via Twitter http://twitter.com/Aranca_IP
Admin-Mandated Anonymous Link Expiration
from Google Alert - anonymous http://ift.tt/2juYcxH
via IFTTT
Space-Time Graph Modeling of Ride Requests Based on Real-World Data. (arXiv:1701.06635v1 [cs.AI])
This paper focuses on modeling ride requests and their variations over location and time, based on analyzing extensive real-world data from a ride-sharing service. We introduce a graph model that captures the spatial and temporal variability of ride requests and the potentials for ride pooling. We discover these ride request graphs exhibit a well known property called densification power law often found in real graphs modelling human behaviors. We show the pattern of ride requests and the potential of ride pooling for a city can be characterized by the densification factor of the ride request graphs. Previous works have shown that it is possible to automatically generate synthetic versions of these graphs that exhibit a given densification factor. We present an algorithm for automatic generation of synthetic ride request graphs that match quite well the densification factor of ride request graphs from actual ride request data.
from cs.AI updates on arXiv.org http://ift.tt/2kqyHxs
via IFTTT
Perceptually Optimized Image Rendering. (arXiv:1701.06641v1 [cs.CV])
We develop a framework for rendering photographic images, taking into account display limitations, so as to optimize perceptual similarity between the rendered image and the original scene. We formulate this as a constrained optimization problem, in which we minimize a measure of perceptual dissimilarity, the Normalized Laplacian Pyramid Distance (NLPD), which mimics the early stage transformations of the human visual system. When rendering images acquired with higher dynamic range than that of the display, we find that the optimized solution boosts the contrast of low-contrast features without introducing significant artifacts, yielding results of comparable visual quality to current state-of-the art methods with no manual intervention or parameter settings. We also examine a variety of other display constraints, including limitations on minimum luminance (black point), mean luminance (as a proxy for energy consumption), and quantized luminance levels (halftoning). Finally, we show that the method may be used to enhance details and contrast of images degraded by optical scattering (e.g. fog).
from cs.AI updates on arXiv.org http://ift.tt/2kqG4VJ
via IFTTT
Imitating Driver Behavior with Generative Adversarial Networks. (arXiv:1701.06699v1 [cs.AI])
The ability to accurately predict and simulate human driving behavior is critical for the development of intelligent transportation systems. Traditional modeling methods have employed simple parametric models and behavioral cloning. This paper adopts a method for overcoming the problem of cascading errors inherent in prior approaches, resulting in realistic behavior that is robust to trajectory perturbations. We extend Generative Adversarial Imitation Learning to the training of recurrent policies, and we demonstrate that our model outperforms rule-based controllers and maximum likelihood models in realistic highway simulations. Our model both reproduces emergent behavior of human drivers, such as lane change rate, while maintaining realistic control over long time horizons.
from cs.AI updates on arXiv.org http://ift.tt/2jP5qgT
via IFTTT
Proceedings of the 12th Workshop on User Interfaces for Theorem Provers. (arXiv:1701.06745v1 [cs.HC])
The UITP workshop series brings together researchers interested in designing, developing and evaluating user interfaces for automated reasoning tools, such as interactive proof assistants, automated theorem provers, model finders, tools for formal methods, and tools for visualising and manipulating logical formulas and proofs. The twelth edition of UITP took place in Coimbra, Portugal, and was part of the International Joint Conference on Automated Reasoning (IJCAR'16). The workshop consisted of an invited talk, six presentations of submitted papers and lively hands-on session for reasoning tools and their user-interface. These post-proceedings contain four contributed papers accepted for publication after a second round of reviewing after the workshop as well as the invited paper.
from cs.AI updates on arXiv.org http://ift.tt/2juV2Kh
via IFTTT
Incorporating Prior Information in Compressive Online Robust Principal Component Analysis. (arXiv:1701.06852v1 [cs.IT])
We consider an online version of the robust Principle Component Analysis (PCA), which arises naturally in time-varying source separations such as video foreground-background separation. This paper proposes a compressive online robust PCA with prior information for recursively separating a sequences of frames into sparse and low-rank components from a small set of measurements. In contrast to conventional batch-based PCA, which processes all the frames directly, the proposed method processes measurements taken from each frame. Moreover, this method can efficiently incorporate multiple prior information, namely previous reconstructed frames, to improve the separation and thereafter, update the prior information for the next frame. We utilize multiple prior information by solving $n\text{-}\ell_{1}$ minimization for incorporating the previous sparse components and using incremental singular value decomposition ($\mathrm{SVD}$) for exploiting the previous low-rank components. We also establish theoretical bounds on the number of measurements required to guarantee successful separation under assumptions of static or slowly-changing low-rank components. Using numerical experiments, we evaluate our bounds and the performance of the proposed algorithm. The advantage of incorporating prior information is illustrated by adding in the comparision the performance of our algorithm without using prior information.
from cs.AI updates on arXiv.org http://ift.tt/2kgkoMG
via IFTTT
Deep Network Guided Proof Search. (arXiv:1701.06972v1 [cs.AI])
Deep learning techniques lie at the heart of several significant AI advances in recent years including object recognition and detection, image captioning, machine translation, speech recognition and synthesis, and playing the game of Go. Automated first-order theorem provers can aid in the formalization and verification of mathematical theorems and play a crucial role in program analysis, theory reasoning, security, interpolation, and system verification. Here we suggest deep learning based guidance in the proof search of the theorem prover E. We train and compare several deep neural network models on the traces of existing ATP proofs of Mizar statements and use them to select processed clauses during proof search. We give experimental evidence that with a hybrid, two-phase approach, deep learning based guidance can significantly reduce the average number of proof search steps while increasing the number of theorems proved. Using a few proof guidance strategies that leverage deep neural networks, we have found first-order proofs of 7.36% of the first-order logic translations of the Mizar Mathematical Library theorems that did not previously have ATP generated proofs. This increases the ratio of statements in the corpus with ATP generated proofs from 56% to 59%.
from cs.AI updates on arXiv.org http://ift.tt/2jPiN0B
via IFTTT
A Hierarchical Genetic Optimization of a Fuzzy Logic System for Flow Control in Micro Grids. (arXiv:1604.04789v2 [cs.AI] UPDATED)
Bio-inspired algorithms like Genetic Algorithms and Fuzzy Inference Systems (FIS) are nowadays widely adopted as hybrid techniques in commercial and industrial environment. In this paper, we present an interesting application of the fuzzy-GA paradigm to Smart Grids. The main aim consists in performing decision making for power flow management tasks in the proposed microgrid model equipped by renewable sources and an energy storage system, taking into account the economical profit in energy trading with the main-grid. In particular, this study focuses on the application of a Hierarchical Genetic Algorithm (HGA) for tuning the Rule Base (RB) of a Fuzzy Inference System (FIS), trying to discover a minimal fuzzy rule set in a Fuzzy Logic Controller (FLC) adopted to perform decision making in the microgrid. The HGA rationale focuses on a particular encoding scheme, based on control genes and parametric genes applied to the optimization of the FIS parameters. This approach will be referred in the following as fuzzy-HGA. Results are compared with a simpler approach based on a classic fuzzy-GA scheme, where FIS parameters and rule weights are tuned, while the number of fuzzy rules is fixed in advance. Experiments show how the fuzzy-HGA approach adopted for the synthesis of the proposed controller outperforms the classic fuzzy-GA scheme, increasing the economic return of 67\% in the considered energy trading problem.
from cs.AI updates on arXiv.org http://ift.tt/1Vf09ya
via IFTTT
Options Discovery with Budgeted Reinforcement Learning. (arXiv:1611.06824v2 [cs.LG] UPDATED)
We consider the problem of learning hierarchical policies for Reinforcement Learning able to discover options, an option corresponding to a sub-policy over a set of primitive actions. Different models have been proposed during the last decade that usually rely on a predefined set of options. We specifically address the problem of automatically discovering options in decision processes. We describe a new learning model called Budgeted Option Neural Network (BONN) able to discover options based on a budgeted learning objective. The BONN model is evaluated on different classical RL problems, demonstrating both quantitative and qualitative interesting results.
from cs.AI updates on arXiv.org http://ift.tt/2fWM0V2
via IFTTT
BliStrTune: Hierarchical Invention of Theorem Proving Strategies. (arXiv:1611.08733v1 [cs.LO] CROSS LISTED)
Inventing targeted proof search strategies for specific problem sets is a difficult task. State-of-the-art automated theorem provers (ATPs) such as E allow a large number of user-specified proof search strategies described in a rich domain specific language. Several machine learning methods that invent strategies automatically for ATPs were proposed previously. One of them is the Blind Strategymaker (BliStr), a system for automated invention of ATP strategies.
In this paper we introduce BliStrTune -- a hierarchical extension of BliStr. BliStrTune allows exploring much larger space of E strategies by interleaving search for high-level parameters with their fine-tuning. We use BliStrTune to invent new strategies based also on new clause weight functions targeted at problems from large ITP libraries. We show that the new strategies significantly improve E's performance in solving problems from the Mizar Mathematical Library.
from cs.AI updates on arXiv.org http://ift.tt/2gBZIfz
via IFTTT
Anonymous Youth
from Google Alert - anonymous http://ift.tt/2kqwylu
via IFTTT
sdlyu/flarum-ext-anonymous
from Google Alert - anonymous http://ift.tt/2kot9rk
via IFTTT
Best anonymous image board
from Google Alert - anonymous http://ift.tt/2keEgjl
via IFTTT
Different anonymous users cannot vote separately
from Google Alert - anonymous http://ift.tt/2jZizq5
via IFTTT
Cloud-AI: Artificially Intelligent System Found 10 Security Bugs in LinkedIn
from The Hacker News http://ift.tt/2kpzA9H
via IFTTT
What the Language You Tweet Says About Your Occupation. (arXiv:1701.06233v1 [cs.CY])
Many aspects of people's lives are proven to be deeply connected to their jobs. In this paper, we first investigate the distinct characteristics of major occupation categories based on tweets. From multiple social media platforms, we gather several types of user information. From users' LinkedIn webpages, we learn their proficiencies. To overcome the ambiguity of self-reported information, a soft clustering approach is applied to extract occupations from crowd-sourced data. Eight job categories are extracted, including Marketing, Administrator, Start-up, Editor, Software Engineer, Public Relation, Office Clerk, and Designer. Meanwhile, users' posts on Twitter provide cues for understanding their linguistic styles, interests, and personalities. Our results suggest that people of different jobs have unique tendencies in certain language styles and interests. Our results also clearly reveal distinctive levels in terms of Big Five Traits for different jobs. Finally, a classifier is built to predict job types based on the features extracted from tweets. A high accuracy indicates a strong discrimination power of language features for job prediction task.
from cs.AI updates on arXiv.org http://ift.tt/2jjYwS4
via IFTTT
ISS Daily Summary Report – 1/23/2017
from ISS On-Orbit Status Report http://ift.tt/2koV2M3
via IFTTT
ENIGMA: Efficient Learning-based Inference Guiding Machine. (arXiv:1701.06532v1 [cs.LO])
ENIGMA is a learning-based method for guiding given clause selection in saturation-based theorem provers. Clauses from many proof searches are classified as positive and negative based on their participation in the proofs. An efficient classification model is trained on this data, using fast feature-based characterization of the clauses . The learned model is then tightly linked with the core prover and used as a basis of a new parameterized evaluation heuristic that provides fast ranking of all generated clauses. The approach is evaluated on the E prover and the CASC 2016 AIM benchmark, showing a large increase of E's performance.
from cs.AI updates on arXiv.org http://ift.tt/2jVMMGL
via IFTTT
I have a new follower on Twitter
scott page
Musician +Technologist + Business #Saxophonist for #PinkFloyd #Toto #Supertramp Passions: #CrowdSourcing , #growthhacking #BrandBuilding
https://t.co/dTutKQIhnt
Following: 398140 - Followers: 412834
January 24, 2017 at 09:30AM via Twitter http://twitter.com/iamscottpage
Gamblers anonymous step workbook
from Google Alert - anonymous http://ift.tt/2kd46Et
via IFTTT
Nasty Android Malware that Infected Millions Returns to Google Play Store
from The Hacker News http://ift.tt/2jTSc4i
via IFTTT
[FD] APPLE-SA-2017-01-23-7 iTunes for Windows 12.5.5
Source: Gmail -> IFTTT-> Blogger
[FD] WD My Cloud Mirror 2.11.153 RCE and Authentication Bypass
Source: Gmail -> IFTTT-> Blogger
China makes VPNs illegal to tighten its Great Firewall
from The Hacker News http://ift.tt/2j8RH2l
via IFTTT
Anonymous proxy
from Google Alert - anonymous http://ift.tt/2jrClar
via IFTTT
Anonymous user 27f4bc
from Google Alert - anonymous http://ift.tt/2jkIvex
via IFTTT
Atmospheric River Slams California
from NASA's Scientific Visualization Studio: Most Recent Items http://ift.tt/2jkFFGz
via IFTTT
Monitoring Hurricane Matthew
from NASA's Scientific Visualization Studio: Most Recent Items http://ift.tt/2kbQFEH
via IFTTT
Category 4 Hurricane Matthew on October 2, 2016
from NASA's Scientific Visualization Studio: Most Recent Items http://ift.tt/2kbOkcZ
via IFTTT
Monday, January 23, 2017
Ravens LB C.J. Mosley decides against playing in 2017 Pro Bowl; has been replaced by Steelers LB Ryan Shazier (ESPN)
via IFTTT
I have a new follower on Twitter
AutoHome
Following: 98 - Followers: 145
January 23, 2017 at 11:19PM via Twitter http://twitter.com/AutoHomeIO
I have a new follower on Twitter
IIoT, AI & Big Data
Articles\Insights on #IIoT,#IoT,#ML,#BigData,#Energy,#Industry40,#DataScience,#Python,#Predictive,#AI,#InfoSec,#Blockchain & #Middleware
www.medium.com/iiot
https://t.co/v9XarRYfIW
Following: 833 - Followers: 2523
January 23, 2017 at 11:00PM via Twitter http://twitter.com/tachyeonz
I have a new follower on Twitter
Out-Smarts
Making digital marketing easy for small to mid size businesses. We provide Strategy, Social Media, Websites, SEO, Email Marketing Services.
Vancouver
https://t.co/VUfKAxixrp
Following: 7635 - Followers: 12284
January 23, 2017 at 10:15PM via Twitter http://twitter.com/OutSmarts
I have a new follower on Twitter
Bobby Kraft
Entrepreneur, relationship builder, multichannel expert...Founder of @NewEdgeMktgLLC and CEO of @OmniViewSports. Make it happen!
MKE/CHI, BOS, NYC, ATL, AZ, CA
https://t.co/ujMPUAkCuh
Following: 4764 - Followers: 5217
January 23, 2017 at 09:45PM via Twitter http://twitter.com/bobbykraft
I have a new follower on Twitter
Growth AI
Get 1 new actionable growth opportunity per day https://t.co/Ik2HICFW4y
San Francisco, CA
https://t.co/ogzSPHG9vK
Following: 2565 - Followers: 2565
January 23, 2017 at 09:45PM via Twitter http://twitter.com/growth_ai
Interactive Learning from Policy-Dependent Human Feedback. (arXiv:1701.06049v1 [cs.AI])
For agents and robots to become more useful, they must be able to quickly learn from non-technical users. This paper investigates the problem of interactively learning behaviors communicated by a human teacher using positive and negative feedback. Much previous work on this problem has made the assumption that people provide feedback for decisions that is dependent on the behavior they are teaching and is independent from the learner's current policy. We present empirical results that show this assumption to be false---whether human trainers give a positive or negative feedback for a decision is influenced by the learner's current policy. We argue that policy-dependent feedback, in addition to being commonplace, enables useful training strategies from which agents should benefit. Based on this insight, we introduce Convergent Actor-Critic by Humans (COACH), an algorithm for learning from policy-dependent feedback that converges to a local optimum. Finally, we demonstrate that COACH can successfully learn multiple behaviors on a physical robot, even with noisy image features.
from cs.AI updates on arXiv.org http://ift.tt/2j7xNF5
via IFTTT
Label Propagation on K-partite Graphs with Heterophily. (arXiv:1701.06075v1 [cs.LG])
In this paper, for the first time, we study label propagation in heterogeneous graphs under heterophily assumption. Homophily label propagation (i.e., two connected nodes share similar labels) in homogeneous graph (with same types of vertices and relations) has been extensively studied before. Unfortunately, real-life networks are heterogeneous, they contain different types of vertices (e.g., users, images, texts) and relations (e.g., friendships, co-tagging) and allow for each node to propagate both the same and opposite copy of labels to its neighbors. We propose a $\mathcal{K}$-partite label propagation model to handle the mystifying combination of heterogeneous nodes/relations and heterophily propagation. With this model, we develop a novel label inference algorithm framework with update rules in near-linear time complexity. Since real networks change over time, we devise an incremental approach, which supports fast updates for both new data and evidence (e.g., ground truth labels) with guaranteed efficiency. We further provide a utility function to automatically determine whether an incremental or a re-modeling approach is favored. Extensive experiments on real datasets have verified the effectiveness and efficiency of our approach, and its superiority over the state-of-the-art label propagation methods.
from cs.AI updates on arXiv.org http://ift.tt/2jjTuFm
via IFTTT
Binary Matrix Guessing Problem. (arXiv:1701.06167v1 [cs.AI])
We introduce the Binary Matrix Guessing Problem and provide two algorithms to solve this problem. The first algorithm we introduce is Elementwise Probing Algorithm (EPA) which is very fast under a score which utilizes Frobenius Distance. The second algorithm is Additive Reinforcement Learning Algorithm which combines ideas from perceptron algorithm and reinforcement learning algorithm. This algorithm is significantly slower compared to first one, but less restrictive and generalizes better. We compare computational performance of both algorithms and provide numerical results.
from cs.AI updates on arXiv.org http://ift.tt/2j7NnAp
via IFTTT
A Multichannel Convolutional Neural Network For Cross-language Dialog State Tracking. (arXiv:1701.06247v1 [cs.CL])
The fifth Dialog State Tracking Challenge (DSTC5) introduces a new cross-language dialog state tracking scenario, where the participants are asked to build their trackers based on the English training corpus, while evaluating them with the unlabeled Chinese corpus. Although the computer-generated translations for both English and Chinese corpus are provided in the dataset, these translations contain errors and careless use of them can easily hurt the performance of the built trackers. To address this problem, we propose a multichannel Convolutional Neural Networks (CNN) architecture, in which we treat English and Chinese language as different input channels of one single CNN model. In the evaluation of DSTC5, we found that such multichannel architecture can effectively improve the robustness against translation errors. Additionally, our method for DSTC5 is purely machine learning based and requires no prior knowledge about the target language. We consider this a desirable property for building a tracker in the cross-language context, as not every developer will be familiar with both languages.
from cs.AI updates on arXiv.org http://ift.tt/2jjOuAy
via IFTTT
Constraint programming for planning test campaigns of communications satellites. (arXiv:1701.06388v1 [cs.AI])
The payload of communications satellites must go through a series of tests to assert their ability to survive in space. Each test involves some equipment of the payload to be active, which has an impact on the temperature of the payload. Sequencing these tests in a way that ensures the thermal stability of the payload and minimizes the overall duration of the test campaign is a very important objective for satellite manufacturers. The problem can be decomposed in two sub-problems corresponding to two objectives: First, the number of distinct configurations necessary to run the tests must be minimized. This can be modeled as packing the tests into configurations, and we introduce a set of implied constraints to improve the lower bound of the model. Second, tests must be sequenced so that the number of times an equipment unit has to be switched on or off is minimized. We model this aspect using the constraint Switch, where a buffer with limited capacity represents the currently active equipment units, and we introduce an improvement of the propagation algorithm for this constraint. We then introduce a search strategy in which we sequentially solve the sub-problems (packing and sequencing). Experiments conducted on real and random instances show the respective interest of our contributions.
from cs.AI updates on arXiv.org http://ift.tt/2jk06nb
via IFTTT
Identification of Unmodeled Objects from Symbolic Descriptions. (arXiv:1701.06450v1 [stat.ML])
Successful human-robot cooperation hinges on each agent's ability to process and exchange information about the shared environment and the task at hand. Human communication is primarily based on symbolic abstractions of object properties, rather than precise quantitative measures. A comprehensive robotic framework thus requires an integrated communication module which is able to establish a link and convert between perceptual and abstract information.
The ability to interpret composite symbolic descriptions enables an autonomous agent to a) operate in unstructured and cluttered environments, in tasks which involve unmodeled or never seen before objects; and b) exploit the aggregation of multiple symbolic properties as an instance of ensemble learning, to improve identification performance even when the individual predicates encode generic information or are imprecisely grounded.
We propose a discriminative probabilistic model which interprets symbolic descriptions to identify the referent object contextually w.r.t.\ the structure of the environment and other objects. The model is trained using a collected dataset of identifications, and its performance is evaluated by quantitative measures and a live demo developed on the PR2 robot platform, which integrates elements of perception, object extraction, object identification and grasping.
from cs.AI updates on arXiv.org http://ift.tt/2iYahPO
via IFTTT
Detecting Falls with X-Factor Hidden Markov Models. (arXiv:1504.02141v5 [cs.LG] UPDATED)
Identification of falls while performing normal activities of daily living (ADL) is important to ensure personal safety and well-being. However, falling is a short term activity that occurs infrequently. This poses a challenge to traditional classification algorithms, because there may be very little training data for falls (or none at all). This paper proposes an approach for the identification of falls using a wearable device in the absence of training data for falls but with plentiful data for normal ADL. We propose three `X-Factor' Hidden Markov Model (XHMMs) approaches. The XHMMs model unseen falls using "inflated" output covariances (observation models). To estimate the inflated covariances, we propose a novel cross validation method to remove "outliers" from the normal ADL that serve as proxies for the unseen falls and allow learning the XHMMs using only normal activities. We tested the proposed XHMM approaches on two activity recognition datasets and show high detection rates for falls in the absence of fall-specific training data. We show that the traditional method of choosing a threshold based on maximum of negative of log-likelihood to identify unseen falls is ill-posed for this problem. We also show that supervised classification methods perform poorly when very limited fall data are available during the training phase.
from cs.AI updates on arXiv.org http://ift.tt/1Nh5lOs
via IFTTT
The Parallel Knowledge Gradient Method for Batch Bayesian Optimization. (arXiv:1606.04414v3 [stat.ML] UPDATED)
In many applications of black-box optimization, one can evaluate multiple points simultaneously, e.g. when evaluating the performances of several different neural network architectures in a parallel computing environment. In this paper, we develop a novel batch Bayesian optimization algorithm --- the parallel knowledge gradient method. By construction, this method provides the one-step Bayes optimal batch of points to sample. We provide an efficient strategy for computing this Bayes-optimal batch of points, and we demonstrate that the parallel knowledge gradient method finds global optima significantly faster than previous batch Bayesian optimization algorithms on both synthetic test functions and when tuning hyperparameters of practical machine learning algorithms, especially when function evaluations are noisy.
from cs.AI updates on arXiv.org http://ift.tt/1UyfjsU
via IFTTT
Efficient Hyperparameter Optimization of Deep Learning Algorithms Using Deterministic RBF Surrogates. (arXiv:1607.08316v2 [cs.AI] UPDATED)
Automatically searching for optimal hyperparameter configurations is of crucial importance for applying deep learning algorithms in practice. Recently, Bayesian optimization has been proposed for optimizing hyperparameters of various machine learning algorithms. Those methods adopt probabilistic surrogate models like Gaussian processes to approximate and minimize the validation error function of hyperparameter values. However, probabilistic surrogates require accurate estimates of sufficient statistics (e.g., covariance) of the error distribution and thus need many function evaluations with a sizeable number of hyperparameters. This makes them inefficient for optimizing hyperparameters of deep learning algorithms, which are highly expensive to evaluate. In this work, we propose a new deterministic and efficient hyperparameter optimization method that employs radial basis functions as error surrogates. The proposed mixed integer algorithm, called HORD, searches the surrogate for the most promising hyperparameter values through dynamic coordinate search and requires many fewer function evaluations. HORD does well in low dimensions but it is exceptionally better in higher dimensions. Extensive evaluations on MNIST and CIFAR-10 for four deep neural networks demonstrate HORD significantly outperforms the well-established Bayesian optimization methods such as GP, SMAC, and TPE. For instance, on average, HORD is more than 6 times faster than GP-EI in obtaining the best configuration of 19 hyperparameters.
from cs.AI updates on arXiv.org http://ift.tt/2af7iKv
via IFTTT
A Novel Progressive Learning Technique for Multi-class Classification. (arXiv:1609.00085v2 [cs.LG] UPDATED)
In this paper, a progressive learning technique for multi-class classification is proposed. This newly developed learning technique is independent of the number of class constraints and it can learn new classes while still retaining the knowledge of previous classes. Whenever a new class (non-native to the knowledge learnt thus far) is encountered, the neural network structure gets remodeled automatically by facilitating new neurons and interconnections, and the parameters are calculated in such a way that it retains the knowledge learnt thus far. This technique is suitable for real-world applications where the number of classes is often unknown and online learning from real-time data is required. The consistency and the complexity of the progressive learning technique are analyzed. Several standard datasets are used to evaluate the performance of the developed technique. A comparative study shows that the developed technique is superior.
from cs.AI updates on arXiv.org http://ift.tt/2bO1Hwm
via IFTTT