Time-bounded distributed QoS-aware service configuration in heterogeneous cooperative environments

The scarcity and diversity of resources among the devices of heterogeneous computing environments may affect their ability to perform services with specific Quality of Service constraints, particularly in dynamic distributed environments where the characteristics of the computational load cannot always be predicted in advance. Our work addresses this problem by allowing resource constrained devices to cooperate with more powerful neighbour nodes, opportunistically taking advantage of global distributed resources and processing power. Rather than assuming that the dynamic configuration of this cooperative service executes until it computes its optimal output, the paper proposes an anytime approach that has the ability to tradeoff deliberation time for the quality of the solution. Extensive simulations demonstrate that the proposed anytime algorithms are able to quickly find a good initial solution and effectively optimise the rate at which the quality of the current solution improves at each iteration, with an overhead that can be considered negligible.

Direct search optimization application programming interface with remote access

Search Optimization methods are needed to solve optimization problems where the objective function and/or constraints functions might be non differentiable, non convex or might not be possible to determine its analytical expressions either due to its complexity or its cost (monetary, computational, time,...). Many optimization problems in engineering and other fields have these characteristics, because functions values can result from experimental or simulation processes, can be modelled by functions with complex expressions or by noise functions and it is impossible or very difficult to calculate their derivatives. Direct Search Optimization methods only use function values and do not need any derivatives or approximations of them. In this work we present a Java API that including several methods and algorithms, that do not use derivatives, to solve constrained and unconstrained optimization problems. Traditional API access, by installing it on the developer and/or user computer, and remote API access to it, using Web Services, are also presented. Remote access to the API has the advantage of always allow the access to the latest version of the API. For users that simply want to have a tool to solve Nonlinear Optimization Problems and do not want to integrate these methods in applications, also two applications were developed. One is a standalone Java application and the other a Web-based application, both using the developed API.

Web-based application programming interface to solve nonlinear optimization problems

Nonlinear Optimization Problems are usual in many engineering fields. Due to its characteristics the objective function of some problems might not be differentiable or its derivatives have complex expressions. There are even cases where an analytical expression of the objective function might not be possible to determine either due to its complexity or its cost (monetary, computational, time, ...). In these cases Nonlinear Optimization methods must be used. An API, including several methods and algorithms to solve constrained and unconstrained optimization problems was implemented. This API can be accessed not only as traditionally, by installing it on the developer and/or user computer, but it can also be accessed remotely using Web Services. As long as there is a network connection to the server where the API is installed, applications always access to the latest API version. Also an Web-based application, using the proposed API, was developed. This application is to be used by users that do not want to integrate methods in applications, and simply want to have a tool to solve Nonlinear Optimization Problems.

A sensitivity study of the WRF model in wind simulation for an area of high wind energy

The performance of the Weather Research and Forecast (WRF) model in wind simulation was evaluated under different numerical and physical options for an area of Portugal, located in complex terrain and characterized by its significant wind energy resource. The grid nudging and integration time of the simulations were the tested numerical options. Since the goal is to simulate the near-surface wind, the physical parameterization schemes regarding the boundary layer were the ones under evaluation. Also, the influences of the local terrain complexity and simulation domain resolution on the model results were also studied. Data from three wind measuring stations located within the chosen area were compared with the model results, in terms of Root Mean Square Error, Standard Deviation Error and Bias. Wind speed histograms, occurrences and energy wind roses were also used for model evaluation. Globally, the model accurately reproduced the local wind regime, despite a significant underestimation of the wind speed. The wind direction is reasonably simulated by the model especially in wind regimes where there is a clear dominant sector, but in the presence of low wind speeds the characterization of the wind direction (observed and simulated) is very subjective and led to higher deviations between simulations and observations. Within the tested options, results show that the use of grid nudging in simulations that should not exceed an integration time of 2 days is the best numerical configuration, and the parameterization set composed by the physical schemes MM5–Yonsei University–Noah are the most suitable for this site. Results were poorer in sites with higher terrain complexity, mainly due to limitations of the terrain data supplied to the model. The increase of the simulation domain resolution alone is not enough to significantly improve the model performance. Results suggest that error minimization in the wind simulation can be achieved by testing and choosing a suitable numerical and physical configuration for the region of interest together with the use of high resolution terrain data, if available.

Generation of Nakagami correlated fading in GNSS signals affected by ionospheric scintillation

