• Sonuç bulunamadı

Message from the IEEE/ACM ASONAM 2012 general chairs

N/A
N/A
Protected

Academic year: 2021

Share "Message from the IEEE/ACM ASONAM 2012 general chairs"

Copied!
1
0
0

Yükleniyor.... (view fulltext now)

Tam metin

(1)

Message from the IEEE/ACM ASONAM 2012 General Chairs

Welcome to ASONAM 2012, the 2012 International Conference on Advances in Social Networks Analysis and Mining and welcome to İstanbul! ASONAM 2012 builds on the great success of the previous ASONAM conferences, which were held in Kaohsiung, Taiwan (July 2011); in Odense Denmark (August 2010); in Athens, Greece (July 2009). The conference provides an excellent opportunity to meet fellow researchers and practitioners from a variety of social networks analysis and mining fields to form new collaborations and to exchange research ideas and practices

We have four keynote speakers invited to the conference. We are sure that their presentations will be enjoyable and bring ideas for new research possibilities to the conference participants. Our keynote speakers are Ulrik Brandes: Professor of Computer and Information Science of University of Konstanz, Germany; Arno H.P. Reuser: Chief of Open Source Intelligence of Defence Intelligence and Security Service, Netherlands; Frans N. Stokman: Professor of Social Science Research Methodology of University of Groningen, Netherlands; and Barry Wellman: the director at Netlab as the S.D. Clark Professor of Sociology of University of Toronto, Canada. We wish to thank them for accepting our invitation. We are very happy that we can present such a strong group of keynote speakers at ASONAM 2012.

The success of ASONAM 2012 depends on the people and organizations that support it. We must thank all of the volunteers who helped organize this conference. In particular, we thank Program Chairs Fakhri Karray and Faruk Polat, who together with the Program Committee, created a great technical program. In addition, we would like to thank Industry Track Co-Chairs Charu Aggarwal and Nitesh V. Chawla; Sponsorship Co-Chairs Aybar C. Acar and Hanghang Tong; Tutorials Co-Chairs Ralf Klamma, Huan Liu, and Jie Tang; Workshop Co-Chairs Przemysław Kazienko, V.S. Subrahmanian, and I-Hsien Ting; Panels, Exhibits and Demos Co-Chairs Hasan Davulcu and Katina Michael; Publicity Co-Chairs Mohsen Afsharchi, Mehmet Kaya, Keivan Kianmehr, Ee-Peng Lim, and Mohamad Nagi; Publications Co-Chairs Panagioptis Karampelas and Jon Rokne; Local Arrangements Co-Chairs Ahmet Bulut, Hasan Dağ, and Tansel Özyer; Registration Co-Chairs (again) Tansel Özyer and Mehmet Tan; and last but not least Web Chair (again) Mehmet Tan.

The conference would not be possible without sponsors. The conference is organized in collaboration with the IEEE Computer Society and ACM SIGMOD. We are grateful to the Kadir Has University for hosting the conference on their beautiful campus and making us feel close to many important historical events and a part of many cultures. The ASONAM conference series will continue next year with ASONAM 2013 to be held in Niagara Fall, Ontario, Canada. We hope to meet you all again!

We hope you will enjoy the conference and your visit to İstanbul and Turkey.

Fazlı Can, Bilkent University

Kathleen M. Carley, Carnegie Mellon University Irwin King, The Chinese University of Hong Kong

Philip S. Yu, University of Illinois at Chicago ASONAM 2012 General Chairs

 

xxi xxi

Referanslar

Benzer Belgeler

İşletmelerin içinde faaliyet gösterdiği toplumda, daha iyi bir ekolojik çevre için kaynakların düzgün kullanılması, iyi koşullarda temin edilmesi ve çevresel

Pathological significance and prognostic role of microvessel density, evaluated using CD31, CD34, and CD105 in prostate cancer patients after radical prostatectomy

A rook’s path on C ( n , m ) that in every step goes either right or up (respectively right or down) is called an ascending (respectively descending) staircase

Later, Madsen, Nielsen and Pnar [15] used this algorithm to solve linear programming problems, extending both the theory and practice of the new algorithm.. All these algorithms

The algorithm finds a globally optimal extreme point solution for problem (P) by combining a branch and bound search with a neighbor generation process.. The neighbor

The unique path generated by the minimizers of these problems yields the solution to the original problem for finite values of the approximation parameter.. Thus, a finite

Finite element analysis of the deformation behaviour of pure aluminium 609 2 The deformed sample processed by CGP endures higher values of effective strain.

Our results indicate that when transshipments are considered after each unsatisfied demand, it is optimal for retailers to apply nonstationary transship- ment policies defined