Study Design Adult human osteologic specimens were assessed for spondylolytic defects and characterized. Objectives To characterize and determine the prevalence of spondylolytic defects in an osteological collection. Methods Lumbar vertebrae from the Hamann-Todd Osteological Collection at the Cleveland Museum of Natural History were examined. Digital images of specimens with L5 isthmic spondylo...

We present data concerning the factorization of the 12O-digit number RSA-120, which we factored on July 9,1993, using the quadratic sieve method. The factorization took approximately 825 MIPS years and was completed within three months real time. At the time of writing RSA-120 is the largest integer ever factored by a general purpose factoring algorithm. We also present some conservative extrap...

Laparoscopic nephrectomy for both benign and malignant diseases of kidney is increasingly being performed. We report our experience with the first 120 consecutive laparoscopic nephrectomy performed in our hospital. It is the retrospective analysis of a prospectively maintained database of 4 years period. The parameters examined included age, gender, indications, operative time, blood loss, intr...

ion/generalization: thinking at high level, e.g. ability to view two different systems as being the same representation: modeling the ideas and entities that are being dealt with, e.g. shapes as strings algorithm: finding ways and methods to ahieve what is needed (this is not always possible) program: representation or encoding of an algorithm, usually machine dependent, e.g. the same addition ...

We examine the power of quantum Turing machines (QTM’s) which compute string-valued functions of their inputs using small workspace. A (probabilistic or quantum) Turing machine has three tapes: A read-only input tape, a read/write work tape, and a “1.5-way" write-only output tape. Consider a partial function f : Σ 1 → Σ 2 , where Σ1 and Σ2 are the input and output tape alphabets, respectively. ...

We study space-efficient algorithm for computing a centerpoint for a set P of n points in R, where the points in P are given in a read-only array. We propose an algorithm that finds a centerpoint of P in O(T (n) log n) time using O(S(n)) extra space, where T (n) and S(n) are the time and extra space complexities of computing the median among a set of n elements stored in a read-only array.

Web applications have evolved from simple read-only websites to complex dataand operation-intensive systems. The main goal of this kind of application is to provide the users with services that assist them in carrying out activities according to a given set of business rules. The addition of transactions to modern web applications poses new challenges, such as managing the interplay between bus...