Stepwise Help and Scaffolding for Java Code Tracing Problems With an Interactive Trace Table

2021 ◽  
Author(s):  
Zak Risha ◽  
Jordan Barria-Pineda ◽  
Kamil Akhuseyinoglu ◽  
Peter Brusilovsky
Keyword(s):  
Author(s):  
Gursimran Singh ◽  
Harpreet Kaur

With the growth of website content it is become difficult to manage relations between Individual webpage and keep track of their hyperlinks within a website. This causes some Hyperlink become dead or broken. A broken Link  is a  link on a web page that no longer works. It is difficult to find out the broken link manually by checking each hyperlink individually because it is time consuming and tedious work. So to eliminate this we can use the selenium web driver tool and java code to automate testing of each hyperlink individually. The objective of this thesis is to automate finding of broken links using selenium web driver tool.


Author(s):  
YUJIAN FU ◽  
ZHIJIANG DONG ◽  
XUDONG HE

A software architecture design has many benefits including aiding comprehension, supporting early analysis, and providing guidance for subsequent development activities. An additional major benefit is if a partial prototype implementation can be automatically generated from a given software architecture design. However, in the past decade less progress was made on automatically realizing software architecture designs. In this paper, we present a translator for automatically generating an implementation from a software architectural description. The implementation not only captures the functionality of the given architecture description, but also contains additional monitoring code for ensuring desirable behavior properties through runtime verification. Our method takes a software description written in SAM, a software architecture model integrating dual formal methods Petri nets and temporal logic, and generates ArchJava/Java/AspectJ code. More specifically, the structure of a SAM architecture description produces ArchJava code, the behavior models of components/connectors represented in Petri nets lead to plain Java code, and the property specifications defined in temporal logic generate AspectJ code; the above code segments are then integrated into Java code. An experimental result is provided.


2020 ◽  
Author(s):  
Shalin Shah

<p>A clique in a graph is a set of vertices that are all directly connected</p><p>to each other i.e. a complete sub-graph. A clique of the largest size is</p><p>called a maximum clique. Finding the maximum clique in a graph is an</p><p>NP-hard problem and it cannot be solved by an approximation algorithm</p><p>that returns a solution within a constant factor of the optimum. In this</p><p>work, we present a simple and very fast randomized algorithm for the</p><p>maximum clique problem. We also provide Java code of the algorithm</p><p>in our git repository. Results show that the algorithm is able to find</p><p>reasonably good solutions to some randomly chosen DIMACS benchmark</p><p>graphs. Rather than aiming for optimality, we aim to find good solutions</p><p>very fast.</p>


2020 ◽  
Author(s):  
Shalin Shah

<p>A clique in a graph is a set of vertices that are all directly connected</p><p>to each other i.e. a complete sub-graph. A clique of the largest size is</p><p>called a maximum clique. Finding the maximum clique in a graph is an</p><p>NP-hard problem and it cannot be solved by an approximation algorithm</p><p>that returns a solution within a constant factor of the optimum. In this</p><p>work, we present a simple and very fast randomized algorithm for the</p><p>maximum clique problem. We also provide Java code of the algorithm</p><p>in our git repository. Results show that the algorithm is able to find</p><p>reasonably good solutions to some randomly chosen DIMACS benchmark</p><p>graphs. Rather than aiming for optimality, we aim to find good solutions</p><p>very fast.</p>


Sign in / Sign up

Export Citation Format

Share Document