The objectives of this study were to investigate Engineering students’ attitudes and problems in academic reading comprehension and to determine the contribution of academic reading attitude, breadth and depth of vocabulary knowledge to academic reading comprehension. The participants were 122 undergraduate students of Engineering at Iran University of Science and Technology. The Vocabulary Lev...

The present study investigated the differences between e-reading and paper-reading in their breadth and depth. Our results showed that (1) breadth and depth of reading were both greater in e-reading than in paper-reading; (2) possession of a tablet tended to facilitate breadth of e-reading; (3) breadth of e-reading was greater than breadth of paper-reading for news, magazines, and others, but n...

BACKGROUND The aim of this study was to establish standards for determining sex from fragmentary and complete femurs in a Korean population. MATERIALS AND METHODS The statistical analysis of 12 variables (6 about breadth and 6 about length) based on 100 Korean femurs (from 50 males and 50 females) showed that all variables have significant sex differences. RESULTS The most accurate discrimi...

The benefits of portfolio diversification is a central tenet implicit to modern financial theory and practice. Linked to diversification is the notion of breadth. Breadth is correctly thought of as the number of independent bets available to an investor. Conventionally applications using breadth frequently assume only the number of separate bets. There may be a large discrepancy between these t...

We show that i-triangulated graphs can be colored in linear time by applying lexicographic breadth-first search (abbreviated LexBFS) and the greedy coloring algorithm.

In this paper, we study the metric property of LexBFS-ordering on AT-free graphs. Based on a 2-sweep LexBFS algorithm, we show that every AT-free graph admits a vertex ordering, called the strong 2-cocomparability ordering, that for any three vertices u v w in the ordering, if d(u; w) 2 then d(u; v) = 1 or d(v; w) 2. As an application of this ordering, we provide a simple linear time recognitio...

We present a novel approach to bidirectional breadth-first IDA* (BFIDA*) and demonstrate its effectiveness in the domain of peg solitaire, a simple puzzle. Our approach improves upon unidirectional BFIDA* by usually avoiding the last iteration of search entirely, greatly speeding up search. In addition, we provide a number of improvements specific to peg solitaire. We have improved duplicate-de...

Obtaining a patent provides the patentee with the ability to offer a potential entrant a license to operate within the patent that has been claimed. This paper shows that the patentee always has an incentive to provide a license if the patentee is unable to use patent breadth to deter entry (if the patentee can deter entry, it is optimal for the patentee to do so). Licensing a new product to a ...

Recent work shows that the memory requirements of A* and related graph-search algorithms can be reduced substantially by only storing nodes that are on or near the search frontier, using special techniques to prevent node regeneration, and recovering the solution path by a divide-and-conquer technique. When this approach is used to solve graph-search problems with unit edge costs, we have shown...