There has been increasing research in developing offline web applications. This paper concentrates on developing a new methodology for the online assessment web applications that could be used while offline. It is imp...There has been increasing research in developing offline web applications. This paper concentrates on developing a new methodology for the online assessment web applications that could be used while offline. It is important to retrieve the critical data collected during an examination without a provision of a backup mechanism. There is a need for an assessment system that can adapt to work uninterruptedly and without loss of critical data while there is intermittent intemet discontinuity. This paper describes architecture and implementation of online assessment system with offline capabilities. Online assessment system with offline capabilities will not interrupt examinee＇s experience while appearing for an assessment test if intemet connection is not available. A development methodology is designed and a compliant framework is implemented to enhance online assessment system with offline capabilities.展开更多
The maximal matching problem （MMP） is to find maximal edge subsets in a given undirected graph, that no pair of edges are adjacent in the subsets. It is a vitally important NP-complete problem in graph theory and ap...The maximal matching problem （MMP） is to find maximal edge subsets in a given undirected graph, that no pair of edges are adjacent in the subsets. It is a vitally important NP-complete problem in graph theory and applied mathematics, having numerous real life applications in optimal combination and linear programming fields. It can be difficultly solved by the electronic computer in exponential level time. Meanwhile in previous studies deoxyribonucleic acid （DNA） molecular operations usually were used to solve NP-complete continuous path search problems, e.g. HPP, traveling salesman problem, rarely for NP-hard problems with discrete vertices or edges solutions, such as the minimum vertex cover problem, graph coloring problem and so on. In this paper, we present a DNA algorithm for solving the MMP with DNA molecular operations. For an undirected graph with n vertices and m edges, we reasonably design fixed length DNA strands representing vertices and edges of the graph, take appropriate steps and get the solutions of the MMP in proper length range using O（n^3） time. We extend the application of DNA molecular operations and simultaneously simplify the complexity of the computation.展开更多
文摘There has been increasing research in developing offline web applications. This paper concentrates on developing a new methodology for the online assessment web applications that could be used while offline. It is important to retrieve the critical data collected during an examination without a provision of a backup mechanism. There is a need for an assessment system that can adapt to work uninterruptedly and without loss of critical data while there is intermittent intemet discontinuity. This paper describes architecture and implementation of online assessment system with offline capabilities. Online assessment system with offline capabilities will not interrupt examinee＇s experience while appearing for an assessment test if intemet connection is not available. A development methodology is designed and a compliant framework is implemented to enhance online assessment system with offline capabilities.
文摘The maximal matching problem （MMP） is to find maximal edge subsets in a given undirected graph, that no pair of edges are adjacent in the subsets. It is a vitally important NP-complete problem in graph theory and applied mathematics, having numerous real life applications in optimal combination and linear programming fields. It can be difficultly solved by the electronic computer in exponential level time. Meanwhile in previous studies deoxyribonucleic acid （DNA） molecular operations usually were used to solve NP-complete continuous path search problems, e.g. HPP, traveling salesman problem, rarely for NP-hard problems with discrete vertices or edges solutions, such as the minimum vertex cover problem, graph coloring problem and so on. In this paper, we present a DNA algorithm for solving the MMP with DNA molecular operations. For an undirected graph with n vertices and m edges, we reasonably design fixed length DNA strands representing vertices and edges of the graph, take appropriate steps and get the solutions of the MMP in proper length range using O（n^3） time. We extend the application of DNA molecular operations and simultaneously simplify the complexity of the computation.
