This study illustrates the use of an Association Rule General Analytic System (ARGAS) for analyzing non-numeric data. Previous research by Parente, Finley and Megalis (2021) showed how ARGAS approach could be used to test hypotheses in conventional experimental designs. can exploratory settings such as single-case research, assessing organization multi-trial learning experiments, analysis socia...

Many real-world planning problems are best modeled as infinite search space problems, using numeric fluents. Unfortunately, most planners and planning heuristics do not directly support such fluents. We propose a search space abstraction technique that compiles a planning problem with numeric fluents into a finite state propositional planning problem. To account for the loss of precision result...

This paper proposes a system for recognizing numeric strings from topographical maps, which is composed of the automatic recognition stage and the interactive recognition stage. In this method, uncertain numeric strings extracted through the automatic recognition stage based on topographical map feature only, are confirmed and corrected by the interactive recognition stage. Therefore we can obt...

W e argue that: (1) whether articles contain numeric data should be irrelevant to the evaluation process; (2) the desirability of numeric real, numeric synthetic, or nonnumeric data depends on the research objective; (3) assumptions can and should sometimes substitute for additional data; and (4) equal scrutiny should be given to data collection procedures, regardless of whether the researcher ...

Shared and mutable data-structures pose major problems in static analysis and most analyzers are unable to keep track of the values of numeric variables stored in the heap. In this paper, we first identify sufficient conditions under which heap allocated numeric variables in object oriented programs (i.e., numeric fields) can be handled as nonheap allocated variables. Then, we present a static ...

Currently, all search algorithms which use discretization of numeric attributes for numeric association rule mining, work in the way that the original distribution of the numeric attributes will be lost. This issue leads to loss of information, so that the association rules which are generated through this process are not precise and accurate. Based on this fact, algorithms which can natively h...

Planning with numeric state variables has been a challenge for many years, and was a part of the 3rd International Planning Competition (IPC-3). Currently one of the most popular and successful algorithmic techniques in STRIPS planning is to guide search by a heuristic function, where the heuristic is based on relaxing the planning task by ignoring the delete lists of the available actions. We ...

We have developed a method for answering single answer questions automatically using a collection of documents or the Internet as a source of data for the production of the answer. Examples of such questions are ‘What is the melting point of tin?’, and ‘Who wrote the novel Moby Dick?’. The approach we have adopted to the problem uses the Mikrokosmos ontology to represent knowledge about questio...

A number of questions regarding programs involving heap-based data structures can be phrased as questions about numeric properties of those structures. A data structure traversal might terminate if the length of some path is eventually zero or a function to remove n elements from a collection may only be safe if the collection has size at least n. In this thesis, we develop proof methods for re...