Latest YouTube Video
Saturday, February 25, 2017
Trump uses CPAC to attack news media's use of anonymous sources
from Google Alert - anonymous http://ift.tt/2lWFZxv
via IFTTT
Oregon House Debates Whether To Ban Anonymous Bills
from Google Alert - anonymous http://ift.tt/2lbm8pQ
via IFTTT
The President Wants to Ban Anonymous Sources for News He Does Not Like
from Google Alert - anonymous http://ift.tt/2llJBW8
via IFTTT
Orioles: Michael Bourn expected to miss four weeks after suffering broken finger while catching a football (ESPN)
via IFTTT
Trump takes aim at use of anonymous sources
from Google Alert - anonymous http://ift.tt/2lRaEf5
via IFTTT
Google Does It Again: Discloses Unpatched Microsoft Edge and IE Vulnerability
from The Hacker News http://ift.tt/2layFJS
via IFTTT
I have a new follower on Twitter
Brian Brushwood
Host of Scam School for Discovery & Hacking The System for NatGeo. Two Billboard #1 comedy albums. Eats fire. Sticks nails in eyes. Jackass and...pro dancer?
Austin, TX
http://t.co/8V78mxE476
Following: 518628 - Followers: 1588650
February 25, 2017 at 06:31AM via Twitter http://twitter.com/shwood
Friday, February 24, 2017
Ravens awarded 3rd-round compensatory pick (No. 99 overall) in 2017 draft (ESPN)
via IFTTT
Fake news? President Trump takes aim at anonymous sources
from Google Alert - anonymous http://ift.tt/2musjXb
via IFTTT
[InsideNothing] hitebook.net liked your post "[FD] [ERPSCAN-16-036] SAP ASE ODATA SERVER - DENIAL OF SERVICE"
|
Source: Gmail -> IFTTT-> Blogger
Even though he bashes anonymous sources, Trump uses them himself
from Google Alert - anonymous http://ift.tt/2lDPwZg
via IFTTT
Trump blasts media, anonymous sources
from Google Alert - anonymous http://ift.tt/2lOABvZ
via IFTTT
Ravens: Rick Wagner could become NFL's second-highest paid RT; projected to make $6.9M per season - Jamison Hensley (ESPN)
via IFTTT
How to send anonymous responses?
from Google Alert - anonymous http://ift.tt/2mu4y1h
via IFTTT
Trump Slam's Media's Use of Anonymous Sources
from Google Alert - anonymous http://ift.tt/2mg2NIQ
via IFTTT
'No anonymous sources,' Trump scolds — after WH uses them
from Google Alert - anonymous http://ift.tt/2mtEGCT
via IFTTT
'No anonymous sources,' Trump demands, though White House uses them
from Google Alert - anonymous http://ift.tt/2mfOzYr
via IFTTT
Trump: 'Enemy Of The People' Media Makes Up Anonymous Sources
from Google Alert - anonymous http://ift.tt/2lDDiOG
via IFTTT
Temporary Accounts Assistant
from Google Alert - anonymous http://ift.tt/2mfCYZq
via IFTTT
Clipped from Burlington Hawk Eye Gazette May 24, 1948
from Google Alert - anonymous http://ift.tt/2lDBzci
via IFTTT
Hacker Shows How Easy It Is To Hack People While Walking Around in Public
from The Hacker News http://ift.tt/2lN3MPT
via IFTTT
ISS Daily Summary Report – 2/23/2017
from ISS On-Orbit Status Report http://ift.tt/2mkEZAu
via IFTTT
Royal gets anonymous $6M gift
from Google Alert - anonymous http://ift.tt/2msCcV9
via IFTTT
I have a new follower on Twitter
Karl Gusner
software engineer, entrepreneur, positive energizer. CTO & co-founder of @goodaudience, TechStars London. UC Berkeley & Google Alum.
Oakland, NYC, LA, London
http://t.co/jiiI2aiZ9s
Following: 19470 - Followers: 34906
February 24, 2017 at 05:46AM via Twitter http://twitter.com/kgesus
[FD] Multiple cross-site request forgery (CSRF) vulnerabilities in the DIGISOL (DG-HR 1400) Wireless Router
Source: Gmail -> IFTTT-> Blogger
[FD] Unicorn Emulator v1.0 is out!
Source: Gmail -> IFTTT-> Blogger
[FD] Advisory X41-2017-004: Multiple Vulnerabilities in tnef
Source: Gmail -> IFTTT-> Blogger
Cloudbleed: Serious Bug Exposes Sensitive Data From Sites Sitting Behind CloudFlare
from The Hacker News http://ift.tt/2lgkbJx
via IFTTT
I have a new follower on Twitter
CrowdFundingExposure
Visit https://t.co/P3qDBpCQIg today get your campaign promoted on Twitter to 2,940,000+ & Facebook 615,000+ Donors, Investors, & Angels
USA Canada UK EU Australia
https://t.co/P3qDBpCQIg
Following: 56279 - Followers: 58920
February 24, 2017 at 04:28AM via Twitter http://twitter.com/zipfunding
I have a new follower on Twitter
Jennifer Greene
Social media marketing made easier. You don't have to be great to start, but you do have to start to be great. http://t.co/9betEcwJIV
Escondido, CA
https://t.co/m7Ewej5rxA
Following: 15470 - Followers: 19668
February 24, 2017 at 03:46AM via Twitter http://twitter.com/TyrannosaurJen
I have a new follower on Twitter
Harjinder S Kukreja
Social Activist | Traveller | Influencer | Foodie | Restaurateur | Chocolatier | Sikh | News | Gadgets | Ludhiana | Punjab | IG: harjinderkukreja (verified)
Ludhiana, Punjab
https://t.co/fWrBDzW5oA
Following: 332410 - Followers: 383118
February 24, 2017 at 02:56AM via Twitter http://twitter.com/SinghLions
California Gets Slammed Again
from NASA's Scientific Visualization Studio: Most Recent Items http://ift.tt/2lQAQXw
via IFTTT
Anonymous 2
from Google Alert - anonymous http://ift.tt/2lfLbJe
via IFTTT
Thursday, February 23, 2017
Awesome Mardi Gras moment: Boy finds $100 in Nyx purse, anonymous note to
from Google Alert - anonymous http://ift.tt/2mj3Bte
via IFTTT
A Realistic Dataset for the Smart Home Device Scheduling Problem for DCOPs. (arXiv:1702.06970v1 [cs.AI])
The field of Distributed Constraint Optimization has gained momentum in recent years thanks to its ability to address various applications related to multi-agent cooperation. While techniques to solve Distributed Constraint Optimization Problems (DCOPs) are abundant and have matured substantially since the field inception, the number of DCOP realistic applications and benchmark used to asses the performance of DCOP algorithms is lagging behind. To contrast this background we (i) introduce the Smart Home Device Scheduling (SHDS) problem, which describe the problem of coordinating smart devices schedules across multiple homes as a multi-agent system, (ii) detail the physical models adopted to simulate smart sensors, smart actuators, and homes environments, and (iii) introduce a DCOP realistic benchmark for SHDS problems.
from cs.AI updates on arXiv.org http://ift.tt/2lf4J0c
via IFTTT
Theoretical and Experimental Analysis of the Canadian Traveler Problem. (arXiv:1702.07001v1 [cs.AI])
Devising an optimal strategy for navigation in a partially observable environment is one of the key objectives in AI. One of the problem in this context is the Canadian Traveler Problem (CTP). CTP is a navigation problem where an agent is tasked to travel from source to target in a partially observable weighted graph, whose edge might be blocked with a certain probability and observing such blockage occurs only when reaching upon one of the edges end points. The goal is to find a strategy that minimizes the expected travel cost. The problem is known to be P$\#$ hard. In this work we study the CTP theoretically and empirically. First, we study the Dep-CTP, a CTP variant we introduce which assumes dependencies between the edges status. We show that Dep-CTP is intractable, and further we analyze two of its subclasses on disjoint paths graph. Second, we develop a general algorithm Gen-PAO that optimally solve the CTP. Gen-PAO is capable of solving two other types of CTP called Sensing-CTP and Expensive-Edges CTP. Since the CTP is intractable, Gen-PAO use some pruning methods to reduce the space search for the optimal solution. We also define some variants of Gen-PAO, compare their performance and show some benefits of Gen-PAO over existing work.
from cs.AI updates on arXiv.org http://ift.tt/2lLvNaj
via IFTTT
Proactive Resource Management in LTE-U Systems: A Deep Learning Perspective. (arXiv:1702.07031v1 [cs.IT])
LTE in unlicensed spectrum (LTE-U) is a promising approach to overcome the wireless spectrum scarcity. However, to reap the benefits of LTE-U, a fair coexistence mechanism with other incumbent WiFi deployments is required. In this paper, a novel deep learning approach is proposed for modeling the resource allocation problem of LTE-U small base stations (SBSs). The proposed approach enables multiple SBSs to proactively perform dynamic channel selection, carrier aggregation, and fractional spectrum access while guaranteeing fairness with existing WiFi networks and other LTE-U operators. Adopting a proactive coexistence mechanism enables future delay-intolerant LTE-U data demands to be served within a given prediction window ahead of their actual arrival time thus avoiding the underutilization of the unlicensed spectrum during off-peak hours while maximizing the total served LTE-U traffic load. To this end, a noncooperative game model is formulated in which SBSs are modeled as Homo Egualis agents that aim at predicting a sequence of future actions and thus achieving long-term equal weighted fairness with WLAN and other LTE-U operators over a given time horizon. The proposed deep learning algorithm is then shown to reach a mixed-strategy Nash equilibrium (NE), when it converges. Simulation results using real data traces show that the proposed scheme can yield up to 28% and 11% gains over a conventional reactive approach and a proportional fair coexistence mechanism, respectively. The results also show that the proposed framework prevents WiFi performance degradation for a densely deployed LTE-U network.
from cs.AI updates on arXiv.org http://ift.tt/2miqpJL
via IFTTT
A DIKW Paradigm to Cognitive Engineering. (arXiv:1702.07168v1 [cs.AI])
Though the word cognitive has a wide range of meanings we define cognitive engineering as learning from brain to bolster engineering solutions. However, giving an achievable framework to the process towards this has been a difficult task. In this work we take the classic data information knowledge wisdom (DIKW) framework to set some achievable goals and sub-goals towards cognitive engineering. A layered framework like DIKW aligns nicely with the layered structure of pre-frontal cortex. And breaking the task into sub-tasks based on the layers also makes it easier to start developmental endeavours towards achieving the final goal of a brain-inspired system.
from cs.AI updates on arXiv.org http://ift.tt/2lfbcIo
via IFTTT
Ontologies in System Engineering: a Field Report. (arXiv:1702.07193v1 [cs.AI])
In recent years ontologies enjoyed a growing popularity outside specialized AI communities. System engineering is no exception to this trend, with ontologies being proposed as a basis for several tasks in complex industrial implements, including system design, monitoring and diagnosis. In this paper, we consider four different contributions to system engineering wherein ontologies are instrumental to provide enhancements over traditional ad-hoc techniques. For each application, we briefly report the methodologies, the tools and the results obtained with the goal to provide an assessment of merits and limits of ontologies in such domains.
from cs.AI updates on arXiv.org http://ift.tt/2lxeSYV
via IFTTT
A Probabilistic Framework for Location Inference from Social Media. (arXiv:1702.07281v1 [cs.AI])
We study the extent to which we can infer users' geographical locations from social media. Location inference from social media can benefit many applications, such as disaster management, targeted advertising, and news content tailoring. In recent years, a number of algorithms have been proposed for identifying user locations on social media platforms such as Twitter and Facebook from message contents, friend networks, and interactions between users. In this paper, we propose a novel probabilistic model based on factor graphs for location inference that offers several unique advantages for this task. First, the model generalizes previous methods by incorporating content, network, and deep features learned from social context. The model is also flexible enough to support both supervised learning and semi-supervised learning. Second, we explore several learning algorithms for the proposed model, and present a Two-chain Metropolis-Hastings (MH+) algorithm, which improves the inference accuracy. Third, we validate the proposed model on three different genres of data - Twitter, Weibo, and Facebook - and demonstrate that the proposed model can substantially improve the inference accuracy (+3.3-18.5% by F1-score) over that of several state-of-the-art methods.
from cs.AI updates on arXiv.org http://ift.tt/2lLle7i
via IFTTT
Moving Beyond the Turing Test with the Allen AI Science Challenge. (arXiv:1604.04315v3 [cs.AI] UPDATED)
Given recent successes in AI (e.g., AlphaGo's victory against Lee Sedol in the game of GO), it's become increasingly important to assess: how close are AI systems to human-level intelligence? This paper describes the Allen AI Science Challenge---an approach towards that goal which led to a unique Kaggle Competition, its results, the lessons learned, and our next steps.
from cs.AI updates on arXiv.org http://ift.tt/1r7Yz4K
via IFTTT
Transferring Face Verification Nets To Pain and Expression Regression. (arXiv:1702.06925v1 [cs.CV])
Limited annotated data is available for the research of estimating facial expression intensities, which makes the training of deep networks for automated expression assessment very challenging. Fortunately, fine-tuning from a data-extensive pre-trained domain such as face verification can alleviate the problem. In this paper, we propose a transferred network that fine-tunes a state-of-the-art face verification network using expression-intensity labeled data with a regression layer. In this way, the expression regression task can benefit from the rich feature representations trained on a huge amount of data for face verification. The proposed transferred deep regressor is applied in estimating the intensity of facial action units (2017 EmotionNet Challenge) and in particular pain intensity estimation (UNBS-McMaster Shoulder-Pain dataset). It wins the second place in the challenge and achieves the state-of-the-art performance on Shoulder-Pain dataset. Particularly for Shoulder-Pain with the imbalance issue of different pain levels, a new weighted evaluation metric is proposed.
from cs.AI updates on arXiv.org http://ift.tt/2l1H1DT
via IFTTT
I have a new follower on Twitter
OMiga
A simple yet world class financial & accounting, payroll, HR, and corporate records management services for your business. We are your office engine.
St Louis, MO
https://t.co/XM5rJwZ8on
Following: 5620 - Followers: 5967
February 23, 2017 at 06:41PM via Twitter http://twitter.com/OMigaEngine
Management Accountant (Dealership)
from Google Alert - anonymous http://ift.tt/2lwVxXx
via IFTTT
Financial Controller
from Google Alert - anonymous http://ift.tt/2mihfgy
via IFTTT
Chartered Accountant
from Google Alert - anonymous http://ift.tt/2lwWXBp
via IFTTT
Commercial Accountant
from Google Alert - anonymous http://ift.tt/2migqUY
via IFTTT
Payroll and Bookkeeper
from Google Alert - anonymous http://ift.tt/2lwKwFQ
via IFTTT
Senior Finance Manager
from Google Alert - anonymous http://ift.tt/2miklkl
via IFTTT
Senior Management Accountant
from Google Alert - anonymous http://ift.tt/2lwRkTV
via IFTTT
Interim Payroll Manager
from Google Alert - anonymous http://ift.tt/2migYtK
via IFTTT
Management Accounts Assistant
from Google Alert - anonymous http://ift.tt/2lwLhhU
via IFTTT
Financial Controller, Nottingham
from Google Alert - anonymous http://ift.tt/2mihhVE
via IFTTT
Accountant
from Google Alert - anonymous http://ift.tt/2lwNp9m
via IFTTT
Year End Accountant
from Google Alert - anonymous http://ift.tt/2mi6MBz
via IFTTT
Finance Manager
from Google Alert - anonymous http://ift.tt/2lwOfTz
via IFTTT
Payroll Manager
from Google Alert - anonymous http://ift.tt/2mikl3P
via IFTTT
Management Accountant
from Google Alert - anonymous http://ift.tt/2lwQW7W
via IFTTT
5 Colour Socks
from Google Alert - anonymous http://ift.tt/2mihFmZ
via IFTTT
Payroll / Assistant Accountant
from Google Alert - anonymous http://ift.tt/2lwZ7RD
via IFTTT
Group Financial Controller
from Google Alert - anonymous http://ift.tt/2migp3m
via IFTTT
Junior Accounts Assistant
from Google Alert - anonymous http://ift.tt/2lwM5U0
via IFTTT
Junior Finance Manager
from Google Alert - anonymous http://ift.tt/2mixv0L
via IFTTT
I have a new follower on Twitter
Towson Makerspace
Following: 21 - Followers: 0
February 23, 2017 at 05:46PM via Twitter http://twitter.com/towsonmaker
Ravens might release Dennis Pitta over his $5.5M salary, but salary-cap relief wouldn't come immediately - Jamison Hensley (ESPN)
via IFTTT
Hacker Who Knocked Million Routers Offline Using MIRAI Arrested at London Airport
from The Hacker News http://ift.tt/2l49lp0
via IFTTT
Google achieved First-Ever Successful SHA-1 Collision Attack
from The Hacker News http://ift.tt/2lzBqGt
via IFTTT
ISS Daily Summary Report – 2/22/2017
from ISS On-Orbit Status Report http://ift.tt/2lJdYss
via IFTTT
Clipped from Jewell Record May 15, 1947
from Google Alert - anonymous http://ift.tt/2lImQij
via IFTTT
Infosys panel to probe anonymous letter
from Google Alert - anonymous http://ift.tt/2kOQ3sp
via IFTTT
Clipping from Mason City Globe Gazette Tue, Nov 29, 1966
from Google Alert - anonymous http://ift.tt/2laNPQb
via IFTTT
Wednesday, February 22, 2017
Clipping from Tripoli Leader Wed, Dec 14, 1960
from Google Alert - anonymous http://ift.tt/2lrTqo7
via IFTTT
Search filter box broken for anonymous
from Google Alert - anonymous http://ift.tt/2metURg
via IFTTT
Clipping from Burlington Gazette Wed, Dec 21, 1927
from Google Alert - anonymous http://ift.tt/2lrTp3x
via IFTTT
Anonymous function repeated calls
from Google Alert - anonymous http://ift.tt/2lHKUBA
via IFTTT
Clipped from Cedar Rapids Gazette July 1, 1986
from Google Alert - anonymous http://ift.tt/2laNkWn
via IFTTT
An Integer Programming Model for Binary Knapsack Problem with Value-Related Dependencies among Elements. (arXiv:1702.06662v1 [cs.AI])
Binary Knapsack Problem (BKP) is to select a subset of an element (item) set with the highest value while keeping the total weight within the capacity of the knapsack. This paper presents an integer programming model for a variation of BKP where the value of each element may depend on selecting or ignoring other elements. Strengths of such Value-Related Dependencies are assumed to be imprecise and hard to specify. To capture this imprecision, we have proposed modeling value-related dependencies using fuzzy graphs and their algebraic structure.
from cs.AI updates on arXiv.org http://ift.tt/2lxeM1G
via IFTTT
Unsupervised Diverse Colorization via Generative Adversarial Networks. (arXiv:1702.06674v1 [cs.CV])
Colorization of grayscale images has been a hot topic in computer vision. Previous research mainly focuses on producing a colored image to match the original one. However, since many colors share the same gray value, an input grayscale image could be diversely colored while maintaining its reality. In this paper, we design a novel solution for unsupervised diverse colorization. Specifically, we leverage conditional generative adversarial networks to model the distribution of real-world item colors, in which we develop a fully convolutional generator with multi-layer noise to enhance diversity, with multi-layer condition concatenation to maintain reality, and with stride 1 to keep spatial information. With such a novel network architecture, the model yields highly competitive performance on the open LSUN bedroom dataset. The Turing test of 80 humans further indicates our generated color schemes are highly convincible.
from cs.AI updates on arXiv.org http://ift.tt/2lN6Uf1
via IFTTT
Task-driven Visual Saliency and Attention-based Visual Question Answering. (arXiv:1702.06700v1 [cs.CV])
Visual question answering (VQA) has witnessed great progress since May, 2015 as a classic problem unifying visual and textual data into a system. Many enlightening VQA works explore deep into the image and question encodings and fusing methods, of which attention is the most effective and infusive mechanism. Current attention based methods focus on adequate fusion of visual and textual features, but lack the attention to where people focus to ask questions about the image. Traditional attention based methods attach a single value to the feature at each spatial location, which losses many useful information. To remedy these problems, we propose a general method to perform saliency-like pre-selection on overlapped region features by the interrelation of bidirectional LSTM (BiLSTM), and use a novel element-wise multiplication based attention method to capture more competent correlation information between visual and textual features. We conduct experiments on the large-scale COCO-VQA dataset and analyze the effectiveness of our model demonstrated by strong empirical results.
from cs.AI updates on arXiv.org http://ift.tt/2lxbKue
via IFTTT
Causal Inference by Stochastic Complexity. (arXiv:1702.06776v1 [cs.LG])
The algorithmic Markov condition states that the most likely causal direction between two random variables X and Y can be identified as that direction with the lowest Kolmogorov complexity. Due to the halting problem, however, this notion is not computable.
We hence propose to do causal inference by stochastic complexity. That is, we propose to approximate Kolmogorov complexity via the Minimum Description Length (MDL) principle, using a score that is mini-max optimal with regard to the model class under consideration. This means that even in an adversarial setting, such as when the true distribution is not in this class, we still obtain the optimal encoding for the data relative to the class.
We instantiate this framework, which we call CISC, for pairs of univariate discrete variables, using the class of multinomial distributions. Experiments show that CISC is highly accurate on synthetic, benchmark, as well as real-world data, outperforming the state of the art by a margin, and scales extremely well with regard to sample and domain sizes.
from cs.AI updates on arXiv.org http://ift.tt/2kObrhr
via IFTTT
Using Redescription Mining to Relate Clinical and Biological Characteristics of Cognitively Impaired and Alzheimer's Disease Patients. (arXiv:1702.06831v1 [q-bio.QM])
Based on a set of subjects and a collection of descriptors obtained from the Alzheimer's Disease Neuroimaging Initiative database, we use redescription mining to find rules revealing associations between these determinants which provides insights about the Alzheimer's disease (AD). We applied a four-step redescription mining algorithm (CLUS-RM), which has been extended to engender constraint-based redescription mining (CBRM) and enables several modes of targeted exploration of specific, user-defined associations. To a large extent we confirmed known findings, previously reported in the literature. However, several redescriptions contained biological descriptors that differentiated well between the groups and for which connection to AD is still not completely explained. Examples include testosterone, ciliary neurotrophic factor, brain natriuretic peptide, insulin etc. The imaging descriptor Spatial Pattern of Abnormalities for Recognition of Early AD and levels of leptin and angiopoietin-2 in plasma were also found to be remarkably good descriptors, that may provide better understanding of AD pathogenesis. Finally, the most intriguing and novel finding was the high association of the Pregnancy-Associated Protein-A (PAPP-A) with cognitive impairment in AD. The high importance of this finding lies in the fact that PAPP-A is a metalloproteinase, known to cleave insulin-like growth factor binding proteins. Since it also shares similar substrates with A Disintegrin and Metalloproteinase family of enzymes that act as {\alpha}-secretase to physiologically cleave amyloid precursor protein (APP) in the non-amyloidogenic pathway, it could be directly involved in metabolism of APP very early during the disease course. Therefore, further studies should investigate the role of PAPP-A in the development of AD more thoroughly.
from cs.AI updates on arXiv.org http://ift.tt/2lxktga
via IFTTT
Knowledge Graph Completion via Complex Tensor Factorization. (arXiv:1702.06879v1 [cs.AI])
In statistical relational learning, knowledge graph completion deals with automatically understanding the structure of large knowledge graphs---labeled directed graphs---and predicting missing relationships---labeled edges. State-of-the-art embedding models propose different trade-offs between modeling expressiveness, and time and space complexity. We reconcile both expressiveness and complexity through the use of complex-valued embeddings and explore the link between such complex-valued embeddings and unitary diagonalization. We corroborate our approach theoretically and show that all real square matrices---thus all possible relation/adjacency matrices---are the real part of some unitarily diagonalizable matrix. This results opens the door to a lot of other applications of square matrices factorization. Our approach based on complex embeddings is arguably simple, as it only involves a Hermitian dot product, the complex counterpart of the standard dot product between real vectors, whereas other methods resort to more and more complicated composition functions to increase their expressiveness. The proposed complex embeddings are scalable to large data sets as it remains linear in both space and time, while consistently outperforming alternative approaches on standard link prediction benchmarks.
from cs.AI updates on arXiv.org http://ift.tt/2lHweTn
via IFTTT
Solving DCOPs with Distributed Large Neighborhood Search. (arXiv:1702.06915v1 [cs.AI])
The field of Distributed Constraint Optimization has gained momentum in recent years, thanks to its ability to address various applications related to multi-agent cooperation. Nevertheless, solving Distributed Constraint Optimization Problems (DCOPs) optimally is NP-hard. Therefore, in large-scale, complex applications, incomplete DCOP algorithms are necessary. Current incomplete DCOP algorithms suffer of one or more of the following limitations: they (a) find local minima without providing quality guarantees; (b) provide loose quality assessment; or (c) are unable to benefit from the structure of the problem, such as domain-dependent knowledge and hard constraints. Therefore, capitalizing on strategies from the centralized constraint solving community, we propose a Distributed Large Neighborhood Search (D-LNS) framework to solve DCOPs. The proposed framework (with its novel repair phase) provides guarantees on solution quality, refining upper and lower bounds during the iterative process, and can exploit domain-dependent structures. Our experimental results show that D-LNS outperforms other incomplete DCOP algorithms on both structured and unstructured problem instances.
from cs.AI updates on arXiv.org http://ift.tt/2lMTEHm
via IFTTT
Realization of Ontology Web Search Engine. (arXiv:1702.06934v1 [cs.AI])
This paper describes the realization of the Ontology Web Search Engine. The Ontology Web Search Engine is realizable as independent project and as a part of other projects. The main purpose of this paper is to present the Ontology Web Search Engine realization details as the part of the Semantic Web Expert System and to present the results of the Ontology Web Search Engine functioning. It is expected that the Semantic Web Expert System will be able to process ontologies from the Web, generate rules from these ontologies and develop its knowledge base.
from cs.AI updates on arXiv.org http://ift.tt/2lazd3l
via IFTTT
Recognition of Visually Perceived Compositional Human Actions by Multiple Spatio-Temporal Scales Recurrent Neural Networks. (arXiv:1602.01921v3 [cs.CV] UPDATED)
The current paper proposes a novel neural network model for recognizing visually perceived human actions. The proposed multiple spatio-temporal scales recurrent neural network (MSTRNN) model is derived by introducing multiple timescale recurrent dynamics to the conventional convolutional neural network model. One of the essential characteristics of the MSTRNN is that its architecture imposes both spatial and temporal constraints simultaneously on the neural activity which vary in multiple scales among different layers. As suggested by the principle of the upward and downward causation, it is assumed that the network can develop meaningful structures such as functional hierarchy by taking advantage of such constraints during the course of learning. To evaluate the characteristics of the model, the current study uses three types of human action video dataset consisting of different types of primitive actions and different levels of compositionality on them. The performance of the MSTRNN in testing with these dataset is compared with the ones by other representative deep learning models used in the field. The analysis of the internal representation obtained through the learning with the dataset clarifies what sorts of functional hierarchy can be developed by extracting the essential compositionality underlying the dataset.
from cs.AI updates on arXiv.org http://ift.tt/1PJbylV
via IFTTT
Adversarial Delays in Online Strongly-Convex Optimization. (arXiv:1605.06201v2 [cs.LG] UPDATED)
We consider the problem of strongly-convex online optimization in presence of adversarial delays; in a T-iteration online game, the feedback of the player's query at time t is arbitrarily delayed by an adversary for d_t rounds and delivered before the game ends, at iteration t+d_t-1. Specifically for \algo{online-gradient-descent} algorithm we show it has a simple regret bound of \Oh{\sum_{t=1}^T \log (1+ \frac{d_t}{t})}. This gives a clear and simple bound without resorting any distributional and limiting assumptions on the delays. We further show how this result encompasses and generalizes several of the existing known results in the literature. Specifically it matches the celebrated logarithmic regret \Oh{\log T} when there are no delays (i.e. d_t = 1) and regret bound of \Oh{\tau \log T} for constant delays d_t = \tau.
from cs.AI updates on arXiv.org http://ift.tt/1WJADBm
via IFTTT
Options Discovery with Budgeted Reinforcement Learning. (arXiv:1611.06824v3 [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
Anonymous Sharing Links
from Google Alert - anonymous http://ift.tt/2mmFau8
via IFTTT
Revisioning Status Warning Message Displaying to anonymous users
from Google Alert - anonymous http://ift.tt/2kNOjjd
via IFTTT
Anonymous Novels
from Google Alert - anonymous http://ift.tt/2lqxSYQ
via IFTTT
11-Year Old Linux Kernel Local Privilege Escalation Flaw Discovered
from The Hacker News http://ift.tt/2lpL4gF
via IFTTT
Orioles Interview: Zach Britton talks about developing his sinker, the team's window to compete; listen now in ESPN App (ESPN)
via IFTTT
PhD - Are anonymised databases truly anonymous?
from Google Alert - anonymous http://ift.tt/2mm6qZY
via IFTTT
anonymous snippets
from Google Alert - anonymous http://ift.tt/2l8FnAV
via IFTTT
[FD] Teradici Management Console 2.2.0 - Privilege Escalation
Source: Gmail -> IFTTT-> Blogger
[FD] EasyCom SQL iPlug Denial Of Service
Source: Gmail -> IFTTT-> Blogger
[FD] EasyCom PHP API Stack Buffer Overflow
Source: Gmail -> IFTTT-> Blogger
[FD] Synology NAS "Auto Block IP" bypass and hide real IP in Synology logs
Source: Gmail -> IFTTT-> Blogger
Are anonymised databases truly anonymous?
from Google Alert - anonymous http://ift.tt/2lFJJ5M
via IFTTT
ISS Daily Summary Report – 2/21/2017
from ISS On-Orbit Status Report http://ift.tt/2luVWZ2
via IFTTT
[FD] ProjectSend r754 - IDOR & Authentication Bypass Vulnerability
Source: Gmail -> IFTTT-> Blogger
[FD] Lock Photos Album&Videos Safe v4.3 - Directory Traversal Vulnerability
Source: Gmail -> IFTTT-> Blogger
Allow anonymous posting by group
from Google Alert - anonymous http://ift.tt/2locbbJ
via IFTTT
Beware! Don't Fall For "Font Wasn't Found" Google Chrome Malware Scam
from The Hacker News http://ift.tt/2m7diyo
via IFTTT
[InsideNothing] hitebook.net liked your post "[FD] Adobe Animate <= v15.2.1.95 Memory Corruption Vulnerability"
|
Source: Gmail -> IFTTT-> Blogger
Microsoft releases update for Flash Player, but leaves two disclosed Flaws Unpatched
from The Hacker News http://ift.tt/2lKBtSs
via IFTTT
I have a new follower on Twitter
BERNICE WILLIS
Feminist, Philanthropist, Hopeless Romantic, Idea Diva, Replacement President of a Major Soft Drink Manufacturer. I draw on fogged up windows.
Manassas, VA
Following: 2590 - Followers: 329
February 22, 2017 at 12:19AM via Twitter http://twitter.com/bernicewillis27
Tuesday, February 21, 2017
[FD] [SYSS-2016-117] ABUS Secvest (FUAA50000) - Missing Protection against Replay Attacks
Source: Gmail -> IFTTT-> Blogger
Survey of Reasoning using Neural networks. (arXiv:1702.06186v1 [cs.LG])
Reason and inference require process as well as memory skills by humans. Neural networks are able to process tasks like image recognition (better than humans) but in memory aspects are still limited (by attention mechanism, size). Recurrent Neural Network (RNN) and it's modified version LSTM are able to solve small memory contexts, but as context becomes larger than a threshold, it is difficult to use them. The Solution is to use large external memory. Still, it poses many challenges like, how to train neural networks for discrete memory representation, how to describe long term dependencies in sequential data etc. Most prominent neural architectures for such tasks are Memory networks: inference components combined with long term memory and Neural Turing Machines: neural networks using external memory resources. Also, additional techniques like attention mechanism, end to end gradient descent on discrete memory representation are needed to support these solutions. Preliminary results of above neural architectures on simple algorithms (sorting, copying) and Question Answering (based on story, dialogs) application are comparable with the state of the art. In this paper, I explain these architectures (in general), the additional techniques used and the results of their application.
from cs.AI updates on arXiv.org http://ift.tt/2kJOf4a
via IFTTT
The Dialog State Tracking Challenge with Bayesian Approach. (arXiv:1702.06199v1 [cs.AI])
Generative model has been one of the most common approaches for solving the Dialog State Tracking Problem with the capabilities to model the dialog hypotheses in an explicit manner. The most important task in such Bayesian networks models is constructing the most reliable user models by learning and reflecting the training data into the probability distribution of user actions conditional on networks states. This paper provides an overall picture of the learning process in a Bayesian framework with an emphasize on the state-of-the-art theoretical analyses of the Expectation Maximization learning algorithm.
from cs.AI updates on arXiv.org http://ift.tt/2llf0KB
via IFTTT
Beating the World's Best at Super Smash Bros. with Deep Reinforcement Learning. (arXiv:1702.06230v1 [cs.AI])
There has been a recent explosion in the capabilities of game-playing artificial intelligence. Many classes of RL tasks, from Atari games to motor control to board games, are now solvable by fairly generic algorithms, based on deep learning, that learn to play from experience with minimal knowledge of the specific domain of interest. In this work, we will investigate the performance of these methods on Super Smash Bros. Melee (SSBM), a popular console fighting game. The SSBM environment has complex dynamics and partial observability, making it challenging for human and machine alike. The multi-player aspect poses an additional challenge, as the vast majority of recent advances in RL have focused on single-agent environments. Nonetheless, we will show that it is possible to train agents that are competitive against and even surpass human professionals, a new result for the multi-player video game setting.
from cs.AI updates on arXiv.org http://ift.tt/2l5Qn27
via IFTTT
Sample Efficient Policy Search for Optimal Stopping Domains. (arXiv:1702.06238v1 [cs.AI])
Arising naturally in many fields, optimal stopping problems consider the question of deciding when to stop an observation-generating process. We examine the problem of simultaneously learning and planning in such domains, when data is collected directly from the environment. We propose GFSE, a simple and flexible model-free policy search method that reuses data for sample efficiency by leveraging problem structure. We bound the sample complexity of our approach to guarantee uniform convergence of policy value estimates, tightening existing PAC bounds to achieve logarithmic dependence on horizon length for our setting. We also examine the benefit of our method against prevalent model-based and model-free approaches on 3 domains taken from diverse fields.
from cs.AI updates on arXiv.org http://ift.tt/2kJEl2h
via IFTTT
Towards a Common Implementation of Reinforcement Learning for Multiple Robotic Tasks. (arXiv:1702.06329v1 [cs.AI])
Mobile robots are increasingly being employed for performing complex tasks in dynamic environments. Reinforcement learning (RL) methods are recognized to be promising for specifying such tasks in a relatively simple manner. However, the strong dependency between the learning method and the task to learn is a well-known problem that restricts practical implementations of RL in robotics, often requiring major modifications of parameters and adding other techniques for each particular task. In this paper we present a practical core implementation of RL which enables the learning process for multiple robotic tasks with minimal per-task tuning or none. Based on value iteration methods, this implementation includes a novel approach for action selection, called Q-biased softmax regression (QBIASSR), which avoids poor performance of the learning process when the robot reaches new unexplored states. Our approach takes advantage of the structure of the state space by attending the physical variables involved (e.g., distances to obstacles, X,Y,{\theta} pose, etc.), thus experienced sets of states may favor the decision-making process of unexplored or rarely-explored states. This improvement has a relevant role in reducing the tuning of the algorithm for particular tasks. Experiments with real and simulated robots, performed with the software framework also introduced here, show that our implementation is effectively able to learn different robotic tasks without tuning the learning method. Results also suggest that the combination of true online SARSA({\lambda}) with QBIASSR can outperform the existing RL core algorithms in low-dimensional robotic tasks.
from cs.AI updates on arXiv.org http://ift.tt/2kJOkEH
via IFTTT