Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 4 of 4
Full-Text Articles in Entire DC Network
Off-Line Thai Handwriting Recognition In Legal Amount, Watchara Chatwiriya
Off-Line Thai Handwriting Recognition In Legal Amount, Watchara Chatwiriya
Graduate Theses, Dissertations, and Problem Reports
Thai handwriting in legal amounts is a challenging problem and a new field in the area of handwriting recognition research. The focus of this thesis is to implement Thai handwriting recognition system. A preliminary data set of Thai handwriting in legal amounts is designed. The samples in the data set are characters and words of the Thai legal amounts and a set of legal amounts phrases collected from a number of native Thai volunteers. At the preprocessing and recognition process, techniques are introduced to improve the characters recognition rates. The characters are divided into two smaller subgroups by their writing …
Early Component-Based Reliability Assessment Using Uml Based Software Models, William Black Smith V
Early Component-Based Reliability Assessment Using Uml Based Software Models, William Black Smith V
Graduate Theses, Dissertations, and Problem Reports
In the last decade, software has grown in complexity and size, while development timelines have diminished. As a result, component-based software engineering is becoming routine. Component-based software reliability assessment combines the architecture of the system with the reliability of the components to obtain the system reliability. This allows developers to produce a reliable system and testers to focus on the vulnerable areas.;This thesis discusses a tool developed to implement the methodology previously created for early reliability assessment of component-based systems. The tool, Early Component-based Reliability Assessment (ECRA), uses Rational Rose Unified Modeling Language (UML) diagrams to predict the reliability of …
Degree Sequences, Rong Luo
Degree Sequences, Rong Luo
Graduate Theses, Dissertations, and Problem Reports
A nonincreasing sequence pi = (d1, d2,···,dn) of nonnegative integers is said to be graphic if it is the degree sequence of a simple graph of order n and such graph is referred to as a realization of pi.;Let H be a simple graph. A graphic sequence pi is said to be potentially H-graphic if it has a realization G containing H as its subgraph.;In this paper, we characterize the potentially Ck graphic sequence for k = 3, 4, 5. These characterizations imply theorems due to P. Erdos, M. S. Jacobson and J. Lehel, R. J. Gould, M. S. Jacobson …
Random Search Of And-Or Graphs Representing Finite-State Models, David Robert Owen
Random Search Of And-Or Graphs Representing Finite-State Models, David Robert Owen
Graduate Theses, Dissertations, and Problem Reports
Model checking tools have been effective in testing concurrent software represented by communicating finite-state machines. But these tools may require a very large amount of memory. A finite-state model can be translated automatically into a compact AND-OR graph. We use an abductive random search scheme to extract, from the AND-OR graph, information about the execution of the program represented by the original finite-state model.;We use the search to measure testability. For AND-OR graphs representing highly testable programs, we find quickly everything it is possible to find; that is, if the number of unique goals found is plotted, we see a …