Interobserver and intraobserver variability of the apparent diffusion coefficient in treated malignant hepatic lesions on a 3.0T machine: measurements in the whole lesion versus in the area with the most restricted diffusion.

PURPOSE: To assess the inter/intraobserver variability of apparent diffusion coefficient (ADC) measurements in treated hepatic lesions and to compare ADC measurements in the whole lesion and in the area with the most restricted diffusion (MRDA). MATERIALS AND METHODS: Twenty-five patients with treated malignant liver lesions were examined on a 3.0T machine. After agreeing on the best ADC image, two readers independently measured the ADC values in the whole lesion and in the MRDA. These measurements were repeated 1 month later. The Bland-Altman method, Spearman correlation coefficients, and the Wilcoxon signed-rank test were used to evaluate the measurements. RESULTS: Interobserver variability for ADC measurements in the whole lesion and in the MRDA was 0.17 x 10(-3) mm(2)/s [-0.17, +0.17] and 0.43 x 10(-3) mm(2)/s [-0.45, +0.41], respectively. Intraobserver limits of agreement could be as low as [-0.10, +0.12] 10(-3) mm(2)/s and [-0.20, +0.33] 10(-3) mm(2)/s for measurements in the whole lesion and in the MRDA, respectively. CONCLUSION: A limited variability in ADC measurements does exist, and it should be considered when interpreting ADC values of hepatic malignancies. This is especially true for the measurements of the minimal ADC.

SMART News, Summer 2006

News from the Iowa Careers Consortium

Stronger Communities through Innovation and Creativity, 2006

This FY2007 budget will continue progress toward growing Iowa’s economy, improving student achievement and expanding health care security. With your cooperation last year we enacted the Strong Start program, the Watershed Improvement Review Board, the Iowa Values Fund, Iowa Cares, the Meth Control Act, a balanced budget and other initiatives which made for a very productive session. In a spirit of cooperation we deliver the FY2007 budget at the start of the session to allow more time for your consideration.

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.

Individual Classification of Mild Cognitive Impairment Subtypes by Support Vector Machine Analysis of White Matter DTI.

BACKGROUND AND PURPOSE: MCI was recently subdivided into sd-aMCI, sd-fMCI, and md-aMCI. The current investigation aimed to discriminate between MCI subtypes by using DTI. MATERIALS AND METHODS: Sixty-six prospective participants were included: 18 with sd-aMCI, 13 with sd-fMCI, and 35 with md-aMCI. Statistics included group comparisons using TBSS and individual classification using SVMs. RESULTS: The group-level analysis revealed a decrease in FA in md-aMCI versus sd-aMCI in an extensive bilateral, right-dominant network, and a more pronounced reduction of FA in md-aMCI compared with sd-fMCI in right inferior fronto-occipital fasciculus and inferior longitudinal fasciculus. The comparison between sd-fMCI and sd-aMCI, as well as the analysis of the other diffusion parameters, yielded no significant group differences. The individual-level SVM analysis provided discrimination between the MCI subtypes with accuracies around 97%. The major limitation is the relatively small number of cases of MCI. CONCLUSIONS: Our data show that, at the group level, the md-aMCI subgroup has the most pronounced damage in white matter integrity. Individually, SVM analysis of white matter FA provided highly accurate classification of MCI subtypes.

Beyond Smith's rule: An optimal dynamic index, rule for single machine stochastic scheduling with convex holding costs

