Latest YouTube Video
Saturday, July 30, 2016
Rumor Central: Orioles looking at Mariners SP Wade Miley (7-8, 4.98 ERA) - Today's Knuckleball (ESPN)
via IFTTT
Beautiful Stories From Anonymous People- 1: Ron Paul's Baby
from Google Alert - anonymous http://ift.tt/2a7xIBN
via IFTTT
Hillary Clinton's Presidential Campaign also Hacked in Attack on Democratic Party
from The Hacker News http://ift.tt/2aRGDUI
via IFTTT
Best Password Manager — For Windows, Linux, Mac, Android, iOS and Enterprise
from The Hacker News http://ift.tt/2a6Wimf
via IFTTT
Blue Danube Analemma
Friday, July 29, 2016
Orioles sign P Logan Ondrusek, who was pitching in Japan, and designate P Chaz Roe (3.72 ERA in 9 games) for assignment (ESPN)
via IFTTT
536M Mega Millions jackpot claimed by anonymous couple
from Google Alert - anonymous http://ift.tt/2ait2oL
via IFTTT
Ravens: OT Jake Long tells Adam Schefter he declined to sign injury waiver with Baltimore and now remains a free agent (ESPN)
via IFTTT
Ravens: WR Mike Wallace passes conditioning test, will practice Friday; missed one day of camp after failing 1st attempt (ESPN)
via IFTTT
Anonymous class with static crashes compiler in ES2015 target
from Google Alert - anonymous http://ift.tt/2aivLO0
via IFTTT
ISS Daily Summary Report – 07/28/16
from ISS On-Orbit Status Report http://ift.tt/2ajlDrC
via IFTTT
[FD] ZMS v3.2 CMS - Multiple Client Side Cross Site Scripting Web Vulnerabilities
Brazil Freezes $11.7 Million of Facebook Funds for Not Complying with Court Orders
from The Hacker News http://ift.tt/2agaMMK
via IFTTT
Herschel's Eagle Nebula
Global Terrestrial Water Storage Anomaly (March 2015 - March 2016)
from NASA's Scientific Visualization Studio: Most Recent Items http://ift.tt/2a3JXiv
via IFTTT
GRACE over Brazil (March 2015 - March 2016)
from NASA's Scientific Visualization Studio: Most Recent Items http://ift.tt/2a3JdtG
via IFTTT
Thursday, July 28, 2016
Mammalian Value Systems. (arXiv:1607.08289v1 [cs.AI])
Characterizing human values is a topic deeply interwoven with the sciences, humanities, art, and many other human endeavors. In recent years, a number of thinkers have argued that accelerating trends in computer science, cognitive science, and related disciplines foreshadow the creation of intelligent machines which meet and ultimately surpass the cognitive abilities of human beings, thereby entangling an understanding of human values with future technological development. Contemporary research accomplishments suggest sophisticated AI systems becoming widespread and responsible for managing many aspects of the modern world, from preemptively planning users' travel schedules and logistics, to fully autonomous vehicles, to domestic robots assisting in daily living. The extrapolation of these trends has been most forcefully described in the context of a hypothetical "intelligence explosion," in which the capabilities of an intelligent software agent would rapidly increase due to the presence of feedback loops unavailable to biological organisms. The possibility of superintelligent agents, or simply the widespread deployment of sophisticated, autonomous AI systems, highlights an important theoretical problem: the need to separate the cognitive and rational capacities of an agent from the fundamental goal structure, or value system, which constrains and guides the agent's actions. The "value alignment problem" is to specify a goal structure for autonomous agents compatible with human values. In this brief article, we suggest that recent ideas from affective neuroscience and related disciplines aimed at characterizing neurological and behavioral universals in the mammalian kingdom provide important conceptual foundations relevant to describing human values. We argue that the notion of "mammalian value systems" points to a potential avenue for fundamental research in AI safety and AI ethics.
from cs.AI updates on arXiv.org http://ift.tt/2arExhi
via IFTTT
Hyperparameter Optimization of Deep Neural Networks Using Non-Probabilistic RBF Surrogate Model. (arXiv:1607.08316v1 [cs.AI])
Recently, Bayesian optimization has been successfully applied for optimizing hyperparameters of deep neural networks, significantly outperforming the expert-set hyperparameter values. The methods approximate and minimize the validation error as a function of hyperparameter values through probabilistic models like Gaussian processes. However, probabilistic models that require a prior distribution of the errors may be not adequate for approximating very complex error functions of deep neural networks. In this work, we propose to employ radial basis function as the surrogate of the error functions for optimizing both continuous and integer hyperparameters. The proposed non-probabilistic algorithm, called Hyperparameter Optimization using RBF and DYCORS (HORD), searches the surrogate for the most promising hyperparameter values while providing a good balance between exploration and exploitation. Extensive evaluations demonstrate HORD significantly outperforms the well-established Bayesian optimization methods such as Spearmint and TPE, both in terms of finding a near optimal solution with fewer expensive function evaluations, and in terms of a final validation error. Further, HORD performs equally well in low- and high-dimensional hyperparameter spaces, and by avoiding expensive covariance computation can also scale to a high number of observations.
from cs.AI updates on arXiv.org http://ift.tt/2af7iKv
via IFTTT
VHT: Vertical Hoeffding Tree. (arXiv:1607.08325v1 [cs.DC])
IoT Big Data requires new machine learning methods able to scale to large size of data arriving at high speed. Decision trees are popular machine learning models since they are very effective, yet easy to interpret and visualize. In the literature, we can find distributed algorithms for learning decision trees, and also streaming algorithms, but not algorithms that combine both features. In this paper we present the Vertical Hoeffding Tree (VHT), the first distributed streaming algorithm for learning decision trees. It features a novel way of distributing decision trees via vertical parallelism. The algorithm is implemented on top of Apache SAMOA, a platform for mining distributed data streams, and thus able to run on real-world clusters. We run several experiments to study the accuracy and throughput performance of our new VHT algorithm, as well as its ability to scale while keeping its superior performance with respect to non-distributed decision trees.
from cs.AI updates on arXiv.org http://ift.tt/2aNZ0de
via IFTTT
Robust Contextual Outlier Detection: Where Context Meets Sparsity. (arXiv:1607.08329v1 [cs.DB])
Outlier detection is a fundamental data science task with applications ranging from data cleaning to network security. Given the fundamental nature of the task, this has been the subject of much research. Recently, a new class of outlier detection algorithms has emerged, called {\it contextual outlier detection}, and has shown improved performance when studying anomalous behavior in a specific context. However, as we point out in this article, such approaches have limited applicability in situations where the context is sparse (i.e. lacking a suitable frame of reference). Moreover, approaches developed to date do not scale to large datasets. To address these problems, here we propose a novel and robust approach alternative to the state-of-the-art called RObust Contextual Outlier Detection (ROCOD). We utilize a local and global behavioral model based on the relevant contexts, which is then integrated in a natural and robust fashion. We also present several optimizations to improve the scalability of the approach. We run ROCOD on both synthetic and real-world datasets and demonstrate that it outperforms other competitive baselines on the axes of efficacy and efficiency (40X speedup compared to modern contextual outlier detection methods). We also drill down and perform a fine-grained analysis to shed light on the rationale for the performance gains of ROCOD and reveal its effectiveness when handling objects with sparse contexts.
from cs.AI updates on arXiv.org http://ift.tt/2a3lNEN
via IFTTT
Faceless Person Recognition; Privacy Implications in Social Media. (arXiv:1607.08438v1 [cs.CV])
As we shift more of our lives into the virtual domain, the volume of data shared on the web keeps increasing and presents a threat to our privacy. This works contributes to the understanding of privacy implications of such data sharing by analysing how well people are recognisable in social media data. To facilitate a systematic study we define a number of scenarios considering factors such as how many heads of a person are tagged and if those heads are obfuscated or not. We propose a robust person recognition system that can handle large variations in pose and clothing, and can be trained with few training samples. Our results indicate that a handful of images is enough to threaten users' privacy, even in the presence of obfuscation. We show detailed experimental results, and discuss their implications.
from cs.AI updates on arXiv.org http://ift.tt/2aNZa4i
via IFTTT
A symbolic algebra for the computation of expected utilities in multiplicative influence diagrams. (arXiv:1607.08485v1 [cs.AI])
Influence diagrams provide a compact graphical representation of decision problems. Several algorithms for the quick computation of their associated expected utilities are available in the literature. However, often they rely on a full quantification of both probabilistic uncertainties and utility values. For problems where all random variables and decision spaces are finite and discrete, here we develop a symbolic way to calculate the expected utilities of influence diagrams that does not require a full numerical representation. Within this approach expected utilities correspond to families of polynomials. After characterizing their polynomial structure, we develop an efficient symbolic algorithm for the propagation of expected utilities through the diagram and provide an implementation of this algorithm using a computer algebra system. We then characterize many of the standard manipulations of influence diagrams as transformations of polynomials. We also generalize the decision analytic framework of these diagrams by defining asymmetries as operations over the expected utility polynomials.
from cs.AI updates on arXiv.org http://ift.tt/2a3lslN
via IFTTT
MIST: Missing Person Intelligence Synthesis Toolkit. (arXiv:1607.08580v1 [cs.AI])
Each day, approximately 500 missing persons cases occur that go unsolved/unresolved in the United States. The non-profit organization known as the Find Me Group (FMG), led by former law enforcement professionals, is dedicated to solving or resolving these cases. This paper introduces the Missing Person Intelligence Synthesis Toolkit (MIST) which leverages a data-driven variant of geospatial abductive inference. This system takes search locations provided by a group of experts and rank-orders them based on the probability assigned to areas based on the prior performance of the experts taken as a group. We evaluate our approach compared to the current practices employed by the Find Me Group and found it significantly reduces the search area - leading to a reduction of 31 square miles over 24 cases we examined in our experiments. Currently, we are using MIST to aid the Find Me Group in an active missing person case.
from cs.AI updates on arXiv.org http://ift.tt/2aNZccB
via IFTTT
Modeling selectional restrictions in a relational type system. (arXiv:1607.08592v1 [cs.CL])
Selectional restrictions are semantic constraints on forming certain complex types in natural language. The paper gives an overview of modeling selectional restrictions in a relational type system with morphological and syntactic types. We discuss some foundations of the system and ways of formalizing selectional restrictions.
Keywords: type theory, selectional restrictions, syntax, morphology
from cs.AI updates on arXiv.org http://ift.tt/2a3lmuo
via IFTTT
Modeling selectional restrictions in a relational type system. (arXiv:1607.08592v1 [cs.CL])
Selectional restrictions are semantic constraints on forming certain complex types in natural language. The paper gives an overview of modeling selectional restrictions in a relational type system with morphological and syntactic types. We discuss some foundations of the system and ways of formalizing selectional restrictions.
Keywords: type theory, selectional restrictions, syntax, morphology
from cs.AI updates on arXiv.org http://ift.tt/2a3lmuo
via IFTTT
Multi-Agent Continuous Transportation with Online Balanced Partitioning. (arXiv:1511.07209v2 [cs.MA] UPDATED)
We introduce the concept of continuous transportation task to the context of multi-agent systems. A continuous transportation task is one in which a multi-agent team visits a number of fixed locations, picks up objects, and delivers them to a final destination. The goal is to maximize the rate of transportation while the objects are replenished over time. Examples of problems that need continuous transportation are foraging, area sweeping, and first/last mile problem. Previous approaches typically neglect the interference and are highly dependent on communications among agents. Some also incorporate an additional reconnaissance agent to gather information. In this paper, we present a hybrid of centralized and distributed approaches that minimize the interference and communications in the multi-agent team without the need for a reconnaissance agent. We contribute two partitioning-transportation algorithms inspired by existing algorithms, and contribute one novel online partitioning-transportation algorithm with information gathering in the multi-agent team. Our algorithms have been implemented and tested extensively in the simulation. The results presented in this paper demonstrate the effectiveness of our algorithms that outperform the existing algorithms, even without any communications between the agents and without the presence of a reconnaissance agent.
from cs.AI updates on arXiv.org http://ift.tt/1kQLA4f
via IFTTT
Ravens: Eric Weddle says success will determine fate of his beard, which he shaved for 1st time in 3 years in offseason (ESPN)
via IFTTT
Using VPN in the UAE? You'll Be Fined Up To $545,000 If You Get Caught!
from The Hacker News http://ift.tt/2ak0fCN
via IFTTT
Ravens: Rookie RB Kenneth Dixon suffers a Grade 1 MCL strain and is considered day-to-day - Adam Schefter, reports (ESPN)
via IFTTT
Dom. II pt. kal. octobris in festo maternitatis BMV | Anonymous
from Google Alert - anonymous http://ift.tt/2ae8bmy
via IFTTT
QRLJacking — Hacking Technique to Hijack QR Code Based Quick Login System
from The Hacker News http://ift.tt/2ayXrUF
via IFTTT
ISS Daily Summary Report – 07/27/16
from ISS On-Orbit Status Report http://ift.tt/2apX4dA
via IFTTT
[FD] Saveya Bounty #1 - Bypass & Persistent Vulnerability
|
|
Source: Gmail -> IFTTT-> Blogger |
[FD] Zoll Checklist v1.2.2 iOS - Multiple Persistent Vulnerabilities
"><[MALICIOUS INJECTED SCRIPT CODE IN EMAIL VIA NAME!]></h1><table width="100%"><tr><td width="50%" class="rowTitle">Frequency</td><td width="50%"> Daily</td></tr></table><h2 class="boxed">Dates</h2><table width="100%"><tr><td width="50%" class="rowTitle">Started</td><td width="50%">23.07.16, 18:46</td></tr><tr><td width="50%" class="rowTitle">Completed</td><td width="50%">23.07.16, 18:47</td></tr></table><h2 class="boxed">Checks</ h2><h2 class="boxed">Signatures</h2><p class="underlined">Inspector</p><table width="100%"><tr><td width="50%" class="rowTitle">Name</td><td width="50%">"><iframe src=a>%20<iframe></td></tr><tr><td width="50%" class="rowTitle">Date</td><td width="50%">23.07.16, 18:47</td></tr>& lt;/table><p>&nbsp;</p><p class="underlined">Reviewer</p><table width="100%"><tr><td width="50%" class="rowTitle">Name</td><td width="50%">"> <iframe src=a>%20<iframe></td></tr><tr><td width="50%" class="rowTitle" >Date</td><td width="50%">23.07.16, 18:47</td></tr></table>< p>&nbsp;</p><p>&nbsp; </p><p class="footer">ZOLL Checklist</p></body></html>
Von meinem iPhone gesendet
Source: Gmail -> IFTTT-> Blogger
[FD] Exponent CMS 2.3.9 - Useraccounts Persistent Vulnerability
Source: Gmail -> IFTTT-> Blogger
Real Name | |||
[REALNAME PERSISTENT SCRIPT CODE EXECUTION!] | [USER PERSISTENT SCRIPT CODE EXECUTION!] | asdasdasda@mail.com | a |
[FD] Zortam Media Studio 20.60 - Buffer Overflow Vulnerability
Source: Gmail -> IFTTT-> Blogger
M13: A Great Globular Cluster of Stars
Wednesday, July 27, 2016
Rockies: OF David Dahl hits first career homer, a solo shot in 6th inning against Orioles' Dylan Bundy (ESPN)
via IFTTT
Polling-systems-based Autonomous Vehicle Coordination in Traffic Intersections with No Traffic Signals. (arXiv:1607.07896v1 [cs.SY])
The rapid development of autonomous vehicles spurred a careful investigation of the potential benefits of all-autonomous transportation networks. Most studies conclude that autonomous systems can enable drastic improvements in performance. A widely studied concept is all-autonomous, collision-free intersections, where vehicles arriving in a traffic intersection with no traffic light adjust their speeds to cross safely through the intersection as quickly as possible. In this paper, we propose a coordination control algorithm for this problem, assuming stochastic models for the arrival times of the vehicles. The proposed algorithm provides provable guarantees on safety and performance. More precisely, it is shown that no collisions occur surely, and moreover a rigorous upper bound is provided for the expected wait time. The algorithm is also demonstrated in simulations. The proposed algorithms are inspired by polling systems. In fact, the problem studied in this paper leads to a new polling system where customers are subject to differential constraints, which may be interesting in its own right.
from cs.AI updates on arXiv.org http://ift.tt/2aeQ52A
via IFTTT
Approximation and Parameterized Complexity of Minimax Approval Voting. (arXiv:1607.07906v1 [cs.DS])
We present three results on the complexity of Minimax Approval Voting. First, we study Minimax Approval Voting parameterized by the Hamming distance $d$ from the solution to the votes. We show Minimax Approval Voting admits no algorithm running in time $\mathcal{O}^\star(2^{o(d\log d)})$, unless the Exponential Time Hypothesis (ETH) fails. This means that the $\mathcal{O}^\star(d^{2d})$ algorithm of Misra et al. [AAMAS 2015] is essentially optimal. Motivated by this, we then show a parameterized approximation scheme, running in time $\mathcal{O}^\star(\left({3}/{\epsilon}\right)^{2d})$, which is essentially tight assuming ETH. Finally, we get a new polynomial-time randomized approximation scheme for Minimax Approval Voting, which runs in time $n^{\mathcal{O}(1/\epsilon^2 \cdot \log(1/\epsilon))} \cdot \mathrm{poly}(m)$, almost matching the running time of the fastest known PTAS for Closest String due to Ma and Sun [SIAM J. Comp. 2009].
from cs.AI updates on arXiv.org http://ift.tt/2afLbWk
via IFTTT
Multiple scan data association by convex variational inference. (arXiv:1607.07942v1 [cs.AI])
Data association, the reasoning over correspondence between targets and measurements, is a problem of fundamental importance in target tracking. Recently, belief propagation (BP) has emerged as a promising method for estimating the marginal probabilities of target/measurement association, providing fast, accurate estimates. The excellent performance of BP in the particular formulation used may be attributed to the convexity of the underlying free energy which it implicitly optimises. This paper studies multiple scan data association problems, i.e., problems that reason over correspondence between targets and several sets of measurements, which may correspond to different sensors or different time steps. We find that the multiple scan extension of the single scan BP formulation is non-convex and demonstrate the undesirable behaviour that can result. A convex free energy is constructed using the recently proposed fractional free energy, and optimised using a primal-dual coordinate ascent. Finally, based on a variational interpretation of joint probabilistic data association (JPDA), we develop a sequential variant of the algorithm that is similar to JPDA, but retains consistency constraints from prior scans. The performance of the proposed methods is demonstrated on a bearings only target localisation problem.
from cs.AI updates on arXiv.org http://ift.tt/2aeQv9u
via IFTTT
Joint Embedding of Hierarchical Categories and Entities for Concept Categorization and Dataless Classification. (arXiv:1607.07956v1 [cs.CL])
Due to the lack of structured knowledge applied in learning distributed representation of cate- gories, existing work cannot incorporate category hierarchies into entity information. We propose a framework that embeds entities and categories into a semantic space by integrating structured knowledge and taxonomy hierarchy from large knowledge bases. The framework allows to com- pute meaningful semantic relatedness between entities and categories. Our framework can han- dle both single-word concepts and multiple-word concepts with superior performance on concept categorization and yield state of the art results on dataless hierarchical classification.
from cs.AI updates on arXiv.org http://ift.tt/2afKVXF
via IFTTT
Behavior and path planning for the coalition of cognitive robots in smart relocation tasks. (arXiv:1607.08038v1 [cs.AI])
In this paper we outline the approach of solving special type of navigation tasks for robotic systems, when a coalition of robots (agents) acts in the 2D environment, which can be modified by the actions, and share the same goal location. The latter is originally unreachable for some members of the coalition, but the common task still can be accomplished as the agents can assist each other (e.g. by modifying the environment). We call such tasks smart relocation tasks (as the can not be solved by pure path planning methods) and study spatial and behavior interaction of robots while solving them. We use cognitive approach and introduce semiotic knowledge representation - sign world model which underlines behavioral planning methodology. Planning is viewed as a recursive search process in the hierarchical state-space induced by sings with path planning signs reside on the lowest level. Reaching this level triggers path planning which is accomplished by state of the art grid-based planners focused on producing smooth paths (e.g. LIAN) and thus indirectly guarantying feasibility of that paths against agent's dynamic constraints.
from cs.AI updates on arXiv.org http://ift.tt/2aeQnGY
via IFTTT
Assisting Drivers During Overtaking Using Car-2-Car Communication and Multi-Agent Systems. (arXiv:1607.08073v1 [cs.AI])
A warning system for assisting drivers during overtaking maneuvers is proposed. The system relies on Car-2-Car communication technologies and multi-agent systems. A protocol for safety overtaking is proposed based on ACL communicative acts. The mathematical model for safety overtaking used Kalman filter to minimize localization error.
from cs.AI updates on arXiv.org http://ift.tt/2afLeBr
via IFTTT
Mining Arguments from Cancer Documents Using Natural Language Processing and Ontologies. (arXiv:1607.08074v1 [cs.AI])
In the medical domain, the continuous stream of scientific research contains contradictory results supported by arguments and counter-arguments. As medical expertise occurs at different levels, part of the human agents have difficulties to face the huge amount of studies, but also to understand the reasons and pieces of evidences claimed by the proponents and the opponents of the debated topic. To better understand the supporting arguments for new findings related to current state of the art in the medical domain we need tools able to identify arguments in scientific papers. Our work here aims to fill the above technological gap.
Quite aware of the difficulty of this task, we embark to this road by relying on the well-known interleaving of domain knowledge with natural language processing. To formalise the existing medical knowledge, we rely on ontologies. To structure the argumentation model we use also the expressivity and reasoning capabilities of Description Logics. To perform argumentation mining we formalise various linguistic patterns in a rule-based language. We tested our solution against a corpus of scientific papers related to breast cancer. The run experiments show a F-measure between 0.71 and 0.86 for identifying conclusions of an argument and between 0.65 and 0.86 for identifying premises of an argument.
from cs.AI updates on arXiv.org http://ift.tt/2anRkkN
via IFTTT
Mining Arguments from Cancer Documents Using Natural Language Processing and Ontologies. (arXiv:1607.08074v1 [cs.AI])
In the medical domain, the continuous stream of scientific research contains contradictory results supported by arguments and counter-arguments. As medical expertise occurs at different levels, part of the human agents have difficulties to face the huge amount of studies, but also to understand the reasons and pieces of evidences claimed by the proponents and the opponents of the debated topic. To better understand the supporting arguments for new findings related to current state of the art in the medical domain we need tools able to identify arguments in scientific papers. Our work here aims to fill the above technological gap.
Quite aware of the difficulty of this task, we embark to this road by relying on the well-known interleaving of domain knowledge with natural language processing. To formalise the existing medical knowledge, we rely on ontologies. To structure the argumentation model we use also the expressivity and reasoning capabilities of Description Logics. To perform argumentation mining we formalise various linguistic patterns in a rule-based language. We tested our solution against a corpus of scientific papers related to breast cancer. The run experiments show a F-measure between 0.71 and 0.86 for identifying conclusions of an argument and between 0.65 and 0.86 for identifying premises of an argument.
from cs.AI updates on arXiv.org http://ift.tt/2anRkkN
via IFTTT
Harmonization of conflicting medical opinions using argumentation protocols and textual entailment - a case study on Parkinson disease. (arXiv:1607.08075v1 [cs.AI])
Parkinson's disease is the second most common neurodegenerative disease, affecting more than 1.2 million people in Europe. Medications are available for the management of its symptoms, but the exact cause of the disease is unknown and there is currently no cure on the market. To better understand the relations between new findings and current medical knowledge, we need tools able to analyse published medical papers based on natural language processing and tools capable to identify various relationships of new findings with the current medical knowledge. Our work aims to fill the above technological gap.
To identify conflicting information in medical documents, we enact textual entailment technology. To encapsulate existing medical knowledge, we rely on ontologies. To connect the formal axioms in ontologies with natural text in medical articles, we exploit ontology verbalisation techniques. To assess the level of disagreement between human agents with respect to a medical issue, we rely on fuzzy aggregation. To harmonize this disagreement, we design mediation protocols within a multi-agent framework.
from cs.AI updates on arXiv.org http://ift.tt/2ab0ayT
via IFTTT
Improving Semantic Embedding Consistency by Metric Learning for Zero-Shot Classification. (arXiv:1607.08085v1 [cs.CV])
This paper addresses the task of zero-shot image classification. The key contribution of the proposed approach is to control the semantic embedding of images -- one of the main ingredients of zero-shot learning -- by formulating it as a metric learning problem. The optimized empirical criterion associates two types of sub-task constraints: metric discriminating capacity and accurate attribute prediction. This results in a novel expression of zero-shot learning not requiring the notion of class in the training phase: only pairs of image/attributes, augmented with a consistency indicator, are given as ground truth. At test time, the learned model can predict the consistency of a test image with a given set of attributes , allowing flexible ways to produce recognition inferences. Despite its simplicity, the proposed approach gives state-of-the-art results on four challenging datasets used for zero-shot recognition evaluation.
from cs.AI updates on arXiv.org http://ift.tt/2aaZvgY
via IFTTT
The Actias system: supervised multi-strategy learning paradigm using categorical logic. (arXiv:1607.08098v1 [cs.DB])
One of the most difficult problems in the development of intelligent systems is the construction of the underlying knowledge base. As a consequence, the rate of progress in the development of this type of system is directly related to the speed with which knowledge bases can be assembled, and on its quality. We attempt to solve the knowledge acquisition problem, for a Business Information System, developing a supervised multistrategy learning paradigm. This paradigm is centred on a collaborative data mining strategy, where groups of experts collaborate using data-mining process on the supervised acquisition of new knowledge extracted from heterogeneous machine learning data models.
The Actias system is our approach to this paradigm. It is the result of applying the graphic logic based language of sketches to knowledge integration. The system is a data mining collaborative workplace, where the Information System knowledge base is an algebraic structure. It results from the integration of background knowledge with new insights extracted from data models, generated for specific data modelling tasks, and represented as rules using the sketches language.
from cs.AI updates on arXiv.org http://ift.tt/2anRgkZ
via IFTTT
Automatically Reinforcing a Game AI. (arXiv:1607.08100v1 [cs.AI])
A recent research trend in Artificial Intelligence (AI) is the combination of several programs into one single, stronger, program; this is termed portfolio methods. We here investigate the application of such methods to Game Playing Programs (GPPs). In addition, we consider the case in which only one GPP is available - by decomposing this single GPP into several ones through the use of parameters or even simply random seeds. These portfolio methods are trained in a learning phase. We propose two different offline approaches. The simplest one, BestArm, is a straightforward optimization of seeds or parame- ters; it performs quite well against the original GPP, but performs poorly against an opponent which repeats games and learns. The second one, namely Nash-portfolio, performs similarly in a "one game" test, and is much more robust against an opponent who learns. We also propose an online learning portfolio, which tests several of the GPP repeatedly and progressively switches to the best one - using a bandit algorithm.
from cs.AI updates on arXiv.org http://ift.tt/2aaZVnv
via IFTTT
A DEMATEL-Based Completion Method for Incomplete Pairwise Comparison Matrix in AHP. (arXiv:1607.08116v1 [math.OC])
Pairwise comparison matrix as a crucial component of AHP, presents the prefer- ence relations among alternatives. However, in many cases, the pairwise comparison matrix is difficult to complete, which obstructs the subsequent operations of the clas- sical AHP. In this paper, based on DEMATEL which has ability to derive the total relation matrix from direct relation matrix, a new completion method for incomplete pairwise comparison matrix is proposed. The proposed method provides a new per- spective to estimate the missing values with explicit physical meaning. Besides, the proposed method has low computational cost. This promising method has a wide application in multi-criteria decision-making.
from cs.AI updates on arXiv.org http://ift.tt/2anRFnn
via IFTTT
Neuromorphic Robot Dream. (arXiv:1607.08131v1 [cs.AI])
In this paper we present the next step in our approach to neurobiologically plausible implementation of emotional reactions and behaviors for real-time autonomous robotic systems. The working metaphor we use is the "day" and the "night" phases of mammalian life. During the "day phase" a robotic system stores the inbound information and is controlled by a light-weight rule-based system in real time. In contrast to that, during the "night phase" information that has been stored is transferred to a supercomputing system to update the realistic neural network: emotional and behavioral strategies.
from cs.AI updates on arXiv.org http://ift.tt/2ab04HJ
via IFTTT
N-opcode Analysis for Android Malware Classification and Categorization. (arXiv:1607.08149v1 [cs.CR])
Malware detection is a growing problem particularly on the Android mobile platform due to its increasing popularity and accessibility to numerous third party app markets. This has also been made worse by the increasingly sophisticated detection avoidance techniques employed by emerging malware families. This calls for more effective techniques for detection and classification of Android malware. Hence, in this paper we present an n-opcode analysis based approach that utilizes machine learning to classify and categorize Android malware. This approach enables automated feature discovery that eliminates the need for applying expert or domain knowledge to define the needed features. Our experiments on 2520 samples that were performed using up to 10-gram opcode features showed that an f-measure of 98% is achievable using this approach.
from cs.AI updates on arXiv.org http://ift.tt/2anRN6A
via IFTTT
Psychologically inspired planning method for smart relocation task. (arXiv:1607.08181v1 [cs.AI])
Behavior planning is known to be one of the basic cognitive functions, which is essential for any cognitive architecture of any control system used in robotics. At the same time most of the widespread planning algorithms employed in those systems are developed using only approaches and models of Artificial Intelligence and don't take into account numerous results of cognitive experiments. As a result, there is a strong need for novel methods of behavior planning suitable for modern cognitive architectures aimed at robot control. One such method is presented in this work and is studied within a special class of navigation task called smart relocation task. The method is based on the hierarchical two-level model of abstraction and knowledge representation, e.g. symbolic and subsymbolic. On the symbolic level sign world model is used for knowledge representation and hierarchical planning algorithm, PMA, is utilized for planning. On the subsymbolic level the task of path planning is considered and solved as a graph search problem. Interaction between both planners is examined and inter-level interfaces and feedback loops are described. Preliminary experimental results are presented.
from cs.AI updates on arXiv.org http://ift.tt/2ab0iOR
via IFTTT
Android Malware Detection Using Parallel Machine Learning Classifiers. (arXiv:1607.08186v1 [cs.CR])
Mobile malware has continued to grow at an alarming rate despite on-going efforts towards mitigating the problem. This has been particularly noticeable on Android due to its being an open platform that has subsequently overtaken other platforms in the share of the mobile smart devices market. Hence, incentivizing a new wave of emerging Android malware sophisticated enough to evade most common detection methods. This paper proposes and investigates a parallel machine learning based classification approach for early detection of Android malware. Using real malware samples and benign applications, a composite classification model is developed from parallel combination of heterogeneous classifiers. The empirical evaluation of the model under different combination schemes demonstrates its efficacy and potential to improve detection accuracy. More importantly, by utilizing several classifiers with diverse characteristics, their strengths can be harnessed not only for enhanced Android malware detection but also quicker white box analysis by means of the more interpretable constituent classifiers.
from cs.AI updates on arXiv.org http://ift.tt/2anRoAT
via IFTTT
Modelling serendipity in a computational context. (arXiv:1411.0440v4 [cs.AI] UPDATED)
Building on a survey of previous theories of serendipity and creativity, we advance a model of serendipitous occurrences, and a definition of the serendipity potential of a system. Practitioners can use these theoretical tools to evaluate a computational system's potential for unexpected behaviour that may have a beneficial outcome. In addition to a quantitative rating of serendipity potential -- which is computed in terms of population-based estimates of chance, curiosity, sagacity, and value -- the model also includes qualitative features that can guide development work. We show how the model is used in three case studies of existing and hypothetical systems, in the context of evolutionary computing, automated programming, and (next-generation) recommender systems. From this analysis, we extract recommendations for practitioners working with computational serendipity, and outline future directions for research.
from cs.AI updates on arXiv.org http://ift.tt/1uoiZWX
via IFTTT
Domain Adaptive Neural Networks for Object Recognition. (arXiv:1409.6041v1 [cs.CV] CROSS LISTED)
We propose a simple neural network model to deal with the domain adaptation problem in object recognition. Our model incorporates the Maximum Mean Discrepancy (MMD) measure as a regularization in the supervised learning to reduce the distribution mismatch between the source and target domains in the latent space. From experiments, we demonstrate that the MMD regularization is an effective tool to provide good domain adaptation models on both SURF features and raw image pixels of a particular image data set. We also show that our proposed model, preceded by the denoising auto-encoder pretraining, achieves better performance than recent benchmark models on the same data sets. This work represents the first study of MMD measure in the context of neural networks.
from cs.AI updates on arXiv.org http://ift.tt/2anRdpp
via IFTTT
Domain Generalization for Object Recognition with Multi-task Autoencoders. (arXiv:1508.07680v1 [cs.CV] CROSS LISTED)
The problem of domain generalization is to take knowledge acquired from a number of related domains where training data is available, and to then successfully apply it to previously unseen domains. We propose a new feature learning algorithm, Multi-Task Autoencoder (MTAE), that provides good generalization performance for cross-domain object recognition.
Our algorithm extends the standard denoising autoencoder framework by substituting artificially induced corruption with naturally occurring inter-domain variability in the appearance of objects. Instead of reconstructing images from noisy versions, MTAE learns to transform the original image into analogs in multiple related domains. It thereby learns features that are robust to variations across domains. The learnt features are then used as inputs to a classifier.
We evaluated the performance of the algorithm on benchmark image recognition datasets, where the task is to learn features from multiple datasets and to then predict the image label from unseen datasets. We found that (denoising) MTAE outperforms alternative autoencoder-based models as well as the current state-of-the-art algorithms for domain generalization.
from cs.AI updates on arXiv.org http://ift.tt/1Jtbal4
via IFTTT
Scatter Component Analysis: A Unified Framework for Domain Adaptation and Domain Generalization. (arXiv:1510.04373v2 [cs.CV] CROSS LISTED)
This paper addresses classification tasks on a particular target domain in which labeled training data are only available from source domains different from (but related to) the target. Two closely related frameworks, domain adaptation and domain generalization, are concerned with such tasks, where the only difference between those frameworks is the availability of the unlabeled target data: domain adaptation can leverage unlabeled target information, while domain generalization cannot. We propose Scatter Component Analyis (SCA), a fast representation learning algorithm that can be applied to both domain adaptation and domain generalization. SCA is based on a simple geometrical measure, i.e., scatter, which operates on reproducing kernel Hilbert space. SCA finds a representation that trades between maximizing the separability of classes, minimizing the mismatch between domains, and maximizing the separability of data; each of which is quantified through scatter. The optimization problem of SCA can be reduced to a generalized eigenvalue problem, which results in a fast and exact solution. Comprehensive experiments on benchmark cross-domain object recognition datasets verify that SCA performs much faster than several state-of-the-art algorithms and also provides state-of-the-art classification accuracy in both domain adaptation and domain generalization. We also show that scatter can be used to establish a theoretical generalization bound in the case of domain adaptation.
from cs.AI updates on arXiv.org http://ift.tt/1Pw9Wf3
via IFTTT
Information retrieval in folktales using natural language processing. (arXiv:1511.03012v1 [cs.CL] CROSS LISTED)
Our aim is to extract information about literary characters in unstructured texts. We employ natural language processing and reasoning on domain ontologies. The first task is to identify the main characters and the parts of the story where these characters are described or act. We illustrate the system in a scenario in the folktale domain. The system relies on a folktale ontology that we have developed based on Propp's model for folktales morphology.
from cs.AI updates on arXiv.org http://ift.tt/1QtxIsp
via IFTTT
Ravens: Terrell Suggs says he's \"got to be smart\" with return from torn Achilles; \"won't be long\" before he's practicing (ESPN)
via IFTTT
Ravens: Joe Flacco to wear protective brace on surgically repaired left knee for all practices and regular-season games (ESPN)
via IFTTT
Ravens: OT Jake Long visiting Dr. James Andrews to get consultation on his knee; yet to sign contract with Baltimore (ESPN)
via IFTTT
LastPass Zero-Day Bug Lets Hackers Steal All Your Passwords
from The Hacker News http://ift.tt/2axtjsi
via IFTTT
I have a new follower on Twitter
Fyrestorm Marketing
USA
https://t.co/Iy0PfwPt1H
Following: 70106 - Followers: 133941
July 27, 2016 at 01:43PM via Twitter http://twitter.com/The_Fyrestorm
Anonymous Hacks Sarah Silverman's Twitter Account
from Google Alert - anonymous http://ift.tt/2ahnIop
via IFTTT
Redirect anonymous users
from Google Alert - anonymous http://ift.tt/2a518vy
via IFTTT
Anonymous caller behind fake bomb alert at Geneva airport
from Google Alert - anonymous http://ift.tt/2ahoAsU
via IFTTT
Sarah Silverman hacked by Anonymous after backing Hillary Clinton
from Google Alert - anonymous http://ift.tt/29ZPw1k
via IFTTT
End of SMS-based 2-Factor Authentication; Yes, It's Insecure!
from The Hacker News http://ift.tt/2au4rAz
via IFTTT
ISS Daily Summary Report – 07/26/16
from ISS On-Orbit Status Report http://ift.tt/2aennCm
via IFTTT