On Certain Greedoid Polyhedra, Partially Indexable Scheduling Problems, and Extended Restless Bandit Allocation Indices

We present a polyhedral framework for establishing general structural properties on optimal solutions of stochastic scheduling problems, where multiple job classes vie for service resources: the existence of an optimal priority policy in a given family, characterized by a greedoid (whose feasible class subsets may receive higher priority), where optimal priorities are determined by class-ranking indices, under restricted linear performance objectives (partial indexability). This framework extends that of Bertsimas and Niño-Mora (1996), which explained the optimality of priority-index policies under all linear objectives (general indexability). We show that, if performance measures satisfy partial conservation laws (with respect to the greedoid), which extend previous generalized conservation laws, then the problem admits a strong LP relaxation over a so-called extended greedoid polytope, which has strong structural and algorithmic properties. We present an adaptive-greedy algorithm (which extends Klimov's) taking as input the linear objective coefficients, which (1) determines whether the optimal LP solution is achievable by a policy in the given family; and (2) if so, computes a set of class-ranking indices that characterize optimal priority policies in the family. In the special case of project scheduling, we show that, under additional conditions, the optimal indices can be computed separately for each project (index decomposition). We further apply the framework to the important restless bandit model (two-action Markov decision chains), obtaining new index policies, that extend Whittle's (1988), and simple sufficient conditions for their validity. These results highlight the power of polyhedral methods (the so-called achievable region approach) in dynamic and stochastic optimization.

Time Series Input Selection using Multiple Kernel Learning

In this paper we study the relevance of multiple kernel learning (MKL) for the automatic selection of time series inputs. Recently, MKL has gained great attention in the machine learning community due to its flexibility in modelling complex patterns and performing feature selection. In general, MKL constructs the kernel as a weighted linear combination of basis kernels, exploiting different sources of information. An efficient algorithm wrapping a Support Vector Regression model for optimizing the MKL weights, named SimpleMKL, is used for the analysis. In this sense, MKL performs feature selection by discarding inputs/kernels with low or null weights. The approach proposed is tested with simulated linear and nonlinear time series (AutoRegressive, Henon and Lorenz series).

Power of Attorney Handbook, January 2006

This booklet is designed to assist those who have been appointed as an attorney-in-fact, those who are considering the need for a power of attorney, or those who have an interest in the subject. This is a general overview.

Power transformations in correspondence analysis

Power transformations of positive data tables, prior to applying the correspondence analysis algorithm, are shown to open up a family of methods with direct connections to the analysis of log-ratios. Two variations of this idea are illustrated. The first approach is simply to power the original data and perform a correspondence analysis this method is shown to converge to unweighted log-ratio analysis as the power parameter tends to zero. The second approach is to apply the power transformation to thecontingency ratios, that is the values in the table relative to expected values based on the marginals this method converges to weighted log-ratio analysis, or the spectral map. Two applications are described: first, a matrix of population genetic data which is inherently two-dimensional, and second, a larger cross-tabulation with higher dimensionality, from a linguistic analysis of several books.

Input chains and industrialization

A key aspect of industrialization is theadoption of increasing-returns-to-scale, industrial,technologies. Two other, well-documented aspects arethat industrial technologies are adopted throughoutintermediate-input chains and that they use intermediateinputs intensively relative to the technologies theyreplace. These features of industrial technologiescombined imply that countries with access to similartechnologies may have very different levels ofindustrialization and income, even if the degree ofincreasing returns to scale at the firm level is relativelysmall. Furthermore, a small improvement in theproductivity of industrial technologies can trigger full-scaleindustrialization and a large increase in income.

On certain greedoid polyhedra, partially indexable scheduling problems and extended restless bandit allocation indices

We present a polyhedral framework for establishing general structural properties on optimal solutions of stochastic scheduling problems, where multiple job classes vie for service resources: the existence of an optimal priority policy in a given family, characterized by a greedoid(whose feasible class subsets may receive higher priority), where optimal priorities are determined by class-ranking indices, under restricted linear performance objectives (partial indexability). This framework extends that of Bertsimas and Niño-Mora (1996), which explained the optimality of priority-index policies under all linear objectives (general indexability). We show that, if performance measures satisfy partial conservation laws (with respect to the greedoid), which extend previous generalized conservation laws, then theproblem admits a strong LP relaxation over a so-called extended greedoid polytope, which has strong structural and algorithmic properties. We present an adaptive-greedy algorithm (which extends Klimov's) taking as input the linear objective coefficients, which (1) determines whether the optimal LP solution is achievable by a policy in the given family; and (2) if so, computes a set of class-ranking indices that characterize optimal priority policies in the family. In the special case of project scheduling, we show that, under additional conditions, the optimal indices can be computed separately for each project (index decomposition). We further apply the framework to the important restless bandit model (two-action Markov decision chains), obtaining new index policies, that extend Whittle's (1988), and simple sufficient conditions for their validity. These results highlight the power of polyhedral methods (the so-called achievable region approach) in dynamic and stochastic optimization.

Endogenous bargaining power

We present a novel approach to N-person bargaining, based on the idea thatthe agreement reached in a negotiation is determined by how the directconflict resulting from disagreement would be resolved. Our basic buildingblock is the disagreement function, which maps each set of feasible outcomesinto a disagreement point. Using this function and a weak axiom basedon individual rationality we reach a unique solution: the agreement inthe shadow of conflict, ASC. This agreement may be construed as the limitof a sequence of partial agreements, each of which is reached as a functionof the parties relative power. We examine the connection between ASC andasymmetric Nash solutions. We show the connection between the power ofthe parties embodied in the ASC solution and the bias in the SWF thatwould select ASC as an asymmetric Nash solution.

Power Fund Rollout Address, March 29, 2007

Speech by Governor Culver.

When Preference Is Not Satisfied but the Individual Is: How Power Distance Affects Person-Job Fit

One aspect of person-job fit reflects congruence between personal preferences and job design; as congruence increases so should satisfaction. We hypothesized that power distance would moderate whether fit is related to satisfaction with degree of job formalization. We obtained measures of job-formalization, fit and satisfaction, as well as organizational commitment from employees (n = 772) in a multinational firm with subsidiaries in six countries. Confirming previous findings, individuals from low power-distance cultures were most satisfied with increasing fit. However, the extent to which individuals from high power-distance cultures were satisfied did not necessarily depend on increasing fit, but mostly on whether the degree of formalization received was congruent to cultural norms. Irrespective of culture, satisfaction with formalization predicted a broad measure of organizational commitment. Apart from our novel extension of fit theory, we show how moderation can be tested in the context of polynomial response surface regression and how specific hypotheses can be tested regarding different points on the response surface.

Redes Eléctricas Digitais Power Line Communication :- Desafios e Oportunidades para Cabo Verde

Para distribuir e socializar a informação, nos mais diversos locais e das formas mais rápidas possíveis, proliferam as redes de comunicação de dados, cada vez mais presentes em nosso quotidiano, especialmente através do uso das novas tecnologias. Dentre elas, destaca-se a tecnologia Power Line Communication (PLC) Linha de força de comunicação, em que os dados são transmitidos através da corrente eléctrica. Hoje, um pouco por todo o mundo, estuda-se a alternativa viável, desafios e oportunidades de se utilizar a rede de energia eléctrica como um canal efectivo para transmissão de dados, voz e imagem, tornando-se assim, também uma rede de comunicação de dados. Ainda sem uma oferta comercial a funcionar em Cabo Verde, apesar de já terem sido feito algumas tentativas de testes de equipamentos, a Power Line Communication é já utilizada com sucesso em vários países, ligando em banda larga casas e empresas. Assim, este trabalho pretende fazer o enquadramento da tecnologia em si, bem como analisar os desafios e oportunidades da implementação do PLC no mercado Cabo-verdiano.

Sistemas de Tratamento e Disposição dos Resíduos Sólidos Compact Power & Aterro Sanitário

Na actual monografia intitulada “Sistemas de Tratamento e Disposição dos Resíduos Sólidos” adoptar-se-á as teorias clássicas de solos, para representar os resíduos sólidos urbanos. No que diz ao tratamento e disposição, diversos métodos e técnicas vão ser apresentados. Assim esta pesquisa tem como objectivo principal avaliar o Aterro Sanitário proposto para Santiago, 1999 e a tecnologia do Compact Power (pirólise/gasificação). Os dados dos resíduos sólidos ficaram restringidos aos resíduos urbanos, encontrando-se uma grande heterogeneidade e constantes questionamentos em diversas bibliografias. Analisa-se os elementos base para o dimensionamento do Aterro Sanitário abrangendo um estudo mais aprofundado sobre a estabilização dos taludes. Quanto ao Compact Power, far-se-á a apresentação da planta que incluiu duas linhas, uma para o resíduo misturado e o outro para resíduos separados, uma planta de compostagem e uma planta de conversão térmica avançada (empregando os processos de pirólises, gaseificação e oxidação a alta temperatura). Na compilação deste documento, encontra-se uma análise SWOT, com o intuito de melhor analisar as referidas tecnologias apresentadas.

The discriminatory power of MALDI-TOF mass spectrometry to differentiate between isogenic teicoplanin-susceptible and teicoplanin-resistant strains of methicillin-resistant Staphylococcus aureus.

To explore the discriminatory power of matrix-assisted laser desorption ionization-time of flight mass spectrometry (MALDI-TOF MS) for detecting subtle differences in isogenic isolates, we tested isogenic strains of Staphylococcus aureus differing in their expression of resistance to methicillin or teicoplanin. More important changes in MALDI-TOF MS spectra were found with strains differing in methicillin than in teicoplanin resistance. In comparison, very minor or no changes were recorded in pulsed-field gel electrophoresis profiles or peptidoglycan muropeptide digest patterns of these strains, respectively. MALDI-TOF MS might be useful to detect subtle strain-specific differences in ionizable components released from bacterial surfaces and not from their peptidoglycan network.