Two talks by Dr Chathuranga Weeraddana

Tuesday, May 21, 2013 to Wednesday, May 22, 2013

 

INFOTECH LECTURE SERIES:

1st Talk

Title: On the application of optimization methods for secured multiparty computations
Lecturer: Dr. Chathuranga Weeraddana, Automatic Control Lab, KTH Royal Institute of Technology, Sweden
Date: Tuesday, May 21, 2013
Time: 14.00 - 15.00
Room: TS107

Abstract:
Ensuring privacy is essential in various contexts, such as healthcare data, banks, e-commerce, government services, and social networks. In these contexts, it is common that different parties coordinate to solve a specific problem whose problem data is dispersed among the involved entities and that no entity wants to publish its data during the solution procedure. Addressing these problems falls under the umbrella of well-known secured multiparty computation (SMC). Existing approaches for SMC are mostly based on cryptography. Surprisingly, a little attention has been devoted thus far to develop efficient non-cryptographic approaches. In this talk, potential non-cryptographic methods based on mathematical optimization techniques are highlighted. In particular, first, a unified framework to encapsulate existing non-cryptographic methods, which rely algebraic transformations to disguise sensitive problem data, is presented. The proposed framework capitalizes on key optimization techniques, such as change of variables and transformation of objective and constraint functions, for equivalent problem formation. Moreover, the privacy preserving properties that are inherent in the mathematical optimization techniques, including classical decomposition methods (e.g., primal and dual decomposition), and state-of-the-art methods, such as alternating direction method of multipliers are highlighted. A general definition for quantifying the privacy in the context of non-cryptographic approaches is presented. A number of examples are provided to illustrate the key ideas.

For details please refer to:
http://www.ee.kth.se/~chatw/files/PerSeOpt.pdf     (the revised version)
http://arxiv.org/abs/1210.3283  (the original technical report)

This talk is co-organized by IEEE Finland Section Communications and Information Theory Joint Societies Chapter

 


2nd Talk


Title: Optimizing Client Association in 60 GHz Wireless Access Networks
Lecturer: Dr. Chathuranga Weeraddana, Automatic Control Lab, KTH Royal Institute of Technology, Sweden
Date: Wednesday, May 22, 2013
Time: 14.00 - 15.00
Room: TS128 (NOTE CHANGE OF VENUE)

Abstract:
MillimeterWave wireless communications in the 60 GHz band are considered as a key technology for enabling multi-gigabit wireless access. However, the high propagation loss in such a band possesses major obstacles to the optimal utilization and fairness of the wireless services, where the efficient association of clients to access points (APs) is of vital importance. In this talk, such a fundamental problem of optimizing the assignment of the clients to the available APs in 60 GHz wireless access networks is considered. In particular, we pose the problem of finding the client-AP assignment that minimizes the maximum AP utilization. The problem is inherently nonconvex and the proposed solution approach is based on Lagrangian duality theory, together with the subgradient method. The resulting algorithm is distributed, lightweight, and easy to implement. It is shown that the algorithm is asymptotically optimal in the sense that the relative duality gap diminishes to zero when the number of clients increases. Both theoretical and numerical results are presented to show numerous useful properties of the proposed algorithm, such as fast convergence, scalability, time efficiency, and fair execution compared with existing approaches.

For details please refer to:
http://arxiv.org/abs/1301.2723   (the original technical report)


This talk is co-organized by IEEE Finland Section Communications and Information Theory Joint Societies Chapter


Everybody welcome!
 

 

 

Add to calendar

Back to events

Last updated: 21.5.2013