Postoperative statin use and risk of biochemical recurrence following radical prostatectomy: results from the Shared Equal Access Regional Cancer Hospital (SEARCH) database.

OBJECTIVE: To investigate the effect of statin use after radical prostatectomy (RP) on biochemical recurrence (BCR) in patients with prostate cancer who never received statins before RP. PATIENTS AND METHODS: We conducted a retrospective analysis of 1146 RP patients within the Shared Equal Access Regional Cancer Hospital (SEARCH) database. Multivariable Cox proportional hazards analyses were used to examine differences in risk of BCR between post-RP statin users vs nonusers. To account for varying start dates and duration of statin use during follow-up, post-RP statin use was treated as a time-dependent variable. In a secondary analysis, models were stratified by race to examine the association of post-RP statin use with BCR among black and non-black men. RESULTS: After adjusting for clinical and pathological characteristics, post-RP statin use was significantly associated with 36% reduced risk of BCR (hazard ratio [HR] 0.64, 95% confidence interval [CI] 0.47-0.87; P = 0.004). Post-RP statin use remained associated with reduced risk of BCR after adjusting for preoperative serum cholesterol levels. In secondary analysis, after stratification by race, this protective association was significant in non-black (HR 0.49, 95% CI 0.32-0.75; P = 0.001) but not black men (HR 0.82, 95% CI 0.53-1.28; P = 0.384). CONCLUSION: In this retrospective cohort of men undergoing RP, post-RP statin use was significantly associated with reduced risk of BCR. Whether the association between post-RP statin use and BCR differs by race requires further study. Given these findings, coupled with other studies suggesting that statins may reduce risk of advanced prostate cancer, randomised controlled trials are warranted to formally test the hypothesis that statins slow prostate cancer progression.

Real-Time and Data-Driven Operation Optimization and Knowledge Discovery for an Enterprise Information System

An enterprise information system (EIS) is an integrated data-applications platform characterized by diverse, heterogeneous, and distributed data sources. For many enterprises, a number of business processes still depend heavily on static rule-based methods and extensive human expertise. Enterprises are faced with the need for optimizing operation scheduling, improving resource utilization, discovering useful knowledge, and making data-driven decisions.

This thesis research is focused on real-time optimization and knowledge discovery that addresses workflow optimization, resource allocation, as well as data-driven predictions of process-execution times, order fulfillment, and enterprise service-level performance. In contrast to prior work on data analytics techniques for enterprise performance optimization, the emphasis here is on realizing scalable and real-time enterprise intelligence based on a combination of heterogeneous system simulation, combinatorial optimization, machine-learning algorithms, and statistical methods.

On-demand digital-print service is a representative enterprise requiring a powerful EIS.We use real-life data from Reischling Press, Inc. (RPI), a digit-print-service provider (PSP), to evaluate our optimization algorithms.

In order to handle the increase in volume and diversity of demands, we first present a high-performance, scalable, and real-time production scheduling algorithm for production automation based on an incremental genetic algorithm (IGA). The objective of this algorithm is to optimize the order dispatching sequence and balance resource utilization. Compared to prior work, this solution is scalable for a high volume of orders and it provides fast scheduling solutions for orders that require complex fulfillment procedures. Experimental results highlight its potential benefit in reducing production inefficiencies and enhancing the productivity of an enterprise.

We next discuss analysis and prediction of different attributes involved in hierarchical components of an enterprise. We start from a study of the fundamental processes related to real-time prediction. Our process-execution time and process status prediction models integrate statistical methods with machine-learning algorithms. In addition to improved prediction accuracy compared to stand-alone machine-learning algorithms, it also performs a probabilistic estimation of the predicted status. An order generally consists of multiple series and parallel processes. We next introduce an order-fulfillment prediction model that combines advantages of multiple classification models by incorporating flexible decision-integration mechanisms. Experimental results show that adopting due dates recommended by the model can significantly reduce enterprise late-delivery ratio. Finally, we investigate service-level attributes that reflect the overall performance of an enterprise. We analyze and decompose time-series data into different components according to their hierarchical periodic nature, perform correlation analysis,

and develop univariate prediction models for each component as well as multivariate models for correlated components. Predictions for the original time series are aggregated from the predictions of its components. In addition to a significant increase in mid-term prediction accuracy, this distributed modeling strategy also improves short-term time-series prediction accuracy.

In summary, this thesis research has led to a set of characterization, optimization, and prediction tools for an EIS to derive insightful knowledge from data and use them as guidance for production management. It is expected to provide solutions for enterprises to increase reconfigurability, accomplish more automated procedures, and obtain data-driven recommendations or effective decisions.

Telescoping is not time compression: a model of the dating of autobiographical events.

