Browsing by Author "Li, Feng"

Now showing 1 - 10 of 53
  • Thumbnail Image
    Item
    Accelerating complex modeling workflows in CyberWater using on-demand HPC/Cloud resources
    (IEEE, 2021-09) Li, Feng; Chen, Ranran; Fu, Yuankun; Song, Fengguang; Liang, Yao; Ranawaka, Isuru; Pamidighantam, Sudhakar; Luna, Daniel; Liang, Xu; Computer Information and Graphics Technology, School of Engineering and Technology
    Workflow management systems (WMSs) are commonly used to organize/automate sequences of tasks as workflows to accelerate scientific discoveries. During complex workflow modeling, a local interactive workflow environment is desirable, as users usually rely on their rich, local environments for fast prototyping and refinements before they consider using more powerful computing resources. However, existing WMSs do not simultaneously support local interactive workflow environments and HPC resources. In this paper, we present an on-demand access mechanism to remote HPC resources from desktop/laptop-based workflow management software to compose, monitor and analyze scientific workflows in the CyberWater project. Cyber-Water is an open-data and open-modeling software framework for environmental and water communities. In this work, we extend the open-model, open-data design of CyberWater with on-demand HPC accessing capacity. In particular, we design and implement the LaunchAgent library, which can be integrated into the local desktop environment to allow on-demand usage of remote resources for hydrology-related workflows. LaunchAgent manages authentication to remote resources, prepares the computationally-intensive or data-intensive tasks as batch jobs, submits jobs to remote resources, and monitors the quality of services for the users. LaunchAgent interacts seamlessly with other existing components in CyberWater, which is now able to provide advantages of both feature-rich desktop software experience and increased computation power through on-demand HPC/Cloud usage. In our evaluations, we demonstrate how a hydrology workflow that consists of both local and remote tasks can be constructed and show that the added on-demand HPC/Cloud usage helps speeding up hydrology workflows while allowing intuitive workflow configurations and execution using a desktop graphical user interface.
  • Thumbnail Image
    Item
    ACTS: Extracting Android App Topological Signature through Graphlet Sampling
    (IEEE, 2016-10) Peng, Wei; Gao, Tianchong; Sisodia, Devkishen; Saha, Tanay Kumar; Li, Feng; Al Hasan, Mohammad; Computer Information and Graphics Technology, School of Engineering and Technology
    Android systems are widely used in mobile & wireless distributed systems. In the near future, Android is believed to dominate the mobile distributed environment. However, with the popularity of Android-based smartphones/tablets comes the rampancy of Android-based malware. In this paper, we propose a novel topological signature of Android apps based on the function call graphs (FCGs) extracted from their Android App Packages (APKs). Specifically, by leveraging recent advances in graphlet sampling, the proposed method fully captures the invocator-invocatee relationship at local neighborhoods in an FCG without exponentially inflating the state space. Using real benign app and malware samples, we demonstrate that our method, ACTS (App topologiCal signature through graphleT Sampling), can detect malware and identify malware families robustly and efficiently. More importantly, we demonstrate that, without augmenting the FCG with any semantic features such as bytecode-based vertex typing, local topological information captured by ACTS alone can achieve a high malware detection accuracy. Since ACTS only uses structural features, which are orthogonal to semantic features, it is expected that combining them would give a greater improvement in malware detection accuracy than combining non-orthogonal semantic features.
  • Thumbnail Image
    Item
    Advancing profiling sensors with a wireless approach
    (2013-11-20) Galvis, Alejandro; Russomanno, David J.; Li, Feng; Rizkalla, Maher E.; King, Brian
    In general, profiling sensors are low-cost crude imagers that typically utilize a sparse detector array, whereas traditional cameras employ a dense focal-plane array. Profiling sensors are of particular interest in applications that require classification of a sensed object into broad categories, such as human, animal, or vehicle. However, profiling sensors have many other applications in which reliable classification of a crude silhouette or profile produced by the sensor is of value. The notion of a profiling sensor was first realized by a Near-Infrared (N-IR), retro-reflective prototype consisting of a vertical column of sparse detectors. Alternative arrangements of detectors have been implemented in which a subset of the detectors have been offset from the vertical column and placed at arbitrary locations along the anticipated path of the objects of interest. All prior work with the N-IR, retro-reflective profiling sensors has consisted of wired detectors. This thesis surveys prior work and advances this work with a wireless profiling sensor prototype in which each detector is a wireless sensor node and the aggregation of these nodes comprises a profiling sensor’s field of view. In this novel approach, a base station pre-processes the data collected from the sensor nodes, including data realignment, prior to its classification through a back-propagation neural network. Such a wireless detector configuration advances deployment options for N-IR, retro-reflective profiling sensors.
  • Thumbnail Image
    Item
    Android Malware Detection via Graphlet Sampling
    (IEEE, 2018-11) Gao, Tianchong; Peng, Wei; Sisodia, Devkishen; Saha, Tanay Kumar; Li, Feng; Al Hasan, Mohammad; Computer Information and Graphics Technology, School of Engineering and Technology
    Android systems are widely used in mobile & wireless distributed systems. In the near future, Android is believed to dominate the mobile distributed environment. However, with the popularity of Android-based smartphones/tablets comes the rampancy of Android-based malware. In this paper, we propose a novel topological signature of Android apps based on the function call graphs (FCGs) extracted from their Android App PacKages (APKs). Specifically, by leveraging recent advances on graphlet mining, the proposed method fully captures the invocator-invocatee relationship at local neighborhoods in an FCG without exponentially inflating the state space. Using real benign app and malware samples, we demonstrate that our method, ACTS (App topologiCal signature through graphleT Sampling), can detect malware and identify malware families robustly and efficiently. More importantly, we demonstrate that, without augmenting the FCG with any semantic features such as bytecode-based vertex typing, local topological information captured by ACTS alone can achieve a high malware detection accuracy. Since ACTS only uses structural features, which are orthogonal to semantic features, it is expected that combining them would give a greater improvement in malware detection accuracy than combining non-orthogonal semantic features.
  • Thumbnail Image
    Item
    Applying Rating Systems to Challenge Based Cybersecurity Education
    (IEEE, 2017-01) Samuels, Andrew; Li, Feng; Justice, Connie; Computer Information and Graphics Technology, School of Engineering and Technology
    As technology becomes a larger part of everyday life, it becomes increasingly more important for CS and CIT students to learn about cyber security during their education. While many cyber security oriented courses exist, it is also necessary that students must be able to work and learn in an environment that resembles a real world context. To address this problem it has become common to adapt cyber security challenges into the classroom as a method for students to put their knowledge into practice. One problem is that these challenges can vary considerably in levels of difficulty, which makes it problematic for students to be able to select a challenge that is an appropriate difficulty for their skill level. A potential solution to this problem could be to adapt a rating system to rank both the students and the challenges. This would then allow the students to easily select challenges that are appropriate for them to engage with by comparing their own rating with the rating of available challenges. In this project we propose methods that could be used to adapt a rating system to an existing cyber security education program. Finally we propose a method to survey students that interact with the program so that the effect of the rating system can be measured.
  • Thumbnail Image
    Item
    Assessing the Effectiveness of In-Vehicle Highway Back-of-Queue Alerting System
    (The National Academies of Sciences, Engineering, and Medicine, 2021-01) Shen, Dan; Zhang, Zhengming; Ruan, Keyu; Tian, Renran; Li, Lingxi; Li, Feng; Chen, Yaobin; Sturdevant, Jim; Cox, Ed; Electrical and Computer Engineering, School of Engineering and Technology
    This paper proposes an in-vehicle back-of-queue alerting system that is able to issue alerting messages to drivers on highways approaching traffic queues. A prototype system was implemented to deliver the in-vehicle alerting messages to drivers via an Android-based smartphone app. To assess its effectiveness, a set of test scenarios were designed and implemented on a state-of-the-art driving simulator. Subjects were recruited and their testing data was collected under two driver states (normal and distracted) and three alert types (no alerts, roadside alerts, and in-vehicle auditory alerts). The effectiveness was evaluated using three parameters of interest: 1) the minimum Time-to-Collision (mTTC), 2) the maximum deceleration, and 3) the maximum lateral acceleration. Statistical models were utilized to examine the usefulness and benefits of each alerting type. The results show that the in-vehicle auditory alert is the most effective way for delivering alerting messages to drivers. More specifically, it significantly increases the mTTC (30% longer than that of 'no warning') and decreases the maximum lateral acceleration (60% less than that of 'no warning'), which provides drivers with more reaction time and improves driving stability of their vehicles. The effects of driver distraction significantly decrease the efficiency of roadside traffic sign alert. More specifically, when the driver is distracted, the roadside traffic sign alert performs significantly worse in terms of mTTC compared with that of normal driving. This highlights the importance of the in-vehicle auditory alert when the driver is distracted.
  • Thumbnail Image
    Item
    Building a scientific workflow framework to enable real‐time machine learning and visualization
    (Wiley, 2019-08) Li, Feng; Song, Fengguang; Computer and Information Science, School of Science
    Nowadays, we have entered the era of big data. In the area of high performance computing, large‐scale simulations can generate huge amounts of data with potentially critical information. However, these data are usually saved in intermediate files and are not instantly visible until advanced data analytics techniques are applied after reading all simulation data from persistent storages (eg, local disks or a parallel file system). This approach puts users in a situation where they spend long time on waiting for running simulations while not knowing the status of the running job. In this paper, we build a new computational framework to couple scientific simulations with multi‐step machine learning processes and in‐situ data visualizations. We also design a new scalable simulation‐time clustering algorithm to automatically detect fluid flow anomalies. This computational framework is built upon different software components and provides plug‐in data analysis and visualization functions over complex scientific workflows. With this advanced framework, users can monitor and get real‐time notifications of special patterns or anomalies from ongoing extreme‐scale turbulent flow simulations.
  • Thumbnail Image
    Item
    A Cancellable and Privacy-Preserving Facial Biometric Authentication Scheme
    (IEEE, 2017) Phillips, Tyler; Zou, Xukai; Li, Feng; Computer and Information Science, School of Science
    In recent years, biometric, or "who you are," authentication has grown rapidly in acceptance and use. Biometric authentication offers users the convenience of not having to carry a password, PIN, smartcard, etc. Instead, users will use their inherent biometric traits for authentication and, as a result, risk their biometric information being stolen. The security of users' biometric information is of critical importance within a biometric authentication scheme as compromised data can reveal sensitive information: race, gender, illness, etc. A cancellable biometric scheme, the "BioCapsule" scheme, proposed by researchers from Indiana University Purdue University Indianapolis, aims to mask users' biometric information and preserve users' privacy. The BioCapsule scheme can be easily embedded into existing biometric authentication systems, and it has been shown to preserve user-privacy, be resistant to several types of attacks, and have minimal effects on biometric authentication system accuracy. In this research we present a facial authentication system which employs several cutting-edge techniques. We tested our proposed system on several face databases, both with and without the BioCapsule scheme being embedded into our system. By comparing our results, we quantify the effects the BioCapsule scheme, and its security benefits, have on the accuracy of our facial authentication system.
  • Thumbnail Image
    Item
    CyberWater: An Open Framework for Data and Model Integration in Water Science and Engineering
    (ACM, 2022-10-17) Chen, Ranran; Li, Feng; Bieger, Drew; Song, Fengguang; Liang, Yao; Luna, Daniel; Young, Ryan; Liang, Xu; Pamidighantam, Sudhakar; Computer and Information Science, School of Science
    The CyberWater project is to build an open-data open-model framework for easy and incremental integration of heterogeneous data sources and diverse scientific models across disciplines in the broad water domain. The CyberWater framework extends the open-data open-model framework called Meta-Scientific-Modeling (MSM) that provides a system-wide data and model integration platform. On top of MSM, the CyberWater framework provides a set of toolkits, and external system integration engines, to further facilitate users' scientific modeling and collaboration across disciplines. For example, the developed generic model agent toolkit enables users to integrate their computational models into CyberWater via graphical user interface configuration without coding, which further simplifies the data and model integration and model coupling. CyberWater adopts a graphical scientific workflow system, VisTrails, ensuring data provenance and reproducible computing. CyberWater supports novel access to high-performance computing resources on demand for users' computational expensive model tasks. We demonstrate merits of CyberWater by a use case of hydrologic modeling workflow.
  • Thumbnail Image
    Item
    De-Anonymization of Dynamic Online Social Networks via Persistent Structures
    (IEEE, 2019-05) Gao, Tianchong; Li, Feng; Computer Information and Graphics Technology, School of Engineering and Technology
    Service providers of Online Social Networks (OSNs) periodically publish anonymized OSN data, which creates an opportunity for adversaries to de-anonymize the data and identify target users. Most commonly, these adversaries use de-anonymization mechanisms that focus on static graphs. Some mechanisms separate dynamic OSN data into slices of static graphs, in order to apply a traditional de-anonymization attack. However, these mechanisms do not account for the evolution of OSNs, which limits their attack performance. In this paper, we provide a novel angle, persistent homology, to capture the evolution of OSNs. Persistent homology barcodes show the birth time and death time of holes, i.e., polygons, in OSN graphs. After extracting the evolution of holes, we apply a two-phase de-anonymization attack. First, holes are mapped together according to the similarity of birth/death time. Second, already mapped holes are converted into super nodes and we view them as seed nodes. We then grow the mapping based on these seed nodes. Our de-anonymization mechanism is extremely compatible to the adversaries who suffer latency in relationship collection, which is very similar to real-world cases.