Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 5 of 5
Full-Text Articles in Entire DC Network
Collapsible Graphs And Reductions Of Line Graphs, Zhi-Hong Chen, Peter C.B. Lam, Wai-Chee Shiu
Collapsible Graphs And Reductions Of Line Graphs, Zhi-Hong Chen, Peter C.B. Lam, Wai-Chee Shiu
Zhi-Hong Chen
A graph G is collapsible if for every even subset X ⊆ V ( G ) , G has a subgraph such that G − E ( Γ ) is connected and the set of odd-degree vertices of Γ is X . A graph obtained by contracting all the non-trivial collapsible subgraphs of G is called the reduction of G . In this paper, we characterize graphs of diameter two in terms of collapsible subgraphs and investigate the relationship between the line graph of the reduction and the reduction of the line graph. Our results extend former results in [H.-J. …
Testing And Maintenance In The Video Game Industry Today, Anthony A. Jarman
Testing And Maintenance In The Video Game Industry Today, Anthony A. Jarman
Senior Honors Theses
Testing and maintenance are important when designing any type of software, especially video games. Since the gaming industry began, testing and maintenance techniques have evolved and changed. In order to understand how testing and maintenance techniques are practiced in the gaming industry, several key elements must be examined. First, specific testing and maintenance techniques that are most useful for video games must be analyzed to understand their effectiveness. Second, the processes used for testing and maintaining video games at the beginning of the industry must be reviewed in order to see how far testing and maintenance techniques have progressed. Third, …
A Game Theoretic Approach For Deploying Intrusion Detection Agent, Cheng-Kuang Wu
A Game Theoretic Approach For Deploying Intrusion Detection Agent, Cheng-Kuang Wu
Cheng-Kuang Wu
The proposed framework applies two game theoretic models for economic deployment of intrusion detection system (IDS). The first scheme models and analyzes the interaction behaviors of between an attacker and intrusion detection agent within a non-cooperative game, and then the security risk value is derived from the mixed strategy Nash equilibrium. The second scheme uses the security risk value to compute the Shapley value of intrusion detection agent under the various threat levels. Therefore, the fair agent allocation creates a minimum set of IDS deployment costs. Numerical examples show that the network administrator can quantitatively evaluate the security risk of …
A Game Theoretic Framework For Multi-Agent Deployment In Intrusion Detection Systems, Cheng-Kuang Wu
A Game Theoretic Framework For Multi-Agent Deployment In Intrusion Detection Systems, Cheng-Kuang Wu
Cheng-Kuang Wu
Due to cost considerations there must exist in intrusion detection system, a trade-off between the user’s ease of access and capability of detecting attacks. The proposed framework applies two game theoretic models for economic deployment of intrusion detection agent. The first scheme models and analyzes the interaction behaviors between an attacker and intrusion detection agent within a non-cooperative game, and then the security risk value is derived from the mixed strategy Nash equilibrium. The second scheme uses the security risk value to compute the Shapley value of intrusion detection agent while considering the various threat levels. Therefore, the efficient agent …
Quantum Algorithm Animator, Lori Eileen Nicholson
Quantum Algorithm Animator, Lori Eileen Nicholson
CCE Theses and Dissertations
The design and development of quantum algorithms present a challenge, especially for inexperienced computer science students. Despite the numerous common concepts with classical computer science, quantum computation is still considered a branch of theoretical physics not commonly used by computer scientists. Experimental research into the development of a quantum computer makes the use of quantum mechanics in organizing computation more attractive, however the physical realization of a working quantum computer may still be decades away.
This study introduces quantum computing to computer science students using a quantum algorithm animator called QuAL. QuAL's design uses features common to classical algorithm animators …