Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kenneth Williams 0002

dblp:32/2830 · also Kenneth A. Williams · DBLP profile ↗
← Back
8ranked-venue papers
2as first author
0since 2021 · last 2017
0009-0003-9842-4580ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Human-computer interaction and ubiquitous computing · 4Computer networks · 3 · 2 first-authorSecurity and privacy · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Optical networks · 50% Wireless networking · 38% Physical-layer communications · 12%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Wireless networking
media access protocol
0.011993
A Media-Access Protocol for Time- and Wavelength-Division Multiplexed Passive Star Networks · IEEE J. Sel. Areas Commun. 1993
Optical networks › fiber optic local area network
passive star network
0.011993
A Media-Access Protocol for Time- and Wavelength-Division Multiplexed Passive Star Networks · IEEE J. Sel. Areas Commun. 1993
Physical-layer communications › multiplexing
time-division multiplexing
0.011993
A Media-Access Protocol for Time- and Wavelength-Division Multiplexed Passive Star Networks · IEEE J. Sel. Areas Commun. 1993
Optical networks
wavelength-division multiplexing
0.011993
A Media-Access Protocol for Time- and Wavelength-Division Multiplexed Passive Star Networks · IEEE J. Sel. Areas Commun. 1993

Methods — techniques the papers use, named apart from their topics