We propose a low complexity technique to generate amplitude correlated time-series with Nakagami-m distribution and phase correlated Gaussian-distributed time-series, which is useful for the simulation of ionospheric scintillation effects in GNSS signals. To generate a complex scintillation process, the technique requires solely the knowledge of parameters Sa (scintillation index) and σφ (phase standard deviation) besides the definition of models for the amplitude and phase power spectra. The concatenation of two nonlinear memoryless transformations is used to produce a Nakagami-distributed amplitude signal from a Gaussian autoregressive process.

Time-delay and fractional derivatives

This paper proposes the calculation of fractional algorithms based on time-delay systems. The study starts by analyzing the memory properties of fractional operators and their relation with time delay. Based on the Fourier analysis an approximation of fractional derivatives through timedelayed samples is developed. Furthermore, the parameters of the proposed approximation are estimated by means of genetic algorithms. The results demonstrate the feasibility of the new perspective.

Practical simulation of GNSS signals in the presence of ionospheric scintillaton

We propose a low complexity technique to generate amplitude correlated time-series with Nakagami-m distribution and phase correlated Gaussian-distributed time-series, which is useful in the simulation of ionospheric scintillation effects during the transmission of GNSS signals. The method requires only the knowledge of parameters S4 (scintillation index) and σΦ (phase standard deviation) besides the definition of models for the amplitude and phase power spectra. The Zhang algorithm is used to produce Nakagami-distributed signals from a set of Gaussian autoregressive processes.

Self-organization and complexity theory to support evolvable production systems

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Mestre em Engenharia Electrotécnica e de Computadores

Mono(Eta(5)-cyclopentadienyl)metal(II) complexes with thienyl acetylide chromophores: synthesis, electrochemical studies, and first hyperpolarizabilities

A series of mono(eta(5)-cyclopentadienyl)metal-(II) complexes with nitro-substituted thienyl acetylide ligands of general formula [M(eta(5)-C5H5)(L)(C C{C4H2S}(n)NO2)] (M = Fe, L = kappa(2)-DPPE, n = 1,2; M = Ru, L = kappa(2)-DPPE, 2 PPh3, n = 1, 2; M = Ni, L = PPh3, n = 1, 2) has been synthesized and fully characterized by NMR, FT-IR, and UV-Vis spectroscopy. The electrochemical behavior of the complexes was explored by cyclic voltammetry. Quadratic hyperpolarizabilities (beta) of the complexes have been determined by hyper-Rayleigh scattering (HRS) measurements at 1500 nm. The effect of donor abilities of different organometallic fragments on the quadratic hyperpolarizabilities was studied and correlated with spectroscopic and electrochemical data. Density functional theory (DFT) and time-dependent DFT (TDDFT) calculations were employed to get a better understanding of the second-order nonlinear optical properties in these complexes. In this series, the complexity of the push pull systems is revealed; even so, several trends in the second-order hyperpolarizability can still be recognized. In particular, the overall data seem to indicate that the existence of other electronic transitions in addition to the main MLCT clearly controls the effectiveness of the organometallic donor ability on the second-order NLO properties of these push pull systems.

Waiting time for radiotherapy in women with cervical cancer

ABSTRACT OBJECTIVE To describe the waiting time for radiotherapy for patients with cervical cancer. METHODS This descriptive study was conducted with 342 cervical cancer cases that were referred to primary radiotherapy, in the Baixada Fluminense region, RJ, Southeastern Brazil, from October 1995 to August 2010. The waiting time was calculated using the recommended 60-day deadline as a parameter to obtaining the first cancer treatment and considering the date at which the diagnosis was confirmed, the date of first oncological consultation and date when the radiotherapy began. Median and proportional comparisons were made using the Kruskal Wallis and Chi-square tests. RESULTS Most of the women (72.2%) began their radiotherapy within 60 days from the diagnostic confirmation date. The median of this total waiting time was 41 days. This median worsened over the time period, going from 11 days (1995-1996) to 64 days (2009-2010). The median interval between the diagnostic confirmation and the first oncological consultation was 33 days, and between the first oncological consultation and the first radiotherapy session was four days. The median waiting time differed significantly (p = 0.003) according to different stages of the tumor, reaching 56 days, 35 days and 30 days for women whose cancers were classified up to IIA; from IIB to IIIB, and IVA-IVB, respectively. CONCLUSIONS Despite most of the women having had access to radiotherapy within the recommended 60 days, the implementation of procedures to define the stage of the tumor and to reestablish clinical conditions took a large part of this time, showing that at least one of these intervals needs to be improved. Even though the waiting times were ideal for all patients, the most advanced cases were quickly treated, which suggests that access to radiotherapy by women with cervical cancer has been reached with equity.

