Search results for "computational"
showing 10 items of 5884 documents
Designing Cognitive Cities
2018
The following text intends to give an introduction into some of the basic ideas which determined the conception of this book. Thus, the first part of this article introduces the terms “City”, “Smart City” and “Cognitive City”. The second part gives an overview of design theories and approaches such as Action Design Research and Ontological Design (a concept in-the-making), in order to deduce from a theoretical point of view some of the principles that needs to be taken into account when designing the Cognitive City. The third part highlights some concrete techniques that can be usefully applied to the problem of citizen communication for Cognitive Cities (namely Metaheuristics, Fuzzy Sets a…
Intelligent agents for feature modelling in computer aided design
2017
Abstract CAD modelling can be referred to as the process of generating an integrated multiple view model as a representation of multiple views of engineering design. In many situations, a change in the model of one view may conflict with the models of other views. In such situations, the model of some views needs to be adapted in order to make all models consistent. Thus, CAD models should be capable of adapting themselves to new situations. Recently, agent based technologies have been considered in order to increase both knowledge level and intelligence of real and virtual objects. The contribution of this paper consists in introducing the intelligent agents in intelligent CAD modelling. T…
Fuzzy Modeling for Uncertain Nonlinear Systems Using Fuzzy Equations and Z-Numbers
2018
In this paper, the uncertainty property is represented by Z-number as the coefficients and variables of the fuzzy equation. This modification for the fuzzy equation is suitable for nonlinear system modeling with uncertain parameters. Here, we use fuzzy equations as the models for the uncertain nonlinear systems. The modeling of the uncertain nonlinear systems is to find the coefficients of the fuzzy equation. However, it is very difficult to obtain Z-number coefficients of the fuzzy equations.
A singular elliptic equation and a related functional
2021
We study a class of Dirichlet boundary value problems whose prototype is [see formula in PDF] where 0 < p < 1 and f belongs to a suitable Lebesgue space. The main features of this problem are the presence of a singular term |u|p−2u and a datum f which possibly changes its sign. We introduce a notion of solution in this singular setting and we prove an existence result for such a solution. The motivation of our notion of solution to problem above is due to a minimization problem for a non–differentiable functional on [see formula in PDF] whose formal Euler–Lagrange equation is an equation of that type. For nonnegative solutions a uniqueness result is obtained.
Graph-theoretical derivation of brain structural connectivity
2020
Brain connectivity at the single neuron level can provide fundamental insights into how information is integrated and propagated within and between brain regions. However, it is almost impossible to adequately study this problem experimentally and, despite intense efforts in the field, no mathematical description has been obtained so far. Here, we present a mathematical framework based on a graph-theoretical approach that, starting from experimental data obtained from a few small subsets of neurons, can quantitatively explain and predict the corresponding full network properties. This model also changes the paradigm with which large-scale model networks can be built, from using probabilisti…
Adjusted bat algorithm for tuning of support vector machine parameters
2016
Support vector machines are powerful and often used technique of supervised learning applied to classification. Quality of the constructed classifier can be improved by appropriate selection of the learning parameters. These parameters are often tuned using grid search with relatively large step. This optimization process can be done computationally more efficiently and more precisely using stochastic search metaheuristics. In this paper we propose adjusted bat algorithm for support vector machines parameter optimization and show that compared to the grid search it leads to a better classifier. We tested our approach on standard set of benchmark data sets from UCI machine learning repositor…
Do Randomized Algorithms Improve the Efficiency of Minimal Learning Machine?
2020
Minimal Learning Machine (MLM) is a recently popularized supervised learning method, which is composed of distance-regression and multilateration steps. The computational complexity of MLM is dominated by the solution of an ordinary least-squares problem. Several different solvers can be applied to the resulting linear problem. In this paper, a thorough comparison of possible and recently proposed, especially randomized, algorithms is carried out for this problem with a representative set of regression datasets. In addition, we compare MLM with shallow and deep feedforward neural network models and study the effects of the number of observations and the number of features with a special dat…
Comparing interactive evolutionary multiobjective optimization methods with an artificial decision maker
2021
AbstractSolving multiobjective optimization problems with interactive methods enables a decision maker with domain expertise to direct the search for the most preferred trade-offs with preference information and learn about the problem. There are different interactive methods, and it is important to compare them and find the best-suited one for solving the problem in question. Comparisons with real decision makers are expensive, and artificial decision makers (ADMs) have been proposed to simulate humans in basic testing before involving real decision makers. Existing ADMs only consider one type of preference information. In this paper, we propose ADM-II, which is tailored to assess several …
Variable neighborhood descent for the incremental graph drawing
2017
Abstract Graphs are used to represent reality in several areas of knowledge. Drawings of graphs have many applications, from project scheduling to software diagrams. The main quality desired for drawings of graphs is readability, and crossing reduction is a fundamental aesthetic criterion for a good representation of a graph. In this paper we target the edge crossing reduction in the context of incremental graph drawing, in which we want to preserve the layout of a graph over successive drawings. We propose a hybrid method based on the GRASP (Greedy Randomized Adaptive Search Procedure) and VND (Variable Neighborhood Descent) methodologies and compare it with previous methods via simulation.
What is science without replication?
2016
None