Most research on single machine scheduling has assumedthe linearity of job holding costs, which is arguablynot appropriate in some applications. This motivates ourstudy of a model for scheduling $n$ classes of stochasticjobs on a single machine, with the objective of minimizingthe total expected holding cost (discounted or undiscounted). We allow general holding cost rates that are separable,nondecreasing and convex on the number of jobs in eachclass. We formulate the problem as a linear program overa certain greedoid polytope, and establish that it issolved optimally by a dynamic (priority) index rule,whichextends the classical Smith's rule (1956) for the linearcase. Unlike Smith's indices, defined for each class, ournew indices are defined for each extended class, consistingof a class and a number of jobs in that class, and yieldan optimal dynamic index rule: work at each time on a jobwhose current extended class has larger index. We furthershow that the indices possess a decomposition property,as they are computed separately for each class, andinterpret them in economic terms as marginal expected cost rate reductions per unit of expected processing time.We establish the results by deploying a methodology recentlyintroduced by us [J. Niño-Mora (1999). "Restless bandits,partial conservation laws, and indexability. "Forthcomingin Advances in Applied Probability Vol. 33 No. 1, 2001],based on the satisfaction by performance measures of partialconservation laws (PCL) (which extend the generalizedconservation laws of Bertsimas and Niño-Mora (1996)):PCL provide a polyhedral framework for establishing theoptimality of index policies with special structure inscheduling problems under admissible objectives, which weapply to the model of concern.

Assinatura Digital Foco Smart Card

A assinatura digital é um processo de assinatura electrónica baseado no sistema criptográfico assimétrico composto por um algoritmo ou série de algoritmos, mediante o qual é gerado um par de chaves assimétricas exclusivas e complementares. Tal como a assinatura manuscrita, a assinatura digital não pode ser falsificada, pelo que se adiciona uma função hash ao valor da chave gerada, para garantir a segurança do sistema. A assinatura digital permite, ao mesmo tempo, a identificação positiva do autor de uma mensagem (ou do signatário de um documento) e a verificação da integridade da mesma. Refira-se, porém, que a assinatura digital pode ser anexa a qualquer mensagem, seja esta decifrada ou não, apenas para que o receptor tenha a certeza da identidade do emissor e de que a mensagem chegou intacta ao destino. Baseia-se na criptografia da chave pública, que usa um algoritmo de duas chaves, a privada e a pública, diferentes mas matematicamente associadas: a primeira cria a assinatura digital e decifra os dados; a segunda verifica a assinatura e devolve-a ao formato original. O autor da mensagem mantém secreta a sua chave privada e divulga a chave pública, e vice-versa. A identidade do dono da chave pública é atestada pelo certificado digital emitido por uma entidade certificadora (uma espécie de notário). Independentemente da forma que assume, a assinatura electrónica, e a digital em particular, deve cumprir três funções: a autenticação (tal como acontece com o habitual gatafunho a que chamamos assinatura, apenas o indivíduo deve ser capaz de a reproduzir); não repudiação (quando o indivíduo assina não pode voltar atrás); e integridade (é necessário assegurar que os documentos assinados não são alterados sem o consentimento dos signatários).

The effects of uncertainty avoidance on brand performance: Marketing creativity, product innovation and the brand duration

This paper investigates the link between brand performance and cultural primes in high-risk,innovation-based sectors. In theory section, we propose that the level of cultural uncertaintyavoidance embedded in a firm determine its marketing creativity by increasing the complexityand the broadness of a brand. It determines also the rate of firm product innovations.Marketing creativity and product innovation influence finally the firm marketingperformance. Empirically, we study trademarked promotion in the Software Security Industry(SSI). Our sample consists of 87 firms that are active in SSI from 11 countries in the period1993-2000. We use the data coming from SSI-related trademarks registered by these firms,ending up with 2,911 SSI-related trademarks and a panel of 18,213 observations. We estimatea two stage model in which first we predict the complexity and the broadness of a trademarkas a measure of marketing creativity and the rate of product innovations. Among severalcontrol variables, our variable of theoretical interest is the Hofstede s uncertainty avoidancecultural index. Then, we estimate the trademark duration with a hazard model using thepredicted complexity and broadness as well as the rate of product innovations, along with thesame control variables. Our evidence confirms that the cultural avoidance affects the durationof the trademarks through the firm marketing creativity and product innovation.