Search results for "FC"
showing 10 items of 1442 documents
Natural Language Parsing
2009
Automatic natural language processing captures a lion’s share of the attention in open information management. In one way or another, many applications have to deal with natural language input. In this chapter the authors investigate the problem of natural language parsing from the perspective of biolinguistics. They argue that the human mind succeeds in the parsing task without the help of languagespecific rules of parsing and language-specific rules of grammar. Instead, there is a universal parser incorporating a universal grammar. The main argument comes from language acquisition: Children cannot learn language specific parsing rules by rule induction due to the complexity of unconstrain…
Research of Complex Forms in Cellular Automata by Evolutionary Algorithms
2004
This paper presents an evolutionary approach for the search for new complex cellular automata. Two evolutionary algorithms are used: the first one discovers rules supporting gliders and periodic patterns, and the second one discovers glider guns in cellular automata. An automaton allowing us to simulate AND and NOT gates is discovered. The results are a step toward the general simulation of Boolean circuits by this automaton and show that the evolutionary approach is a promising technic for searching for cellular automata that support universal computation.
A New Universal Cellular Automaton Discovered by Evolutionary Algorithms
2004
In Twenty Problems in the Theory of Cellular Automata, Stephen Wolfram asks “how common computational universality and undecidability [are] in cellular automata.” This papers provides elements of answer, as it describes how another universal cellular automaton than the Game of Life (Life) was sought and found using evolutionary algorithms. This paper includes a demonstration that consists in showing that the presented R automaton can both implement any logic circuit (logic universality) and a simulation of Life (universality in the Turing sense).
Effects of GLP-1 receptor agonists on myokine levels and pro-inflammatory cytokines in patients with type 2 diabetes mellitus.
2021
Background and aims: To evaluate the change in circulating serum irisin and interleukin-6 (IL-6), in patients with type 2 diabetes mellitus (T2DM) after 6 and 12 months of GLP-1 treatment. Methods and results: Eighty-five patients with T2DM inadequately controlled with insulin or other hypoglycaemic drugs were added to dulaglutide (N° = 44) and liraglutide (N° = 41) treatment. After 6 months of GLP-1 analogues a significant decrease in BMI (p < 0.001), waist circumference (WC) (p < 0.001), fasting blood glucose (p < 0.001), HbA1c (p < 0.001), total cholesterol (p < 0.001), LDL-cholesterol (p = 0.003), triglycerides (p = 0.017), IL-6 (p = 0.045) and a significant increase in s…
Efficacy of dulaglutide on vascular health indexes in subjects with type 2 diabetes: a randomized trial
2021
Abstract Background Recent cardiovascular outcome trials have shown significant reductions in major cardiovascular (CV) events with glucagon-like peptide (GLP)-1 receptor agonists. Additionally, adjunctive surrogates for cardiovascular risk validated by some studies include arterial stiffness and endothelial function indexes. To date, no randomized trial has addressed the possible effects of antidiabetic interventional drugs such as GLP1 agonists on endothelial and arterial stiffness indexes as surrogate markers of vascular damage. Aims We aimed to evaluate metabolic efficacy and surrogate vascular efficacy endpoints of once-weekly dulaglutide (1.5 mg) plus traditional antidiabetic treatmen…
Erectile function in men with type 2 diabetes treated with dulaglutide: an exploratory analysis of the REWIND placebo-controlled randomised trial.
2021
Digital
Robust Allocation Rules in Dynamical Cooperative TU Games
2011
Robust dynamic coalitional TU games are repeated TU games where the values of the coalitions are unknown but bounded variables. We set up the game supposing that the Game Designer uses a vague measure of the extra reward that each coalition has received up to the current time to re-adjust the allocations among the players. As main result, we provide a constructive method for designing allocation rules that converge to the core of the average game. Both the set up and the solution approach also provide an insight on commonalities between coalitional games and stability theory.
Non-periodic Polynomial Splines
2015
In this chapter, we outline the essentials of the splines theory. By themselves, they are of interest for signal processing research. We use the Zak transform to derive an integral representation of polynomial splines on uniform grids. The integral representation facilitated design of different generators of spline spaces and their duals. It provides explicit expressions for interpolating and smoothing splines of any order. In forthcoming chapters, the integral representation of splines will be used for the constructions of efficient subdivision schemes and so also for the design spline-based wavelets and wavelet frames.
Adaptive Function and Brain Evolution
2012
Comparing brains is not a mere intellectual exercise but also helps to understand how the brain enables adaptive behavioral strategies to cope with an ever-changing world and how this complex organ has evolved during the phylogeny. For instance, comparative neurobiology helps understanding the specific features of our species, an issue that attracted scientists since the time of Santiago Ramon y Cajal. Following this tradition, 20 years ago Hans ten Donkelaar and Gerhard Roth started the European Conferences on Comparative Neurobiology (ECCN). This e-book includes some of the contributions to the last meeting, the sixth ECCN (Valencia, Spain; April 22-24 2010), plus selected works by severa…
A branch-and-price framework for decomposing graphs into relaxed cliques
2021
We study the family of problems of partitioning and covering a graph into/with a minimum number of relaxed cliques. Relaxed cliques are subsets of vertices of a graph for which a clique-defining property—for example, the degree of the vertices, the distance between the vertices, the density of the edges, or the connectivity between the vertices—is relaxed. These graph partitioning and covering problems have important applications in many areas such as social network analysis, biology, and disease-spread prevention. We propose a unified framework based on branch-and-price techniques to compute optimal decompositions. For this purpose, new, effective pricing algorithms are developed, and new…