Ertugrul Necdet Ciftcioglu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ertugrul Necdet Ciftcioglu has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Kevin Chan
Army Research Laboratory (ARL), Adelphi, MD, USA
1 shared publication Prithwish Basu
Raytheon BBN Technologies, Cambridge, MA, 02138, USA
1 shared publicationRam Ramanathan
Raytheon BBN Technologies, Cambridge, MA, 02138, USA
1 shared publication- Shiqiang Wang
Department of Computer Science, University of Exeter, Exeter, U.K.
1 shared publication - Ting He
Pennsylvania State University, University Park, USA
1 shared publication
Latest Publications
- Open Access
- 11 September 2017
- Published by Springer Nature in Scientific Reports
- Vol. 7 (1) , 11160
Generative Models for Global Collaboration Relationships
When individuals interact with each other and meaningfully contribute toward a common goal, it results in a collaboration. The artifacts resulting from collaborations are best captured using a hypergraph model, whereas the relation of who has collaborated with whom is best captured via an abstract simplicial complex (SC). We propose a generative algorithm GENESCs for SCs modeling fundamental collaboration relations. The proposed network growth process favors attachment that is preferential not to an individual’s degree, i.e., how many people has he/she collaborated with, but to his/her facet degree, i.e., how many maximal groups or facets has he/she collaborated within. Based on our observation that several real-world facet size distributions have significant deviation from power law–mainly since larger facets tend to subsume smaller ones–we adopt a data-driven approach. We prove that the facet degree distribution yielded by GENESCs is power law distributed for large SCs and show that it is in agreement with real world co-authorship data. Finally, based on our intuition of collaboration formation in domains such as collaborative scientific experiments and movie production, we propose two variants of GENESCs based on clamped and hybrid preferential attachment schemes, and show that they perform well in these domains.
- 11 September 2017
- Published by Springer Nature in Scientific Reports
- Vol. 7 (1) , 11160
Open AccessGenerative Models for Global Collaboration Relationships
When individuals interact with each other and meaningfully contribute toward a common goal, it results in a collaboration. The artifacts resulting from collaborations are best captured using a hypergraph model, whereas the relation of who has collaborated with whom is best captured via an abstract simplicial complex (SC). We propose a generative algorithm GENESCs for SCs modeling fundamental collaboration relations. The proposed network growth process favors attachment that is preferential not to an individual’s degree, i.e., how many people has he/she collaborated with, but to his/her facet degree, i.e., how many maximal groups or facets has he/she collaborated within. Based on our observation that several real-world facet size distributions have significant deviation from power law–mainly since larger facets tend to subsume smaller ones–we adopt a data-driven approach. We prove that the facet degree distribution yielded by GENESCs is power law distributed for large SCs and show that it is in agreement with real world co-authorship data. Finally, based on our intuition of collaboration formation in domains such as collaborative scientific experiments and movie production, we propose two variants of GENESCs based on clamped and hybrid preferential attachment schemes, and show that they perform well in these domains.
- Open Access
Location Privacy in Mobile Edge Clouds: A Chaff-based Approach
In this paper, we consider user location privacy in mobile edge clouds (MECs). MECs are small clouds deployed at the network edge to offer cloud services close to mobile users, and many solutions have been proposed to maximize service locality by migrating services to follow their users. Co-location of a user and his service, however, implies that a cyber eavesdropper observing service migrations between MECs can localize the user up to one MEC coverage area, which can be fairly small (e.g., a femtocell). We consider using chaff services to defend against such an eavesdropper, with focus on strategies to control the chaffs. Assuming the eavesdropper performs maximum likelihood (ML) detection, we consider both heuristic strategies that mimic the user's mobility and optimized strategies designed to minimize the detection or tracking accuracy. We show that a single chaff controlled by the optimal strategy or its online variation can drive the eavesdropper's tracking accuracy to zero when the user's mobility is sufficiently random. We further propose extended strategies that utilize randomization to defend against an advanced eavesdropper aware of the strategy. The efficacy of our solutions is verified through both synthetic and trace-driven simulations.
Open AccessLocation Privacy in Mobile Edge Clouds: A Chaff-based Approach
In this paper, we consider user location privacy in mobile edge clouds (MECs). MECs are small clouds deployed at the network edge to offer cloud services close to mobile users, and many solutions have been proposed to maximize service locality by migrating services to follow their users. Co-location of a user and his service, however, implies that a cyber eavesdropper observing service migrations between MECs can localize the user up to one MEC coverage area, which can be fairly small (e.g., a femtocell). We consider using chaff services to defend against such an eavesdropper, with focus on strategies to control the chaffs. Assuming the eavesdropper performs maximum likelihood (ML) detection, we consider both heuristic strategies that mimic the user's mobility and optimized strategies designed to minimize the detection or tracking accuracy. We show that a single chaff controlled by the optimal strategy or its online variation can drive the eavesdropper's tracking accuracy to zero when the user's mobility is sufficiently random. We further propose extended strategies that utilize randomization to defend against an advanced eavesdropper aware of the strategy. The efficacy of our solutions is verified through both synthetic and trace-driven simulations.