Search results for "COMPUTATION"

Integrated computational and experimental approaches for the identification of new molecules with readthrough activity on premature termination codon…

2015

Time-domain effective-one-body gravitational waveforms for coalescing compact binaries with nonprecessing spins, tides and self-spin effects

2018

We present TEOBResumS, a new effective-one-body (EOB) waveform model for nonprecessing (spin-aligned) and tidally interacting compact binaries.Spin-orbit and spin-spin effects are blended together by making use of the concept of centrifugal EOB radius. The point-mass sector through merger and ringdown is informed by numerical relativity (NR) simulations of binary black holes (BBH) computed with the SpEC and BAM codes. An improved, NR-based phenomenological description of the postmerger waveform is developed.The tidal sector of TEOBResumS describes the dynamics of neutron star binaries up to merger and incorporates a resummed attractive potential motivated by recent advances in the post-Newt…

Web mining e Application Programming Interfaces: caratteristiche, strumenti, prospettive e limiti

2014

Data-Driven Interactive Multiobjective Optimization Using a Cluster-Based Surrogate in a Discrete Decision Space

2019

In this paper, a clustering based surrogate is proposed to be used in offline data-driven multiobjective optimization to reduce the size of the optimization problem in the decision space. The surrogate is combined with an interactive multiobjective optimization approach and it is applied to forest management planning with promising results. peerReviewed

Data-Driven Evolutionary Optimization: An Overview and Case Studies

2019

Most evolutionary optimization algorithms assume that the evaluation of the objective and constraint functions is straightforward. In solving many real-world optimization problems, however, such objective functions may not exist, instead computationally expensive numerical simulations or costly physical experiments must be performed for fitness evaluations. In more extreme cases, only historical data are available for performing optimization and no new data can be generated during optimization. Solving evolutionary optimization problems driven by data collected in simulations, physical experiments, production processes, or daily life are termed data-driven evolutionary optimization. In this…

Predicting the availability of users' devices in Decentralized Online Social Networks

2018

The understanding of the user temporal behavior is a crucial aspect for all those systems that rely on user resources for daily operations, such as decentralized online social networks (DOSNs). Indeed, DOSNs exploit the devices of their users to take on and share the tasks needed to provide services such as storing the published data. In the last years, the increasing popularity of DOSN services has changed the way of how people interact with each other by enabling users to connect to these services at any time by using their personal devices (such as notebooks or smartphones). As a result, the availability of data in these systems is strongly affected (or reflected) by the temporal behavio…

Data-driven Interactive Multiobjective Optimization : Challenges and a Generic Multi-agent Architecture

2020

In many decision making problems, a decision maker needs computer support in finding a good compromise between multiple conflicting objectives that need to be optimized simultaneously. Interactive multiobjective optimization methods have a lot of potential for solving such problems. However, the growth of complexity in problem formulations and the abundance of data bring new challenges to be addressed by decision makers and method developers. On the other hand, advances in the field of artificial intelligence provide opportunities in this respect. We identify challenges and propose directions of addressing them in interactive multiobjective optimization methods with the help of multiple int…

On approaches for solving computationally expensive multiobjective optimization problems

2016

In this thesis, we consider solving computationally expensive multiobjective optimization problems that take into account the preferences of a decision maker (DM). The aim is to support the DM in identifying the most preferred solution for problems that have several conflicting objectives and when the evaluation of the candidate solutions is time consuming. This is conducted by replacing computationally expensive functions with computationally inexpensive functions, known as surrogates. First, based on a literature survey, we introduce two frameworks, i.e., a sequential and an adaptive framework, based on which surrogate-based methods are classified and compared. We then identify relevant cha…

Sobre substitució lingüística i autòmats cel.lulars (SLAC): decurs de la investigació

2010

Hem optat per focalitzar la nostra investigació, tot i l'ampla aplicabilitat de la recerca, en la detecció del futur de la nostra llengua a partir dels pressupòsits de la Psicologia Social Computacional. I això mitjançant la utilització de la simulació informàtica, basada en els autòmats cel·lulars, que ha donat els primers resultats que presentem i explicitem en la nostra aportació a l'ANUARI. Així, hi abordem el futur de la llengua pròpia a partir de la conducta referida als parlants del País Valencià i amb la intenció d'esbrinar la reversió de la substitució lingüística.

Inductive inference of recursive functions: complexity bounds

1991

This survey includes principal results on complexity of inductive inference for recursively enumerable classes of total recursive functions. Inductive inference is a process to find an algorithm from sample computations. In the case when the given class of functions is recursively enumerable it is easy to define a natural complexity measure for the inductive inference, namely, the worst-case mindchange number for the first n functions in the given class. Surely, the complexity depends not only on the class, but also on the numbering, i.e. which function is the first, which one is the second, etc. It turns out that, if the result of inference is Goedel number, then complexity of inference ma…