multihop access · 0.0bus-mesh virtual topology · 0.0
YearPublicationVenuePosition
2017 An interactive visualization tool for teaching ARP spoofing attack
abstract
Local area network (LAN) access is the top vector for insider threats and misuses according to the Verizon's Data Breach Investigations Report. Address Resolution Protocol (ARP) is often exploited by the attackers who have gained access to the LAN. It is critical for students to learn how attacks on ARP work and know the countermeasures. In an earlier work, authors developed a hands-on lab to help students learn how an ARP spoofing attack works by asking them to create and send attack packets. To enhance learning further, we present an interactive visualization tool that intuitively shows the effects of the ARP spoofing attack in real-time. The Hacker Graphical User Interface (HGUI) is an interactive visualization tool developed to assist students in learning how ARP Spoofing works. By modeling a controlled ARP Spoofing attack using virtual machines, we give students the ability to alter elements of the attack by interacting with the visualization. This tool was developed using Processing, an open source programming language used in many visual art communities. It runs on virtual machines installed with Kali Linux. This tool animates attack packets, normal packets, and the status of ARP cache in real-time. If students have successfully carried out the ARP spoofing attack, they can see the normal packets being routed to the attacker machine and the victim's ARP cache being poisoned. In this paper, we present the design, implementation, and evaluation of the lab. Tests were conducted to measure the performance of students before and after using this tool. We also gave students surveys after they completed the hands-on lab. The result shows that this tool can significantly enhance students' understanding of the concept of ARP spoofing attacks and motivate them in learning more about cyber security.
Brandon Scott, Jinsheng Xu, Ariana Brown, Erica Clark, Xiaohong Yuan, Anna Yu, Kenneth Williams 0002
FIE8
2016 Teaching mobile computing and mobile security
abstract
Due to the popularity of mobile devices, it is important to teach mobile computing and security to students in colleges and universities. This paper describes eight course modules on mobile computing and security we developed that could be integrated into a computer science curriculum. These course modules were presented at a faculty workshop. Workshop evaluation includes a survey questionnaire and reflective narratives from participants. The workshop evaluation results are discussed in this paper. The course modules can be adopted by instructors teaching mobile application development, cyber security or other related courses.
Xiaohong Yuan, Kenneth Williams 0002, D. Scott McCrickard, Charles Hardnett, Litany H. Lineberry, Kelvin S. Bryant, Jinsheng Xu, Albert C. Esterline, Anyi Liu, Selvarajah Mohanarajah, Rachel Rutledge
FIE2
2015 Using a case study to teach students about finding and fixing logic flaws in software
abstract
An application logic flaw is a type of software vulnerability related to privilege manipulation or transaction control manipulation. They are often difficult to identify using automated scanners. A case study on the eCommerce merchant software Bigcommerce, integrated with PayPal Express as a third party payment collector, was created to teach students about this topic. Case studies provide students with a real-world context, and help them understand complex topics better than traditional teaching methods. However, the computer science field, especially computer security, does not have many case studies available. The case study on logic flaws in software was taught in Spring 2015, and the teaching experience is discussed.
Lindsay Simpkins, Xiaohong Yuan, Huiming Yu, Kenneth Williams 0002
FIE4
2015 Integrating Mobile Computing and Security into a Computer Science Curriculum (Abstract Only)
abstract
The poster describes our project of integrating mobile computing and security into the Computer Science program at North Carolina A&T State University. Twelve (12) course modules in mobile computing and security are being developed and integrated into existing Computer Science courses such as computer programming, software development, operating systems, and information assurance courses. Each course module includes learning objectives, a tutorial, presentation slides, hands-on labs and/or case studies, test questions, etc. The course module material we develop and our teaching experiences will be beneficial to computer science educators who are considering including mobile computing and mobile security into their curricula.
Xiaohong Yuan, Kelvin S. Bryant, Kenneth Williams 0002, Jinsheng Xu
SIGCSE3
2011 Integrating online social networks for enhancing reputation systems of e-commerce
abstract
Online shopping has been introduced to Internet users for decades. However, many people are still susceptible to the risks of online shopping. Multiple risk-mitigating solutions have been adopted by most online shopping sites. One such solution, the reputation system, is capable of providing an up-to-date reputation score for every online seller. Nevertheless, it is also vulnerable to fake reviews, which can, in turn, mislead prospective buyers. In order to quench the fire, previous research work mounted friendship annotations to certain reviews, so that the prospective buyers can choose to trust such particular reviews based on their close relationships with the reviewers. In this paper, we extend this friend-annotation scheme by integrating online social networks to online shopping sites. Our protocol is designed to provide three online review submission methods with different privacy-preserving requirements.
Justin Zhijun Zhan, Nicholas Koceja, Kenneth Williams 0002, Justin Brewton
ISI4
1993 Efficient embedding of a hypercube in an irregular WDM network
abstract
A heuristic algorithm is presented for efficiently embedding a virtual hypercube into an irregular wavelength division multiplexing (WDM) network so that the message propagation delay is minimized. Embedding a hypercube allows the communications of the many hypercube-base algorithms to map directly to the virtual network. The authors' algorithm optimizes the embedding by effective assignment of virtual addresses as well as the efficient routing of virtual connections. The three-step approach is first based on embedding the irregular graph in a hypercube so that the number of virtual edges that correspond to physical edges is minimized. The routing of the virtual connections and their assignment to logical channels is performed while minimizing the number of wavelengths that must be supported by the WDM system. Experiments with the proposed algorithm show it to produce embeddings with significantly shorter path lengths and requiring fewer wavelengths than previous methods for practical networks.
Kenneth Williams 0002, David Hung-Chang Du
LCN1
1993 A Media-Access Protocol for Time- and Wavelength-Division Multiplexed Passive Star Networks
abstract
A media access protocol is presented for time- and wavelength-division multiplexed optical passive star networks. The protocol is based on a bus-mesh virtual topology. The network provides minimum latency and high throughput while requiring only a single fixed wavelength transmitter and receiver at each station. The use of nonagile, fixed wavelength devices, readily available with current technology, reduces costs, improves reliability and avoids tuning delays and limitations. The multihop access protocol operates effectively in an environment with lengthy propagation delays. The wavelength-division multiplexing system is required to support only a small, easily achievable number of wavelength channels.>
Kenneth Williams 0002, Tru Q. Dam, David Hung-Chang Du
IEEE J. Sel. Areas Commun.1
1991 Topological design of optically switched WDM networks
abstract
The authors' research addresses some of the underlying design principles for a new class of metropolitan area networks (MANs) based on current lightwave technology, optically switched wavelength-division multiplexed (WDM) networks. A unique feature of WDM networks is their ability to create many different virtual topologies on top of the given physical topology. The authors describe problems associated with the design of optically switched WDM networks, study the embedding of regular virtual topologies into regular and irregular physical topologies, tabulate some characteristics of embedded regular virtual topologies and provide a procedure for computing the maximum number of wavelengths required for virtual topology embeddings.>
Ronald J. Vetter, Kenneth Williams 0002, David Hung-Chang Du
LCN2