Abstract: Security techniques have been designed to obtain certain objectives. One of the most important objectives all security mechanisms try to achieve is the availability, which insures that network services are available to various entities in the network when required. But there has not been any certain parameter to measure this objective in network. In […]
Discovering Triangles in Portraits for Supporting Photographic Creation, S He, Z Zhou, F Farhat, JZ Wang, IEEE Transactions on Multimedia, Aug 2017. Intelligent Portrait Composition Assistance — Integrating Deep-learned Models and Photography Idea Retrieval, F Farhat, MM Kamani, S Mishra, JZ Wang, July 2017. Skeleton Matching with Applications in Severe Weather Detection, MM Kamani, F […]
Farshid Farhat @ EECS PSU PhD Candidate School of Electrical Engineering and Computer Science The Pennsylvania State University Address: 310 IST Building, University Park, PA, 16802. Email: fuf111 AT psu DOT edu Web: Farshid Farhat ‘s Site About Me I am a member of Intelligent Information Systems (IIS) research lab at Penn State. I am working with Prof. […]
FORK-JOIN QUEUE MODELING AND OPTIMAL SCHEDULING IN PARALLEL PROGRAMMING FRAMEWORKS ABSTRACT MapReduce framework is widely used to parallelize batch jobs since it exploits a high degree of multi-tasking to process them. However, it has been observed that when the number of servers increases, the map phase can take much longer than expected. This thesis analytically […]
Abstract: Performance of routing is severely degraded when misbehaving nodes drop packets instead of properly forwarding them. In this paper, we propose a Game-Theoretic Adaptive Multipath Routing (GTAMR) protocol to detect and punish selfish or malicious nodes which try to drop information packets in routing phase and defend against collaborative attacks in which nodes try […]
Abstract Locally multipath adaptive routing (LMAR) protocol, classified as a new reactive distance vector routing protocol for MANETs is proposed in this paper. LMAR can find an ad-hoc path without selfish nodes and wormholes using a random search algorithm in polynomial-time. Also when the primary path fails, it discovers an alternative safe path if network […]