Optimal Design of Internet-Based Auctions

Online auctions are a profitable, exciting, and dynamic part of electronic commerce, and behave in ways, which do not match classical auction theory. This paper models an online auction in terms of a Markov chain on a state space defined by the current price of the item and the number of bidders who have been previously bumped. It provides a mathematical model, some approximations, which were necessary to convert it into a tractable problem and solutions to a small and a medium-sized theoretical auction. The model results were validated through a comparison with real-world online auction data, showing promise as a predictor of final auction prices. The results of the auction model are also useful in solving an optimization problem that incorporates inventory management considerations in determining optimal auction size.     

Tilted cellulose arrangement as a novel mechanism for hygroscopic coiling in the stork's bill awn

The sessile nature of plants demands the development of seed-dispersal mechanisms to establish new growing loci. Dispersal strategies of many species involve drying of the dispersal unit, which induces directed contraction and movement based on changing environmental humidity. The majority of researched hygroscopic dispersal mechanisms are based on a bilayered structure. Here, we investigate the motility of the stork''s bill (Erodium) seeds that relies on the tightening and loosening of a helical awn to propel itself across the surface into a safe germination place. We show that this movement is based on a specialized single layer consisting of a mechanically uniform tissue. A cell wall structure with cellulose microfibrils arranged in an unusually tilted helix causes each cell to spiral. These cells generate a macroscopic coil by spiralling collectively. A simple model made from a thread embedded in an isotropic foam matrix shows that this cellulose arrangement is indeed sufficient to induce the spiralling of the cells.     

Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem

We study a generalized version of the minimum makespan jobshop problem in which multiple instances of each job are to be processed. The system starts with specified inventory levels in all buffers and finishes with some desired inventory levels of the buffers at the end of the planning horizon. A schedule that minimizes the completion time of all the operations is sought. We develop a polynomial time asymptotic approximation procedure for the problem. That is, the ratio between the value of the delivered solution and the optimal one converge into one, as the multiplicity of the problem increases. Our algorithm uses the solution of the linear relaxation of a time-indexed Mixed-Integer formulation of the problem. In addition, a heuristic method inspired by this approximation algorithm is presented and is numerically shown to out-perform known methods for a large set of standard test problems of moderate job multiplicity.     

Excitable dendrites and spines: earlier theoretical insights elucidate recent direct observations

Important advances in experimental methods have made it possible to measure the electrical events in dendrites directly and to record optically from dendritic spines. These new techniques allow us to focus on the input region of the neuron and highlight the excitable properties of the dendritic membrane. Interestingly, some of the recent experimental findings were anticipated by earlier theoretical research, for example, the observation that some spines possess excitable channels that might generate local all-or-none events. Computer models were used previously to explore the conditions for initiating an action potential at the dendritic tree, in particular, at the spine head, and for active propagation between excitable spines and excitable dendritic arbors. The consequences for synaptic amplification, for the extent of active spread in the tree and for non-linear discriminations between different patterns of synaptic inputs were also considered. Here we review the biophysical insights gained from the theory and demonstrate how these elucidate the recent experimental results.     

The additional predictive value contributed by quantitative chromatin pattern description as compared to DNA ploidy level measurement in 257 superficial bladder transitional cell carcinomas