Optimal approximation of fractional derivatives through discrete-time fractions using genetic algorithms

This study addresses the optimization of rational fraction approximations for the discrete-time calculation of fractional derivatives. The article starts by analyzing the standard techniques based on Taylor series and Padé expansions. In a second phase the paper re-evaluates the problem in an optimization perspective by tacking advantage of the flexibility of the genetic algorithms.

Real time fault injection using a modified debugging infrastructure

Dependability is a critical factor in computer systems, requiring high quality validation & verification procedures in the development stage. At the same time, digital devices are getting smaller and access to their internal signals and registers is increasingly complex, requiring innovative debugging methodologies. To address this issue, most recent microprocessors include an on-chip debug (OCD) infrastructure to facilitate common debugging operations. This paper proposes an enhanced OCD infrastructure with the objective of supporting the verification of fault-tolerant mechanisms through fault injection campaigns. This upgraded on-chip debug and fault injection (OCD-FI) infrastructure provides an efficient fault injection mechanism with improved capabilities and dynamic behavior. Preliminary results show that this solution provides flexibility in terms of fault triggering and allows high speed real-time fault injection in memory elements

Real time fault injection using enhanced OCD -- a performance analysis

Fault injection is frequently used for the verification and validation of dependable systems. When targeting real time microprocessor based systems the process becomes significantly more complex. This paper proposes two complementary solutions to improve real time fault injection campaign execution, both in terms of performance and capabilities. The methodology is based on the use of the on-chip debug mechanisms present in modern electronic devices. The main objective is the injection of faults in microprocessor memory elements with minimum delay and intrusiveness. Different configurations were implemented and compared in terms of performance gain and logic overhead.

Using NEXUS compliant debuggers for real time fault injection on microprocessors

As electronic devices get smaller and more complex, dependability assurance is becoming fundamental for many mission critical computer based systems. This paper presents a case study on the possibility of using the on-chip debug infrastructures present in most current microprocessors to execute real time fault injection campaigns. The proposed methodology is based on a debugger customized for fault injection and designed for maximum flexibility, and consists of injecting bit-flip type faults on memory elements without modifying or halting the target application. The debugger design is easily portable and applicable to different architectures, providing a flexible and efficient mechanism for verifying and validating fault tolerant components.

Health self-assessment by hemodialysis patients in the Brazilian Unified Health System

ABSTRACT OBJECTIVE To examine whether the level of complexity of the services structure and sociodemographic and clinical characteristics of patients in hemodialysis are associated with the prevalence of poor health self-assessment. METHODS In this cross-sectional study, we evaluated 1,621 patients with chronic terminal kidney disease on hemodialysis accompanied in 81 dialysis services in the Brazilian Unified Health System in 2007. Sampling was performed by conglomerate in two stages and a structured questionnaire was applied to participants. Multilevel multiple logistic regression was used for data analysis. RESULTS The prevalence of poor health self-assessment was of 54.5%, and in multivariable analysis it was associated with the following variables: increasing age (OR = 1.02; 95%CI 1.01–1.02), separated or divorced marital status (OR = 0.62; 95%CI 0.34–0.88), having 12 years or more of study (OR = 0.51; 95%CI 0.37–0.71), spending more than 60 minutes in commuting between home and the dialysis service (OR = 1.80; 95%CI 1.29–2.51), having three or more self-referred diseases (OR = 2.20; 95%CI 1.33–3.62), and reporting some (OR = 2.17; 95%CI 1.66–2.84) or a lot of (OR = 2.74; 95%CI 2.04–3.68) trouble falling asleep. Individuals in treatment in dialysis services with the highest level of complexity in the structure presented less chance of performing a self-assessment of their health as bad (OR = 0.59; 95%CI 0.42–0.84). CONCLUSIONS We showed poor health self-assessment is associated with age, years of formal education, marital status, home commuting time to the dialysis service, number of self-referred diseases, report of trouble sleeping, and also with the level of complexity of the structure of health services. Acknowledging these factors can contribute to the development of strategies to improve the health of patients in hemodialysis in the Brazilian Unified Health System.