Search results for " Programming"

Fetal programming as the cause of all the evils in adult humans: atherosclerosis and coronary heart disease included

2020

〈 Collection 2020/3 About us Imprint Open access Editorial board Contact Vision and mission Services Picture credits Disclaimer Congresses Job vacancies For readers Subscription Current issue Archives Search For authors Guidelines Copyright Submission Article types Supplements For advertisers Media data Portfolio Reader poll Reprints Offer Sales team Collection 2020/3 REVIEW ARTICLE Fetal programming as the cause of all the evils in adult humans: atherosclerosis and coronary heart disease included DOI: https://doi.org/10.4414/cvm.2020.02113 Publication Date: 11.06.2020 Cardiovasc Med. 2020;23:w02113 Balistreri Carmela R. Affiliationskeyboard_arrow_down Summary The theory of David Barker on …

Comparing the Economic Effectiveness of Various Adaptive Schemes for the c Chart

2014

In an attempt to improve the effectiveness of statistical process control (SPC) procedures, a variety of adaptive schemes has been developed in the last decades. However, considering control charts for attributes, relatively few works about adaptive schemes have been proposed, and most of them were proposed only recently. The common characteristic of those schemes is that one or more chart parameters are allowed to adaptively vary during the SPC operations according to the sampling information history, typically the current point plotted on the chart. In this way, the adaptive schemes are smarter than the related static ones, but they are also more complicated in terms of implementation. Th…

La Sala Parpalló en el Centre Cultural La Beneficència (1995-1999)

2020

During the period 1995-1999, the Sala Parpalló was located in the Beneficència Cultural Center of Valencia, sharing the place with the spaces of the Museum of Prehistory, the Museum of Ethnology and the IVEI. In the investigation it exposed a technical file for each of the 57 self-produced exhibitions carried out in the period and a selection of the studies that accompanied them: the files are displayed chronologically according to the procedures used. The work concludes with the analysis of the objectives that were mainly all the programming: 1) Sala Parpalló as an integrated project; 2) Studies and exhibitions around the Valencian Cultural Imaginary; 3) Analysis of the postmodern crisis; …

ADAPT - Advanced Prediction Models for Trajectory-Based Operations (TBO)

2018

ATLAS operations in the GridKa T1/T2 Cloud

2011

The ATLAS GridKa cloud consists of the GridKa Tier1 centre and 12 Tier2 sites from five countries associated to it. Over the last years a well defined and tested operation model evolved. Several core cloud services need to be operated and closely monitored: distributed data management, involving data replication, deletion and consistency checks; support for ATLAS production activities, which includes Monte Carlo simulation, reprocessing and pilot factory operation; continuous checks of data availability and performance for user analysis; software installation and database setup. Of crucial importance is good communication between sites, operations team and ATLAS as well as efficient cloud l…

SIOPRED performance in a Forecasting Blind Competition

2012

In this paper we present the results obtained by applying our automatic forecasting support system, named SIOPRED, over a data set of time series in a Forecasting Blind Competition. In order to apply our procedure for providing point forecasts it has been necessary to develop an interactive strategy for the choice of the suitable length of the seasonal cycle and the seasonality form for a generalized exponential smoothing method, which have been obtained using SIOPRED. For the choice of those essential characteristics of forecasting methods, also a certain multi-objective formulation which minimizes several measures of fitting is used. Once these specifications are established, the model pa…

Testing for local structure in spatiotemporal point pattern data

2017

The detection of clustering structure in a point pattern is one of the main focuses of attention in spatiotemporal data mining. Indeed, statistical tools for clustering detection and identification of individual events belonging to clusters are welcome in epidemiology and seismology. Local second-order characteristics provide information on how an event relates to nearby events. In this work, we extend local indicators of spatial association (known as LISA functions) to the spatiotemporal context (which will be then called LISTA functions). These functions are then used to build local tests of clustering to analyse differences in local spatiotemporal structures. We present a simulation stud…

Reaction-diffusion on dynamic inhibition areas: A bio-inspired link scheduling algorithm

2014

We present the Dynamic Inhibition Areas Reaction-Diffusion (DIA-RD) algorithm, a distributed medium access control protocol that globally maximizes the spatial reusability (number of simultaneous transmissions per unit area) of wireless sensor networks. This algorithm is able, in consequence, to minimize the number of time slots needed to schedule the set of demanded links, making it very efficient to solve the Shortest Link Schedule problem. DIA-RD combines accurate interference management, provided by the use of dynamic inhibition areas based on the physical interference model; and global intelligent behavior, provided by the bio-inspired technique known as Reaction-Diffusion. This techni…

An immune system model in discrete time based on the analogy with the central nervous system

1988

Jerne's model for the immune system formulated in terms of a neural network recently proposed by Weisbuch and Atlan is generalized to interactions with continuous coupling coefficients. It is shown that even the extended model can be solved analytically without the aid of computer simulations and exhibits one additional attractor, which corresponds to a configuration with high concentrations of active killer cells eventually causing death of the organism.

Branch and bound for the cutwidth minimization problem

2013

The cutwidth minimization problem consists of finding a linear arrangement of the vertices of a graph where the maximum number of cuts between the edges of the graph and a line separating consecutive vertices is minimized. We first review previous approaches for special classes of graphs, followed by lower bounds and then a linear integer formulation for the general problem. We then propose a branch-and-bound algorithm based on different lower bounds on the cutwidth of partial solutions. Additionally, we introduce a Greedy Randomized Adaptive Search Procedure (GRASP) heuristic to obtain good initial solutions. The combination of the branch-and-bound and GRASP methods results in optimal solu…