Select a calendar:
Filter May Events by Event Type:
SUNMONTUEWEDTHUFRISAT
Events for May 27, 2014
-
SAP TERP 10 Student Certification AcademyTue, May 27, 2014
Executive Education
Conferences, Lectures, & Seminars
Speaker: TBD,
Talk Title: SAP TERP 10 Student Certification Academy
Abstract: Course Number & Dates: Session 1 (SAP 0514-05):
Monday, May 19th - Saturday May 24th, 2014
Tuesday, May 27th - Thursday, May 29th, 2014
Certification Exam on Friday, May 30th, 2014(10 day course includes one Saturday class on May 24th)
The University of Southern California, being an active member of SAPââ¬â¢s Global University Alliances program since its inception in 1996, has been chosen to offer the TERP10 Academy to its students in early Summer 2014. The TERP10 Academy, and its certification, is a direct response to the global forecast of needed SAP skills in the market, estimated between 30,000 and 40,000, in the next several years. Students completing the TERP10 Academy and passing SAPââ¬â¢s certification exam will have the advantage of being equipped with a good understanding of business processes adopted by companies around the world. They will also get insights into best business practices and how SAP can be used to optimize business processes. Students will find that the TERP10 Certification will open internship opportunities as well as full time jobs with consulting firms such as Deloitte, Ernst and Young, KPMG, Hitachi, and other SAP partner companies.
Host: Professional Programs
More Info: http://gapp.usc.edu/professional-programs/short-courses/terp10#overview
Audiences: Registered Attendees
Contact: Viterbi Professional Programs
Event Link: http://gapp.usc.edu/professional-programs/short-courses/terp10#overview
-
PhD Defense - Ranjan Pal
Tue, May 27, 2014 @ 10:00 AM - 12:00 PM
Thomas Lord Department of Computer Science
University Calendar
Thesis Title: Improving Network Security Through Insurance: A Tale of Cyber-Insurance Markets
PhD Candidate: Ranjan Pal
Date: 27th May, 2014
Location: GFS 112
Time: 10am
Committee - Leana Golubchik (Chair), Konstantinos Psounis (Co-Chair), Minlan Yu, Viktor Prasanna (Outside Member)
Abstract:
In recent years, security researchers have well established the fact that technical security solutions alone will not result in a robust cyberspace due to several issues jointly related to the economics and technology of computer security. In this regard some of them proposed cyber-insurance as a suitable risk management technique that has the potential to jointly align with the various incentives of security vendors (e.g., Symantec, Microsoft, etc.), cyber-insurers (e.g., security vendors, ISPs, cloud providers, etc.), regulatory agencies (e.g., government), and network users (individuals and organizations), in turn paving the way for robust cyber-security. In this work, we theoretically investigate the following important question: can cyber-insurance really improve the security in a network? To answer our question we adopt a market-based approach. We analyze regulated monopolistic and competitive cyber-insurance markets in our work, where the market elements consist of risk-averse cyber-insurers, risk-averse network users, a regulatory agency, and security vendors (SVs). Our analysis proves that technical solutions will alone not result in optimal network security, and leads to two important results: (i) without contract discrimination amongst users, there always exists a unique market equilibrium for both market types, but the equilibrium is inefficient and does not improve network security, and (ii) in monopoly markets, contract discrimination amongst users results in a unique market equilibrium that is efficient and results in improvement of network security - however, the cyber-insurer can make zero expected profit. The latter fact is often sufficient to de-incentivize the formation or practical realization of successful and stable cyber-insurance markets.
To alleviate the insurerââ¬â¢s problem of potentially making zero profits, we suggest two mechanisms: (a) the SV could enter into a business relationship with the insurer and lock the latterââ¬â¢s clients in using security products manufactured by the SV. In return for the increased sale of its products, the SV could split the average profit per consumer with the insurer, and (b) the SV could itself be the insurer and account for logical/social network information of its clients to price them. In this regard, we study homogenous, heterogeneous, and binary pricing mechanisms designed via a common Stackelberg pricing game framework. The binary pricing game turns out to be NP-hard, for which we develop an efficient randomized approximation algorithm that achieves insurer profits up to 0.878 of the optimal solution. Our game analysis combined with simulation results on practical networking topologies illustrate increased maximum profits for the insurer (SV) at market equilibrium and always generate strictly positive profits for the latter, when compared to current SV pricing mechanisms in practice. In addition, the state of improved network security remains intact.
Location: Grace Ford Salvatori Hall Of Letters, Arts & Sciences (GFS) - 112
Audiences: Everyone Is Invited
Contact: Lizsl De Leon
-
Phd Defense - Shuai Hao
Tue, May 27, 2014 @ 01:00 PM - 03:00 PM
Thomas Lord Department of Computer Science
University Calendar
Title: Toward Understanding Mobile Apps at Scale
Ph.D Candidate: Shuai Hao
Time: 1:00pm
Date: May 27, 2014
Location: RTH 306
Committee:
Ramesh Govindan (Co-Chair)
William G.J. Halfond (Co-Chair)
Leana Golubchik
Sandeep Gupta (Outside Member)
The mobile app ecosystem has experienced tremendous growth in the last decade. This has triggered active research on dynamic analysis of energy, performance,and security properties of mobile apps. There is, however, a lack of tools that can accelerate and scale these studies to the size of an entire app marketplace. In this dissertation, we present three pieces of work that can help researchers and developers move toward this direction.
First, we present a new approach that can provide fine-grained estimates of mobile app energy consumption. We achieve this by using a novel combination of program analysis and per-instruction energy modeling. Our Android prototype, called eLens, shows that our approach is both accurate and lightweight. We believe that the development of energy efficient mobile apps will be accelerated with eLens.
Then, we introduce a framework, called SIF, for selective app instrumentation. SIF contains two high-level programming abstractions: codepoint sets and path sets. Additionally, SIF also provides users with overhead estimates for specified instrumentation tasks. By implementing a diverse set of tasks, we show that SIF abstractions are compact and precise and its overhead estimates are accurate. We expect the release of SIF can accelerate studies of the mobile app ecosystem.
Last, we focus on programming framework for dynamic analysis of mobile apps. This is motivated by the fact that existing research has largely developed analysis-specific UI automation techniques, where the logic for exploring app execution is intertwined with the logic for analyzing app properties. PUMA is a programmable framework that separates these two concerns. It contains a generic UI-Automation capability and exposes high-level events for which users can define handlers. We demonstrate the capabilities of PUMA by analyzing seven distinct performance, security, and correctness properties over 3,600 marketplace apps.
Location: Ronald Tutor Hall of Engineering (RTH) - 306
Audiences: Everyone Is Invited
Contact: Lizsl De Leon
-
AI Seminar- Frank Schweitzer: Modeling User Behavior In Online Social Networks
Tue, May 27, 2014 @ 03:00 PM - 04:00 PM
Information Sciences Institute
Conferences, Lectures, & Seminars
Speaker: Frank Schweitzer, Chair of Systems Design, ETH Zurich, Switzerland
Talk Title: Modeling User Behavior In Online Social Networks
Series: Artificial Intelligence Seminar
Abstract: Online communication can be seen as a large-scale social experiment
that constantly provides us with data about users' activities,
interactions and emotions. While their online behavior on the
``microôô level is largely governed by individual traits, we find on the ``macroôô level remarkable statistical regularities. These can be reproduced by means of agent-based models that allow us to understand how emotional influence and individual decisions create collective phenomena, such as collective emotions and drop-out cascades of users.
Biography: Home Page:
http://www.sg.ethz.ch/team/people/fschweitzer/
Host: Kristina Lerman
Webcast: http://webcasterms1.isi.edu/mediasite/Viewer/?peid=6103774e5c2c4eedb6dfc8d4f19ebe471dLocation: Information Science Institute (ISI) - 6th Flr Conf Rm # 689, Marina Del Rey
WebCast Link: http://webcasterms1.isi.edu/mediasite/Viewer/?peid=6103774e5c2c4eedb6dfc8d4f19ebe471d
Audiences: Everyone Is Invited
Contact: Peter Zamar