A model of telescoping is proposed that assumes no systematic errors in dating. Rather, the overestimation of recent occurrences of events is based on the combination of three factors: (1) Retention is greater for recent events; (2) errors in dating, though unbiased, increase linearly with the time since the dated event; and (3) intrusions often occur from events outside the period being asked about, but such intrusions do not come from events that have not yet occurred. In Experiment 1, we found that recall for colloquia fell markedly over a 2-year interval, the magnitude of errors in psychologists' dating of the colloquia increased at a rate of .4 days per day of delay, and the direction of the dating error was toward the middle of the interval. In Experiment 2, the model used the retention function and dating errors from the first study to predict the distribution of the actual dates of colloquia recalled as being within a 5-month period. In Experiment 3, the findings of the first study were replicated with colloquia given by, instead of for, the subjects.

Facilitation shifts paradigms and can amplify coastal Restoration efforts

Restoration has been elevated as an important strategy to reverse the decline of coastal wetlands worldwide. Current practice in restoration science emphasizes minimizing competition between outplanted propagules to maximize planting success. This paradigm persists despite the fact that foundational theory in ecology demonstrates that positive species interactions are key to organism success under high physical stress, such as recolonization of bare substrate. As evidence of how entrenched this restoration paradigm is, our survey of 25 restoration organizations in 14 states in the United States revealed that >95% of these agencies assume minimizing negative interactions (i.e., competition) between outplants will maximize propagule growth. Restoration experiments in both Western and Eastern Atlantic salt marshes demonstrate, however, that a simple change in planting configuration (placing propagules next to, rather than at a distance from, each other) results in harnessing facilitation and increased yields by 107% on average. Thus, small adjustments in restoration design may catalyze untapped positive species interactions, resulting in significantly higher restoration success with no added cost. As positive interactions between organisms commonly occur in coastal ecosystems (especially in more physically stressful areas like uncolonized substrate) and conservation resources are limited, transformation of the coastal restoration paradigm to incorporate facilitation theory may enhance conservation efforts, shoreline defense, and provisioning of ecosystem services such as fisheries production.

An Investigation into the Efficacy of a pH-Sensitive Material for Milk Spoilage Detection

Ambiguous expiration dates on milk cartons can mislead consumers into prematurely disposing unspoiled milk and potentially drinking spoiled milk. These misconceptions can lead to wastage that harms the environment, or potential discomfort and illness. The incorporation of pH-sensitive indicators into plastic milk cartons has the potential to replace stamped expiration dates as the traditional method of milk spoilage indication. We studied the correlation between bacteria count and milk pH to establish pH measurement as an effective indicator of milk quality. We then developed a method for incorporating bromothymol blue, a pH-sensitive color-changing dye, into a hydrogel made of polyacrylamide. This hydrogel can be added to existing packaging for milk or other products with detectable pH changes. Additionally, we conducted a consumer survey and analyzed current food packaging trends in the market. Our research indicates that a spoilage-indicating milk carton could have strong market potential as food industries increasingly adopt intelligent packaging designs.

Eficiencia de implantación de la secuencia anual trigo - soja, mediante los sistemas de siembra directa y con labranza previa

p.181-186

Fechas medias estimadas de primeras y últimas temperaturas mínimas perjudiciales para los cultivos en la Argentina

p.193-211

Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment

The paper considers the single machine due date assignment and scheduling problems with n jobs in which the due dates are to be obtained from the processing times by adding a positive slack q. A schedule is feasible if there are no tardy jobs and the job sequence respects given precedence constraints. The value of q is chosen so as to minimize a function ϕ(F,q) which is non-decreasing in each of its arguments, where F is a certain non-decreasing earliness penalty function. Once q is chosen or fixed, the corresponding scheduling problem is to find a feasible schedule with the minimum value of function F. In the case of arbitrary precedence constraints the problems under consideration are shown to be NP-hard in the strong sense even for F being total earliness. If the precedence constraints are defined by a series-parallel graph, both scheduling and due date assignment problems are proved solvable in time, provided that F is either the sum of linear functions or the sum of exponential functions. The running time of the algorithms can be reduced to if the jobs are independent. Scope and purpose We consider the single machine due date assignment and scheduling problems and design fast algorithms for their solution under a wide range of assumptions. The problems under consideration arise in production planning when the management is faced with a problem of setting the realistic due dates for a number of orders. The due dates of the orders are determined by increasing the time needed for their fulfillment by a common positive slack. If the slack is set to be large enough, the due dates can be easily maintained, thereby producing a good image of the firm. This, however, may result in the substantial holding cost of the finished products before they are brought to the customer. The objective is to explore the trade-off between the size of the slack and the arising holding costs for the early orders.

Pre-emptive scheduling problems with controllable processing times

We consider a range of single machine and identical parallel machine pre-emptive scheduling models with controllable processing times. For each model we study a single criterion problem to minimize the compression cost of the processing times subject to the constraint that all due dates should be met. We demonstrate that each single criterion problem can be formulated in terms of minimizing a linear function over a polymatroid, and this justifies the greedy approach to its solution. A unified technique allows us to develop fast algorithms for solving both single criterion problems and bicriteria counterparts.

