Nabi Sertac Artan

Dr. Nabi Sertac Artan

New York Institute of Technology, School of Engineering and Computing Sciences, New York, NY 10023, USA
orcid

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 January 2022 in IEEE Access
Verified
Journal Article
Open access
Samah SenbelSamah Senbel
Samah Senbel
SSSrishti Sharma
Srishti Sharma
MRMehul S Raval
Mehul S Raval
CTChris Taber
Chris Taber
JNJulie Nolan
Julie Nolan
Tolga KayaTolga Kaya
Tolga Kaya
We investigated the impact of sleep and training load of Division - 1 women’s basketball players on their game performance and injury prediction using machine learning algorithms. The data was collected during a pandemic-condensed season with unpredictable interruptions to the games and athletic training schedules. We collected data from sleep monitoring devices, training data from coaches, injury reports from medical staff, and weekly survey data from athletes for 22 weeks.With proper data imputation, interpretable feature set, data balancing, and classifiers, we showed that we could predict game performance and injuries with more than 90% accuracy. More importantly, our F1 and F2 scores of 0.94 and 0.83 for game performance and injuries, respectively, show that we can use the prediction for informative analysis in the future for coaches to make insightful decisions. Our data analysis also showed that collegiate athletes sleep less than the recommended hours (6-7 instead of 8 hours). This coupled with a long hiatus in games and training increases the risk of injury. Varied training and higher heart rate variability (due to better quality sleep) indicated a better performance, while athletes with poor sleep patterns, were more prone to injuries.

18 November 2011 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
YKYu-Hsiang Kao
Yu-Hsiang Kao
MYMing Yang
Ming Yang
Nabi Sertac ArtanNabi Sertac Artan
Nabi Sertac Artan
HCH. Jonathan Chao
H. Jonathan Chao
Many high-radix network-on-chip (NoC) topologies have been proposed to improve network performance with an ever-growing number of processing elements (PEs) on a chip. We believe high-radix Clos network-on-chip (CNoC) is the most promising with its low average hop counts and good load-balancing characteristics. In this paper, we propose: 1) a high-radix router architecture with virtual output queue (VOQ) buffer structure and packet mode dual round-robin matching (PDRRM) scheduling algorithm to achieve high speed and high throughput in CNoC; 2) the design of hierarchical round-robin arbiter for high-radix high-speed NoC routers; and 3) a heuristic floor-planning algorithm to minimize the power consumption caused by the long wires. Experimental results show that the throughput of a 64-node three-stage CNoC under uniform traffic increases from 62% to 78% by replacing the baseline virtual channel routers with PDRRM VOQ routers. We also compared the delay, power, and area performance of the 64-node CNoC with other NoC topologies under various synthetic traffic patterns and SPLASH-2 benchmark traces. The simulation results show that in general CNoC improves the throughput, low-load delay, and energy efficiency over the compared NoC topologies.

1 October 2016
Verified
Conference Paper
Closed access
ABAngela Burton
Angela Burton
TPTapan Parikh
Tapan Parikh
SMShannon Mascarenhas
Shannon Mascarenhas
JZJue Zhang
Jue Zhang
JVJonathan Voris
Jonathan Voris
WLWenjia Li
Wenjia Li
The legitimate driver of a vehicle traditionally gains authorization to access their vehicle via tokens such as ignition keys, some modern versions of which feature RFID tags. However, this token-based approach is not capable of detecting all instances of vehicle misuse. Technology trends have allowed for affordable and efficient collection of various sensor data in real time from the vehicle, its surroundings, and devices carried by the driver, such as smartphones. In this paper, we propose to use this sensory data to actively identify and authenticate the driver of a vehicle by determining characteristics which uniquely categorize individuals' driving behavior. Our approach is capable of continuously authenticating a driver throughout a driving session, as opposed to alternative approaches which are either performed offline or as a session starts. This means our modeling approach can be used to detect mid-session driving attacks, such as carjacking, which are beyond the scope of alternative driver authentication solutions. A simulated driving environment was used to collect sensory data of driver habits including steering wheel position and pedal pressure. These features are classified using a Support Vector Machine (SVM) learning algorithm. Our pilot study with 10 human subjects shows that we can use various aspects of how a vehicle is operated to successfully identify a driver under 2.5 minutes with a 95% confidence interval and with at most one false positive per driving day.