The purpose of the present study was to demonstrate the post-translational modifications of sperm plasma membrane proteins by fatty acid acylation during sperm maturation in the epididymis. Rat epididymal spermatozoa were incubated at 37 degrees C with various concentrations (100 microCi and 1 mCi) of [9-10(n)3H]palmitic acid in a medium containing Tyrode's solution supplemented with sodium bicarbonate, sodium pyruvate and sodium lactate. The incorporation of [3H]palmitate in vitro was determined in epididymal spermatozoa and an attempt was made to identify the lipid-linked proteins of purified plasma membranes of maturing epididymal spermatozoa by autoradiography. The studies demonstrated that [3H]palmitate was covalently linked to a subset of membrane cytoskeleton proteins of maturing rat spermatozoa. The pattern of incorporation of lipid was a maturation-associated phenomenon as caput spermatozoa incorporated more radioactivity than did caudal spermatozoa. The labelled proteins appeared to be membrane-bound since 82% of radioactivity was associated with membrane fractions. Autoradiograms of SDS-PAGE gels of labelled caput sperm extract showed three prominent palmitate-incorporating protein bands of about 70, 56 and 36 kDa and few minor bands. Most of these proteins were present in the membrane fraction of caput spermatozoa. Labelled gels of both the sperm extracts and of purified membranes showed resistance to hydroxylamine treatment, suggesting that there are amide bonds between lipid and proteins. The higher incorporation of labelled palmitate by immature spermatozoa of the caput epididymis compared with mature spermatozoa from the cauda epididymis and the addition of palmitate to plasma membrane proteins of caput epididymal spermatozoa suggest that fatty acylation is a post-translational modification of sperm membrane proteins.     

Do prostate specific antigen and prostate specific antigen density enhance the detection of prostate carcinoma after initial diagnosis of prostatic intraepithelial neoplasia without concurrent carcinoma?

BACKGROUND: Prostatic intraepithelial neoplasia (PIN) is considered to be a precursor of prostate carcinoma in which serum levels of prostate specific antigen (PSA) have been correlated with PIN grades. The aim of this study was to determine whether PSA and prostate specific antigen density (PSAD), obtained at the time of initial diagnosis of PIN without concurrent carcinoma, can be used as predictive factors to discriminate patients with subsequent cancer on repeat biopsy. METHODS: We studied, retrospectively, the records of 93 patients with PIN (low and high grade) without concurrent carcinoma at the time of their first needle biopsy. We assessed the relationship between initial PIN grade, PSA, and PSAD with later detection of carcinoma on repeat biopsy. Patients were divided into 3 subgroups for analysis according to their initial PSA level (0-4, 4.1-10, >10 ng/mL). RESULTS: Carcinoma detection rate on repeat biopsy was 13.3% for patients with low grade PIN and 47.7% for patients with high grade PIN (P < 0.006). High grade PIN was frequently associated with subsequent carcinoma whatever the PSA level (33.3-61.9%). Low grade PIN was associated with subsequent carcinoma in 42.8% of the cases when PSA was greater than 10 ng/mL. When PSA was between 4 and 10 ng/mL, low grade PIN carcinoma was found on repeat biopsies in only 10.7% of the cases (P = 0.05). In none of the PSA subgroups did PSAD enhance later cancer detection. CONCLUSIONS: For patients with high grade PIN, the incidence of subsequent carcinoma is high, whatever the PSA values. For these cases repeat biopsies should be recommended. Patients with low grade PIN and PSA greater than 10 ng/mL should have repeat biopsies because the incidence of subsequent carcinoma is high and comparable to high grade PIN. PSAD did not provide additional information.     

A Unified Approach to Approximating Partial Covering Problems

An instance of the generalized partial cover problem consists of a ground set U and a family of subsets ${\mathcal{S}}\subseteq 2^{U}$ . Each element e??U is associated with a profit p(e), whereas each subset $S\in \mathcal{S}$ has a cost c(S). The objective is to find a minimum cost subcollection $\mathcal{S}'\subseteq \mathcal{S}$ such that the combined profit of the elements covered by $\mathcal{S}'$ is at least P, a specified profit bound. In the prize-collecting version of this problem, there is no strict requirement to cover any element; however, if the subsets we pick leave an element e??U uncovered, we incur a penalty of ??(e). The goal is to identify a subcollection $\mathcal{S}'\subseteq \mathcal{S}$ that minimizes the cost of $\mathcal{S}'$ plus the penalties of uncovered elements. Although problem-specific connections between the partial cover and the prize-collecting variants of a given covering problem have been explored and exploited, a more general connection remained open. The main contribution of this paper is to establish a formal relationship between these two variants. As a result, we present a unified framework for approximating problems that can be formulated or interpreted as special cases of generalized partial cover. We demonstrate the applicability of our method on a diverse collection of covering problems, for some of which we obtain the first non-trivial approximability results.