Optimizing Significant Node Discovery in Multilayer Networks

Slides:



Advertisements
Similar presentations
Optimal Resource Discovery Paths of Gnutella2 The IEEE 22nd International Conference on Advanced Information Networking and Applications (AINA 2008)
Advertisements

1. Find the cost of each of the following using the Nearest Neighbor Algorithm. a)Start at Vertex M.
Date:2011/06/08 吳昕澧 BOA: The Bayesian Optimization Algorithm.
S. Mandayam/ ANN/ECE Dept./Rowan University Artificial Neural Networks ECE /ECE Fall 2010 Shreekanth Mandayam ECE Department Rowan University.
UNIVERSITY OF JYVÄSKYLÄ Topology Management in Unstructured P2P Networks Using Neural Networks Presentation for IEEE Congress on Evolutionary Computing.
CSE 222 Systems Programming Graph Theory Basics Dr. Jim Holten.
CS 1 – Introduction to Computer Science Introduction to the wonderful world of Dr. T Dr. Daniel Tauritz.
1 Pertemuan 20 Teknik Routing Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.
1 High-Level Carrier Requirements for Cross Layer Optimization Dave McDysan Verizon.
EVENT DETECTION IN TIME SERIES OF MOBILE COMMUNICATION GRAPHS
Graphical Toolbox For Enhancements in Operations Research Education Author: Ramzi Kesrouany Research Advisor: Dr. Nan Kong Department of Industrial & Management.
Dana Butnariu Princeton University EDGE Lab June – September 2011 OPTIMAL SLEEPING IN DATACENTERS Joint work with Professor Mung Chiang, Ioannis Kamitsos,
Complex Network Theory – An Introduction Niloy Ganguly.
1 Value of information – SITEX Data analysis Shubha Kadambe (310) Information Sciences Laboratory HRL Labs 3011 Malibu Canyon.
Complex Network Theory – An Introduction Niloy Ganguly.
C. Savarese, J. Beutel, J. Rabaey; UC BerkeleyICASSP Locationing in Distributed Ad-hoc Wireless Sensor Networks Chris Savarese, Jan Beutel, Jan Rabaey.
Evaluation of ad hoc routing over a channel switching MAC protocol Ethan Phelps-Goodman Lillie Kittredge.
1 Identifying Differentially Regulated Genes Nirmalya Bandyopadhyay, Manas Somaiya, Sanjay Ranka, and Tamer Kahveci Bioinformatics Lab., CISE Department,
1 Local Hashing for ECMP Ali Sajassi September 21, 2011 IEEE Interim Meeting.
DSN & SensorWare Projects Rockwell Science Center –Charles Chien UCLA –Mani Srivastava, Miodrag Potkonjak USC/ISI –Brian Schott, Bob Parker Virginia Tech.
Title Page – Name of Invention or Discovery PICTURE.
“Niche Work” Graham J Wills, Lucent Technologies (Bell Lab)
Zijian Wang, Eyuphan Bulut, and Boleslaw K. Szymanski Center for Pervasive Computing and Networking and Department of Computer Science Rensselaer Polytechnic.
Maplesoft and LHCPhenoNet, Valencia, Spain February, 2011 Dr. David Hare, Maplesoft.
Investing in research, making a difference. Applying for the WARF Discovery Challenge Research Award 1.
LHCOPN CANARIE Update Vancouver, August 31,
LOGO Организация кредитования в Республике Беларусь Костенко А.К., к.э.н., доцент.
涉外合同中的法律适用问题 --- 以上海地区为例 Group 2 吕雅丽 王燕玉 刘彧 孙煜 韦卫玲 李天奇 LOGO.
Seminar Announcement December 24, Saturday, 15:00-17:00, Room: A302, WNLO Title: Quality-of-Experience (QoE) and Power Efficiency Tradeoff for Fog Computing.
Auburn University
Networks Are Everywhere
Multi-Layer Network Representation of the NTC Environment Lili Sun, Proof School Arijit Das, Computer Science Introduction The United States Army’s National.
Auburn University COMP7330/7336 Advanced Parallel and Distributed Computing Mapping Techniques Dr. Xiao Qin Auburn University.
Fisheye Routing protocol
Significance analysis of microarrays (SAM)
Analyzing Twitter Data
الفصل السادس: التعلم عن بعد (تال101ت)
Categorizing networks using Machine Learning
Section 8.6 of Newman’s book: Clustering Coefficients
Classification of Networks using Machine Learning
Project 11: Security and Privacy of the Communication Channels among IoT Devices REU Student: Tianbo Chen Graduate mentors: Safa Bacanli and Huy Truong.
Small success leads to life-long success!
Leach routing protocol in WSN
[Name of Your Internship or Project]
Shortest path and small world effect
برنامج قواعد البيانات (مايكروسوفت أوفيس اكسس (Microsoft Office Access
Centralities (4) Ralucca Gera,
Lab exploration: Network Profile Summary
Robustness or Network Resilience
Department of Computer Science University of York
Leach routing protocol in WSN
Network Search & Visualization
Networks Are Everywhere
ISEN 601 Location Logistics
Certificate of Recognition
Section 8.3: Degree Distribution
Synopsis Sinya Benyajati, Ph.D. Department of Physiology
NET 424: REAL-TIME SYSTEMS (Practical Part)
Adaptive Offloading for Pervasive Computing
Multilayered cooccurrence network analysis of OTUs that exhibited a significant positive Spearman’s correlation with oxalate consumption at the end of.
Centralities Using Gephi and Python Prof. Ralucca Gera,
Enrichment analysis using CFinder
The Minimum Cost Spanning Tree Problem
Degree Distribution Ralucca Gera,
Creating a Social Media Plan
Distributed Graph Algorithms
[Name of Your Internship or Project]
CSCI 465 Data Communications and Networks Lecture 16
Information Sciences and Systems Lab
NDIA DoD CIO Vision.
Presentation transcript:

Optimizing Significant Node Discovery in Multilayer Networks Lab Logo Optimizing Significant Node Discovery in Multilayer Networks SEAP Student: Kushagro Bhattacharjee Saratoga High School Class of 2017 kushagro123@gmail.com Mentor: Dr. Ralucca Gera Department of Applied Mathematics and Center for Cyber Warfare rgera@nps.edu Project Dates: 20 June – 12 August Project Objective and Research Approach: In social networks, some people are friendly and some are the enemy or at least people of interest. Both groups of people interact (communication, activities, financials…). Can we use the interactions to make any determinations about the enemy footprint in the area of operations? Approach: Created and implemented an algorithm to identify target nodes within multilayered social networks: Multilayered Connotation Algorithm for Discovery (MultiConn) Results / Accomplishments The algorithm we introduced, MultiConn: prints out a list of the nodes of interest based on their negative connotation plots the Nodes of Interest found vs. the Number of Monitors gone through for multiple networks Next Steps: Future plans include incorporating a variety of choices for monitor types for MultiConn implementation, such as seeing edges between neighbors and 2 or 3 step neighbors Distribution type Type