Latest YouTube Video
Saturday, October 15, 2016
Drupal is not defined for anonymous
from Google Alert - anonymous http://ift.tt/2dWysN9
via IFTTT
Animals Anonymous - Welcome Party
from Google Alert - anonymous http://ift.tt/2ehsBMT
via IFTTT
Crack for Charity — GCHQ launches 'Puzzle Book' Challenge for Cryptographers
from The Hacker News http://ift.tt/2eDmJBC
via IFTTT
FBI is Investigating Theft of $1.3 Million in Bitcoin from a Massachusetts Man
from The Hacker News http://ift.tt/2diQB1m
via IFTTT
Android Banking Trojan Tricks Victims into Submitting Selfie Holding their ID Card
from The Hacker News http://ift.tt/2dDEhd2
via IFTTT
Orioles: Zach Britton tweets "#falseadvertising" as MLB sells his game-worn jersey from wild-card game he didn't enter (ESPN)
via IFTTT
Herschel s Orion
Friday, October 14, 2016
Wikimedia Foundation supports anonymous online speech in letter to California Supreme Court
from Google Alert - anonymous http://ift.tt/2dCRanA
via IFTTT
Ravens Video: Jack, a 5-year-old battling leukemia, lines up with offense and runs ball into end zone for a special TD (ESPN)
via IFTTT
Ravens: Steve Smith Sr., Marshal Yanda, C.J. Mosley, Devin Hester doubtful for Sunday at Giants; Elvis Dumervil out (ESPN)
via IFTTT
ISS Daily Summary Report – 10/13/2016
from ISS On-Orbit Status Report http://ift.tt/2dBGky2
via IFTTT
ISS Daily Summary Report – 10/12/2016
from ISS On-Orbit Status Report http://ift.tt/2ezJqqr
via IFTTT
12-Year-Old SSH Bug Exposes More than 2 Million IoT Devices
from The Hacker News http://ift.tt/2e9YgVO
via IFTTT
Galaxies from the Altiplano
The Story of Ozone Depletion
from NASA's Scientific Visualization Studio: Most Recent Items http://ift.tt/2dObC7P
via IFTTT
Gardening Rates on the Moon
from NASA's Scientific Visualization Studio: Most Recent Items http://ift.tt/2eeiwkU
via IFTTT
Thursday, October 13, 2016
A Fuzzy Logic System to Analyze a Student's Lifestyle. (arXiv:1610.03957v1 [cs.AI])
A college student's life can be primarily categorized into domains such as education, health, social and other activities which may include daily chores and travelling time. Time management is crucial for every student. A self realisation of one's daily time expenditure in various domains is therefore essential to maximize one's effective output. This paper presents how a mobile application using Fuzzy Logic and Global Positioning System (GPS) analyzes a student's lifestyle and provides recommendations and suggestions based on the results.
from cs.AI updates on arXiv.org http://ift.tt/2ebZFWx
via IFTTT
Bank Card Usage Prediction Exploiting Geolocation Information. (arXiv:1610.03996v1 [cs.LG])
We describe the solution of team ISMLL for the ECML-PKDD 2016 Discovery Challenge on Bank Card Usage for both tasks. Our solution is based on three pillars. Gradient boosted decision trees as a strong regression and classification model, an intensive search for good hyperparameter configurations and strong features that exploit geolocation information. This approach achieved the best performance on the public leaderboard for the first task and a decent fourth position for the second task.
from cs.AI updates on arXiv.org http://ift.tt/2dQVkNO
via IFTTT
Stream Reasoning-Based Control of Caching Strategies in CCN Routers. (arXiv:1610.04005v1 [cs.AI])
Content-Centric Networking (CCN) research addresses the mismatch between the modern usage of the Internet and its outdated architecture. Importantly, CCN routers may locally cache frequently requested content in order to speed up delivery to end users. Thus, the issue of caching strategies arises, i.e., which content shall be stored and when it should be replaced. In this work, we employ novel techniques towards intelligent administration of CCN routers that autonomously switch between existing strategies in response to changing content request patterns. In particular, we present a router architecture for CCN networks that is controlled by rule-based stream reasoning, following the recent formal framework LARS which extends Answer Set Programming for streams. The obtained possibility for flexible router configuration at runtime allows for faster experimentation and may thus help to advance the further development of CCN. Moreover, the empirical evaluation of our feasibility study shows that the resulting caching agent may give significant performance gains.
from cs.AI updates on arXiv.org http://ift.tt/2dnXPEq
via IFTTT
A fuzzy expert system for earthquake prediction, case study: the Zagros range. (arXiv:1610.04028v1 [cs.AI])
A methodology for the development of a fuzzy expert system (FES) with application to earthquake prediction is presented. The idea is to reproduce the performance of a human expert in earthquake prediction. To do this, at the first step, rules provided by the human expert are used to generate a fuzzy rule base. These rules are then fed into an inference engine to produce a fuzzy inference system (FIS) and to infer the results. In this paper, we have used a Sugeno type fuzzy inference system to build the FES. At the next step, the adaptive network-based fuzzy inference system (ANFIS) is used to refine the FES parameters and improve its performance. The proposed framework is then employed to attain the performance of a human expert used to predict earthquakes in the Zagros area based on the idea of coupled earthquakes. While the prediction results are promising in parts of the testing set, the general performance indicates that prediction methodology based on coupled earthquakes needs more investigation and more complicated reasoning procedure to yield satisfactory predictions.
from cs.AI updates on arXiv.org http://ift.tt/2ebXIJL
via IFTTT
Truthful Mechanisms for Matching and Clustering in an Ordinal World. (arXiv:1610.04069v1 [cs.GT])
We study truthful mechanisms for matching and related problems in a partial information setting, where the agents' true utilities are hidden, and the algorithm only has access to ordinal preference information. Our model is motivated by the fact that in many settings, agents cannot express the numerical values of their utility for different outcomes, but are still able to rank the outcomes in their order of preference. Specifically, we study problems where the ground truth exists in the form of a weighted graph of agent utilities, but the algorithm can only elicit the agents' private information in the form of a preference ordering for each agent induced by the underlying weights. Against this backdrop, we design truthful algorithms to approximate the true optimum solution with respect to the hidden weights. Our techniques yield universally truthful algorithms for a number of graph problems: a 1.76-approximation algorithm for Max-Weight Matching, 2-approximation algorithm for Max k-matching, a 6-approximation algorithm for Densest k-subgraph, and a 2-approximation algorithm for Max Traveling Salesman as long as the hidden weights constitute a metric. We also provide improved approximation algorithms for such problems when the agents are not able to lie about their preferences. Our results are the first non-trivial truthful approximation algorithms for these problems, and indicate that in many situations, we can design robust algorithms even when the agents may lie and only provide ordinal information instead of precise utilities.
from cs.AI updates on arXiv.org http://ift.tt/2dnWHkc
via IFTTT
Improved Knowledge Base Completion by Path-Augmented TransR Model. (arXiv:1610.04073v1 [cs.AI])
Knowledge base completion aims to infer new relations from existing information. In this paper, we propose path-augmented TransR (PTransR) model to improve the accuracy of link prediction. In our approach, we base PTransR model on TransR, which is the best one-hop model at present. Then we regularize TransR with information of relation paths. In our experiment, we evaluate PTransR on the task of entity prediction. Experimental results show that PTransR outperforms previous models.
from cs.AI updates on arXiv.org http://ift.tt/2ebYdTZ
via IFTTT
Exploiting Sentence and Context Representations in Deep Neural Models for Spoken Language Understanding. (arXiv:1610.04120v1 [cs.AI])
This paper presents a deep learning architecture for the semantic decoder component of a Statistical Spoken Dialogue System. In a slot-filling dialogue, the semantic decoder predicts the dialogue act and a set of slot-value pairs from a set of n-best hypotheses returned by the Automatic Speech Recognition. Most current models for spoken language understanding assume (i) word-aligned semantic annotations as in sequence taggers and (ii) delexicalisation, or a mapping of input words to domain-specific concepts using heuristics that try to capture morphological variation but that do not scale to other domains nor to language variation (e.g., morphology, synonyms, paraphrasing ). In this work the semantic decoder is trained using unaligned semantic annotations and it uses distributed semantic representation learning to overcome the limitations of explicit delexicalisation. The proposed architecture uses a convolutional neural network for the sentence representation and a long-short term memory network for the context representation. Results are presented for the publicly available DSTC2 corpus and an In-car corpus which is similar to DSTC2 but has a significantly higher word error rate (WER).
from cs.AI updates on arXiv.org http://ift.tt/2dnYXaU
via IFTTT
An Information Theoretic Feature Selection Framework for Big Data under Apache Spark. (arXiv:1610.04154v1 [cs.AI])
With the advent of extremely high dimensional datasets, dimensionality reduction techniques are becoming mandatory. Among many techniques, feature selection has been growing in interest as an important tool to identify relevant features on huge datasets --both in number of instances and features--. The purpose of this work is to demonstrate that standard feature selection methods can be parallelized in Big Data platforms like Apache Spark, boosting both performance and accuracy. We thus propose a distributed implementation of a generic feature selection framework which includes a wide group of well-known Information Theoretic methods. Experimental results on a wide set of real-world datasets show that our distributed framework is capable of dealing with ultra-high dimensional datasets as well as those with a huge number of samples in a short period of time, outperforming the sequential version in all the cases studied.
from cs.AI updates on arXiv.org http://ift.tt/2e5C9eI
via IFTTT
Reset-free Trial-and-Error Learning for Data-Efficient Robot Damage Recovery. (arXiv:1610.04213v1 [cs.RO])
The high probability of hardware failures prevents many advanced robots (e.g. legged robots) to be confidently deployed in real-world situations (e.g post-disaster rescue). Instead of attempting to diagnose the failure(s), robots could adapt by trial-and-error in order to be able to complete their tasks. However, the best trial-and-error algorithms for robotics are all episodic: between each trial, the robot needs to be put back in the same state, that is, the robot is not learning autonomously. In this paper, we introduce a novel learning algorithm called "Reset-free Trial-and-Error" (RTE) that allows robots to recover from damage while completing their tasks. We evaluate it on a hexapod robot that is damaged in several ways (e.g. a missing leg, a shortened leg, etc.) and whose objective is to reach a sequence of targets in an arena. Our experiments show that the robot can recover most of its locomotion abilities in a few minutes, in an environment with obstacles, and without any human intervention. Overall, this new algorithm makes it possible to contemplate sending robots to places that are truly too dangerous for humans and in which robots cannot be rescued.
from cs.AI updates on arXiv.org http://ift.tt/2ebYpTs
via IFTTT
A Parallel Memory-efficient Epistemic Logic Program Solver: Harder, Better, Faster. (arXiv:1608.06910v2 [cs.AI] UPDATED)
As the practical use of answer set programming (ASP) has grown with the development of efficient solvers, we expect a growing interest in extensions of ASP as their semantics stabilize and solvers supporting them mature. Epistemic Specifications, which adds modal operators K and M to the language of ASP, is one such extension. We call a program in this language an epistemic logic program (ELP). Solvers have thus far been practical for only the simplest ELPs due to exponential growth of the search space. We describe a solver that is able to solve harder problems better (e.g., without exponentially-growing memory needs w.r.t. K and M occurrences) and faster than any other known ELP solver.
from cs.AI updates on arXiv.org http://ift.tt/2bxDTP3
via IFTTT
lazyloader.js Uncaught TypeError: Cannot read property 'length'
from Google Alert - anonymous http://ift.tt/2dWqVdY
via IFTTT
Ravens: Steve Smith, Devin Hester, CJ Mosley and Elvis Dumervil not at practice Thurs.; Ronnie Stanley returns - Hensley (ESPN)
via IFTTT
Anonymous Threatens to Release Video of Bill Clinton Raping A 13-Year Old Child
from Google Alert - anonymous http://ift.tt/2eaJwAC
via IFTTT
Ocean City, MD's surf is at least 5.16ft high
Ocean City, MD Summary
At 4:00 AM, surf min of 5.16ft. At 10:00 AM, surf min of 5.28ft. At 4:00 PM, surf min of 4.5ft. At 10:00 PM, surf min of 4.15ft.
Surf maximum: 5.76ft (1.76m)
Surf minimum: 5.16ft (1.57m)
Tide height: -0.38ft (-0.12m)
Wind direction: ENE
Wind speed: 6.84 KTS
from Surfline http://ift.tt/1kVmigH
via IFTTT
Classified U.S. Defense Network Outage Hits Air Force’s Secret Drone Operations
from The Hacker News http://ift.tt/2ebKPjV
via IFTTT
GPM Captures Hurricane Matthew Over Haiti
from NASA's Scientific Visualization Studio: Most Popular
via IFTTT
Penumbral Lunar Eclipse
GPM Monitors Hurricane Matthew Flooding the Carolinas
from NASA's Scientific Visualization Studio: Most Recent Items http://ift.tt/2ehIAPN
via IFTTT
Wednesday, October 12, 2016
Santa's Anonymous is back
from Google Alert - anonymous http://ift.tt/2dlHNuQ
via IFTTT
Transfer from Simulation to Real World through Learning Deep Inverse Dynamics Model. (arXiv:1610.03518v1 [cs.RO])
Developing control policies in simulation is often more practical and safer than directly running experiments in the real world. This applies to policies obtained from planning and optimization, and even more so to policies obtained from reinforcement learning, which is often very data demanding. However, a policy that succeeds in simulation often doesn't work when deployed on a real robot. Nevertheless, often the overall gist of what the policy does in simulation remains valid in the real world. In this paper we investigate such settings, where the sequence of states traversed in simulation remains reasonable for the real world, even if the details of the controls are not, as could be the case when the key differences lie in detailed friction, contact, mass and geometry properties. During execution, at each time step our approach computes what the simulation-based control policy would do, but then, rather than executing these controls on the real robot, our approach computes what the simulation expects the resulting next state(s) will be, and then relies on a learned deep inverse dynamics model to decide which real-world action is most suitable to achieve those next states. Deep models are only as good as their training data, and we also propose an approach for data collection to (incrementally) learn the deep inverse dynamics model. Our experiments shows our approach compares favorably with various baselines that have been developed for dealing with simulation to real world model discrepancy, including output error control and Gaussian dynamics adaptation.
from cs.AI updates on arXiv.org http://ift.tt/2dXLCW4
via IFTTT
A Chain-Detection Algorithm for Two-Dimensional Grids. (arXiv:1610.03573v1 [cs.AI])
We describe a general method of detecting valid chains or links of pieces on a two-dimensional grid. Specifically, using the example of the chess variant known as Switch-Side Chain-Chess (SSCC). Presently, no foolproof method of detecting such chains in any given chess position is known and existing graph theory, to our knowledge, is unable to fully address this problem either. We therefore propose a solution implemented and tested using the C++ programming language. We have been unable to find an incorrect result and therefore offer it as the most viable solution thus far to the chain-detection problem in this chess variant. The algorithm is also scalable, in principle, to areas beyond two-dimensional grids such as 3D analysis and molecular chemistry.
from cs.AI updates on arXiv.org http://ift.tt/2dXJZYi
via IFTTT
Maximum entropy models for generation of expressive music. (arXiv:1610.03606v1 [cs.AI])
In the context of contemporary monophonic music, expression can be seen as the difference between a musical performance and its symbolic representation, i.e. a musical score. In this paper, we show how Maximum Entropy (MaxEnt) models can be used to generate musical expression in order to mimic a human performance. As a training corpus, we had a professional pianist play about 150 melodies of jazz, pop, and latin jazz. The results show a good predictive power, validating the choice of our model. Additionally, we set up a listening test whose results reveal that on average, people significantly prefer the melodies generated by the MaxEnt model than the ones without any expression, or with fully random expression. Furthermore, in some cases, MaxEnt melodies are almost as popular as the human performed ones.
from cs.AI updates on arXiv.org http://ift.tt/2dXMx8Q
via IFTTT
Deep Fruit Detection in Orchards. (arXiv:1610.03677v1 [cs.RO])
An accurate and reliable image based fruit detection system is critical for supporting higher level agriculture tasks such as yield mapping and robotic harvesting. This paper presents the use of a state-of-the-art object detection framework, Faster R-CNN, in the context of fruit detection in orchards, including mangoes, almonds and apples. Ablation studies are presented to better understand the practical deployment of the detection network, including how much training data is required to capture variability in the dataset. Data augmentation techniques are shown to yield significant performance gains, resulting in a greater than two-fold reduction in the number of training images required. In contrast, transferring knowledge between orchards contributed to negligible performance gain over initialising the Deep Convolutional Neural Network directly from ImageNet features. Finally, to operate over orchard data containing between 100-1000 fruit per image, a tiling approach is introduced for the Faster R-CNN framework. The study has resulted in the best yet detection performance for these orchards relative to previous works, with an F1-score of >0.9 achieved for apples and mangoes.
from cs.AI updates on arXiv.org http://ift.tt/2dduzNi
via IFTTT
Exploring the Entire Regularization Path for the Asymmetric Cost Linear Support Vector Machine. (arXiv:1610.03738v1 [cs.AI])
We propose an algorithm for exploring the entire regularization path of asymmetric-cost linear support vector machines. Empirical evidence suggests the predictive power of support vector machines depends on the regularization parameters of the training algorithms. The algorithms exploring the entire regularization paths have been proposed for single-cost support vector machines thereby providing the complete knowledge on the behavior of the trained model over the hyperparameter space. Considering the problem in two-dimensional hyperparameter space though enables our algorithm to maintain greater flexibility in dealing with special cases and sheds light on problems encountered by algorithms building the paths in one-dimensional spaces. We demonstrate two-dimensional regularization paths for linear support vector machines that we train on synthetic and real data.
from cs.AI updates on arXiv.org http://ift.tt/2dXKbqu
via IFTTT
Detecting Unseen Falls from Wearable Devices using Channel-wise Ensemble of Autoencoders. (arXiv:1610.03761v1 [cs.AI])
A fall is an abnormal activity that occurs rarely, so it is hard to collect real data for falls. It is, therefore, difficult to use supervised learning methods to automatically detect falls. Another challenge in using machine learning methods to automatically detect falls is the choice of features. In this paper, we propose to use an ensemble of autoencoders to extract features from different channels of wearable sensor data trained only on normal activities. We show that choosing a threshold as maximum of the reconstruction error on the training normal data is not the right way to identify unseen falls. We propose two methods for automatic tightening of reconstruction error from only the normal activities for better identification of unseen falls. We present our results on two activity recognition datasets and show the efficacy of our proposed method against traditional autoencoder models and two standard one-class classification methods.
from cs.AI updates on arXiv.org http://ift.tt/2dXMl9G
via IFTTT
Concordance and the Smallest Covering Set of Preference Orderings. (arXiv:1609.04722v2 [cs.AI] UPDATED)
Preference orderings are orderings of a set of items according to the preferences (of judges). Such orderings arise in a variety of domains, including group decision making, consumer marketing, voting and machine learning. Measuring the mutual information and extracting the common patterns in a set of preference orderings are key to these areas. In this paper we deal with the representation of sets of preference orderings, the quantification of the degree to which judges agree on their ordering of the items (i.e. the concordance), and the efficient, meaningful description of such sets.
We propose to represent the orderings in a subsequence-based feature space and present a new algorithm to calculate the size of the set of all common subsequences - the basis of a quantification of concordance, not only for pairs of orderings but also for sets of orderings. The new algorithm is fast and storage efficient with a time complexity of only $O(Nn^2)$ for the orderings of $n$ items by $N$ judges and a space complexity of only $O(\min\{Nn,n^2\})$.
Also, we propose to represent the set of all $N$ orderings through a smallest set of covering preferences and present an algorithm to construct this smallest covering set.
The source code for the algorithms is available at http://ift.tt/2dxgNWV.
from cs.AI updates on arXiv.org http://ift.tt/2cSdzgv
via IFTTT
Huntington Police get $100000 private, anonymous donation
from Google Alert - anonymous http://ift.tt/2dSY9dZ
via IFTTT
New program allows electronic anonymous tipping to police
from Google Alert - anonymous http://ift.tt/2dSRKQe
via IFTTT
Unconfirmed Russian report about anonymous officials unofficially recommending something ...
from Google Alert - anonymous http://ift.tt/2dYhHim
via IFTTT
BlockChain.info Domain Hijacked; Site Goes Down; 8 Million Bitcoin Wallets Inaccessible
from The Hacker News http://ift.tt/2d7FfSv
via IFTTT
Call for Papers: Call for Papers: ICARUS Special Issue on Asteroids
Asteroids are small, usually rocky, bodies that primarily populate a region of the solar system between the orbits of Mars and Jupiter known as the asteroid belt. However, they can also be found throughout the solar system. As leftovers from the formation of the solar system, these bodies carry the signature of the birth of our planetary system. Their properties allow testing of current theories and open doors to the development of new theories pertaining to different evolutionary processes in the solar system.
from Icarus http://ift.tt/2eqWdLO
via IFTTT
I have a new follower on Twitter
Matt Heinz
B2B demand generation, pipeline management, sales enablement, content strategy, inside sales effectiveness, marketing technology, driving revenue & results.
Redmond, WA
http://t.co/1R4WFaTkHt
Following: 68777 - Followers: 96719
October 12, 2016 at 10:04AM via Twitter http://twitter.com/HeinzMarketing
[FD] [SYSS-2016-075] Targus Multimedia Presentation Remote - Insufficient Verification of Data Authenticity (CWE-345), Mouse Spoofing Attack
Source: Gmail -> IFTTT-> Blogger
[FD] [SYSS-2016-074] Logitech Wireless Presenter R400 - Insufficient Verification of Data Authenticity (CWE-345), Keystroke Injection Vulnerability
Source: Gmail -> IFTTT-> Blogger
Microsoft Patches 5 Zero-Day Vulnerabilities Being Exploited in the Wild
from The Hacker News http://ift.tt/2e8sxA7
via IFTTT
The Cygnus Wall of Star Formation
Tuesday, October 11, 2016
I have a new follower on Twitter
Rob Tiffany
CTO, Lumada #IoT at Hitachi • Inc Magazine Top Internet of Things Expert • exMSFT • Author • Keynote Speaker • Wannabe Sommelier
Seattle
https://t.co/SJWlZkSM8v
Following: 10966 - Followers: 17375
October 11, 2016 at 10:46PM via Twitter http://twitter.com/RobTiffany
PCG-Based Game Design Patterns. (arXiv:1610.03138v1 [cs.AI])
People enjoy encounters with generative software, but rarely are they encouraged to interact with, understand or engage with it. In this paper we define the term 'PCG-based game', and explain how this concept follows on from the idea of an AI-based game. We look at existing examples of games which foreground their AI, put forward a methodology for designing PCG-based games, describe some example case study designs for PCG-based games, and describe lessons learned during this process of sketching and developing ideas.
from cs.AI updates on arXiv.org http://ift.tt/2dU7mCm
via IFTTT
Navigational Instruction Generation as Inverse Reinforcement Learning with Neural Machine Translation. (arXiv:1610.03164v1 [cs.RO])
Modern robotics applications that involve human-robot interaction require robots to be able to communicate with humans seamlessly and effectively. Natural language provides a flexible and efficient medium through which robots can exchange information with their human partners. Significant advancements have been made in developing robots capable of interpreting free-form instructions, but less attention has been devoted to endowing robots with the ability to generate natural language. We propose a navigational guide model that enables robots to generate natural language instructions that allow humans to navigate a priori unknown environments. We first decide which information to share with the user according to their preferences, using a policy trained from human demonstrations via inverse reinforcement learning. We then "translate" this information into a natural language instruction using a neural sequence-to-sequence model that learns to generate free-form instructions from natural language corpora. We evaluate our method on a benchmark route instruction dataset and achieve a BLEU score of 72.18% when compared to human-generated reference instructions. We additionally conduct navigation experiments with human participants that demonstrate that our method generates instructions that people follow as accurately and easily as those produced by humans.
from cs.AI updates on arXiv.org http://ift.tt/2dOV8LU
via IFTTT
Error Asymmetry in Causal and Anticausal Regression. (arXiv:1610.03263v1 [cs.AI])
It is generally difficult to make any statements about the expected prediction error in an univariate setting without further knowledge about how the data were generated. Recent work showed that knowledge about the real underlying causal structure of a data generation process has implications for various machine learning settings. Assuming an additive noise and an independence between data generating mechanism and its input, we draw a novel connection between the intrinsic causal relationship of two variables and the expected prediction error. We formulate the theorem that the expected error of the true data generating function as prediction model is generally smaller when the effect is predicted from its cause and, on the contrary, greater when the cause is predicted from its effect. The theorem implies an asymmetry in the error depending on the prediction direction. This is further corroborated with empirical evaluations in artificial and real-world data sets.
from cs.AI updates on arXiv.org http://ift.tt/2dU7j9i
via IFTTT
Safe, Multi-Agent, Reinforcement Learning for Autonomous Driving. (arXiv:1610.03295v1 [cs.AI])
Autonomous driving is a multi-agent setting where the host vehicle must apply sophisticated negotiation skills with other road users when overtaking, giving way, merging, taking left and right turns and while pushing ahead in unstructured urban roadways. Since there are many possible scenarios, manually tackling all possible cases will likely yield a too simplistic policy. Moreover, one must balance between unexpected behavior of other drivers/pedestrians and at the same time not to be too defensive so that normal traffic flow is maintained.
In this paper we apply deep reinforcement learning to the problem of forming long term driving strategies. We note that there are two major challenges that make autonomous driving different from other robotic tasks. First, is the necessity for ensuring functional safety - something that machine learning has difficulty with given that performance is optimized at the level of an expectation over many instances. Second, the Markov Decision Process model often used in robotics is problematic in our case because of unpredictable behavior of other agents in this multi-agent scenario. We make three contributions in our work. First, we show how policy gradient iterations can be used without Markovian assumptions. Second, we decompose the problem into a composition of a Policy for Desires (which is to be learned) and trajectory planning with hard constraints (which is not learned). The goal of Desires is to enable comfort of driving, while hard constraints guarantees the safety of driving. Third, we introduce a hierarchical temporal abstraction we call an "Option Graph" with a gating mechanism that significantly reduces the effective horizon and thereby reducing the variance of the gradient estimation even further.
from cs.AI updates on arXiv.org http://ift.tt/2epP7XV
via IFTTT
Is psychosis caused by defective dissociation? An Artificial Life model for schizophrenia. (arXiv:1610.03417v1 [q-bio.NC])
Both neurobiological and environmental factors are known to play a role in the origin of schizophrenia, but no model has been proposed that accounts for both. This work presents a functional model of schizophrenia that merges psychodynamic elements with ingredients borrowed from the theory of psychological traumas, and evidences the interplay of traumatic experiences and defective mental functions in the pathogenesis of the disorder. Our model foresees that dissociation is a standard tool used by the mind to protect itself from emotional pain. In case of repeated traumas, the mind learns to adopt selective forms of dissociation to avoid pain without losing touch with external reality. We conjecture that this process is defective in schizophrenia, where dissociation is either too weak, giving rise to positive symptoms, or too strong, causing negative symptoms.
from cs.AI updates on arXiv.org http://ift.tt/2dU7kKw
via IFTTT
Godseed: Benevolent or Malevolent?. (arXiv:1402.5380v2 [cs.AI] UPDATED)
It is hypothesized by some thinkers that benign looking AI objectives may result in powerful AI drives that may pose an existential risk to human society. We analyze this scenario and find the underlying assumptions to be unlikely. We examine the alternative scenario of what happens when universal goals that are not human-centric are used for designing AI agents. We follow a design approach that tries to exclude malevolent motivations from AI agents, however, we see that objectives that seem benevolent may pose significant risk. We consider the following meta-rules: preserve and pervade life and culture, maximize the number of free minds, maximize intelligence, maximize wisdom, maximize energy production, behave like human, seek pleasure, accelerate evolution, survive, maximize control, and maximize capital. We also discuss various solution approaches for benevolent behavior including selfless goals, hybrid designs, Darwinism, universal constraints, semi-autonomy, and generalization of robot laws. A "prime directive" for AI may help in formulating an encompassing constraint for avoiding malicious behavior. We hypothesize that social instincts for autonomous robots may be effective such as attachment learning. We mention multiple beneficial scenarios for an advanced semi-autonomous AGI agent in the near future including space exploration, automation of industries, state functions, and cities. We conclude that a beneficial AI agent with intelligence beyond human-level is possible and has many practical use cases.
from cs.AI updates on arXiv.org http://ift.tt/1e8nZ8D
via IFTTT
Network of Bandits. (arXiv:1602.03779v9 [cs.AI] UPDATED)
The distribution of machine learning tasks on the user's devices offers several advantages for application purposes: scalability, reduction of deployment costs and privacy. We propose a basic brick, Distributed Median Elimination, which can be used to distribute the best arm identification task in various schemes. In comparison to Median Elimination run on a single player, we showed a near optimal speed-up factor. This speed-up factor is reached with a near optimal communication cost. Experiments illustrate and complete the analysis. In comparison to {\sc Median Elimination} performed on each player, according to the analysis Distributed Median Elimination shows practical improvements.
from cs.AI updates on arXiv.org http://ift.tt/1XmBDce
via IFTTT
Limits to Verification and Validation of Agentic Behavior. (arXiv:1604.06963v2 [cs.AI] UPDATED)
Verification and validation of agentic behavior have been suggested as important research priorities in efforts to reduce risks associated with the creation of general artificial intelligence (Russell et al 2015). In this paper we question the appropriateness of using language of certainty with respect to efforts to manage that risk. We begin by establishing a very general formalism to characterize agentic behavior and to describe standards of acceptable behavior. We show that determination of whether an agent meets any particular standard is not computable. We discuss the extent of the burden associated with verification by manual proof and by automated behavioral governance. We show that to ensure decidability of the behavioral standard itself, one must further limit the capabilities of the agent. We then demonstrate that if our concerns relate to outcomes in the physical world, attempts at validation are futile. Finally, we show that layered architectures aimed at making these challenges tractable mistakenly equate intentions with actions or outcomes, thereby failing to provide any guarantees. We conclude with a discussion of why language of certainty should be eradicated from the conversation about the safety of general artificial intelligence.
from cs.AI updates on arXiv.org http://ift.tt/1WmQbti
via IFTTT
I have a new follower on Twitter
Creager
Writing code and copy at @ManifoldCo, until A.I. steps-up. Creating a better place for developers to bury their secrets: @TorusCLI. Formerly @heroku.
Halifax, Nova Scotia
https://t.co/nAgsIxIPNs
Following: 5091 - Followers: 4958
October 11, 2016 at 04:22PM via Twitter http://twitter.com/Matt_Creager
[FD] NEW VMSA-2016-0016 - vRealize Operations (vROps) updates address privilege escalation vulnerability
Source: Gmail -> IFTTT-> Blogger
[FD] Onapsis Security Advisory ONAPSIS-2016-057: Oracle E-Business Suite Cross Site Scripting (XSS)
Source: Gmail -> IFTTT-> Blogger
[FD] Onapsis Security Advisory ONAPSIS-2016-056: Oracle E-Business Suite Cross Site Scripting (XSS)
Source: Gmail -> IFTTT-> Blogger
[FD] Onapsis Security Advisory ONAPSIS-2016-055: Oracle E-Business Suite Cross Site Scripting (XSS)
Source: Gmail -> IFTTT-> Blogger
[FD] Onapsis Security Advisory ONAPSIS-2016-053: Oracle E-Business Suite Cross Site Scripting (XSS)
Source: Gmail -> IFTTT-> Blogger
[FD] Onapsis Security Advisory ONAPSIS-2016-052: Oracle E-Business Suite Cross Site Scripting (XSS)
Source: Gmail -> IFTTT-> Blogger
[FD] Onapsis Security Advisory ONAPSIS-2016-051: SAP Business Objects Memory Corruption
Source: Gmail -> IFTTT-> Blogger
[FD] Onapsis Security Advisory ONAPSIS-2016-005: SAP SLDREG memory corruption
Source: Gmail -> IFTTT-> Blogger
[FD] Onapsis Security Advisory ONAPSIS-2016-050: SAP OS Command Injection in SCTC_REFRESH_CONFIG_CTC
Source: Gmail -> IFTTT-> Blogger
[FD] Onapsis Security Advisory ONAPSIS-2016-049: SAP OS Command Injection in SCTC_REORG_SPOOL
Source: Gmail -> IFTTT-> Blogger