This may be #15276, but it seems that issue has various gradations of challenge, so perhaps additional examples are useful. This contains test code ...
from Google Alert - anonymous http://ift.tt/28Z9mK7
via IFTTT
Saturday, June 25, 2016
Useful Lessons from Workaholics Anonymous, Corporate Implosions, and More
Meltdowns and how Ryan handles them; Workaholics Anonymous — How it works, what worked for him, what didn't; The tipping points for his last ...
from Google Alert - anonymous http://ift.tt/28T6ziy
via IFTTT
from Google Alert - anonymous http://ift.tt/28T6ziy
via IFTTT
Orioles Video: Kevin Gausman fans seven batters over 7.2 innings in shutout vs. Rays; earns his first win of the season (ESPN)
from ESPN http://ift.tt/1eW1vUH
via IFTTT
via IFTTT
Dozens of Malicious Apps on Play Store can Root & Hack 90% of Android Devices
It's not at all surprising that the Google Play Store is surrounded by a large number of malicious apps that has the ability to gain users' attention into falling victim for one, but this time, it is even worse than most people realize. Researchers at Trend Micro have detected a family of malicious apps, dubbed 'Godless,' that has the capability of secretly rooting almost 90 percent of all
from The Hacker News http://ift.tt/28VlCfx
via IFTTT
from The Hacker News http://ift.tt/28VlCfx
via IFTTT
Facebook Bug Allowed Hacker to Delete Any Video
Facebook has patched a serious security flaw that would have allowed hackers to delete any video uploaded in comments on someone's Facebook post. The critical vulnerability on Facebook's platform was discovered by Indian security researcher Pranav Hivarekar, who was able to delete any video of his choice by abusing this logic flaw. The issue actually resided in the new video comment feature
from The Hacker News http://ift.tt/28TDJPW
via IFTTT
from The Hacker News http://ift.tt/28TDJPW
via IFTTT
Friendly register integration with anonymous checkout
Hi there, I suggest to make integration for anonymous checkout (check if email is already registered) with a module friendly register. See also this ...
from Google Alert - anonymous http://ift.tt/28RVEp7
via IFTTT
from Google Alert - anonymous http://ift.tt/28RVEp7
via IFTTT
I have a new follower on Twitter
TMail21
Power Threads for Teams: Collaboration, Task Mgmt, Processes and Commerce right within your Discussions. #Productivity #InboxZero #BPM #ConversationalCommerce
Plano, TX
https://t.co/eAACyO7I3Q
Following: 2532 - Followers: 2771
June 25, 2016 at 02:43AM via Twitter http://twitter.com/tmail21
[FD] #146416 Ruby:HTTP Header injection in 'net/http'
TIMELINE rootredrain submitted a report to Ruby. show raw Jun 22nd Hi, I would like to report a HTTP Header injection vulnerability in 'net/http' that allows attackers to inject arbitrary headers in request even create a new evil request. PoC require 'net/http' http = Net::HTTP.new('192.168.30.214','80') res = http.get("/r.php HTTP/1.1\r\nx-injection: memeda") Example Server Code: #!/usr/bin/env ruby require 'sinatra' require 'uri' require 'net/http' get '/' do 'hello world' end post '/' do ip = params[:ip] port = params[:port] path = params[:path] # do what you want http = Net::HTTP.new ip, port.to_i res = http.get path res.body end post data: ip=192.168.30.214&port=80&path=/r.php%20HTTP/1.1%0d%0ax-injection: memeda print_r all HTTP Headers： Create an evil request post data: server log: Suggestion: Should validate URI legality before send request btw， Cloud I have a CVEID with this vulnerability? reported by @redrain(rootredrain@gmail.com) and@ztz(ztz5651483@gmail.com) 4 attachments: F100918: 123123.png F100919: 222333.png F100920: 4444.png F100921: 5555.png rootredrain posted a comment. Jun 22nd (2 days ago) The problem is this line in lib/net/http/generic_request.rb:324 def write_header(sock, ver, path) buf = "#{@method} #{path} HTTP/#{ver}\r\n" each_capitalized do |k,v| buf << "#{k}: #{v}\r\n" end buf << "\r\n" sock.write buf end "#{@method} #{path} HTTP/#{ver}\r\n" should be checked here to avoid malicious input shugo posted a comment. Jun 24th (8 hrs ago) Thanks for your report. We don't consider this a vulnerability because Net::HTTP#get is not designed to accept malicious input. Applications have responsibility to verify input syntactically and semantically (accepting all RFC2616-compliant input would not be a good idea). So we would like to handle this as a normal issue. rootredrain posted a comment. Jun 24th (2 hrs ago) Hi shugo, Thanks for the reply. Please don't leave this problem to developers, they have uneven level at developing. For example, assume we have a demo website, the only thing do is generate a new HTTP request: #!/usr/bin/env ruby require 'sinatra' get '/' do 'hello world' end post '/' do ip = params[:ip] port = params[:port] path = params[:path] # send the request to another site http = Net::HTTP.new ip, port.to_i res = http.get path res.body end It's a common demand, right ? But web developer may not realized that sinatra will auto decode url. Attacker can encode \r\n to %0a%0d, send to the sinatra, sinatra will decode url to \r\n and pass to thepath, finally cause a HTTP Header Injection or CRLF Injection. Please assume all input is malicious. Here is a similar vulnerability in python: CVE-2016-5699 Here is what another HTTP lib Faraday do may change your mind. lib/faraday/connection.rb:308 def url_prefix=(url, encoder = nil) uri = url_prefix = Utils.URI(url) self.path_prefix = uri.path # ... ... ... uri end uri = url_prefix = Utils.URI(url) try to convert url to URI, It will raise an error whenurl is invalid. lib/faraday/connection.rb:399 def build_exclusive_url(url = nil, params = nil, params_encoder = nil) url = nil if url.respond_to?(:empty?) and url.empty? base = url_prefix # ... ... ... uri = url ? base + url : base # ... ... ... end uri = url ? base + url : base will trigger another examination convert_to_uri: def convert_to_uri(uri) if uri.is_a?(URI::Generic) uri elsif uri = String.try_convert(uri) parse(uri) else raise ArgumentError, "bad argument (expected URI object or URI string)" end end If url is invalid, it will raise an error. Please let me know if you need more info. tenderlove posted a comment. Jun 24th (2 hrs ago) It's a common demand, right ? I'm not sure about that. I think this is a bug we should probably address, but I don't think we should consider this a vulnerability. Fetching arbitrary paths from user input seems pretty dubious. rootredrain posted a comment. Jun 24th (about 1 hr ago) Hi tenderlove, Here is my point : All input can not be trusted. We should validate url in Net::HTTP tenderlove posted a comment. Jun 24th (about 1 hr ago) All input can not be trusted. Yes, people should be whitelisting paths passed in. An open proxy is already a vulnerability, regardless of header injection. As I said, we should treat this as a bug. But since an open proxy is already a security problem (that we cannot fix), then I don't think this bug should be treated as a security issue. shugo posted a comment. Jun 24th (34 mins ago) But web developer may not realized that sinatra will auto decode url. Attacker can encode \r\n to %0a%0d, send to the sinatra, sinatra will decode url to \r\n and pass to the path, finally cause a HTTP Header Injection or CRLF Injection. In that case, it seems to be a bug of that application, not Net::HTTP#get. I'm not against adding argument verification to Net::HTTP#get, though. rootredrain posted a comment. Jun 24th (29 mins ago) But since an open proxy is already a security problem Yes, an open proxy is already a vulnerability and you can't fix that, but attack scenarios is not only include an open proxy, but also include many other parts. A site like google image, user can paste image url on it, then site will request the resource. It's possible to suffer this attack. Some video sites allow user reference outside resource. It's possible to suffer this attack. So you can not treat it occur in an unusual scenarios. I still consider it was a security issue. rootredrain posted a comment. Jun 24th (27 mins ago) If you believe this is not a issue, please allow the public disclosure. tenderlove closed the report and changed the status to Informative. Jun 24th (23 mins ago) I've closed as informative, and I'll allow public disclosure. tenderlove requested to disclose this report publicly. Jun 24th (20 mins ago) rootredrain has requested mediation from HackerOne Support. Jun 24th (15 mins ago) The HTTP scheme handler accepts percent-encoded values as part of the URL. The generic_request.rb allows unsafe characters, it dosen't have any safe filtration, attackers can cause actual security threat. so we consider it is a vulnerability
Source: Gmail -> IFTTT-> Blogger
Source: Gmail -> IFTTT-> Blogger
[FD] EdgeCore - ES3526XA Manager - Multiple Vulnerabilities
*EdgeCore - Layer2+ Fast Ethernet Standalone Switch ES3526XA Manager - Multiple Vulnerabilities* Also rebranded as: *SMC TigerSwitch 10/100 SMC6128L2 Manager* Object ID: 1.3.6.1.4.1.259.8.1.5 Switch Information
Source: Gmail -> IFTTT-> Blogger
Source: Gmail -> IFTTT-> Blogger
[FD] Faraday v1.0.21 with our new GTK interface!
Faraday is the Integrated Multiuser Risk Environment you were looking for! It maps and leverages all the knowledge you generate in real time, letting you track and understand your audits. Our dashboard for CISOs and managers uncovers the impact and risk being assessed by the audit in real-time without the need for a single email. Developed with a specialized set of functionalities that help users improve their own work, the main purpose is to re-use the available tools in the community taking advantage of them in a collaborative way! Check out the Faraday project in Github. As we mentioned before, we're really excited with our new GTK interface! So this iteration was mostly based on improving it and preparing the tool to deprecate the QT interface. Check out all the brand new features we prepared just for you! Now you can view all your Hosts within the sidebar, each with its OS and number of vulnerabilities found. But that's not all - if you click one of the hosts the Hosts detail window will be displayed showing host data and all of its Interfaces and Services will be listed in a tree structure, along with all the vulnerabilities found in each of them. On the rightmost part of the window, you'll have all the information about your selected objects, like ports and protocol for your Services or severity for your Vulnerabilities. Say goodbye to manually copying your reports to the report folder and waiting for Faraday to detect the file. Just click on the import report button on the rightmost top corner of Faraday GTK, select a plugin to parse your report and then choose the report. As easy as that. Some actions take a while to load and that's a part of handling great amounts of data, regardless you should know what's happening backstage while the program is unresponsive. That's why we added a Loading dialog for some critical operations, like changing workspaces. Never again wonder what Faraday is doing! Changes: * Fixed the title color for all vulns in the Executive Report - all vuln titles were painted as critical due to a problem with the template, but not anymore! * Added Import Report dialog to Faraday GTK * Added a 'Loading workspace...' dialog to Faraday GTK * Added host sidebar to Faraday GTK * Added host information dialog to Faraday GTK with the full data about a host, its interfaces, services and vulnerabilities * Added support for run Faraday from other directories - supported in all interfaces * Fixed log reappearing after being disabled if user created a new tab * Fixed bug regarding exception handling in Faraday GTK * Now Faraday GTK supports Ctrl+Shift+C / Ctrl+Shift+V to Copy/Paste * Faraday will now not crash if you suddenly lose connection to your CouchDB We hope you enjoy it, and let us know if you have any questions or comments. http://ift.tt/1D4inIk http://ift.tt/1D8gKXz https://twitter.com/faradaysec
Source: Gmail -> IFTTT-> Blogger
Source: Gmail -> IFTTT-> Blogger
[FD] [ERPSCAN-16-018] SAP Application server for Javat - DoS vulnerability
Application: SAP NetWeaver AS JAVA Versions Affected: SAP Application server for Java 7.2 - 7.4 Vendor URL: http://SAP.com Bugs: denial of service Sent: 04.12.2015 Reported: 05.12.2015 Vendor response: 05.12.2015 Date of Public Advisory: 14.03.2016 Reference: SAP Security Note 2259547 Author: Dmitry Yudin (ERPScan) @ret5et Description 1. ADVISORY INFORMATION Title: SAP Application server for Java – DoS vulnerability Advisory ID: [ERPSCAN-16-018] Risk: Medium Advisory URL: http://ift.tt/1NlfaGF Date published: 14.03.2016 Vendors contacted: SAP 2. VULNERABILITY INFORMATION Class: denial of service Impact: denial of service Remotely Exploitable: Yes Locally Exploitable: No CVE: CVE-2016-3980 CVSS Information CVSS Base Score v3: 7.5 / 10 CVSS Base Vector: AV : Attack Vector (Related exploit range) Network (N) AC : Attack Complexity (Required attack complexity) Low (L) PR : Privileges Required (Level of privileges needed to exploit) None (N) UI : User Interaction (Required user participation) None (N) S : Scope (Change in scope due to impact caused to components beyond the vulnerable component) Unchanged (U) C : Impact to Confidentiality None (N) I : Impact to Integrity None (N) A : Impact to Availability High (H) 3. VULNERABILITY DESCRIPTION The Java Startup Framework (jstart) in SAP Application server for Java allows remote attackers to cause a denial of service via a crafted request. 4. VULNERABLE PACKAGES SAP Application server for Java 7.2- 7.4 Other versions are probably affected too, but they were not checked. 5. SOLUTIONS AND WORKAROUNDS To correct this vulnerability, install SAP Security Note 2259547 6. AUTHOR Dmitry Yudin (ERPScan) @ret5et 7. TECHNICAL DESCRIPTION Anonymous attacker can use a special HTTP request to cause a denial of service in SAP AS JAVA. 8. REPORT TIMELINE Sent: 04.12.2015 Reported: 05.12.2015 Vendor response: 05.12.2015 Date of Public Advisory: 14.03.2016 9. REFERENCES http://ift.tt/1NlfaGF http://ift.tt/297jDAv 10. ABOUT ERPScan Research The company’s expertise is based on the research subdivision of ERPScan, which is engaged in vulnerability research and analysis of critical enterprise applications. It has achieved multiple acknowledgments from the largest software vendors like SAP, Oracle, Microsoft, IBM, VMware, HP for discovering more than 400 vulnerabilities in their solutions (200 of them just in SAP!). ERPScan researchers are proud to have exposed new types of vulnerabilities (TOP 10 Web Hacking Techniques 2012) and to be nominated for the best server-side vulnerability at BlackHat 2013. ERPScan experts have been invited to speak, present, and train at 60+ prime international security conferences in 25+ countries across the continents. These include BlackHat, RSA, HITB, and private SAP trainings in several Fortune 2000 companies. ERPScan researchers lead the project EAS-SEC, which is focused on enterprise application security research and awareness. They have published 3 exhaustive annual award-winning surveys about SAP security. ERPScan experts have been interviewed by leading media resources and featured in specialized info-sec publications worldwide. These include Reuters, Yahoo, SC Magazine, The Register, CIO, PC World, DarkReading, Heise, and Chinabyte, to name a few. We have highly qualified experts in staff with experience in many different fields of security, from web applications and mobile/embedded to reverse engineering and ICS/SCADA systems, accumulating their experience to conduct the best SAP security research. 11. ABOUT ERPScan ERPScan is the most respected and credible Business Application Security provider. Founded in 2010, the company operates globally and enables large Oil and Gas, Financial and Retail organizations to secure their mission-critical processes. Named as an ‘Emerging Vendor’ in Security by CRN, listed among “TOP 100 SAP Solution providers” and distinguished by 30+ other awards, ERPScan is the leading SAP SE partner in discovering and resolving security vulnerabilities. ERPScan consultants work with SAP SE in Walldorf to assist in improving the security of their latest solutions. ERPScan’s primary mission is to close the gap between technical and business security, and provide solutions to evaluate and secure SAP and Oracle ERP systems and business-critical applications from both, cyber-attacks as well as internal fraud. Usually our clients are large enterprises, Fortune 2000 companies and managed service providers whose requirements are to actively monitor and manage security of vast SAP landscapes on a global scale. We ‘follow the sun’ and function in two hubs, located in the Palo Alto and Amsterdam to provide threat intelligence services, agile support and operate local offices and partner network spanning 20+ countries around the globe. Adress USA: 228 Hamilton Avenue, Fl. 3, Palo Alto, CA. 94301 Phone: 650.798.5255 Twitter: @erpscan Scoop-it: Business Application Security
Source: Gmail -> IFTTT-> Blogger
Source: Gmail -> IFTTT-> Blogger
[FD] [ERPSCAN-16-017] SAP JAVA AS icman - DoS vulnerability
Application: SAP NetWeaver AS JAVA Versions Affected: SAP NetWeaver AS JAVA 7.2 - 7.4 Vendor URL: http://SAP.com Bugs: denial of service Sent: 04.12.2015 Reported: 05.12.2015 Vendor response: 05.12.2015 Date of Public Advisory: 14.03.2016 Reference: SAP Security Note 2256185 Author: Dmitry Yudin (ERPScan) @ret5et Description 1. ADVISORY INFORMATION Title: SAP JAVA AS icman – DoS vulnerability Advisory ID: [ERPSCAN-16-017] Risk: Medium Advisory URL: http://ift.tt/1NlfaGE Date published: 14.03.2016 Vendors contacted: SAP 2. VULNERABILITY INFORMATION Class: denial of service Impact: denial of service Remotely Exploitable: Yes Locally Exploitable: Yes CVE: CVE-2016-3979 CVSS Information CVSS Base Score v3: 7.5 / 10 CVSS Base Vector: AV : Attack Vector (Related exploit range) Network (N) AC : Attack Complexity (Required attack complexity) Low (L) PR : Privileges Required (Level of privileges needed to exploit) None (N) UI : User Interaction (Required user participation) None (N) S : Scope (Change in scope due to impact caused to components beyond the vulnerable component) Unchanged (U) C : Impact to Confidentiality None (N) I : Impact to Integrity None (N) A : Impact to Availability High (H) 3. VULNERABILITY DESCRIPTION Internet Communication Manager (ICMAN/ICM) in SAP JAVA AS 7.4 allows remote attackers to cause a denial of service (possible heap corruption IctParseCookies()) via a crafted HTTP request 4. VULNERABLE PACKAGES SAP NetWeaver AS JAVA 7.2- 7.4 Other versions are probably affected too, but they were not checked. 5. SOLUTIONS AND WORKAROUNDS To correct this vulnerability, install SAP Security Note 2256185 6. AUTHOR Dmitry Yudin (ERPScan) @ret5et 7. TECHNICAL DESCRIPTION Anonymous attacker can use a special HTTP request to cause a denial of service in SAP AS JAVA. 8. REPORT TIMELINE Sent: 04.12.2015 Reported: 05.12.2015 Vendor response: 05.12.2015 Date of Public Advisory: 14.03.2016 9. REFERENCES http://ift.tt/1NlfaGE http://ift.tt/297jDAv 10. ABOUT ERPScan Research The company’s expertise is based on the research subdivision of ERPScan, which is engaged in vulnerability research and analysis of critical enterprise applications. It has achieved multiple acknowledgments from the largest software vendors like SAP, Oracle, Microsoft, IBM, VMware, HP for discovering more than 400 vulnerabilities in their solutions (200 of them just in SAP!). ERPScan researchers are proud to have exposed new types of vulnerabilities (TOP 10 Web Hacking Techniques 2012) and to be nominated for the best server-side vulnerability at BlackHat 2013. ERPScan experts have been invited to speak, present, and train at 60+ prime international security conferences in 25+ countries across the continents. These include BlackHat, RSA, HITB, and private SAP trainings in several Fortune 2000 companies. ERPScan researchers lead the project EAS-SEC, which is focused on enterprise application security research and awareness. They have published 3 exhaustive annual award-winning surveys about SAP security. ERPScan experts have been interviewed by leading media resources and featured in specialized info-sec publications worldwide. These include Reuters, Yahoo, SC Magazine, The Register, CIO, PC World, DarkReading, Heise, and Chinabyte, to name a few. We have highly qualified experts in staff with experience in many different fields of security, from web applications and mobile/embedded to reverse engineering and ICS/SCADA systems, accumulating their experience to conduct the best SAP security research. 11. ABOUT ERPScan ERPScan is the most respected and credible Business Application Security provider. Founded in 2010, the company operates globally and enables large Oil and Gas, Financial and Retail organizations to secure their mission-critical processes. Named as an ‘Emerging Vendor’ in Security by CRN, listed among “TOP 100 SAP Solution providers” and distinguished by 30+ other awards, ERPScan is the leading SAP SE partner in discovering and resolving security vulnerabilities. ERPScan consultants work with SAP SE in Walldorf to assist in improving the security of their latest solutions. ERPScan’s primary mission is to close the gap between technical and business security, and provide solutions to evaluate and secure SAP and Oracle ERP systems and business-critical applications from both, cyber-attacks as well as internal fraud. Usually our clients are large enterprises, Fortune 2000 companies and managed service providers whose requirements are to actively monitor and manage security of vast SAP landscapes on a global scale. We ‘follow the sun’ and function in two hubs, located in the Palo Alto and Amsterdam to provide threat intelligence services, agile support and operate local offices and partner network spanning 20+ countries around the globe. Adress USA: 228 Hamilton Avenue, Fl. 3, Palo Alto, CA. 94301 Phone: 650.798.5255 Twitter: @erpscan Scoop-it: Business Application Security
Source: Gmail -> IFTTT-> Blogger
Source: Gmail -> IFTTT-> Blogger
Matriculated
A teaser of The Lady's fourth album, Revolutions. Contains a diverse selection exemplifying the range of styles found on the album, from orchestral ...
from Google Alert - anonymous https://www.google.com/url?rct=j&sa=t&url=https://www.jamendo.com/album/159817/matriculated&ct=ga&cd=CAIyGjgxMzAxNTQ0ZWE3M2NhMmQ6Y29tOmVuOlVT&usg=AFQjCNG4CaIg6sfPggV3SDYFwActpVv7Ig
via IFTTT
from Google Alert - anonymous https://www.google.com/url?rct=j&sa=t&url=https://www.jamendo.com/album/159817/matriculated&ct=ga&cd=CAIyGjgxMzAxNTQ0ZWE3M2NhMmQ6Y29tOmVuOlVT&usg=AFQjCNG4CaIg6sfPggV3SDYFwActpVv7Ig
via IFTTT
Sagittarius Sunflowers
These three bright nebulae are often featured in telescopic tours of the constellation Sagittarius and the crowded starfields of the central Milky Way. In fact, 18th century cosmic tourist Charles Messier cataloged two of them; M8, the large nebula left of center, and colorful M20 near the bottom of the frame The third, NGC 6559, is right of M8, separated from the larger nebula by dark dust lanes. All three are stellar nurseries about five thousand light-years or so distant. The expansive M8, over a hundred light-years across, is also known as the Lagoon Nebula. M20's popular moniker is the Trifid. In the composite image, narrowband data records ionized hydrogen, oxygen, and sulfur atoms radiating at visible wavelengths. The mapping of colors and range of brightness used to compose this cosmic still life were inspired by Van Gogh's famous Sunflowers. Just right of the Trifid one of Messier's open star clusters, M21, is also included on the telescopic canvas. via NASA http://ift.tt/28RRxrB
Friday, June 24, 2016
Sonata in F major, D-SWl Mus.532 (Anonymous)
Sonata in F major, D-SWl Mus.532 (Anonymous). Add File. Add Sheet MusicAdd Your ... Composer, Anonymous. Key, F major. Movements/Sections, 3 ...
from Google Alert - anonymous https://www.google.com/url?rct=j&sa=t&url=http://imslp.org/wiki/Sonata_in_F_major,_D-SWl_Mus.532_(Anonymous)&ct=ga&cd=CAIyGjgxMzAxNTQ0ZWE3M2NhMmQ6Y29tOmVuOlVT&usg=AFQjCNGhzuStzCR7GDsvpq6Dx_fn9EiexQ
via IFTTT
from Google Alert - anonymous https://www.google.com/url?rct=j&sa=t&url=http://imslp.org/wiki/Sonata_in_F_major,_D-SWl_Mus.532_(Anonymous)&ct=ga&cd=CAIyGjgxMzAxNTQ0ZWE3M2NhMmQ6Y29tOmVuOlVT&usg=AFQjCNGhzuStzCR7GDsvpq6Dx_fn9EiexQ
via IFTTT
Orioles Video: Chris Davis rips a single to right center field, brings in three runs in 6-3 win over the Rays (ESPN)
from ESPN http://ift.tt/1eW1vUH
via IFTTT
via IFTTT
Anonymous 6/29/16
Today's programming is made possible in part by a GLT Day Sponsor honoring Catherine Miller for her dedication as Interim Dean of Mennonite ...
from Google Alert - anonymous https://www.google.com/url?rct=j&sa=t&url=http://wglt.org/post/anonymous-62916&ct=ga&cd=CAIyGjgxMzAxNTQ0ZWE3M2NhMmQ6Y29tOmVuOlVT&usg=AFQjCNFNRCEqCBgrqdY5aM8EIoqGZjdq8A
via IFTTT
from Google Alert - anonymous https://www.google.com/url?rct=j&sa=t&url=http://wglt.org/post/anonymous-62916&ct=ga&cd=CAIyGjgxMzAxNTQ0ZWE3M2NhMmQ6Y29tOmVuOlVT&usg=AFQjCNFNRCEqCBgrqdY5aM8EIoqGZjdq8A
via IFTTT
Text-anonymous-game-of-thrones-spoilers-to-your-enemies
This is so good but oh so evil. A new app has been launched that allows people to text anonymous Game of Thrones spoilers to their enemies.
from Google Alert - anonymous http://ift.tt/28SflMQ
via IFTTT
from Google Alert - anonymous http://ift.tt/28SflMQ
via IFTTT
ISS Daily Summary Report – 06/23/16
Japanese Experiment Module (JEM) Airlock (JEMAL) Exposed Experiment Handrail Attachment Mechanism (ExHAM) #1-2 Operations: Following the JEM Remote Manipulator System (JEMRMS) Small Fine Arm (SFA) retrieval and detachment of 14 ExHAM #1 samples from the Handhold Experiment Platform last week, today the new samples were installed. ExHAM #1-2 is the first return and sample exchange mission of the 1-year exposed ExHAM #1 which contain 17 samples and 14 will be returned on SpX-9. ExHAM is a cuboid mechanism equipped with a fixture on the upper surface for grappling by the JEMRMS SFA, and has components on the under surface for attaching the ExHAM to the handrail on the JEM Exposed Facility. Microchannel Diffusion Glacier Sample Retrieve and Diffusion Plate Changeout: Samples were retrieved from the Glacier and temporarily stowed to allow the samples to thaw. The Diffusion Plate in the LMM (Light Microscopy Module) AFC (Auxiliary Fluids Container) was removed and exchanged with another plate. Microchannel Diffusion takes advantage of microgravity to study interactions of medicine, biology, computer science and many other fields that benefit from nanotechnology at slightly larger scales, providing a new understanding of particle flows at the nanoscale. Habitability Human Factors Directed Observations: The crew completed a Habitability session by recording and submitting a walk-through video documenting observations of an area or activity providing insight related to human factors and habitability. The Habitability investigation collects observations about the relationship between crew members and their environment on the International Space Station. Observations can help spacecraft designers understand how much habitable volume is required, and whether a mission’s duration impacts how much space crew members need. Microbial In-Flight Water Operations: On Tuesday the crew collected water samples to determine water quality onboard the ISS with the focus on microbial and coliform detection. Today he visually analyzed Coliform Detection Bags and Microbial Capture Devices following the required 48 hours of incubation. Today’s Planned Activities All activities were completed unless otherwise noted. SPLANKH. EGEG Prep and Recording (start) r/g 2608 SEISMOPROGNOZ. Transfer of Data from МКСД Hard Drive (start) r/g 2224 Closure of USOS Window Shutters Coolant Refill of the MRM2 Thermal Control System [СОТР] Accumulator from the Accumulator of SM [СОТР] Internal Thermal Loop КОБ1 r/g 2615 EHS MCD. Onboard Water Processing and GMT 175 Data Recording Coolant Refill of the Accumulator of SM [СОТР] Internal Thermal Loop КОБ1 Using Refill Tools Set r/g 2615 WRS. Recycle Tank Fill from a EDV R&R of Filters on ПС1 and ПС2 Dust Collectors in the FGB EMU Metal Oxide (METOX) Regeneration (end) Food Frequency Questionnaire (FFQ) MDE. Samples Retrieval and Temp Stow СОЖ Maintenance. Filling of SM Rodnik БВ-1 Tank with Disinfectant r/g 2624 FIR. Rack Doors Opening LMM. Microchannel Diffusion Plate R&R IMS Delta File Prep/ Inventory Management System Coolant Refill of the DC1 Thermal Control System [СОТР] Accumulator from the Accumulator of SM [СОТР] Internal Thermal Loop КОБ2 r/g 2615 SPLANKH. EGEG Recording (end). Closeout Ops r/g 2608 FIR. Closure of Rack Doors Coolant Refill of the Accumulator of SM [СОТР] Internal Thermal Loop КОБ2 Using Refill Tools Set r/g 2615 XF305 Camcorder Setup Handhold Exp Platform #1 (HXP1) Items Gathering JEM Airlock Slide Table (ST) Extension to JPM Side Handhold Experiment. Sample Attachment on Platform 1(HXP1) URAGAN. Observation and Photography with VSS Hardware / r/g 2620 BAR. Leak Detector Checkout r/g 2617 JEM Airlock Slide Table (ST) Retraction from JPM Side OTKLIK. Sensors Functional Check and Point of Impact Accuracy Check. Part 1 r/g 2619 Habitability iPad App Update HABIT. Questionnaire Hardware Setup for a PAO Event SEISMOPROGNOZ. Transfer of Data from МКСД Hard Drive (end) and Archiving (start) r/g 2224 Crew Preparation for the PAO Event PAO Event IMS Conference Countermeasures System – Sprint Exercise – Optional OTKLIK. Hardware Monitoring / r/g 1588 Completed Task List Items iPAD cert update [Active] Ground Activities All activities were completed unless otherwise noted. Nominal ground commanding Three-Day Look Ahead: Friday, 06/24: JEMAL pressurization, leak check, PBRE hardware stow Saturday, 06/25: Crew off duty, housekeeping Sunday, 06/26: Crew off duty QUICK ISS Status – Environmental Control Group: Component Status Elektron On Vozdukh Manual [СКВ] 1 – SM Air Conditioner System (“SKV1”) Off [СКВ] 2 – SM Air Conditioner System (“SKV2”) Off Carbon Dioxide Removal Assembly (CDRA) Lab Standby Carbon Dioxide Removal Assembly (CDRA) Node 3 Operate Major Constituent Analyzer (MCA) Lab Idle Major Constituent Analyzer (MCA) Node 3 Operate Oxygen Generation Assembly (OGA) Process Urine Processing Assembly (UPA) Standby Trace Contaminant Control System (TCCS) Lab Off Trace Contaminant Control System (TCCS) Node 3 Full Up
from ISS On-Orbit Status Report http://ift.tt/293GBIt
via IFTTT
from ISS On-Orbit Status Report http://ift.tt/293GBIt
via IFTTT
Uber Hack lets anyone find Unlimited Promo Codes for Free Uber Rides
An Independent Security Researcher from Egypt has discovered a critical vulnerability in Uber app that could allow an attacker to brute force Uber promo code value and get valid codes with the high amount of up to $25,000 for more than one free rides. Mohamed M.Fouad has discovered a "promo codes brute-force attack" vulnerability in the sign-up invitation link for Uber that allows any user to
from The Hacker News http://ift.tt/28ThhcN
via IFTTT
from The Hacker News http://ift.tt/28ThhcN
via IFTTT
[FD] SEC Consult SA-20160624-0 :: ASUS DSL-N55U router XSS and information disclosure
SEC Consult Vulnerability Lab Security Advisory < 20160624-0 > ======================================================================= title: XSS and information disclosure vulnerability product: ASUS DSL-N55U router vulnerable version: 3.0.0.4.376_2736 fixed version: 3.0.0.4_380_3679 CVE number: requested impact: Medium homepage: https://www.asus.com/ found: 2016-04-12 by: P. Morimoto (Office Bangkok) SEC Consult Vulnerability Lab An integrated part of SEC Consult Bangkok - Berlin - Frankfurt/Main - Montreal - Moscow Singapore - Vienna (HQ) - Vilnius - Zurich http://ift.tt/1mGHMNR ======================================================================= Vendor description:
Source: Gmail -> IFTTT-> Blogger
Source: Gmail -> IFTTT-> Blogger
Apple left iOS 10 Kernel Code Unencrypted, Intentionally!
Apple’s new iOS 10 recently made headlines after MIT Technology Review revealed that the company had left the kernel of the mobile operating system unencrypted. Yes, the first developer preview of iOS 10 released at WWDC has an unencrypted kernel. When the headline broke, some of the users were surprised enough that they assumed Apple had made a mistake by leaving unencrypted kernel in iOS
from The Hacker News http://ift.tt/292xnfM
via IFTTT
from The Hacker News http://ift.tt/292xnfM
via IFTTT
Monsoons: Wet, Dry, Repeat...
The monsoon is a seasonal rain and wind pattern that occurs over South Asia (among other places). Through NASA satellites and models we can see the monsoon patterns like never before. Monsoon rains provide important reservoirs of water that sustain human activities like agriculture and supports the natural environment through replenishment of aquifers. However, too much rainfall routinely causes disasters in the region, including flooding of the major rivers and landslides in areas of steep topography. This visualization uses a combination of NASA satellite data and models to show how and why the monsoon develops over this region. In the summer the land gets hotter, heating the atmosphere and pulling in cooler, moisture-laden air from the oceans. This causes pulses in heavy rainfall throughout the region. In the winter the land cools off and winds move towards the warmer ocean and suppressing rainfall on land.
from NASA's Scientific Visualization Studio: Most Recent Items http://ift.tt/28PmHl3
via IFTTT
from NASA's Scientific Visualization Studio: Most Recent Items http://ift.tt/28PmHl3
via IFTTT
High Resolution Layers from "Monsoons: Wet, Dry, Repeat..."
The visualizations here are based on the visualization "Monsoons: Wet, Dry, Repeat". Each data set is presented in three resolutions: 8192x4096, 4096x2048, and 2048x1024. Each the 8192x4096 and 4096x2048 layers have been rendered with alpha transparency channels to allow you to create your own combinations of layered data. NOTE: the preview movies are composited over a black background, but the individual 8192x4096 and 4096x2048 frames have transparency channels. The 2048x1024 frames do not have transparency channels. The layers have frame numbers from 01000 through 13000. Frame 01000 corresponds to 02 Jun 2014 at 00:00 GMT. Each successive frame is 15 minutes later. Frame 13000 corresponds to 05 Oct 2014 at 00:00 GMT. To determine the time for a specific layer's frame number, you can look at the date sequence's corresponding frame. Even though all layers are provided at 15 minute intervals, most data sets do not have such a high cadence. In these cases, the frames simply show the same data. See the annotation with each data set for the cadence's.
from NASA's Scientific Visualization Studio: Most Recent Items http://ift.tt/28UmcK9
via IFTTT
from NASA's Scientific Visualization Studio: Most Recent Items http://ift.tt/28UmcK9
via IFTTT
North American Monsoon
The monsoon is a seasonal rain and wind pattern that occurs all over the world. Through NASA satellites and models we can see the monsoon patterns like never before. Monsoon rains provide important reservoirs of water that sustain human activities like agriculture and supports the natural environment through replenishment of aquifers. This visualization uses NASA precipitation and soil moisture data to show how the monsoon develops over North America.
from NASA's Scientific Visualization Studio: Most Recent Items http://ift.tt/28PmIFn
via IFTTT
from NASA's Scientific Visualization Studio: Most Recent Items http://ift.tt/28PmIFn
via IFTTT
Thursday, June 23, 2016
Finding Proofs in Tarskian Geometry. (arXiv:1606.07095v1 [cs.AI])
We report on a project to use a theorem prover to find proofs of the theorems in Tarskian geometry. These theorems start with fundamental properties of betweenness, proceed through the derivations of several famous theorems due to Gupta and end with the derivation from Tarski's axioms of Hilbert's 1899 axioms for geometry. They include the four challenge problems left unsolved by Quaife, who two decades ago found some \Otter proofs in Tarskian geometry (solving challenges issued in Wos's 1998 book). There are 212 theorems in this collection. We were able to find \Otter proofs of all these theorems. We developed a methodology for the automated preparation and checking of the input files for those theorems, to ensure that no human error has corrupted the formal development of an entire theory as embodied in two hundred input files and proofs. We distinguish between proofs that were found completely mechanically (without reference to the steps of a book proof) and proofs that were constructed by some technique that involved a human knowing the steps of a book proof. Proofs of length 40--100, roughly speaking, are difficult exercises for a human, and proofs of 100-250 steps belong in a Ph.D. thesis or publication. 29 of the proofs in our collection are longer than 40 steps, and ten are longer than 90 steps. We were able to derive completely mechanically all but 26 of the 183 theorems that have "short" proofs (40 or fewer deduction steps). We found proofs of the rest, as well as the 29 "hard" theorems, using a method that requires consulting the book proof at the outset. Our "subformula strategy" enabled us to prove four of the 29 hard theorems completely mechanically. These are Ph.D. level proofs, of length up to 108.
from cs.AI updates on arXiv.org http://ift.tt/28P69cL
via IFTTT
Automated Extraction of Number of Subjects in Randomised Controlled Trials. (arXiv:1606.07137v1 [cs.AI])
We present a simple approach for automatically extracting the number of subjects involved in randomised controlled trials (RCT). Our approach first applies a set of rule-based techniques to extract candidate study sizes from the abstracts of the articles. Supervised classification is then performed over the candidates with support vector machines, using a small set of lexical, structural, and contextual features. With only a small annotated training set of 201 RCTs, we obtained an accuracy of 88\%. We believe that this system will aid complex medical text processing tasks such as summarisation and question answering.
from cs.AI updates on arXiv.org http://ift.tt/28R3iik
via IFTTT
An Approach to Stable Gradient Descent Adaptation of Higher-Order Neural Units. (arXiv:1606.07149v1 [cs.NE])
Stability evaluation of a weight-update system of higher-order neural units (HONUs) with polynomial aggregation of neural inputs (also known as classes of polynomial neural networks) for adaptation of both feedforward and recurrent HONUs by a gradient descent method is introduced. An essential core of the approach is based on spectral radius of a weight-update system, and it allows stability monitoring and its maintenance at every adaptation step individually. Assuring stability of the weight-update system (at every single adaptation step) naturally results in adaptation stability of the whole neural architecture that adapts to target data. As an aside, the used approach highlights the fact that the weight optimization of HONU is a linear problem, so the proposed approach can be generally extended to any neural architecture that is linear in its adaptable parameters.
from cs.AI updates on arXiv.org http://ift.tt/291lsPj
via IFTTT
E-commerce in Your Inbox: Product Recommendations at Scale. (arXiv:1606.07154v1 [cs.AI])
In recent years online advertising has become increasingly ubiquitous and effective. Advertisements shown to visitors fund sites and apps that publish digital content, manage social networks, and operate e-mail services. Given such large variety of internet resources, determining an appropriate type of advertising for a given platform has become critical to financial success. Native advertisements, namely ads that are similar in look and feel to content, have had great success in news and social feeds. However, to date there has not been a winning formula for ads in e-mail clients. In this paper we describe a system that leverages user purchase history determined from e-mail receipts to deliver highly personalized product ads to Yahoo Mail users. We propose to use a novel neural language-based algorithm specifically tailored for delivering effective product recommendations, which was evaluated against baselines that included showing popular products and products predicted based on co-occurrence. We conducted rigorous offline testing using a large-scale product purchase data set, covering purchases of more than 29 million users from 172 e-commerce websites. Ads in the form of product recommendations were successfully tested on online traffic, where we observed a steady 9% lift in click-through rates over other ad formats in mail, as well as comparable lift in conversion rates. Following successful tests, the system was launched into production during the holiday season of 2014.
from cs.AI updates on arXiv.org http://ift.tt/290IjvN
via IFTTT
Adaptive Task Assignment in Online Learning Environments. (arXiv:1606.07233v1 [cs.AI])
With the increasing popularity of online learning, intelligent tutoring systems are regaining increased attention. In this paper, we introduce adaptive algorithms for personalized assignment of learning tasks to student so that to improve his performance in online learning environments. As main contribution of this paper, we propose a a novel Skill-Based Task Selector (SBTS) algorithm which is able to approximate a student's skill level based on his performance and consequently suggest adequate assignments. The SBTS is inspired by the class of multi-armed bandit algorithms. However, in contrast to standard multi-armed bandit approaches, the SBTS aims at acquiring two criteria related to student learning, namely: which topics should the student work on, and what level of difficulty should the task be. The SBTS centers on innovative reward and punishment schemes in a task and skill matrix based on the student behaviour.
To verify the algorithm, the complex student behaviour is modelled using a neighbour node selection approach based on empirical estimations of a students learning curve. The algorithm is evaluated with a practical scenario from a basic java programming course. The SBTS is able to quickly and accurately adapt to the composite student competency --- even with a multitude of student models.
from cs.AI updates on arXiv.org http://ift.tt/28QCjpH
via IFTTT
Log-based Evaluation of Label Splits for Process Models. (arXiv:1606.07259v1 [cs.DB])
Process mining techniques aim to extract insights in processes from event logs. One of the challenges in process mining is identifying interesting and meaningful event labels that contribute to a better understanding of the process. Our application area is mining data from smart homes for elderly, where the ultimate goal is to signal deviations from usual behavior and provide timely recommendations in order to extend the period of independent living. Extracting individual process models showing user behavior is an important instrument in achieving this goal. However, the interpretation of sensor data at an appropriate abstraction level is not straightforward. For example, a motion sensor in a bedroom can be triggered by tossing and turning in bed or by getting up. We try to derive the actual activity depending on the context (time, previous events, etc.). In this paper we introduce the notion of label refinements, which links more abstract event descriptions with their more refined counterparts. We present a statistical evaluation method to determine the usefulness of a label refinement for a given event log from a process perspective. Based on data from smart homes, we show how our statistical evaluation method for label refinements can be used in practice. Our method was able to select two label refinements out of a set of candidate label refinements that both had a positive effect on model precision.
from cs.AI updates on arXiv.org http://ift.tt/291luXA
via IFTTT
A review of undirected and acyclic directed Gaussian Markov model selection and estimation. (arXiv:1606.07282v1 [stat.ME])
Markov models lie at the interface between statistical independence in a probability distribution and graph separation properties. We review model selection and estimation in directed and undirected Markov models with Gaussian parametrization, emphasizing the main similarities and differences. These two model types are foundationally similar but not equivalent, as we highlight. We report existing results from a historical perspective, taking into account literature from both the artificial intelligence and statistics research communities, which first developed these models. Finally, we point out the main active research areas and open problems now existing with regard to these traditional, albeit rich, Markov models.
from cs.AI updates on arXiv.org http://ift.tt/290IrLs
via IFTTT
Proceedings Fifteenth Conference on Theoretical Aspects of Rationality and Knowledge. (arXiv:1606.07295v1 [cs.GT])
The 15th Conference on Theoretical Aspects of Rationality and Knowledge (TARK) took place in Carnegie Mellon University, Pittsburgh, USA from June 4 to 6, 2015.
The mission of the TARK conferences is to bring together researchers from a wide variety of fields, including Artificial Intelligence, Cryptography, Distributed Computing, Economics and Game Theory, Linguistics, Philosophy, and Psychology, in order to further our understanding of interdisciplinary issues involving reasoning about rationality and knowledge.
These proceedings consist of a subset of the papers / abstracts presented at the TARK conference.
from cs.AI updates on arXiv.org http://ift.tt/291ltTw
via IFTTT
Multi-Stage Temporal Difference Learning for 2048-like Games. (arXiv:1606.07374v1 [cs.AI])
Szubert and Jaskowski successfully used temporal difference (TD) learning together with n-tuple networks for playing the game 2048. However, we observed a phenomenon that the programs based on TD learning still hardly reach large tiles. In this paper, we propose multi-stage TD (MS-TD) learning, a kind of hierarchical reinforcement learning method, to effectively improve the performance for the rates of reaching large tiles, which are good metrics to analyze the strength of 2048 programs. Our experiments showed significant improvements over the one without using MS-TD learning. Namely, using 3-ply expectimax search, the program with MS-TD learning reached 32768-tiles with a rate of 18.31%, while the one with TD learning did not reach any. After further tuned, our 2048 program reached 32768-tiles with a rate of 31.75% in 10,000 games, and one among these games even reached a 65536-tile, which is the first ever reaching a 65536-tile to our knowledge. In addition, MS-TD learning method can be easily applied to other 2048-like games, such as Threes. Based on MS-TD learning, our experiments for Threes also demonstrated similar performance improvement, where the program with MS-TD learning reached 6144-tiles with a rate of 7.83%, while the one with TD learning only reached 0.45%.
from cs.AI updates on arXiv.org http://ift.tt/28QCaTf
via IFTTT
Robust Learning of Fixed-Structure Bayesian Networks. (arXiv:1606.07384v1 [cs.DS])
We investigate the problem of learning Bayesian networks in an agnostic model where an $\epsilon$-fraction of the samples are adversarially corrupted. Our agnostic learning model is similar to -- in fact, stronger than -- Huber's contamination model in robust statistics. In this work, we study the fully observable Bernoulli case where the structure of the network is given. Even in this basic setting, previous learning algorithms either run in exponential time or lose dimension-dependent factors in their error guarantees. We provide the first computationally efficient agnostic learning algorithm for this problem with dimension-independent error guarantees. Our algorithm has polynomial sample complexity, runs in polynomial time, and achieves error that scales nearly-linearly with the fraction of adversarially corrupted samples.
from cs.AI updates on arXiv.org http://ift.tt/28Qf8Z6
via IFTTT
Learning to Poke by Poking: Experiential Learning of Intuitive Physics. (arXiv:1606.07419v1 [cs.CV])
We investigate an experiential learning paradigm for acquiring an internal model of intuitive physics. Our model is evaluated on a real-world robotic manipulation task that requires displacing objects to target locations by poking. The robot gathered over 400 hours of experience by executing more than 50K pokes on different objects. We propose a novel approach based on deep neural networks for modeling the dynamics of robot's interactions directly from images, by jointly estimating forward and inverse models of dynamics. The inverse model objective provides supervision to construct informative visual features, which the forward model can then predict and in turn regularize the feature space for the inverse model. The interplay between these two objectives creates useful, accurate models that can then be used for multi-step decision making. This formulation has the additional benefit that it is possible to learn forward models in an abstract feature space and thus alleviate the need of predicting pixels. Our experiments show that this joint modeling approach outperforms alternative methods. We also demonstrate that active data collection using the learned model further improves performance.
from cs.AI updates on arXiv.org http://ift.tt/291kNxf
via IFTTT
Multimodal Compact Bilinear Pooling for Visual Question Answering and Visual Grounding. (arXiv:1606.01847v2 [cs.CV] UPDATED)
Modeling textual or visual information with vector representations trained from large language or visual datasets has been successfully explored in recent years. However, tasks such as visual question answering require combining these vector representations with each other. Approaches to multimodal pooling include element-wise multiplication or addition, as well as concatenation of the visual and textual representations. We hypothesize that these methods are not as expressive as an outer product of the visual and textual vectors. As the outer product is typically infeasible due to its high dimensionality, we instead propose utilizing Multimodal Compact Bilinear pooling (MCB) to efficiently and expressively combine multimodal features. We extensively evaluate MCB on the visual question answering and grounding tasks. We consistently show the benefit of MCB over ablations without MCB. For visual question answering, we present an architecture which uses MCB twice, once for predicting attention over spatial features and again to combine the attended representation with the question representation. This model outperforms the state-of-the-art on the Visual7W dataset and the VQA challenge.
from cs.AI updates on arXiv.org http://ift.tt/1PC8QRB
via IFTTT
Preliminaries of a Space Situational Awareness Ontology. (arXiv:1606.01924v2 [cs.AI] UPDATED)
Space situational awareness (SSA) is vital for international safety and security, and the future of space travel. By improving SSA data-sharing we improve global SSA. Computational ontology may provide one means toward that goal. This paper develops the ontology of the SSA domain and takes steps in the creation of the space situational awareness ontology. Ontology objectives, requirements and desiderata are outlined; and both the SSA domain and the discipline of ontology are described. The purposes of the ontology include: exploring the potential for ontology development and engineering to (i) represent SSA data, general domain knowledge, objects and relationships (ii) annotate and express the meaning of that data, and (iii) foster SSA data-exchange and integration among SSA actors, orbital debris databases, space object catalogs and other SSA data repositories. By improving SSA via data- and knowledge-sharing, we can (iv) expand our scientific knowledge of the space environment, (v) advance our capacity for planetary defense from near-Earth objects, and (vi) ensure the future of safe space flight for generations to come.
from cs.AI updates on arXiv.org http://ift.tt/1PFIOgb
via IFTTT
Theoretical Robopsychology: Samu Has Learned Turing Machines. (arXiv:1606.02767v2 [cs.AI] UPDATED)
From the point of view of a programmer, the robopsychology is a synonym for the activity is done by developers to implement their machine learning applications. This robopsychological approach raises some fundamental theoretical questions of machine learning. Our discussion of these questions is constrained to Turing machines. Alan Turing had given an algorithm (aka the Turing Machine) to describe algorithms. If it has been applied to describe itself then this brings us to Turing's notion of the universal machine. In the present paper, we investigate algorithms to write algorithms. From a pedagogy point of view, this way of writing programs can be considered as a combination of learning by listening and learning by doing due to it is based on applying agent technology and machine learning. As the main result we introduce the problem of learning and then we show that it cannot easily be handled in reality therefore it is reasonable to use machine learning algorithm for learning Turing machines.
from cs.AI updates on arXiv.org http://ift.tt/1tlzaWs
via IFTTT
Anonymous Crime Reports Top 10000 in Japan in FY 2015
Anonymous Crime Reports Top 10,000 in Japan in FY 2015. Tokyo, June 23 (Jiji Press)--The number of crime-related reports made by citizens ...
from Google Alert - anonymous http://ift.tt/291hSon
via IFTTT
from Google Alert - anonymous http://ift.tt/291hSon
via IFTTT
PLATT: Anonymous complaint leads Calgary to tell girls to take down tree swing
PLATT: Anonymous complaint leads Calgary to tell girls to take down tree swing. Gracie, left, and Reilly McMillan hang out on the tree swing in front of ...
from Google Alert - anonymous http://ift.tt/28QAKbg
via IFTTT
from Google Alert - anonymous http://ift.tt/28QAKbg
via IFTTT
[FD] [KIS-2016-07] SugarCRM <= 6.5.23 (SugarRestSerialize.php) PHP Object Injection Vulnerability
--------------------------------------------------------------------------
Source: Gmail -> IFTTT-> Blogger
Source: Gmail -> IFTTT-> Blogger
[FD] [KIS-2016-06] SugarCRM <= 6.5.18 (MySugar::addDashlet) Insecure fopen() Usage Vulnerability
-------------------------------------------------------------------------
Source: Gmail -> IFTTT-> Blogger
Source: Gmail -> IFTTT-> Blogger
[FD] [KIS-2016-05] SugarCRM <= 6.5.18 Two PHP Code Injection Vulnerabilities
-----------------------------------------------------
Source: Gmail -> IFTTT-> Blogger
Source: Gmail -> IFTTT-> Blogger
[FD] [KIS-2016-04] SugarCRM <= 6.5.18 Missing Authorization Check Vulnerabilities
----------------------------------------------------------
Source: Gmail -> IFTTT-> Blogger
Source: Gmail -> IFTTT-> Blogger
Rumor Central: Orioles looking to add left-handed starter, have interest in Padres' Drew Pomeranz - MLB.com (ESPN)
from ESPN http://ift.tt/1eW1vUH
via IFTTT
via IFTTT
STOP Rule 41 — FBI should not get Legal Power to Hack Computers Worldwide
We have been hearing a lot about Rule 41 after the US Department of Justice has pushed an update to the rule. The change to the Rule 41 of the Federal Rules of Criminal Procedure grants the FBI much greater powers to hack legally into any computer across the country, and perhaps anywhere in the world, with just a single search warrant authorized by any US judge. However, both civil liberties
from The Hacker News http://ift.tt/28QYEm4
via IFTTT
from The Hacker News http://ift.tt/28QYEm4
via IFTTT
Ravens Video: After Steve Smith breaks huddle with \"Go Ravens!\" at his football camp, young fan shouts \"Go Patriots!\" (ESPN)
from ESPN http://ift.tt/17lH5T2
via IFTTT
via IFTTT
I have a new follower on Twitter
Nicholas Sciberras
Acunetix Product Manager
Malta
http://t.co/NhiwkP5pTO
Following: 2266 - Followers: 278
June 23, 2016 at 09:29AM via Twitter http://twitter.com/nicksciberras
ISS Daily Summary Report – 06/22/16
Cygnus Re-entry: Cygnus re-entry burn was completed today at 7:45 AM CDT following unberth last Tuesday, June 14. The NRCSD-E deployment planned for yesterday succeeded in deploying four of five LEMUR satellites. Several additional attempts were made to deploy the final satellite, but were not successful. Orbital-ATK has confirmed via imagery that the deployer’s doors did not open. Prior to unberth, the ReEntry Breakup Recorder- Wireless (REBR-W) was configured to activate upon sensing deorbit loads and transmit data automatically. The REBR team has not received data as expectedas of the writing of this report. REBR is a cost-effective system that rides a re-entering space vehicle, records data during the re-entry and breakup of the vehicle, and returns the data for analysis. Understanding how vehicles behave during atmospheric reentry gives future spacecraft developers unique information that can enhance design efficiencies and safety. 62P Thruster Test: Russian ground teams performed a thruster test on 62P. However, only the X axis thrusters fired, the Z and Y axis thrusters did not. Ground teams are investigating, and a re-test of the thrusters is expected on June 27. Following the 62P thruster test, Moscow experienced issues reintegrating the Progress into the control loop. The maneuver back to the Torque Equalibrium Attitude (TEA) was subsequently performed using thruster configuration SM411. Thruster configuration will remain SM411 until Moscow has a forward plan for reintegrating the Nadir Progress. In the meantime, a 62P prop purge is planned for tomorrow. Dose Tracker: The crew completed entries for medication tracking on an iPad today. This investigation documents the medication usage of crew members before and during their missions by capturing data regarding medication use during spaceflight, including side effect qualities, frequencies and severities. The data is expected to either support or counter anecdotal evidence of medication ineffectiveness during flight and unusual side effects experienced during flight. It is also expected that specific, near-real-time questioning about symptom relief and side effects will provide the data required to establish whether spaceflight-associated alterations in pharmacokinetics (PK) or pharmacodynamics (PD) is occurring during missions. Habitability Human Factors Directed Observations: The crew recorded and submitted a walk-through video documenting observations of an area or activity providing insight related to human factors and habitability. The Habitability investigation collects observations about the relationship between crew members and their environment on the International Space Station. Observations can help spacecraft designers understand how much habitable volume is required and whether a mission’s duration impacts how much space crew members need. Extravehicular Mobility Unit (EMU) Maintenance: The crew spent most of his day performing the following activities to dump and fill EMU 3005, 3008 feedwater tanks to satisfy maintenance requirements for on-orbit stowage. Due to previous EMU off-nominal conditions, steps were included for trend tracking: Obtain a feedwater sample from EMU 3005 water tanks for future ground analysis. Initiate ionic and particulate filtration of the EMU and Airlock cooling water loops. Iodinate EMU Ion Filters and complete a 2-hour EMU iodination. Obtain a 250 mL sample of EMU cooling loop water to determine the effectiveness of the Ion Filter in scrubbing EMU and Airlock cooling water. 10 mL of the water sample will be used for a conductivity test. The remainder of the water will be returned to ground for chemical analysis. Determine a conductivity measurement for EMU water samples. Each sample will be measured once and two readings will be recorded from the Liquid Conductivity Meter display. Regenerate Metal Oxide (Metox) canisters by baking out CO2 in the Metox Regenerator oven. Station Support Computer (SSC) service pack installation: Ground controllers installed a new service pack on the SSCs onboard ISS. Node 3 MCA anomaly: This morning, Node 3 MCA experienced an ion pump current spike and shut down. A system restart recovered the MCA functionality. Today’s Planned Activities All activities were completed unless otherwise noted. SPLANH. Preparation and Initiate EGEG Recording r/g 2607 JSL Password Update On MCC Go SM Rodnik H2O Tank 1 shell compression / r/g 2614 DOSETRK Questionnaire Completion Closing window 6,8,9,12,13,14 shutters / r/g 6965 Closing USOS Window Shutters Soyuz 720 Samsung Tablet Recharge, initiate HABIT Video of the Experiment SM, DC1, MRM2 [СОТР] КОБ1, КОБ2 loops Coolant Refill using refill set, Locating Equipment and R/G Review r/g 2615 WRS Water Sample Analysis Extravehicular Mobility Unit (EMU) Full Water Tank Dump and Fill MATRYOSHKA-R. FGB Bag Inventory Audit, Photography r/g 2613 EMU Feedwater Sample СОЖ Maintenance Soyuz 720 Samsung tablet charge, end EMU Cooling Loop Maintenance, Initiate SPLANH. Termination of EGEG recording and Closeout Ops0 r/g 2607 COSMOCARD. Closeout Ops / r/g 2600 Initiate EMU Cooling Loop Scrub Part 1 SPLANH. Preparation for Experiment / r/g 2608 Start EMU cooling loop scrub Greetings Video Footage / r/g 2609, 2610 EMU Conductivity Test Vacuum cleaning ventilation grille on FGB interior panels (201, 301, 401) On MCC Go Urine transfer from EDV-U to Progress 432 Rodnik H2O Tank 2 / r/g 2616 TOCA Data Recording Countermeasures System (CMS) Sprint Exercise, Optional Manometer (ВК-316М) efficiency check and On MCC Go Progress 431 (DC1) H2O Tank 2 pressure monitoring / r/g 2618 EMU Cooling Loop Maintenance, Reconfiguration INTERACTION-2. Experiment Ops / r/g 2611 Start EMU METOX Regeneration INTERACTION-2. Experiment Ops / r/g 2612 Stow Syringes used in Н2О Conductivity Test Completed Task List Items iPAD cert update [Active] Ground Activities All activities were completed unless otherwise noted. EMU ops support Nominal ground commanding Three-Day Look Ahead: Thursday, 06/23: Habitability, Microchannel Diffusion plate changeout Friday, 06/24: JEMAL pressurization, leak check, PBRE hardware stow Saturday, 06/25: Crew off duty QUICK ISS Status – Environmental Control Group: Component Status Elektron On Vozdukh Manual [СКВ] 1 – SM Air Conditioner System (“SKV1”) On [СКВ] 2 – SM Air Conditioner System (“SKV2”) Off Carbon Dioxide Removal Assembly (CDRA) Lab Standby Carbon Dioxide Removal Assembly (CDRA) Node 3 Operate Major Constituent Analyzer (MCA) Lab Idle Major Constituent Analyzer (MCA) Node 3 Operate Oxygen Generation Assembly (OGA) Process Urine Processing Assembly (UPA) Standby Trace Contaminant Control System (TCCS) Lab Off Trace Contaminant Control System […]
from ISS On-Orbit Status Report http://ift.tt/28SP2IH
via IFTTT
from ISS On-Orbit Status Report http://ift.tt/28SP2IH
via IFTTT
Anonymous user 471753
Name, Anonymous user 471753. User since, June 8, 2016. Number of add-ons developed, 0 add-ons. Average rating of developer's add-ons, Not yet ...
from Google Alert - anonymous http://ift.tt/28Pf3aB
via IFTTT
from Google Alert - anonymous http://ift.tt/28Pf3aB
via IFTTT
Cirrus over Paris
What's that over Paris? Cirrus. Typically, cirrus clouds appear white or gray when reflecting sunlight, can appear dark at sunset (or sunrise) against a better lit sky. Cirrus are among the highest types of clouds and are usually thin enough to see stars through. Cirrus clouds may form from moisture released above storm clouds and so may herald the arrival of a significant change in weather. Conversely, cirrus clouds have also been seen on Mars, Jupiter, Saturn, Titan, Uranus, and Neptune. The featured image was taken two days ago from a window in District 15, Paris, France, Earth. The brightly lit object on the lower right is, of course, the Eiffel Tower. via NASA http://ift.tt/28TrH7T
Wednesday, June 22, 2016
Drug Dealers Anonymous
Pusha T / Drug Dealers Anonymous. Start free trial Log in · What's New · TIDAL Rising · Playlists · Genres · Music Videos · Movies & Shows · My Music.
from Google Alert - anonymous http://ift.tt/28OYADj
via IFTTT
from Google Alert - anonymous http://ift.tt/28OYADj
via IFTTT
Orioles Video: Ryan Flaherty homers to kick off a 3-run 5th inning in 7-2 win over the Padres; split 2-game series (ESPN)
from ESPN http://ift.tt/1eW1vUH
via IFTTT
via IFTTT
\'Etude de Probl\`emes d'Optimisation Combinatoire \`a Multiples Composantes Interd\'ependantes. (arXiv:1606.06797v1 [cs.AI])
This extended abstract presents an overview on NP-hard optimization problems with multiple interdependent components. These problems occur in many real-world applications: industrial applications, engineering, and logistics. The fact that these problems are composed of many sub-problems that are NP-hard makes them even more challenging to solve using exact algorithms. This is mainly due to the high complexity of this class of algorithms and the hardness of the problems themselves. The main source of difficulty of these problems is the presence of internal dependencies between sub-problems. This aspect of interdependence of components is presented, and some outlines on solving approaches are briefly introduced from a (meta)heuristics and evolutionary computation perspective.
from cs.AI updates on arXiv.org http://ift.tt/28VRL2b
via IFTTT
Structure in the Value Function of Two-Player Zero-Sum Games of Incomplete Information. (arXiv:1606.06888v1 [cs.AI])
Zero-sum stochastic games provide a rich model for competitive decision making. However, under general forms of state uncertainty as considered in the Partially Observable Stochastic Game (POSG), such decision making problems are still not very well understood. This paper makes a contribution to the theory of zero-sum POSGs by characterizing structure in their value function. In particular, we introduce a new formulation of the value function for zs-POSGs as a function of the "plan-time sufficient statistics" (roughly speaking the information distribution in the POSG), which has the potential to enable generalization over such information distributions. We further delineate this generalization capability by proving a structural result on the shape of value function: it exhibits concavity and convexity with respect to appropriately chosen marginals of the statistic space. This result is a key pre-cursor for developing solution methods that may be able to exploit such structure. Finally, we show how these results allow us to reduce a zs-POSG to a "centralized" model with shared observations, thereby transferring results for the latter, narrower class, to games with individual (private) observations.
from cs.AI updates on arXiv.org http://ift.tt/28QLRTJ
via IFTTT
Inferring Logical Forms From Denotations. (arXiv:1606.06900v1 [cs.CL])
A core problem in learning semantic parsers from denotations is picking out consistent logical forms--those that yield the correct denotation--from a combinatorially large space. To control the search space, previous work relied on restricted set of rules, which limits expressivity. In this paper, we consider a much more expressive class of logical forms, and show how to use dynamic programming to efficiently represent the complete set of consistent logical forms. Expressivity also introduces many more spurious logical forms which are consistent with the correct denotation but do not represent the meaning of the utterance. To address this, we generate fictitious worlds and use crowdsourced denotations on these worlds to filter out spurious logical forms. On the WikiTableQuestions dataset, we increase the coverage of answerable questions from 53.5% to 76%, and the additional crowdsourced supervision lets us rule out 92.1% of spurious logical forms.
from cs.AI updates on arXiv.org http://ift.tt/28OjH9R
via IFTTT
Simultaneous Control and Human Feedback in the Training of a Robotic Agent with Actor-Critic Reinforcement Learning. (arXiv:1606.06979v1 [cs.HC])
This paper contributes a preliminary report on the advantages and disadvantages of incorporating simultaneous human control and feedback signals in the training of a reinforcement learning robotic agent. While robotic human-machine interfaces have become increasingly complex in both form and function, control remains challenging for users. This has resulted in an increasing gap between user control approaches and the number of robotic motors which can be controlled. One way to address this gap is to shift some autonomy to the robot. Semi-autonomous actions of the robotic agent can then be shaped by human feedback, simplifying user control. Most prior work on agent shaping by humans has incorporated training with feedback, or has included indirect control signals. By contrast, in this paper we explore how a human can provide concurrent feedback signals and real-time myoelectric control signals to train a robot's actor-critic reinforcement learning control system. Using both a physical and a simulated robotic system, we compare training performance on a simple movement task when reward is derived from the environment, when reward is provided by the human, and combinations of these two approaches. Our results indicate that some benefit can be gained with the inclusion of human generated feedback.
from cs.AI updates on arXiv.org http://ift.tt/28VRMmI
via IFTTT
Efficient Attack Graph Analysis through Approximate Inference. (arXiv:1606.07025v1 [cs.CR])
Attack graphs provide compact representations of the attack paths that an attacker can follow to compromise network resources by analysing network vulnerabilities and topology. These representations are a powerful tool for security risk assessment. Bayesian inference on attack graphs enables the estimation of the risk of compromise to the system's components given their vulnerabilities and interconnections, and accounts for multi-step attacks spreading through the system. Whilst static analysis considers the risk posture at rest, dynamic analysis also accounts for evidence of compromise, e.g. from SIEM software or forensic investigation. However, in this context, exact Bayesian inference techniques do not scale well. In this paper we show how Loopy Belief Propagation - an approximate inference technique - can be applied to attack graphs, and that it scales linearly in the number of nodes for both static and dynamic analysis, making such analyses viable for larger networks. We experiment with different topologies and network clustering on synthetic Bayesian attack graphs with thousands of nodes to show that the algorithm's accuracy is acceptable and converge to a stable solution. We compare sequential and parallel versions of Loopy Belief Propagation with exact inference techniques for both static and dynamic analysis, showing the advantages of approximate inference techniques to scale to larger attack graphs.
from cs.AI updates on arXiv.org http://ift.tt/28NPrZb
via IFTTT
Ancestral Causal Inference. (arXiv:1606.07035v1 [cs.LG])
Constraint-based causal discovery from limited data is a notoriously difficult challenge due to the many borderline independence test decisions. Several approaches to improve the reliability of the predictions by exploiting redundancy in the independence information have been proposed recently. Though promising, existing approaches can still be greatly improved in terms of accuracy and scalability. We present a novel method that reduces the combinatorial explosion of the search space by using a more coarse-grained representation of causal information, drastically reducing computation time. Additionally, we propose a method to score causal predictions based on their confidence. Crucially, our implementation also allows one to easily combine observational and interventional data and to incorporate various types of available background knowledge. We prove soundness and asymptotic consistency of our method and demonstrate that it can outperform the state-of-the-art on synthetic data, achieving a speedup of several orders of magnitude. We illustrate its practical feasibility by applying it on a challenging protein data set.
from cs.AI updates on arXiv.org http://ift.tt/28RsdVY
via IFTTT
Emulating Human Conversations using Convolutional Neural Network-based IR. (arXiv:1606.07056v1 [cs.AI])
Conversational agents ("bots") are beginning to be widely used in conversational interfaces. To design a system that is capable of emulating human-like interactions, a conversational layer that can serve as a fabric for chat-like interaction with the agent is needed. In this paper, we introduce a model that employs Information Retrieval by utilizing convolutional deep structured semantic neural network-based features in the ranker to present human-like responses in ongoing conversation with a user. In conversations, accounting for context is critical to the retrieval model; we show that our context-sensitive approach using a Convolutional Deep Structured Semantic Model (cDSSM) with character trigrams significantly outperforms several conventional baselines in terms of the relevance of responses retrieved.
from cs.AI updates on arXiv.org http://ift.tt/28VRCeY
via IFTTT
Variable Elimination in the Fourier Domain. (arXiv:1508.04032v2 [cs.AI] UPDATED)
The ability to represent complex high dimensional probability distributions in a compact form is one of the key insights in the field of graphical models. Factored representations are ubiquitous in machine learning and lead to major computational advantages. We explore a different type of compact representation based on discrete Fourier representations, complementing the classical approach based on conditional independencies. We show that a large class of probabilistic graphical models have a compact Fourier representation. This theoretical result opens up an entirely new way of approximating a probability distribution. We demonstrate the significance of this approach by applying it to the variable elimination algorithm. Compared with the traditional bucket representation and other approximate inference algorithms, we obtain significant improvements.
from cs.AI updates on arXiv.org http://ift.tt/1LhIOzJ
via IFTTT
A Signaling Game Approach to Databases Querying and Interaction. (arXiv:1603.04068v2 [cs.DB] UPDATED)
As most database users cannot precisely express their information needs, it is challenging for database management systems to understand them. We propose a novel formal framework for representing and understanding information needs in database querying and exploration. Our framework considers querying as a collaboration between the user and the database management system to establish a it mutual language for representing information needs. We formalize this collaboration as a signaling game, where each mutual language is an equilibrium for the game. A query interface is more effective if it establishes a less ambiguous mutual language faster. We discuss some equilibria, strategies, and the convergence in this game. In particular, we propose a reinforcement learning mechanism and analyze it within our framework. We prove that this adaptation mechanism for the query interface improves the effectiveness of answering queries stochastically speaking, and converges almost surely. We extend out results for the cases that the user also modifies her strategy during the interaction.
from cs.AI updates on arXiv.org http://ift.tt/1V7T2WW
via IFTTT
Active Algorithms For Preference Learning Problems with Multiple Populations. (arXiv:1603.04118v2 [stat.ML] UPDATED)
In this paper we model the problem of learning preferences of a population as an active learning problem. We propose an algorithm can adaptively choose pairs of items to show to users coming from a heterogeneous population, and use the obtained reward to decide which pair of items to show next. We provide computationally efficient algorithms with provable sample complexity guarantees for this problem in both the noiseless and noisy cases. In the process of establishing sample complexity guarantees for our algorithms, we establish new results using a Nystr{\"o}m-like method which can be of independent interest. We supplement our theoretical results with experimental comparisons.
from cs.AI updates on arXiv.org http://ift.tt/1UcmJGB
via IFTTT
Gearbox Fault Detection through PSO Exact Wavelet Analysis and SVM Classifier. (arXiv:1605.04874v1 [cs.LG] CROSS LISTED)
Time-frequency methods for vibration-based gearbox faults detection have been considered the most efficient method. Among these methods, continuous wavelet transform (CWT) as one of the best time-frequency method has been used for both stationary and transitory signals. Some deficiencies of CWT are problem of overlapping and distortion ofsignals. In this condition, a large amount of redundant information exists so that it may cause false alarm or misinterpretation of the operator. In this paper a modified method called Exact Wavelet Analysis is used to minimize the effects of overlapping and distortion in case of gearbox faults. To implement exact wavelet analysis, Particle Swarm Optimization (PSO) algorithm has been used for this purpose. This method have been implemented for the acceleration signals from 2D acceleration sensor acquired by Advantech PCI-1710 card from a gearbox test setup in Amirkabir University of Technology. Gearbox has been considered in both healthy and chipped tooth gears conditions. Kernelized Support Vector Machine (SVM) with radial basis functions has used the extracted features from exact wavelet analysis for classification. The efficiency of this classifier is then evaluated with the other signals acquired from the setup test. The results show that in comparison of CWT, PSO Exact Wavelet Transform has better ability in feature extraction in price of more computational effort. In addition, PSO exact wavelet has better speed comparing to Genetic Algorithm (GA) exact wavelet in condition of equal population because of factoring mutation and crossover in PSO algorithm. SVM classifier with the extracted features in gearbox shows very good results and its ability has been proved.
from cs.AI updates on arXiv.org http://ift.tt/1TjlILV
via IFTTT
Orioles: Brian Duensing placed on the DL after injuring his elbow while sitting in a chair in the bullpen on Monday (ESPN)
from ESPN http://ift.tt/1eW1vUH
via IFTTT
via IFTTT
Tiffin University Announces Matching Gift Opportunity by Anonymous Donor
A generous and anonymous donor offered a dollar for dollar match of up to $4,000,000 in support of Tiffin University. Funds that are raised between ...
from Google Alert - anonymous http://ift.tt/28V6Hh3
via IFTTT
from Google Alert - anonymous http://ift.tt/28V6Hh3
via IFTTT
Anonymous donor gives $500000 to Vail Centre
EAGLE COUNTY — The Vail Centre recently announced it has received a $500,000 gift from an anonymous donor to support educational ...
from Google Alert - anonymous http://ift.tt/28QwwTc
via IFTTT
from Google Alert - anonymous http://ift.tt/28QwwTc
via IFTTT
Scandal, Maybe?
The hacktivist network Anonymous sent shockwaves around the internet this morning with its latest announcement, which in theory, could have ...
from Google Alert - anonymous http://ift.tt/28OrUZt
via IFTTT
from Google Alert - anonymous http://ift.tt/28OrUZt
via IFTTT
The Problem
The Problem. Many of us felt inadequate, unworthy, alone, and afraid. Our insides never matched what we saw on the outsides of others. Early on, we ...
from Google Alert - anonymous http://ift.tt/28QaiQV
via IFTTT
from Google Alert - anonymous http://ift.tt/28QaiQV
via IFTTT
Allow cart access for anonymous users
Proposed resolution Mark the "Access cart" permission for anonymous and registered users by default. Remaining tasks - Add the default permission.
from Google Alert - anonymous http://ift.tt/28N28Uj
via IFTTT
from Google Alert - anonymous http://ift.tt/28N28Uj
via IFTTT
ISS Daily Summary Report – 06/21/16
NanoRacks CubeSat Deployer- External (NRCSD-E) Operations: Following Cygnus unberth last week, today NRCSD-E conducted post departure satellite deployments prior to Cygnus re-entry tomorrow, June 22. This set of cubesats includes 3 deployment silos containing a total of 5 LEMUR satellites. Two out of three silos (four out of five satellites) were successfully deployed. The Orbital team downlinked and reviewed imagery to ascertain why one of the CubeSats did not deploy. Further troubleshooting is ongoing. The LEMUR satellites are equipped with payloads to provide two primary data products: AIS Data (Maritime Domain Awareness) and GPS-RO Data (Weather). NRCSD-E is a mechanical separation system for small U-class satellites designed specifically to interface with the Orbital-ATK Cygnus cargo resupply vehicle. It consists of an array of up to six individual 6U deployers contained within one mechanical housing that releases the CubeSats from Cygnus after it has completed its primary mission and departed the ISS. Multi-Omics Operations: The crew supported the Japan Aerospace Exploration Agency (JAXA) Multi-Omics investigation by collecting saliva samples and inserting them into the Minus Eighty-degree Freezer for ISS (MELFI). The investigation evaluates the impacts of space environment and prebiotics on astronauts’ immune function by combining the data obtained from the measurements of changes in the microbiological composition, metabolites profiles, and the immune system. Extravehicular Mobility Unit (EMU) Swap: In preparation for tomorrow’s loop scrub activities, the crew retrieved EMUs 3005 and 3008 from the Crewlock and temp stowed them. He then removed EMU 3010 from the forward EMU Don/Doff Assembly (EDDA) and installed EMU 3008. He removed EMU 3003 from the aft EDDA and installed EMU 3005. Microbial In-Flight Water Operations: The crew performed analysis of water samples collected earlier to determine water quality onboard the ISS. The focus was on microbial and coliform detection. On-Board Training (OBT) 46 Soyuz (46S) Emergency Drill: The crew completed an emergency egress drill for proficiency in the event of an ISS emergency requiring crew departure. The OBT is scheduled after 12-14 weeks aboard the ISS and once every two and one half months thereafter. Today’s Planned Activities All activities were completed unless otherwise noted. Multi Omics (MO) Saliva Sample Collection Biochemical Urine Test r/g 2583 Multi Omics (MO) MELFI Sample Insertion Multi Omics (MO) Equipment Stowage Biochemical Urine Test r/g 2583 Multi Omics (MO) Questionnaire Completion URISYS Hardware Stowage JEMRMS Activate and Start Bus Monitor JEMRMS RLT2 Laptop Activation JEMAL Slide Table (ST) Extension to JEF Side COSMOCARD. Closeout Ops / r/g 2579 Maintenance Closures of Vozdukh Valves Work Prep Verification of ИП-1 Flow Sensor Position URAGAN. Observation and photography using Photo Equipment / r/g 2598 WRS Recycle Tank Fill from EDV RELAKSATSIYAHardware Setup r/g 2599 EMU backpack replacement СОЖ Maintenance COSMOCARD. Preparing for and Starting 24-hr ECG Recording / r/g 2600 RELAKSATSIYA. Parameter Settings Adjustment r/g 2599 JEMAL Slide Table Retraction JEMRMS USB Memory Stick Virus Check RS Photo Cameras Sync Up to Station Time / r/g 1594 JEMRMS Deactivation of RLT2 Laptop RELAKSATSIYA. Observation r/g 2599 Countermeasures System (CMS) Sprint Exercise, Optional RELAKSATSIYA. Closeout Ops and Hardware Removal r/g 2599 URAGAN. Observation and photography using Photo Equipment / r/g 2598 Stopping JEMRMS Arm Bus Monitoring JEMRMS Data Transfer ISS Emergency Descent OBT r/g 2596 PAO Hardware Setup Crew Prep for PAO PAO Event SPLANH. Preparation for Experiment / r/g 2597 IMS Delta File Prep Habitability Walk-Through Video Reminder SPLANH. Diet Restrictions Reminder / r/g 2595 Completed Task List Items iPAD cert update [Active] Ground Activities All activities were completed unless otherwise noted. EMU ops support Nominal ground commanding Three-Day Look Ahead: Wednesday, 06/22: EMU 3005, 3008 water maintenance/loop scrub Thursday, 06/23: Habitability, Microchannel Diffusion plate changeout Friday, 06/24: JEMAL pressurization, leak check, PBRE hardware stow QUICK ISS Status – Environmental Control Group: Component Status Elektron On Vozdukh Manual [СКВ] 1 – SM Air Conditioner System (“SKV1”) Off [СКВ] 2 – SM Air Conditioner System (“SKV2”) On Carbon Dioxide Removal Assembly (CDRA) Lab Standby Carbon Dioxide Removal Assembly (CDRA) Node 3 Operate Major Constituent Analyzer (MCA) Lab Idle Major Constituent Analyzer (MCA) Node 3 Operate Oxygen Generation Assembly (OGA) Standby Urine Processing Assembly (UPA) Norm Trace Contaminant Control System (TCCS) Lab Off Trace Contaminant Control System (TCCS) Node 3 Full Up
from ISS On-Orbit Status Report http://ift.tt/28NDxmU
via IFTTT
from ISS On-Orbit Status Report http://ift.tt/28NDxmU
via IFTTT
Google makes 2-Factor Authentication a lot Easier and Faster
When it comes to data breaches of major online services like LinkedIn, MySpace, Twitter and VK.com, it's two-factor authentication that could save you from being hacked. Two-factor authentication or 2-step verification is an effective way to secure online accounts, but many users avoid enabling the feature just to save themselves from irritation of receiving and typing a six-digit code that
from The Hacker News http://ift.tt/28NkTbx
via IFTTT
from The Hacker News http://ift.tt/28NkTbx
via IFTTT
Donate to SA
Sexaholics Anonymous is entirely self-supporting. We do not accept donations from outside sources and ask that you contribute only if you are a ...
from Google Alert - anonymous http://ift.tt/28LN7ny
via IFTTT
from Google Alert - anonymous http://ift.tt/28LN7ny
via IFTTT
Anonymous 2.0
Add-ons for Mobile · Dictionaries & Language Packs · Search Tools · Developer Hub · Add-ons for Firefox · Themes; Anonymous 2.0. Anonymous 2.0.
from Google Alert - anonymous http://ift.tt/28NO2rO
via IFTTT
from Google Alert - anonymous http://ift.tt/28NO2rO
via IFTTT
Photo reveals even Zuckerberg tapes his Webcam and Microphone for Privacy
What do you do to protect your 'Privacy' and keep yourself safe from potential hackers? Well, Facebook CEO Mark Zuckerberg just need a bit of tape to cover his laptop webcam and mic jack in order to protect his privacy. Yes, Zuck also does the same as the FBI Director James Comey. <!-- adsense --> Zuckerberg posted a photo on Tuesday to celebrate Instagram's 500 Million monthly user
from The Hacker News http://ift.tt/28LCNfs
via IFTTT
from The Hacker News http://ift.tt/28LCNfs
via IFTTT
Anonymous "Thank You" Delivery to a Kind Clerk
Anonymous Thank You Delivery to a Kind Clerk I would like a PLEASANT HAPPY person to deliver a small Balloon Bouquet and Thank You Card to a ...
from Google Alert - anonymous http://ift.tt/28OKJOK
via IFTTT
from Google Alert - anonymous http://ift.tt/28OKJOK
via IFTTT
NGC 6814: Grand Design Spiral Galaxy from Hubble
In the center of this serene stellar swirl is likely a harrowing black-hole beast. The surrounding swirl sweeps around billions of stars which are highlighted by the brightest and bluest. The breadth and beauty of the display give the swirl the designation of a grand design spiral galaxy. The central beast shows evidence that it is a supermassive black hole about 10 million times the mass of our Sun. This ferocious creature devours stars and gas and is surrounded by a spinning moat of hot plasma that emits blasts of X-rays. The central violent activity gives it the designation of a Seyfert galaxy. Together, this beauty and beast are cataloged as NGC 6814 and have been appearing together toward the constellation of the Eagle (Aquila) for roughly the past billion years. via NASA http://ift.tt/28QSdzN
Tuesday, June 21, 2016
I have a new follower on Twitter
BodminAgents
Private investigators based in Cornwall covering whole of SW UK. Call 01208 590955. Email ask@bodminagents.co.uk
https://t.co/ud4Pc0c3Ff
Following: 828 - Followers: 1109
June 21, 2016 at 10:54PM via Twitter http://twitter.com/bodminagents
A Hierarchical Reinforcement Learning Method for Persistent Time-Sensitive Tasks. (arXiv:1606.06355v1 [cs.AI])
Reinforcement learning has been applied to many interesting problems such as the famous TD-gammon and the inverted helicopter flight. However, little effort has been put into developing methods to learn policies for complex persistent tasks and tasks that are time-sensitive. In this paper, we take a step towards solving this problem by using signal temporal logic (STL) as task specification, and taking advantage of the temporal abstraction feature that the options framework provide. We show via simulation that a relatively easy to implement algorithm that combines STL and options can learn a satisfactory policy with a small number of training cases
from cs.AI updates on arXiv.org http://ift.tt/28Rord6
via IFTTT
Complex Embeddings for Simple Link Prediction. (arXiv:1606.06357v1 [cs.AI])
In statistical relational learning, the link prediction problem is key to automatically understand the structure of large knowledge bases. As in previous studies, we propose to solve this problem through latent factorization. However, here we make use of complex valued embeddings. The composition of complex embeddings can handle a large variety of binary relations, among them symmetric and antisymmetric relations. Compared to state-of-the-art models such as Neural Tensor Network and Holographic Embeddings, our approach based on complex embeddings is arguably simpler, as it only uses the Hermitian dot product, the complex counterpart of the standard dot product between real vectors. Our approach is scalable to large datasets as it remains linear in both space and time, while consistently outperforming alternative approaches on standard link prediction benchmarks.
from cs.AI updates on arXiv.org http://ift.tt/28RoeXb
via IFTTT
Unanimous Prediction for 100% Precision with Application to Learning Semantic Mappings. (arXiv:1606.06368v1 [cs.LG])
Can we train a system that, on any new input, either says "don't know" or makes a prediction that is guaranteed to be correct? We answer the question in the affirmative provided our model family is well-specified. Specifically, we introduce the unanimity principle: only predict when all models consistent with the training data predict the same output. We operationalize this principle for semantic parsing, the task of mapping utterances to logical forms. We develop a simple, efficient method that reasons over the infinite set of all consistent models by only checking two of the models. We prove that our method obtains 100% precision even with a modest amount of training data from a possibly adversarial distribution. Empirically, we demonstrate the effectiveness of our approach on the standard GeoQuery dataset.
from cs.AI updates on arXiv.org http://ift.tt/28Mf6qf
via IFTTT
The Schema Editor of OpenIoT for Semantic Sensor Networks. (arXiv:1606.06434v1 [cs.AI])
Ontologies provide conceptual abstractions over data, in domains such as the Internet of Things, in a way that sensor data can be harvested and interpreted by people and applications. The Semantic Sensor Network (SSN) ontology is the de-facto standard for semantic representation of sensor observations and metadata, and it is used at the core of the open source platform for the Internet of Things, OpenIoT. In this paper we present a Schema Editor that provides an intuitive web interface for defining new types of sensors, and concrete instances of them, using the SSN ontology as the core model. This editor is fully integrated with the OpenIoT platform for generating virtual sensor descriptions and automating their semantic annotation and registration process.
from cs.AI updates on arXiv.org http://ift.tt/28RortE
via IFTTT
Neighborhood Mixture Model for Knowledge Base Completion. (arXiv:1606.06461v1 [cs.CL])
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
Graphical Models for Optimal Power Flow. (arXiv:1606.06512v1 [cs.SY])
Optimal power flow (OPF) is the central optimization problem in electric power grids. Although solved routinely in the course of power grid operations, it is known to be strongly NP-hard in general, and weakly NP-hard over tree networks. In this paper, we formulate the optimal power flow problem over tree networks as an inference problem over a tree-structured graphical model where the nodal variables are low-dimensional vectors. We adapt the standard dynamic programming algorithm for inference over a tree-structured graphical model to the OPF problem. Combining this with an interval discretization of the nodal variables, we develop an approximation algorithm for the OPF problem. Further, we use techniques from constraint programming (CP) to perform interval computations and adaptive bound propagation to obtain practically efficient algorithms. Compared to previous algorithms that solve OPF with optimality guarantees using convex relaxations, our approach is able to work for arbitrary distribution networks and handle mixed-integer optimization problems. Further, it can be implemented in a distributed message-passing fashion that is scalable and is suitable for "smart grid" applications like control of distributed energy resources. We evaluate our technique numerically on several benchmark networks and show that practical OPF problems can be solved effectively using this approach.
from cs.AI updates on arXiv.org http://ift.tt/28RorKg
via IFTTT
Concrete Problems in AI Safety. (arXiv:1606.06565v1 [cs.AI])
Rapid progress in machine learning and artificial intelligence (AI) has brought increasing attention to the potential impacts of AI technologies on society. In this paper we discuss one such potential impact: the problem of accidents in machine learning systems, defined as unintended and harmful behavior that may emerge from poor design of real-world AI systems. We present a list of five practical research problems related to accident risk, categorized according to whether the problem originates from having the wrong objective function ("avoiding side effects" and "avoiding reward hacking"), an objective function that is too expensive to evaluate frequently ("scalable supervision"), or undesirable behavior during the learning process ("safe exploration" and "distributional shift"). We review previous work in these areas as well as suggesting research directions with a focus on relevance to cutting-edge AI systems. Finally, we consider the high-level question of how to think most productively about the safety of forward-looking applications of AI.
from cs.AI updates on arXiv.org http://ift.tt/28Mf7up
via IFTTT
An empirical study on large scale text classification with skip-gram embeddings. (arXiv:1606.06623v1 [cs.CL])
We investigate the integration of word embeddings as classification features in the setting of large scale text classification. Such representations have been used in a plethora of tasks, however their application in classification scenarios with thousands of classes has not been extensively researched, partially due to hardware limitations. In this work, we examine efficient composition functions to obtain document-level from word-level embeddings and we subsequently investigate their combination with the traditional one-hot-encoding representations. By presenting empirical evidence on large, multi-class, multi-label classification problems, we demonstrate the efficiency and the performance benefits of this combination.
from cs.AI updates on arXiv.org http://ift.tt/28RosOg
via IFTTT
A Survey of Signed Network Mining in Social Media. (arXiv:1511.07569v3 [cs.SI] UPDATED)
Many real-world relations can be represented by signed networks with positive and negative links, as a result of which signed network analysis has attracted increasing attention from multiple disciplines. With the increasing prevalence of social media networks, signed network analysis has evolved from developing and measuring theories to mining tasks. In this article, we present a review of mining signed networks in the context of social media and discuss some promising research directions and new frontiers. We begin by giving basic concepts and unique properties and principles of signed networks. Then we classify and review tasks of signed network mining with representative algorithms. We also delineate some tasks that have not been extensively studied with formal definitions and also propose research directions to expand the field of signed network mining.
from cs.AI updates on arXiv.org http://ift.tt/1XdDmEo
via IFTTT
How deep is knowledge tracing?. (arXiv:1604.02416v2 [cs.AI] UPDATED)
In theoretical cognitive science, there is a tension between highly structured models whose parameters have a direct psychological interpretation and highly complex, general-purpose models whose parameters and representations are difficult to interpret. The former typically provide more insight into cognition but the latter often perform better. This tension has recently surfaced in the realm of educational data mining, where a deep learning approach to predicting students' performance as they work through a series of exercises---termed deep knowledge tracing or DKT---has demonstrated a stunning performance advantage over the mainstay of the field, Bayesian knowledge tracing or BKT. In this article, we attempt to understand the basis for DKT's advantage by considering the sources of statistical regularity in the data that DKT can leverage but which BKT cannot. We hypothesize four forms of regularity that BKT fails to exploit: recency effects, the contextualized trial sequence, inter-skill similarity, and individual variation in ability. We demonstrate that when BKT is extended to allow it more flexibility in modeling statistical regularities---using extensions previously proposed in the literature---BKT achieves a level of performance indistinguishable from that of DKT. We argue that while DKT is a powerful, useful, general-purpose framework for modeling student learning, its gains do not come from the discovery of novel representations---the fundamental advantage of deep learning. To answer the question posed in our title, knowledge tracing may be a domain that does not require `depth'; shallow models like BKT can perform just as well and offer us greater interpretability and explanatory power.
from cs.AI updates on arXiv.org http://ift.tt/1qI7HwJ
via IFTTT
How to advance general game playing artificial intelligence by player modelling. (arXiv:1606.00401v3 [cs.HC] UPDATED)
General game playing artificial intelligence has recently seen important advances due to the various techniques known as 'deep learning'. However the advances conceal equally important limitations in their reliance on: massive data sets; fortuitously constructed problems; and absence of any human-level complexity, including other human opponents. On the other hand, deep learning systems which do beat human champions, such as in Go, do not generalise well. The power of deep learning simultaneously exposes its weakness. Given that deep learning is mostly clever reconfigurations of well-established methods, moving beyond the state of art calls for forward-thinking visionary solutions, not just more of the same. I present the argument that general game playing artificial intelligence will require a generalised player model. This is because games are inherently human artefacts which therefore, as a class of problems, contain cases which require a human-style problem solving approach. I relate this argument to the performance of state of art general game playing agents. I then describe a concept for a formal category theoretic basis to a generalised player model. This formal model approach integrates my existing 'Behavlets' method for psychologically-derived player modelling:
Cowley, B., Charles, D. (2016). Behavlets: a Method for Practical Player Modelling using Psychology-Based Player Traits and Domain Specific Features. User Modeling and User-Adapted Interaction, 26(2), 257-306.
from cs.AI updates on arXiv.org http://ift.tt/1Ui3BCm
via IFTTT
Subscribe to:
Posts (Atom)