A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date

We develop a fully polynomial-time approximation scheme (FPTAS) for minimizing the weighted total tardiness on a single machine, provided that all due dates are equal. The FPTAS is obtained by converting an especially designed pseudopolynomial dynamic programming algorithm.

Schedules with due-date assignment and position-dependent processing times

Single machine scheduling problems are considered, in which the processing of jobs depend on positions of the jobs in a schedule and the due-dates are assigned either according to the CON rule (a due-date common to all jobs is chosen) or according to the SLK rule (the due-dates are computed by increasing the actual processing times of each job by a slack, common to all jobs). Polynomial-time dynamic programming algorithms are proposed for the problems with the objective functions that include the cost of assigning the due-dates, the total cost of disgarded jobs (which are not scheduled) and, possibly, the total earliness of the scheduled jobs.

Single machine scheduling and due date assignment with positionally dependent processing times

We consider single machine scheduling and due date assignment problems in which the processing time of a job depends on its position in a processing sequence. The objective functions include the cost of changing the due dates, the total cost of discarded jobs that cannot be completed by their due dates and, possibly, the total earliness of the scheduled jobs. We present polynomial-time dynamic programming algorithms in the case of two popular due date assignment methods: CON and SLK. The considered problems are related to mathematical models of cooperation between the manufacturer and the customer in supply chain scheduling.

Preemptive scheduling on uniform parallel machines with controllable job processing times

In this paper, we provide a unified approach to solving preemptive scheduling problems with uniform parallel machines and controllable processing times. We demonstrate that a single criterion problem of minimizing total compression cost subject to the constraint that all due dates should be met can be formulated in terms of maximizing a linear function over a generalized polymatroid. This justifies applicability of the greedy approach and allows us to develop fast algorithms for solving the problem with arbitrary release and due dates as well as its special case with zero release dates and a common due date. For the bicriteria counterpart of the latter problem we develop an efficient algorithm that constructs the trade-off curve for minimizing the compression cost and the makespan.

Relating sardine recruitment in the Northern Benguela to satellite-derived sea surface height using a neural network pattern recognition approach

Processes of enrichment, concentration and retention are thought to be important for the successful recruitment of small pelagic fish in upwelling areas, but are difficult to measure. In this study, a novel approach is used to examine the role of spatio-temporal oceanographic variability on recruitment success of the Northern Benguela sardine Sardinops sagax. This approach applies a neural network pattern recognition technique, called a self-organising map (SOM), to a seven-year time series of satellite-derived sea level data. The Northern Benguela is characterised by quasi-perennial upwelling of cold, nutrient-rich water and is influenced by intrusions of warm, nutrient-poor Angola Current water from the north. In this paper, these processes are categorised in terms of their influence on recruitment success through the key ocean triad mechanisms of enrichment, concentration and retention. Moderate upwelling is seen as favourable for recruitment, whereas strong upwelling, weak upwelling and Angola Current intrusion appear detrimental to recruitment success. The SOM was used to identify characteristic patterns from sea level difference data and these were interpreted with the aid of sea surface temperature data. We found that the major oceanographic processes of upwelling and Angola Current intrusion dominated these patterns, allowing them to be partitioned into those representing recruitment favourable conditions and those representing adverse conditions for recruitment. A marginally significant relationship was found between the index of sardine recruitment and the frequency of recruitment favourable conditions (r super(2) = 0.61, p = 0.068, n = 6). Because larvae are vulnerable to environmental influences for a period of at least 50 days after spawning, the SOM was then used to identify windows of persistent favourable conditions lasting longer than 50 days, termed recruitment favourable periods (RFPs). The occurrence of RFPs was compared with back-calculated spawning dates for each cohort. Finally, a comparison of RFPs with the time of spawning and the index of recruitment showed that in years where there were 50 or more days of favourable conditions following spawning, good recruitment followed (Mann-Whitney U-test: p = 0.064, n = 6). These results show the value of the SOM technique for describing spatio-temporal variability in oceanographic processes. Variability in these processes appears to be an important factor influencing recruitment in the Northern Benguela sardine, although the available data time series is currently too short to be conclusive. Nonetheless, the analysis of satellite data, using a neural network pattern-recognition approach, provides a useful framework for investigating fisheries recruitment problems.

A couple of embroiled sheets of Miguel Barnades Manaider and Esteban de Prado in the Herbaria of Real Colegio Alfonso XII of San Lorenzo de El Escorial (Madrid)

In this paper we present a couple of sheets of Umbelliferae that are preserved in the RCAXII herbaria. One of them, Selinum carvifolia, where collected in the Gredos Mountains by Miguel Barnades Mainader and was identified by his son Miguel Barnades Clarís. The other, Tragium flabellifolium, was collected in Mieres (Asturias) by Esteban de Prado and identified by Mariano La Gasca.