Latest YouTube Video
Saturday, July 23, 2016
Orioles Video: Mark Trumbo sends a 2-run homer to left, becomes 1st in majors to hit 30 HRs in 5-2 win over Indians (ESPN)
via IFTTT
Trumps Anonymous – a 12 Step Program
from Google Alert - anonymous http://ift.tt/2a2piMZ
via IFTTT
Ravens Video: QB Joe Flacco tries his luck as a car salesman, finds out his skills are better suited for football (ESPN)
via IFTTT
Orioles: P Ubaldo Jimenez placed on the paternity leave list, P Tyler Wilson recalled from Triple-A Norfolk (ESPN)
via IFTTT
Ravens: LB Terrell Suggs, LB Elvis Dumervil, WR Steve Smith Sr., WR Breshad Perriman among 6 placed on PUP list Saturday (ESPN)
via IFTTT
Last of the first potato harvest, apparently some decided to grow out of container, and are still doing good.
Force login for Anonymous users
from Google Alert - anonymous http://ift.tt/2a7RDjj
via IFTTT
Anonymous Posting: Error posting
from Google Alert - anonymous http://ift.tt/2afB0Re
via IFTTT
Galaxy Cluster Abell S1063 and Beyond
Friday, July 22, 2016
Orioles Video: Mark Trumbo uncorks his league-leading 29th homer to left field, brings in 3 runs in 5-1 win vs. Indians (ESPN)
via IFTTT
Anonymous mask
from Google Alert - anonymous http://ift.tt/2agN1ad
via IFTTT
Orioles: OF Joey Rickard (right thumb) placed on the 15-day DL, OF Dariel Alvarez recalled from Triple-A Norfolk (ESPN)
via IFTTT
Anonymous Twirling Dancers Arrive to Ease Tensions at the Republican National Convention
from Google Alert - anonymous http://ift.tt/2af53Zq
via IFTTT
Verizon Set to Buy Yahoo for $5 Billion — Here's Why a Telecom is so Interested!
from The Hacker News http://ift.tt/2a3kwJN
via IFTTT
Force login for Anonymous users
from Google Alert - anonymous http://ift.tt/2a35NyK
via IFTTT
The VPPA and PII: Is Geolocation Another Anonymous Identifier?
from Google Alert - anonymous http://ift.tt/29SetIk
via IFTTT
Hillary Leaks Series: Wikileaks releases 20,000 DNC Emails
from The Hacker News http://ift.tt/2aB3rbk
via IFTTT
ISS Daily Summary Report – 07/21/16
from ISS On-Orbit Status Report http://ift.tt/2aikxvj
via IFTTT
girls needed for anonymous job
from Google Alert - anonymous http://ift.tt/2ai8Qoq
via IFTTT
Committers for Force login for Anonymous users
from Google Alert - anonymous http://ift.tt/2a5nCQD
via IFTTT
Edward Snowden Designs an iPhone Case to Detect & Block Wireless Snooping
from The Hacker News http://ift.tt/2aAa9hG
via IFTTT
Anonymous Calls
from Google Alert - anonymous http://ift.tt/29XM9FD
via IFTTT
Falcon 9: Launch and Landing
Thursday, July 21, 2016
Can I have this survey be anonymous?
from Google Alert - anonymous http://ift.tt/2aftQiY
via IFTTT
Applying Interval Type-2 Fuzzy Rule Based Classifiers Through a Cluster-Based Class Representation. (arXiv:1607.06186v1 [cs.AI])
Fuzzy Rule-Based Classification Systems (FRBCSs) have the potential to provide so-called interpretable classifiers, i.e. classifiers which can be introspective, understood, validated and augmented by human experts by relying on fuzzy-set based rules. This paper builds on prior work for interval type-2 fuzzy set based FRBCs where the fuzzy sets and rules of the classifier are generated using an initial clustering stage. By introducing Subtractive Clustering in order to identify multiple cluster prototypes, the proposed approach has the potential to deliver improved classification performance while maintaining good interpretability, i.e. without resulting in an excessive number of rules. The paper provides a detailed overview of the proposed FRBC framework, followed by a series of exploratory experiments on both linearly and non-linearly separable datasets, comparing results to existing rule-based and SVM approaches. Overall, initial results indicate that the approach enables comparable classification performance to non rule-based classifiers such as SVM, while often achieving this with a very small number of rules.
from cs.AI updates on arXiv.org http://ift.tt/29SemMf
via IFTTT
Exploring Differences in Interpretation of Words Essential in Medical Expert-Patient Communication. (arXiv:1607.06187v1 [cs.AI])
In the context of cancer treatment and surgery, quality of life assessment is a crucial part of determining treatment success and viability. In order to assess it, patients completed questionnaires which employ words to capture aspects of patients well-being are the norm. As the results of these questionnaires are often used to assess patient progress and to determine future treatment options, it is important to establish that the words used are interpreted in the same way by both patients and medical professionals. In this paper, we capture and model patients perceptions and associated uncertainty about the words used to describe the level of their physical function used in the highly common (in Sarcoma Services) Toronto Extremity Salvage Score (TESS) questionnaire. The paper provides detail about the interval-valued data capture as well as the subsequent modelling of the data using fuzzy sets. Based on an initial sample of participants, we use Jaccard similarity on the resulting words models to show that there may be considerable differences in the interpretation of commonly used questionnaire terms, thus presenting a very real risk of miscommunication between patients and medical professionals as well as within the group of medical professionals.
from cs.AI updates on arXiv.org http://ift.tt/2adIeqo
via IFTTT
Supervised Adverse Drug Reaction Signalling Framework Imitating Bradford Hill's Causality Considerations. (arXiv:1607.06198v1 [cs.AI])
Big longitudinal observational medical data potentially hold a wealth of information and have been recognised as potential sources for gaining new drug safety knowledge. Unfortunately there are many complexities and underlying issues when analysing longitudinal observational data. Due to these complexities, existing methods for large-scale detection of negative side effects using observational data all tend to have issues distinguishing between association and causality. New methods that can better discriminate causal and non-causal relationships need to be developed to fully utilise the data. In this paper we propose using a set of causality considerations developed by the epidemiologist Bradford Hill as a basis for engineering features that enable the application of supervised learning for the problem of detecting negative side effects. The Bradford Hill considerations look at various perspectives of a drug and outcome relationship to determine whether it shows causal traits. We taught a classifier to find patterns within these perspectives and it learned to discriminate between association and causality. The novelty of this research is the combination of supervised learning and Bradford Hill's causality considerations to automate the Bradford Hill's causality assessment. We evaluated the framework on a drug safety gold standard know as the observational medical outcomes partnership's nonspecified association reference set. The methodology obtained excellent discriminate ability with area under the curves ranging between 0.792-0.940 (existing method optimal: 0.73) and a mean average precision of 0.640 (existing method optimal: 0.141). The proposed features can be calculated efficiently and be readily updated, making the framework suitable for big observational data.
from cs.AI updates on arXiv.org http://ift.tt/29SeaMU
via IFTTT
Left/Right Hand Segmentation in Egocentric Videos. (arXiv:1607.06264v1 [cs.HC])
Wearable cameras allow people to record their daily activities from a user-centered (First Person Vision) perspective. Due to their favorable location, wearable cameras frequently capture the hands of the user, and may thus represent a promising user-machine interaction tool for different applications. Existent First Person Vision methods handle hand segmentation as a background-foreground problem, ignoring two important facts: i) hands are not a single "skin-like" moving element, but a pair of interacting cooperative entities, ii) close hand interactions may lead to hand-to-hand occlusions and, as a consequence, create a single hand-like segment. These facts complicate a proper understanding of hand movements and interactions. Our approach extends traditional background-foreground strategies, by including a hand-identification step (left-right) based on a Maxwell distribution of angle and position. Hand-to-hand occlusions are addressed by exploiting temporal superpixels. The experimental results show that, in addition to a reliable left/right hand-segmentation, our approach considerably improves the traditional background-foreground hand-segmentation.
from cs.AI updates on arXiv.org http://ift.tt/2adIpC1
via IFTTT
Dataset and Neural Recurrent Sequence Labeling Model for Open-Domain Factoid Question Answering. (arXiv:1607.06275v1 [cs.CL])
While question answering (QA) with neural network, i.e. neural QA, has achieved promising results in recent years, lacking of large scale real-word QA dataset is still a challenge for developing and evaluating neural QA system. To alleviate this problem, we propose a large scale human annotated real-world QA dataset WebQA with more than 42k questions and 556k evidences. As existing neural QA methods resolve QA either as sequence generation or classification/ranking problem, they face challenges of expensive softmax computation, unseen answers handling or separate candidate answer generation component. In this work, we cast neural QA as a sequence labeling problem and propose an end-to-end sequence labeling model, which overcomes all the above challenges. Experimental results on WebQA show that our model outperforms the baselines significantly with an F1 score of 74.69% with word-based input, and the performance drops only 3.72 F1 points with more challenging character-based input.
from cs.AI updates on arXiv.org http://ift.tt/2afdvLf
via IFTTT
Modelling Office Energy Consumption: An Agent Based Approach. (arXiv:1607.06332v1 [cs.AI])
In this paper, we develop an agent-based model which integrates four important elements, i.e. organisational energy management policies/regulations, energy management technologies, electric appliances and equipment, and human behaviour, based on a case study, to simulate the energy consumption in office buildings. With the model, we test the effectiveness of different energy management strategies, and solve practical office energy consumption problems. This paper theoretically contributes to an integration of four elements involved in the complex organisational issue of office energy consumption, and practically contributes to an application of agent-based approach for office building energy consumption study.
from cs.AI updates on arXiv.org http://ift.tt/29SeuLS
via IFTTT
On the Prior Sensitivity of Thompson Sampling. (arXiv:1506.03378v2 [cs.LG] UPDATED)
The empirically successful Thompson Sampling algorithm for stochastic bandits has drawn much interest in understanding its theoretical properties. One important benefit of the algorithm is that it allows domain knowledge to be conveniently encoded as a prior distribution to balance exploration and exploitation more effectively. While it is generally believed that the algorithm's regret is low (high) when the prior is good (bad), little is known about the exact dependence. In this paper, we fully characterize the algorithm's worst-case dependence of regret on the choice of prior, focusing on a special yet representative case. These results also provide insights into the general sensitivity of the algorithm to the choice of priors. In particular, with $p$ being the prior probability mass of the true reward-generating model, we prove $O(\sqrt{T/p})$ and $O(\sqrt{(1-p)T})$ regret upper bounds for the bad- and good-prior cases, respectively, as well as \emph{matching} lower bounds. Our proofs rely on the discovery of a fundamental property of Thompson Sampling and make heavy use of martingale theory, both of which appear novel in the literature, to the best of our knowledge.
from cs.AI updates on arXiv.org http://ift.tt/1e47sG4
via IFTTT
Funnel Libraries for Real-Time Robust Feedback Motion Planning. (arXiv:1601.04037v2 [cs.RO] UPDATED)
We consider the problem of generating motion plans for a robot that are guaranteed to succeed despite uncertainty in the environment, parametric model uncertainty, and disturbances. Furthermore, we consider scenarios where these plans must be generated in real-time, because constraints such as obstacles in the environment may not be known until they are perceived (with a noisy sensor) at runtime. Our approach is to pre-compute a library of "funnels" along different maneuvers of the system that the state is guaranteed to remain within (despite bounded disturbances) when the feedback controller corresponding to the maneuver is executed. We leverage powerful computational machinery from convex optimization (sums-of-squares programming in particular) to compute these funnels. The resulting funnel library is then used to sequentially compose motion plans at runtime while ensuring the safety of the robot. A major advantage of the work presented here is that by explicitly taking into account the effect of uncertainty, the robot can evaluate motion plans based on how vulnerable they are to disturbances.
We demonstrate and validate our method using extensive hardware experiments on a small fixed-wing airplane avoiding obstacles at high speed (~12 mph), along with thorough simulation experiments of ground vehicle and quadrotor models navigating through cluttered environments. To our knowledge, the resulting hardware demonstrations on a fixed-wing airplane constitute one of the first examples of provably safe and robust control for robotic systems with complex nonlinear dynamics that need to plan in realtime in environments with complex geometric constraints.
from cs.AI updates on arXiv.org http://ift.tt/1Rv2pPJ
via IFTTT
Neighborhood Mixture Model for Knowledge Base Completion. (arXiv:1606.06461v2 [cs.CL] UPDATED)
Knowledge bases are useful resources for many natural language processing tasks, however, they are far from complete. In this paper, we define a novel entity representation as a mixture of its neighborhood in the knowledge base and apply this technique on TransE-a well-known embedding model for knowledge base completion. Experimental results show that the neighborhood information significantly helps to improve the results of the TransE, leading to better performance than obtained by other state-of-the-art embedding models on three benchmark datasets for triple classification, entity prediction and relation prediction tasks.
from cs.AI updates on arXiv.org http://ift.tt/28MfaGu
via IFTTT
STransE: a novel embedding model of entities and relationships in knowledge bases. (arXiv:1606.08140v2 [cs.CL] UPDATED)
Knowledge bases of real-world facts about entities and their relationships are useful resources for a variety of natural language processing tasks. However, because knowledge bases are typically incomplete, it is useful to be able to perform link prediction, i.e., predict whether a relationship not in the knowledge base is likely to be true. This paper combines insights from several previous link prediction models into a new embedding model STransE that represents each entity as a low-dimensional vector, and each relation by two matrices and a translation vector. STransE is a simple combination of the SE and TransE models, but it obtains better link prediction performance on two benchmark datasets than previous embedding models. Thus, STransE can serve as a new baseline for the more complex models in the link prediction task.
from cs.AI updates on arXiv.org http://ift.tt/296ni3T
via IFTTT
Algebraic foundations for qualitative calculi and networks. (arXiv:1606.09140v2 [cs.AI] UPDATED)
A qualitative representation $\phi$ is like an ordinary representation of a relation algebra, but instead of requiring $(a; b)^\phi = a^\phi | b^\phi$, as we do for ordinary representations, we only require that $c^\phi\supseteq a^\phi | b^\phi \iff c\geq a ; b$, for each $c$ in the algebra. A constraint network is qualitatively satisfiable if its nodes can be mapped to elements of a qualitative representation, preserving the constraints. If a constraint network is satisfiable then it is clearly qualitatively satisfiable, but the converse can fail. However, for a wide range of relation algebras including the point algebra, the Allen Interval Algebra, RCC8 and many others, a network is satisfiable if and only if it is qualitatively satisfiable.
Unlike ordinary composition, the weak composition arising from qualitative representations need not be associative, so we can generalise by considering network satisfaction problems over non-associative algebras. We prove that computationally, qualitative representations have many advantages over ordinary representations: whereas many finite relation algebras have only infinite representations, every finite qualitatively representable algebra has a finite qualitative representation; the representability problem for (the atom structures of) finite non-associative algebras is NP-complete; the network satisfaction problem over a finite qualitatively representable algebra is always in NP; the validity of equations over qualitative representations is co-NP-complete. On the other hand we prove that there is no finite axiomatisation of the class of qualitatively representable algebras.
from cs.AI updates on arXiv.org http://ift.tt/295tYyw
via IFTTT
Orioles: P Hunter Harvey (2013 1st-rd pick) to undergo Tommy John surgery Tuesday; has made just 30 minor league starts (ESPN)
via IFTTT
NFL: Former Ravens RB Ray Rice says he would donate his entire 2016 salary to charity if signed by a team this season (ESPN)
via IFTTT
MXJ in M4L and anonymous classes
from Google Alert - anonymous http://ift.tt/29Zzi4h
via IFTTT
Police Unlock Dead Man's Phone by 3D-Printing his Fingerprint
from The Hacker News http://ift.tt/2acTpPM
via IFTTT
Ravens: 2016 projected starting lineup features 1st-round pick Ronnie Stanley at LT, Eric Weddle at S - Jamison Hensley (ESPN)
via IFTTT
I have a new follower on Twitter
will.dymond@mail.com
Following: 570 - Followers: 6
July 21, 2016 at 11:32AM via Twitter http://twitter.com/will_dymond
ISS Daily Summary Report – 07/20/16
from ISS On-Orbit Status Report http://ift.tt/2axwIDS
via IFTTT
Can an anonymous social network ever work?
from Google Alert - anonymous http://ift.tt/2abl171
via IFTTT
Ravens: Free-agent OT Eugene Monroe plans to retire - Josina Anderson; released in June, played 17 games last 2 years (ESPN)
via IFTTT
Female model for anonymous videos up to $12000
from Google Alert - anonymous http://ift.tt/2aiZQ5i
via IFTTT
France warns Microsoft to Stop Collecting Windows 10 Users' Personal Data
from The Hacker News http://ift.tt/2ab1ovw
via IFTTT
Alcoholics Anonymous: Iceberg
from Google Alert - anonymous http://ift.tt/29NJot3
via IFTTT
Santas & Esks
from Google Alert - anonymous http://ift.tt/29Vs7vb
via IFTTT
KickassTorrents — Domain Names Seized! Owner Arrested! Website Goes Down!
from The Hacker News http://ift.tt/2awFjXc
via IFTTT
Dark Dunes on Mars
Model for Art, Be Anonymous, Have Fun, Make Money
from Google Alert - anonymous http://ift.tt/2acDhzy
via IFTTT
Wednesday, July 20, 2016
Rumor Central: Orioles among teams interested in Padres SP Andrew Cashner (4-7, 5.05 ERA) - MLB Network (ESPN)
via IFTTT
Large Anonymous Donation to Christian County Animal Control
from Google Alert - anonymous http://ift.tt/2acknZx
via IFTTT
Neural Contextual Conversation Learning with Labeled Question-Answering Pairs. (arXiv:1607.05809v1 [cs.CL])
Neural conversational models tend to produce generic or safe responses in different contexts, e.g., reply \textit{"Of course"} to narrative statements or \textit{"I don't know"} to questions. In this paper, we propose an end-to-end approach to avoid such problem in neural generative models. Additional memory mechanisms have been introduced to standard sequence-to-sequence (seq2seq) models, so that context can be considered while generating sentences. Three seq2seq models, which memorize a fix-sized contextual vector from hidden input, hidden input/output and a gated contextual attention structure respectively, have been trained and tested on a dataset of labeled question-answering pairs in Chinese. The model with contextual attention outperforms others including the state-of-the-art seq2seq models on perplexity test. The novel contextual model generates diverse and robust responses, and is able to carry out conversations on a wide range of topics appropriately.
from cs.AI updates on arXiv.org http://ift.tt/2avIDC8
via IFTTT
You want to survive the data deluge: Be careful, Computational Intelligence will not serve you as a rescue boat. (arXiv:1607.05810v1 [cs.AI])
We are at the dawn of a new era, where advances in computer power, broadband communication and digital sensor technologies have led to an unprecedented flood of data inundating our surrounding. It is generally believed that means such as Computational Intelligence will help to outlive these tough times. However, these hopes are improperly high. Computational Intelligence is a surprising composition of two mutually exclusive and contradicting constituents that could be coupled only if you disregard and neglect their controversies: "Computational" implies reliance on data processing and "Intelligence" implies reliance on information processing. Only those who are indifferent to data-information discrepancy can believe that such a combination can be viable. We do not believe in miracles, so we will try to share with you our reservations.
from cs.AI updates on arXiv.org http://ift.tt/29MU2Af
via IFTTT
Identifying Candidate Risk Factors for Prescription Drug Side Effects using Causal Contrast Set Mining. (arXiv:1607.05845v1 [cs.AI])
Big longitudinal observational databases present the opportunity to extract new knowledge in a cost effective manner. Unfortunately, the ability of these databases to be used for causal inference is limited due to the passive way in which the data are collected resulting in various forms of bias. In this paper we investigate a method that can overcome these limitations and determine causal contrast set rules efficiently from big data. In particular, we present a new methodology for the purpose of identifying risk factors that increase a patients likelihood of experiencing the known rare side effect of renal failure after ingesting aminosalicylates. The results show that the methodology was able to identify previously researched risk factors such as being prescribed diuretics and highlighted that patients with a higher than average risk of renal failure may be even more susceptible to experiencing it as a side effect after ingesting aminosalicylates.
from cs.AI updates on arXiv.org http://ift.tt/29Or5jR
via IFTTT
Indebted households profiling: a knowledge discovery from database approach. (arXiv:1607.05869v1 [cs.AI])
A major challenge in consumer credit risk portfolio management is to classify households according to their risk profile. In order to build such risk profiles it is necessary to employ an approach that analyses data systematically in order to detect important relationships, interactions, dependencies and associations amongst the available continuous and categorical variables altogether and accurately generate profiles of most interesting household segments according to their credit risk. The objective of this work is to employ a knowledge discovery from database process to identify groups of indebted households and describe their profiles using a database collected by the Consumer Credit Counselling Service (CCCS) in the UK. Employing a framework that allows the usage of both categorical and continuous data altogether to find hidden structures in unlabelled data it was established the ideal number of clusters and such clusters were described in order to identify the households who exhibit a high propensity of excessive debt levels.
from cs.AI updates on arXiv.org http://ift.tt/29MTUke
via IFTTT
Juxtaposition of System Dynamics and Agent-based Simulation for a Case Study in Immunosenescence. (arXiv:1607.05888v1 [cs.AI])
Advances in healthcare and in the quality of life significantly increase human life expectancy. With the ageing of populations, new un-faced challenges are brought to science. The human body is naturally selected to be well-functioning until the age of reproduction to keep the species alive. However, as the lifespan extends, unseen problems due to the body deterioration emerge. There are several age-related diseases with no appropriate treatment; therefore, the complex ageing phenomena needs further understanding. Immunosenescence, the ageing of the immune system, is highly correlated to the negative effects of ageing, such as the increase of auto-inflammatory diseases and decrease in responsiveness to new diseases. Besides clinical and mathematical tools, we believe there is opportunity to further exploit simulation tools to understand immunosenescence. Compared to real-world experimentation, benefits include time and cost effectiveness due to the laborious, resource-intensiveness of the biological environment and the possibility of conducting experiments without ethic restrictions. Contrasted with mathematical models, simulation modelling is more suitable for representing complex systems and emergence. In addition, there is the belief that simulation models are easier to communicate in interdisciplinary contexts. Our work investigates the usefulness of simulations to understand immunosenescence by employing two different simulation methods, agent-based and system dynamics simulation, to a case study of immune cells depletion with age.
from cs.AI updates on arXiv.org http://ift.tt/29Or2V5
via IFTTT
Refining adverse drug reaction signals by incorporating interaction variables identified using emergent pattern mining. (arXiv:1607.05906v1 [cs.AI])
Purpose: To develop a framework for identifying and incorporating candidate confounding interaction terms into a regularised cox regression analysis to refine adverse drug reaction signals obtained via longitudinal observational data. Methods: We considered six drug families that are commonly associated with myocardial infarction in observational healthcare data, but where the causal relationship ground truth is known (adverse drug reaction or not). We applied emergent pattern mining to find itemsets of drugs and medical events that are associated with the development of myocardial infarction. These are the candidate confounding interaction terms. We then implemented a cohort study design using regularised cox regression that incorporated and accounted for the candidate confounding interaction terms. Results The methodology was able to account for signals generated due to confounding and a cox regression with elastic net regularisation correctly ranked the drug families known to be true adverse drug reactions above those.
from cs.AI updates on arXiv.org http://ift.tt/29MU2R3
via IFTTT
Supervised Anomaly Detection in Uncertain Pseudoperiodic Data Streams. (arXiv:1607.05909v1 [cs.AI])
Uncertain data streams have been widely generated in many Web applications. The uncertainty in data streams makes anomaly detection from sensor data streams far more challenging. In this paper, we present a novel framework that supports anomaly detection in uncertain data streams. The proposed framework adopts an efficient uncertainty pre-processing procedure to identify and eliminate uncertainties in data streams. Based on the corrected data streams, we develop effective period pattern recognition and feature extraction techniques to improve the computational efficiency. We use classification methods for anomaly detection in the corrected data stream. We also empirically show that the proposed approach shows a high accuracy of anomaly detection on a number of real datasets.
from cs.AI updates on arXiv.org http://ift.tt/29OqVsU
via IFTTT
Simulating user learning in authoritative technology adoption: An agent based model for council-led smart meter deployment planning in the UK. (arXiv:1607.05912v1 [cs.AI])
How do technology users effectively transit from having zero knowledge about a technology to making the best use of it after an authoritative technology adoption? This post-adoption user learning has received little research attention in technology management literature. In this paper we investigate user learning in authoritative technology adoption by developing an agent-based model using the case of council-led smart meter deployment in the UK City of Leeds. Energy consumers gain experience of using smart meters based on the learning curve in behavioural learning. With the agent-based model we carry out experiments to validate the model and test different energy interventions that local authorities can use to facilitate energy consumers' learning and maintain their continuous use of the technology. Our results show that the easier energy consumers become experienced, the more energy-efficient they are and the more energy saving they can achieve; encouraging energy consumers' contacts via various informational means can facilitate their learning; and developing and maintaining their positive attitude toward smart metering can enable them to use the technology continuously. Contributions and energy policy/intervention implications are discussed in this paper.
from cs.AI updates on arXiv.org http://ift.tt/29MTIl2
via IFTTT
Optimising Rule-Based Classification in Temporal Data. (arXiv:1607.05913v1 [cs.AI])
This study optimises manually derived rule-based expert system classification of objects according to changes in their properties over time. One of the key challenges that this study tries to address is how to classify objects that exhibit changes in their behaviour over time, for example how to classify companies' share price stability over a period of time or how to classify students' preferences for subjects while they are progressing through school. A specific case the paper considers is the strategy of players in public goods games (as common in economics) across multiple consecutive games. Initial classification starts from expert definitions specifying class allocation for players based on aggregated attributes of the temporal data. Based on these initial classifications, the optimisation process tries to find an improved classifier which produces the best possible compact classes of objects (players) for every time point in the temporal data. The compactness of the classes is measured by a cost function based on internal cluster indices like the Dunn Index, distance measures like Euclidean distance or statistically derived measures like standard deviation. The paper discusses the approach in the context of incorporating changing player strategies in the aforementioned public good games, where common classification approaches so far do not consider such changes in behaviour resulting from learning or in-game experience. By using the proposed process for classifying temporal data and the actual players' contribution during the games, we aim to produce a more refined classification which in turn may inform the interpretation of public goods game data.
from cs.AI updates on arXiv.org http://ift.tt/29OqI8L
via IFTTT
On the estimation of stellar parameters with uncertainty prediction from Generative Artificial Neural Networks: application to Gaia RVS simulated spectra. (arXiv:1607.05954v1 [astro-ph.IM])
Aims. We present an innovative artificial neural network (ANN) architecture, called Generative ANN (GANN), that computes the forward model, that is it learns the function that relates the unknown outputs (stellar atmospheric parameters, in this case) to the given inputs (spectra). Such a model can be integrated in a Bayesian framework to estimate the posterior distribution of the outputs. Methods. The architecture of the GANN follows the same scheme as a normal ANN, but with the inputs and outputs inverted. We train the network with the set of atmospheric parameters (Teff, logg, [Fe/H] and [alpha/Fe]), obtaining the stellar spectra for such inputs. The residuals between the spectra in the grid and the estimated spectra are minimized using a validation dataset to keep solutions as general as possible. Results. The performance of both conventional ANNs and GANNs to estimate the stellar parameters as a function of the star brightness is presented and compared for different Galactic populations. GANNs provide significantly improved parameterizations for early and intermediate spectral types with rich and intermediate metallicities. The behaviour of both algorithms is very similar for our sample of late-type stars, obtaining residuals in the derivation of [Fe/H] and [alpha/Fe] below 0.1dex for stars with Gaia magnitude Grvs<12, which accounts for a number in the order of four million stars to be observed by the Radial Velocity Spectrograph of the Gaia satellite. Conclusions. Uncertainty estimation of computed astrophysical parameters is crucial for the validation of the parameterization itself and for the subsequent exploitation by the astronomical community. GANNs produce not only the parameters for a given spectrum, but a goodness-of-fit between the observed spectrum and the predicted one for a given set of parameters. Moreover, they allow us to obtain the full posterior distribution...
from cs.AI updates on arXiv.org http://ift.tt/29MUwq7
via IFTTT
Robust Natural Language Processing - Combining Reasoning, Cognitive Semantics and Construction Grammar for Spatial Language. (arXiv:1607.05968v1 [cs.AI])
We present a system for generating and understanding of dynamic and static spatial relations in robotic interaction setups. Robots describe an environment of moving blocks using English phrases that include spatial relations such as "across" and "in front of". We evaluate the system in robot-robot interactions and show that the system can robustly deal with visual perception errors, language omissions and ungrammatical utterances.
from cs.AI updates on arXiv.org http://ift.tt/29WIbyd
via IFTTT
Constructing a Natural Language Inference Dataset using Generative Neural Networks. (arXiv:1607.06025v1 [cs.AI])
Natural Language Inference is an important task for Natural Language Understanding. It is concerned with classifying the logical relation between two sentences. In this paper, we propose several text generative neural networks for constructing Natural Language Inference datasets suitable for training classifiers. To evaluate the models, we propose a new metric - the accuracy of the classifier trained on the generated dataset. The accuracy obtained with our best generative model is only 2.7% lower than the accuracy of the classifier trained on the original, manually constructed dataset. The model learns a mapping embedding for each training example. By comparing various metrics we show that datasets that obtain higher ROUGE or METEOR scores do not necessarily yield higher classification accuracies. We also provide analysis of what are the characteristics of a good dataset including the distinguishability of the generated datasets from the original one.
from cs.AI updates on arXiv.org http://ift.tt/2avJpyM
via IFTTT
Harnessing Deep Neural Networks with Logic Rules. (arXiv:1603.06318v3 [cs.LG] UPDATED)
Combining deep neural networks with structured logic rules is desirable to harness flexibility and reduce uninterpretability of the neural models. We propose a general framework capable of enhancing various types of neural networks (e.g., CNNs and RNNs) with declarative first-order logic rules. Specifically, we develop an iterative distillation method that transfers the structured information of logic rules into the weights of neural networks. We deploy the framework on a CNN for sentiment analysis, and an RNN for named entity recognition. With a few highly intuitive rules, we obtain substantial improvements and achieve state-of-the-art or comparable results to previous best-performing systems.
from cs.AI updates on arXiv.org http://ift.tt/1pwfpJk
via IFTTT
Deep Cross Residual Learning for Multitask Visual Recognition. (arXiv:1604.01335v2 [cs.CV] UPDATED)
Residual learning has recently surfaced as an effective means of constructing very deep neural networks for object recognition. However, current incarnations of residual networks do not allow for the modeling and integration of complex relations between closely coupled recognition tasks or across domains. Such problems are often encountered in multimedia applications involving large-scale content recognition. We propose a novel extension of residual learning for deep networks that enables intuitive learning across multiple related tasks using cross-connections called cross-residuals. These cross-residuals connections can be viewed as a form of in-network regularization and enables greater network generalization. We show how cross-residual learning (CRL) can be integrated in multitask networks to jointly train and detect visual concepts across several tasks. We present a single multitask cross-residual network with >40% less parameters that is able to achieve competitive, or even better, detection performance on a visual sentiment concept detection problem normally requiring multiple specialized single-task networks. The resulting multitask cross-residual network also achieves better detection performance by about 10.4% over a standard multitask residual network without cross-residuals with even a small amount of cross-task weighting.
from cs.AI updates on arXiv.org http://ift.tt/1WaTrZ9
via IFTTT
TensorLog: A Differentiable Deductive Database. (arXiv:1605.06523v2 [cs.AI] UPDATED)
Large knowledge bases (KBs) are useful in many tasks, but it is unclear how to integrate this sort of knowledge into "deep" gradient-based learning systems. To address this problem, we describe a probabilistic deductive database, called TensorLog, in which reasoning uses a differentiable process. In TensorLog, each clause in a logical theory is first converted into certain type of factor graph. Then, for each type of query to the factor graph, the message-passing steps required to perform belief propagation (BP) are "unrolled" into a function, which is differentiable. We show that these functions can be composed recursively to perform inference in non-trivial logical theories containing multiple interrelated clauses and predicates. Both compilation and inference in TensorLog are efficient: compilation is linear in theory size and proof depth, and inference is linear in database size and the number of message-passing steps used in BP. We also present experimental results with TensorLog and discuss its relationship to other first-order probabilistic logics.
from cs.AI updates on arXiv.org http://ift.tt/20t4nRB
via IFTTT
Orioles without 3B Manny Machado and Buck Showalter for Wednesday's game at Yankees due to illness sweeping team (ESPN)
via IFTTT
I have a new follower on Twitter
BLACK LIVES MATTER✊
#BlackLivesMatterMemphis ✊ ! We have this username so it won't get misused. Follow us if you support the #blacklivesmatter movement, & we will follow you back!
Memphis, TN
https://t.co/QRciOtepAF
Following: 210013 - Followers: 191949
July 20, 2016 at 05:06PM via Twitter http://twitter.com/AIlLivesMatter
I have a new follower on Twitter
PSIERP
We are a different kind of ERP company. PSI ERP is the software solution that adopts and tailors to your operation and organizational culture. Find out how.
Milton, ON
http://t.co/oBPhOxRar3
Following: 668 - Followers: 464
July 20, 2016 at 04:49PM via Twitter http://twitter.com/psierp
What is Strictly Enforced Verified Boot in Android 7.0 Nougat?
from The Hacker News http://ift.tt/29Udyb9
via IFTTT
ISS Daily Summary Report – 07/19/16
from ISS On-Orbit Status Report http://ift.tt/29Uotpv
via IFTTT
Contact user should be blank for anonymous submissions
from Google Alert - anonymous http://ift.tt/2absXrI
via IFTTT
[FD] Persistent Cross-Site Scripting in WooCommerce using image metadata (EXIF)
Source: Gmail -> IFTTT-> Blogger
[FD] Cross-Site Scripting vulnerability in Paid Memberships Pro WordPress Plugin
Source: Gmail -> IFTTT-> Blogger
Beware! Your iPhone Can Be Hacked Remotely With Just A Message
from The Hacker News http://ift.tt/29LwZpB
via IFTTT
403 error on anonymous form submission
from Google Alert - anonymous http://ift.tt/29V02FK
via IFTTT
Why Are So Many Artists Choosing To Be Anonymous?
from Google Alert - anonymous http://ift.tt/2a7rMrq
via IFTTT
Arctic Sea Ice Extent: January - June 2016
from NASA's Scientific Visualization Studio: Most Recent Items http://ift.tt/2afkQKj
via IFTTT
Color the Universe
Tuesday, July 19, 2016
Lambda (anonymous/first class procedures) and custom reporters
from Google Alert - anonymous http://ift.tt/29KIzRP
via IFTTT
Towards Analytics Aware Ontology Based Access to Static and Streaming Data (Extended Version). (arXiv:1607.05351v1 [cs.AI])
Real-time analytics that requires integration and aggregation of heterogeneous and distributed streaming and static data is a typical task in many industrial scenarios such as diagnostics of turbines in Siemens. OBDA approach has a great potential to facilitate such tasks; however, it has a number of limitations in dealing with analytics that restrict its use in important industrial applications. Based on our experience with Siemens, we argue that in order to overcome those limitations OBDA should be extended and become analytics, source, and cost aware. In this work we propose such an extension. In particular, we propose an ontology, mapping, and query language for OBDA, where aggregate and other analytical functions are first class citizens. Moreover, we develop query optimisation techniques that allow to efficiently process analytical tasks over static and streaming data. We implement our approach in a system and evaluate our system with Siemens turbine data.
from cs.AI updates on arXiv.org http://ift.tt/29TO2Et
via IFTTT
Generating Images Part by Part with Composite Generative Adversarial Networks. (arXiv:1607.05387v1 [cs.AI])
Image generation remains a fundamental problem in artificial intelligence in general and deep learning in specific. The generative adversarial network (GAN) was successful in generating high quality samples of natural images. We propose a model called composite generative adversarial network, that reveals the complex structure of images with multiple generators in which each generator generates some part of the image. Those parts are combined by alpha blending process to create a new single image. It can generate, for example, background and face sequentially with two generators, after training on face dataset. Training was done in an unsupervised way without any labels about what each generator should generate. We found possibilities of learning the structure by using this generative model empirically.
from cs.AI updates on arXiv.org http://ift.tt/2asehjX
via IFTTT
Exploiting Vagueness for Multi-Agent Consensus. (arXiv:1607.05540v1 [cs.MA])
A framework for consensus modelling is introduced using Kleene's three valued logic as a means to express vagueness in agents' beliefs. Explicitly borderline cases are inherent to propositions involving vague concepts where sentences of a propositional language may be absolutely true, absolutely false or borderline. By exploiting these intermediate truth values, we can allow agents to adopt a more vague interpretation of underlying concepts in order to weaken their beliefs and reduce the levels of inconsistency, so as to achieve consensus. We consider a consensus combination operation which results in agents adopting the borderline truth value as a shared viewpoint if they are in direct conflict. Simulation experiments are presented which show that applying this operator to agents chosen at random (subject to a consistency threshold) from a population, with initially diverse opinions, results in convergence to a smaller set of more precise shared beliefs. Furthermore, if the choice of agents for combination is dependent on the payoff of their beliefs, this acting as a proxy for performance or usefulness, then the system converges to beliefs which, on average, have higher payoff.
from cs.AI updates on arXiv.org http://ift.tt/29TN8Yz
via IFTTT
An Event Grouping Based Algorithm for University Course Timetabling Problem. (arXiv:1607.05601v1 [cs.AI])
This paper presents the study of an event grouping based algorithm for a university course timetabling problem. Several publications which discuss the problem and some approaches for its solution are analyzed. The grouping of events in groups with an equal number of events in each group is not applicable to all input data sets. For this reason, a universal approach to all possible groupings of events in commensurate in size groups is proposed here. Also, an implementation of an algorithm based on this approach is presented. The methodology, conditions and the objectives of the experiment are described. The experimental results are analyzed and the ensuing conclusions are stated. The future guidelines for further research are formulated.
from cs.AI updates on arXiv.org http://ift.tt/2aseu6C
via IFTTT
Hybrid Collaborative Filtering with Autoencoders. (arXiv:1603.00806v3 [cs.IR] UPDATED)
Collaborative Filtering aims at exploiting the feedback of users to provide personalised recommendations. Such algorithms look for latent variables in a large sparse matrix of ratings. They can be enhanced by adding side information to tackle the well-known cold start problem. While Neu-ral Networks have tremendous success in image and speech recognition, they have received less attention in Collaborative Filtering. This is all the more surprising that Neural Networks are able to discover latent variables in large and heterogeneous datasets. In this paper, we introduce a Collaborative Filtering Neural network architecture aka CFN which computes a non-linear Matrix Factorization from sparse rating inputs and side information. We show experimentally on the MovieLens and Douban dataset that CFN outper-forms the state of the art and benefits from side information. We provide an implementation of the algorithm as a reusable plugin for Torch, a popular Neural Network framework.
from cs.AI updates on arXiv.org http://ift.tt/1Rqez7D
via IFTTT
A topological insight into restricted Boltzmann machines. (arXiv:1604.05978v2 [cs.NE] UPDATED)
Restricted Boltzmann Machines (RBMs) and models derived from them have been successfully used as basic building blocks in deep artificial neural networks for automatic features extraction, unsupervised weights initialization, but also as density estimators. Thus, their generative and discriminative capabilities, but also their computational time are instrumental to a wide range of applications. Our main contribution is to look at RBMs from a topological perspective, bringing insights from network science. Firstly, here we show that RBMs and Gaussian RBMs (GRBMs) are bipartite graphs which naturally have a small-world topology. Secondly, we demonstrate both on synthetic and real-world datasets that by constraining RBMs and GRBMs to a scale-free topology (while still considering local neighborhoods and data distribution), we reduce the number of weights that need to be computed by a few orders of magnitude, at virtually no loss in generative performance. Thirdly, we show that, for a fixed number of weights, our proposed sparse models (which by design have a higher number of hidden neurons) achieve better generative capabilities than standard fully connected RBMs and GRBMs (which by design have a smaller number of hidden neurons), at no additional computational costs.
from cs.AI updates on arXiv.org http://ift.tt/1Sc5aoE
via IFTTT
Policy Networks with Two-Stage Training for Dialogue Systems. (arXiv:1606.03152v2 [cs.CL] UPDATED)
In this paper, we propose to use deep policy networks which are trained with an advantage actor-critic method for statistically optimised dialogue systems. First, we show that, on summary state and action spaces, deep Reinforcement Learning (RL) outperforms Gaussian Processes methods. Summary state and action spaces lead to good performance but require pre-engineering effort, RL knowledge, and domain expertise. In order to remove the need to define such summary spaces, we show that deep RL can also be trained efficiently on the original state and action spaces. Dialogue systems based on partially observable Markov decision processes are known to require many dialogues to train, which makes them unappealing for practical deployment. We show that a deep RL method based on an actor-critic architecture can exploit a small amount of data very efficiently. Indeed, with only a few hundred dialogues collected with a handcrafted policy, the actor-critic deep learner is considerably bootstrapped from a combination of supervised and batch RL. In addition, convergence to an optimal policy is significantly sped up compared to other deep RL methods initialized on the data with batch RL. All experiments are performed on a restaurant domain derived from the Dialogue State Tracking Challenge 2 (DSTC2) dataset.
from cs.AI updates on arXiv.org http://ift.tt/25S6QvT
via IFTTT
Orioles place OF Hyun Soo Kim (hamstring strain) on the 15-day DL, select contract of OF Julio Borbon from Double-A (ESPN)
via IFTTT
[FD] Multiple SQL injection vulnerabilities in WordPress Video Player
Source: Gmail -> IFTTT-> Blogger
[FD] Cross-Site Request Forgery in Icegram WordPress Plugin
Source: Gmail -> IFTTT-> Blogger
Anonymous bottom
from Google Alert - anonymous http://ift.tt/29SZ0r9
via IFTTT
Ozarks "Inventors Anonymous" Forges Ideas in Secret
from Google Alert - anonymous http://ift.tt/29WlX0y
via IFTTT
[FD] Multiple Cross-Site Scripting vulnerabilities in Ninja Forms WordPress Plugin
Source: Gmail -> IFTTT-> Blogger
VPN Dilemma: Anonymous Expression Vs. Anonymous Defamation
from Google Alert - anonymous http://ift.tt/29L3Zus
via IFTTT
ISS Daily Summary Report – 07/18/16
from ISS On-Orbit Status Report http://ift.tt/2a5Q2J8
via IFTTT
Core Tor Contributor Leaves Project; Shutting Down Important Tor Nodes
from The Hacker News http://ift.tt/29KrxiS
via IFTTT
[FD] Django CMS v3.3.0 - (Editor Snippet) Persistent Web Vulnerability (CVE-2016-6186)
The Orion Nebula in Infrared from HAWK I
Monday, July 18, 2016
Design flaws of “an anonymous two-factor authenticated key agreement scheme for session ...
from Google Alert - anonymous http://ift.tt/2abZjlI
via IFTTT
Knowledge Representation on the Web revisited: Tools for Prototype Based Ontologies. (arXiv:1607.04809v1 [cs.AI])
In recent years RDF and OWL have become the most common knowledge representation languages in use on the Web, propelled by the recommendation of the W3C. In this paper we present a practical implementation of a different kind of knowledge representation based on Prototypes. In detail, we present a concrete syntax easily and effectively parsable by applications. We also present extensible implementations of a prototype knowledge base, specifically designed for storage of Prototypes. These implementations are written in Java and can be extended by using the implementation as a library. Alternatively, the software can be deployed as such. Further, results of benchmarks for both local and web deployment are presented. This paper augments a research paper, in which we describe the more theoretical aspects of our Prototype system.
from cs.AI updates on arXiv.org http://ift.tt/2a3tXMQ
via IFTTT
Global Continuous Optimization with Error Bound and Fast Convergence. (arXiv:1607.04817v1 [math.OC])
This paper considers global optimization with a black-box unknown objective function that can be non-convex and non-differentiable. Such a difficult optimization problem arises in many real-world applications, such as parameter tuning in machine learning, engineering design problem, and planning with a complex physics simulator. This paper proposes a new global optimization algorithm, called Locally Oriented Global Optimization (LOGO), to aim for both fast convergence in practice and finite-time error bound in theory. The advantage and usage of the new algorithm are illustrated via theoretical analysis and an experiment conducted with 11 benchmark test functions. Further, we modify the LOGO algorithm to specifically solve a planning problem via policy search with continuous state/action space and long time horizon while maintaining its finite-time error bound. We apply the proposed planning method to accident management of a nuclear power plant. The result of the application study demonstrates the practical utility of our method.
from cs.AI updates on arXiv.org http://ift.tt/29KxjAy
via IFTTT
Piecewise convexity of artificial neural networks. (arXiv:1607.04917v1 [cs.LG])
Although artificial neural networks have shown great promise in applications ranging from computer vision to speech recognition, there remains considerable practical and theoretical difficulty in optimizing their parameters. The seemingly unreasonable success of gradient descent methods in minimizing these non-convex functions remains poorly understood. In this work we offer some theoretical guarantees concerning networks with continuous piecewise affine activation functions, which have in recent years become the norm. We prove three main results. Firstly, that the network is piecewise convex as a function of the input data. Secondly, that the network, considered as a function of the parameters in a single layer, all others held constant, is again piecewise convex. Finally, that the network as a function of all its parameters is piecewise multi-convex, a generalization of biconvexity. Accordingly, we show that any point to which gradient descent converges is a local minimum of some piece. Thus gradient descent converges to non-minima only at the boundaries of pieces. These results might offer some insights into the effectiveness of gradient descent methods in optimizing this class of networks.
from cs.AI updates on arXiv.org http://ift.tt/2aoPPjd
via IFTTT