Latest YouTube Video
Saturday, March 19, 2016
I have a new follower on Twitter
Business Rockstars
Business Rockstars is Everything Entrepreneur. We are the largest daily producer of entrepreneurial content - bringing together CEO's, Startups, & Entrepreneurs
California
http://t.co/9CDKIhCNK6
Following: 272749 - Followers: 499071
March 19, 2016 at 09:10PM via Twitter http://twitter.com/bizrockstars
Can someone walk me through this? anonymous called function
from Google Alert - anonymous http://ift.tt/25bO93z
via IFTTT
Valley view high school science class gets anonymous donation
from Google Alert - anonymous http://ift.tt/1Lxg5IE
via IFTTT
Security Researcher Goes Missing, Who Investigated Bangladesh Bank Hack
from The Hacker News http://ift.tt/1MtKVNh
via IFTTT
Ravens: Joe Flacco among teammates \"devastated\" by loss of Tray Walker - \"this is very hard to wrap my head around\" (ESPN)
via IFTTT
'leak' of Donald Trump's cell phone and SSN are nothing new
from Google Alert - anonymous http://ift.tt/1pSB0fm
via IFTTT
What to Know About the Worldwide Hacker Group 'Anonymous'
from Google Alert - anonymous http://ift.tt/1Rap4ML
via IFTTT
Bored With Chess? Here's How To Play Basketball in Facebook Messenger
from The Hacker News http://ift.tt/25aSS5o
via IFTTT
Apple Engineers say they may Quit if ordered to Unlock iPhone by FBI
from The Hacker News http://ift.tt/1pAb8Fj
via IFTTT
How to Make $100,000? Just Hack Google Chromebook
from The Hacker News http://ift.tt/1TVVK2c
via IFTTT
The W in Cassiopeia
Friday, March 18, 2016
Trump Airtime, Anonymous Sources & Locker Room Interviews
from Google Alert - anonymous http://ift.tt/1ptUbf5
via IFTTT
anonymous user menu in wp admin bar?
from Google Alert - anonymous http://ift.tt/1VlnxZr
via IFTTT
I have a new follower on Twitter
Elizabeth Cud.
There are two levers for moving.. interest and fear
Following: 1646 - Followers: 600
March 18, 2016 at 06:55PM via Twitter http://twitter.com/elizcudder
Ravens: John Harbaugh writes open letter to his players after Tray Walker seriously injured; \"take care of each other\" (ESPN)
via IFTTT
Anonymous have made their first attack on Donald Trump
from Google Alert - anonymous http://ift.tt/1R8Nc2s
via IFTTT
The Best Way to Send and Receive End-to-End Encrypted Emails
from The Hacker News http://ift.tt/1TUkHv0
via IFTTT
NFL: Ravens CB Tray Walker \"fighting for his life\" after motorcycle accident on Thursday, agent tells Baltimore Sun (ESPN)
via IFTTT
Malvertising Campaign Hits Top Websites to Spread Ransomware
from The Hacker News http://ift.tt/1R2VSe2
via IFTTT
ISS Daily Summary Report – 03/17/16
from ISS On-Orbit Status Report http://ift.tt/1RqzcjG
via IFTTT
Anonymous claims they Hacked Donald Trump ...Really?
from The Hacker News http://ift.tt/1MdNacw
via IFTTT
'Anonymous' claims it has hacked Trump's personal info
from Google Alert - anonymous http://ift.tt/1UGfNR9
via IFTTT
The Roots Celebrate St. Patrick's Day, Anonymous Declares War on Trump
from Google Alert - anonymous http://ift.tt/1WvodtI
via IFTTT
Ever Wonder How Facebook Decides — How much Bounty Should be Paid?
from The Hacker News http://ift.tt/1RouKs5
via IFTTT
I have a new follower on Twitter
Mark Somol
Technology company builder. leadership | venture capital | startups | soccer | skiing | drummer | triathlons.
Boston, MA
https://t.co/2UouIr8iEF
Following: 3238 - Followers: 3550
March 18, 2016 at 02:35AM via Twitter http://twitter.com/marksomol
Close Comet and Large Magellanic Cloud
Thursday, March 17, 2016
NFL: Ravens CB Tray Walker in critical condition after motorcycle accident; \"This is devastating news\" - John Harbaugh (ESPN)
via IFTTT
Hardware Acceleration for Boolean Satisfiability Solver by Applying Belief Propagation Algorithm. (arXiv:1603.05314v1 [cs.AI])
Boolean satisfiability (SAT) has an extensive application domain in computer science, especially in electronic design automation applications. Circuit synthesis, optimization, and verification problems can be solved by transforming original problems to SAT problems. However, the SAT problem is known as NP-complete, which means there is no efficient method to solve it. Therefore, an efficient SAT solver to enhance the performance is always desired. We propose a hardware acceleration method for SAT problems. By surveying the properties of SAT problems and the decoding of low-density parity-check (LDPC) codes, a special class of error-correcting codes, we discover that both of them are constraint satisfaction problems. The belief propagation algorithm has been successfully applied to the decoding of LDPC, and the corresponding decoder hardware designs are extensively studied. Therefore, we proposed a belief propagation based algorithm to solve SAT problems. With this algorithm, the SAT solver can be accelerated by hardware. A software simulator is implemented to verify the proposed algorithm and the performance improvement is estimated. Our experiment results show that time complexity does not increase with the size of SAT problems and the proposed method can achieve at least 30x speedup compared to MiniSat.
from cs.AI updates on arXiv.org http://ift.tt/1MqpwnW
via IFTTT
Neural Aggregation Network for Video Face Recognition. (arXiv:1603.05474v1 [cs.CV])
In this paper, we present a Neural Aggregation Network (NAN) for video face recognition. The network takes a face video or face image set of a person with variable number of face frames as its input, and produces a compact and fixed-dimension visual representation of that person. The whole network is composed of two modules. The feature embedding module is a CNN which maps each face frame into a feature representation. The neural aggregation module is composed of two content based attention blocks which is driven by a memory storing all the features extracted from the face video through the feature embedding module. The output of the first attention block adapts the second, whose output is adopted as the aggregated representation of the video faces. Due to the attention mechanism, this representation is invariant to the order of the face frames. The experiments show that the proposed NAN consistently outperforms hand-crafted aggregations such as average pooling, and achieves state-of-the-art accuracy on three video face recognition datasets: the YouTube Face, IJB-A and Celebrity-1000 datasets.
from cs.AI updates on arXiv.org http://ift.tt/1SX15Wb
via IFTTT
Mapping Temporal Variables into the NeuCube for Improved Pattern Recognition, Predictive Modelling and Understanding of Stream Data. (arXiv:1603.05594v1 [cs.NE])
This paper proposes a new method for an optimized mapping of temporal variables, describing a temporal stream data, into the recently proposed NeuCube spiking neural network architecture. This optimized mapping extends the use of the NeuCube, which was initially designed for spatiotemporal brain data, to work on arbitrary stream data and to achieve a better accuracy of temporal pattern recognition, a better and earlier event prediction and a better understanding of complex temporal stream data through visualization of the NeuCube connectivity. The effect of the new mapping is demonstrated on three bench mark problems. The first one is early prediction of patient sleep stage event from temporal physiological data. The second one is pattern recognition of dynamic temporal patterns of traffic in the Bay Area of California and the last one is the Challenge 2012 contest data set. In all cases the use of the proposed mapping leads to an improved accuracy of pattern recognition and event prediction and a better understanding of the data when compared to traditional machine learning techniques or spiking neural network reservoirs with arbitrary mapping of the variables.
from cs.AI updates on arXiv.org http://ift.tt/1Mqpw7G
via IFTTT
Mapping Temporal Variables into the NeuCube for Improved Pattern Recognition, Predictive Modelling and Understanding of Stream Data. (arXiv:1603.05594v1 [cs.NE])
This paper proposes a new method for an optimized mapping of temporal variables, describing a temporal stream data, into the recently proposed NeuCube spiking neural network architecture. This optimized mapping extends the use of the NeuCube, which was initially designed for spatiotemporal brain data, to work on arbitrary stream data and to achieve a better accuracy of temporal pattern recognition, a better and earlier event prediction and a better understanding of complex temporal stream data through visualization of the NeuCube connectivity. The effect of the new mapping is demonstrated on three bench mark problems. The first one is early prediction of patient sleep stage event from temporal physiological data. The second one is pattern recognition of dynamic temporal patterns of traffic in the Bay Area of California and the last one is the Challenge 2012 contest data set. In all cases the use of the proposed mapping leads to an improved accuracy of pattern recognition and event prediction and a better understanding of the data when compared to traditional machine learning techniques or spiking neural network reservoirs with arbitrary mapping of the variables.
from cs.AI updates on arXiv.org http://ift.tt/1Mqpw7G
via IFTTT
PERCH: Perception via Search for Multi-Object Recognition and Localization. (arXiv:1510.05613v2 [cs.CV] UPDATED)
In many robotic domains such as flexible automated manufacturing or personal assistance, a fundamental perception task is that of identifying and localizing objects whose 3D models are known. Canonical approaches to this problem include discriminative methods that find correspondences between feature descriptors computed over the model and observed data. While these methods have been employed successfully, they can be unreliable when the feature descriptors fail to capture variations in observed data; a classic cause being occlusion. As a step towards deliberative reasoning, we present PERCH: PErception via SeaRCH, an algorithm that seeks to find the best explanation of the observed sensor data by hypothesizing possible scenes in a generative fashion. Our contributions are: i) formulating the multi-object recognition and localization task as an optimization problem over the space of hypothesized scenes, ii) exploiting structure in the optimization to cast it as a combinatorial search problem on what we call the Monotone Scene Generation Tree, and iii) leveraging parallelization and recent advances in multi-heuristic search in making combinatorial search tractable. We prove that our system can guaranteedly produce the best explanation of the scene under the chosen cost function, and validate our claims on real world RGB-D test data. Our experimental results show that we can identify and localize objects under heavy occlusion--cases where state-of-the-art methods struggle.
from cs.AI updates on arXiv.org http://ift.tt/1klm4nn
via IFTTT
Detecting events and key actors in multi-person videos. (arXiv:1511.02917v2 [cs.CV] UPDATED)
Multi-person event recognition is a challenging task, often with many people active in the scene but only a small subset contributing to an actual event. In this paper, we propose a model which learns to detect events in such videos while automatically "attending" to the people responsible for the event. Our model does not use explicit annotations regarding who or where those people are during training and testing. In particular, we track people in videos and use a recurrent neural network (RNN) to represent the track features. We learn time-varying attention weights to combine these features at each time-instant. The attended features are then processed using another RNN for event detection/classification. Since most video datasets with multiple people are restricted to a small number of videos, we also collected a new basketball dataset comprising 257 basketball games with 14K event annotations corresponding to 11 event classes. Our model outperforms state-of-the-art methods for both event classification and detection on this new dataset. Additionally, we show that the attention mechanism is able to consistently localize the relevant players.
from cs.AI updates on arXiv.org http://ift.tt/1M58JJ4
via IFTTT
Semantic Folding Theory And its Application in Semantic Fingerprinting. (arXiv:1511.08855v2 [cs.AI] UPDATED)
Human language is recognized as a very complex domain since decades. No computer system has been able to reach human levels of performance so far. The only known computational system capable of proper language processing is the human brain. While we gather more and more data about the brain, its fundamental computational processes still remain obscure. The lack of a sound computational brain theory also prevents the fundamental understanding of Natural Language Processing. As always when science lacks a theoretical foundation, statistical modeling is applied to accommodate as many sampled real-world data as possible. An unsolved fundamental issue is the actual representation of language (data) within the brain, denoted as the Representational Problem. Starting with Jeff Hawkins' Hierarchical Temporal Memory (HTM) theory, a consistent computational theory of the human cortex, we have developed a corresponding theory of language data representation: The Semantic Folding Theory. The process of encoding words, by using a topographic semantic space as distributional reference frame into a sparse binary representational vector is called Semantic Folding and is the central topic of this document. Semantic Folding describes a method of converting language from its symbolic representation (text) into an explicit, semantically grounded representation that can be generically processed by Hawkins' HTM networks. As it turned out, this change in representation, by itself, can solve many complex NLP problems by applying Boolean operators and a generic similarity function like the Euclidian Distance. Many practical problems of statistical NLP systems, like the high cost of computation, the fundamental incongruity of precision and recall , the complex tuning procedures etc., can be elegantly overcome by applying Semantic Folding.
from cs.AI updates on arXiv.org http://ift.tt/1l3NI94
via IFTTT
Anonymous says it just released some of Trump's very personal info
from Google Alert - anonymous http://ift.tt/1nSBOiB
via IFTTT
Suppressing the Unusual: towards Robust CNNs using Symmetric Activation Functions. (arXiv:1603.05145v1 [cs.CV])
Many deep Convolutional Neural Networks (CNN) make incorrect predictions on adversarial samples obtained by imperceptible perturbations of clean samples. We hypothesize that this is caused by a failure to suppress unusual signals within network layers. As remedy we propose the use of Symmetric Activation Functions (SAF) in non-linear signal transducer units. These units suppress signals of exceptional magnitude. We prove that SAF networks can perform classification tasks to arbitrary precision in a simplified situation. In practice, rather than use SAFs alone, we add them into CNNs to improve their robustness. The modified CNNs can be easily trained using popular strategies with the moderate training load. Our experiments on MNIST and CIFAR-10 show that the modified CNNs perform similarly to plain ones on clean samples, and are remarkably more robust against adversarial and nonsense samples.
from cs.AI updates on arXiv.org http://ift.tt/1QYREUQ
via IFTTT
I have a new follower on Twitter
PiX
Camille @Homadeus co-founder (http://t.co/x3LXHW5r2P) Security Architect at @SII_Ouest https://t.co/NF9ymWmmjs #IoT #InfoSec #LulzSec #Rants and #Stuff
Rennes, France
http://t.co/x3LXHW5r2P
Following: 720 - Followers: 8407
March 17, 2016 at 04:14PM via Twitter http://twitter.com/pix
[FD] New Security Tool: Enteletaor - Broker & MQ Injection tool
Source: Gmail -> IFTTT-> Blogger
[FD] BigTree 4.2.8: Object Injection & Improper Filename Sanitation
Source: Gmail -> IFTTT-> Blogger
[FD] PivotX 2.3.11: Code Execution
Source: Gmail -> IFTTT-> Blogger
[FD] PivotX 2.3.11: Directory Traversal
Source: Gmail -> IFTTT-> Blogger
[FD] PivotX 2.3.11: Reflected XSS
Source: Gmail -> IFTTT-> Blogger
[FD] Zenphoto 1.4.11: RFI
Source: Gmail -> IFTTT-> Blogger
DARPA Invites Geeks to Convert Everyday Objects into Deadly Weapons
from The Hacker News http://ift.tt/1UCYWia
via IFTTT
Ravens: After shedding \"gnarly\" 3-year-old beard, Eric Weddle \"regretting it by the second that I shaved it\" - Hensley (ESPN)
via IFTTT
ISS Daily Summary Report – 03/16/16
from ISS On-Orbit Status Report http://ift.tt/1pNvlHj
via IFTTT
Warning — Hackers can Silently Install Malware to Non-Jailbroken iOS Devices
from The Hacker News http://ift.tt/1pNmdT3
via IFTTT
New Exploit to 'Hack Android Phones Remotely' threatens Millions of Devices
from The Hacker News http://ift.tt/1RQdEO4
via IFTTT
A Phoenix Aurora over Iceland
Wednesday, March 16, 2016
One-Shot Generalization in Deep Generative Models. (arXiv:1603.05106v1 [stat.ML])
Humans have an impressive ability to reason about new concepts and experiences from just a single example. In particular, humans have an ability for one-shot generalization: an ability to encounter a new concept, understand its structure, and then be able to generate compelling alternative variations of the concept. We develop machine learning systems with this important capacity by developing new deep generative models, models that combine the representational power of deep learning with the inferential power of Bayesian reasoning. We develop a class of sequential generative models that are built on the principles of feedback and attention. These two characteristics lead to generative models that are among the state-of-the art in density estimation and image generation. We demonstrate the one-shot generalization ability of our models using three tasks: unconditional sampling, generating new exemplars of a given concept, and generating new exemplars of a family of concepts. In all cases our models are able to generate compelling and diverse samples---having seen new examples just once---providing an important class of general-purpose models for one-shot machine learning.
from cs.AI updates on arXiv.org http://ift.tt/1nPBWiT
via IFTTT
Human Gender Classification: A Review. (arXiv:1507.05122v2 [cs.AI] UPDATED)
Gender contains a wide range of information regarding to the characteristics difference between male and female. Successful gender recognition is essential and critical for many applications in the commercial domains such as applications of human-computer interaction and computer-aided physiological or psychological analysis. Some have proposed various approaches for automatic gender classification using the features derived from human bodies and/or behaviors. First, this paper introduces the challenge and application for gender classification research. Then, the development and framework of gender classification are described. Besides, we compare these state-of-the-art approaches, including vision-based methods, biological information-based method, and social network information-based method, to provide a comprehensive review in the area of gender classification. In mean time, we highlight the strength and discuss the limitation of each method. Finally, this review also discusses several promising applications for the future work.
from cs.AI updates on arXiv.org http://ift.tt/1gKUM80
via IFTTT
Spatial Concept Acquisition for a Mobile Robot that Integrates Self-Localization and Unsupervised Word Discovery from Spoken Sentences. (arXiv:1602.01208v2 [cs.AI] UPDATED)
In this paper, we propose a novel unsupervised learning method for the lexical acquisition of words related to places visited by robots, from human continuous speech signals. We address the problem of learning novel words by a robot that has no prior knowledge of these words except for a primitive acoustic model. Further, we propose a method that allows a robot to effectively use the learned words and their meanings for self-localization tasks. The proposed method is nonparametric Bayesian spatial concept acquisition method (SpCoA) that integrates the generative model for self-localization and the unsupervised word segmentation in uttered sentences via latent variables related to the spatial concept. We implemented the proposed method SpCoA on SIGVerse, which is a simulation environment, and TurtleBot2, which is a mobile robot in a real environment. Further, we conducted experiments for evaluating the performance of SpCoA. The experimental results showed that SpCoA enabled the robot to acquire the names of places from speech sentences. They also revealed that the robot could effectively utilize the acquired spatial concepts and reduce the uncertainty in self-localization.
from cs.AI updates on arXiv.org http://ift.tt/1NR5z9c
via IFTTT
Domain Adaptation via Maximum Independence of Domain Features. (arXiv:1603.04535v1 [cs.CV])
When the distributions of the source and the target domains are different, domain adaptation techniques are needed. For example, in the field of sensors and measurement, discrete and continuous distributional change often exist in data because of instrumental variation and time-varying sensor drift. In this paper, we propose maximum independence domain adaptation (MIDA) to address this problem. Domain features are first defined to describe the background information of a sample, such as the device label and acquisition time. Then, MIDA learns features which have maximal independence with the domain features, so as to reduce the inter-domain discrepancy in distributions. A feature augmentation strategy is designed so that the learned projection is background-specific. Semi-supervised MIDA (SMIDA) extends MIDA by exploiting the label information. The proposed methods can handle not only discrete domains in traditional domain adaptation problems but also continuous distributional change such as the time-varying drift. In addition, they are naturally applicable in supervised/semi-supervised/unsupervised classification or regression problems with multiple domains. This flexibility brings potential for a wide range of applications. The effectiveness of our approaches is verified by experiments on synthetic datasets and four real-world ones on sensors, measurement, and computer vision.
from cs.AI updates on arXiv.org http://ift.tt/1VaLUZH
via IFTTT
An Anonymous Donor in Dubai Sent England an Emergency Biscuit Shipment
from Google Alert - anonymous http://ift.tt/1pMvkU9
via IFTTT
Ubercart anonymous checkout not working
from Google Alert - anonymous http://ift.tt/1Vdzoc2
via IFTTT
NFL: Ex-Ravens S Will Hill suspended 10 games for violating league's substance abuse policy - Adam Schefter, Adam Caplan (ESPN)
via IFTTT
New Policy Re Anonymous Sources Can Help Spur Less Biased Media Coverage
from Google Alert - anonymous http://ift.tt/1Xvylmt
via IFTTT
'The Fappening' Hacker Reveals How He Stole Nude Pics of Over 100 Celebrities
from The Hacker News http://ift.tt/1S4uAD3
via IFTTT
Question about anonymous posting
from Google Alert - anonymous http://ift.tt/254AlYr
via IFTTT
More than a Billion Snapdragon-based Android Phones Vulnerable to Hacking
from The Hacker News http://ift.tt/1Xv2YZc
via IFTTT
Russia Rejects Google's Appeal and Orders to Stop Pre-Installing its own Android Apps
from The Hacker News http://ift.tt/1QXLdA6
via IFTTT
ISS Daily Summary Report – 03/15/16
from ISS On-Orbit Status Report http://ift.tt/1Rm7Zic
via IFTTT
I have a new follower on Twitter
News Curator
News Curator provides automated personalized news. Our app observes your social networks and gets smarter every time you use it. Stop searching, start reading.
Zurich, Switzerland
https://t.co/qRg8LdvmTc
Following: 4840 - Followers: 5312
March 16, 2016 at 05:51AM via Twitter http://twitter.com/newscuratorapp
Tuesday, March 15, 2016
'total war' on Trump
from Google Alert - anonymous http://ift.tt/1RjZLxj
via IFTTT
Sequential Voting Promotes Collective Discovery in Social Recommendation Systems. (arXiv:1603.04466v1 [cs.SI])
One goal of online social recommendation systems is to harness the wisdom of crowds in order to identify high quality content. Yet the sequential voting mechanisms that are commonly used by these systems are at odds with existing theoretical and empirical literature on optimal aggregation. This literature suggests that sequential voting will promote herding---the tendency for individuals to copy the decisions of others around them---and hence lead to suboptimal content recommendation. Is there a problem with our practice, or a problem with our theory? Previous attempts at answering this question have been limited by a lack of objective measurements of content quality. Quality is typically defined endogenously as the popularity of content in absence of social influence. The flaw of this metric is its presupposition that the preferences of the crowd are aligned with underlying quality. Domains in which content quality can be defined exogenously and measured objectively are thus needed in order to better assess the design choices of social recommendation systems. In this work, we look to the domain of education, where content quality can be measured via how well students are able to learn from the material presented to them. Through a behavioral experiment involving a simulated massive open online course (MOOC) run on Amazon Mechanical Turk, we show that sequential voting systems can surface better content than systems that elicit independent votes.
from cs.AI updates on arXiv.org http://ift.tt/22ksd3S
via IFTTT
Optimal Sensing via Multi-armed Bandit Relaxations in Mixed Observability Domains. (arXiv:1603.04586v1 [cs.AI])
Sequential decision making under uncertainty is studied in a mixed observability domain. The goal is to maximize the amount of information obtained on a partially observable stochastic process under constraints imposed by a fully observable internal state. An upper bound for the optimal value function is derived by relaxing constraints. We identify conditions under which the relaxed problem is a multi-armed bandit whose optimal policy is easily computable. The upper bound is applied to prune the search space in the original problem, and the effect on solution quality is assessed via simulation experiments. Empirical results show effective pruning of the search space in a target monitoring domain.
from cs.AI updates on arXiv.org http://ift.tt/1VaM9UL
via IFTTT
The SP theory of intelligence: distinctive features and advantages. (arXiv:1508.04087v6 [cs.AI] UPDATED)
This paper highlights distinctive features of the "SP theory of intelligence" and its apparent advantages compared with some AI-related alternatives. Distinctive features and advantages are: simplification and integration of observations and concepts; simplification and integration of structures and processes in computing systems; the theory is itself a theory of computing; it can be the basis for new architectures for computers; information compression via the matching and unification of patterns and, more specifically, via multiple alignment, is fundamental; transparency in the representation and processing of knowledge; the discovery of 'natural' structures via information compression (DONSVIC); interpretations of mathematics; interpretations in human perception and cognition; and realisation of abstract concepts in terms of neurons and their inter-connections ("SP-neural"). These things relate to AI-related alternatives: minimum length encoding and related concepts; deep learning in neural networks; unified theories of cognition and related research; universal search; Bayesian networks and more; pattern recognition and vision; the analysis, production, and translation of natural language; Unsupervised learning of natural language; exact and inexact forms of reasoning; representation and processing of diverse forms of knowledge; IBM's Watson; software engineering; solving problems associated with big data, and in the development of intelligence in autonomous robots. In conclusion, the SP system can provide a firm foundation for the long-term development of AI, with many potential benefits and applications. It may also deliver useful results on relatively short timescales. A high-parallel, open-source version of the SP machine, derived from the SP computer model, would be a means for researchers everywhere to explore what can be done with the system, and to create new versions of it.
from cs.AI updates on arXiv.org http://ift.tt/1IYrqMV
via IFTTT
End-to-End Attention-based Large Vocabulary Speech Recognition. (arXiv:1508.04395v2 [cs.CL] UPDATED)
Many of the current state-of-the-art Large Vocabulary Continuous Speech Recognition Systems (LVCSR) are hybrids of neural networks and Hidden Markov Models (HMMs). Most of these systems contain separate components that deal with the acoustic modelling, language modelling and sequence decoding. We investigate a more direct approach in which the HMM is replaced with a Recurrent Neural Network (RNN) that performs sequence prediction directly at the character level. Alignment between the input features and the desired character sequence is learned automatically by an attention mechanism built into the RNN. For each predicted character, the attention mechanism scans the input sequence and chooses relevant frames. We propose two methods to speed up this operation: limiting the scan to a subset of most promising frames and pooling over time the information contained in neighboring frames, thereby reducing source sequence length. Integrating an n-gram language model into the decoding process yields recognition accuracies similar to other HMM-free RNN-based approaches.
from cs.AI updates on arXiv.org http://ift.tt/1TSgRDl
via IFTTT
Anonymous declares 'total war'
from Google Alert - anonymous http://ift.tt/1TMnB4R
via IFTTT
Ravens: LB Terrell Suggs formally charged with 2 misdemeanors for one-car accident on March 5; both often lead to fines (ESPN)
via IFTTT
Anonymous has Declared 'Total War' on Donald Trump
from Google Alert - anonymous http://ift.tt/1nMfMyf
via IFTTT
Alcoholics anonymous
from Google Alert - anonymous http://ift.tt/1ps0rVl
via IFTTT
Ravens: WR Mike Wallace agrees to contract - Jamison Hensley and NFL Network; released by Vikings March 8 after 1 season (ESPN)
via IFTTT
After Apple, WhatsApp Under Fire from US Govt Over Encryption
from The Hacker News http://ift.tt/1Mkm2Dz
via IFTTT
Anonymous declares 'total war'
from Google Alert - anonymous http://ift.tt/1RLxBoZ
via IFTTT
Hackivist group Anonymous targets Donald Trump's campaign
from Google Alert - anonymous http://ift.tt/1V9b5fo
via IFTTT
ISS Daily Summary Report – 03/14/16
from ISS On-Orbit Status Report http://ift.tt/1pllEzl
via IFTTT
Anonymous declares war on Donald Trump
from Google Alert - anonymous http://ift.tt/1TKTgDY
via IFTTT
Annual Arctic Sea Ice Minimum 1979-2015 with Area Graph
from NASA's Scientific Visualization Studio: Most Popular
via IFTTT
Monday, March 14, 2016
15 sources
from Google Alert - anonymous http://ift.tt/22hcMtc
via IFTTT
[FD] [CFP] BSides Las Vegas
Source: Gmail -> IFTTT-> Blogger
Re: [FD] Security contact @ Gigabyte
Source: Gmail -> IFTTT-> Blogger
Re: [FD] Security contact @ Gigabyte
Source: Gmail -> IFTTT-> Blogger
Demonstrating the Feasibility of Automatic Game Balancing. (arXiv:1603.03795v1 [cs.HC])
Game balancing is an important part of the (computer) game design process, in which designers adapt a game prototype so that the resulting gameplay is as entertaining as possible. In industry, the evaluation of a game is often based on costly playtests with human players. It suggests itself to automate this process using surrogate models for the prediction of gameplay and outcome. In this paper, the feasibility of automatic balancing using simulation- and deck-based objectives is investigated for the card game top trumps. Additionally, the necessity of a multi-objective approach is asserted by a comparison with the only known (single-objective) method. We apply a multi-objective evolutionary algorithm to obtain decks that optimise objectives, e.g. win rate and average number of tricks, developed to express the fairness and the excitement of a game of top trumps. The results are compared with decks from published top trumps decks using simulation-based objectives. The possibility to generate decks better or at least as good as decks from published top trumps decks in terms of these objectives is demonstrated. Our results indicate that automatic balancing with the presented approach is feasible even for more complex games such as real-time strategy games.
from cs.AI updates on arXiv.org http://ift.tt/1pklwAm
via IFTTT
Solving MaxSAT by Successive Calls to a SAT Solver. (arXiv:1603.03814v1 [cs.AI])
The Maximum Satisfiability (MaxSAT) problem is the problem of finding a truth assignment that maximizes the number of satisfied clauses of a given Boolean formula in Conjunctive Normal Form (CNF). Many exact solvers for MaxSAT have been developed during recent years, and many of them were presented in the well-known SAT conference. Algorithms for MaxSAT generally fall into two categories: (1) branch and bound algorithms and (2) algorithms that use successive calls to a SAT solver (SAT- based), which this paper in on. In practical problems, SAT-based algorithms have been shown to be more efficient. This paper provides an experimental investigation to compare the performance of recent SAT-based and branch and bound algorithms on the benchmarks of the MaxSAT Evaluations.
from cs.AI updates on arXiv.org http://ift.tt/1V7T4hk
via IFTTT
Sequential Short-Text Classification with Recurrent and Convolutional Neural Networks. (arXiv:1603.03827v1 [cs.CL])
Recent approaches based on artificial neural networks (ANNs) have shown promising results for short-text classification. However, many short texts occur in sequences (e.g., sentences in a document or utterances in a dialog), and most existing ANN-based systems do not leverage the preceding short texts when classifying a subsequent one. In this work, we present a model based on recurrent neural networks and convolutional neural networks that incorporates the preceding short texts. Our model achieves state-of-the-art results on three different datasets for dialog act prediction.
from cs.AI updates on arXiv.org http://ift.tt/1UcmJGQ
via IFTTT
Grounding Recursive Aggregates: Preliminary Report. (arXiv:1603.03884v1 [cs.AI])
Problem solving in Answer Set Programming consists of two steps, a first grounding phase, systematically replacing all variables by terms, and a second solving phase computing the stable models of the obtained ground program. An intricate part of both phases is the treatment of aggregates, which are popular language constructs that allow for expressing properties over sets. In this paper, we elaborate upon the treatment of aggregates during grounding in Gringo series 4. Consequently, our approach is applicable to grounding based on semi-naive database evaluation techniques. In particular, we provide a series of algorithms detailing the treatment of recursive aggregates and illustrate this by a running example.
from cs.AI updates on arXiv.org http://ift.tt/1pklwAi
via IFTTT
On Learning High Dimensional Structured Single Index Models. (arXiv:1603.03980v1 [stat.ML])
Single Index Models (SIMs) are simple yet flexible semi-parametric models for classification and regression, where response variables are modeled as a nonlinear, monotonic function of a linear combination of features. Estimation in this context requires learning both the feature weights and the nonlinear function that relates features to observations. While methods have been described to learn SIMs in the low dimensional regime, a method that can efficiently learn SIMs in high dimensions, and under general structural assumptions, has not been forthcoming. In this paper, we propose computationally efficient algorithms for SIM inference in high dimensions using atomic norm regularization. This general approach to imposing structure in high-dimensional modeling specializes to sparsity, group sparsity, and low-rank assumptions among others. We also provide a scalable, stochastic version of the method. Experiments show that the method we propose enjoys superior predictive performance when compared to generalized linear models such as logistic regression, on several real-world datasets.
from cs.AI updates on arXiv.org http://ift.tt/1Xrt0N5
via IFTTT
A Signaling Game Approach to Databases Querying and Interaction. (arXiv:1603.04068v1 [cs.DB])
As most database users cannot precisely express their information needs, it is challenging for database querying and exploration interfaces to understand them. We propose a novel formal framework for representing and understanding information needs in database querying and exploration. Our framework considers querying as a collaboration between the user and the database system to establish a mutual language for representing information needs. We formalize this collaboration as a signaling game, where each mutual language is an equilibrium for the game. A query interface is more effective if it establishes a less ambiguous mutual language faster. We discuss some equilibria, strategies, and the convergence in this game. In particular, we propose a reinforcement learning mechanism and analyze it within our framework. We prove that this adaptation mechanism for the query interface improves the effectiveness of answering queries stochastically speaking, and converges almost surely. Most importantly, we show that the proposed learning rule is robust to the choice of the metric/reward by the database.
from cs.AI updates on arXiv.org http://ift.tt/1V7T2WW
via IFTTT
Geometry of Interest (GOI): Spatio-Temporal Destination Extraction and Partitioning in GPS Trajectory Data. (arXiv:1603.04110v1 [cs.AI])
In this paper, we propose a method for extracting the geometries of interest (GOIs) of a mobile object which we define as the geometries of the points of interest (POIs) which a mobile object frequently visits. Based on extracted GOIs the area of a long-term GPS trajectory is partitioned into a grid area with inhomogeneous shaped cells. This proposes a method consists of three phases: (i) extracting the geometry of stay regions based on the concepts of time-value and the time-weighted centroid, (ii) determining the geometry of destination regions based on the extracted stay regions using a geometry based hierarchical clustering, and (iii) partitioning the trajectory area based on the geometry of the destination regions and their visit frequency. The extracted GOIs can effectively represent the geometries of the POIs of the mobile object while guaranteeing the characteristics of a valid partitioning. The proposed method is tested using a field database covering the trajectory of a mobile object with the length of 3.5 years, and the achieved results are compared to the state-of-the-art. Our experimental results show that the proposed stay extraction can detect valid stay regions with only one track point while the other methods lose those stays. Moreover, analysis of the outcomes of the method using empirical observation shows that the quality of the extracted stay regions, destination regions and the GOIs extracted by our proposed method is considerably higher than those extracted by methods proposed in the state-of-the-art.
from cs.AI updates on arXiv.org http://ift.tt/1pklvw0
via IFTTT
Bandit Approaches to Preference Learning Problems with Multiple Populations. (arXiv:1603.04118v1 [stat.ML])
In this paper we study an extension of the stochastic multi-armed bandit (MAB) framework, where in each round a player can play multiple actions and receive a stochastic reward which depends on the actions played. This problem is motivated by applications in recommendation problems where there are multiple populations of users and hence no single choice might be good for the entire population. We specifically look at bandit problems where we are allowed to make two choices in each round. We provide algorithms for this problem in both the noiseless and noisy case. Our algorithms are computationally efficient and have provable sample complexity guarantees. In the process of establishing sample complexity guarantees for our algorithms, we establish new results regarding the Nystr{\"o}m method which can be of independent interest. We supplement our theoretical results with experimental comparisons.
from cs.AI updates on arXiv.org http://ift.tt/1UcmJGB
via IFTTT
Exploratory Gradient Boosting for Reinforcement Learning in Complex Domains. (arXiv:1603.04119v1 [cs.AI])
High-dimensional observations and complex real-world dynamics present major challenges in reinforcement learning for both function approximation and exploration. We address both of these challenges with two complementary techniques: First, we develop a gradient-boosting style, non-parametric function approximator for learning on $Q$-function residuals. And second, we propose an exploration strategy inspired by the principles of state abstraction and information acquisition under uncertainty. We demonstrate the empirical effectiveness of these techniques, first, as a preliminary check, on two standard tasks (Blackjack and $n$-Chain), and then on two much larger and more realistic tasks with high-dimensional observation spaces. Specifically, we introduce two benchmarks built within the game Minecraft where the observations are pixel arrays of the agent's visual field. A combination of our two algorithmic techniques performs competitively on the standard reinforcement-learning tasks while consistently and substantially outperforming baselines on the two tasks with high-dimensional observation spaces. The new function approximator, exploration strategy, and evaluation benchmarks are each of independent interest in the pursuit of reinforcement-learning methods that scale to real-world domains.
from cs.AI updates on arXiv.org http://ift.tt/1UcmGLd
via IFTTT
Item2Vec: Neural Item Embedding for Collaborative Filtering. (arXiv:1603.04259v1 [cs.LG])
Many Collaborative Filtering (CF) algorithms are item-based in the sense that they analyze item-item relations in order to produce item similarities. Recently, several works in the field of Natural Language Processing suggested to learn a latent representation of words using neural embedding algorithms. Among them, the Skip-gram with Negative Sampling (SGNS), also known as Word2Vec, was shown to provide state-of-the-art results on various linguistics tasks. In this paper, we show that item-based CF can be cast in the same framework of neural word embedding. Inspired by SGNS, we describe a method we name Item2Vec for item-based CF that produces embedding for items in a latent space. The method is capable of inferring item-to-item relations even when user information is not available. We present experimental results on large scale datasets that demonstrate the effectiveness of the proposed method and show it provides a similarity measure that is competitive with SVD.
from cs.AI updates on arXiv.org http://ift.tt/1V7T40S
via IFTTT
Learning Network of Multivariate Hawkes Processes: A Time Series Approach. (arXiv:1603.04319v1 [cs.LG])
Learning the influence structure of multiple time series data is of great interest to many disciplines. This paper studies the problem of recovering the causal structure in network of multivariate linear Hawkes processes. In such processes, the occurrence of an event in one process affects the probability of occurrence of new events in some other processes. Thus, a natural notion of causality exists between such processes captured by the support of the excitation matrix. We show that the resulting causal influence network is equivalent to the Directed Information graph (DIG) of the processes, which encodes the causal factorization of the joint distribution of the processes. Furthermore, we present an algorithm for learning the support of excitation matrix (or equivalently the DIG). The performance of the algorithm is evaluated on synthesized multivariate Hawkes networks as well as a stock market and MemeTracker real-world dataset.
from cs.AI updates on arXiv.org http://ift.tt/1UcmGKX
via IFTTT