Entre el Gulag y el supermercado : en busca de Alexander Zinoviev

Aquest treball, que còpia en part el títol del llibre de Symons, intenta configurar-se també sobre un doble plànol expositiu. El priemr pla el primer objectiu-, es el més obvi: oferir un panorama del contingut de les principals obres d'un autor, Alexander Zinoviev, i tractar de contextualitzar-les (efectuant per allò incursions al pensament d'altres autors - a mode de breus razzies predatòries). Però el treball aspira a incloure una segona trama: l'intent d'observar una trajectòria intel·lectual determinada -en aquest cas, la de Zinoviev- de d'una certa distància i esbrinar si pot extreure's alguna lliçó no ja de les teories que l'autor va consignar per escrit, sinó de l'actitud existencial i intel·lectual amb la que un individu es va enfrontar als cataclismes produïts pels successius derrumbaments i encumbraments de les grans ideologies de la seva època.

De censuris Suarez ; De irregularitatibus / Collet. De simonia ; De oratione in communi [etc.] / Suarez. De oratione dominica / Natalis Alexander

Collection : Theologiae cursus completus ; 17

Bernstein's problem on weighted polynomial approximation

We formulate a necessary and sufficient condition for polynomials to be dense in a space of continuous functions on the real line, with respect to Bernstein's weighted uniform norm. Equivalently, for a positive finite measure [lletra "mu" minúscula de l'alfabet grec] on the real line we give a criterion for density of polynomials in Lp[lletra "mu" minúscula de l'alfabet grec entre parèntesis].

[1-1-20], Angus [Alexander] capitaine de l'équipe d'Écosse [de rugby posant avant le match France-Écosse au Parc des princes] : [photographie de presse] / [Agence Rol]

Référence bibliographique : Rol, 57442

A polynomial algorithm for special case of the one-machine scheduling problem with time-lags

The standard one-machine scheduling problem consists in schedulinga set of jobs in one machine which can handle only one job at atime, minimizing the maximum lateness. Each job is available forprocessing at its release date, requires a known processing timeand after finishing the processing, it is delivery after a certaintime. There also can exists precedence constraints between pairsof jobs, requiring that the first jobs must be completed beforethe second job can start. An extension of this problem consistsin assigning a time interval between the processing of the jobsassociated with the precedence constrains, known by finish-starttime-lags. In presence of this constraints, the problem is NP-hardeven if preemption is allowed. In this work, we consider a specialcase of the one-machine preemption scheduling problem with time-lags, where the time-lags have a chain form, and propose apolynomial algorithm to solve it. The algorithm consist in apolynomial number of calls of the preemption version of the LongestTail Heuristic. One of the applicability of the method is to obtainlower bounds for NP-hard one-machine and job-shop schedulingproblems. We present some computational results of thisapplication, followed by some conclusions.

Informe del crucero Krill III, a bordo del barco de investigación científica Alexander Agassiz de la Universidad de California y estadía en el departamento de oceanología de Montemar-Chile

Expone los resultados del análisis de las muestras de zooplancton colectados frente al Perú, para cumplir uno de los objetivos, la obtención de huevos y larvas de peces y Myctophidoe en diversas fases de desarrollo.

Kutenai tales / by Franz Boas ; together with texts collected by Alexander Francis Chamberlain

Collection : Bulletin ; 59

Comparison of the polynomial model against explicit measurements of noise components for different mammography systems.

Given the adverse impact of image noise on the perception of important clinical details in digital mammography, routine quality control measurements should include an evaluation of noise. The European Guidelines, for example, employ a second-order polynomial fit of pixel variance as a function of detector air kerma (DAK) to decompose noise into quantum, electronic and fixed pattern (FP) components and assess the DAK range where quantum noise dominates. This work examines the robustness of the polynomial method against an explicit noise decomposition method. The two methods were applied to variance and noise power spectrum (NPS) data from six digital mammography units. Twenty homogeneously exposed images were acquired with PMMA blocks for target DAKs ranging from 6.25 to 1600 µGy. Both methods were explored for the effects of data weighting and squared fit coefficients during the curve fitting, the influence of the additional filter material (2 mm Al versus 40 mm PMMA) and noise de-trending. Finally, spatial stationarity of noise was assessed.Data weighting improved noise model fitting over large DAK ranges, especially at low detector exposures. The polynomial and explicit decompositions generally agreed for quantum and electronic noise but FP noise fraction was consistently underestimated by the polynomial method. Noise decomposition as a function of position in the image showed limited noise stationarity, especially for FP noise; thus the position of the region of interest (ROI) used for noise decomposition may influence fractional noise composition. The ROI area and position used in the Guidelines offer an acceptable estimation of noise components. While there are limitations to the polynomial model, when used with care and with appropriate data weighting, the method offers a simple and robust means of examining the detector noise components as a function of detector exposure.

[Phot. de Zuckmantel en Silésie autrichienne (aujourd'hui Cukmantl, Tchécoslovaquie) par J. Springer et J. Fietz en 1881, don Alexander Jawornicki en 1889]

Donateur : Jawornicki, Alexandre (18..-19..?)

[18 phot. de Galicie par A. Szubert, phot. à Cracovie, don Alexander Jawornicki en 1889]

Donateur : Jawornicki, Alexandre (18..-19..?)

Genetic parameters for growth traits in pigs estimated using third degree polynomial functions

Selostus: Sian kasvuominaisuuksien perinnölliset tunnusluvut arvioituna kolmannen asteen polynomifunktion avulla

Diet and the risk of head and neck cancer: a pooled analysis in the INHANCE consortium.

We investigated the association between diet and head and neck cancer (HNC) risk using data from the International Head and Neck Cancer Epidemiology (INHANCE) consortium. The INHANCE pooled data included 22 case-control studies with 14,520 cases and 22,737 controls. Center-specific quartiles among the controls were used for food groups, and frequencies per week were used for single food items. A dietary pattern score combining high fruit and vegetable intake and low red meat intake was created. Odds ratios (OR) and 95% confidence intervals (CI) for the dietary items on the risk of HNC were estimated with a two-stage random-effects logistic regression model. An inverse association was observed for higher-frequency intake of fruit (4th vs. 1st quartile OR = 0.52, 95% CI = 0.43-0.62, p (trend) < 0.01) and vegetables (OR = 0.66, 95% CI = 0.49-0.90, p (trend) = 0.01). Intake of red meat (OR = 1.40, 95% CI = 1.13-1.74, p p (trend) < 0.01) was positively associated with HNC risk. Higher dietary pattern scores, reflecting high fruit/vegetable and low red meat intake, were associated with reduced HNC risk (per score increment OR = 0.90, 95% CI = 0.84-0.97).