Searching MEDLINE and ISI (via BIDS)(from 1981 until October 1997), Inside Information Plus (from 1993), the Cochrane Library, EMBASE, SIGLE and FirstSearch were searched for relevant trials; the search terms were provided. Bibliographic listings of all retrieved articles were handsearched. In addition, authors of abstracts, academic centres, leading centres of EUS, manufacturers and an EUS e-m...

For an arbitrary graph G with n vertices, we present a parallel algorithm to solve the Hamiltonian cycle problems on G. The comp utational model used is a linear systolic array which consists of (n-1) id entical processing elements (PEs). Every PE has a simple structure and e xecutes the same program at any time step. Each PE performs the depth-firstsearch and backtracking techniques for search...

Backtrack-style exhaustive search algorithms for NP-hard problems tend to have large variance in their runtime. This is because “fortunate” branching decisions can lead to finding a solution quickly, whereas “unfortunate” decisions in another run can lead the algorithm to a region of the search space with no solutions. In the literature, frequent restarting has been suggested as a means to over...

Introduction: The purpose of this study is to investigate the relationship of serum selenium levels and the risk of developing prostate cancer. It has been documented that antioxidants reduce the incidence of cancer by eradicating free radicals that damage DNA, thus increasing the risk of cancer. Selenium is a component of the antioxidant enzyme glutathione peroxidase, whose role in cancer prev...

Introduction: The purpose of this study is to investigate the etiology of panic disorder. Specific objectives include comparing and contrasting the genetic versus environmental factors that contribute to the etiology of panic disorder. Currently, there are four main theories to explain the etiology of panic disorder: psychodynamic, behavioral, cognitive, and biological. Methodology: This is acc...