Loss of heterozygosity (LOH) studies were performed to investigate the genetic differences which separate low-grade (LG), high-grade (HG), and borderline epithelial ovarian carcinomas. Fresh tumor samples and blood were obtained from 58 patients (20 LG, 34 HG, and 4 borderline tumor specimens) undergoing surgery for ovarian carcinoma at Mayo Clinic. Tumors were graded using a modified Broder's ...

Two analytical methods, capillary electrophoresis (CE) with UV detection and high-performance liquid chromatography (HPLC) with photodiode array detection, were developed for the determination of α-lactalbumin (α-Lac), βlactoglobulin A (β-Lg A), and β-lactoglobulin B (β-Lg B) in whey protein powder, colostrum, raw milk, and infant formula. The CE analysis was performed in a bare fused silica ca...

Two analytical methods, capillary electrophoresis (CE) with UV detection and high-performance liquid chromatography (HPLC) with photodiode array detection, were developed for the determination of α-lactalbumin (α-Lac), βlactoglobulin A (β-Lg A), and β-lactoglobulin B (β-Lg B) in whey protein powder, colostrum, raw milk, and infant formula. The CE analysis was performed in a bare fused silica ca...

This study investigates the impact of depreciation practices on internal decision making local government (LG) budget officers. Prior studies focus that influence and policy formulation through financial performance indicators. However, such are also expected to affect capital asset management. Specifically, presence information makes it possible for officers account burden current future gener...

Ultrastructural studies of rats or mice treated for 24 hr with a toxic dose (100 m g / k g ) of methy lg lyoxal -b is(guanylhydrazone) revealed the presence of damaged mi tochondr ia in the crypt cells of the intestinal epithel ium. Mi tochondr ia were severely swol len and electron lucent, and appeared to be similar to those observed previously in a variety of cell types treated in v i t ro an...

• Comparison sort: O(n lg n) • Counting sort: O(n + u) = O(n + 2w) (= O(n) for w = lg n) • Radix sort: O(n · w lg n) (= O(n) for w = O(lg n)) • van Emde Boas: O(n lg w). For w = lg n, this is O(n lg lg n). This can be improved to O(n lg w lg n), making it better than the previous methods (Kirkpatrick and Reisch [7]). • Signature sort: O(n) for w = Ω(lg n). Combined with the previous result for ...

The deflection measurements made using Falling Weight Deflectometers (FWDs) are widely used in the back-calculation of pavement layer moduli. Pavement structural characteristics, changes temperature, and other related factors exert a significant effect on measurements. Therefore, three machine learning methods—Classification Regression Tree (CART), Random Forest (RF), Gradient Boosting Decision...

We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(n/B)}, we can support updates in time O( λ B ) and queries in sublogarithmic time, O(logλ n). We also present a lower bound in the cell-probe model showing that our data structure is optimal. In the RAM, hash tables have ...

We show a simple deterministic linear time algorithm for computing the minimum spanning tree of graphs on n vertices with girth at least b(t, lg n), where t ≥ 1 is a constant and b(x, y) is a variant of the inverse of the fast-growing Ackermann function. We also prove: (i) A deterministic linear time algorithm for general graphs follows from an algorithm for graphs with girth at least g for any...