This study explores buyers’ search and purchase behavior in an information-overloaded retail Electronic Marketplace (EMP). Two instrumental variables, i.e. number of visitors and number of sales for an item, are used to represent buyers’ search and purchase behavior. Price and reputation, two of the most frequently researched independent variables in EMP studies, are considered. The relationshi...

This paper discusses the descriptional complexity of generalized forbidding grammars in context of degrees, numbers of nonterminals and conditional productions, and a new descriptional complexity measure—an index—of generalized forbidding grammars.

In recent years, several systems have been proposed that learn the rules of a simple card or board game solely from visual demonstration. These systems were constructed for specific games and rely on substantial background knowledge. We introduce a general system for learning board game rules from videos and demonstrate it on several well-known games. The presented algorithm requires only a few...

We investigate the descriptional complexity of limited propagating Lindenmayer systems and their deterministic and tabled variants with respect to the number of rules and the number of symbols. We determine the decrease of complexity when the generative capacity is increased. For incomparable families, we give languages that can be described more efficiently in either of these families than in ...

In this paper we study the properties of systems of bounded arithmetic capturing small complexity classes and state conditions sufficient for such systems to capture the corresponding complexity class tightly. Our class of systems of bounded arithmetic is the class of secondorder systems with comprehension axiom for a syntactically restricted class of formulas Φ ⊂ Σ 1 based on a logic in the de...

We describe our development and use of DescriptiveEnvironment (DE). This is a program to aid researchers in Finite Model Theory and students of logic to automatically generate examples, counterexamples of conjectures, reductions between problems, and visualizations of structures and queries. DescriptiveEnvironment is available for free use under an ISC license at http://www.cs.umass.edu/∼immerm...