Search results for " Programming"
showing 10 items of 1616 documents
Research of a Cellular Automaton Simulating Logic Gates by Evolutionary Algorithms
2003
This paper presents a method of using genetic programming to seek new cellular automata that perform computational tasks. Two genetic algorithms are used : the first one discovers a rule supporting gliders and the second one modifies this rule in such a way that some components appear allowing it to simulate logic gates. The results show that the genetic programming is a promising tool for the search of cellular automata with specific behaviors, and thus can prove to be decisive for discovering new automata supporting universal computation.
Using an Object-Oriented Approach for Scalable Flexibility in Manufacturing
2012
In this paper, it is briefly explained how to configure the different resource modules that actually control the tasks of the physical device and put together a work cell consisting of other FMS resources. Finally, an example on building a workcell using a hierarchical approach is presented.
Object Orientation and Conceptual Modeling
1993
The object oriented (OO) approach is very popular nowadays. It has proved to be a powerful and practical programming paradigm for the development of large and complex software systems, including database management systems (DBMS). Among its many benefits are significant improvements in modularity, reusability, flexibility, and extensibility. The database community has already taken advantage of the OO approach and produced a number of OO DBMSs, much faster than in the case of the previous generation of relational systems.
New Flexible Probability Distributions for Ranking Data
2015
Recently, several models have been proposed in literature for analyzing ranks assigned by people to some object. These models summarize the liking feeling for this object, possibly also with respect to a set of explanatory variables. Some recent works have suggested the use of the Shifted Binomial and of the Inverse Hypergeometric distribution for modelling the approval rate, while mixture models have been developed for taking into account the uncertainty of the ranking process. We propose two new probabilistic models, based on the Discrete Beta and the Shifted-Beta Binomial distributions, that ensure much flexibility and allow the joint modelling of the scale (approval rate) and the shape …
An Interactive Simple Indicator-Based Evolutionary Algorithm (I-SIBEA) for Multiobjective Optimization Problems
2015
This paper presents a new preference based interactive evolutionary algorithm (I-SIBEA) for solving multiobjective optimization problems using weighted hypervolume. Here the decision maker iteratively provides her/his preference information in the form of identifying preferred and/or non-preferred solutions from a set of nondominated solutions. This preference information provided by the decision maker is used to assign weights of the weighted hypervolume calculation to solutions in subsequent generations. In any generation, the weighted hypervolume is calculated and solutions are selected to the next generation based on their contribution to the weighted hypervolume. The algorithm is compa…
A decentralized solution for the constrained minimum cost flow
2010
In this paper we propose a decentralized solution to the problem of network stabilization, under flow constraints ensuring steady—state flow optimality. We propose a stabilizing strategy for network flow control with capacity constraints which drives the buffer levels arbitrarily close to a desired reference. This is a decentralized strategy optimizing the flow via the minimization of a quadratic cost of the control. A second problem characterized by non-fully connected networks is also considered, for which an exact network equilibrium is not possible. Here, the strategy, in the absence of constraints leads to a least square decentralized problem, but, unfortunately, in the presence of con…
Analysis of microsphere oblique impact with planar surfaces based on the independent friction-restitution approach
2020
The independent friction restitution closure (IFR) previously applied to describe planar oblique impact of a homogeneous sphere on an infinitely massive rough plane is applied here to microsphere collisions and is extended to describe horizontal launch experiments. The model provides analytical solutions of the motion equations based on a unique set of values of the coefficients of normal and tangential restitution and friction. Comparison with experimental data in literature for the impact of microspheres of diameter <100 mu m yields a satisfactory agreement between experimentation and theory.
Independent friction-restitution modeling of two-disk collisions
2021
[EN] The oblique collisions between two axisymmetric disks moving on a flat horizontal surface are described in terms of impact modeling based on the assumption that normal and tangential restitution mechanisms operate independently of friction. Describing these mechanisms in terms of the usual Coulomb formulation, the model allows for an interpretation of some ¿anomalous¿ experimental data reported in the literature. These experimental data, corresponding to the variation of the coefficients of friction and tangential restitution with the impact angle, remained unexplained in classic formulations, are understood within the framework of the independent friction-restitution closure. Experime…
An operator view on alliances in politics
2015
We introduce the concept of an {\em operator decision making technique} and apply it to a concrete political problem: should a given political party form a coalition or not? We focus on the situation of three political parties, and divide the electorate into four groups: partisan supporters of each party and a group of undecided voters. We consider party-party interactions of two forms: shared or differing alliance attitudes. Our main results consist of time-dependent decision functions for each of the three parties, and their asymptotic values, i.e., their final decisions on whether or not to form a coalition.
On Applying Adaptive Data Structures to Multi-Player Game Playing
2013
In the field of game playing, the focus has been on two-player games, such as Chess and Go, rather than on multi-player games, with dominant multi-player techniques largely being an extension of two-player techniques to an \(N\)-player environment. To address the problem of multiple opponents, we propose the merging of two previously unrelated fields, namely those of multi-player game playing and Adaptive Data Structures (ADS). We present here a novel move-ordering heuristic for a dominant multi-player game playing algorithm, namely the Best-Reply Search (BRS). Our enhancement uses an ADS to rank the opponents in terms of their respective threat levels to the player modeled by the AI algori…