1 January 2007
Verified
Conference Paper
Closed access
Nabi Sertac ArtanNabi Sertac Artan
Nabi Sertac Artan
HCH. J. Chao
H. J. Chao
Deep packet inspection (DPI) is often used in network intrusion detection and prevention systems (NIDPS), where incoming packet payloads are compared against known attack signatures. Processing every single byte in the incoming packet payload has a very stringent time constraint, e.g., 200 ps for a 40-Gbps line. Traditional DPI systems either need a large memory space or use special memory such as ternary content addressable memory (TCAM), limiting parallelism, or yielding high cost/power consumption. In this paper, we present a highspeed, single-chip DPI scheme that is scalable and configurable through memory updates. The scheme is based on a novel data structure called TriBiCa (trie bitmap content analyzer), which provides minimal perfect hashing functionality. It uses a trie structure with a hash function performed at each layer. Branching is determined by the hashing results with an objective to evenly partition attack signatures into multiple groups at each layer. During a query, as an input traverses the trie, an address to a table in the memory that stores all attack signatures is formed and is used to access the signature for an exact match. Due to the small space required, multiple copies of TriBiCa can be implemented on a single chip to perform pipelining and parallelism simultaneously, thus achieving high throughput. We have designed the TriBiCa on a modest FPGA chip, Xilinx Virtex II Pro, achieving 10-Gbps throughput without using any external memory. A proof-of-concept design is implemented and tested with 1-Gbps packet streams. By using today's state-of-the-art FPGAs, a throughput of 40 Gbps is believed to be achievable.

18 January 2012 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
MBMasanori Bando
Masanori Bando
Nabi Sertac ArtanNabi Sertac Artan
Nabi Sertac Artan
HCH. Jonathan Chao
H. Jonathan Chao
Regular expressions (RegExes) are widely used, yet their inherent complexity often limits the total number of RegExes that can be detected using a single chip for a reasonable throughput. This limit on the number of RegExes impairs the scalability of today's RegEx detection systems. The scalability of existing schemes is generally limited by the traditional detection paradigm based on per-character-state processing and state transition detection. The main focus of existing schemes is on optimizing the number of states and the required transitions, but not on optimizing the suboptimal character-based detection method. Furthermore, the potential benefits of allowing out-of-sequence detection, instead of detecting components of a RegEx in the order of appearance, have not been explored. Lastly, the existing schemes do not provide ways to adapt to the evolving RegExes. In this paper, we propose Lookahead Finite Automata (LaFA) to perform scalable RegEx detection. LaFA requires less memory due to these three contributions: 1) providing specialized and optimized detection modules to increase resource utilization; 2) systematically reordering the RegEx detection sequence to reduce the number of concurrent operations; 3) sharing states among automata for different RegExes to reduce resource requirements. Here, we demonstrate that LaFA requires an order of magnitude less memory compared to today's state-of-the-art RegEx detection systems. Using LaFA, a single-commodity field programmable gate array (FPGA) chip can accommodate up to 25  000 (25 k) RegExes. Based on the throughput of our LaFA prototype on FPGA, we estimate that a 34-Gb/s throughput can be achieved.

1 June 2009
Verified
Conference Paper
Closed access
MBMasanori Bando
Masanori Bando
Nabi Sertac ArtanNabi Sertac Artan
Nabi Sertac Artan
HCH. Jonathan Chao
H. Jonathan Chao
Since the recent increase in the popularity of services that require high bandwidth, such as high-quality video and voice traffic, the need for 100-Gbps equipment has become a reality. In particular, next generation routers are needed to support 100-Gbps worst-case IP lookup throughput for large IPv4 and IPv6 routing tables, while keeping the cost and power consumption low. It is challenging for today's state-of-the-art IP lookup schemes to satisfy all of these requirements. In this paper, we propose FlashLook, a low-cost, high-speed route lookup architecture scalable to large routing tables. FlashLook allows the use of low-cost DRAMs, while achieving high throughput. Traditionally, DRAMs are not known for their high throughput due to their high latency. However, FlashLook architecture achieves high-throughput with DRAMs by using the DRAM bursts efficiently to hide DRAM latency. FlashLook has a data structure that can be evenly partitioned into DRAM banks, a novel hash method, HashTune to smooth the hash table distribution and a data compaction method called verify bit aggregation to reduce memory usage of the hash table. These features of the FlashLook results in better DRAM memory utilization and less number of DRAM accesses per lookup. FlashLook achieves 100-Gbps worst-case throughput while simultaneously supporting 2M prefixes for IPv4 and 256k prefixes for IPv6 using one FPGA and 9 DRAM chips. FlashLook provides fast real-time updates that can support updates according to real update statistics.